{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"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":"D23","name":"Boundary Type-Coupling","shortDescription":{"text":"Boundary Type-Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D23"},{"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":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AC1","name":"Text alternatives","shortDescription":{"text":"Text alternatives"},"helpUri":"https://codehealth.canine.dev/dimensions/AC1"},{"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":"AC4","name":"Keyboard semantics","shortDescription":{"text":"Keyboard semantics"},"helpUri":"https://codehealth.canine.dev/dimensions/AC4"},{"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":"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":"AX6","name":"Interface segregation","shortDescription":{"text":"Interface segregation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX6"},{"id":"C1","name":"Data Protection","shortDescription":{"text":"Data Protection"},"helpUri":"https://codehealth.canine.dev/dimensions/C1"},{"id":"C2","name":"Access Controls","shortDescription":{"text":"Access Controls"},"helpUri":"https://codehealth.canine.dev/dimensions/C2"},{"id":"C3","name":"Audit Trail","shortDescription":{"text":"Audit Trail"},"helpUri":"https://codehealth.canine.dev/dimensions/C3"},{"id":"C4","name":"Data Retention","shortDescription":{"text":"Data Retention"},"helpUri":"https://codehealth.canine.dev/dimensions/C4"},{"id":"C5","name":"Data-Subject Rights","shortDescription":{"text":"Data-Subject Rights"},"helpUri":"https://codehealth.canine.dev/dimensions/C5"},{"id":"DM6","name":"Domain \u2194 infrastructure boundary","shortDescription":{"text":"Domain \u2194 infrastructure boundary"},"helpUri":"https://codehealth.canine.dev/dimensions/DM6"},{"id":"DM9","name":"Scattered domain decisions","shortDescription":{"text":"Scattered domain decisions"},"helpUri":"https://codehealth.canine.dev/dimensions/DM9"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"P7","name":"Outbound HTTP resilience","shortDescription":{"text":"Outbound HTTP resilience"},"helpUri":"https://codehealth.canine.dev/dimensions/P7"},{"id":"P9","name":"Domain vs controller coverage","shortDescription":{"text":"Domain vs controller coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/P9"},{"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":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"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":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"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":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"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":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"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":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"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":"mcp-server.createMcpServer (cyclomatic 556): mcp-server.createMcpServer has cyclomatic complexity 556 (threshold 15). Of this number, 47 points are the body\u0027s own statements and 509 belong to 73 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/mcp-server.ts"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3b3af2412b5171cffadbd3bfa81dfa7f09114825eb72d892a76e246fafffbe"}},{"ruleId":"D1","level":"warning","message":{"text":"StartupOrchestrator.startNodeWithWarnings (cyclomatic 268): StartupOrchestrator.startNodeWithWarnings has cyclomatic complexity 268 (threshold 15). Of this number, 240 points are the body\u0027s own statements and 28 belong to 11 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/daemon/src/domain/startup-orchestrator.ts"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eed95f9b06dd8c66076d71334f27186f5148daf314dea285b5c28b7a79aae4d"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionTransport.sendUnguarded (cyclomatic 267): SessionTransport.sendUnguarded has cyclomatic complexity 267 (threshold 15). Of this number, 184 points are the body\u0027s own statements and 83 belong to 23 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":3444}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c8189abc7f947b21adde906c76f2e9fd537b12860a50e32aee1603d637e543d"}},{"ruleId":"D1","level":"warning","message":{"text":"queue.queueCommand (cyclomatic 265): queue.queueCommand has cyclomatic complexity 265 (threshold 15). Most of this is not in the body itself: 1 of the 265 points is its own statement and the rest belongs to 40 function literals inside it that branch (lines 1458, 2381, 1336, \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/commands/queue.ts"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"798f6b2e72f205848071587377751956cbe6ab9ccabc068a3be2dd92bfa641e1"}},{"ruleId":"D1","level":"warning","message":{"text":"up.upCommand (cyclomatic 240): up.upCommand has cyclomatic complexity 240 (threshold 15). Most of this is not in the body itself: 1 of the 240 points is its own statement and the rest belongs to 9 function literals inside it that branch (lines 154, 380, 365, \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/commands/up.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24e8b3e87611ac448c78b31463d4639c2a051d8ef0c62967381be091a72105c"}},{"ruleId":"D1","level":"warning","message":{"text":"hydrate.hydrateSnapshot (cyclomatic 230): hydrate.hydrateSnapshot has cyclomatic complexity 230 (threshold 15). Of this number, 196 points are the body\u0027s own statements and 34 belong to 9 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/tui/src/hydrate.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"26fdd7b633ef869f79abf3a0e7596dea6666ea2bc1aff9569cb93f8f1f7582d4"}},{"ruleId":"D1","level":"warning","message":{"text":"queue-wake-ladder.advancePromptRefusals (cyclomatic 224): queue-wake-ladder.advancePromptRefusals has cyclomatic complexity 224 (threshold 15). Of this number, 192 points are the body\u0027s own statements and 32 belong to 14 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/daemon/src/domain/queue-wake-ladder.ts"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60565f855800ba7a48eaeae513db01ef5c957ac41d9e590eb24e7b0a9f1ff8c"}},{"ruleId":"D1","level":"warning","message":{"text":"RestoreOrchestrator.postLaunchRestore (cyclomatic 220): RestoreOrchestrator.postLaunchRestore has cyclomatic complexity 220 (threshold 15). Of this number, 188 points are the body\u0027s own statements and 32 belong to 11 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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":1947}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfff466415efafc0e29918511eff805fc22196b28759b525bafa8bcf0cd04f39"}},{"ruleId":"D1","level":"warning","message":{"text":"bundle-behaviour.describeBundleBehaviour (cyclomatic 218): bundle-behaviour.describeBundleBehaviour has cyclomatic complexity 218 (threshold 15). Of this number, 160 points are the body\u0027s own statements and 58 belong to 16 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/daemon/src/domain/bundle-behaviour.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"67687591f2e5ea0380709d98fadd823ba5626f5a26bc9d043d7fa09f376e82b9"}},{"ruleId":"D1","level":"warning","message":{"text":"render.contentLines (cyclomatic 207): render.contentLines has cyclomatic complexity 207 (threshold 15). Of this number, 191 points are the body\u0027s own statements and 16 belong to 12 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/tui/src/render.ts"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"e88bfc1ca2b767b98cff2a580e5517401d58d19041d6d1550c475b09d0c18048"}},{"ruleId":"D1","level":"warning","message":{"text":"context.contextCommand (cyclomatic 194): context.contextCommand has cyclomatic complexity 194 (threshold 15). Most of this is not in the body itself: 3 of the 194 points are its own statements and the rest belongs to 18 function items inside it that branch (a function literal at line 276, a function literal at line 723, a function literal at line 892, \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/commands/context.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d6fed893c05ea561eb091190381d7fc57f24122ffde3c1460b6c118fad053be"}},{"ruleId":"D1","level":"warning","message":{"text":"queue-stuck-sweep.runStuckSweep (cyclomatic 179): queue-stuck-sweep.runStuckSweep has cyclomatic complexity 179 (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: 4 other methods here (queue-stuck-sweep.runStuckSweep::undeliveredCandidate, queue-stuck-sweep.runStuckSweep::unclaimedCandidate, queue-stuck-sweep.runStuckSweep::custodyCandidate, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 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/daemon/src/domain/queue-stuck-sweep.ts"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c20d4fe0cdc6c37969fd96a7b9ec59581f0f98876be6d57a5ec5622441ede32"}},{"ruleId":"D1","level":"warning","message":{"text":"provider.providerRoutes (cyclomatic 167): provider.providerRoutes has cyclomatic complexity 167 (threshold 15). Most of this is not in the body itself: 3 of the 167 points are its own statements and the rest belongs to 22 function items inside it that branch (a function literal at line 366, a function literal at line 188, a function literal at line 264, \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/daemon/src/routes/provider.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"02870d2db694ef2572d146c9d4993b931344584a43c0df4b23b4aabab3840dd1"}},{"ruleId":"D1","level":"warning","message":{"text":"activity.postHook (cyclomatic 166): activity.postHook has cyclomatic complexity 166 (threshold 15). Of this number, 156 points are the body\u0027s own statements and 10 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/daemon/src/routes/activity.ts"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"f47efa2be683677b3ceda44329a87750a84993aa716f39b6741e6fcd87f9dc97"}},{"ruleId":"D1","level":"warning","message":{"text":"gateway.gatewayCommand (cyclomatic 165): gateway.gatewayCommand has cyclomatic complexity 165 (threshold 15). Most of this is not in the body itself: 1 of the 165 points is its own statement and the rest belongs to 33 function items inside it that branch (a function literal at line 192, a function literal at line 759, a function literal at line 579, \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/commands/gateway.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6940d46591884789566cbe6ba9e1218ce0765ab897d32d6c8c55cae7a49e4ba"}},{"ruleId":"D1","level":"warning","message":{"text":"attention.attentionRoutes (cyclomatic 164): attention.attentionRoutes has cyclomatic complexity 164 (threshold 15). Most of this is not in the body itself: 1 of the 164 points is its own statement and the rest belongs to 24 function literals inside it that branch (lines 21, 223, 117, \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/daemon/src/routes/attention.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc547cbb04645c3c5b4009dc39b4e213b332e84b44a1fa25ed536074b095a0e0"}},{"ruleId":"D1","level":"warning","message":{"text":"QueueRepository.updateInTransactionalContext (cyclomatic 148): QueueRepository.updateInTransactionalContext has cyclomatic complexity 148 (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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":3628}}}],"partialFingerprints":{"codehealthFindingId/v1":"15910c0842f94a08483bc3a52e532d27feb7fc7fdd459139baa19bc4378ed826"}},{"ruleId":"D1","level":"warning","message":{"text":"finite-telemetry.readTelemetryPage (cyclomatic 142): finite-telemetry.readTelemetryPage has cyclomatic complexity 142 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 107 belong to 7 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/daemon/src/domain/finite-telemetry.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e87641aa088c70a3b74aaf69d1b11bdebda4cfe7757932800d89ce5caa9554"}},{"ruleId":"D1","level":"warning","message":{"text":"startup.applySelectedHistory (cyclomatic 138): startup.applySelectedHistory has cyclomatic complexity 138 (threshold 15). Most of this is not in the body itself: 11 of the 138 points are its own statements and the rest belongs to 8 function literals inside it that branch (lines 397, 495, 402, \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/daemon/src/routes/startup.ts"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"a33a532fec57069da4be0bef6228d8f9ce5616e63ecc73f03caefc985d5be7f4"}},{"ruleId":"D1","level":"warning","message":{"text":"RestoreOrchestrator.restoreNodeWithCompensation (cyclomatic 136): RestoreOrchestrator.restoreNodeWithCompensation has cyclomatic complexity 136 (threshold 15). Of this number, 133 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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3eb5f4d0923b4260d263b88f70ffde3ec2fc3d3fcdf5e45d759107f1de8f75"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerCore.handleEvent (cyclomatic 133): RunnerCore.handleEvent has cyclomatic complexity 133 (threshold 15). Of this number, 129 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":"packages/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":1594}}}],"partialFingerprints":{"codehealthFindingId/v1":"64ab76386fede7d568c6db2de66334ca7812429405aa793a7763c51c063d9d4a"}},{"ruleId":"D1","level":"warning","message":{"text":"HerdrFollowView.apply (cyclomatic 133): HerdrFollowView.apply has cyclomatic complexity 133 (threshold 15). Of this number, 98 points are the body\u0027s own statements and 35 belong to 13 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/daemon/src/domain/terminal/herdr-follow-view.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"11545f09ea37411ba8a8dbb4bd0937b8203e72f2b5f6e9b58e57570b78884de7"}},{"ruleId":"D1","level":"warning","message":{"text":"launch.launchCommand (cyclomatic 132): launch.launchCommand has cyclomatic complexity 132 (threshold 15). Most of this is not in the body itself: 1 of the 132 points is its own statement and the rest belongs to 7 function items inside it that branch (a function literal at line 93, a function literal at line 249, a function literal at line 273, \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/commands/launch.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8c53861a522eb1b67be68f17b0e8b79d491340d46127a59a4fdde4e5255a42"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionTransport.sendClassifiedInput (cyclomatic 128): SessionTransport.sendClassifiedInput has cyclomatic complexity 128 (threshold 15). Of this number, 69 points are the body\u0027s own statements and 59 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":"packages/daemon/src/domain/session-transport.ts"},"region":{"startLine":3046}}}],"partialFingerprints":{"codehealthFindingId/v1":"71de97bc15a549b1905df53f259f1388cfd652a3d02b3c4bd3ee712c65eeef48"}},{"ruleId":"D1","level":"warning","message":{"text":"SeatHandoverService.handover (cyclomatic 128): SeatHandoverService.handover has cyclomatic complexity 128 (threshold 15). Of this number, 118 points are the body\u0027s own statements and 10 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/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c954081b6274f395c823d3b5dc156409d0a20fffb0cdcdc56e7f7bdaf01bb4"}},{"ruleId":"D1","level":"warning","message":{"text":"context-packs.contextPacksRoutes (cyclomatic 128): context-packs.contextPacksRoutes has cyclomatic complexity 128 (threshold 15). Most of this is not in the body itself: 1 of the 128 points is its own statement and the rest belongs to 16 function items inside it that branch (a function literal at line 351, a function literal at line 273, a function literal at line 99, \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/daemon/src/routes/context-packs.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af07d5915cbca87155530fe08908e377381ce004fb779330a20682a115be41f"}},{"ruleId":"D1","level":"warning","message":{"text":"terminal-window.openTerminalWindow (cyclomatic 126): terminal-window.openTerminalWindow has cyclomatic complexity 126 (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 (terminal-window.openTerminalWindow::measureWindow) 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/terminal-window.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"a806118460747293fd5a6383d417be98a2fb5eebc2f0b6cc57f76a55180c8d29"}},{"ruleId":"D1","level":"warning","message":{"text":"state.reduce (cyclomatic 125): state.reduce has cyclomatic complexity 125 (threshold 15). Of this number, 124 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/tui/src/state.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"f927e4320be0799bd9377d411f57a089a99bc3a817f614a6d23d02e2dc834dc2"}},{"ruleId":"D1","level":"warning","message":{"text":"start.startCommand (cyclomatic 116): start.startCommand has cyclomatic complexity 116 (threshold 15). Most of this is not in the body itself: 1 of the 116 points is its own statement and the rest belongs to one function literal inside it that branches (line 210). 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/commands/start.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeed8a011a2be9902209b36246658a766eedd80a2b371a1478a29d901aa959f4"}},{"ruleId":"D1","level":"warning","message":{"text":"slack.slackCommand (cyclomatic 114): slack.slackCommand has cyclomatic complexity 114 (threshold 15). Most of this is not in the body itself: 1 of the 114 points is its own statement and the rest belongs to 16 function items inside it that branch (a function literal at line 241, a function literal at line 381, a function literal at line 584, \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/commands/slack.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d7eab227bac6e1ef4e60e08ad42a628ef209d4e6078ba8885cc3b69cccc592"}},{"ruleId":"D1","level":"warning","message":{"text":"main.run::handleInput (cyclomatic 114): main.run::handleInput has cyclomatic complexity 114 (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: 3 other methods here (main.run, main.run::draw, main.run::executeAct) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 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/tui/src/main.ts"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b2b9dfd84f8cb95a46c585b0fef5b0be14041117996db1b4ad0dea4a5d0751"}},{"ruleId":"D1","level":"warning","message":{"text":"queue-wake-ladder.runWakeLadderTick (cyclomatic 112): queue-wake-ladder.runWakeLadderTick has cyclomatic complexity 112 (threshold 15). Of this number, 103 points are the body\u0027s own statements and 9 belong to 7 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/daemon/src/domain/queue-wake-ladder.ts"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be5e0f16a19862c88cfdc5673922251200a79813c8131690bd1f3953b3e90da"}},{"ruleId":"D1","level":"warning","message":{"text":"startup.createDaemon (cyclomatic 112): startup.createDaemon has cyclomatic complexity 112 (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 (startup.createDaemon::topologyDestinationAdvisory) 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/daemon/src/startup.ts"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b9e743d63fc4ab0b705b8bcc78a3a637bf8d074e6b2333298ec3edb5fca8bfd"}},{"ruleId":"D1","level":"warning","message":{"text":"PodRigInstantiator.launchExistingAgentMember (cyclomatic 109): PodRigInstantiator.launchExistingAgentMember has cyclomatic complexity 109 (threshold 15). Of this number, 100 points are the body\u0027s own statements and 9 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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":2477}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1db51c91e9b52132ed868370d28bb2df465810b5674dc2fa9d8eb2fc197180"}},{"ruleId":"D1","level":"warning","message":{"text":"host.hostCommand (cyclomatic 108): host.hostCommand has cyclomatic complexity 108 (threshold 15). Most of this is not in the body itself: 3 of the 108 points are its own statements and the rest belongs to 11 function literals inside it that branch (lines 766, 603, 991, \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/commands/host.ts"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f9a01a052f05958193fa64df2671c93f5de8f5faf31e50ec2d9824eb2cd71ec"}},{"ruleId":"D1","level":"warning","message":{"text":"gateway.gatewayRoutes (cyclomatic 108): gateway.gatewayRoutes has cyclomatic complexity 108 (threshold 15). Most of this is not in the body itself: 2 of the 108 points are its own statements and the rest belongs to 29 function items inside it that branch (a function literal at line 196, a function literal at line 250, a function literal at line 296, \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/daemon/src/routes/gateway.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"603ab2cd3c9b3f349e482b08391bc1d07de05d38426475f6ab41dadaccb9a5b8"}},{"ruleId":"D1","level":"warning","message":{"text":"bundle.bundleCommand (cyclomatic 105): bundle.bundleCommand has cyclomatic complexity 105 (threshold 15). Most of this is not in the body itself: 1 of the 105 points is its own statement and the rest belongs to 7 function items inside it that branch (a function literal at line 93, a function literal at line 286, a function literal at line 221, \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/commands/bundle.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"4877a097fb478c124df34d53df0bf41be862d168f093456c9d114d541b695126"}},{"ruleId":"D1","level":"warning","message":{"text":"SeatRuntimeSwitchService.setRuntime (cyclomatic 104): SeatRuntimeSwitchService.setRuntime has cyclomatic complexity 104 (threshold 15). Of this number, 102 points are the body\u0027s own statements and 2 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/daemon/src/domain/seat-runtime-switch-service.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed8289c8e2c0c88b797486f93b6fb2e0958dfc833a90b3d41b94c574f3bf34bc"}},{"ruleId":"D1","level":"warning","message":{"text":"agent-manifest.validateAgentSpec (cyclomatic 103): agent-manifest.validateAgentSpec has cyclomatic complexity 103 (threshold 15). Of this number, 96 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/daemon/src/domain/agent-manifest.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e8fa55d3b056f00aeda095ce57deacd8a41e388b82b72450ba015adbc1fe11"}},{"ruleId":"D1","level":"warning","message":{"text":"proof.proofCommand (cyclomatic 103): proof.proofCommand has cyclomatic complexity 103 (threshold 15). Most of this is not in the body itself: 1 of the 103 points is its own statement and the rest belongs to 10 function items inside it that branch (a function literal at line 247, a function literal at line 206, a function literal at line 188, \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/commands/proof.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d01be7fe0db897268325dc2eaa46d0d8e8cd9406d3ea7b9deaa0f1094b14eba"}},{"ruleId":"D1","level":"warning","message":{"text":"workflow.workflowCommand (cyclomatic 103): workflow.workflowCommand has cyclomatic complexity 103 (threshold 15). Most of this is not in the body itself: 1 of the 103 points is its own statement and the rest belongs to 19 function literals inside it that branch (lines 461, 688, 669, \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/commands/workflow.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"0edde66fc1cacf0b853d665b2e1837e0cdf8872fe43aab2baf96296370f47969"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkflowProjector.projectStep (cyclomatic 102): WorkflowProjector.projectStep has cyclomatic complexity 102 (threshold 15). Of this number, 45 points are the body\u0027s own statements and 57 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/daemon/src/domain/workflow-projector.ts"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"e180e715cde7198feefd02c8315ae0429e534e0f4c01e339c55657f47b15e375"}},{"ruleId":"D1","level":"warning","message":{"text":"slack-subsystem.buildSlackGatewayWire (cyclomatic 102): slack-subsystem.buildSlackGatewayWire has cyclomatic complexity 102 (threshold 15). Of this number, 44 points are the body\u0027s own statements and 58 belong to 17 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/daemon/src/domain/gateway/slack/slack-subsystem.ts"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9a42c87d111c30e2f3361bd0c1d3b28c1717a89d89d52ea536b25a4b09b71d"}},{"ruleId":"D1","level":"warning","message":{"text":"render.renderBody (cyclomatic 101): render.renderBody has cyclomatic complexity 101 (threshold 15). Of this number, 97 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":"packages/tui/src/render.ts"},"region":{"startLine":1925}}}],"partialFingerprints":{"codehealthFindingId/v1":"58011ee15b67111f1dd61b0eab147770f3e1c3f31e94d71f5ffeff40718c9fe7"}},{"ruleId":"D1","level":"warning","message":{"text":"parked-owner-consumer.makeParkedOwnerConsumerPolicy.evaluate (cyclomatic 99): parked-owner-consumer.makeParkedOwnerConsumerPolicy.evaluate has cyclomatic complexity 99 (threshold 15). Of this number, 88 points are the body\u0027s own statements and 11 belong to 8 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/daemon/src/domain/policies/parked-owner-consumer.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"734257475015d3838d6656fea121646adec4108e84726758374724bfe104aab9"}},{"ruleId":"D1","level":"warning","message":{"text":"ps.psCommand (cyclomatic 99): ps.psCommand has cyclomatic complexity 99 (threshold 15). Most of this is not in the body itself: 1 of the 99 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 1066, 1276). 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/commands/ps.ts"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"794951c91ed11a5abe511e2641e0794e42b687ce50832c5bcc84c291f06e7235"}},{"ruleId":"D1","level":"warning","message":{"text":"agent-images.agentImagesRoutes (cyclomatic 95): agent-images.agentImagesRoutes has cyclomatic complexity 95 (threshold 15). Most of this is not in the body itself: 1 of the 95 points is its own statement and the rest belongs to 10 function literals inside it that branch (lines 192, 140, 336, \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/daemon/src/routes/agent-images.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"5628304eea190537b7e9fbdc86314c34508c9f37ba5b87d63ff796555aa7015d"}},{"ruleId":"D1","level":"warning","message":{"text":"skill-catalog.reconcileSkillLoadout (cyclomatic 94): skill-catalog.reconcileSkillLoadout has cyclomatic complexity 94 (threshold 15). Of this number, 84 points are the body\u0027s own statements and 10 belong to 6 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/daemon/src/domain/skill-catalog.ts"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"0242692aa6efa4214ba1360b80d8576474961744602fa7d2cffb54576e387833"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkflowValidator.validate (cyclomatic 94): WorkflowValidator.validate has cyclomatic complexity 94 (threshold 15). Of this number, 34 points are the body\u0027s own statements and 60 belong to 11 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/daemon/src/domain/workflow-validator.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"469f60c29e8e58351ab8e43180c3484741da5cf1fbc0d41032efe87783a1eb13"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerCore.handleResponse (cyclomatic 92): RunnerCore.handleResponse has cyclomatic complexity 92 (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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"6750724bbd28a39e105e5a1a263accb8ef73078d3dfe73b27e0cb031f8fe8ab7"}},{"ruleId":"D1","level":"warning","message":{"text":"rig-repository.isStoredRigSpec (cyclomatic 91): rig-repository.isStoredRigSpec has cyclomatic complexity 91 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 64 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/daemon/src/domain/rig-repository.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"647cadb8a6fa5950566a9fb25907d4c294e417388396aab91ad77e102691b2c7"}},{"ruleId":"D1","level":"warning","message":{"text":"slack-subsystem.buildSlackGatewayWire.engineDeliver (cyclomatic 89): slack-subsystem.buildSlackGatewayWire.engineDeliver has cyclomatic complexity 89 (threshold 15). Of this number, 88 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/daemon/src/domain/gateway/slack/slack-subsystem.ts"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"758dea1c94f96ab64a2f2a14b79c8df0ac4aea3c1da3c3e46a663bf2c1c7c38a"}},{"ruleId":"D1","level":"warning","message":{"text":"rigspec-schema.validateMember (cyclomatic 87): rigspec-schema.validateMember has cyclomatic complexity 87 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0bdad0d4b6ae670b8df641d049bef02e7e3972fe80958da7a4ac2dea7bf488"}},{"ruleId":"D1","level":"warning","message":{"text":"walk.walkCommand (cyclomatic 87): walk.walkCommand has cyclomatic complexity 87 (threshold 15). Most of this is not in the body itself: 1 of the 87 points is its own statement and the rest belongs to 7 function items inside it that branch (a function literal at line 96, a function literal at line 263, resolveProfilePieces, \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/commands/walk.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"53bffd6fbcff0fae66377643e2ca4cb684b6944c1b2c0ae27ed4919796bc69d5"}},{"ruleId":"D1","level":"warning","message":{"text":"execution-view.buildExecutionView (cyclomatic 87): execution-view.buildExecutionView has cyclomatic complexity 87 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (execution-view.buildExecutionView::ladderOf) 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/daemon/src/domain/execution-view.ts"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"576d2d79742fff8ee6a432a43948e586ef4f8d02cf85b439d27d57ace16fd7a6"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeCodeAdapter.launchHarness (cyclomatic 86): ClaudeCodeAdapter.launchHarness has cyclomatic complexity 86 (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 (ClaudeCodeAdapter.launchHarness::sendClassic) 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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"233ecdbc948a964cba3b9b7bf1811576a7106075f047a53af96e902dd91869f0"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeCompactionEnforcer.recoverAfterRestart (cyclomatic 84): ClaudeCompactionEnforcer.recoverAfterRestart has cyclomatic complexity 84 (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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":2113}}}],"partialFingerprints":{"codehealthFindingId/v1":"68caa78722043a9f80e83e210c3f5f18f458870cc269f11f12850227f2eb887c"}},{"ruleId":"D1","level":"warning","message":{"text":"seat-attention-reconciler.rebindAndVerifyPaneIdentity (cyclomatic 84): seat-attention-reconciler.rebindAndVerifyPaneIdentity has cyclomatic complexity 84 (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/daemon/src/domain/seat-attention-reconciler.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0b634fc4dcb2c62bcb7077e2f9c703def163533fa46fb1d11ff6a60dd803dd"}},{"ruleId":"D1","level":"warning","message":{"text":"import.importCommand (cyclomatic 83): import.importCommand has cyclomatic complexity 83 (threshold 15). Most of this is not in the body itself: 1 of the 83 points is its own statement and the rest belongs to one function literal inside it that branches (line 59). 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/commands/import.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e058c5bf3c855c24372cd74c5090401c8bcca02c42124d023b2986ef34e56784"}},{"ruleId":"D1","level":"warning","message":{"text":"send.sendCommand (cyclomatic 83): send.sendCommand has cyclomatic complexity 83 (threshold 15). Most of this is not in the body itself: 1 of the 83 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 363, 563). 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/commands/send.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"034fcd1ce8d42ad710fe34c3c99ac05b8f55fb83ad1c0ef3a7b5cb28a41df7a1"}},{"ruleId":"D1","level":"warning","message":{"text":"workflow-guidance.readWorkflowGuidance (cyclomatic 83): workflow-guidance.readWorkflowGuidance has cyclomatic complexity 83 (threshold 15). Of this number, 73 points are the body\u0027s own statements and 10 belong to 6 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/daemon/src/domain/workflow-guidance.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"723b1bad79c69f9dd64acd3ede492990c230544ec06e35b23401700e41b97779"}},{"ruleId":"D1","level":"warning","message":{"text":"permission-account.planPermissionAccount (cyclomatic 83): permission-account.planPermissionAccount has cyclomatic complexity 83 (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/daemon/src/domain/permission-account.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3740551cb114562173733f6bc97f43b76d184f1ff70cbe5a27315e1246781db"}},{"ruleId":"D1","level":"warning","message":{"text":"PodRigInstantiator.instantiateOnce (cyclomatic 81): PodRigInstantiator.instantiateOnce has cyclomatic complexity 81 (threshold 15). Of this number, 56 points are the body\u0027s own statements and 25 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":"packages/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":1478}}}],"partialFingerprints":{"codehealthFindingId/v1":"617f92aa091d2236e50aac6780467acb2d24a31f76f969ad657f888ba4368873"}},{"ruleId":"D1","level":"warning","message":{"text":"settings-browser.settingsBrowser (cyclomatic 81): settings-browser.settingsBrowser has cyclomatic complexity 81 (threshold 15). Of this number, 49 points are the body\u0027s own statements and 32 belong to 7 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/daemon/src/domain/user-settings/settings-browser.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d3bd83b65b2e89aab0b7cd777167404fa852538b8b1b0bd3d8b8ec5d96489da"}},{"ruleId":"D1","level":"warning","message":{"text":"SeatLaunchEnvironment.command (cyclomatic 80): SeatLaunchEnvironment.command has cyclomatic complexity 80 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-launch-environment.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9a326873e5785db7c6b6fe14eeaaa606c055cba4522b08420fbce88f69643d"}},{"ruleId":"D1","level":"warning","message":{"text":"package-manifest.validateManifest (cyclomatic 80): package-manifest.validateManifest has cyclomatic complexity 80 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/package-manifest.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0db3459df3acd80e0140cfa33776775a4e7dcbfc80e233d6daa0df01f628200"}},{"ruleId":"D1","level":"warning","message":{"text":"pi-runner.main (cyclomatic 80): pi-runner.main has cyclomatic complexity 80 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 48 belong to 18 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":2252}}}],"partialFingerprints":{"codehealthFindingId/v1":"585b824dafd62014bac4bee80d640dacc42672cc229ba096fbe81a5043eecce4"}},{"ruleId":"D1","level":"warning","message":{"text":"session-transport.inspectComposerInput (cyclomatic 79): session-transport.inspectComposerInput has cyclomatic complexity 79 (threshold 15). Of this number, 75 points are the body\u0027s own statements and 4 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28b990a50101189daab10adf93785fc9079c2b16c3dc40577e7f0b8c50149a0"}},{"ruleId":"D1","level":"warning","message":{"text":"seat.printHuman (cyclomatic 79): seat.printHuman has cyclomatic complexity 79 (threshold 15). Of this number, 75 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/commands/seat.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"db49c0c93ac514825e8bd7ce233cb5e7e9619408b26ae7d2065a08a928d498df"}},{"ruleId":"D1","level":"warning","message":{"text":"bundles.bundleRoutes.post(\u0022/create\u0022) (cyclomatic 79): bundles.bundleRoutes.post(\u0022/create\u0022) has cyclomatic complexity 79 (threshold 15). Of this number, 78 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/daemon/src/routes/bundles.ts"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d338c121695f5549eb67139707b12e68ee3b62227cfb9439116704be2648e0d"}},{"ruleId":"D1","level":"warning","message":{"text":"RigGraph.RigGraph (cyclomatic 79): RigGraph.RigGraph has cyclomatic complexity 79 (threshold 15). Most of this is not in the body itself: 14 of the 79 points are its own statements and the rest belongs to 13 function literals inside it that branch (lines 378, 295, 272, \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/ui/src/components/RigGraph.tsx"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad8fe8721d197bf0bb1372bbecdbc3602d463582b5f164fdfa7f3ed1c4e6e64"}},{"ruleId":"D1","level":"warning","message":{"text":"ps.handleNodes (cyclomatic 76): ps.handleNodes 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":"packages/cli/src/commands/ps.ts"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0b2acc92f773288c25c1ff84d7a337a095c1423a31b2251cef24f86c0621cb"}},{"ruleId":"D1","level":"warning","message":{"text":"SeatRuntimeSwitchService.execute (cyclomatic 76): SeatRuntimeSwitchService.execute has cyclomatic complexity 76 (threshold 15). Of this number, 60 points are the body\u0027s own statements and 16 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/daemon/src/domain/seat-runtime-switch-service.ts"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"d041cae65725a556bc78f3bf8db35763f1aad0f084a0d88f5c8b50f5fcc892e7"}},{"ruleId":"D1","level":"warning","message":{"text":"LegacyRigSpecSchema.validate (cyclomatic 75): LegacyRigSpecSchema.validate has cyclomatic complexity 75 (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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":1399}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac0390a2acb528943142292c9f99004e13a1d1e124dcdf93b58a04e44241646"}},{"ruleId":"D1","level":"warning","message":{"text":"rig.rigCommand (cyclomatic 75): rig.rigCommand has cyclomatic complexity 75 (threshold 15). Most of this is not in the body itself: 1 of the 75 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 104, 50, 274, \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/commands/rig.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b3e04b16cea07fa9bdae4e7bc925369a99cbf19156a8bc0c08e823d3829771a"}},{"ruleId":"D1","level":"warning","message":{"text":"session-transport.classifyPaneActivity (cyclomatic 74): session-transport.classifyPaneActivity 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b943990dae5a5e4cd25b1fa39744bb5fd80427f90c4d51b842bd662c62d816"}},{"ruleId":"D1","level":"warning","message":{"text":"session-transport.annotateInputBox (cyclomatic 74): session-transport.annotateInputBox has cyclomatic complexity 74 (threshold 15). Of this number, 64 points are the body\u0027s own statements and 10 belong to 7 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":5345}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1078a819804a7549ab0c131760c452c17d2999d091dc1722f56199d1f621337"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkflowRuntime.instantiate (cyclomatic 74): WorkflowRuntime.instantiate has cyclomatic complexity 74 (threshold 15). Of this number, 56 points are the body\u0027s own statements and 18 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/daemon/src/domain/workflow-runtime.ts"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"5619cd0079483beabe2384a6edda17ba66400a00271e47ad27e9215f64919406"}},{"ruleId":"D1","level":"warning","message":{"text":"daemon-lifecycle.startOwnedDaemon (cyclomatic 73): daemon-lifecycle.startOwnedDaemon has cyclomatic complexity 73 (threshold 15). Of this number, 53 points are the body\u0027s own statements and 20 belong to 6 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/daemon-lifecycle.ts"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d7beb743454371becd182364e3fc19f7c47f601b7c45149a9ca202c72610a7"}},{"ruleId":"D1","level":"warning","message":{"text":"RestoreOrchestrator.launchNodeTargets (cyclomatic 73): RestoreOrchestrator.launchNodeTargets has cyclomatic complexity 73 (threshold 15). Of this number, 71 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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"858a35f4b52800503dc698ae7835d3c129c0c43a67bce58a35db4f8071842e3b"}},{"ruleId":"D1","level":"warning","message":{"text":"InboundRouter.attemptLand (cyclomatic 72): InboundRouter.attemptLand has cyclomatic complexity 72 (threshold 15). Of this number, 70 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/daemon/src/domain/gateway/slack/inbound.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda085366f032def092098bd07224cb8878642a901314103155752bc57f70e1f"}},{"ruleId":"D1","level":"warning","message":{"text":"rig-mode.rigModeCommand (cyclomatic 72): rig-mode.rigModeCommand has cyclomatic complexity 72 (threshold 15). Most of this is not in the body itself: 1 of the 72 points is its own statement and the rest belongs to 8 function literals inside it that branch (lines 299, 559, 458, \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/commands/rig-mode.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a85c29c94d90538d9dfab3f7c610d4c9c441d8cffab349b9fe8360785985b9d"}},{"ruleId":"D1","level":"warning","message":{"text":"BootstrapOrchestrator.executeStages (cyclomatic 72): BootstrapOrchestrator.executeStages has cyclomatic complexity 72 (threshold 15). Of this number, 68 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":"packages/daemon/src/domain/bootstrap-orchestrator.ts"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"911cc6bac16cf1b92eb7f578f7970157733795405b8d9c25f0b9ae5343d9a418"}},{"ruleId":"D1","level":"warning","message":{"text":"scope-audit.classifyScopeItem (cyclomatic 71): scope-audit.classifyScopeItem has cyclomatic complexity 71 (threshold 15). Of this number, 63 points are the body\u0027s own statements and 8 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/daemon/src/domain/scope/scope-audit.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa593852ce14750a8b29a425f9ae95d2e446904d4229b160522b9e8b7a6c11b3"}},{"ruleId":"D1","level":"warning","message":{"text":"scope-audit.classifyScopeItem (cyclomatic 71): scope-audit.classifyScopeItem has cyclomatic complexity 71 (threshold 15). Of this number, 63 points are the body\u0027s own statements and 8 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/lib/scope/scope-audit.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"97cff9b7d7be1c1892053f7d80c536f343e4af603285787506c3aeb04bd381bb"}},{"ruleId":"D1","level":"warning","message":{"text":"RestoreOrchestrator.attemptResume (cyclomatic 71): RestoreOrchestrator.attemptResume has cyclomatic complexity 71 (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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":2790}}}],"partialFingerprints":{"codehealthFindingId/v1":"657a17d18652b20e85679ae52b8e17feb73253f654b15e1be9654f8ad7a56248"}},{"ruleId":"D1","level":"warning","message":{"text":"bundles.consumeAuthorBundleYaml (cyclomatic 71): bundles.consumeAuthorBundleYaml has cyclomatic complexity 71 (threshold 15). Of this number, 37 points are the body\u0027s own statements and 34 belong to 9 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/daemon/src/routes/bundles.ts"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c58ac75045b2342b117438f3cea568a7367a32d18c1f6f07335901b04e0c24f"}},{"ruleId":"D1","level":"warning","message":{"text":"FeedCard.FeedCard (cyclomatic 71): FeedCard.FeedCard has cyclomatic complexity 71 (threshold 15). Of this number, 58 points are the body\u0027s own statements and 13 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/ui/src/components/for-you/FeedCard.tsx"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb765305b40802a7dd2d84ddb522e901906f5a6955d11235bd25f22ce643edcf"}},{"ruleId":"D1","level":"warning","message":{"text":"chatroom.chatroomCommand (cyclomatic 70): chatroom.chatroomCommand has cyclomatic complexity 70 (threshold 15). Most of this is not in the body itself: 1 of the 70 points is its own statement and the rest belongs to 7 function items inside it that branch (a function literal at line 307, a function literal at line 180, a function literal at line 121, \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/commands/chatroom.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e7af20469bc96513d8d25be5650d50016530099ca271c0270f2eee8f6ce9da"}},{"ruleId":"D1","level":"warning","message":{"text":"slack-delivery.deliverSinglePart.\u003Creturned closure\u003E (cyclomatic 70): slack-delivery.deliverSinglePart.\u003Creturned closure\u003E has cyclomatic complexity 70 (threshold 15). Of this number, 64 points are the body\u0027s own statements and 6 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/daemon/src/domain/gateway/slack/slack-delivery.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b94c8d41b4a1de1b1f6e580c3140565fa428ef6904fd7558166bb88b672f6d7"}},{"ruleId":"D1","level":"warning","message":{"text":"socket-inbound.startSocketInbound (cyclomatic 70): socket-inbound.startSocketInbound has cyclomatic complexity 70 (threshold 15). Most of this is not in the body itself: 1 of the 70 points is its own statement and the rest belongs to 8 function literals inside it that branch (lines 283, 366, 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/daemon/src/domain/gateway/slack/socket-inbound.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82201fd07a762fec1093a759996d64a2da0d83ca51f6594200f858b097292ff"}},{"ruleId":"D1","level":"warning","message":{"text":"PodRigInstantiator.retryFirstStart (cyclomatic 69): PodRigInstantiator.retryFirstStart has cyclomatic complexity 69 (threshold 15). Of this number, 53 points are the body\u0027s own statements and 16 belong to 3 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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":1333}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f73ab7f1c9e175336d025cd86977289f7b686594c84f48ff993b4fd48d056a"}},{"ruleId":"D1","level":"warning","message":{"text":"manifest-parser.parseAtoms (cyclomatic 68): manifest-parser.parseAtoms has cyclomatic complexity 68 (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/daemon/src/domain/context-packs/manifest-parser.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d31699148391fbd74db8e94b7bd65aef4679e828fdae6cddac7ef124590740f"}},{"ruleId":"D1","level":"warning","message":{"text":"PassiveCeremonySource.read (cyclomatic 68): PassiveCeremonySource.read has cyclomatic complexity 68 (threshold 15). Of this number, 62 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/health-passive-ceremony.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce2cea429e51f3a5e6846ddb28b5869346d1f01c450b9b2338e27e6666a6b8b"}},{"ruleId":"D1","level":"warning","message":{"text":"StartupController.key (cyclomatic 68): StartupController.key has cyclomatic complexity 68 (threshold 15). Of this number, 66 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":"packages/tui/src/startup.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37710d413bccb8b13ea2617a4f9c0ee3d4fe29b8c214ed1e59be8a11a489c50"}},{"ruleId":"D1","level":"warning","message":{"text":"PiRuntimeAdapter.launchHarness (cyclomatic 67): PiRuntimeAdapter.launchHarness has cyclomatic complexity 67 (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/daemon/src/adapters/pi-runtime-adapter.ts"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff64a95844ca2900d7f99c6a1642c0ed2fc87b6d7f3fe96fd4b10e0cccb7ee1"}},{"ruleId":"D1","level":"warning","message":{"text":"WatchdogPolicyEngine.evaluate (cyclomatic 67): WatchdogPolicyEngine.evaluate has cyclomatic complexity 67 (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/daemon/src/domain/watchdog-policy-engine.ts"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8cb395c4177ab546bbfc5e08635f054f6a0fe79fdece382dc964ebe5053b23"}},{"ruleId":"D1","level":"warning","message":{"text":"workflow.workflowRoutes::errorResponse (cyclomatic 67): workflow.workflowRoutes::errorResponse has cyclomatic complexity 67 (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/daemon/src/routes/workflow.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ddf0515a070ab5528b7b0919f64b97093a57c89bab825d46455cd270d8e4239"}},{"ruleId":"D1","level":"warning","message":{"text":"tool-brand.normalizeToolBrandId (cyclomatic 67): tool-brand.normalizeToolBrandId has cyclomatic complexity 67 (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/ui/src/lib/tool-brand.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f2cdb9c7523273fc86febbd9675b8bf408bea9d9df2a2961c7de4505c7e85d"}},{"ruleId":"D1","level":"warning","message":{"text":"HerdrViewer.ensureOnce (cyclomatic 66): HerdrViewer.ensureOnce has cyclomatic complexity 66 (threshold 15). Of this number, 58 points are the body\u0027s own statements and 8 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/daemon/src/domain/terminal/herdr-viewer.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"60f11772b0854996c97bcbafcc72209e3b9db33e03921c99cb3609c565d204ca"}},{"ruleId":"D1","level":"warning","message":{"text":"transport.transportRoutes::send (cyclomatic 66): transport.transportRoutes::send has cyclomatic complexity 66 (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/daemon/src/routes/transport.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd44272e2b48dd6acc99aeb5a055f77ba7501e3fdb5a7aa28905d08292e4625e"}},{"ruleId":"D1","level":"warning","message":{"text":"participants.validateParticipantsFile (cyclomatic 65): participants.validateParticipantsFile has cyclomatic complexity 65 (threshold 15). Of this number, 62 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/daemon/src/domain/gateway/participants.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"d91ac5973503cab36c610cf8100f971b00a89642252dc52f4188818c7019a7ac"}},{"ruleId":"D1","level":"warning","message":{"text":"project.projectCommand (cyclomatic 65): project.projectCommand has cyclomatic complexity 65 (threshold 15). Most of this is not in the body itself: 6 of the 65 points are its own statements and the rest belongs to 10 function literals inside it that branch (lines 129, 83, 167, \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/commands/project.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0c06022e048b5f191833a66d53c2b2f372c4e6ae9136c8e38ae7685b3b1232"}},{"ruleId":"D1","level":"warning","message":{"text":"BootstrapOrchestrator.bootstrap (cyclomatic 65): BootstrapOrchestrator.bootstrap has cyclomatic complexity 65 (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/daemon/src/domain/bootstrap-orchestrator.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e37f32c735270feb59b22394c844617798bf3139e4e105806ee6c7cb241f35"}},{"ruleId":"D1","level":"warning","message":{"text":"SliceIndexer.observedQueueCounts (cyclomatic 64): SliceIndexer.observedQueueCounts has cyclomatic complexity 64 (threshold 15). Of this number, 61 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/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff88bc2de4e707cb606d17a130f0a956a2c3c376740d3612c20e44a7d9cd73f8"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeCompactionEnforcer.maybeAutoCompactUnchecked (cyclomatic 63): ClaudeCompactionEnforcer.maybeAutoCompactUnchecked 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":1326}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef252c16dbb03d5c983f1e16b1fa6fb0b940e4b673a957185babf05584b090bf"}},{"ruleId":"D1","level":"warning","message":{"text":"claude-compaction-enforcer.readCompactionRecord (cyclomatic 63): claude-compaction-enforcer.readCompactionRecord has cyclomatic complexity 63 (threshold 15). Of this number, 62 points are the body\u0027s own statements and 1 belongs 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"8754370f30b57ae60880885e990165dfc67d2670e606c90b9727ede2afc6ac9b"}},{"ruleId":"D1","level":"warning","message":{"text":"NodeLauncher.launchNode (cyclomatic 63): NodeLauncher.launchNode has cyclomatic complexity 63 (threshold 15). Of this number, 48 points are the body\u0027s own statements and 15 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/daemon/src/domain/node-launcher.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"31edc94be4a630137505a337a53e676161f8e5b3866986355e3e2bebffe7ee9c"}},{"ruleId":"D1","level":"warning","message":{"text":"project-lifecycle-compiler.compileProjectLifecycle (cyclomatic 63): project-lifecycle-compiler.compileProjectLifecycle has cyclomatic complexity 63 (threshold 15). Of this number, 47 points are the body\u0027s own statements and 16 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/daemon/src/domain/project-lifecycle-compiler.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"329552bb9c2177127db6f07d685ad0f4fadeb20224d6e7dd0af66cab43b1a87b"}},{"ruleId":"D1","level":"warning","message":{"text":"CodexInPlaceRestart.observe (cyclomatic 63): CodexInPlaceRestart.observe has cyclomatic complexity 63 (threshold 15). Of this number, 62 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/daemon/src/domain/seat-restart-in-place.ts"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7fcbbc6add2d2c4069eeeb13b4a201cc41a6e33a0bd1ea86e7ff8d5ac7171b"}},{"ruleId":"D1","level":"warning","message":{"text":"queue-erasure.eraseQueue (cyclomatic 63): queue-erasure.eraseQueue 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. This shape REPEATS in the file: one other method here (queue-erasure.eraseQueue::planBatch) 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/daemon/src/domain/queue-erasure.ts"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"35951717e1234ea54ba835b41ea16207cf16e94a41f1a5d1d8f6b565e55deea0"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeCompactionEnforcer.sendPreparedCompact (cyclomatic 62): ClaudeCompactionEnforcer.sendPreparedCompact has cyclomatic complexity 62 (threshold 15). Of this number, 54 points are the body\u0027s own statements and 8 belong to 3 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":1765}}}],"partialFingerprints":{"codehealthFindingId/v1":"508d3af913ef434df028f8759efecc9f7784012e309d235d8aa5b98802954fd6"}},{"ruleId":"D1","level":"warning","message":{"text":"setup.runSetup (cyclomatic 62): setup.runSetup has cyclomatic complexity 62 (threshold 15). Of this number, 52 points are the body\u0027s own statements and 10 belong to 7 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/commands/setup.ts"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b57a53ead43a0448580a44951a24b2be61d1af4405513b6b83c303ddb4ccfd2"}},{"ruleId":"D1","level":"warning","message":{"text":"files.filesRoutes (cyclomatic 62): files.filesRoutes has cyclomatic complexity 62 (threshold 15). Most of this is not in the body itself: 1 of the 62 points is its own statement and the rest belongs to 9 function items inside it that branch (a function literal at line 141, a function literal at line 209, pathSafetyErrorResponse, \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/daemon/src/routes/files.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00ddcb7d62c2340e36248bdf8ee5f8e689aa700ab96d347a63a6f789e2f3ef4"}},{"ruleId":"D1","level":"warning","message":{"text":"RigNode.RigNode (cyclomatic 62): RigNode.RigNode has cyclomatic complexity 62 (threshold 15). Of this number, 53 points are the body\u0027s own statements and 9 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/ui/src/components/RigNode.tsx"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ffaaefcf74488c18cfca7c50ca61ea572e7c1b234875d9163cf0959bb5fad1"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeManagedLaunch.prepare (cyclomatic 61): ClaudeManagedLaunch.prepare has cyclomatic complexity 61 (threshold 15). Of this number, 44 points are the body\u0027s own statements and 17 belong to 8 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/daemon/src/domain/claude-managed-launch.ts"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"489db2b2be17ea93bd8e39b87505e8478a6e6268f1bc0e9c72c3db11aed93b55"}},{"ruleId":"D1","level":"warning","message":{"text":"down.downCommand (cyclomatic 61): down.downCommand has cyclomatic complexity 61 (threshold 15). Most of this is not in the body itself: 1 of the 61 points is its own statement and the rest belongs to 5 function literals inside it that branch (lines 176, 193, 198, \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/commands/down.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ac85100de472900937a436d487f42068eba1d4f9dce4aefb51b63c63e43ed2"}},{"ruleId":"D1","level":"warning","message":{"text":"CodexRuntimeAdapter.verifyResumeLaunch (cyclomatic 61): CodexRuntimeAdapter.verifyResumeLaunch has cyclomatic complexity 61 (threshold 15). Of this number, 55 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":1890}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1158ae0db969709ed371ab7049d8a2ef1410f7526eb138d46b05eae0e8e5b1"}},{"ruleId":"D1","level":"warning","message":{"text":"execution-view.readArrangement (cyclomatic 61): execution-view.readArrangement has cyclomatic complexity 61 (threshold 15). Of this number, 53 points are the body\u0027s own statements and 8 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/daemon/src/domain/execution-view.ts"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"c88d83de111e92dde8aa1a2740ac9223522481db1f4e603d5280fca6931599a4"}},{"ruleId":"D1","level":"warning","message":{"text":"OperatingPostureService.context (cyclomatic 61): OperatingPostureService.context has cyclomatic complexity 61 (threshold 15). Of this number, 53 points are the body\u0027s own statements and 8 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/daemon/src/domain/rig-mode/operating-posture.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"96cdd10ff12ce44ad5d2919351dfbc17286ccc7400a36475545f3266f524e865"}},{"ruleId":"D1","level":"warning","message":{"text":"input.parseText (cyclomatic 61): input.parseText has cyclomatic complexity 61 (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/tui/src/input.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"125c87699f17421c0e396d049a0c1dc965dc75dd64b352ea3f6f31d9f7439f80"}},{"ruleId":"D1","level":"warning","message":{"text":"FocusedTerminal.FocusedTerminal (cyclomatic 61): FocusedTerminal.FocusedTerminal has cyclomatic complexity 61 (threshold 15). Most of this is not in the body itself: 4 of the 61 points are its own statements and the rest belongs to 15 function literals inside it that branch (lines 211, 248, 282, \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/ui/src/components/terminal/FocusedTerminal.tsx"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"a777d2a8b9db0b55cd4a31e73702f0e3352d4f93eb86e8dba7b567ec13ca1b9d"}},{"ruleId":"D1","level":"warning","message":{"text":"agent-image.agentImageCommand (cyclomatic 60): agent-image.agentImageCommand has cyclomatic complexity 60 (threshold 15). Most of this is not in the body itself: 1 of the 60 points is its own statement and the rest belongs to 10 function items inside it that branch (a function literal at line 342, a function literal at line 234, a function literal at line 131, \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/commands/agent-image.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"87af05f91ced6d04b234e270e030799bf59155cad5765ef31e71fcb6d6cac28c"}},{"ruleId":"D1","level":"warning","message":{"text":"CodexRuntimeAdapter.prepareLaunch (cyclomatic 59): CodexRuntimeAdapter.prepareLaunch has cyclomatic complexity 59 (threshold 15). Of this number, 55 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":"packages/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35457153832dc2408454af848ab25bb65856e41de9b1c2c4f4b4527ce6ab46a"}},{"ruleId":"D1","level":"warning","message":{"text":"SeatAttentionReconciler.clearAttention (cyclomatic 59): SeatAttentionReconciler.clearAttention 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":"packages/daemon/src/domain/seat-attention-reconciler.ts"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80e6f14c851fbdadacf19041453a9d9e7a5d47493bd77e4c0af6f856b177186"}},{"ruleId":"D1","level":"warning","message":{"text":"state.computeExplorerRows (cyclomatic 59): state.computeExplorerRows has cyclomatic complexity 59 (threshold 15). Of this number, 58 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/tui/src/state.ts"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b25564cd9e1e6b19a145a30b7aeb6b7b3a4f732be84b28cd1c4dbb8bb2efde0"}},{"ruleId":"D1","level":"warning","message":{"text":"snapshot-repository.isRestoreUsableSnapshotData (cyclomatic 58): snapshot-repository.isRestoreUsableSnapshotData has cyclomatic complexity 58 (threshold 15). Of this number, 57 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/daemon/src/domain/snapshot-repository.ts"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"4365c6d5f222c022b1630f7893f9588b0729085bf20fba6aa656a7f494d6c055"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionTransport.classifySendReadiness (cyclomatic 58): SessionTransport.classifySendReadiness has cyclomatic complexity 58 (threshold 15). Of this number, 57 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":4475}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eab4800d5182f43c1c32eb4a304f799ca6aeca240d77a7ceb15823e9b03a4e5"}},{"ruleId":"D1","level":"warning","message":{"text":"compose.compose_up (cyclomatic 58): compose.compose_up has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/assets/plugins/openrig-core/skills/openrig-operating-model/scripts/compose.py"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d3b29703a57e4eefd6792d8392d3e85e825cd186d73ee474a689299320603ba"}},{"ruleId":"D1","level":"warning","message":{"text":"EnvironmentLifecycle.effect (cyclomatic 57): EnvironmentLifecycle.effect has cyclomatic complexity 57 (threshold 15). Of this number, 46 points are the body\u0027s own statements and 11 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/daemon/src/domain/environment-lifecycle.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa91e9b2c2e5269bccfe0bfe63f1b384138d3cdddf314c3f935f8e71cd1f7a61"}},{"ruleId":"D1","level":"warning","message":{"text":"CodexResumeAdapter.resume (cyclomatic 57): CodexResumeAdapter.resume has cyclomatic complexity 57 (threshold 15). Of this number, 54 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":"packages/daemon/src/adapters/codex-resume.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"183b97590793dc4d92c8081596537d9fb8e2c71696897af76fce28ba33f36d3d"}},{"ruleId":"D1","level":"warning","message":{"text":"SeatIdentityReconciler.reconcileSweep (cyclomatic 57): SeatIdentityReconciler.reconcileSweep has cyclomatic complexity 57 (threshold 15). Of this number, 37 points are the body\u0027s own statements and 20 belong to 6 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/daemon/src/domain/seat-identity-reconciler.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"594ac7dbcf04fc3eb8bc006a1f6a72853cbd46cfaecd8c2673fbf6aaf2afbc4f"}},{"ruleId":"D1","level":"warning","message":{"text":"SeatLifecycleService.launchFresh (cyclomatic 57): SeatLifecycleService.launchFresh has cyclomatic complexity 57 (threshold 15). Of this number, 55 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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":1638}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc1f96bac4c6240450d54f4ec055552fa050dfa8bc33e664d2c1690b6556e27"}},{"ruleId":"D1","level":"warning","message":{"text":"FeedCardQuestionAsk.FeedCardQuestionAsk (cyclomatic 57): FeedCardQuestionAsk.FeedCardQuestionAsk has cyclomatic complexity 57 (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 (FeedCardQuestionAsk.FeedCardQuestionAsk::refreshQueueRow) 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/ui/src/components/for-you/FeedCardQuestionAsk.tsx"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"85aedd707ca860d63715bdcf39856ece42f8e776075326c6d642c8d97ad42e00"}},{"ruleId":"D1","level":"warning","message":{"text":"profile-resolver.resolveNodeConfig (cyclomatic 56): profile-resolver.resolveNodeConfig has cyclomatic complexity 56 (threshold 15). Of this number, 49 points are the body\u0027s own statements and 7 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/daemon/src/domain/profile-resolver.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc51801dffe2cd11b3423f3604159a26109cf050abba672376c4346849edd2e3"}},{"ruleId":"D1","level":"warning","message":{"text":"status.statusCommand (cyclomatic 56): status.statusCommand has cyclomatic complexity 56 (threshold 15). Most of this is not in the body itself: 1 of the 56 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 41, 45). 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/commands/status.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"1149674120933d89f1a13a68ef0db0d422ddac26aed802627e43bbd2c7a3376f"}},{"ruleId":"D1","level":"warning","message":{"text":"exec.execCommand (cyclomatic 56): exec.execCommand has cyclomatic complexity 56 (threshold 15). Most of this is not in the body itself: 1 of the 56 points is its own statement and the rest belongs to 9 function items inside it that branch (a function literal at line 464, waitForEnd, a function literal at line 564, \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/commands/exec.ts"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"7125df2de0a4e8f7dba4d736f72e4bf2230f22982c738d4b77aeb62c01ed535f"}},{"ruleId":"D1","level":"warning","message":{"text":"watchdog.watchdogCommand (cyclomatic 56): watchdog.watchdogCommand has cyclomatic complexity 56 (threshold 15). Most of this is not in the body itself: 1 of the 56 points is its own statement and the rest belongs to 6 function literals inside it that branch (lines 124, 276, 358, \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/commands/watchdog.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b54dd3559364a9ff9d74b6bd4dbcc40b0baf55d5cd7cff3cd2b0fdae8b9c10"}},{"ruleId":"D1","level":"warning","message":{"text":"workflow-reconciliation.compare (cyclomatic 56): workflow-reconciliation.compare has cyclomatic complexity 56 (threshold 15). Of this number, 53 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/daemon/src/domain/workflow-reconciliation.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d204248e41e170c07fe292ba030516d7dfdeaad55394acf5e149dca43b57bee"}},{"ruleId":"D1","level":"warning","message":{"text":"scopes.scopesRoutes (cyclomatic 56): scopes.scopesRoutes has cyclomatic complexity 56 (threshold 15). Most of this is not in the body itself: 1 of the 56 points is its own statement and the rest belongs to 10 function literals inside it that branch (lines 113, 127, 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/daemon/src/routes/scopes.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"3890c01e58ae46f4ad4f8e599e13ace17f21cdcfb55a804e4216f55f4d58a807"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerChannel.post (cyclomatic 55): RunnerChannel.post has cyclomatic complexity 55 (threshold 15). Of this number, 54 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":"packages/daemon/src/domain/runner-channel.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c9de719080210ac842a5792775607e66593fb0a7bcaa10f3d706fe326b947fa"}},{"ruleId":"D1","level":"warning","message":{"text":"plugin.pluginCommand (cyclomatic 55): plugin.pluginCommand has cyclomatic complexity 55 (threshold 15). Most of this is not in the body itself: 1 of the 55 points is its own statement and the rest belongs to 5 function items inside it that branch (a function literal at line 205, a function literal at line 154, a function literal at line 296, \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/commands/plugin.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7c340849e758e4c630d4d0d54eaab9a0f10fae0201015ef629b63665497585"}},{"ruleId":"D1","level":"warning","message":{"text":"terminal.terminalCommand (cyclomatic 55): terminal.terminalCommand has cyclomatic complexity 55 (threshold 15). Most of this is not in the body itself: 1 of the 55 points is its own statement and the rest belongs to 5 function literals inside it that branch (lines 211, 325, 345, \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/commands/terminal.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"029ee5ce4862caee140977c1d30ae2e1641757096e671efca5b1c6258aa5d784"}},{"ruleId":"D1","level":"warning","message":{"text":"MissionControlWriteContract.answerAsk (cyclomatic 55): MissionControlWriteContract.answerAsk has cyclomatic complexity 55 (threshold 15). Of this number, 54 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/daemon/src/domain/mission-control/mission-control-write-contract.ts"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"058808e174afc471454cf1d4696b6f389040ec59c17dc1237cefb85a654a241c"}},{"ruleId":"D1","level":"warning","message":{"text":"RigSpecExporter.exportPodAware (cyclomatic 55): RigSpecExporter.exportPodAware has cyclomatic complexity 55 (threshold 15). Most of this is not in the body itself: 10 of the 55 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 245, a function literal at line 241, a function literal at line 325, \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/daemon/src/domain/rigspec-exporter.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"35445f1baad9696524665335ab752bac98df623eb9edc4abe245417289a85321"}},{"ruleId":"D1","level":"warning","message":{"text":"sessions.generationRecord (cyclomatic 55): sessions.generationRecord has cyclomatic complexity 55 (threshold 15). Of this number, 53 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/daemon/src/routes/sessions.ts"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce593e1251062cf87270b17506515494045f2cb070244d5926e20561bb3147a4"}},{"ruleId":"D1","level":"warning","message":{"text":"TerminalLauncher.TerminalLauncher (cyclomatic 55): TerminalLauncher.TerminalLauncher has cyclomatic complexity 55 (threshold 15). Of this number, 34 points are the body\u0027s own statements and 21 belong to 7 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/ui/src/components/topology/TerminalLauncher.tsx"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"f21fe064a746e5aa5f136985e3b250f7e7d5388e6f6514ad1b19cb5334f7c6b6"}},{"ruleId":"D1","level":"warning","message":{"text":"RigRepository.addNode (cyclomatic 54): RigRepository.addNode has cyclomatic complexity 54 (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/daemon/src/domain/rig-repository.ts"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf5bb64c6d933433cb7541ea97eba1a12a3ef074ee3b0e70dc5072c96ba47a7a"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeResumeAdapter.resume (cyclomatic 54): ClaudeResumeAdapter.resume has cyclomatic complexity 54 (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 (ClaudeResumeAdapter.resume::sendClassic) 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/daemon/src/adapters/claude-resume.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0aa552651b80f61fb2d97a5581c0a5649a5111d0d2dc3e0383f84837a60cece"}},{"ruleId":"D1","level":"warning","message":{"text":"daemon-lifecycle.getDaemonStatus (cyclomatic 54): daemon-lifecycle.getDaemonStatus has cyclomatic complexity 54 (threshold 15). Of this number, 47 points are the body\u0027s own statements and 7 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/daemon-lifecycle.ts"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"088eb070d7ab02632c73247fe30fecc6b6e1ac3c75c4b7754ce68e6c63db9fe2"}},{"ruleId":"D1","level":"warning","message":{"text":"work-install.resolveWorkPosition (cyclomatic 54): work-install.resolveWorkPosition has cyclomatic complexity 54 (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/lib/work-install.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa8ad65e804088f08dcc3f357e34bd3465b235116eaef9739c1199f70f3972d0"}},{"ruleId":"D1","level":"warning","message":{"text":"restore-preconditions.validatePreRestore (cyclomatic 54): restore-preconditions.validatePreRestore has cyclomatic complexity 54 (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/daemon/src/domain/restore-preconditions.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"972095d752661f91c0e8ec86ba2fa47072d44d18d94add93ed8550a62b58b021"}},{"ruleId":"D1","level":"warning","message":{"text":"server.createApp (cyclomatic 54): server.createApp has cyclomatic complexity 54 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 28 belong to 9 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/daemon/src/server.ts"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e2bb5ce7ccec093beb0c1ae39d4549c577d08d9b4f7679d7a3b308b91c33f82"}},{"ruleId":"D1","level":"warning","message":{"text":"community-harness-presets.parsePreset (cyclomatic 53): community-harness-presets.parsePreset has cyclomatic complexity 53 (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/daemon/src/domain/community-harness-presets.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc8f82624eae802bcacb1d8aed5d31de302e4ec6203fe2005a6ac2feebaf2a8"}},{"ruleId":"D1","level":"warning","message":{"text":"send.runFanOutSend (cyclomatic 53): send.runFanOutSend has cyclomatic complexity 53 (threshold 15). Of this number, 43 points are the body\u0027s own statements and 10 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/commands/send.ts"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4730a6124e3c12ddca89402fac36d0365ac68093450a1a255754126b1fca6a7"}},{"ruleId":"D1","level":"warning","message":{"text":"SeatIdentityReconciler.computeVerdict (cyclomatic 53): SeatIdentityReconciler.computeVerdict has cyclomatic complexity 53 (threshold 15). Of this number, 52 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/daemon/src/domain/seat-identity-reconciler.ts"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"9762a1919ce9d3c516d458e8ce8d1cb2d3b887ab72f0e966f3ff612f5b587dae"}},{"ruleId":"D1","level":"warning","message":{"text":"RestoreOrchestrator.restore (cyclomatic 53): RestoreOrchestrator.restore has cyclomatic complexity 53 (threshold 15). Of this number, 46 points are the body\u0027s own statements and 7 belong to 6 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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"b32a3aab51974f7e75edfd7c6ccb33b061c0c96a05e9d1b2312e1ce9d73a9818"}},{"ruleId":"D1","level":"warning","message":{"text":"ChannelRecovery.page (cyclomatic 53): ChannelRecovery.page has cyclomatic complexity 53 (threshold 15). Of this number, 49 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":"packages/daemon/src/domain/gateway/slack/channel-recovery.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"b79e80884b379e58824b13d166de451390010621a3a48878f3f1bc4919d4e062"}},{"ruleId":"D1","level":"warning","message":{"text":"HerdrAdapter.openView (cyclomatic 53): HerdrAdapter.openView 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":"packages/daemon/src/domain/terminal/herdr-adapter.ts"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb420bc48505e91c00e4f9c509fe0b7080b4e94e6511bbb5563576d7066a0066"}},{"ruleId":"D1","level":"warning","message":{"text":"stream.streamRoutes (cyclomatic 53): stream.streamRoutes has cyclomatic complexity 53 (threshold 15). Most of this is not in the body itself: 1 of the 53 points is its own statement and the rest belongs to 11 function literals inside it that branch (lines 94, 217, 175, \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/daemon/src/routes/stream.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"241d33636a47e6fa1e6f05e496d48d72043ac7165bd707d8fbe32e74c77f15aa"}},{"ruleId":"D1","level":"warning","message":{"text":"render.agentDetailLines (cyclomatic 53): render.agentDetailLines has cyclomatic complexity 53 (threshold 15). Of this number, 51 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/tui/src/render.ts"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"73752a93d44c8474fd64c4a26cb5945737b01bedb2ef581f042ff5c9b31257ac"}},{"ruleId":"D1","level":"warning","message":{"text":"terminal-window.windowLauncher (cyclomatic 52): terminal-window.windowLauncher has cyclomatic complexity 52 (threshold 15). Of this number, 39 points are the body\u0027s own statements and 13 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/terminal-window.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1f0e646f0d646f7c0d08d0107dd54c02d2ee75ddb3905d09c7029a6b17b3adb"}},{"ruleId":"D1","level":"warning","message":{"text":"PiResumeAdapter.resume (cyclomatic 52): PiResumeAdapter.resume has cyclomatic complexity 52 (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/daemon/src/adapters/pi-resume.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f7e732af2ec14cb679675b4f120d50778b46b5d9ebad43543d4b099a6695b4"}},{"ruleId":"D1","level":"warning","message":{"text":"PodRigInstantiator.materializeValidatedSpec (cyclomatic 52): PodRigInstantiator.materializeValidatedSpec has cyclomatic complexity 52 (threshold 15). Most of this is not in the body itself: 15 of the 52 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 711, 754). 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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"04217c5488d8c0fc546988758dfec8cff0decbf6c418decb545359fe60439ff3"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkflowProjector.projectDependencyGraph (cyclomatic 52): WorkflowProjector.projectDependencyGraph has cyclomatic complexity 52 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 31 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/daemon/src/domain/workflow-projector.ts"},"region":{"startLine":1244}}}],"partialFingerprints":{"codehealthFindingId/v1":"809cf004d608f05d9ed356d5b6de2be54c60fc137b0310f74dc86c0f16bbe698"}},{"ruleId":"D1","level":"warning","message":{"text":"SeatStructuralActivityService.pollSeat (cyclomatic 51): SeatStructuralActivityService.pollSeat has cyclomatic complexity 51 (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/daemon/src/domain/seat-structural-activity-service.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"67941be8dc3c308d28a2f42c4f4acb2611a58357822ba9000b4ce1cd820eedcf"}},{"ruleId":"D1","level":"warning","message":{"text":"grow.growCommand (cyclomatic 51): grow.growCommand has cyclomatic complexity 51 (threshold 15). Most of this is not in the body itself: 1 of the 51 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 60, 134). 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/commands/grow.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"98faabbf38342a98d910785bc029fdeb99b91ede61fa8b4e74b13602adcdca9b"}},{"ruleId":"D1","level":"warning","message":{"text":"pi-runner.createRunnerInput (cyclomatic 51): pi-runner.createRunnerInput has cyclomatic complexity 51 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 33 belong to 9 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb84fee928868f9d7322bd341ed03cc67378bdd2a70fd8ef7970afe100969ab"}},{"ruleId":"D1","level":"warning","message":{"text":"RigLifecycleService.removeNodeWithin (cyclomatic 51): RigLifecycleService.removeNodeWithin has cyclomatic complexity 51 (threshold 15). Of this number, 45 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":"packages/daemon/src/domain/rig-lifecycle-service.ts"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"c83be03a84974ad537a43228318684b07f904b7c6efcf786023257656fd9a3c4"}},{"ruleId":"D1","level":"warning","message":{"text":"InboundRouter.attemptAction (cyclomatic 50): InboundRouter.attemptAction has cyclomatic complexity 50 (threshold 15). Of this number, 39 points are the body\u0027s own statements and 11 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/daemon/src/domain/gateway/slack/inbound.ts"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5d1016fc93acbf32224eb91bf524f467df96a59a21943713829271f36f1a6f"}},{"ruleId":"D1","level":"warning","message":{"text":"EnvironmentStartup.launch (cyclomatic 50): EnvironmentStartup.launch has cyclomatic complexity 50 (threshold 15). Of this number, 46 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/daemon/src/domain/environment-startup.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"be3aaebb23975ec02fbd95b2ed44db4d950fd8728d1f29f4fb11d8048b59cdaa"}},{"ruleId":"D1","level":"warning","message":{"text":"connector.runAcpAssignment (cyclomatic 50): connector.runAcpAssignment has cyclomatic complexity 50 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 30 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":"packages/cli/src/acp/connector.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"b874fcd56ee75c021f9569da28a4219578fb29d76c5e92455397f3055b046026"}},{"ruleId":"D1","level":"warning","message":{"text":"package.packageCommand (cyclomatic 50): package.packageCommand has cyclomatic complexity 50 (threshold 15). Most of this is not in the body itself: 1 of the 50 points is its own statement and the rest belongs to 6 function items inside it that branch (a function literal at line 126, a function literal at line 62, a function literal at line 219, \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/commands/package.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b11199eefb41cbc6bf7adfff482cb1af4b5e0398eb0d015c00e0d921edb885"}},{"ruleId":"D1","level":"warning","message":{"text":"policy.registerPermissionCommands (cyclomatic 50): policy.registerPermissionCommands has cyclomatic complexity 50 (threshold 15). Most of this is not in the body itself: 1 of the 50 points is its own statement and the rest belongs to 6 function literals inside it that branch (lines 189, 235, 367, \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/commands/policy.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"473aaac2bd09e9b3dea2291623c0058619291323a15409092f14c741107676e1"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeCodeAdapter.verifyResumeLaunch (cyclomatic 50): ClaudeCodeAdapter.verifyResumeLaunch 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":"packages/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"136e6c92f8ee5eabf332ece5edf17d566839289a9e2e6b3d16f2e07058ab29e8"}},{"ruleId":"D1","level":"warning","message":{"text":"RigSpecCodec.serialize (cyclomatic 50): RigSpecCodec.serialize has cyclomatic complexity 50 (threshold 15). Most of this is not in the body itself: 14 of the 50 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 152, 126). 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/daemon/src/domain/rigspec-codec.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"99aaa45d9a2c5017965d938c13488482d343e9a138b463b88e6aa5462c05746b"}},{"ruleId":"D1","level":"warning","message":{"text":"manifest-parser.parseProfiles (cyclomatic 50): manifest-parser.parseProfiles 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":"packages/daemon/src/domain/context-packs/manifest-parser.ts"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1a02f589a92429181195d68f83ed1c373eb25409a87bd92daed3ea2358f2a8"}},{"ruleId":"D1","level":"warning","message":{"text":"relay-inbound.createRelayInboundHandler.ackOutbox (cyclomatic 50): relay-inbound.createRelayInboundHandler.ackOutbox has cyclomatic complexity 50 (threshold 15). Most of this is not in the body itself: 10 of the 50 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 1051, 1070, 1087). 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/daemon/src/domain/gateway/relay-inbound.ts"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d5153ec4f5ab4d1b166fede17e0066b241850f677f6cdb37cac1194cb654f2"}},{"ruleId":"D1","level":"warning","message":{"text":"ThreadRecovery.page (cyclomatic 50): ThreadRecovery.page has cyclomatic complexity 50 (threshold 15). Of this number, 45 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":"packages/daemon/src/domain/gateway/slack/thread-recovery.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"217d8ebeeb46b79da24903a5c3a6e5dea007af0e0cbd24f851265d919583bc10"}},{"ruleId":"D1","level":"warning","message":{"text":"attention-model.attentionLines (cyclomatic 50): attention-model.attentionLines has cyclomatic complexity 50 (threshold 15). Of this number, 47 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/tui/src/attention/attention-model.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b216a43cf5c82b4e137e4497a55e970405ed1b44b2a939e11b873d565ebf40c"}},{"ruleId":"D1","level":"warning","message":{"text":"tmux-server-selection.selectTmuxServer (cyclomatic 49): tmux-server-selection.selectTmuxServer 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":"packages/daemon/src/domain/tmux-server-selection.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"f120532028187c222d4ca2bb2f2f1576658c263250f64392ddaafe73e3a0a5a3"}},{"ruleId":"D1","level":"warning","message":{"text":"human-registry.validateHumanFragment (cyclomatic 49): human-registry.validateHumanFragment 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":"packages/daemon/src/domain/gateway/human-registry.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"d36fcd47c19515cf9f75fffc17dc7968d85ed3d43390522ed9aafc7a5647737a"}},{"ruleId":"D1","level":"warning","message":{"text":"node-inventory.buildRestoreOutcomeMap (cyclomatic 49): node-inventory.buildRestoreOutcomeMap 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":"packages/daemon/src/domain/node-inventory.ts"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"8abba555a14af7d42dd0df8cd560427407077b222e18a38d638f02d28ad0f00d"}},{"ruleId":"D1","level":"warning","message":{"text":"ask.askCommand (cyclomatic 49): ask.askCommand has cyclomatic complexity 49 (threshold 15). Most of this is not in the body itself: 1 of the 49 points is its own statement and the rest belongs to one function literal inside it that branches (line 180). 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/commands/ask.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa04a774e4096501d4d524398e20bc75a8dde7406b6fdb0bb6a0fda84e79ed3"}},{"ruleId":"D1","level":"warning","message":{"text":"scope.buildSliceCloseCommand (cyclomatic 49): scope.buildSliceCloseCommand has cyclomatic complexity 49 (threshold 15). Most of this is not in the body itself: 1 of the 49 points is its own statement and the rest belongs to one function literal inside it that branches (line 576). 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/commands/scope.ts"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"14214c86530aa310ac044a34c9201042dd02a15b962b691c87e8ab3136a94cba"}},{"ruleId":"D1","level":"warning","message":{"text":"up.formatRemoteUpFailure (cyclomatic 49): up.formatRemoteUpFailure has cyclomatic complexity 49 (threshold 15). 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, separate the cases: extract each independent branch into its own 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/commands/up.ts"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e2e7973c3e91705005d363fff43d6b6a037c53a14a2bd60cec1dd92f6fdd08"}},{"ruleId":"D1","level":"warning","message":{"text":"subscription-move-report.checkMoveReport (cyclomatic 49): subscription-move-report.checkMoveReport has cyclomatic complexity 49 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 29 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/daemon/src/domain/provider/subscription-move-report.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"108a2f00027ebacc55e2405005fac25a7242cd5c942e8edb73258d3ce1e4425d"}},{"ruleId":"D1","level":"warning","message":{"text":"RigTeardownOrchestrator.teardown (cyclomatic 49): RigTeardownOrchestrator.teardown has cyclomatic complexity 49 (threshold 15). 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, separate the cases: extract each independent branch into its own 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/daemon/src/domain/rig-teardown.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8bd17e716df7f57128d96a2272efa4bf47897c2d326fcb973477ee923f6f822"}},{"ruleId":"D1","level":"warning","message":{"text":"terminal-model.terminalLines (cyclomatic 49): terminal-model.terminalLines has cyclomatic complexity 49 (threshold 15). Of this number, 44 points are the body\u0027s own statements and 5 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/tui/src/terminals/terminal-model.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"f49cb59939b24872bd36788111b1e8fa7602741faa45d3199199602c3faa56af"}},{"ruleId":"D1","level":"warning","message":{"text":"render.renderPulseScreen (cyclomatic 49): render.renderPulseScreen has cyclomatic complexity 49 (threshold 15). 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, separate the cases: extract each independent branch into its own 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/tui/src/render.ts"},"region":{"startLine":1640}}}],"partialFingerprints":{"codehealthFindingId/v1":"7047ca44961aafa2edfbb407cb3afd404eb686fee307cecd076a987d1c4b30cb"}},{"ruleId":"D1","level":"warning","message":{"text":"DraftAwareDelivery.attempt (cyclomatic 48): DraftAwareDelivery.attempt has cyclomatic complexity 48 (threshold 15). Of this number, 40 points are the body\u0027s own statements and 8 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/daemon/src/domain/draft-aware-delivery.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6fa9bce575b1ae3c01de53c97b6c618448e53b3f329f30c388363a273ddde04"}},{"ruleId":"D1","level":"warning","message":{"text":"bundle-behaviour.formatBundleBehaviour (cyclomatic 48): bundle-behaviour.formatBundleBehaviour has cyclomatic complexity 48 (threshold 15). Of this number, 41 points are the body\u0027s own statements and 7 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/bundle-behaviour.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f778d6c39749e63c2091276b5c7772e9cac684d6c2aa2ee17f63b2ac7875b5"}},{"ruleId":"D1","level":"warning","message":{"text":"seat.seatCommand::runLifecycleVerb (cyclomatic 48): seat.seatCommand::runLifecycleVerb 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":"packages/cli/src/commands/seat.ts"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a3468a29792a341cad0e9cb49f43fd6404b79e29874f422665b1e91d4c4f8dc"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkflowRuntime.route (cyclomatic 48): WorkflowRuntime.route has cyclomatic complexity 48 (threshold 15). Most of this is not in the body itself: 2 of the 48 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 1550, 1563, 1661, \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/daemon/src/domain/workflow-runtime.ts"},"region":{"startLine":1520}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a412ba29f4c10143914d63a03aa9b636412382d68bbd7c1d0a2319d5fc22412"}},{"ruleId":"D1","level":"warning","message":{"text":"queue-wake-ladder.readWakeLadderBackstop (cyclomatic 47): queue-wake-ladder.readWakeLadderBackstop has cyclomatic complexity 47 (threshold 15). Of this number, 45 points are the body\u0027s own statements and 2 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/daemon/src/domain/queue-wake-ladder.ts"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"047e2906e2b81c1133e4aa78612ddc44745971f0ce5269329e3ca5d9be560832"}},{"ruleId":"D1","level":"warning","message":{"text":"EnvironmentLifecycle.recreate (cyclomatic 47): EnvironmentLifecycle.recreate has cyclomatic complexity 47 (threshold 15). Of this number, 46 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/daemon/src/domain/environment-lifecycle.ts"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed7487528a5c9287f590d96c7e2ded2f05778d009bcdc8f7ab9a803501352431"}},{"ruleId":"D1","level":"warning","message":{"text":"walk-consumption.analyzeWalkSuffix (cyclomatic 47): walk-consumption.analyzeWalkSuffix has cyclomatic complexity 47 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 9 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/lib/walk-consumption.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"c091cb20dc1f599d041dbea2b615abee4faffebde01f6d1f69a06801201cab9c"}},{"ruleId":"D1","level":"warning","message":{"text":"skills.skillsRoutes (cyclomatic 47): skills.skillsRoutes has cyclomatic complexity 47 (threshold 15). Most of this is not in the body itself: 1 of the 47 points is its own statement and the rest belongs to 9 function items inside it that branch (a function literal at line 187, a function literal at line 124, a function literal at line 206, \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/daemon/src/routes/skills.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a307c9863e5ce65033c81889e0228126fd4a1d0412e3043423b396336fe99c"}},{"ruleId":"D1","level":"warning","message":{"text":"queue.queueRoutes::errorResponse (cyclomatic 47): queue.queueRoutes::errorResponse has cyclomatic complexity 47 (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 (queue.queueRoutes::crossHostHandoff) 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/daemon/src/routes/queue.ts"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"671fb1e3fb46f7e13d97b943679d160778cf401ea7e5b1a8f9a87f4ce4a1fa2a"}},{"ruleId":"D1","level":"warning","message":{"text":"restore-packet.restorePacketCommand (cyclomatic 46): restore-packet.restorePacketCommand has cyclomatic complexity 46 (threshold 15). Most of this is not in the body itself: 1 of the 46 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 457, 287, 378). 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/commands/restore-packet.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"9768e57746eb5349c2e11318831a063a4d2846217bcb09c16c333b9098c5c0b1"}},{"ruleId":"D1","level":"warning","message":{"text":"SnapshotCapture.captureSnapshot (cyclomatic 46): SnapshotCapture.captureSnapshot has cyclomatic complexity 46 (threshold 15). Of this number, 43 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/daemon/src/domain/snapshot-capture.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"854754490fee80fb97a0b3970d706c2627acdd81ff36640c524d1697a97cd503"}},{"ruleId":"D1","level":"warning","message":{"text":"SeatHandoverService.recover (cyclomatic 46): SeatHandoverService.recover has cyclomatic complexity 46 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"802687942b08ddde8f7b713611cade4621b3ece3a1e31614ff5a0ed3c5168309"}},{"ruleId":"D1","level":"warning","message":{"text":"SeatHandoverService.commit (cyclomatic 46): SeatHandoverService.commit has cyclomatic complexity 46 (threshold 15). Most of this is not in the body itself: 14 of the 46 points are its own statements and the rest belongs to one function literal inside it that branches (line 1886). 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/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":1864}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f076e478c432ed5c5424f77f792880f9043fd8b8dc4b4aa185925566153d4a"}},{"ruleId":"D1","level":"warning","message":{"text":"rig-mode.rigModeRoutes (cyclomatic 46): rig-mode.rigModeRoutes has cyclomatic complexity 46 (threshold 15). Most of this is not in the body itself: 1 of the 46 points is its own statement and the rest belongs to 7 function items inside it that branch (a function literal at line 189, a function literal at line 223, unset, \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/daemon/src/routes/rig-mode.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf49950f5ce0346ab3ed82c01a574cf7e0733e2566d5fc7616729941cc154149"}},{"ruleId":"D1","level":"warning","message":{"text":"render.instanceContentLines (cyclomatic 46): render.instanceContentLines has cyclomatic complexity 46 (threshold 15). Of this number, 39 points are the body\u0027s own statements and 7 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/tui/src/render.ts"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b442d1c65a8d94af10b484023819be3b2405a1bb108c3134340a7a04ac5302"}},{"ruleId":"D1","level":"warning","message":{"text":"generated-file-hygiene.excludeNewGeneratedFiles (cyclomatic 45): generated-file-hygiene.excludeNewGeneratedFiles has cyclomatic complexity 45 (threshold 15). Of this number, 37 points are the body\u0027s own statements and 8 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":"packages/daemon/src/domain/generated-file-hygiene.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"428b4a0c240ac5bf00864f2d1442d1e002a33a88ea39a085386137d14c77f50b"}},{"ruleId":"D1","level":"warning","message":{"text":"skill-catalog.readOwnershipManifest (cyclomatic 45): skill-catalog.readOwnershipManifest has cyclomatic complexity 45 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 19 belong to 4 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/daemon/src/domain/skill-catalog.ts"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"43efb469ea28b9c325a7bc3c7e53a9f21e117b3883601e0bfc4f7e0199aa9f5c"}},{"ruleId":"D1","level":"warning","message":{"text":"RigSpecSchema.validate (cyclomatic 45): RigSpecSchema.validate 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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"70baeb25a3f929f04c6152b8e22c4a76722db8bf2c19b8e54ec52dc77d9616a8"}},{"ruleId":"D1","level":"warning","message":{"text":"hosts-registry-reader.validateHostRegistry (cyclomatic 45): hosts-registry-reader.validateHostRegistry 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/daemon/src/domain/hosts/hosts-registry-reader.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ca07cc81057e00f24ae2fcbc7c26f0c4a6add8c0d79d172fedaaf0c9cdb1a3"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionTransport.sendClassified (cyclomatic 45): SessionTransport.sendClassified has cyclomatic complexity 45 (threshold 15). Of this number, 40 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":2858}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c47717e8757b4a0d5cc8f00a7768f6889497a3b9b5ea0909c7b8ba4289ffc37"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeCompactionEnforcer.triggerManualCompactUnchecked (cyclomatic 45): ClaudeCompactionEnforcer.triggerManualCompactUnchecked has cyclomatic complexity 45 (threshold 15). Of this number, 36 points are the body\u0027s own statements and 9 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab00a1ef54ae517acb61ac9b3bb4e8bd627c5a9b5990fa6fa790ee87806c6ccd"}},{"ruleId":"D1","level":"warning","message":{"text":"host-registry.validateHostRegistry (cyclomatic 45): host-registry.validateHostRegistry 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/cli/src/host-registry.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"773677d915234a6c1b0237a8db5c27882615918bab9c1a142b3e00fb50a2e93e"}},{"ruleId":"D1","level":"warning","message":{"text":"queue-receipt.rowLines (cyclomatic 45): queue-receipt.rowLines 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/cli/src/queue-receipt.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"2292fba6fbc1650872d841f7f7ae0c769807aa3f9919f0a6c0e2265f53857a00"}},{"ruleId":"D1","level":"warning","message":{"text":"execution-view.buildExecutionView::ladderOf (cyclomatic 45): execution-view.buildExecutionView::ladderOf 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. This shape REPEATS in the file: one other method here (execution-view.buildExecutionView) 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/daemon/src/domain/execution-view.ts"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"42db4e833c7e2e3e6f96f88b9cd95a11afec6966ea26f5d969707ea9ce6a6d53"}},{"ruleId":"D1","level":"warning","message":{"text":"compaction.compactionRoutes (cyclomatic 45): compaction.compactionRoutes has cyclomatic complexity 45 (threshold 15). Most of this is not in the body itself: 1 of the 45 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 28, 152, 133). 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/daemon/src/routes/compaction.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1a7005a5af45fa732d1229d718c568049b7fa337ead7dc7bb562f839466c21"}},{"ruleId":"D1","level":"warning","message":{"text":"OutboxHandler.admitRunner (cyclomatic 44): OutboxHandler.admitRunner has cyclomatic complexity 44 (threshold 15). Most of this is not in the body itself: 2 of the 44 points are its own statements and the rest belongs to one function literal inside it that branches (line 248). 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/daemon/src/domain/outbox-handler.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"26169ae622c4e05605b3f8bc21f6536323833940677333a90839eaf3cbfb53ac"}},{"ruleId":"D1","level":"warning","message":{"text":"seat-launch-additions.prepareSeatLaunchAdditions (cyclomatic 44): seat-launch-additions.prepareSeatLaunchAdditions has cyclomatic complexity 44 (threshold 15). Of this number, 43 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/daemon/src/domain/seat-launch-additions.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b82b7d0dc789c3e55f888514b2e402b590e986f44f6cc9bb5b40b7735a9c7a2"}},{"ruleId":"D1","level":"warning","message":{"text":"human-registry.setHumanField (cyclomatic 44): human-registry.setHumanField has cyclomatic complexity 44 (threshold 15). Of this number, 41 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/daemon/src/domain/gateway/human-registry.ts"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08a07b67ab11dc72e2e730002b774e67cbbf81cdc1d1e30946160b4b29ee8ab"}},{"ruleId":"D1","level":"warning","message":{"text":"rosters.parseRoster.members (cyclomatic 44): rosters.parseRoster.members 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":"packages/daemon/src/domain/rosters.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"a48b1933c8c8bc2ecffc32edb2395fc930524df7a144bbaf635965932ee2e91e"}},{"ruleId":"D1","level":"warning","message":{"text":"QueueRepository.waitingView (cyclomatic 44): QueueRepository.waitingView 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":"packages/daemon/src/domain/queue-repository.ts"},"region":{"startLine":6265}}}],"partialFingerprints":{"codehealthFindingId/v1":"6648c4378e34abfec9899c585836a6d4553fb9d522afe4331784c4d32d22e3d6"}},{"ruleId":"D1","level":"warning","message":{"text":"native-resume-probe.assessNativeResumeProbe (cyclomatic 44): native-resume-probe.assessNativeResumeProbe 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":"packages/daemon/src/domain/native-resume-probe.ts"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd7468789fc40e68ad6e27e8860ee3a373c38aaee33ce8a2d8d5e6a03308c253"}},{"ruleId":"D1","level":"warning","message":{"text":"export.exportCommand (cyclomatic 44): export.exportCommand has cyclomatic complexity 44 (threshold 15). Most of this is not in the body itself: 1 of the 44 points is its own statement and the rest belongs to one function literal inside it that branches (line 72). 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/commands/export.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"c20f516b2d85b34f3ad1f72ff281d9e0a92f1fcd3767802b1563e23ec5d290da"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-owned-plugin-trust.planOwnedCodexContentApproval (cyclomatic 44): codex-owned-plugin-trust.planOwnedCodexContentApproval has cyclomatic complexity 44 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 15 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/daemon/src/domain/codex-owned-plugin-trust.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a31e4ab737e2bcb4f6521e5ea1e51f51e65ab5323d192f153b375de45ca2c08"}},{"ruleId":"D1","level":"warning","message":{"text":"pi-runner.parseRunnerArgs (cyclomatic 44): pi-runner.parseRunnerArgs has cyclomatic complexity 44 (threshold 15). Of this number, 43 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":1929}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d42acc97c3e5913a4a74eff5a8426d884665c1d3ac5601c8421f350b4070ce1"}},{"ruleId":"D1","level":"warning","message":{"text":"manifest-parser.parseAgentImageManifest (cyclomatic 44): manifest-parser.parseAgentImageManifest has cyclomatic complexity 44 (threshold 15). Of this number, 43 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/daemon/src/domain/agent-images/manifest-parser.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"483d41439f9159dd41bd801ee7ed74347bdfc23df018c7f375e6be4a016fbe53"}},{"ruleId":"D1","level":"warning","message":{"text":"PodRigInstantiator.addMemberToPod (cyclomatic 44): PodRigInstantiator.addMemberToPod has cyclomatic complexity 44 (threshold 15). Of this number, 37 points are the body\u0027s own statements and 7 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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c5d9e3725d229094a3668960a37fb31817e87fa756954a14da1eca4e920c96"}},{"ruleId":"D1","level":"warning","message":{"text":"connections-projection.connectionsProjection (cyclomatic 44): connections-projection.connectionsProjection has cyclomatic complexity 44 (threshold 15). Of this number, 41 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/daemon/src/domain/gateway/connections-projection.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"bffe3a0d91fa4dad14b534d04667fb5af627b31c3eaba3dc538108b363e6b485"}},{"ruleId":"D1","level":"warning","message":{"text":"WatchdogPolicyEngine.recordAttempt (cyclomatic 44): WatchdogPolicyEngine.recordAttempt has cyclomatic complexity 44 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 13 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/daemon/src/domain/watchdog-policy-engine.ts"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a411947fbcd9d3ba0338c0fac73086747a64cf927b7311ec7b0a3f469d6900"}},{"ruleId":"D1","level":"warning","message":{"text":"workflow-model.workflowDetail (cyclomatic 44): workflow-model.workflowDetail 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":"packages/tui/src/execution/workflow-model.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd668f574f2062cd51d6745fd5cde00c60ad67f519b850733d2b6980f9d56e4"}},{"ruleId":"D1","level":"warning","message":{"text":"SeatDeliveryGuard.beforeInput (cyclomatic 43): SeatDeliveryGuard.beforeInput has cyclomatic complexity 43 (threshold 15). Of this number, 40 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/daemon/src/domain/seat-delivery-guard.ts"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"3912ba87d6f208023d538808abdd0d09b1928eb9c5711805213180fae6a37d47"}},{"ruleId":"D1","level":"warning","message":{"text":"SliceIndexer.ensureMembershipIndex (cyclomatic 43): SliceIndexer.ensureMembershipIndex has cyclomatic complexity 43 (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/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":1361}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9a59ce820e5f49a7450faf5bff6d18e38dd294299fcc7eaf21453923953cfd"}},{"ruleId":"D1","level":"warning","message":{"text":"environment.environmentCommand (cyclomatic 43): environment.environmentCommand has cyclomatic complexity 43 (threshold 15). Most of this is not in the body itself: 4 of the 43 points are its own statements and the rest belongs to 12 function items inside it that branch (a function literal at line 75, a function literal at line 84, a function literal at line 116, \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/commands/environment.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef697e9d5b52025b87992a3bae30c9ff47df4e1cd25c8b046cb952dd066b098"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaimService.reconcileSession (cyclomatic 43): ClaimService.reconcileSession has cyclomatic complexity 43 (threshold 15). Of this number, 42 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/daemon/src/domain/claim-service.ts"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ac2add56bb2aabbb1aa4cda2843e730a8aecd211ace433c5b2a6e0fd9bf174"}},{"ruleId":"D1","level":"warning","message":{"text":"rigs.rigsRoutes.post(\u0022/:id/attach-self\u0022) (cyclomatic 43): rigs.rigsRoutes.post(\u0022/:id/attach-self\u0022) has cyclomatic complexity 43 (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/daemon/src/routes/rigs.ts"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f38cea691e02f45d4b9928c8420d5e0becb37ac6368a813e49b6cfbd3670a0e"}},{"ruleId":"D1","level":"warning","message":{"text":"chat.chatRoutes (cyclomatic 43): chat.chatRoutes has cyclomatic complexity 43 (threshold 15). Most of this is not in the body itself: 1 of the 43 points is its own statement and the rest belongs to 7 function literals inside it that branch (lines 154, 28, 65, \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/daemon/src/routes/chat.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a2ad84276df0a50b1c896a92a3b8a8536ed6419196a5f6d42a3e3929cf432bc"}},{"ruleId":"D1","level":"warning","message":{"text":"OutboxHandler.updateRunner (cyclomatic 42): OutboxHandler.updateRunner has cyclomatic complexity 42 (threshold 15). Most of this is not in the body itself: 1 of the 42 points is its own statement and the rest belongs to one function literal inside it that branches (line 294). 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/daemon/src/domain/outbox-handler.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4b3fca72cf2ba22d13feff4035e65d36b6a69640e49a99daa7091ceb8a222c"}},{"ruleId":"D1","level":"warning","message":{"text":"seat-skill-storage.cleanSeatSkills (cyclomatic 42): seat-skill-storage.cleanSeatSkills has cyclomatic complexity 42 (threshold 15). Of this number, 34 points are the body\u0027s own statements and 8 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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba6d80023831ed4879018f711b0925c5023464e12a5902561e3479aeda481c9"}},{"ruleId":"D1","level":"warning","message":{"text":"CommunityHarnessRuntimeAdapter.launchHarness (cyclomatic 42): CommunityHarnessRuntimeAdapter.launchHarness has cyclomatic complexity 42 (threshold 15). Of this number, 39 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/daemon/src/adapters/community-harness-runtime-adapter.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c1094fa55485ab7fa6321d3f2aabc5935b0b8599a6028de055ce86f58e03c8"}},{"ruleId":"D1","level":"warning","message":{"text":"daemon.daemonCommand (cyclomatic 42): daemon.daemonCommand has cyclomatic complexity 42 (threshold 15). Most of this is not in the body itself: 1 of the 42 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 200, 337, 324, \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/commands/daemon.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd1969f54d85e54b7017c7a542d27a979e8d23d06f61450988909e412bc41fc"}},{"ruleId":"D1","level":"warning","message":{"text":"whoami.whoamiCommand (cyclomatic 42): whoami.whoamiCommand has cyclomatic complexity 42 (threshold 15). Most of this is not in the body itself: 1 of the 42 points is its own statement and the rest belongs to one function literal inside it that branches (line 309). 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/commands/whoami.ts"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"80416088c6586eedae161bde91a20be83a91c61903e6a2713fe51ddd57d51b20"}},{"ruleId":"D1","level":"warning","message":{"text":"rigspec-preflight.preflightMembers (cyclomatic 42): rigspec-preflight.preflightMembers 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/daemon/src/domain/rigspec-preflight.ts"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"c993d1ac7bb448be56833a6a2334938c74a990996205482ff01a770561fd7d92"}},{"ruleId":"D1","level":"warning","message":{"text":"open-asks.postOpenAsks (cyclomatic 42): open-asks.postOpenAsks has cyclomatic complexity 42 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 16 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/daemon/src/domain/gateway/slack/open-asks.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1759eab991b35e7ec7bec024015fa4dfcbe5383e35450235def639b924ae18"}},{"ruleId":"D1","level":"warning","message":{"text":"stream-dispositions.validateDisposition (cyclomatic 42): stream-dispositions.validateDisposition 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":"packages/daemon/src/domain/stream-dispositions.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a2805d766ef50d48359cde6da50843a365df4f4d809036eabfdd9c1784a57d2"}},{"ruleId":"D1","level":"warning","message":{"text":"ProjectTreeView.ProjectTreeView (cyclomatic 42): ProjectTreeView.ProjectTreeView has cyclomatic complexity 42 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 24 belong to 9 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/ui/src/components/project/ProjectTreeView.tsx"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"217c111946e2d715491ebd8d28dab334b0dd8304b94a43cdf02549f450513140"}},{"ruleId":"D1","level":"warning","message":{"text":"migrate-telemetry-state-0.5.9.applyLibrary (cyclomatic 42): migrate-telemetry-state-0.5.9.applyLibrary 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, separate the cases: extract each independent branch into its own 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/_canonical/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a951a4f954e622b07637711f39828a10acf5cdded9fd7ab327bab9aeac1aa9a"}},{"ruleId":"D1","level":"warning","message":{"text":"ResumeMetadataRefresher.refresh (cyclomatic 41): ResumeMetadataRefresher.refresh 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/daemon/src/domain/resume-metadata-refresher.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"885cdebb0c8b130f637c925a74ba51f75eea77de31423a9433d40a7da293ff4e"}},{"ruleId":"D1","level":"warning","message":{"text":"message.buildOutboundMessage (cyclomatic 41): message.buildOutboundMessage has cyclomatic complexity 41 (threshold 15). Of this number, 40 points are the body\u0027s own statements and 1 belongs 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/daemon/src/domain/gateway/slack/message.ts"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dbb304d382e615937b1612c931dbcab923130cacb1ff755df5d78f079cb320d"}},{"ruleId":"D1","level":"warning","message":{"text":"SeatActivityService.observeSeat (cyclomatic 41): SeatActivityService.observeSeat 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/daemon/src/domain/seat-activity-service.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"58436b63fec8fc8a7c1a9334277fd3536b7daddfa79b88281a18c312991e5d86"}},{"ruleId":"D1","level":"warning","message":{"text":"SeatActivityService.arbitrate (cyclomatic 41): SeatActivityService.arbitrate 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/daemon/src/domain/seat-activity-service.ts"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e65f7e952874390853e0d86bd96f256c351e5b4773c4e1af448f6f6f9ba82d"}},{"ruleId":"D1","level":"warning","message":{"text":"add.addMemberCommand (cyclomatic 41): add.addMemberCommand has cyclomatic complexity 41 (threshold 15). Most of this is not in the body itself: 1 of the 41 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 48, 99). 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/commands/add.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bd7cf729a96dcfabe83fd2baadca33c9022781d432b7798777e51c7880e4b96"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp-http.grantServiceCaller (cyclomatic 41): mcp-http.grantServiceCaller 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/cli/src/mcp-http.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23a4f19166476ffd5ca5319a0fa1d87293d8e23a2f6016ac4b18a88d59937d9"}},{"ruleId":"D1","level":"warning","message":{"text":"host.doctorLegs (cyclomatic 41): host.doctorLegs 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/cli/src/commands/host.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"6603113f48a6b7e9ae1c72e11a1e36cd73cc27f506026736208e041561c95b6e"}},{"ruleId":"D1","level":"warning","message":{"text":"HealthDiagnosisService.evaluateOnce (cyclomatic 41): HealthDiagnosisService.evaluateOnce has cyclomatic complexity 41 (threshold 15). Of this number, 40 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/daemon/src/domain/health-diagnosis.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"29aba5da873493532a980551fd3fe7418f2c4d7576b7b919efa62fed2f8b7bd8"}},{"ruleId":"D1","level":"warning","message":{"text":"task-terminal-view.readTaskTerminalSnapshot (cyclomatic 41): task-terminal-view.readTaskTerminalSnapshot has cyclomatic complexity 41 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 15 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/daemon/src/domain/terminal/task-terminal-view.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"1950e8909fe729fdfbb6a6c47624c85fca7931c4f509a1299bac055b71f169e4"}},{"ruleId":"D1","level":"warning","message":{"text":"scope-task-terminal-view.readScopedTaskTerminalView (cyclomatic 41): scope-task-terminal-view.readScopedTaskTerminalView has cyclomatic complexity 41 (threshold 15). Most of this is not in the body itself: 9 of the 41 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 180, 170, 204, \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/daemon/src/domain/terminal/scope-task-terminal-view.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"20196fb6321cec6c7997256e1f714c3f48d2830e07e480520501c485b16237a0"}},{"ruleId":"D1","level":"warning","message":{"text":"up.upRoutes.post(\u0022/\u0022) (cyclomatic 41): up.upRoutes.post(\u0022/\u0022) has cyclomatic complexity 41 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 9 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":"packages/daemon/src/routes/up.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ea32d4628ef3fb03bd76a8675a4e1ac52b2b63763e4bbab067a652cda51291"}},{"ruleId":"D1","level":"warning","message":{"text":"startup.startupRoutes.post(\u0022/:rigId/:logicalId\u0022) (cyclomatic 41): startup.startupRoutes.post(\u0022/:rigId/:logicalId\u0022) has cyclomatic complexity 41 (threshold 15). Most of this is not in the body itself: 3 of the 41 points are its own statements and the rest belongs to one function literal inside it that branches (line 579). 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/daemon/src/routes/startup.ts"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6905ac93aaecbff7f6c6c14a0d59769c389bed31880804f193aecb6eee2c03"}},{"ruleId":"D1","level":"warning","message":{"text":"queue.queueRoutes::crossHostHandoff (cyclomatic 41): queue.queueRoutes::crossHostHandoff has cyclomatic complexity 41 (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 (queue.queueRoutes::errorResponse) 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/daemon/src/routes/queue.ts"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a13b9478cc352f873b741b20e5d1eac122d8666a6d2f107e6969dea3d1e32d6"}},{"ruleId":"D1","level":"warning","message":{"text":"useActivityFeed.eventSummary (cyclomatic 41): useActivityFeed.eventSummary has cyclomatic complexity 41 (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":"packages/ui/src/hooks/useActivityFeed.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ca241d0eca3c69602c97337d3b67fdead06b8b026732ac9869a9289f6ffc49"}},{"ruleId":"D1","level":"warning","message":{"text":"DiscoveryPanel.DiscoveryPanel (cyclomatic 41): DiscoveryPanel.DiscoveryPanel has cyclomatic complexity 41 (threshold 15). Most of this is not in the body itself: 3 of the 41 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 260, handleConfirm, a function literal at line 153, \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/ui/src/components/DiscoveryPanel.tsx"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c834cb6a0053a941ec1c5462ef6359ad42e50dada9ce9b1b9b7393d19564380"}},{"ruleId":"D1","level":"warning","message":{"text":"VerbActions.VerbActions (cyclomatic 41): VerbActions.VerbActions has cyclomatic complexity 41 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 12 belong to 6 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/ui/src/components/mission-control/components/VerbActions.tsx"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc454d8879795a0bef19f4b8c90d239be56278cc61a0a81a49613e6606f7f45"}},{"ruleId":"D1","level":"warning","message":{"text":"migrate-telemetry-state-0.5.9.rollback (cyclomatic 41): migrate-telemetry-state-0.5.9.rollback 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":"skills/_canonical/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"f64833e357e8abce437e8a78d7d2e247df3065625657fcac8460497aab4936de"}},{"ruleId":"D1","level":"warning","message":{"text":"seat-skill-storage.followPackagedSeatSkills (cyclomatic 40): seat-skill-storage.followPackagedSeatSkills has cyclomatic complexity 40 (threshold 15). Of this number, 38 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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"043d3511218cd98e102b627a267bd729a0edc5ca2c2ca23c283843e035f95c8c"}},{"ruleId":"D1","level":"warning","message":{"text":"judgments.readSliceReadiness (cyclomatic 40): judgments.readSliceReadiness has cyclomatic complexity 40 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 20 belong to 4 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/daemon/src/domain/proof/judgments.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e3f0b4e88c6f74a75d3171bdce67ef8463699da97e5fd917d8259a72cdade7d"}},{"ruleId":"D1","level":"warning","message":{"text":"CommunityHarnessRuntimeAdapter.launchPreset (cyclomatic 40): CommunityHarnessRuntimeAdapter.launchPreset 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":"packages/daemon/src/adapters/community-harness-runtime-adapter.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c21d105e055f1b057fff26f3df631e9c5965925d0e91522a8de0169f81d3988"}},{"ruleId":"D1","level":"warning","message":{"text":"seat.printHumanHandoverResult (cyclomatic 40): seat.printHumanHandoverResult 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":"packages/cli/src/commands/seat.ts"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"9105ab2f91630f77524e1d463e56a9e7a8307722451c2ca3719ceaa7ee9682d8"}},{"ruleId":"D1","level":"warning","message":{"text":"refocus.renderTrace (cyclomatic 40): refocus.renderTrace 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":"packages/daemon/assets/plugins/openrig-core/hooks/scripts/refocus.cjs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5938e2a8f42939d3f62c4bbe89b474f73d7a72cc41ca0210d8d89fe60862e36"}},{"ruleId":"D1","level":"warning","message":{"text":"CodexRuntimeAdapter.projectEntry (cyclomatic 40): CodexRuntimeAdapter.projectEntry 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":"packages/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":1460}}}],"partialFingerprints":{"codehealthFindingId/v1":"e39da79ae16c5e5c735360411d83bca27d9addd6ef6aa69ffb2283569b850aea"}},{"ruleId":"D1","level":"warning","message":{"text":"WhoamiService.resolve (cyclomatic 40): WhoamiService.resolve 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":"packages/daemon/src/domain/whoami-service.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a1d8b6c2e072ffb1469d39f3c5f5a13daf9fef90c2b820da424ddfc1523984"}},{"ruleId":"D1","level":"warning","message":{"text":"workflow-keepalive.makeWorkflowKeepalivePolicy.evaluate (cyclomatic 40): workflow-keepalive.makeWorkflowKeepalivePolicy.evaluate has cyclomatic complexity 40 (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/daemon/src/domain/policies/workflow-keepalive.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1cbdd753692e4807f15c52311622f189ff3b35c1fe8351a8efc8dcf5eabd63b"}},{"ruleId":"D1","level":"warning","message":{"text":"terminal.terminalRoutes (cyclomatic 40): terminal.terminalRoutes has cyclomatic complexity 40 (threshold 15). Most of this is not in the body itself: 1 of the 40 points is its own statement and the rest belongs to 7 function literals inside it that branch (lines 122, 95, 139, \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/daemon/src/routes/terminal.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe178cc3e74a4481c6683e40ffcb39593ad218ed8cf674816c5acbdd988829d0"}},{"ruleId":"D1","level":"warning","message":{"text":"stylize.stylizeLines (cyclomatic 40): stylize.stylizeLines has cyclomatic complexity 40 (threshold 15). Most of this is not in the body itself: 2 of the 40 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 139, 229, 158). 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/tui/src/stylize.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ee057660a1addb233223c40c2c9608744b22a158bf124b1459f902dfa7bbb9"}},{"ruleId":"D1","level":"warning","message":{"text":"ScopePages.MissionScopePage (cyclomatic 40): ScopePages.MissionScopePage has cyclomatic complexity 40 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 5 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/ui/src/components/project/ScopePages.tsx"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"503d9075f56ee8fd1c6955b9f1cac44d7da44a2a43a454b42838ba009cf5c194"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionTransport.diagnoseProducerLink (cyclomatic 39): SessionTransport.diagnoseProducerLink has cyclomatic complexity 39 (threshold 15). Of this number, 29 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":"packages/daemon/src/domain/session-transport.ts"},"region":{"startLine":4674}}}],"partialFingerprints":{"codehealthFindingId/v1":"59693fde6fbb31619e077d3bdc68b57e20d814a8e8fe9bb1301d63d6c05e5a73"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeCompactionEnforcer.noteEndedPreparation (cyclomatic 39): ClaudeCompactionEnforcer.noteEndedPreparation has cyclomatic complexity 39 (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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":2235}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4263bfa36d80c38a386acbac86771ca4a055ebbdd436dbf8ae060b6fcfa316"}},{"ruleId":"D1","level":"warning","message":{"text":"ask.askLiveRunner (cyclomatic 39): ask.askLiveRunner has cyclomatic complexity 39 (threshold 15). Of this number, 34 points are the body\u0027s own statements and 5 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/commands/ask.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c131cbf62c9d09b6d771c212b1f6ea844506273a61a67fa51e04fdcd36e4350"}},{"ruleId":"D1","level":"warning","message":{"text":"bootstrap.bootstrapCommand (cyclomatic 39): bootstrap.bootstrapCommand has cyclomatic complexity 39 (threshold 15). Most of this is not in the body itself: 1 of the 39 points is its own statement and the rest belongs to 2 function items inside it that branch (a function literal at line 47, getTarget). 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/commands/bootstrap.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6df92808ce34802718d518c3434b63456cf753a934641233f375b4f41cdf304"}},{"ruleId":"D1","level":"warning","message":{"text":"decisions.judge (cyclomatic 39): decisions.judge 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/decisions/decisions.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b2cabc23fce686876db4a15042b037c65eba56ecb2084c66b397a6fa8c4d40"}},{"ruleId":"D1","level":"warning","message":{"text":"pi-runner.mapPiEvent (cyclomatic 39): pi-runner.mapPiEvent 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f2cf5f1c08406b3b74b4bef96378d4cfdec727d354dda2476391f2531b6994"}},{"ruleId":"D1","level":"warning","message":{"text":"MissionControlWriteContract.actOn (cyclomatic 39): MissionControlWriteContract.actOn has cyclomatic complexity 39 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 12 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/daemon/src/domain/mission-control/mission-control-write-contract.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb13707baa31821e8a0427735c799079f61ea775ef1340a0d467ca33c633a81"}},{"ruleId":"D1","level":"warning","message":{"text":"SeatLifecycleService.readStartupContext (cyclomatic 39): SeatLifecycleService.readStartupContext 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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":2187}}}],"partialFingerprints":{"codehealthFindingId/v1":"3137e6534b1f01f144996b1e356b3a39364715316ea6e5c139f2d2d3ec32fda9"}},{"ruleId":"D1","level":"warning","message":{"text":"SeatRuntimeSwitchService.recover (cyclomatic 39): SeatRuntimeSwitchService.recover 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/daemon/src/domain/seat-runtime-switch-service.ts"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"9099b4fc36ed5d7dc16fac9b6c1fdf87b25a47d638df7fc3d551fa9a6b6e8984"}},{"ruleId":"D1","level":"warning","message":{"text":"watchdog-job-update.updateWatchdogJob (cyclomatic 39): watchdog-job-update.updateWatchdogJob 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/daemon/src/domain/watchdog-job-update.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32e9497a9e9c6e633930668916cf66d8ab0985743092cd0cd4585deb73bbcf0"}},{"ruleId":"D1","level":"warning","message":{"text":"rig-cmux.rigCmuxRoutes.post(\u0022/launch\u0022) (cyclomatic 39): rig-cmux.rigCmuxRoutes.post(\u0022/launch\u0022) 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/daemon/src/routes/rig-cmux.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b5e983e9aea1407865ac9728c1b574654543ae3773b422b03d1d0c02b6e89e"}},{"ruleId":"D1","level":"warning","message":{"text":"RigEnvPanel.RigEnvPanel (cyclomatic 39): RigEnvPanel.RigEnvPanel has cyclomatic complexity 39 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 22 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/ui/src/components/RigEnvPanel.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"be1bcb913a18d8fe08342e36685c8433d4212ec267ed8571819ba0288a292590"}},{"ruleId":"D1","level":"warning","message":{"text":"relay-outbound.validateRelayOutboundEnvelope (cyclomatic 38): relay-outbound.validateRelayOutboundEnvelope 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":"packages/daemon/src/domain/gateway/relay-outbound.ts"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b868daa9419edecfa4b2e4e544b0e564b00b5e011b3650f5cb51eaae4901d07"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeCompactionEnforcer.drainPendingStage (cyclomatic 38): ClaudeCompactionEnforcer.drainPendingStage has cyclomatic complexity 38 (threshold 15). Of this number, 36 points are the body\u0027s own statements and 2 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e094d7b9d24f6fe115551fa8d090c7d6c3f0ccd4ff584e038ffe76de2890689"}},{"ruleId":"D1","level":"warning","message":{"text":"host.postureCheck (cyclomatic 38): host.postureCheck has cyclomatic complexity 38 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 7 belong to 3 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/commands/host.ts"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c8e829bfe1deeb81ed14011a820245a90c989564476bcc189a1196de58dce9"}},{"ruleId":"D1","level":"warning","message":{"text":"usage.usageCommand (cyclomatic 38): usage.usageCommand has cyclomatic complexity 38 (threshold 15). Most of this is not in the body itself: 1 of the 38 points is its own statement and the rest belongs to 6 function items inside it that branch (a function literal at line 231, a function literal at line 143, a function literal at line 201, \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/commands/usage.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02621660e01c15e59a31bc5bd13a9906a7cfbddfeed52e1b85bf7e73be79997"}},{"ruleId":"D1","level":"warning","message":{"text":"OmpFrameDecoder.push (cyclomatic 38): OmpFrameDecoder.push has cyclomatic complexity 38 (threshold 15). Of this number, 36 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/daemon/src/adapters/omp-rpc-frame.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"408b17a605fd6c321b1512b56e881aeabd901c1c37e34298f4777e499864c54e"}},{"ruleId":"D1","level":"warning","message":{"text":"daemon-db-path.daemonDatabaseWarnings (cyclomatic 38): daemon-db-path.daemonDatabaseWarnings has cyclomatic complexity 38 (threshold 15). Most of this is not in the body itself: 12 of the 38 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 107, 106, 145, \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/daemon/src/daemon-db-path.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62a072676a02b35c76adb95028d6f6340238fe036943597665d6eb3ff5a2f49"}},{"ruleId":"D1","level":"warning","message":{"text":"RestoreOrchestrator.finishJoinedResume (cyclomatic 38): RestoreOrchestrator.finishJoinedResume has cyclomatic complexity 38 (threshold 15). Of this number, 31 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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":2647}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda9b87d656ff3ae70e40872162f9b45d263a86d8d4dbb4f330bfff7a24113e8"}},{"ruleId":"D1","level":"warning","message":{"text":"herdr-app-install.installRigMods (cyclomatic 38): herdr-app-install.installRigMods has cyclomatic complexity 38 (threshold 15). Of this number, 35 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/daemon/src/domain/terminal/herdr-app-install.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"162300f90c52db98fc48ae0b04d9568e1b99d81cc830c7b24ef855cecc2e4e11"}},{"ruleId":"D1","level":"warning","message":{"text":"watchdog-delivery-receipts.withWatchdogReceipts.deliver (cyclomatic 38): watchdog-delivery-receipts.withWatchdogReceipts.deliver has cyclomatic complexity 38 (threshold 15). Most of this is not in the body itself: 8 of the 38 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 93, 68). 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/daemon/src/domain/watchdog-delivery-receipts.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d8eee1c0858d32dee66693968a6a07c673110b894ca1ca5489be65d94428f89"}},{"ruleId":"D1","level":"warning","message":{"text":"bootstrap-failure-response.bootstrapFailureResponse (cyclomatic 38): bootstrap-failure-response.bootstrapFailureResponse has cyclomatic complexity 38 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 22 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/daemon/src/routes/bootstrap-failure-response.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8dc33892155384de5c9e9e2420fb788c42f03c42027db77a158598780294248"}},{"ruleId":"D1","level":"warning","message":{"text":"permission-stop-observation.admittedRules (cyclomatic 37): permission-stop-observation.admittedRules has cyclomatic complexity 37 (threshold 15). Of this number, 34 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/daemon/src/domain/permission-stop-observation.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"89eb71bb450c58184856c2f55627b78df07f7643119569f9285c6b42bb9002cc"}},{"ruleId":"D1","level":"warning","message":{"text":"agent-activity-store.normalizeRunnerObservations (cyclomatic 37): agent-activity-store.normalizeRunnerObservations has cyclomatic complexity 37 (threshold 15). Of this number, 35 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":"packages/daemon/src/domain/agent-activity-store.ts"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"c507cdf66df1a10845196fa5b09a14f61881b9df04f5d631dfff4ce4f78b09d4"}},{"ruleId":"D1","level":"warning","message":{"text":"expected-conversation.resolveExpectedConversation (cyclomatic 37): expected-conversation.resolveExpectedConversation has cyclomatic complexity 37 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 6 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/daemon/src/domain/expected-conversation.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a3503c8ef6017cc3302ec23a4fc2317fa95b3a927c32865ba1248c162fce94"}},{"ruleId":"D1","level":"warning","message":{"text":"tmux-control.tmuxControlExec::exec (cyclomatic 37): tmux-control.tmuxControlExec::exec 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":"packages/daemon/src/adapters/tmux-control.ts"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c0c229179bba93081adbc7e3786f5834e05a2bcccd8132162040729cda22c1c"}},{"ruleId":"D1","level":"warning","message":{"text":"InboundRouter.attemptBot (cyclomatic 37): InboundRouter.attemptBot 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":"packages/daemon/src/domain/gateway/slack/inbound.ts"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de1fd75859eec0503ee6c790fa2830d53b0fd50ccf1ada071ccfa2f49b1db3a"}},{"ruleId":"D1","level":"warning","message":{"text":"operator-delivery-engine.makeOperatorDeliveryEngine.dispatchEscalation (cyclomatic 37): operator-delivery-engine.makeOperatorDeliveryEngine.dispatchEscalation has cyclomatic complexity 37 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 6 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/daemon/src/domain/gateway/operator-delivery-engine.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4bfea294933b0b822afdd77803387636e8a8c41057bebc1dcf4a01987d863c3"}},{"ruleId":"D1","level":"warning","message":{"text":"SeatActivityService.reportEvidence (cyclomatic 37): SeatActivityService.reportEvidence has cyclomatic complexity 37 (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/daemon/src/domain/seat-activity-service.ts"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"d34e35441253e8caef96b5af76af2994e1c355c1d1f385477122621507a6834e"}},{"ruleId":"D1","level":"warning","message":{"text":"queue-stuck-sweep.deliveryResolutionEvidence (cyclomatic 37): queue-stuck-sweep.deliveryResolutionEvidence 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":"packages/daemon/src/domain/queue-stuck-sweep.ts"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"b126b0c31f8baf7bca6f2c3b361df9511e594e7f45f4da4ecf066b4a11f0226f"}},{"ruleId":"D1","level":"warning","message":{"text":"StartupOrchestrator.sendInteractiveText (cyclomatic 37): StartupOrchestrator.sendInteractiveText has cyclomatic complexity 37 (threshold 15). Of this number, 35 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/daemon/src/domain/startup-orchestrator.ts"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9311b465d214f56666b2a23dd703661c9e1dfaa355492892499a05d3d0dbe7"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp.mcpCommand (cyclomatic 37): mcp.mcpCommand has cyclomatic complexity 37 (threshold 15). Most of this is not in the body itself: 1 of the 37 points is its own statement and the rest belongs to 6 function literals inside it that branch (lines 67, 165, 180, \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/commands/mcp.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"905878e7146043e7b19449a3d4d132d17b34cf7a3f2faf8fb7d02919ae6311be"}},{"ruleId":"D1","level":"warning","message":{"text":"stream.streamCommand (cyclomatic 37): stream.streamCommand has cyclomatic complexity 37 (threshold 15). Most of this is not in the body itself: 1 of the 37 points is its own statement and the rest belongs to 13 function literals inside it that branch (lines 186, 336, 219, \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/commands/stream.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ea84e82900b8795d299f57880496c455122664dc1cc7f15e9143abd915668f"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeCodeAdapter.projectEntry (cyclomatic 37): ClaudeCodeAdapter.projectEntry 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":"packages/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e210dd917471964cdb9ebae5fd8507ee3d9e75419bf0f1c5aee358a950e6c3b"}},{"ruleId":"D1","level":"warning","message":{"text":"bundle-types.validateLegacyBundleManifest (cyclomatic 37): bundle-types.validateLegacyBundleManifest 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":"packages/daemon/src/domain/bundle-types.ts"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c75e025c40e992a58a954aaab45a0d18bb1bb4eac8e2e8d51f15b5262bb6236"}},{"ruleId":"D1","level":"warning","message":{"text":"manifest-parser.parseManifest (cyclomatic 37): manifest-parser.parseManifest has cyclomatic complexity 37 (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/daemon/src/domain/context-packs/manifest-parser.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad8e1daa0c3d1adb8937405c5ce56810963e13c210dc475ae67f3d56814f346"}},{"ruleId":"D1","level":"warning","message":{"text":"HealthCheckpointSource.validate (cyclomatic 37): HealthCheckpointSource.validate 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":"packages/daemon/src/domain/health-checkpoints.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b9771c3d9db24c5f6dc3f4659d522775c02879a80f3380a615773939644e9fb"}},{"ruleId":"D1","level":"warning","message":{"text":"SeatHandoverService.finalizeWithDiscovered (cyclomatic 37): SeatHandoverService.finalizeWithDiscovered has cyclomatic complexity 37 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 6 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/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b88b2d03c9a0bc3a2f01d9ddea481454aa77c23587ed9858ce8931971b9833"}},{"ruleId":"D1","level":"warning","message":{"text":"execution-model.sliceDetail (cyclomatic 37): execution-model.sliceDetail has cyclomatic complexity 37 (threshold 15). Of this number, 34 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/tui/src/execution/execution-model.ts"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f6ee40e41384c59ad3ae401d35a8b3cd0c0f7153b0dc7f40e7faf9aea29af69"}},{"ruleId":"D1","level":"warning","message":{"text":"InstallPlanner.plan (cyclomatic 36): InstallPlanner.plan has cyclomatic complexity 36 (threshold 15). Of this number, 34 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/daemon/src/domain/install-planner.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d910ff204b416d3576838a4373aaee0e7d90e932439618b0ee25e55b8e0e9d"}},{"ruleId":"D1","level":"warning","message":{"text":"relay-outbound.prepareRelayDecision (cyclomatic 36): relay-outbound.prepareRelayDecision has cyclomatic complexity 36 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 8 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/daemon/src/domain/gateway/relay-outbound.ts"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae6fcea642649759165b984df61e4d532879c5abdcafa8f7dcf5aa53179b0b7"}},{"ruleId":"D1","level":"warning","message":{"text":"stream-outcome.routed (cyclomatic 36): stream-outcome.routed 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/commands/stream-outcome.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"2992ca8d42d558e31519e64c10f38c1446a34d80b43889e1065de412c97d799e"}},{"ruleId":"D1","level":"warning","message":{"text":"SeatLifecycleService.setCwd (cyclomatic 36): SeatLifecycleService.setCwd has cyclomatic complexity 36 (threshold 15). Of this number, 28 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":"packages/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94a485a8654b9c3be6631bcf1f0e1b62da1724bb68be93743e4e8399a23c5e1"}},{"ruleId":"D1","level":"warning","message":{"text":"claude-token-usage.parseClaudeTokenUsage (cyclomatic 36): claude-token-usage.parseClaudeTokenUsage 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/daemon/src/domain/provider/claude-token-usage.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"1509b67a1847703701a7f64bafc61adcc31284e4da9810a1cdebc1a78cac9c03"}},{"ruleId":"D1","level":"warning","message":{"text":"SliceDetailProjector.buildAcceptance (cyclomatic 36): SliceDetailProjector.buildAcceptance has cyclomatic complexity 36 (threshold 15). Of this number, 34 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/daemon/src/domain/slices/slice-detail-projector.ts"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"6052a78d0e0aaa7409426e4719c000ad5319176abc2178c06fb97cbac179056d"}},{"ruleId":"D1","level":"warning","message":{"text":"settings-browser.safeValue (cyclomatic 36): settings-browser.safeValue has cyclomatic complexity 36 (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/daemon/src/domain/user-settings/settings-browser.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd126e7787cb900fe182cff0f0ead84457c2c6a74549e7585032a255b29f65bf"}},{"ruleId":"D1","level":"warning","message":{"text":"attention-model.composeHumanUpdates (cyclomatic 36): attention-model.composeHumanUpdates has cyclomatic complexity 36 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 10 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/tui/src/attention/attention-model.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c52a980c588f90e339b10820c51f703db7b7594ab7566b69e85a86f27239c8"}},{"ruleId":"D1","level":"warning","message":{"text":"BootstrapWizard.BootstrapWizard (cyclomatic 36): BootstrapWizard.BootstrapWizard has cyclomatic complexity 36 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 10 belong to 7 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/ui/src/components/BootstrapWizard.tsx"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a19d48f45189ab190e1c98156e0863e4918f1b06297b5388fc29726f9ad75d"}},{"ruleId":"D1","level":"warning","message":{"text":"HybridTopologyNodes.HybridAgentNodeInner (cyclomatic 36): HybridTopologyNodes.HybridAgentNodeInner has cyclomatic complexity 36 (threshold 15). 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, separate the cases: extract each independent branch into its own 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/ui/src/components/topology/HybridTopologyNodes.tsx"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"0340b9c7334512f7288e35d9f3886a8d5f02d12fbe021c2ff7a1a7904617ed3f"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-member-permissions.validateCodexMemberPermissions (cyclomatic 35): codex-member-permissions.validateCodexMemberPermissions has cyclomatic complexity 35 (threshold 15). Of this number, 31 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/daemon/src/domain/codex-member-permissions.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"214f4da0180d8d50689cd759abb701cc03b77ab88c69d3834243fe5ba52cc532"}},{"ruleId":"D1","level":"warning","message":{"text":"seat-skill-storage.followSeatSkills (cyclomatic 35): seat-skill-storage.followSeatSkills has cyclomatic complexity 35 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 13 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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"476ca1fcc9eea1ffe16f6a80407013d5aa732a3b03a6be254287841811adfe76"}},{"ruleId":"D1","level":"warning","message":{"text":"queue-waiting.readWaitingView (cyclomatic 35): queue-waiting.readWaitingView 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":"packages/daemon/src/domain/queue-waiting.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f935af211faa3e4db26ce62b721147925deb704eb7297dd1f11ac3a3db359c"}},{"ruleId":"D1","level":"warning","message":{"text":"QueueRepository.recordHumanAnswer (cyclomatic 35): QueueRepository.recordHumanAnswer has cyclomatic complexity 35 (threshold 15). Most of this is not in the body itself: 8 of the 35 points are its own statements and the rest belongs to one function literal inside it that branches (line 4676). 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":4669}}}],"partialFingerprints":{"codehealthFindingId/v1":"1996210ae2f8bc489fa1b4d5c6e937fcc2a20bdadd6e0cea9750149f1a8f4417"}},{"ruleId":"D1","level":"warning","message":{"text":"setup.setupCommand (cyclomatic 35): setup.setupCommand has cyclomatic complexity 35 (threshold 15). Most of this is not in the body itself: 1 of the 35 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 887, 938). 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/commands/setup.ts"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3602d786eef9fabac0b1c5e26f294a4f510a506352a5a51dc47d70737806e41"}},{"ruleId":"D1","level":"warning","message":{"text":"skill.skillCommand::seatLoadout (cyclomatic 35): skill.skillCommand::seatLoadout 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. This shape REPEATS in the file: one other method here (skill.skillCommand::printSeat) 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/commands/skill.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"919a83bf24b649f399a214cb42671932b25b9e3dcadf66be7d32c4e0862e1726"}},{"ruleId":"D1","level":"warning","message":{"text":"PodRigInstantiator.launchFirstMaterializedNode (cyclomatic 35): PodRigInstantiator.launchFirstMaterializedNode has cyclomatic complexity 35 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 8 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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"d153e68fc2e7b9ab8b2dccb65499d353b747ed2515b0b0acb7e0a965be1ff747"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaimService.repairMissingPane (cyclomatic 35): ClaimService.repairMissingPane has cyclomatic complexity 35 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 13 belong to 3 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/daemon/src/domain/claim-service.ts"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"541e43a0ac21d32f22356c61591bd2a469cbcd542c5afc9bc73a1970d689108e"}},{"ruleId":"D1","level":"warning","message":{"text":"slack-subsystem.makeHumanReplyResolver.\u003Creturned closure\u003E (cyclomatic 35): slack-subsystem.makeHumanReplyResolver.\u003Creturned closure\u003E 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":"packages/daemon/src/domain/gateway/slack/slack-subsystem.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d390c5111f82a55c4588e6280229b5ee8be36c91d160a7294f437a9ba577762"}},{"ruleId":"D1","level":"warning","message":{"text":"SeatLifecycleService.setPermissions (cyclomatic 35): SeatLifecycleService.setPermissions has cyclomatic complexity 35 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 15 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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be80a2b32232d03bd6072d2312d1c403ae9aa6f5cec891daa9074a7e4cea210"}},{"ruleId":"D1","level":"warning","message":{"text":"reactive-tap.collectReactiveEventSignals (cyclomatic 35): reactive-tap.collectReactiveEventSignals has cyclomatic complexity 35 (threshold 15). 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, separate the cases: extract each independent branch into its own 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/daemon/src/domain/provider/reactive-tap.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8947236e50147c07781cebfc90c510523c5cfd3a8e98be7b0dd102f399d8000"}},{"ruleId":"D1","level":"warning","message":{"text":"ScopeApproveService.approve (cyclomatic 35): ScopeApproveService.approve has cyclomatic complexity 35 (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/daemon/src/domain/scope/scope-approve.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"f25c4661085f86553c2db70bc9da1e75fdb12eb512b30e361e62149046b0452a"}},{"ruleId":"D1","level":"warning","message":{"text":"HerdrAppProvider.open (cyclomatic 35): HerdrAppProvider.open has cyclomatic complexity 35 (threshold 15). Of this number, 25 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":"packages/daemon/src/domain/terminal/herdr-app-provider.ts"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"f71e6a88abc9d3c56f752f061c8967edaf9e85b951fe81303d2226d67f12779a"}},{"ruleId":"D1","level":"warning","message":{"text":"rigspec.rigspecImportRoutes.post(\u0022/\u0022) (cyclomatic 35): rigspec.rigspecImportRoutes.post(\u0022/\u0022) 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":"packages/daemon/src/routes/rigspec.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"87da6df2643a6b254001351ce5895149da6468530a240cc30dbd0104d38dcbe1"}},{"ruleId":"D1","level":"warning","message":{"text":"hydrate.toAgentRow (cyclomatic 35): hydrate.toAgentRow 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":"packages/tui/src/hydrate.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b193d43e9fe7090ad329e5082307305af5633a69302efed8d6b82b02af1759a"}},{"ruleId":"D1","level":"warning","message":{"text":"transcript-rotation.startTranscriptRotation::tick (cyclomatic 34): transcript-rotation.startTranscriptRotation::tick 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/daemon/src/domain/transcript-rotation.ts"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"832a51e3324695254f4dc22e7e42f829b599ec20c808e8782ce81d2e528ba4ec"}},{"ruleId":"D1","level":"warning","message":{"text":"relay-outbound.createRelayOutboundTransport.deliver (cyclomatic 34): relay-outbound.createRelayOutboundTransport.deliver has cyclomatic complexity 34 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/gateway/relay-outbound.ts"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"593bb22131171246aee88e921df0a15668b19368df20dad91cc39c382ee0ba42"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeCompactionEnforcer.withDeliveryGuard (cyclomatic 34): ClaudeCompactionEnforcer.withDeliveryGuard has cyclomatic complexity 34 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 13 belong to 3 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1996103746e3f6dc5e4a220881dbb63bfe5fdea1b03efc72d3c956fe63a1d89"}},{"ruleId":"D1","level":"warning","message":{"text":"send.runHttpHostSend (cyclomatic 34): send.runHttpHostSend 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/commands/send.ts"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d8d3d593ed2d55dd6cfe11ae5b070c7059623096cc6ee6b51bf57b8e7c635c9"}},{"ruleId":"D1","level":"warning","message":{"text":"env.envCommand (cyclomatic 34): env.envCommand has cyclomatic complexity 34 (threshold 15). Most of this is not in the body itself: 1 of the 34 points is its own statement and the rest belongs to 5 function items inside it that branch (a function literal at line 49, resolveRigId, a function literal at line 107, \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/commands/env.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"eefdb52714604a91aae6cdb517ba251bb185abe486018784a3117b82212902b8"}},{"ruleId":"D1","level":"warning","message":{"text":"bundle-source-resolver.materializePodBundle (cyclomatic 34): bundle-source-resolver.materializePodBundle has cyclomatic complexity 34 (threshold 15). 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, separate the cases: extract each independent branch into its own 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/daemon/src/domain/bundle-source-resolver.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f820a0e9128e5fbfdeabf7405676af3110f2473e1f5528a70355ee7956f237"}},{"ruleId":"D1","level":"warning","message":{"text":"RestoreOrchestrator.reconcileNodeRuntimeTruth (cyclomatic 34): RestoreOrchestrator.reconcileNodeRuntimeTruth 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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":2979}}}],"partialFingerprints":{"codehealthFindingId/v1":"c043db0fadfbe66af46e2b532b3862b25f7259a9dffaeda3b5c4be6a534aafb6"}},{"ruleId":"D1","level":"warning","message":{"text":"SlackAskSettlement.settleOne (cyclomatic 34): SlackAskSettlement.settleOne 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, separate the cases: extract each independent branch into its own 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/daemon/src/domain/gateway/slack/settled-asks.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"98325386db7a1f0e2452e64528eefe1d943fab0b25478614dfc7cde57c395f1d"}},{"ruleId":"D1","level":"warning","message":{"text":"network-connector.runNetworkBindingPass (cyclomatic 34): network-connector.runNetworkBindingPass has cyclomatic complexity 34 (threshold 15). Of this number, 33 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/daemon/src/domain/network/network-connector.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c06dcf7b3fdf3e60eeacc463aad2dc3b67a1bce466d6783104f4c166a56c36"}},{"ruleId":"D1","level":"warning","message":{"text":"SeatHandoverService.recoveredConversation (cyclomatic 34): SeatHandoverService.recoveredConversation has cyclomatic complexity 34 (threshold 15). Of this number, 33 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/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"72489004147579f4bc86b17a3eacb65e16b4fe2295738526a55f0431b268aa67"}},{"ruleId":"D1","level":"warning","message":{"text":"claude-seat-switch.switchHeld (cyclomatic 34): claude-seat-switch.switchHeld has cyclomatic complexity 34 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 4 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/daemon/src/domain/provider/claude-seat-switch.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd89804ebec17b1c50cfdc2032afc68d90c19b7c205f9a8de29f8c45ee73445"}},{"ruleId":"D1","level":"warning","message":{"text":"provider-seat-accounts.configuredSeatAccounts (cyclomatic 34): provider-seat-accounts.configuredSeatAccounts has cyclomatic complexity 34 (threshold 15). Most of this is not in the body itself: 6 of the 34 points are its own statements and the rest belongs to one function literal inside it that branches (line 57). 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/daemon/src/domain/provider/provider-seat-accounts.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"c98bfb1184ee1ffd87a94801b2ab75b7e0011ff87ae22d187ca72a0ea96a7161"}},{"ruleId":"D1","level":"warning","message":{"text":"sessions.nodesRoutes.post(\u0022/:logicalId/launch\u0022) (cyclomatic 34): sessions.nodesRoutes.post(\u0022/:logicalId/launch\u0022) 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/daemon/src/routes/sessions.ts"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb0272f2ae6a6c880465e7b9db8429d80cb5af5c59bb4b2b075c0816d74d2a1"}},{"ruleId":"D1","level":"warning","message":{"text":"discovery.discoveryRoutes.post(\u0022/:id/adopt\u0022) (cyclomatic 34): discovery.discoveryRoutes.post(\u0022/:id/adopt\u0022) 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/daemon/src/routes/discovery.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb4a1caae824c50c93699a5792eac30b0cf788333a5df33cb16d857a1c4904a"}},{"ruleId":"D1","level":"warning","message":{"text":"slices.slicesRoutes (cyclomatic 34): slices.slicesRoutes has cyclomatic complexity 34 (threshold 15). Most of this is not in the body itself: 1 of the 34 points is its own statement and the rest belongs to 7 function literals inside it that branch (lines 147, 40, 64, \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/daemon/src/routes/slices.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"90349cb4f2a2d4cf67caeaffe32fec38ec81021f628e232b2a3c63ccd3187482"}},{"ruleId":"D1","level":"warning","message":{"text":"main.run::draw (cyclomatic 34): main.run::draw 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. This shape REPEATS in the file: 3 other methods here (main.run, main.run::executeAct, main.run::handleInput) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 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/tui/src/main.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43131bed4cc392fae9856276018451747aafc3a86cc5e9cd0b4f1d7a6bc2aa3"}},{"ruleId":"D1","level":"warning","message":{"text":"PackageInstallFlow.PackageInstallFlow (cyclomatic 34): PackageInstallFlow.PackageInstallFlow has cyclomatic complexity 34 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 9 belong to 4 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/ui/src/components/PackageInstallFlow.tsx"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"225ba8a7f4623ac04390f26aac25ee2f1f605e763153e3d26a68aba101c9a403"}},{"ruleId":"D1","level":"warning","message":{"text":"BundleInspector.BundleInspector (cyclomatic 34): BundleInspector.BundleInspector has cyclomatic complexity 34 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 4 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/ui/src/components/BundleInspector.tsx"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"abad6aa7ec349f4a13fc42f9c6693d83e8d281c9cae8c795f79ad36eab3cec4f"}},{"ruleId":"D1","level":"warning","message":{"text":"current-generation-record.resolveIdentityVerifiedClaudeRecord (cyclomatic 33): current-generation-record.resolveIdentityVerifiedClaudeRecord has cyclomatic complexity 33 (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/daemon/src/domain/model-divergence/current-generation-record.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4bb51befe74a12e81cfa840a8bd20ddd6f066087a30d836e2a5f958f33d79f"}},{"ruleId":"D1","level":"warning","message":{"text":"WatchdogJobsRepository.register (cyclomatic 33): WatchdogJobsRepository.register has cyclomatic complexity 33 (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/daemon/src/domain/watchdog-jobs-repository.ts"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"7687a27e347eb83885003224da29dade77df98a345293a17e083189c552714ad"}},{"ruleId":"D1","level":"warning","message":{"text":"package-manifest.serializeManifest (cyclomatic 33): package-manifest.serializeManifest has cyclomatic complexity 33 (threshold 15). Most of this is not in the body itself: 15 of the 33 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 528, 462, 471, \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/daemon/src/domain/package-manifest.ts"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"05211302b39d3b6113cfa17879590808bf79180a8906ae7f32a1e552221a957d"}},{"ruleId":"D1","level":"warning","message":{"text":"human-readiness.resolveHumanDeliveryReadiness (cyclomatic 33): human-readiness.resolveHumanDeliveryReadiness 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/daemon/src/domain/gateway/human-readiness.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7dde033bec74b30aed1fb1236bb7c97d710b14cd6ca99b3ec0bde66ee2ab24"}},{"ruleId":"D1","level":"warning","message":{"text":"judgments.ledger (cyclomatic 33): judgments.ledger has cyclomatic complexity 33 (threshold 15). Of this number, 29 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/daemon/src/domain/proof/judgments.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"009db9fecaf46b9bd44607394000e12014dbf247c76b1e36b6fcfb2a2a2e915e"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerPermissions.read (cyclomatic 33): RunnerPermissions.read 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/daemon/src/domain/runner-permissions.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"07771ba7da89f77e0c72b83d4a55320c32be4a7860ace94e3b578533a5c4a5f8"}},{"ruleId":"D1","level":"warning","message":{"text":"QueueRepository.createInTransactionalContext (cyclomatic 33): QueueRepository.createInTransactionalContext has cyclomatic complexity 33 (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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":2555}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d045d922b2f3b05c625965be111f6b91bedba4f1461609e0ed986a447c3e1c"}},{"ruleId":"D1","level":"warning","message":{"text":"TmuxAdapter.createSessionUnchecked (cyclomatic 33): TmuxAdapter.createSessionUnchecked 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/daemon/src/adapters/tmux.ts"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2e928d4f6d53565ba9b0ede9effaf7d2877ccf63dd096289bdfae98725a63b"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeCompactionEnforcer.deliverPreparation (cyclomatic 33): ClaudeCompactionEnforcer.deliverPreparation 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, 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":1706}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38272cabbc6d5a44f578c6543e20f9653576dccb593777e2a4fb40bae327927"}},{"ruleId":"D1","level":"warning","message":{"text":"scope.buildAuditCommand (cyclomatic 33): scope.buildAuditCommand has cyclomatic complexity 33 (threshold 15). Most of this is not in the body itself: 1 of the 33 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 1271, 1447). 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/commands/scope.ts"},"region":{"startLine":1266}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c9891f3964fb5725befa1975b6fa437d38f46fa7b5db48ce1ab3f0064de164"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-filesystem-preflight.compareFilesystem::at (cyclomatic 33): codex-filesystem-preflight.compareFilesystem::at has cyclomatic complexity 33 (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 (codex-filesystem-preflight.compareFilesystem) 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/daemon/src/domain/codex-filesystem-preflight.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d10e0e0d7eefffc6bbf5b602ddb89f1e9f0dd95d943bcab84500d36dc867b2"}},{"ruleId":"D1","level":"warning","message":{"text":"execution-view.readLifecycleExecutions (cyclomatic 33): execution-view.readLifecycleExecutions has cyclomatic complexity 33 (threshold 15). Most of this is not in the body itself: 11 of the 33 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 394, 442). 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/daemon/src/domain/execution-view.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"7603a20102000982516bdb4d17c6287a6a906d9fbf8c964f61cc24f4e58305da"}},{"ruleId":"D1","level":"warning","message":{"text":"slack-delivery.subsystemSlackDeliver::fn (cyclomatic 33): slack-delivery.subsystemSlackDeliver::fn 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/daemon/src/domain/gateway/slack/slack-delivery.ts"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"412141ae36180e0b190e79132f2d3f5c9c8224e784b8bd3710d769950b71f947"}},{"ruleId":"D1","level":"warning","message":{"text":"delivery-digest-flush.runDeliveryDigestFlush (cyclomatic 33): delivery-digest-flush.runDeliveryDigestFlush has cyclomatic complexity 33 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 8 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/daemon/src/domain/policies/delivery-digest-flush.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"e208f2be0106de55d8be9ca029a14efd9523685f7a2f94c7ee1f7a9d06ea9634"}},{"ruleId":"D1","level":"warning","message":{"text":"SeatHandoverService.proveAttemptSuccessorOnce (cyclomatic 33): SeatHandoverService.proveAttemptSuccessorOnce has cyclomatic complexity 33 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 6 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/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8415311ca24c47f9e44e553465afe951aacb0b50a4a8ab7d6b0bcb0554df45b"}},{"ruleId":"D1","level":"warning","message":{"text":"shared-history-selection.listSharedHistories (cyclomatic 33): shared-history-selection.listSharedHistories has cyclomatic complexity 33 (threshold 15). Of this number, 32 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/daemon/src/domain/shared-history-selection.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba373bba2b306b643c9c2370f7e23794c69735321178052b6a59531de3dbc77e"}},{"ruleId":"D1","level":"warning","message":{"text":"activity.recordHookActivity (cyclomatic 33): activity.recordHookActivity 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/daemon/src/routes/activity.ts"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3dccfad07c718a32458ecfce5595b92a5e70da61eb9f5ee4fa3164c7d485174"}},{"ruleId":"D1","level":"warning","message":{"text":"bundles.bundleRoutes.post(\u0022/install\u0022) (cyclomatic 33): bundles.bundleRoutes.post(\u0022/install\u0022) has cyclomatic complexity 33 (threshold 15). Of this number, 32 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/daemon/src/routes/bundles.ts"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"75219700cc74e566bd6d248523cac88b00516118cf1f6c11fc5b982c323ca458"}},{"ruleId":"D1","level":"warning","message":{"text":"execution-model.overviewLines (cyclomatic 33): execution-model.overviewLines has cyclomatic complexity 33 (threshold 15). Of this number, 31 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":"packages/tui/src/execution/execution-model.ts"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"d99b51f4da16a0acf3f63c30fb9b8b6a33b9cebdee7ea5f4e9df53e4a11478d2"}},{"ruleId":"D1","level":"warning","message":{"text":"startup.startupLines (cyclomatic 33): startup.startupLines has cyclomatic complexity 33 (threshold 15). Of this number, 29 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":"packages/tui/src/startup.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9d9cabd27efe1e78cee1b39def314d4d95b4470fca5d001b517f1c467dd395"}},{"ruleId":"D1","level":"warning","message":{"text":"useGlobalEvents.useGlobalEvents (cyclomatic 33): useGlobalEvents.useGlobalEvents has cyclomatic complexity 33 (threshold 15). Most of this is not in the body itself: 1 of the 33 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 22, 73, 18, \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/ui/src/hooks/useGlobalEvents.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c04134c22c77e8ceaccf4c250260fd1787cccc1bea4f502be7782b0b9382f7"}},{"ruleId":"D1","level":"warning","message":{"text":"ForkNowAction.ForkNowAction (cyclomatic 33): ForkNowAction.ForkNowAction has cyclomatic complexity 33 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 13 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/ui/src/components/agent-images/ForkNowAction.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a417ee572bd1f6de820d5475fe6bdd4dce3b099ab358ab0c8f78c8b00ea97f"}},{"ruleId":"D1","level":"warning","message":{"text":"fetch-stub.route (cyclomatic 33): fetch-stub.route 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/ui/twin/fetch-stub.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"c309b02c82d874b59e4cff69b67a17cb6babe7ef6f13d8576342b93cd1763d2c"}},{"ruleId":"D1","level":"warning","message":{"text":"pi-readiness.piCredentialSource (cyclomatic 32): pi-readiness.piCredentialSource has cyclomatic complexity 32 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 8 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/daemon/src/adapters/pi-readiness.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b4137cf0aaef3e94b9718719600332668c4bb29e558801b4cf9b9d45404ecb7"}},{"ruleId":"D1","level":"warning","message":{"text":"ActivityGrantStore.bindingMatch (cyclomatic 32): ActivityGrantStore.bindingMatch 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/daemon/src/domain/activity-grants.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae4fb45cb0ec0cf981f35dd5e5a2db1770d92a5ea0552de77f2f8554a44c27b"}},{"ruleId":"D1","level":"warning","message":{"text":"judgments.recordJudgment (cyclomatic 32): judgments.recordJudgment has cyclomatic complexity 32 (threshold 15). 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: 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/daemon/src/domain/proof/judgments.ts"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd2c8184450553a2b1d97fa152e3ed85c4b89b1ced28a817e576d381b69e357"}},{"ruleId":"D1","level":"warning","message":{"text":"judgments.readMissionReadiness (cyclomatic 32): judgments.readMissionReadiness has cyclomatic complexity 32 (threshold 15). Of this number, 22 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":"packages/daemon/src/domain/proof/judgments.ts"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5508fc62f297ee81d2ecc1554f661086adb62263f43dd835a1ea83981c26f7"}},{"ruleId":"D1","level":"warning","message":{"text":"session-transport.probeSessionActivity (cyclomatic 32): session-transport.probeSessionActivity has cyclomatic complexity 32 (threshold 15). Of this number, 28 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b104280130b9b579ec03e25650419782d15a8447409696a6e933c17dcef9004"}},{"ruleId":"D1","level":"warning","message":{"text":"native-resume-probe.buildCodexResumeDisplay (cyclomatic 32): native-resume-probe.buildCodexResumeDisplay 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/daemon/src/domain/native-resume-probe.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac77499a0f045e1daecc9a609ac3c0336cd74d0c52e0d4bf9b93cd5674ae14b3"}},{"ruleId":"D1","level":"warning","message":{"text":"doctor.runDoctorChecks (cyclomatic 32): doctor.runDoctorChecks has cyclomatic complexity 32 (threshold 15). Of this number, 25 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/commands/doctor.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c744943b77637490e615663e5c6146d46f1ed8d4a08e6144904a1efc822457"}},{"ruleId":"D1","level":"warning","message":{"text":"health.healthCommand::diagnosisRequest (cyclomatic 32): health.healthCommand::diagnosisRequest 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/cli/src/commands/health.ts"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"5534b69bdf03431a78e7660b1f7c745872fcf712054fa4fc424d91a549d80bd3"}},{"ruleId":"D1","level":"warning","message":{"text":"workflow-render.renderInstanceShow (cyclomatic 32): workflow-render.renderInstanceShow 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/cli/src/commands/workflow-render.ts"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7a8270bc99d95332e7f098809c1d66d59542fed36621974a181f0bc8910d8e"}},{"ruleId":"D1","level":"warning","message":{"text":"CodexRuntimeAdapter.launchHarness (cyclomatic 32): CodexRuntimeAdapter.launchHarness has cyclomatic complexity 32 (threshold 15). Of this number, 31 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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7914c74234400cd572a687dbe808fb540d3dbb5abfb6a19a0f3b50815cf9cdb"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerCore.reportUsageFacts (cyclomatic 32): RunnerCore.reportUsageFacts has cyclomatic complexity 32 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 9 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":1438}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d0d6e86495a185a76035301d80b5619f6f9c5351d133a15025a2cf7c148f2c"}},{"ruleId":"D1","level":"warning","message":{"text":"rehydrate-eligibility.assessSnapshotCurrentOccupants (cyclomatic 32): rehydrate-eligibility.assessSnapshotCurrentOccupants has cyclomatic complexity 32 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 10 belong to 3 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/daemon/src/domain/rehydrate-eligibility.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"f01bf71fa6c2a9d0e701e3815623b594f191d150aaa15a0b242d8641fe0a5663"}},{"ruleId":"D1","level":"warning","message":{"text":"seat-attention-reconciler.describeLineageFailure (cyclomatic 32): seat-attention-reconciler.describeLineageFailure 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/daemon/src/domain/seat-attention-reconciler.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d241613fad63c82580a67878955d615a406197f8f84daaac3136111d556316"}},{"ruleId":"D1","level":"warning","message":{"text":"HumanModeService.apply (cyclomatic 32): HumanModeService.apply has cyclomatic complexity 32 (threshold 15). Most of this is not in the body itself: 11 of the 32 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 212, a function literal at line 242, a function literal at line 216, \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/daemon/src/domain/gateway/human-operating-modes.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"221c9111158090fe8f43d79fe40b2d7acbcde54663cf94321ac2d8f4c0825c68"}},{"ruleId":"D1","level":"warning","message":{"text":"relay-inbound.createRelayInboundHandler.handle (cyclomatic 32): relay-inbound.createRelayInboundHandler.handle has cyclomatic complexity 32 (threshold 15). Most of this is not in the body itself: 6 of the 32 points are its own statements and the rest belongs to one function literal inside it that branches (line 704). 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/daemon/src/domain/gateway/relay-inbound.ts"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"1616b3af6521742627038746bbc8f1ac3ca92548a6b814414823acdcc5325ac4"}},{"ruleId":"D1","level":"warning","message":{"text":"HealthDiagnosisService.validateProgress (cyclomatic 32): HealthDiagnosisService.validateProgress has cyclomatic complexity 32 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 4 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/daemon/src/domain/health-diagnosis.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcee5234651c6ac9517cca149c6ce5df652db13c28ba9747bf5ef33993effdda"}},{"ruleId":"D1","level":"warning","message":{"text":"context-usage-threshold.makeContextUsageThresholdPolicy.evaluate (cyclomatic 32): context-usage-threshold.makeContextUsageThresholdPolicy.evaluate has cyclomatic complexity 32 (threshold 15). Of this number, 29 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/daemon/src/domain/policies/context-usage-threshold.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c38b9b7b708a77c3c81326dd225cd11e018eb65d462c97fc21f6497e7412ee"}},{"ruleId":"D1","level":"warning","message":{"text":"stream-reader-actions.recordReaderAction (cyclomatic 32): stream-reader-actions.recordReaderAction 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/daemon/src/domain/stream-reader-actions.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2484cbfb07f28df9a48fcf97f4c4cbb4204c637811c7b95f3672fb5ace949f0"}},{"ruleId":"D1","level":"warning","message":{"text":"bundles.bundleRoutes.post(\u0022/inspect\u0022) (cyclomatic 32): bundles.bundleRoutes.post(\u0022/inspect\u0022) has cyclomatic complexity 32 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 7 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/daemon/src/routes/bundles.ts"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"27661dc7ef9bc3c3e5d4576241ed2be36b5caee20acde8679428c83150d7ca6b"}},{"ruleId":"D1","level":"warning","message":{"text":"projects.projectsRoutes::errorResponse (cyclomatic 32): projects.projectsRoutes::errorResponse 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/daemon/src/routes/projects.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"d40d0c896d096b66383e84f0400bb870fd6f601d13743bffe374966b2561180d"}},{"ruleId":"D1","level":"warning","message":{"text":"connections-model.connectionsLines (cyclomatic 32): connections-model.connectionsLines has cyclomatic complexity 32 (threshold 15). Of this number, 31 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/tui/src/connections/connections-model.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"d30c56143c231f8aed97544118ba24f52094d2bf3299d1feddf694ad02de6f9a"}},{"ruleId":"D1","level":"warning","message":{"text":"guest.main (cyclomatic 32): guest.main 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/daemon/assets/openshell/guest.py"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bebb0cad64a8c1ce2ce103acb8d25bfa51dc67c6b596ff07e2037b73cdf96e5"}},{"ruleId":"D1","level":"warning","message":{"text":"node-inventory.buildInventoryItem (cyclomatic 31): node-inventory.buildInventoryItem 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/daemon/src/domain/node-inventory.ts"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b4e92b1bcd8aef4048d6adb0014e6deff57a650ba727e646a4cc4152bfb6f6"}},{"ruleId":"D1","level":"warning","message":{"text":"node-inventory.attachAgentActivity (cyclomatic 31): node-inventory.attachAgentActivity has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 1 of the 31 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 1862, 1945, 1905). 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/daemon/src/domain/node-inventory.ts"},"region":{"startLine":1824}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e67244d1566be81fb85dd529d8cd209e9bb3f4e2b45a4832256197105baddad"}},{"ruleId":"D1","level":"warning","message":{"text":"ps.runFanOutPs (cyclomatic 31): ps.runFanOutPs has cyclomatic complexity 31 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 12 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/commands/ps.ts"},"region":{"startLine":1899}}}],"partialFingerprints":{"codehealthFindingId/v1":"09bdf7d7215745f2f183f9e2e5b6d4f9e5796dc099c54e3ee44ab78c72b52664"}},{"ruleId":"D1","level":"warning","message":{"text":"attach.attachCommand (cyclomatic 31): attach.attachCommand has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 1 of the 31 points is its own statement and the rest belongs to 2 function items inside it that branch (a function literal at line 68, getClient). 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/commands/attach.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1c13f8d34088dffca124e56e348a1f24dccc31e699472d759ee4bdf40ee55c"}},{"ruleId":"D1","level":"warning","message":{"text":"fork.forkCommand.cmd (cyclomatic 31): fork.forkCommand.cmd 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/cli/src/commands/fork.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"527b0c8779826788d4f81b6e24619fc6a989a9e221926be42b3cb56884b56dfb"}},{"ruleId":"D1","level":"warning","message":{"text":"project-worker.runProjectWake (cyclomatic 31): project-worker.runProjectWake has cyclomatic complexity 31 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 15 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":"packages/cli/src/commands/project-worker.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfafb58f1a9744f5be42a68b24ac3cf3dd7282fa4d5efeefd571ebd69c82dfc6"}},{"ruleId":"D1","level":"warning","message":{"text":"restore-from-jsonl.analyze (cyclomatic 31): restore-from-jsonl.analyze 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/daemon/assets/plugins/openrig-core/skills/claude-compaction-restore/scripts/restore-from-jsonl.mjs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75073033c32d97b720e663d58809a969848cc9b2301e3286059855f14d5ce23"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeCodeAdapter.assessManagedProbe (cyclomatic 31): ClaudeCodeAdapter.assessManagedProbe has cyclomatic complexity 31 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 1 belongs 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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d6b5a4bc8ef8264ca5aa29d4b8ae3c17b500c4e761dcf687bd32e05df700bd"}},{"ruleId":"D1","level":"warning","message":{"text":"RigSpecExporter.exportLegacy (cyclomatic 31): RigSpecExporter.exportLegacy has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 1 of the 31 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 142, 188, 146). 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/daemon/src/domain/rigspec-exporter.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af297e328279621f9f5c7e4a88bb8a92c19f8eac1458c707eae62c74064b7ba"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime-switch-materials.planRuntimeSwitchMaterials (cyclomatic 31): runtime-switch-materials.planRuntimeSwitchMaterials has cyclomatic complexity 31 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 4 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/daemon/src/domain/runtime-switch-materials.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58e66ffd456ad1e58c2519b496fe1369326ab61b630ed8043ebdc16f84cdf29"}},{"ruleId":"D1","level":"warning","message":{"text":"topology-manifest.validateTopologyManifest (cyclomatic 31): topology-manifest.validateTopologyManifest 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/daemon/src/domain/topology/topology-manifest.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9974ab488d579599d2a6886736a7cdbdbf880aa4013a0512762d3d1c9b68164"}},{"ruleId":"D1","level":"warning","message":{"text":"restore-check.getStartupContext (cyclomatic 31): restore-check.getStartupContext has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 13 of the 31 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 127, 115, 93). 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/daemon/src/routes/restore-check.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c985dde48918e04083ff5945cae633f239dfe32986a20482a77008795bdfd0"}},{"ruleId":"D1","level":"warning","message":{"text":"startup.reviewSelectedHistory (cyclomatic 31): startup.reviewSelectedHistory 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/daemon/src/routes/startup.ts"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc18072f93b74579d13698f4ab2b1c1cdf744553b0ba9d599188161cc8a3a3c1"}},{"ruleId":"D1","level":"warning","message":{"text":"QueueItemViewer.QueueItemViewer (cyclomatic 31): QueueItemViewer.QueueItemViewer has cyclomatic complexity 31 (threshold 15). Of this number, 29 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/ui/src/components/drawer-viewers/QueueItemViewer.tsx"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"d370895600fc89eba894240c00e9c64b39a6e38b39cbeb2c7241d84c43d5dabe"}},{"ruleId":"D1","level":"warning","message":{"text":"Feed.Feed (cyclomatic 31): Feed.Feed has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 7 of the 31 points are its own statements and the rest belongs to 12 function literals inside it that branch (lines 363, 497, 336, \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/ui/src/components/for-you/Feed.tsx"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"b522a4ebb9f053f9fb086c85d4ec096e679f741741218bec85962311592b8458"}},{"ruleId":"D1","level":"warning","message":{"text":"migrate-telemetry-state-0.5.9.managedSystemWorldState (cyclomatic 31): migrate-telemetry-state-0.5.9.managedSystemWorldState has cyclomatic complexity 31 (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":"skills/_canonical/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd63b6734b81c6f2c094a5b1587a5d43ae3cb981966b287e1dceae053c329ed"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-thread-id.readCodexThreadIdFromLogs (cyclomatic 30): codex-thread-id.readCodexThreadIdFromLogs has cyclomatic complexity 30 (threshold 15). Of this number, 27 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/daemon/src/domain/codex-thread-id.ts"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"800c11a32ddf2095c74af561ff9938121ce473aca1453fd18654e1c308b5cc14"}},{"ruleId":"D1","level":"warning","message":{"text":"native-process-lineage.claudeArgvIds (cyclomatic 30): native-process-lineage.claudeArgvIds 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":"packages/daemon/src/domain/native-process-lineage.ts"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30d70400c884fcdfba6acc802a7578712cc1349ee7c878e7b6e331a0d8820e8"}},{"ruleId":"D1","level":"warning","message":{"text":"native-process-lineage.observeClaudeDelivery (cyclomatic 30): native-process-lineage.observeClaudeDelivery has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 14 of the 30 points are its own statements and the rest belongs to 3 function items inside it that branch (sample, sample::launchedAs, a function literal at line 1060). 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/daemon/src/domain/native-process-lineage.ts"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ad3339a0903ce4a4e04b09554301abb3667229d4294c5bd0d647bf6e9a0b5c"}},{"ruleId":"D1","level":"warning","message":{"text":"rig-repository.isStoredStartupBlock (cyclomatic 30): rig-repository.isStoredStartupBlock has cyclomatic complexity 30 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 14 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/daemon/src/domain/rig-repository.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"d769316d4011be3fd5c905c5f50231ff8087340bac3b3bb5139890b2ac36b280"}},{"ruleId":"D1","level":"warning","message":{"text":"escalation-owner.resolveEscalationOwner (cyclomatic 30): escalation-owner.resolveEscalationOwner has cyclomatic complexity 30 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 13 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/daemon/src/domain/escalation-owner.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"45219d51c6e074fca9a346676bc06fdda41e12dd6bc6b015d5c544191836823c"}},{"ruleId":"D1","level":"warning","message":{"text":"QueueRepository.deliverWakeIntent (cyclomatic 30): QueueRepository.deliverWakeIntent 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. This shape REPEATS in the file: one other method here (QueueRepository.deliverWakeIntent::claim) 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":1695}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee1f244401cc90f98ac106816143b2b9078d3d829bfd325a233d754582f91a8c"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionTransport.doReconcileStartupReadiness (cyclomatic 30): SessionTransport.doReconcileStartupReadiness has cyclomatic complexity 30 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 11 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":5148}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f84c42a8b0fd2f01dd08a8b24484bc8ecf6a3ad4bbf8fdaed23e54fcdbe4b5e"}},{"ruleId":"D1","level":"warning","message":{"text":"TmuxAdapter.scopedLaunchCommand (cyclomatic 30): TmuxAdapter.scopedLaunchCommand has cyclomatic complexity 30 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 4 belong to 3 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/daemon/src/adapters/tmux.ts"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0dc7381ee0b46456f250c9acc1732854a38c23fbfefe23ae48846caba49eff4"}},{"ruleId":"D1","level":"warning","message":{"text":"TmuxAdapter.guardedInput (cyclomatic 30): TmuxAdapter.guardedInput has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 9 of the 30 points are its own statements and the rest belongs to one function literal inside it that branches (line 1338). 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/daemon/src/adapters/tmux.ts"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"5890ca3a5ce7388e191379b8d93f6297119f7839216f6fec8a1fe36eaa07732e"}},{"ruleId":"D1","level":"warning","message":{"text":"claude-team-permissions.words (cyclomatic 30): claude-team-permissions.words has cyclomatic complexity 30 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 2 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/daemon/assets/claude-team-permissions.cjs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6362368d42c85d39c91578cded2d56a462687162191273a09be5aabe831f8b9"}},{"ruleId":"D1","level":"warning","message":{"text":"CodexResumeAdapter.verifyResume (cyclomatic 30): CodexResumeAdapter.verifyResume 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":"packages/daemon/src/adapters/codex-resume.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa8776a70516f7794d067b9f840a0a3db0b435fd91c515beb40da4f0a23f9ffb"}},{"ruleId":"D1","level":"warning","message":{"text":"PsProjectionService.getEntries (cyclomatic 30): PsProjectionService.getEntries 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 one function literal inside it that branches (line 225). 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/daemon/src/domain/ps-projection.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"643e6efefaf2b291c5dd36522584de8f26625c8ff3ad83a9b06eb82285b72df5"}},{"ruleId":"D1","level":"warning","message":{"text":"BootstrapOrchestrator.handlePodAwareSpec (cyclomatic 30): BootstrapOrchestrator.handlePodAwareSpec has cyclomatic complexity 30 (threshold 15). Of this number, 26 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/daemon/src/domain/bootstrap-orchestrator.ts"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1fe4b1ed0fc0ded708a5ff63f22177475ea5792fb4bd16f725274eedef216e3"}},{"ruleId":"D1","level":"warning","message":{"text":"classification-sources.classificationSources (cyclomatic 30): classification-sources.classificationSources has cyclomatic complexity 30 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 13 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/daemon/src/domain/classification-sources.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"74bd766a7a2104e4887ecbb250a5cc12a3a55281876798fdd7c1739ed784dc3e"}},{"ruleId":"D1","level":"warning","message":{"text":"HealthDiagnosisService.notifyOccurrence (cyclomatic 30): HealthDiagnosisService.notifyOccurrence has cyclomatic complexity 30 (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/daemon/src/domain/health-diagnosis.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb3c5bb73712d27c65252be36b3c4f68d1570d94093aa3bd74b3909830d17efc"}},{"ruleId":"D1","level":"warning","message":{"text":"CurrentModelReader.prepare (cyclomatic 30): CurrentModelReader.prepare has cyclomatic complexity 30 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 13 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/daemon/src/domain/model-divergence/current-model-reader.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6922e6f0ed28b44317ae8afaf80c90c1b472565970e43e210f440c6885d4c4d"}},{"ruleId":"D1","level":"warning","message":{"text":"SeatRuntimeSwitchService.commit (cyclomatic 30): SeatRuntimeSwitchService.commit has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 1 of the 30 points is its own statement and the rest belongs to one function literal inside it that branches (line 602). 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/daemon/src/domain/seat-runtime-switch-service.ts"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b63bc2ae9454313e0f56fb1ede80b6173c8a5b4b91dcb4352cb8a6f1f6566b"}},{"ruleId":"D1","level":"warning","message":{"text":"StreamClassificationWorker.wake (cyclomatic 30): StreamClassificationWorker.wake 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":"packages/daemon/src/domain/stream-classification-worker.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa9f7c7850de401aaa3bee6901cd5fba291242db0f7029ce7175385053907b7f"}},{"ruleId":"D1","level":"warning","message":{"text":"herdr-adapter.exitedSeats (cyclomatic 30): herdr-adapter.exitedSeats has cyclomatic complexity 30 (threshold 15). Of this number, 24 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/terminal/herdr-adapter.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab3b8bda41fe922bcb2c2015a25d0bbd29a809ea96a92b46c85363e7c493675"}},{"ruleId":"D1","level":"warning","message":{"text":"ScopePages.SliceScopePage (cyclomatic 30): ScopePages.SliceScopePage has cyclomatic complexity 30 (threshold 15). Of this number, 29 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/ui/src/components/project/ScopePages.tsx"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"eebd66cadce003bfda4fb38c51838d557e848fcb978470154f7d76ab1edf5232"}},{"ruleId":"D1","level":"warning","message":{"text":"guest.descriptor (cyclomatic 30): guest.descriptor 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":"packages/daemon/assets/openshell/guest.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"f528ef6e6ee854f47984b8a21ff01c1c99673fe5fa8b202e9e378b696e2ea218"}},{"ruleId":"D1","level":"warning","message":{"text":"native-process-lineage.claudeSessionIdentity (cyclomatic 29): native-process-lineage.claudeSessionIdentity 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/daemon/src/domain/native-process-lineage.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9aaf7b43c987a622b58d65a8c21521527a161058e9875819a3eb3a929e4718c"}},{"ruleId":"D1","level":"warning","message":{"text":"current-generation-record.resolveIdentityVerifiedPiRecord (cyclomatic 29): current-generation-record.resolveIdentityVerifiedPiRecord 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, 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/daemon/src/domain/model-divergence/current-generation-record.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"c266360188410c15c3aa19d196d6a8653a9d5a9af19b67e1271e33ac88f15c29"}},{"ruleId":"D1","level":"warning","message":{"text":"NativePermissionStore.resolve (cyclomatic 29): NativePermissionStore.resolve 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/daemon/src/domain/native-permission-store.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c4ab7d86326ba19ba92e5cbc7ee758ac8f56d053449f67464b46d010bd0e2e"}},{"ruleId":"D1","level":"warning","message":{"text":"EnvironmentStartup.retainedResume (cyclomatic 29): EnvironmentStartup.retainedResume 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/daemon/src/domain/environment-startup.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cbefe10f22106ee77842235a6f29923001e67268db8246726b6dd8a8241f3f5"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionTransport.readAtReadableSize (cyclomatic 29): SessionTransport.readAtReadableSize has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 14 of the 29 points are its own statements and the rest belongs to one function literal inside it that branches (line 4925). 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":4913}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc1b4434f3b7f009d53fbc7c9b4f6f7228407541e6491cb055a6c19b04ebc5c"}},{"ruleId":"D1","level":"warning","message":{"text":"TmuxAdapter.respawnPaneUnchecked (cyclomatic 29): TmuxAdapter.respawnPaneUnchecked 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":"packages/daemon/src/adapters/tmux.ts"},"region":{"startLine":2295}}}],"partialFingerprints":{"codehealthFindingId/v1":"0846ed3452d4f0367677bb5a7caf840123cc600467abf6b5743e3ddb69e19e76"}},{"ruleId":"D1","level":"warning","message":{"text":"native-resume-probe.currentCodexAuthRefusal (cyclomatic 29): native-resume-probe.currentCodexAuthRefusal 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/daemon/src/domain/native-resume-probe.ts"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c408e223b71b523a10844697e272194dad5917d1eb510e8d7a42a3359325b5"}},{"ruleId":"D1","level":"warning","message":{"text":"seat-attention.checkSeatAttention (cyclomatic 29): seat-attention.checkSeatAttention has cyclomatic complexity 29 (threshold 15). 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, separate the cases: extract each independent branch into its own 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/seat-attention.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"a08c7b601e775669227cba22342a166171b5dfd8a11eab6e960bc7162046a246"}},{"ruleId":"D1","level":"warning","message":{"text":"adopt.adoptCommand (cyclomatic 29): adopt.adoptCommand 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 one function literal inside it that branches (line 94). 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/commands/adopt.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e20b5fef45e5c148cd8b6eb38d64e578e059e156a45ced7786a103a86732917"}},{"ruleId":"D1","level":"warning","message":{"text":"auth.authCommand (cyclomatic 29): auth.authCommand 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 11 function items inside it that branch (a function literal at line 113, a function literal at line 75, onHost, \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/commands/auth.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"093d66ba3e04f141c5200fffc5c3fcfc3a877c019f9555c4d5a8557a1ca822e0"}},{"ruleId":"D1","level":"warning","message":{"text":"roster.rosterCommand (cyclomatic 29): roster.rosterCommand has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 6 of the 29 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 144, 159). 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/commands/roster.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb9a55d19448013fd6498ca20c7cf81344e9863802499bbb9c6298075e057598"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp-server.projectForExternal (cyclomatic 29): mcp-server.projectForExternal 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":"packages/cli/src/mcp-server.ts"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b1edd2240aee2171b6e3907a358f4157720827389a81c7fbccc06923296b37d"}},{"ruleId":"D1","level":"warning","message":{"text":"restore.restoreCommand (cyclomatic 29): restore.restoreCommand 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 2 function literals inside it that branch (lines 20, 127). 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/commands/restore.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"a58d637725623ab0de3514a1483dbd123d76804a3283f8da0a67f369a9f6b41f"}},{"ruleId":"D1","level":"warning","message":{"text":"CodexRuntimeAdapter.ensureCodexCorePlugin (cyclomatic 29): CodexRuntimeAdapter.ensureCodexCorePlugin has cyclomatic complexity 29 (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 shape REPEATS in the file: one other method here (CodexRuntimeAdapter.ensureCodexCorePlugin::renewContentApproval) 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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff29fae6187932830588fb6a2cc28e393d41b524ff1ba074d7c1f6b1b377724"}},{"ruleId":"D1","level":"warning","message":{"text":"bundle-content-routing.routeBundleContents (cyclomatic 29): bundle-content-routing.routeBundleContents has cyclomatic complexity 29 (threshold 15). Of this number, 22 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/daemon/src/domain/bundle-content-routing.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f2d23fe56ca82100fd79a9418188768cc4df41fc66650dccb643b7c8a22b44"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionFingerprinter.fingerprint (cyclomatic 29): SessionFingerprinter.fingerprint 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/daemon/src/domain/session-fingerprinter.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"276201753efbc4a4b8db8bf0fbdaa19ddd72e2c1b583b8fc49d294faa7dff961"}},{"ruleId":"D1","level":"warning","message":{"text":"workflow-scope.normalizeWorkflowScope (cyclomatic 29): workflow-scope.normalizeWorkflowScope 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/daemon/src/domain/workflow-scope.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e2399d4c3221fe6b094f824a24d0d2ea7dd3cdfd0cbf2223ad81552ca0bb2ec"}},{"ruleId":"D1","level":"warning","message":{"text":"human-mode-account.waitingFor (cyclomatic 29): human-mode-account.waitingFor has cyclomatic complexity 29 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 8 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/daemon/src/domain/gateway/human-mode-account.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa346b4a3becc4360543abec5195f410ff3baa1de82eda4549f74eed6c60cb89"}},{"ruleId":"D1","level":"warning","message":{"text":"pi-usage-entries-store.validPiProviderCharge (cyclomatic 29): pi-usage-entries-store.validPiProviderCharge has cyclomatic complexity 29 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 7 belong to 4 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/daemon/src/domain/pi-usage-entries-store.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa672290bbaa2fc0a2f7581e65b8a9fa37fd02ebc8d0fa6abd2349c1eae1b894"}},{"ruleId":"D1","level":"warning","message":{"text":"UsageWindows.project (cyclomatic 29): UsageWindows.project has cyclomatic complexity 29 (threshold 15). Of this number, 24 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/daemon/src/domain/provider/usage-windows.ts"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"e987b2e6df96fc988bc0c7ed7c0c2e195feac0d063e804190ae2fbd915c93399"}},{"ruleId":"D1","level":"warning","message":{"text":"SeatLifecycleService.setCodexProfile (cyclomatic 29): SeatLifecycleService.setCodexProfile has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 11 of the 29 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 1100, 1114). 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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"1630483ec378fb35d5be869ac551911148c1fd3c0f41b0ea785c2f2daacdd4ac"}},{"ruleId":"D1","level":"warning","message":{"text":"seat-skill-apply.applySeatSkills (cyclomatic 29): seat-skill-apply.applySeatSkills has cyclomatic complexity 29 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 7 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/daemon/src/domain/seat-skill-apply.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"012a6ea59a80f9379d00dd9cb4016d306d72d3b773d882ad39d460bee4aa9b18"}},{"ruleId":"D1","level":"warning","message":{"text":"herdr-live-workspace.hasLiveAttachments (cyclomatic 29): herdr-live-workspace.hasLiveAttachments has cyclomatic complexity 29 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 6 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/daemon/src/domain/terminal/herdr-live-workspace.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed10da87d2bfe02174fa0950814401f3cbffa6b42470636f59cc36d9691d9912"}},{"ruleId":"D1","level":"warning","message":{"text":"RexAdapter.openView (cyclomatic 29): RexAdapter.openView has cyclomatic complexity 29 (threshold 15). Of this number, 25 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/daemon/src/domain/terminal/rex-adapter.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"6685c16f227969ef0b9be9f3b309e42286b26c2b9bd1177ee16241769fe188ec"}},{"ruleId":"D1","level":"warning","message":{"text":"review.reviewRoutes (cyclomatic 29): review.reviewRoutes 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 6 function literals inside it that branch (lines 118, 45, 98, \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/daemon/src/routes/review.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"c55fdb0a77929dbdf3a20412c6e66e5189cb2ca52b3337a438a3d62d0a5708a5"}},{"ruleId":"D1","level":"warning","message":{"text":"usage-model.allowanceLines (cyclomatic 29): usage-model.allowanceLines 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/tui/src/usage/usage-model.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"96093b5a1500cc76dd359990cc42b72654050d531abbbfa4a41543a3612aaded"}},{"ruleId":"D1","level":"warning","message":{"text":"storytelling-cards.buildStorytellingFeedItems (cyclomatic 29): storytelling-cards.buildStorytellingFeedItems 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/ui/src/components/feed/cards/storytelling-cards.tsx"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"393df08c0724a719055e2a8e8dad16b99ddf585e3af2de003ad5df989202ed8d"}},{"ruleId":"D1","level":"warning","message":{"text":"permission-drift.inspectClaude (cyclomatic 28): permission-drift.inspectClaude 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/daemon/src/domain/permission-drift.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"b242e58d8e89c33e662baf372937d002470d842a298412b7fab3966f4f8d95b9"}},{"ruleId":"D1","level":"warning","message":{"text":"provider-signals.deriveUsageLimitPools (cyclomatic 28): provider-signals.deriveUsageLimitPools has cyclomatic complexity 28 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 13 belong to 7 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/daemon/src/domain/provider/provider-signals.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"f62362aae6ed609514b6c7113470a0634ff3319ab84d1422bbf69d6066ee918f"}},{"ruleId":"D1","level":"warning","message":{"text":"compose.composeSliceReview (cyclomatic 28): compose.composeSliceReview has cyclomatic complexity 28 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 6 belong to 5 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/daemon/src/domain/review/compose.ts"},"region":{"startLine":1114}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d74254a0ae59bfcc5fbf0fde37fe74b2bdd1d77d79e02c369228f25f95d4124"}},{"ruleId":"D1","level":"warning","message":{"text":"SeatActivityService.pollPermissionPrompt (cyclomatic 28): SeatActivityService.pollPermissionPrompt has cyclomatic complexity 28 (threshold 15). Of this number, 26 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/daemon/src/domain/seat-activity-service.ts"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee24eb6208d739e9f01ea5297e289ff7d5240b07ac80b27c432b72f6b60edf5e"}},{"ruleId":"D1","level":"warning","message":{"text":"restore-guidance.restoreMissingGuidance (cyclomatic 28): restore-guidance.restoreMissingGuidance has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/restore-guidance.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf2a0a15dd28266f7d69f3eb3a876a2083f58900fbe3e4be6793d8cd2e580dc"}},{"ruleId":"D1","level":"warning","message":{"text":"hosted-wake.ringHostedWake (cyclomatic 28): hosted-wake.ringHostedWake 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/daemon/src/domain/hosted-wake.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca1851e80dc4581fef325b192c66bc0eab30613794b69884d96b42c1d4f43ee3"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeCompactionEnforcer.beginPreparation (cyclomatic 28): ClaudeCompactionEnforcer.beginPreparation has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":1599}}}],"partialFingerprints":{"codehealthFindingId/v1":"d684ac82800982216cde1faafed8c7da419324b8ae5d3fe29cecb7ab08e4de71"}},{"ruleId":"D1","level":"warning","message":{"text":"daemon-lifecycle.stopDaemon (cyclomatic 28): daemon-lifecycle.stopDaemon has cyclomatic complexity 28 (threshold 15). Of this number, 26 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/daemon-lifecycle.ts"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1001abce3fea2dacc8fd66fa2f66733f653ae44350e5ec5226beae28b62432"}},{"ruleId":"D1","level":"warning","message":{"text":"tmux-attachment.readRecordedTmuxServerArgs (cyclomatic 28): tmux-attachment.readRecordedTmuxServerArgs has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/tmux-attachment.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e245d19feafe8eedf1b706300f3ca72402903fdf039e721cca460d0d1817ce"}},{"ruleId":"D1","level":"warning","message":{"text":"roster.enrichRosterMember (cyclomatic 28): roster.enrichRosterMember has cyclomatic complexity 28 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 4 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/cli/src/commands/roster.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"211d58abe29c4c702915182f4c87199d8ad0b0277ccea404beb56a13275473ef"}},{"ruleId":"D1","level":"warning","message":{"text":"expand.expandCommand (cyclomatic 28): expand.expandCommand has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 1 of the 28 points is its own statement and the rest belongs to one function literal inside it that branches (line 30). 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/commands/expand.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b5231935849e1100215f9d62ab8a1dcbf8452e4ae6c6862ac1ccf5ffbfd88d"}},{"ruleId":"D1","level":"warning","message":{"text":"queue.readBackQueueUpdate (cyclomatic 28): queue.readBackQueueUpdate has cyclomatic complexity 28 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 13 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/commands/queue.ts"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d0d29fabb5a32e9287e47b2c011b315a9ed648cd58a43a1766a41e3a123b63b"}},{"ruleId":"D1","level":"warning","message":{"text":"scope.buildMissionCreateCommand (cyclomatic 28): scope.buildMissionCreateCommand has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 1 of the 28 points is its own statement and the rest belongs to one function literal inside it that branches (line 1044). 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/commands/scope.ts"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"018db66cc2784d5f1dd9e65e87000ca110413c4eb34cd55f02cb40420de8e0e1"}},{"ruleId":"D1","level":"warning","message":{"text":"seat-runtime-home-record.observeRuntimeHome (cyclomatic 28): seat-runtime-home-record.observeRuntimeHome has cyclomatic complexity 28 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 11 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/daemon/src/domain/seat-runtime-home-record.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"01200b4e772c79baf38d15c49d882763b114a199189b9b679d6db42edeb8113b"}},{"ruleId":"D1","level":"warning","message":{"text":"bundle-archive.unpack (cyclomatic 28): bundle-archive.unpack has cyclomatic complexity 28 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 9 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/daemon/src/domain/bundle-archive.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc4666d468eac61dcd7f18cb73390146796e75aa07e8c26cfef9efbf282c4f2"}},{"ruleId":"D1","level":"warning","message":{"text":"workflow-reconciliation.reviseGraph (cyclomatic 28): workflow-reconciliation.reviseGraph has cyclomatic complexity 28 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 11 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/daemon/src/domain/workflow-reconciliation.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e54d090979ad4f89bd703146ab5b0e5b774a828cf8c57d5d092845668d8a46"}},{"ruleId":"D1","level":"warning","message":{"text":"network-connector.reportBack (cyclomatic 28): network-connector.reportBack has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/network/network-connector.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef6da9373c3c8512c71b3ca63adc1a8e9976ed67da42c27775272ed8bbf0fe2"}},{"ruleId":"D1","level":"warning","message":{"text":"PodBundleAssembler.assemble (cyclomatic 28): PodBundleAssembler.assemble has cyclomatic complexity 28 (threshold 15). Of this number, 25 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/daemon/src/domain/pod-bundle-assembler.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"117c217c0d03530247a3cf7f7243a4c1e728a986a56fcf3ec69dd42cf3170b96"}},{"ruleId":"D1","level":"warning","message":{"text":"usage-across-hosts.readHost (cyclomatic 28): usage-across-hosts.readHost has cyclomatic complexity 28 (threshold 15). Of this number, 27 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/daemon/src/domain/provider/usage-across-hosts.ts"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b82c8ffbb25146a5ef11bc4935f69aa6ac77baac40ef6e5f237e956ae81320"}},{"ruleId":"D1","level":"warning","message":{"text":"terminal-follow-policy.planFollowingTiles (cyclomatic 28): terminal-follow-policy.planFollowingTiles has cyclomatic complexity 28 (threshold 15). Of this number, 23 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/daemon/src/domain/terminal/terminal-follow-policy.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c271d56c0439c8d0d4a76ed4f506a9e8d1b960b7619a195550fe53fcc0d3f6"}},{"ruleId":"D1","level":"warning","message":{"text":"rigs.rigsRoutes.post(\u0022/:rigId/pods/:podNamespace/members\u0022) (cyclomatic 28): rigs.rigsRoutes.post(\u0022/:rigId/pods/:podNamespace/members\u0022) has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/routes/rigs.ts"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d08cf2b6ee6378ba8448e68672adfb49c7388c4ade8e6b5957c49cd0ce24c09"}},{"ruleId":"D1","level":"warning","message":{"text":"plugins.pluginsRoutes (cyclomatic 28): plugins.pluginsRoutes has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 1 of the 28 points is its own statement and the rest belongs to 7 function literals inside it that branch (lines 189, 147, 162, \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/daemon/src/routes/plugins.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7aab9775986c76b96933b8d5b3614c4df02bce357d0cfd053ff6d8b10220b35"}},{"ruleId":"D1","level":"warning","message":{"text":"open-window.openTerminalInWindow (cyclomatic 28): open-window.openTerminalInWindow 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/tui/src/terminals/open-window.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a6dd04d5cfade72389444a91f237fa74357e4c4bc09d688b110307dafa02d9d"}},{"ruleId":"D1","level":"warning","message":{"text":"ProjectMetaPrimitives.eventToken (cyclomatic 28): ProjectMetaPrimitives.eventToken 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/ui/src/components/project/ProjectMetaPrimitives.tsx"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd42e64338791ee90bcecab0d0a613abf4b8db1be784424c1d4eb8ec2cd2cc9"}},{"ruleId":"D1","level":"warning","message":{"text":"trace-to-root.main (cyclomatic 28): trace-to-root.main has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/assets/plugins/openrig-core/skills/refocusing/scripts/trace-to-root.py"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15b41c1c4f7a3dd8f98cd728ea03bfcd29989bf3f900e7a9b7f8617b9c4804f"}},{"ruleId":"D1","level":"warning","message":{"text":"native-process-lineage.tokens (cyclomatic 27): native-process-lineage.tokens has cyclomatic complexity 27 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 13 belong to 3 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/daemon/src/domain/native-process-lineage.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9dc79746df632e6661b9b302453be262a2d20c027138c8eb682505ad5d7dd6"}},{"ruleId":"D1","level":"warning","message":{"text":"rigspec-schema.validateWorkspaceBlock (cyclomatic 27): rigspec-schema.validateWorkspaceBlock 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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ce8081a9b2716381b85f3bc946487cfe3d09c3309af5b1f4782e4e4065ad44"}},{"ruleId":"D1","level":"warning","message":{"text":"EnvironmentPlatform.config (cyclomatic 27): EnvironmentPlatform.config 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/daemon/src/domain/environment-platform.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e59ceb25e095a1375c0cf58917292e505fe120cdb3b5ca2c004f60c8317cda"}},{"ruleId":"D1","level":"warning","message":{"text":"kernel-hook-review.makeKernelHookReviewReader.\u003Creturned closure\u003E (cyclomatic 27): kernel-hook-review.makeKernelHookReviewReader.\u003Creturned closure\u003E 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/daemon/src/domain/kernel-hook-review.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64227d030cc11ababc8c4e9cf850d95a69c628f2361a16e302e35fd2a8285c9"}},{"ruleId":"D1","level":"warning","message":{"text":"delivery-rules-engine.decideDelivery (cyclomatic 27): delivery-rules-engine.decideDelivery 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/daemon/src/domain/gateway/delivery-rules-engine.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43728363059fc1beb310ef548505036337d964138975c71264e0fd096ad0e69"}},{"ruleId":"D1","level":"warning","message":{"text":"community-harness-presets.shellSyntaxIn (cyclomatic 27): community-harness-presets.shellSyntaxIn 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/daemon/src/domain/community-harness-presets.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"db453366c4c8da0294b21ecdc1294d29f62d16fa3a27b01be17cc7329ecb9e4b"}},{"ruleId":"D1","level":"warning","message":{"text":"queue-stuck-sweep.runStuckSweep::undeliveredCandidate (cyclomatic 27): queue-stuck-sweep.runStuckSweep::undeliveredCandidate 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. This shape REPEATS in the file: 4 other methods here (queue-stuck-sweep.runStuckSweep, queue-stuck-sweep.runStuckSweep::unclaimedCandidate, queue-stuck-sweep.runStuckSweep::custodyCandidate, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 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/daemon/src/domain/queue-stuck-sweep.ts"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc115a0bf085c5a451c562b9e8818c01d9b8827220ef847bbf89e57c4e446aa"}},{"ruleId":"D1","level":"warning","message":{"text":"queue-wake-ladder.readLadder (cyclomatic 27): queue-wake-ladder.readLadder 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/daemon/src/domain/queue-wake-ladder.ts"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f9e741262392a73135c11dc31cf2ef3cdc567e898043bfe9991d89f2529e69"}},{"ruleId":"D1","level":"warning","message":{"text":"QueueRepository.recordDelegatedDecision (cyclomatic 27): QueueRepository.recordDelegatedDecision has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 4 of the 27 points are its own statements and the rest belongs to one function literal inside it that branches (line 4919). 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":4904}}}],"partialFingerprints":{"codehealthFindingId/v1":"56fe8f5a393f266fe6fcbfcdef6516dbb0f4f2e0c7ddef76b73f1fe38009d955"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeCompactionEnforcer.endedAttemptGate (cyclomatic 27): ClaudeCompactionEnforcer.endedAttemptGate 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ee2165e06a5c3f504afba07630a28b233bbcd08a18b426ba1def307635e6fc"}},{"ruleId":"D1","level":"warning","message":{"text":"compact.compactCommand (cyclomatic 27): compact.compactCommand has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 1 of the 27 points is its own statement and the rest belongs to one function literal inside it that branches (line 110). 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/commands/compact.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"695ecee21feeec7dc889ce251156b929886fa5296196b4399597184a7733e639"}},{"ruleId":"D1","level":"warning","message":{"text":"config.configCommand (cyclomatic 27): config.configCommand has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 1 of the 27 points is its own statement and the rest belongs to 5 function literals inside it that branch (lines 255, 194, 285, \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/commands/config.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"694a83c09e0594ead98e6df4ad16b11bbded703d5bfdf3a58185873cc12e8cda"}},{"ruleId":"D1","level":"warning","message":{"text":"context-install.validateContextPackManifestForInstall (cyclomatic 27): context-install.validateContextPackManifestForInstall 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/lib/context-install.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e2a1cfa07a4c5940e2bbe10e59e501651086e0fa4a380f9d5dd3dcbd90751b"}},{"ruleId":"D1","level":"warning","message":{"text":"terminal-window-rex.openRexView (cyclomatic 27): terminal-window-rex.openRexView 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/cli/src/terminal-window-rex.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5550aafa48ce78cb531d12a0a4aabf79034fd23674447db8107b558f9cc0ed1"}},{"ruleId":"D1","level":"warning","message":{"text":"workflow-errors.describeDaemonRejection (cyclomatic 27): workflow-errors.describeDaemonRejection 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/commands/workflow-errors.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"444e09427b5423a3d01dffe87e789182e2ce79c144c2bbb72b381a97f604def6"}},{"ruleId":"D1","level":"warning","message":{"text":"permission-stop-descriptor.buildPermissionRuleSuggestions (cyclomatic 27): permission-stop-descriptor.buildPermissionRuleSuggestions 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/daemon/assets/plugins/openrig-core/hooks/scripts/permission-stop-descriptor.cjs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ed23b468dbceb924c80e1db45bcc8f92158ad560a79327acd9f4acf9f5826b6"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-network-default.decideCodexNetworkDefault (cyclomatic 27): codex-network-default.decideCodexNetworkDefault 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/daemon/src/domain/codex-network-default.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc41999eacadf2ba2102dfddaddc16479a5926cc7b66421996e3cb5a702caeed"}},{"ruleId":"D1","level":"warning","message":{"text":"cmux-transport.buildCommand (cyclomatic 27): cmux-transport.buildCommand 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/daemon/src/adapters/cmux-transport.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b93b95b16d86a0b5e3cebbeeafce185f72faaeafbc041be65254733d281d8b"}},{"ruleId":"D1","level":"warning","message":{"text":"AskService.ask (cyclomatic 27): AskService.ask 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/daemon/src/domain/ask-service.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"d871b19ce6ad15df45c1be381499814b4e4fefaaf92bcf0d32fd5e10fc2e833c"}},{"ruleId":"D1","level":"warning","message":{"text":"continuity-policy-materializer.armContinuityPolicy (cyclomatic 27): continuity-policy-materializer.armContinuityPolicy has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 7 of the 27 points are its own statements and the rest belongs to 9 function items inside it that branch (matches, retireUnexpected, isCurrentShapeCandidate, \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/daemon/src/domain/continuity-policy-materializer.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"991d68809393f47520014ceca9bab5208b72055257369703959e3f192b8ad0d2"}},{"ruleId":"D1","level":"warning","message":{"text":"ContextPackLibraryService.composeFromFiles (cyclomatic 27): ContextPackLibraryService.composeFromFiles has cyclomatic complexity 27 (threshold 15). 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, separate the cases: extract each independent branch into its own 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/daemon/src/domain/context-packs/context-pack-library-service.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"8300a1137aa7e8558233bc29e9017023e297c939894a86b1737b3bf5861ad55d"}},{"ruleId":"D1","level":"warning","message":{"text":"health-detectors.evaluatePassiveCeremony (cyclomatic 27): health-detectors.evaluatePassiveCeremony 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/daemon/src/domain/health-detectors.ts"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c451939bf19e21a0d72a36d111572883064a244fe198f41c435c010fc255f13"}},{"ruleId":"D1","level":"warning","message":{"text":"SeatLifecycleService.stopManagedTmuxSeat (cyclomatic 27): SeatLifecycleService.stopManagedTmuxSeat has cyclomatic complexity 27 (threshold 15). Of this number, 22 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":"packages/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":2099}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed75758d75d022d9931c48bd822c4bbe992724dd73f68814bead7bd027fb6e0f"}},{"ruleId":"D1","level":"warning","message":{"text":"RestoreCheckService.checkStartupContext (cyclomatic 27): RestoreCheckService.checkStartupContext has cyclomatic complexity 27 (threshold 15). Of this number, 22 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/daemon/src/domain/restore-check-service.ts"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ecd17485513d5386dd7c8e4493098ebf31d6b2d55bceb886d25a61b29f52ba"}},{"ruleId":"D1","level":"warning","message":{"text":"seat.seatRoutes.post(\u0022/set-runtime/:seatRef\u0022) (cyclomatic 27): seat.seatRoutes.post(\u0022/set-runtime/:seatRef\u0022) has cyclomatic complexity 27 (threshold 15). Of this number, 25 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. This is NOT this file\u0027s highest cyclomatic complexity: seat.seatLifecycleStatus (cyclomatic 31) 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/daemon/src/routes/seat.ts"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d16cf94d4d4f8d8a39128227366fd2641e4b576bfa5e2477a3c5f60d5f9f628"}},{"ruleId":"D1","level":"warning","message":{"text":"config.configRoutes (cyclomatic 27): config.configRoutes has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 1 of the 27 points is its own statement and the rest belongs to 5 function literals inside it that branch (lines 94, 40, 116, \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/daemon/src/routes/config.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8cdef8dad0c0cb2d6f30c4ef5010df916fc27c0f71d351b2b777ba63205baa8"}},{"ruleId":"D1","level":"warning","message":{"text":"terminal-ws.registerTerminalWs (cyclomatic 27): terminal-ws.registerTerminalWs has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 1 of the 27 points is its own statement and the rest belongs to 5 function items inside it that branch (a function literal at line 66, a function literal at line 83, getRegistry, \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/daemon/src/routes/terminal-ws.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed526945d2eee4b5715def6ad59304cd1636ceffd0441b1f6906fa3665a86e0"}},{"ruleId":"D1","level":"warning","message":{"text":"MarkdownViewer.parseMarkdown (cyclomatic 27): MarkdownViewer.parseMarkdown 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/ui/src/components/markdown/MarkdownViewer.tsx"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab96389bbd3127c22ac47a0d720462901e6f04f5772ce4822cf763067ea1a4e0"}},{"ruleId":"D1","level":"warning","message":{"text":"TerminalPreviewPopover.TerminalPreviewPopover (cyclomatic 27): TerminalPreviewPopover.TerminalPreviewPopover has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 7 of the 27 points are its own statements and the rest belongs to 8 function items inside it that branch (a function literal at line 180, a function literal at line 162, a function literal at line 126, \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/ui/src/components/topology/TerminalPreviewPopover.tsx"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"3adb44706177d77b70e1c1223802827dd7700efa5e7723ee08ffabc9e09223da"}},{"ruleId":"D1","level":"warning","message":{"text":"CompactStatusRow.CompactStatusRow (cyclomatic 27): CompactStatusRow.CompactStatusRow has cyclomatic complexity 27 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 2 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/ui/src/components/mission-control/components/CompactStatusRow.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f2edfa1d4b2c6e63fa074e1b7019f955ddf64ccd6334469b2cadc0a519ba2e5"}},{"ruleId":"D1","level":"warning","message":{"text":"refresh-managed-plugin.classify (cyclomatic 27): refresh-managed-plugin.classify 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":"skills/_canonical/core/openrig-upgrade/scripts/refresh-managed-plugin.mjs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e48bc5a81277e16665c8303bf5f460c2c031a542994430e1405931a57b05ef"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentActivityStore.recordRunnerObservation (cyclomatic 26): AgentActivityStore.recordRunnerObservation has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 11 of the 26 points are its own statements and the rest belongs to one function literal inside it that branches (line 224). 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/daemon/src/domain/agent-activity-store.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"4471b5f1aa90bba702bea525bef0e6681c88bad80ded3d326188c9ae3be03eaf"}},{"ruleId":"D1","level":"warning","message":{"text":"rigspec-schema.validateClaudeAdditions (cyclomatic 26): rigspec-schema.validateClaudeAdditions has cyclomatic complexity 26 (threshold 15). Of this number, 15 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":"packages/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0c91e0067b5ba024d2ca0a867f2ae31c71f2ee3a099657c382cba50cd8b505"}},{"ruleId":"D1","level":"warning","message":{"text":"human-questions.parseHumanQuestions (cyclomatic 26): human-questions.parseHumanQuestions 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/daemon/src/domain/human-questions.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f595f17e624f07270c63d8809bce06e6685cf8484e0491059c6bc7ed26484b"}},{"ruleId":"D1","level":"warning","message":{"text":"QueueWakeRepository.getStatus (cyclomatic 26): QueueWakeRepository.getStatus 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/daemon/src/domain/queue-wake-repository.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c18b251d8fd11341836b95d18143376c1829a61d333b346df0af54282c7fa4"}},{"ruleId":"D1","level":"warning","message":{"text":"SeatActivityService.rawCandidate (cyclomatic 26): SeatActivityService.rawCandidate 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/daemon/src/domain/seat-activity-service.ts"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"f51150a827f8f48b24fbcbe79cafb566fa7b771e83f28abd2de7cca2ff9c60a0"}},{"ruleId":"D1","level":"warning","message":{"text":"QueueRepository.deliverWakeIntent::claim (cyclomatic 26): QueueRepository.deliverWakeIntent::claim 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. This shape REPEATS in the file: one other method here (QueueRepository.deliverWakeIntent) 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":1709}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf848c9e838cc918e9a0a51fef06c2d9d3d5022ad1ba805ef004ca8ad53b403"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionTransport.waitForIdle (cyclomatic 26): SessionTransport.waitForIdle has cyclomatic complexity 26 (threshold 15). Of this number, 20 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/session-transport.ts"},"region":{"startLine":4268}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee809d4f2f2915c01fb723cada0ffb5d8c9d68c99bafac87d9747726a6d99eb"}},{"ruleId":"D1","level":"warning","message":{"text":"check-runner.server (cyclomatic 26): check-runner.server has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 1 of the 26 points is its own statement and the rest belongs to one function literal inside it that branches (line 89). 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":"docs/reference/runner-conformance/check-runner.mjs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfafc4d8028c53d7442e9fcf6f26a2508aaa7f58cf1b9a7d637e3bfe2e282ea0"}},{"ruleId":"D1","level":"warning","message":{"text":"check-runner.submitAsk (cyclomatic 26): check-runner.submitAsk has cyclomatic complexity 26 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 3 belong to 3 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":"docs/reference/runner-conformance/check-runner.mjs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"7840ae68b88f50cfa7a81a48e595f4946140341dfbc5924374683c79de1adfff"}},{"ruleId":"D1","level":"warning","message":{"text":"local-daemon-owner.assessLocalDaemonOwner (cyclomatic 26): local-daemon-owner.assessLocalDaemonOwner has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 5 of the 26 points are its own statements and the rest belongs to 3 function items inside it that branch (a function literal at line 58, a function literal at line 59, observe). 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/local-daemon-owner.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"060231d32e961d7d89f8c540d4d54b9e3e5fbe49044fd1eafc3af701324c98a5"}},{"ruleId":"D1","level":"warning","message":{"text":"ps.runCrossHostPs (cyclomatic 26): ps.runCrossHostPs 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/cli/src/commands/ps.ts"},"region":{"startLine":1692}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f21f4e9b51f162be4e6bd99010fd83811735105399525ef2b8a1087abb41d1c"}},{"ruleId":"D1","level":"warning","message":{"text":"queue-artifact.codeResultOf (cyclomatic 26): queue-artifact.codeResultOf 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/queue-artifact.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"43bcf94070acbb8ccf6fa0f2c59d6ce02c2a3473be81eb3d1fb555790614a082"}},{"ruleId":"D1","level":"warning","message":{"text":"provider.providerCommand::renderUsageRow (cyclomatic 26): provider.providerCommand::renderUsageRow 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. This shape REPEATS in the file: 4 other methods here (provider.providerCommand::renderStatusHuman, provider.providerCommand::renderSeatAccounts, provider.providerCommand::renderAcrossHosts, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 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/commands/provider.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3202d7c74ebd5f08476d07bba49755da08ac39a0e0015865bcdaaf13728722"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-jsonl-parser.parseCodexJsonl (cyclomatic 26): codex-jsonl-parser.parseCodexJsonl has cyclomatic complexity 26 (threshold 15). 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, separate the cases: extract each independent branch into its own 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/restore-packet/codex-jsonl-parser.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd3f951914a380f558a2f3d20c66fad1b2fdca4210f6b50c2edc5388d2e5b49"}},{"ruleId":"D1","level":"warning","message":{"text":"scope.buildApproveCommand (cyclomatic 26): scope.buildApproveCommand has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 5 of the 26 points are its own statements and the rest belongs to one function literal inside it that branches (line 2206). 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/commands/scope.ts"},"region":{"startLine":2190}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c34fb3b34d35f26acab0007fc577ba8387d98a78a85d247e21443a4a44bb6dc"}},{"ruleId":"D1","level":"warning","message":{"text":"workflow-render.renderTraceTree (cyclomatic 26): workflow-render.renderTraceTree 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/commands/workflow-render.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b2211e83c8107d10a2bedec04b470c9b80db1761930a1cecd69752e1d2153cb"}},{"ruleId":"D1","level":"warning","message":{"text":"claude-team-permissions.scanQuotes (cyclomatic 26): claude-team-permissions.scanQuotes 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/daemon/assets/claude-team-permissions.cjs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c6675c33ef0aa1357ce334fd6cb361d014cf25b83afbec0371e377df74257fc"}},{"ruleId":"D1","level":"warning","message":{"text":"CodexRuntimeAdapter.profileRemainsReadOnly (cyclomatic 26): CodexRuntimeAdapter.profileRemainsReadOnly 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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":1240}}}],"partialFingerprints":{"codehealthFindingId/v1":"408b58b82d0c1ed96c6bd8e2a3eaecbe13ccea9213f6312ffca3716374ca94db"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-runtime-adapter.tomlSections (cyclomatic 26): codex-runtime-adapter.tomlSections has cyclomatic complexity 26 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 1 belongs 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":"packages/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":2460}}}],"partialFingerprints":{"codehealthFindingId/v1":"42616a11db81d4d3527b7e4538c12d3ced9f870d5958806bf1e02a8d817f8ec5"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-runtime-adapter.lineStartsAtDocumentLevel (cyclomatic 26): codex-runtime-adapter.lineStartsAtDocumentLevel 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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":2717}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a070ad52f18af917b4e0207238a714d75563bc6900f80deb619fa6cbef3f44f"}},{"ruleId":"D1","level":"warning","message":{"text":"seat-runtime-home-record.recordRuntimeHome (cyclomatic 26): seat-runtime-home-record.recordRuntimeHome has cyclomatic complexity 26 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 9 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/daemon/src/domain/seat-runtime-home-record.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b5822f96659fc082a101b67044970dac4f71d40f0a86b99d16bf8ad8d7a4532"}},{"ruleId":"D1","level":"warning","message":{"text":"RigInstantiator.instantiate (cyclomatic 26): RigInstantiator.instantiate has cyclomatic complexity 26 (threshold 15). Of this number, 20 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"a77451eb08042cf1697254d96378b446aed3da39eb1d9b9d7c7054118aa40f81"}},{"ruleId":"D1","level":"warning","message":{"text":"EnvironmentArtifacts.export (cyclomatic 26): EnvironmentArtifacts.export has cyclomatic complexity 26 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 11 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/daemon/src/domain/environment-artifacts.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"22717cda6037c7be6384211e72a5ca8e7af98e74d67ec278fa5e1abb1984b5de"}},{"ruleId":"D1","level":"warning","message":{"text":"existing-rig-restore.automaticRestoreOverrides (cyclomatic 26): existing-rig-restore.automaticRestoreOverrides has cyclomatic complexity 26 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 10 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/daemon/src/domain/existing-rig-restore.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0333868d66aab7875d543771d32d8b0905c871dd1a5dd5d230e300dcda4abf"}},{"ruleId":"D1","level":"warning","message":{"text":"PiCompactionService.request (cyclomatic 26): PiCompactionService.request has cyclomatic complexity 26 (threshold 15). Of this number, 24 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":"packages/daemon/src/domain/pi-compaction-service.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e844bbde55122957c7f4a5fa7fbc43d4a8e09450ea44fe57e23826330a857f4"}},{"ruleId":"D1","level":"warning","message":{"text":"SuccessorSessionLauncher.createSuccessor (cyclomatic 26): SuccessorSessionLauncher.createSuccessor 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/daemon/src/domain/successor-session-launcher.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd769dbc86c742f5db8b83f7af3ad8b195848981bd38cbf7477e5eb15c1f8708"}},{"ruleId":"D1","level":"warning","message":{"text":"project-classifier.validateClassifyInput (cyclomatic 26): project-classifier.validateClassifyInput 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/daemon/src/domain/project-classifier.ts"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0fb2de92ef9a01b57f78d59c192af144137f7ba9a7b38c697a37908f52cf1e"}},{"ruleId":"D1","level":"warning","message":{"text":"RestoreCheckService.check (cyclomatic 26): RestoreCheckService.check has cyclomatic complexity 26 (threshold 15). 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, separate the cases: extract each independent branch into its own 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/daemon/src/domain/restore-check-service.ts"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"03069f8313dbc613ec76e5d23cbf1c85266ba73f222373a4fa44e72456dbe9bf"}},{"ruleId":"D1","level":"warning","message":{"text":"workflow-exception-readiness.inspectExceptionReadiness (cyclomatic 26): workflow-exception-readiness.inspectExceptionReadiness has cyclomatic complexity 26 (threshold 15). Of this number, 23 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/daemon/src/domain/workflow-exception-readiness.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b0cce01f741746ffdad806358971a8603c909c2ce5c0824069fe49266346d7"}},{"ruleId":"D1","level":"warning","message":{"text":"state.drillTo (cyclomatic 26): state.drillTo 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/tui/src/state.ts"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b3a38897e6ef34e3037156e68ad8cc19f9e1c846a961b8c323fc200b484df6d"}},{"ruleId":"D1","level":"warning","message":{"text":"AppShell.AppShellInner (cyclomatic 26): AppShell.AppShellInner has cyclomatic complexity 26 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 5 belong to 4 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/ui/src/components/AppShell.tsx"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f54236cb0c5ac92a42da5f84aba549f6fa08e96b7352d34ba291d21beda1cb1"}},{"ruleId":"D1","level":"warning","message":{"text":"topology-activity.parseTopologyActivityEvent (cyclomatic 26): topology-activity.parseTopologyActivityEvent has cyclomatic complexity 26 (threshold 15). Of this number, 25 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/ui/src/lib/topology-activity.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c81849905cd5aeda76ce7b30f49d11c2b96f40f35f94b50f6e7dd78b2fa313"}},{"ruleId":"D1","level":"warning","message":{"text":"ImportFlow.ImportFlow (cyclomatic 26): ImportFlow.ImportFlow has cyclomatic complexity 26 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 12 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/ui/src/components/ImportFlow.tsx"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"2279360c04be601e218d847761c9b1666fcdfe28d9c5cf4b4d8ec2fcf25fe5db"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentActivityStore.getRunnerObservation (cyclomatic 25): AgentActivityStore.getRunnerObservation 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, 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/daemon/src/domain/agent-activity-store.ts"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"05bb23bfd9902a603c405ea6f8efd09aa7a02e72a5776a83db94f56fc68d7a24"}},{"ruleId":"D1","level":"warning","message":{"text":"startup-validation.validateStartupAction (cyclomatic 25): startup-validation.validateStartupAction 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/daemon/src/domain/startup-validation.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed6ad3f288a4b588960f818e29a55fd2ce4fbdaa9a572aa24d38ab408a8800a"}},{"ruleId":"D1","level":"warning","message":{"text":"rigspec-schema.normalizeSessionSource (cyclomatic 25): rigspec-schema.normalizeSessionSource 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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"949227d98d6e6be13862b4806a48642e02e592628d0e882f0712ce29dabdfaa4"}},{"ruleId":"D1","level":"warning","message":{"text":"QueueRepository.retryPromptWakesOnClear (cyclomatic 25): QueueRepository.retryPromptWakesOnClear has cyclomatic complexity 25 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 5 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":2066}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe371deb653bd8653f13dbbc066d82c1e5241ce8c793a3f864fafcfe3ac5bcc6"}},{"ruleId":"D1","level":"warning","message":{"text":"QueueRepository.retryUnroutableWakesOnReachable (cyclomatic 25): QueueRepository.retryUnroutableWakesOnReachable has cyclomatic complexity 25 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 8 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":2147}}}],"partialFingerprints":{"codehealthFindingId/v1":"d36f07d66d4ad1f25b3e5b9bb96645c7853f5baac559e643604dcb1111520a8d"}},{"ruleId":"D1","level":"warning","message":{"text":"QueueRepository.passRunnerAnswerToDecider (cyclomatic 25): QueueRepository.passRunnerAnswerToDecider has cyclomatic complexity 25 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 2 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":4488}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d1c45ced67d3e3566c4eca03e947ecf9235cdf752c50950d60dcd3e964a755"}},{"ruleId":"D1","level":"warning","message":{"text":"EnvironmentLifecycle.verifyCheckpoint (cyclomatic 25): EnvironmentLifecycle.verifyCheckpoint has cyclomatic complexity 25 (threshold 15). 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, 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/daemon/src/domain/environment-lifecycle.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5acef19985f2afb8b22c7748d6fdf7ab7d1b159fe3143e1ada12d5410759718"}},{"ruleId":"D1","level":"warning","message":{"text":"EnvironmentLifecycle.checkpoint (cyclomatic 25): EnvironmentLifecycle.checkpoint has cyclomatic complexity 25 (threshold 15). 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, separate the cases: extract each independent branch into its own 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/daemon/src/domain/environment-lifecycle.ts"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a5f14aff7dddd7840a4a226e3cfa839f3321edc8a12893f674e8fcfc948bb5"}},{"ruleId":"D1","level":"warning","message":{"text":"TmuxAdapter.sendShellCommandUnchecked (cyclomatic 25): TmuxAdapter.sendShellCommandUnchecked 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/daemon/src/adapters/tmux.ts"},"region":{"startLine":1982}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa9c913de9cfd7d0fa32d613d86695d19705fc8c49c7815d10d560fab329269"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeCompactionEnforcer.recordRestoreFailure (cyclomatic 25): ClaudeCompactionEnforcer.recordRestoreFailure 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc8c61ebbaba1c8e62163b10c0c19496f38d57bafe247366096ce644cb9b7d2"}},{"ruleId":"D1","level":"warning","message":{"text":"ps.runHttpPs (cyclomatic 25): ps.runHttpPs 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/cli/src/commands/ps.ts"},"region":{"startLine":1767}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f2762533c8c5fc27d7ce8c45737de3d266847c08f68927b95d97e25dfad351"}},{"ruleId":"D1","level":"warning","message":{"text":"stream-consumer.applyEffect (cyclomatic 25): stream-consumer.applyEffect has cyclomatic complexity 25 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 10 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/decisions/stream-consumer.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"abfd49edf27d2c2bc1436abf2abf8640d365e41cb577e5adb803235181ffc52e"}},{"ruleId":"D1","level":"warning","message":{"text":"provider.providerCommand::renderStatusHuman (cyclomatic 25): provider.providerCommand::renderStatusHuman 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. This shape REPEATS in the file: 4 other methods here (provider.providerCommand::renderSeatAccounts, provider.providerCommand::renderUsageRow, provider.providerCommand::renderAcrossHosts, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 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/commands/provider.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab1ed3319c6e8dc68c4803720ade5f5fd5f1ee4625afba46a5f12fa4f462e55"}},{"ruleId":"D1","level":"warning","message":{"text":"queue.terminalDeliveryResult (cyclomatic 25): queue.terminalDeliveryResult 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/commands/queue.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde616f6217e7877d80271306f1bbb00adeafb64c3acf96b56109f0b18cfd108"}},{"ruleId":"D1","level":"warning","message":{"text":"terminal.humanOpen (cyclomatic 25): terminal.humanOpen 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/commands/terminal.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"de66f99fe0c2499510eef2f17d1df2e3e2cf71e4661d0e14afccf2b9de8a2663"}},{"ruleId":"D1","level":"warning","message":{"text":"claude-team-permissions.normalize (cyclomatic 25): claude-team-permissions.normalize 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/daemon/assets/claude-team-permissions.cjs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd9ec42a13fbbad4482b52d7ababa0c9d9312087ae382f15e7849f648c982bd5"}},{"ruleId":"D1","level":"warning","message":{"text":"bounded-probe-exec.boundedProbeExec.\u003Creturned closure\u003E (cyclomatic 25): bounded-probe-exec.boundedProbeExec.\u003Creturned closure\u003E has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 1 of the 25 points is its own statement and the rest belongs to 16 function literals inside it that branch (lines 177, 97, 126, \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/daemon/src/adapters/bounded-probe-exec.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a22db560094b2a5c7de98dfa37e19c985e961c59434c7b8ad3a3df412201683"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-filesystem-preflight.decideCodexFilesystemPolicy (cyclomatic 25): codex-filesystem-preflight.decideCodexFilesystemPolicy has cyclomatic complexity 25 (threshold 15). Of this number, 23 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/daemon/src/domain/codex-filesystem-preflight.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b89c55847507a2aca524fc8e38188ae389947336e8cee81c301e2925ba3e544"}},{"ruleId":"D1","level":"warning","message":{"text":"InstallVerifier.verify (cyclomatic 25): InstallVerifier.verify 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/daemon/src/domain/install-verifier.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b134f360bdeb0ec9eb930040451970dbdf5daeeafcd2a70bd9482b14fd775c4"}},{"ruleId":"D1","level":"warning","message":{"text":"RigSpecPreflight.check (cyclomatic 25): RigSpecPreflight.check has cyclomatic complexity 25 (threshold 15). 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, separate the cases: extract each independent branch into its own 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/daemon/src/domain/rigspec-preflight.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"00931b8a73f128b0872c0e48b9805682aff6c80676c5417329a62b44e5c53047"}},{"ruleId":"D1","level":"warning","message":{"text":"CmuxLayoutService.buildWorkspacePanes (cyclomatic 25): CmuxLayoutService.buildWorkspacePanes 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/daemon/src/domain/cmux-layout-service.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b4225c6c782b9938442573d1d718cc477268872dc86da102e7a16fc45157957"}},{"ruleId":"D1","level":"warning","message":{"text":"ContextMonitor.normalizeStartupStatus (cyclomatic 25): ContextMonitor.normalizeStartupStatus has cyclomatic complexity 25 (threshold 15). Of this number, 17 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":"packages/daemon/src/domain/context-monitor.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"2089894ee49c8740a20470143dba587ea8e6d74bac5c0c0b3dc3ad6e3dad76a8"}},{"ruleId":"D1","level":"warning","message":{"text":"current-work.deriveWorkCandidates (cyclomatic 25): current-work.deriveWorkCandidates 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":"packages/daemon/src/domain/current-work.ts"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d564a2c004291be3049f4fdaf015b17b7bc3443281c780857340f459ab9a68"}},{"ruleId":"D1","level":"warning","message":{"text":"SlackAskSettlement.desired (cyclomatic 25): SlackAskSettlement.desired has cyclomatic complexity 25 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 7 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/daemon/src/domain/gateway/slack/settled-asks.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbdda5ca49dcedc189f3c4ea3f8aa936a151a092f9c1df03e875c2ab03943cb4"}},{"ruleId":"D1","level":"warning","message":{"text":"slack-subsystem.buildSlackGatewayWire.deliverDigestPost (cyclomatic 25): slack-subsystem.buildSlackGatewayWire.deliverDigestPost has cyclomatic complexity 25 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 7 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/daemon/src/domain/gateway/slack/slack-subsystem.ts"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f52969dbc51874fe38af47e0605d03250e281d7363f90e49bef8ea27301d0ff"}},{"ruleId":"D1","level":"warning","message":{"text":"HealthDiagnosisService.dispose (cyclomatic 25): HealthDiagnosisService.dispose 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":"packages/daemon/src/domain/health-diagnosis.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22041ec92afc46631a2d02dd0f15104e2190e6f8f3ea01249c1e09716c3747a"}},{"ruleId":"D1","level":"warning","message":{"text":"default-workspace-scaffold.ensureDefaultWorkspace (cyclomatic 25): default-workspace-scaffold.ensureDefaultWorkspace 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/daemon/src/domain/workspace/default-workspace-scaffold.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"80422f78486e8b3dd54dd498d9c040c5ef369bdccb712af4b408428a3bf29d5f"}},{"ruleId":"D1","level":"warning","message":{"text":"refocus-record.readRefocusRecord (cyclomatic 25): refocus-record.readRefocusRecord 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/daemon/src/domain/refocus-record.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"034b8a845d1d72a2c251e4b0eed4466c547d82b1ffcf1fa26d4a69dacd60dea6"}},{"ruleId":"D1","level":"warning","message":{"text":"RigLifecycleService.shrinkPod (cyclomatic 25): RigLifecycleService.shrinkPod has cyclomatic complexity 25 (threshold 15). Of this number, 23 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/daemon/src/domain/rig-lifecycle-service.ts"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed48eb526c5a924059de3ef304cc82201d54a32b381e1704d532cb629633d0b2"}},{"ruleId":"D1","level":"warning","message":{"text":"StreamIntakeCoordinator.catchUp (cyclomatic 25): StreamIntakeCoordinator.catchUp 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/daemon/src/domain/stream-intake.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ff98a399a4be6bd8d30a43359cd40ec9a9133a64c735b8dcfbcbe95c99e054"}},{"ruleId":"D1","level":"warning","message":{"text":"discovery.discoveryRoutes.post(\u0022/:id/bind\u0022) (cyclomatic 25): discovery.discoveryRoutes.post(\u0022/:id/bind\u0022) 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":"packages/daemon/src/routes/discovery.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bdf24822caaef4b3b6b570b802d00f5f3439c349a304d7d1cacc0365b627140"}},{"ruleId":"D1","level":"warning","message":{"text":"env.envRoutes (cyclomatic 25): env.envRoutes has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 1 of the 25 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 18, 74, 111). 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/daemon/src/routes/env.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"204d30999e75547efaa2c2855b923231700055650220e103990a5a476533070e"}},{"ruleId":"D1","level":"warning","message":{"text":"PermissionStopObservations.observe (cyclomatic 24): PermissionStopObservations.observe 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/daemon/src/domain/permission-stop-observation.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"64ca2d2a556f4e2db7b642fede2233f9ad1e0325d8c35f7529dc829cf395c001"}},{"ruleId":"D1","level":"warning","message":{"text":"pi-usage-facts.extractPiUsageFacts (cyclomatic 24): pi-usage-facts.extractPiUsageFacts 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/daemon/src/domain/pi-usage-facts.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"640e3afe79312e581bad1353ce7326ede9efb0dab0b7d9a14cecd929379a4aea"}},{"ruleId":"D1","level":"warning","message":{"text":"native-process-lineage.explainNativeRejection (cyclomatic 24): native-process-lineage.explainNativeRejection has cyclomatic complexity 24 (threshold 15). Of this number, 22 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/daemon/src/domain/native-process-lineage.ts"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ea05131b67fb991fb8622c6de73ea1881253a594fb05a425c2491db0f7cad9"}},{"ruleId":"D1","level":"warning","message":{"text":"resume-token-capture.deriveResumeToken (cyclomatic 24): resume-token-capture.deriveResumeToken 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/daemon/src/domain/resume-token-capture.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e6200bd565e93157220692a05038e24ec001b90354fa8bb737c7214386ee9a"}},{"ruleId":"D1","level":"warning","message":{"text":"skill-catalog.resolveSkillLoadout (cyclomatic 24): skill-catalog.resolveSkillLoadout 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/daemon/src/domain/skill-catalog.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9c1ec4c235c2a3421b3635e86802970558507c9a6068c73e903df000462fb1"}},{"ruleId":"D1","level":"warning","message":{"text":"projection-planner.planProjection (cyclomatic 24): projection-planner.planProjection has cyclomatic complexity 24 (threshold 15). Of this number, 22 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/daemon/src/domain/projection-planner.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"c70a23b7df1375ce67e9c4fd25cee90fec79854c699948f57d8d7158681d0297"}},{"ruleId":"D1","level":"warning","message":{"text":"ChannelCoverageStore.read (cyclomatic 24): ChannelCoverageStore.read has cyclomatic complexity 24 (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/daemon/src/domain/gateway/slack/state-store.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ffbbc9a6cbb74cc5c141490924e5a926fd21b3092282339aa2f3d5eb49de276"}},{"ruleId":"D1","level":"warning","message":{"text":"remote-daemon-http.remoteJsonRequest (cyclomatic 24): remote-daemon-http.remoteJsonRequest 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, 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/daemon/src/domain/hosts/remote-daemon-http.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d985c8042dd4148a5ac25a1be6ffacef437208b4ae8b9fded5a3f6b7e1e356f"}},{"ruleId":"D1","level":"warning","message":{"text":"compose.composeMissionReview (cyclomatic 24): compose.composeMissionReview has cyclomatic complexity 24 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 12 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/daemon/src/domain/review/compose.ts"},"region":{"startLine":1297}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38e9580ebc5499fc836531b47bd5b661db452bede86219af3f147a4f50bfa74"}},{"ruleId":"D1","level":"warning","message":{"text":"queue-stuck-sweep.runStuckSweep::foldInto (cyclomatic 24): queue-stuck-sweep.runStuckSweep::foldInto 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. This shape REPEATS in the file: 4 other methods here (queue-stuck-sweep.runStuckSweep, queue-stuck-sweep.runStuckSweep::undeliveredCandidate, queue-stuck-sweep.runStuckSweep::unclaimedCandidate, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 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/daemon/src/domain/queue-stuck-sweep.ts"},"region":{"startLine":1697}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f02900393ba9ffad829fe7166c1c0f1cb7b331dbc040d5568d61f295d15e3c"}},{"ruleId":"D1","level":"warning","message":{"text":"relay-outbound.findPendingRelayReplyRef (cyclomatic 24): relay-outbound.findPendingRelayReplyRef 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/daemon/src/domain/gateway/relay-outbound.ts"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fbbf8065e43935649c92016d20db38511c78eca6bb130b28c55099d837f1948"}},{"ruleId":"D1","level":"warning","message":{"text":"session-transport.findCurrentPiDialog (cyclomatic 24): session-transport.findCurrentPiDialog has cyclomatic complexity 24 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 2 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27484c13610bffb8bb81482d4c1a7fa5e513cd742801499117f22a418f673a1"}},{"ruleId":"D1","level":"warning","message":{"text":"TmuxAdapter.capturePanesContent::captureChunk (cyclomatic 24): TmuxAdapter.capturePanesContent::captureChunk 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/daemon/src/adapters/tmux.ts"},"region":{"startLine":2697}}}],"partialFingerprints":{"codehealthFindingId/v1":"be2e914f0cc652c1b8953c8c940bcca2c7373a0ea3618872691fba42399b8e45"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeCompactionEnforcer.drainPendingPreparedCompact (cyclomatic 24): ClaudeCompactionEnforcer.drainPendingPreparedCompact has cyclomatic complexity 24 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 3 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a16c8c22cfc5c886f46d05598d7c77f60e7b5c4c4e2e1851065f307b46598d6"}},{"ruleId":"D1","level":"warning","message":{"text":"ps.parsePsControls (cyclomatic 24): ps.parsePsControls 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/cli/src/commands/ps.ts"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b4b9d994d66c378da99362e3d44982d48bcf4b97c988d46fe9e7bde1c90ab0"}},{"ruleId":"D1","level":"warning","message":{"text":"acp.acpCommand (cyclomatic 24): acp.acpCommand has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 1 of the 24 points is its own statement and the rest belongs to 7 function items inside it that branch (a function literal at line 336, a function literal at line 225, a function literal at line 295, \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/commands/acp.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dccd69a452efd72e5f58648fd2906e02979de0514cd40ff53c985c7ed6c8cac"}},{"ruleId":"D1","level":"warning","message":{"text":"bundle-source.importGitHubBundle (cyclomatic 24): bundle-source.importGitHubBundle 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":"packages/cli/src/lib/bundle-source.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfaeeeaae643e6a20f8e4ad3e7e235932b6eec521eb155a5e333fe34246300a5"}},{"ruleId":"D1","level":"warning","message":{"text":"send.runCrossHostSend (cyclomatic 24): send.runCrossHostSend 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":"packages/cli/src/commands/send.ts"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4dc934e50932706887f9cc8931995c2969418eb16a9d43b3a58d58b1e9a398e"}},{"ruleId":"D1","level":"warning","message":{"text":"compact-plan.compactPlanCommand (cyclomatic 24): compact-plan.compactPlanCommand has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 1 of the 24 points is its own statement and the rest belongs to one function literal inside it that branches (line 452). 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/commands/compact-plan.ts"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7975d6f1d202f0463a48b7b00c337ba5da9265142f91921fa00a7dd264f044"}},{"ruleId":"D1","level":"warning","message":{"text":"reconcile-session.reconcileSessionCommand (cyclomatic 24): reconcile-session.reconcileSessionCommand has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 1 of the 24 points is its own statement and the rest belongs to one function literal inside it that branches (line 68). 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/commands/reconcile-session.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bbc601e08d94e755e649ab98b45afdda0faaa3ad622434640de6ad7444b6e45"}},{"ruleId":"D1","level":"warning","message":{"text":"workflow-follow.followInstance (cyclomatic 24): workflow-follow.followInstance 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/cli/src/commands/workflow-follow.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1fe44b2252eb65b5aa85873b32ba8b4af9ba6a2834e9d99d35447fd513ceb1"}},{"ruleId":"D1","level":"warning","message":{"text":"project-registration.registerBundleProject (cyclomatic 24): project-registration.registerBundleProject has cyclomatic complexity 24 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 3 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/daemon/src/domain/workspace/project-registration.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3845004040a5d35cd7536bb32403d1716a1cfd1cdcc27234eeec125cb95a97"}},{"ruleId":"D1","level":"warning","message":{"text":"seat-recap-store.writeSeatRecap (cyclomatic 24): seat-recap-store.writeSeatRecap has cyclomatic complexity 24 (threshold 15). Of this number, 22 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/daemon/src/domain/context-packs/seat-recap-store.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f5554c7180b8ecff84801aeea81b0c8ab7a575ea0cd79724b478d22dc1856cc"}},{"ruleId":"D1","level":"warning","message":{"text":"desired-claude-activity-hooks.agentResolvedAgainstRecordedRoots (cyclomatic 24): desired-claude-activity-hooks.agentResolvedAgainstRecordedRoots has cyclomatic complexity 24 (threshold 15). Of this number, 19 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":"packages/daemon/src/domain/desired-claude-activity-hooks.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99820b0ade666efb533ecbf734c77352c56c51f7401bbc31065a72e0a0049a9"}},{"ruleId":"D1","level":"warning","message":{"text":"HealthDiagnosisService.show (cyclomatic 24): HealthDiagnosisService.show has cyclomatic complexity 24 (threshold 15). Of this number, 22 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/daemon/src/domain/health-diagnosis.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"545f49e9dd2673a9c6e450d6a760b289b8b7ce7cf7147abb2c5aba077d64dad0"}},{"ruleId":"D1","level":"warning","message":{"text":"PluginDiscoveryService.listPlugins (cyclomatic 24): PluginDiscoveryService.listPlugins 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/daemon/src/domain/plugin-discovery-service.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91811ce5448d796ced08504b933d8f2398d407ecf798dc7821887cbe043bad3"}},{"ruleId":"D1","level":"warning","message":{"text":"queue-erasure.eraseQueue::planBatch (cyclomatic 24): queue-erasure.eraseQueue::planBatch 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. This shape REPEATS in the file: one other method here (queue-erasure.eraseQueue) 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/daemon/src/domain/queue-erasure.ts"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"8caa5f41560411efbd0127632bc43ef393f8e07d6bb74e405263c26bbb16a897"}},{"ruleId":"D1","level":"warning","message":{"text":"index.startServer (cyclomatic 24): index.startServer has cyclomatic complexity 24 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 6 belong to 4 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/daemon/src/index.ts"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"052aff24818a4e665e2792a4b6f7c7f875b9f65a10c96ac96d0ebd493043f1fe"}},{"ruleId":"D1","level":"warning","message":{"text":"config-model.configValue (cyclomatic 24): config-model.configValue 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/tui/src/config/config-model.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"15043bbf25cb31e25afbf94b3ceda261a832c70cff7602efe8fe36f3cb116b5d"}},{"ruleId":"D1","level":"warning","message":{"text":"fleet-scopes-model.fleetScopesLines (cyclomatic 24): fleet-scopes-model.fleetScopesLines 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":"packages/tui/src/scopes/fleet-scopes-model.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"1722a94f06fb746973c1ab75df5d19569e81ac7333fbd686605b24d8f59b7ce7"}},{"ruleId":"D1","level":"warning","message":{"text":"useMissionDiscovery.useMissionDiscovery (cyclomatic 24): useMissionDiscovery.useMissionDiscovery has cyclomatic complexity 24 (threshold 15). Of this number, 21 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/ui/src/hooks/useMissionDiscovery.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"230ccbf5b11d8d2f6e8c6e0c3370a95f41855980c005512bd950288208da5daa"}},{"ruleId":"D1","level":"warning","message":{"text":"ProjectMetaPrimitives.queueStateToken (cyclomatic 24): ProjectMetaPrimitives.queueStateToken has cyclomatic complexity 24 (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/ui/src/components/project/ProjectMetaPrimitives.tsx"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"e882aad76713bd8a9a97890f1369ddf6562226b4bdd99deea1f05300eb5b330f"}},{"ruleId":"D1","level":"warning","message":{"text":"SeatOverviewTable.SeatOverviewTable (cyclomatic 24): SeatOverviewTable.SeatOverviewTable has cyclomatic complexity 24 (threshold 15). Of this number, 21 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":"packages/ui/src/components/SeatOverviewTable.tsx"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cfcbdaf11e957943dd43fe1188431550df1d03a82d85f60a3bb16dc95b06c5c"}},{"ruleId":"D1","level":"warning","message":{"text":"LaunchCmuxButton.LaunchCmuxButton (cyclomatic 24): LaunchCmuxButton.LaunchCmuxButton has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 1 of the 24 points is its own statement and the rest belongs to 10 function items inside it that branch (showStatus, a function literal at line 85, a function literal at line 150, \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/ui/src/components/topology/LaunchCmuxButton.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf5cdc7f71a1b47c0524c73603d83568c769e9f971272458d2b404402678112d"}},{"ruleId":"D1","level":"warning","message":{"text":"trace-to-root.render_work (cyclomatic 24): trace-to-root.render_work 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/daemon/assets/plugins/openrig-core/skills/refocusing/scripts/trace-to-root.py"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe252b434c1783fdb38989f01bdee2bca2b6faa2b0bbd562b7afdc46340f100"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentActivityStore.getLatestForNode (cyclomatic 23): AgentActivityStore.getLatestForNode 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, separate the cases: extract each independent branch into its own 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/daemon/src/domain/agent-activity-store.ts"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ecde45fda58a2a945900e82c61d8b196877e63f6972ab126a9c3685f4458f4f"}},{"ruleId":"D1","level":"warning","message":{"text":"pi-readiness.piCredentialEvidence (cyclomatic 23): pi-readiness.piCredentialEvidence 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/daemon/src/adapters/pi-readiness.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"8719d0872aec8a2b6a1d381c81861acbcb410dd138ebfe3acd253f43d090bc43"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-rebuild-permissions.parseCodexPermissionEnvelope (cyclomatic 23): codex-rebuild-permissions.parseCodexPermissionEnvelope 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, 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/daemon/src/domain/codex-rebuild-permissions.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a497061b6eba5584e90897a2e4711e17a472839a7d19ec42cc97dcabe96b9f"}},{"ruleId":"D1","level":"warning","message":{"text":"rigspec-schema.validateServicesBlock (cyclomatic 23): rigspec-schema.validateServicesBlock has cyclomatic complexity 23 (threshold 15). 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, separate the cases: extract each independent branch into its own 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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"30495f6cfe1e202b7ada86b17f525fa6e53a16b3a7f107bec1b2832ff4e9bd78"}},{"ruleId":"D1","level":"warning","message":{"text":"seat-launch-additions.seatLaunchAdditionsAt (cyclomatic 23): seat-launch-additions.seatLaunchAdditionsAt has cyclomatic complexity 23 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 4 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/daemon/src/domain/seat-launch-additions.ts"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e97a453ffb91f88b9c8729d73e52654c506921abbdfef44e84d5ea4d408239"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeResumeAdapter.verifyResume (cyclomatic 23): ClaudeResumeAdapter.verifyResume 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/daemon/src/adapters/claude-resume.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb8528e061a29c839bb1f9fa94153e14ac49858f2244fbc7c580140c0f0095d8"}},{"ruleId":"D1","level":"warning","message":{"text":"protocol.decodeGatewayMessage (cyclomatic 23): protocol.decodeGatewayMessage 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/daemon/src/domain/gateway/protocol.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"5384d64be8918ad850dcfadef52d8861b7265a152bbb6bf6990277582a3a3203"}},{"ruleId":"D1","level":"warning","message":{"text":"bot-inbox.botInboxProblems (cyclomatic 23): bot-inbox.botInboxProblems 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 one function literal inside it that branches (line 46). 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/daemon/src/domain/gateway/slack/bot-inbox.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"17234c3010a2c2ae9948dcc9648ce55ddf01189a3ffd7df200bfeba89acc61e6"}},{"ruleId":"D1","level":"warning","message":{"text":"quiet-hold-custody.quietHoldCustody (cyclomatic 23): quiet-hold-custody.quietHoldCustody 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":"packages/daemon/src/domain/quiet-hold-custody.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"3109377f3c2a09775f50b26a1f38f15f5a7e5bfbdea5e64bfbe5d9f411d86252"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionTransport.sweepHookBridgeOnce (cyclomatic 23): SessionTransport.sweepHookBridgeOnce 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":2944}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf480557e523d12318dfa43e0b220e2e378c3fe04f7b3d6db044f2012ac99a8b"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionTransport.claudeDeliveryObservation (cyclomatic 23): SessionTransport.claudeDeliveryObservation 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":4405}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b28311c3c335d69a745266923df7b3ef2b2e9dda751aad8ec02faf3a217e3f"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeCompactionEnforcer.reconcilePreparations (cyclomatic 23): ClaudeCompactionEnforcer.reconcilePreparations 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":2016}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0af618ca60ab370b6e2d505741ef15459bcd3f9787062b0dfad8d79458c4bf9"}},{"ruleId":"D1","level":"warning","message":{"text":"native-resume-probe.looksLikeCodexLoginPrompt (cyclomatic 23): native-resume-probe.looksLikeCodexLoginPrompt 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, 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/daemon/src/domain/native-resume-probe.ts"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d69c69e7195e6aabfde0db5b0eb2d5fe498718d3fb42646476d9892cf33e46"}},{"ruleId":"D1","level":"warning","message":{"text":"daemon-start-lock.archiveIfBeforeBoot (cyclomatic 23): daemon-start-lock.archiveIfBeforeBoot 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/daemon-start-lock.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"938bdb605b82cb6b873538ced87ef4a691d5c2c1487a929483a85a760205c828"}},{"ruleId":"D1","level":"warning","message":{"text":"broadcast.broadcastCommand (cyclomatic 23): broadcast.broadcastCommand has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 1 of the 23 points is its own statement and the rest belongs to one function literal inside it that branches (line 61). 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/commands/broadcast.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"76636d2991433de0079098b0b0aac17f39b4e3fb4b378ddacb046121023188fe"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp-server.hostedMembersOf (cyclomatic 23): mcp-server.hostedMembersOf has cyclomatic complexity 23 (threshold 15). Of this number, 19 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/mcp-server.ts"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"96422ded72fb0920897bef974ed24055acc45b1dd7c84037ca939b01547947f4"}},{"ruleId":"D1","level":"warning","message":{"text":"claude-transcript-parser.parseClaudeTranscript (cyclomatic 23): claude-transcript-parser.parseClaudeTranscript 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, separate the cases: extract each independent branch into its own 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/restore-packet/claude-transcript-parser.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff56f44488aa4c28d584e138285cfeb0847af2e6f523011338fe2b925dd2c982"}},{"ruleId":"D1","level":"warning","message":{"text":"pi-runner.createPaneCompositor (cyclomatic 23): pi-runner.createPaneCompositor 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. This shape REPEATS in the file: one other method here (pi-runner.createPaneCompositor::paint) 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"22326fe2f3200f91ad8e0f9f08520154c65942e32b8066b50024a39d1ed97d2c"}},{"ruleId":"D1","level":"warning","message":{"text":"restore-plan-preview.buildRestorePlanPreview.nodes (cyclomatic 23): restore-plan-preview.buildRestorePlanPreview.nodes 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, separate the cases: extract each independent branch into its own 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/daemon/src/domain/restore-plan-preview.ts"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd8d055c39189b18c2c55d92f68d8b3116d96fd9f931c2aa735a01d3993864a"}},{"ruleId":"D1","level":"warning","message":{"text":"connections-projection.readConnectionConfiguration (cyclomatic 23): connections-projection.readConnectionConfiguration 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/daemon/src/domain/gateway/connections-projection.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"987e802826e28705cbbba67134fbaa5e1dd9f80148fe2d5e35482e9f329dc0e9"}},{"ruleId":"D1","level":"warning","message":{"text":"relay-inbound.parseInboundEnvelope (cyclomatic 23): relay-inbound.parseInboundEnvelope 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/daemon/src/domain/gateway/relay-inbound.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc26f20ae0ff44b20589f3fbb8266758f6a6355a34737e006e06cbeab10e8f28"}},{"ruleId":"D1","level":"warning","message":{"text":"usage-series.computeCostView (cyclomatic 23): usage-series.computeCostView 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, separate the cases: extract each independent branch into its own 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/daemon/src/domain/usage-series.ts"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cfedb020aa35280fa053bcaf4df571022f7a13c89030b0e96835ea8b45d9f4e"}},{"ruleId":"D1","level":"warning","message":{"text":"health-context.healthSelectedContext (cyclomatic 23): health-context.healthSelectedContext has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 11 of the 23 points are its own statements and the rest belongs to one function item inside it that branches (add). 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/daemon/src/domain/health-context.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ff927ce32c217f70fcde488f2f29b1e2d4fb54e3bc69c7a62c34356cef4eac"}},{"ruleId":"D1","level":"warning","message":{"text":"SuccessorSessionLauncher.startAgent (cyclomatic 23): SuccessorSessionLauncher.startAgent has cyclomatic complexity 23 (threshold 15). Of this number, 22 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/daemon/src/domain/successor-session-launcher.ts"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6140d88fb6f998056024b44f13fd7f1b0429e3278be4c9004b385567363ec3"}},{"ruleId":"D1","level":"warning","message":{"text":"CodexInPlaceRestart.restart (cyclomatic 23): CodexInPlaceRestart.restart 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/daemon/src/domain/seat-restart-in-place.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39006071642bbab890c59f07e803ce5ff529ef1456d848f725c7694ee0fe0e0"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-usage-reader.converse (cyclomatic 23): codex-usage-reader.converse has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 1 of the 23 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 113, 95, 103, \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/daemon/src/domain/provider/codex-usage-reader.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"db607e516dd6ebf2c4806a1c9c1b2f869427d0ffd2180014298e57887f2421cb"}},{"ruleId":"D1","level":"warning","message":{"text":"usage-across-hosts.remoteRefreshLeg (cyclomatic 23): usage-across-hosts.remoteRefreshLeg 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/daemon/src/domain/provider/usage-across-hosts.ts"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b80f2c1b8dc16c5bf32de635addc8efe077255b15327bceaea86acfaeaf9ca"}},{"ruleId":"D1","level":"warning","message":{"text":"seat.seatRoutes.post(\u0022/handover/:seatRef\u0022) (cyclomatic 23): seat.seatRoutes.post(\u0022/handover/:seatRef\u0022) 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. This is NOT this file\u0027s highest cyclomatic complexity: seat.seatLifecycleStatus (cyclomatic 31) 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/daemon/src/routes/seat.ts"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"7880dc907e4c13c4abe33168455747403306a93b3d980c79ebe70761092a42c6"}},{"ruleId":"D1","level":"warning","message":{"text":"workspace.workspaceRoutes (cyclomatic 23): workspace.workspaceRoutes has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 1 of the 23 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 85, 37). 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/daemon/src/routes/workspace.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ed78f825451caa4e0e2c01f271d0c1550381c7635a10556557911c144b6c5c"}},{"ruleId":"D1","level":"warning","message":{"text":"scope-audit.scopeAuditRoutes (cyclomatic 23): scope-audit.scopeAuditRoutes has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 1 of the 23 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 201, 168, 353). 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/daemon/src/routes/scope-audit.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"d277a1179556831348a80ac3afdb87df86c4471bb7196c284e5c1e670f5c6250"}},{"ruleId":"D1","level":"warning","message":{"text":"telemetry.telemetryRoutes (cyclomatic 23): telemetry.telemetryRoutes has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 2 of the 23 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 37, 72, 24, \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/daemon/src/routes/telemetry.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1542189a058f5a44929c73101227a7366e1c858672a115a071b2c79a1bbddf"}},{"ruleId":"D1","level":"warning","message":{"text":"trace-to-root.render_candidates (cyclomatic 23): trace-to-root.render_candidates 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/daemon/assets/plugins/openrig-core/skills/refocusing/scripts/trace-to-root.py"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"36cd573246556b963a788941ef94c1afdf8ffc42f9eac4d3ce8cd31c3e0669f9"}},{"ruleId":"D1","level":"warning","message":{"text":"claude-auto-mode.claudeAutoModeStatus (cyclomatic 22): claude-auto-mode.claudeAutoModeStatus 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/daemon/src/domain/claude-auto-mode.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e4601910c871e8a33e3f8a655feea74534abfb9a11b8f3227689ee3f56c98a"}},{"ruleId":"D1","level":"warning","message":{"text":"effective-model-readers.newestPiModel (cyclomatic 22): effective-model-readers.newestPiModel 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/daemon/src/domain/model-divergence/effective-model-readers.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1d5255d9c78ee56c587d9962df5eb2070ea82698ec0a2a9e314095adce89a3"}},{"ruleId":"D1","level":"warning","message":{"text":"native-process-lineage.candidatesMatching (cyclomatic 22): native-process-lineage.candidatesMatching 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, separate the cases: extract each independent branch into its own 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/daemon/src/domain/native-process-lineage.ts"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bec8c2f4bf6bee061f402cc667dac9b35102db41580dadef5777ede80ef5acc"}},{"ruleId":"D1","level":"warning","message":{"text":"native-process-lineage.selectNativeProcess (cyclomatic 22): native-process-lineage.selectNativeProcess 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/daemon/src/domain/native-process-lineage.ts"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cae2b13ef1e99540b0c4e44535b00b6626eb49e77ebec391aea6cded91a485d"}},{"ruleId":"D1","level":"warning","message":{"text":"ResumeMetadataRefresher.captureCodexThreadId (cyclomatic 22): ResumeMetadataRefresher.captureCodexThreadId has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 9 of the 22 points are its own statements and the rest belongs to 2 function items inside it that branch (discover, report). 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/daemon/src/domain/resume-metadata-refresher.ts"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec66113bcc7e0d60f88f2e309a176145ace1bb1668fedf0147060d0dd1531550"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-rebuild-permissions.observeCodexRebuildPermissions (cyclomatic 22): codex-rebuild-permissions.observeCodexRebuildPermissions 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, 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/daemon/src/domain/codex-rebuild-permissions.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ffffe357d24f0a2ca18d201b625f5b49f8179ac873ebc229fab2dec6414791"}},{"ruleId":"D1","level":"warning","message":{"text":"rigspec-schema.validateContinuityPolicy (cyclomatic 22): rigspec-schema.validateContinuityPolicy 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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a813b46241ca455cedfcd4ca72239fd064ea459d4ccf1822b42b9b67b6014f"}},{"ruleId":"D1","level":"warning","message":{"text":"EnvironmentPlatform.project (cyclomatic 22): EnvironmentPlatform.project 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":"packages/daemon/src/domain/environment-platform.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc480d3b02bc0532d6906293c5c52c90a1a1525cc5a9c0193ddcd35479269c45"}},{"ruleId":"D1","level":"warning","message":{"text":"channel-map.validateChannelMap (cyclomatic 22): channel-map.validateChannelMap 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/daemon/src/domain/gateway/slack/channel-map.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"db96f55287b374182e232dd5567d33425299a90139910c4e6208b230384e675e"}},{"ruleId":"D1","level":"warning","message":{"text":"SeatStructuralActivityService.pollAllRunningTmuxSeats (cyclomatic 22): SeatStructuralActivityService.pollAllRunningTmuxSeats has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 10 of the 22 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 212, 231). 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/daemon/src/domain/seat-structural-activity-service.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d040d7c8c69c6ac90524a2fa350dcaba5b589d072d56f24bc95a5cb2d80d0df"}},{"ruleId":"D1","level":"warning","message":{"text":"node-inventory.attachTerminalActivityAndWork (cyclomatic 22): node-inventory.attachTerminalActivityAndWork 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 one function literal inside it that branches (line 1606). 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/daemon/src/domain/node-inventory.ts"},"region":{"startLine":1599}}}],"partialFingerprints":{"codehealthFindingId/v1":"272776cb2b98a12eb47244756b9cead152e1e4797b0887dd335c08c99ef48106"}},{"ruleId":"D1","level":"warning","message":{"text":"session-transport.findClaudeComposer (cyclomatic 22): session-transport.findClaudeComposer 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"98474fbf3d431ba63f0a81e0d4e0deb1785b3ddd8a073637dd4732a8fc33c8d0"}},{"ruleId":"D1","level":"warning","message":{"text":"terminal-policy.parseTerminalPolicy (cyclomatic 22): terminal-policy.parseTerminalPolicy 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, 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/daemon/src/domain/terminal-policy.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a7718b3d39873cdf34089ec876abdb947f682e978554689646112d3ee07e94"}},{"ruleId":"D1","level":"warning","message":{"text":"check-runner.launch (cyclomatic 22): check-runner.launch 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 11 function literals inside it that branch (lines 230, 225, 226, \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":"docs/reference/runner-conformance/check-runner.mjs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b572c690eaf3d2caf76bf51e4e1d814257b3c0c3f031361e5e8ed8bf99e8e3e"}},{"ruleId":"D1","level":"warning","message":{"text":"bundle-source.parseGitHubBundleLink (cyclomatic 22): bundle-source.parseGitHubBundleLink 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, 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/lib/bundle-source.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ee447b6dc88c3f9d686b19b4ad5733eec7d15210e3100d4d19dfebd4d7abd3"}},{"ruleId":"D1","level":"warning","message":{"text":"bundle-check.checkBundleFolder (cyclomatic 22): bundle-check.checkBundleFolder 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. This shape REPEATS in the file: one other method here (bundle-check.checkBundleFolder::agent) 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/lib/bundle-check.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b0f9fad90b6c37be3aef9a97f574a977dc9af862f3ac9e7305a06ff7e2751a1"}},{"ruleId":"D1","level":"warning","message":{"text":"host-bindings.loadHostBindings (cyclomatic 22): host-bindings.loadHostBindings 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/host-bindings.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"daf8d86f272b6b88efb15c1a03d26e2855ad26acfe32bef11be2e7949aa85d3c"}},{"ruleId":"D1","level":"warning","message":{"text":"reconstruction-reader.readReconstruction.materialize (cyclomatic 22): reconstruction-reader.readReconstruction.materialize 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/lib/reconstruction-reader.ts"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"d53ba094c190e3a888648265c5a069ba3d96feaadf2c2d07431d8eb274d9984f"}},{"ruleId":"D1","level":"warning","message":{"text":"down.confirmOwnRig (cyclomatic 22): down.confirmOwnRig 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/commands/down.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"100062b7ab5df4c9439bb5302b754926558d81043e760b1a13d4ce087293f326"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp-server.namedSeats (cyclomatic 22): mcp-server.namedSeats 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/mcp-server.ts"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"42470f04078911bd4c74092f7126ef1e59520c73054d66fd5cfe1e96420142a3"}},{"ruleId":"D1","level":"warning","message":{"text":"decisions.parseTemplate (cyclomatic 22): decisions.parseTemplate 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/decisions/decisions.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"c886a5b234804d595c0d249929140852fbc6530a15749bceea35cc36090271d6"}},{"ruleId":"D1","level":"warning","message":{"text":"queue.waitForDeliveryOutcome (cyclomatic 22): queue.waitForDeliveryOutcome 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/commands/queue.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c88e3f275278f34234601d0bc1e76362424fc82f5ce0a46717901b0804d44b"}},{"ruleId":"D1","level":"warning","message":{"text":"extract-surface.extractFile::evalExpr (cyclomatic 22): extract-surface.extractFile::evalExpr 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/release-surface/extract-surface.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea6a1786cb2625e08d163ebbdf3efa19975ddd1a9ed15ad58e78e94a5933e29"}},{"ruleId":"D1","level":"warning","message":{"text":"CodexRuntimeAdapter.removeCodexActivityHooks (cyclomatic 22): CodexRuntimeAdapter.removeCodexActivityHooks has cyclomatic complexity 22 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 2 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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f670661fba4b903160fa2e066e4a57277e5df18b8b02b7fa9f21789416c4136"}},{"ruleId":"D1","level":"warning","message":{"text":"bundle-types.validatePodBundleManifest (cyclomatic 22): bundle-types.validatePodBundleManifest 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/daemon/src/domain/bundle-types.ts"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb1eafb455f2af3b94567eb600126e89451dab211723c1a2c7d9e4e8e0ec5ed"}},{"ruleId":"D1","level":"warning","message":{"text":"topology-defaults-installer.installTopologyDefaults (cyclomatic 22): topology-defaults-installer.installTopologyDefaults has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 6 of the 22 points are its own statements and the rest belongs to 8 function items inside it that branch (copyIfAbsent, ensureDir, section, \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/daemon/src/domain/topology-defaults-installer.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b142923ef3d857d376a19dc1f1177166cf4688c59e1836b48860c430ae2eb4"}},{"ruleId":"D1","level":"warning","message":{"text":"PodRigInstantiator.computePodLaunchOrder (cyclomatic 22): PodRigInstantiator.computePodLaunchOrder 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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":1960}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad071ef127e4c073eadb84962fa95f6fe0b6bc4f428ca5bc229c493dd3fdd0d7"}},{"ruleId":"D1","level":"warning","message":{"text":"current-work.evaluateCreateScope (cyclomatic 22): current-work.evaluateCreateScope 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":"packages/daemon/src/domain/current-work.ts"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f586d00d4e940df81432fb6fd66ce8c6edd57f0584cab8a4662f438c3816142"}},{"ruleId":"D1","level":"warning","message":{"text":"health-policy.validateHealthPolicy (cyclomatic 22): health-policy.validateHealthPolicy 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, 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/daemon/src/domain/health-policy.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc2b051e9aef038f0724f34898cf904dd98a0f06592a2181658627147be0b80"}},{"ruleId":"D1","level":"warning","message":{"text":"pi-usage-entries-store.validPiUsageFact (cyclomatic 22): pi-usage-entries-store.validPiUsageFact has cyclomatic complexity 22 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 6 belong to 3 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/daemon/src/domain/pi-usage-entries-store.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe0251002b87a7553e0bb1b5c5f4ef3b4ca4caf28d7b5b180b4aabfbf526a1c8"}},{"ruleId":"D1","level":"warning","message":{"text":"health-context.healthAuthority (cyclomatic 22): health-context.healthAuthority has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 8 of the 22 points are its own statements and the rest belongs to 2 function items inside it that branch (belongs, a function literal at line 118). 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/daemon/src/domain/health-context.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f02506b442872811905025198702918b5c35eb8bc6d17d6859ffb9c719a69c"}},{"ruleId":"D1","level":"warning","message":{"text":"fleet-scopes.readHostScopes (cyclomatic 22): fleet-scopes.readHostScopes 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":"packages/daemon/src/domain/hosts/fleet-scopes.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"638cca90635ddcf2f17e7d247fb81f4dc8001f8fa7acf04e674c76b2b4f57f3c"}},{"ruleId":"D1","level":"warning","message":{"text":"SeatLifecycleService.continueStartupUnchecked (cyclomatic 22): SeatLifecycleService.continueStartupUnchecked 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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":1389}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1cc576a199e39c4505c94ce37140f427f16c2195bb7fcf7feb861980583023"}},{"ruleId":"D1","level":"warning","message":{"text":"SeatLifecycleService.planFresh (cyclomatic 22): SeatLifecycleService.planFresh has cyclomatic complexity 22 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 3 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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":1569}}}],"partialFingerprints":{"codehealthFindingId/v1":"d272a0348ebae86a95161a87ae4ce44e35e69e26a6db526f77bde5dda7baaabd"}},{"ruleId":"D1","level":"warning","message":{"text":"claude-token-usage.claudeTokenUsageReader.\u003Creturned closure\u003E (cyclomatic 22): claude-token-usage.claudeTokenUsageReader.\u003Creturned closure\u003E 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/daemon/src/domain/provider/claude-token-usage.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e29b36cfd8b96dc6cce58f13473d874ec6450f736d152839a765fe27151987"}},{"ruleId":"D1","level":"warning","message":{"text":"claude-seat-switch.checkClaudeSeat (cyclomatic 22): claude-seat-switch.checkClaudeSeat 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, 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/daemon/src/domain/provider/claude-seat-switch.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba8d1f8b96af046b680a64bdf1c609ea1e125b9382529100667eb2b7bd51063"}},{"ruleId":"D1","level":"warning","message":{"text":"RestoreCheckService.validateHostInfraDeclaration (cyclomatic 22): RestoreCheckService.validateHostInfraDeclaration has cyclomatic complexity 22 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 5 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/daemon/src/domain/restore-check-service.ts"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab5d977f5055657ad36e32fb2afbb93f1e6d2389498c3bb626ab01ef8a0b64c"}},{"ruleId":"D1","level":"warning","message":{"text":"RigLifecycleService.unclaimSession (cyclomatic 22): RigLifecycleService.unclaimSession has cyclomatic complexity 22 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 6 belong to 3 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/daemon/src/domain/rig-lifecycle-service.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"381e79012693bebea3be1c67786202870d9671f537df2e4fe5c4e09e63478a24"}},{"ruleId":"D1","level":"warning","message":{"text":"RigSpecExporter.memberStartupSource (cyclomatic 22): RigSpecExporter.memberStartupSource has cyclomatic complexity 22 (threshold 15). 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, 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/daemon/src/domain/rigspec-exporter.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca215b021eba8b9d72771ce2dee497f71c4d8668cd2a18f4bfc319ca3db57c18"}},{"ruleId":"D1","level":"warning","message":{"text":"TerminalService.followView (cyclomatic 22): TerminalService.followView 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/daemon/src/domain/terminal/terminal-service.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"d40e0b1eda9dd9348c2a7f4a3223f31d603c87fba32c33793a99687a7c84ff33"}},{"ruleId":"D1","level":"warning","message":{"text":"TerminalService.openView (cyclomatic 22): TerminalService.openView 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/daemon/src/domain/terminal/terminal-service.ts"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3befdec98256d7e890d0f6b5076e9afcd0960700f35ca778928e9932b91764b"}},{"ruleId":"D1","level":"warning","message":{"text":"TerminalService.resolveView (cyclomatic 22): TerminalService.resolveView 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/daemon/src/domain/terminal/terminal-service.ts"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d37fd1bf49d6cbf5dced63bfc003a940a8ca76b2d8177a509c3efe736d7072"}},{"ruleId":"D1","level":"warning","message":{"text":"watchdog-delivery.makeWatchdogDeliver::deliver (cyclomatic 22): watchdog-delivery.makeWatchdogDeliver::deliver 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/daemon/src/domain/watchdog-delivery.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"01255b0546802ae53f3090ee61fc978d3a68922e6035d1be283035407ba8ce8e"}},{"ruleId":"D1","level":"warning","message":{"text":"events.eventsRoute.get(\u0022/\u0022) (cyclomatic 22): events.eventsRoute.get(\u0022/\u0022) 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 2 function literals inside it that branch (lines 32, 39). 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/daemon/src/routes/events.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2a309894508c14c808026f7567537cbb5ab4a889cf625ebb3e8e0ccb9b87a3d"}},{"ruleId":"D1","level":"warning","message":{"text":"packages.packagesRoutes.post(\u0022/install\u0022) (cyclomatic 22): packages.packagesRoutes.post(\u0022/install\u0022) 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/daemon/src/routes/packages.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4a42682965e5f8eba6f90f9e69cc7f62fd0e709b9d84f6df168ed570b0512c"}},{"ruleId":"D1","level":"warning","message":{"text":"transcripts.transcriptRoutes (cyclomatic 22): transcripts.transcriptRoutes 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 158, 207, 274). 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/daemon/src/routes/transcripts.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"7966fb26b306fad5adf8cebd245a1fd1745dcb5139ff413d1a102eee0efeb708"}},{"ruleId":"D1","level":"warning","message":{"text":"hosts.hostsRoutes::settlePairRequest (cyclomatic 22): hosts.hostsRoutes::settlePairRequest 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/daemon/src/routes/hosts.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"57636d778fee1c2e3b98e36c0e6b8defc3c50c578ce36ceec59664d1a3572d26"}},{"ruleId":"D1","level":"warning","message":{"text":"execution-model.executionSliceStripLines (cyclomatic 22): execution-model.executionSliceStripLines 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/tui/src/execution/execution-model.ts"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0409d8cad4a2a11b0310b0f3a99dbe406390b33e2075f39ac858ead636e047b"}},{"ruleId":"D1","level":"warning","message":{"text":"reading.fileLines (cyclomatic 22): reading.fileLines has cyclomatic complexity 22 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 10 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/tui/src/reading.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"534f5746075ec2c1f5a6aa228eff6d03e10867c356c1b4f851b58242cbf30a95"}},{"ruleId":"D1","level":"warning","message":{"text":"live-events.subscribeActivityEvents.connect (cyclomatic 22): live-events.subscribeActivityEvents.connect has cyclomatic complexity 22 (threshold 15). Of this number, 15 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/tui/src/live-events.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5a600870a23c1f5dfd1fe5b51b55ee6560e93ecd970589ab169c0b2efbac2b"}},{"ruleId":"D1","level":"warning","message":{"text":"useActivityFeed.useActivityFeed (cyclomatic 22): useActivityFeed.useActivityFeed 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 one function literal inside it that branches (line 32). 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/ui/src/hooks/useActivityFeed.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"bffcedb99e5c1e1a9b9649d02749b7a05f53b3de47df0a56e05e3abbd7903983"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionPreviewPane.SessionPreviewPane (cyclomatic 22): SessionPreviewPane.SessionPreviewPane has cyclomatic complexity 22 (threshold 15). 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, 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/ui/src/components/preview/SessionPreviewPane.tsx"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b721342acabd6040cf29f7b3d260291d9b1564268e8b77049288a766acc663"}},{"ruleId":"D1","level":"warning","message":{"text":"EvidenceOpener.EvidenceOpener (cyclomatic 22): EvidenceOpener.EvidenceOpener 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/ui/src/components/review/EvidenceOpener.tsx"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fbcd5d68d34269b52ac27438ab20fa8de8ad713b9a5759f80c0dc81704c038b"}},{"ruleId":"D1","level":"warning","message":{"text":"migrate-telemetry-state-0.5.9.readLibraryConfig (cyclomatic 22): migrate-telemetry-state-0.5.9.readLibraryConfig 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. This is NOT this file\u0027s highest cyclomatic complexity: migrate-telemetry-state-0.5.9.verificationReceipt (cyclomatic 26) 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":"skills/_canonical/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ce95e5a29e8b39117174b43f9dfdae9d0d83de9fbbba03565bf97d62b54d19"}},{"ruleId":"D1","level":"warning","message":{"text":"rig-repository.isStoredServices (cyclomatic 21): rig-repository.isStoredServices has cyclomatic complexity 21 (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/daemon/src/domain/rig-repository.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e32601cb5176d67280d54ddb3b88da213d192f152a54fc36d5cdcaa8897262"}},{"ruleId":"D1","level":"warning","message":{"text":"skill-catalog.scanCatalog (cyclomatic 21): skill-catalog.scanCatalog has cyclomatic complexity 21 (threshold 15). Of this number, 14 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/daemon/src/domain/skill-catalog.ts"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d91142a6253e2a1937a03f3c84cc9801acc2086e8cea1f1ba23120359489cda"}},{"ruleId":"D1","level":"warning","message":{"text":"InboundRouter.retryOwnDeadLetters (cyclomatic 21): InboundRouter.retryOwnDeadLetters 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/daemon/src/domain/gateway/slack/inbound.ts"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"4854d16b2615582716b4051584a5b9dd8a4fbf00ae35c6bc94ab3605c5ab4819"}},{"ruleId":"D1","level":"warning","message":{"text":"relay-config.evaluateRelayCandidate (cyclomatic 21): relay-config.evaluateRelayCandidate 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/daemon/src/domain/gateway/relay-config.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b701cc74779f860b75e2233a03d9fcfdab203c6def84d3d6bd3caa354ae13af"}},{"ruleId":"D1","level":"warning","message":{"text":"project-catalog.inferCatalogProject (cyclomatic 21): project-catalog.inferCatalogProject 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":"packages/daemon/src/domain/workspace/project-catalog.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c95b348f1094ceb2ec6e5663b76e8d55b3d1e5661038ba26ea664ae423a22c7"}},{"ruleId":"D1","level":"warning","message":{"text":"SeatActivityService.pollAllRunningTmuxSeats (cyclomatic 21): SeatActivityService.pollAllRunningTmuxSeats 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, separate the cases: extract each independent branch into its own 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/daemon/src/domain/seat-activity-service.ts"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c48108efa730a2603faa3a429c23c9a833b8269a97cb8d8a5ef17209fa7c562"}},{"ruleId":"D1","level":"warning","message":{"text":"community-harness-presets.communityHarnessLabel (cyclomatic 21): community-harness-presets.communityHarnessLabel 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/daemon/src/domain/community-harness-presets.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c67dd6ce0177a27a9d40edfe35e11a6f39e793a4d2669d521656618e00b0d4"}},{"ruleId":"D1","level":"warning","message":{"text":"node-inventory.computeRecoveryGuidance (cyclomatic 21): node-inventory.computeRecoveryGuidance 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/daemon/src/domain/node-inventory.ts"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f5319e8c398536fbe46e5826a8cba0ed505c4c1e2707cee7ebb95924dc85cb"}},{"ruleId":"D1","level":"warning","message":{"text":"node-inventory.getNodeDetail (cyclomatic 21): node-inventory.getNodeDetail has cyclomatic complexity 21 (threshold 15). Of this number, 19 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":"packages/daemon/src/domain/node-inventory.ts"},"region":{"startLine":1271}}}],"partialFingerprints":{"codehealthFindingId/v1":"649750cade0e797fc79a54f71174ce82950e27dfa0a2b81b8dc41e1ba84e30a6"}},{"ruleId":"D1","level":"warning","message":{"text":"queue-stuck-sweep.runStuckSweep::unclaimedCandidate (cyclomatic 21): queue-stuck-sweep.runStuckSweep::unclaimedCandidate 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. This shape REPEATS in the file: 4 other methods here (queue-stuck-sweep.runStuckSweep, queue-stuck-sweep.runStuckSweep::undeliveredCandidate, queue-stuck-sweep.runStuckSweep::custodyCandidate, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 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/daemon/src/domain/queue-stuck-sweep.ts"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d553ba5867f5413400f079c6a0317d104fdb8297efd1b95579ba33ff27b554"}},{"ruleId":"D1","level":"warning","message":{"text":"queue-wake-ladder.ensureEscalationRow (cyclomatic 21): queue-wake-ladder.ensureEscalationRow 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/daemon/src/domain/queue-wake-ladder.ts"},"region":{"startLine":1863}}}],"partialFingerprints":{"codehealthFindingId/v1":"c848a927452bc851a963e2f96362672b0f2f9fcdbb433240d69301c5e14c6a08"}},{"ruleId":"D1","level":"warning","message":{"text":"QueueRepository.performWakeSend (cyclomatic 21): QueueRepository.performWakeSend 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":2207}}}],"partialFingerprints":{"codehealthFindingId/v1":"f905caf526b6ca53b55f500be205a9b3183b9cda77730c28e207429e261b2abd"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionTransport.preWaitForIdle (cyclomatic 21): SessionTransport.preWaitForIdle 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":3309}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9e64f2a5d00dff3cb37518e484fcb9c8c7656794234b2d5908a1d8aa676cf3"}},{"ruleId":"D1","level":"warning","message":{"text":"queue-receipt.buildWriteReceipt (cyclomatic 21): queue-receipt.buildWriteReceipt has cyclomatic complexity 21 (threshold 15). 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, separate the cases: extract each independent branch into its own 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/queue-receipt.ts"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e1446df740d6e7e5b497bc6893434253281ecf270fbac2af71aa852d2bdfbf"}},{"ruleId":"D1","level":"warning","message":{"text":"bundle-source.checkGitHubBundleRefs (cyclomatic 21): bundle-source.checkGitHubBundleRefs has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 9 of the 21 points are its own statements and the rest belongs to 3 function items inside it that branch (agent, contained, a function literal at line 133). 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/lib/bundle-source.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ccd386cfa7cb58de0c20cf347dd8d2f9bda2eac394019d7fa84ad081d470cf0"}},{"ruleId":"D1","level":"warning","message":{"text":"capture.runCrossHostCapture (cyclomatic 21): capture.runCrossHostCapture 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/cli/src/commands/capture.ts"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcdf57ebf370836e8cef9dcb22af1a709b33584540113a5eb55117b4d01bd370"}},{"ruleId":"D1","level":"warning","message":{"text":"scope-fs.updateMappedFrontmatter (cyclomatic 21): scope-fs.updateMappedFrontmatter 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":"packages/cli/src/lib/scope/scope-fs.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2457ba2bce73f6a1d9c6d18f9facf7c98c6fb0a76e2a7ccae3f3f94dda48c15"}},{"ruleId":"D1","level":"warning","message":{"text":"work-install.resolveWorkProject (cyclomatic 21): work-install.resolveWorkProject 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/lib/work-install.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd146308024d18c425b1e36bde3bfe0c56e78912d73341ca652588f2d288b862"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp-server.requestsAdvisoryFor (cyclomatic 21): mcp-server.requestsAdvisoryFor 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":"packages/cli/src/mcp-server.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dab7c084859ba481512ea48461506af58fa1f879613debb78f983046a70656b"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp-http.startMcpHttpServer.handle (cyclomatic 21): mcp-http.startMcpHttpServer.handle 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/mcp-http.ts"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b8d9d3c10b6fad115335d9981edeccebecf80361c473fdd74f2ba11afa9b990"}},{"ruleId":"D1","level":"warning","message":{"text":"network.networkCommand (cyclomatic 21): network.networkCommand has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to 9 function items inside it that branch (a function literal at line 122, finish, a function literal at line 100, \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/commands/network.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"86bb2cc147033608ad63f1749ff6e12f73f549128f390c1fff2e928e090d1a68"}},{"ruleId":"D1","level":"warning","message":{"text":"DecisionRun.decide (cyclomatic 21): DecisionRun.decide 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/cli/src/decisions/decisions.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89920e1ed2f3748414ed7aacc249c19b0d9c9409169cee693c2b32dedbf0b98"}},{"ruleId":"D1","level":"warning","message":{"text":"stream-consumer.toDisposition (cyclomatic 21): stream-consumer.toDisposition 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/decisions/stream-consumer.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f30be842723bea7c7190c67913cd955999a80c9133197d76cd79e620cb85f3"}},{"ruleId":"D1","level":"warning","message":{"text":"shrink.shrinkCommand (cyclomatic 21): shrink.shrinkCommand has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to 2 function items inside it that branch (a function literal at line 44, getClient). 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/commands/shrink.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"38576d9cddca2f7f2f8976a52f0af9328619dc44be596cffd2126c08531bef7c"}},{"ruleId":"D1","level":"warning","message":{"text":"stream-outcome.streamOutcome (cyclomatic 21): stream-outcome.streamOutcome 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":"packages/cli/src/commands/stream-outcome.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d3baeac1276c79af4acbe0ab0d10cbceb7bfd86e5bb45e7e5d7cf5aef57458"}},{"ruleId":"D1","level":"warning","message":{"text":"workflow-render.composeAttentionRollup (cyclomatic 21): workflow-render.composeAttentionRollup 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/commands/workflow-render.ts"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8d0d5d62dac6108dccf42c6ac0cf7c94641ea419e23142136446acb4681539"}},{"ruleId":"D1","level":"warning","message":{"text":"activity-relay.buildOpenRigPayload (cyclomatic 21): activity-relay.buildOpenRigPayload 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/daemon/assets/plugins/openrig-core/hooks/scripts/activity-relay.cjs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"576af75227987048461af9290793c7c55babebbc4e1a20c3772e716fb03f9e07"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeCodeAdapter.launchHarness::sendClassic (cyclomatic 21): ClaudeCodeAdapter.launchHarness::sendClassic 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. This shape REPEATS in the file: one other method here (ClaudeCodeAdapter.launchHarness) 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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9152e907396ec061d5d129d3cf5f611cc712f54db5181bebbe0c7d5a18172d"}},{"ruleId":"D1","level":"warning","message":{"text":"CodexRuntimeAdapter.dismissSkippableCodexUpdatePrompt (cyclomatic 21): CodexRuntimeAdapter.dismissSkippableCodexUpdatePrompt 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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":1387}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dfeee27529e796932ef5e7d5696bb838a962cdf659d4ed1bb9a4de7dcec8a22"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-runtime-adapter.upsertManagedCodexConfigFragment (cyclomatic 21): codex-runtime-adapter.upsertManagedCodexConfigFragment has cyclomatic complexity 21 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 7 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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":2906}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e24641a4b30200ae519d8996f61c8e5ca19ae169c3df791e01bc4878281517"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerCore.finishManagedWake (cyclomatic 21): RunnerCore.finishManagedWake 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b40a6b743d13a5fe3fed06dbc0e7f200f17e6b14dd3a2a4dacce16a9ae18d39"}},{"ruleId":"D1","level":"warning","message":{"text":"pi-runner.connectPiRunnerChannel (cyclomatic 21): pi-runner.connectPiRunnerChannel 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":2185}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e02fd58e5e989b50253ad0b6ceea19c4eeef23f98fb86a28b1cf7a1ef673664"}},{"ruleId":"D1","level":"warning","message":{"text":"bundle-types.serializePodBundleManifest (cyclomatic 21): bundle-types.serializePodBundleManifest 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/daemon/src/domain/bundle-types.ts"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"724e93dbee88dac20f2e72f77acb9b189329b3ea4d747b67218a6cac4dca106e"}},{"ruleId":"D1","level":"warning","message":{"text":"current-work.deriveRole (cyclomatic 21): current-work.deriveRole has cyclomatic complexity 21 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 6 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/daemon/src/domain/current-work.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"de70c4cfcb433e182f53247ee3504e107e5e2a70ba38da7c76f9c8f271c31825"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkflowInstanceStore.create (cyclomatic 21): WorkflowInstanceStore.create 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/daemon/src/domain/workflow-instance-store.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e7e43fdbffdad0e36f0580b8a940f6ef30c381ed5f73338d2e33a68b13ff33"}},{"ruleId":"D1","level":"warning","message":{"text":"SeatAttentionReconciler.getDerivedAttentionOutcome (cyclomatic 21): SeatAttentionReconciler.getDerivedAttentionOutcome 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/daemon/src/domain/seat-attention-reconciler.ts"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1854b08ff51dbe48156e387e800c452e31c13ecf848d6d27578f0749a0f3ef1"}},{"ruleId":"D1","level":"warning","message":{"text":"RestoreOrchestrator.stopAutomaticOccupant (cyclomatic 21): RestoreOrchestrator.stopAutomaticOccupant has cyclomatic complexity 21 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 9 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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"098bc6897bd51920efccde0234a168805d3fb4261c44ef93dc17b3bf3c2ef81a"}},{"ruleId":"D1","level":"warning","message":{"text":"fleet-scopes.remoteCounts (cyclomatic 21): fleet-scopes.remoteCounts 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/daemon/src/domain/hosts/fleet-scopes.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"146a6012f66cee1700a1d6d2a9c70fca93738214530ebaf64a5eaf3bf74b9ce8"}},{"ruleId":"D1","level":"warning","message":{"text":"parked-query.diagnoseSeatParked (cyclomatic 21): parked-query.diagnoseSeatParked has cyclomatic complexity 21 (threshold 15). Of this number, 16 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/daemon/src/domain/parked-query.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb959a1d76961c3ffe9eb2caab6748edf2a8321e09568222f46028a2ee72b38"}},{"ruleId":"D1","level":"warning","message":{"text":"PiCompactionService.attemptState (cyclomatic 21): PiCompactionService.attemptState 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/daemon/src/domain/pi-compaction-service.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea08757a86e4fe6ef14e656d5693a712eb708e65673a1f5504d004773d7e2d8"}},{"ruleId":"D1","level":"warning","message":{"text":"SeatHandoverService.deliverRebuildPrimingPacket (cyclomatic 21): SeatHandoverService.deliverRebuildPrimingPacket 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/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":1607}}}],"partialFingerprints":{"codehealthFindingId/v1":"62db1c7bd4512cd89d8ca0360ad108615cc5d1f5e86cc1ac7ac2aca5fd40fad0"}},{"ruleId":"D1","level":"warning","message":{"text":"ProgressIndexer.parseProgressFile (cyclomatic 21): ProgressIndexer.parseProgressFile 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/daemon/src/domain/progress/progress-indexer.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b500ea91ccb8f3e2038815d10e5f6868c95858844214701b823726c56bd3c6"}},{"ruleId":"D1","level":"warning","message":{"text":"require-sender-identity.parseIdentityPrincipal (cyclomatic 21): require-sender-identity.parseIdentityPrincipal 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, 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/daemon/src/routes/require-sender-identity.ts"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e2e394aa9fc6ec8c47918ea2f0d302d7420745d2994b74542a0146d4a44b55"}},{"ruleId":"D1","level":"warning","message":{"text":"source-watch.shallowWatches (cyclomatic 21): source-watch.shallowWatches has cyclomatic complexity 21 (threshold 15). Of this number, 18 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/daemon/src/domain/proof/source-watch.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"099a757c01051e34d2294aa178cf404a42b0bf43540dd80e10614295d744045c"}},{"ruleId":"D1","level":"warning","message":{"text":"SeatLifecycleService.setEffort (cyclomatic 21): SeatLifecycleService.setEffort 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, separate the cases: extract each independent branch into its own 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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3bb921cc00032d885b51fcc82921f27098758ab734f1bd794cd0540e2fc184e"}},{"ruleId":"D1","level":"warning","message":{"text":"rig-edge-ops.addRigEdge (cyclomatic 21): rig-edge-ops.addRigEdge has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 2 of the 21 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 114, 128). 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/daemon/src/domain/rig-edge-ops.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e422b45defa0bac0b0a5f0544b232706647a539c7393c0471cf2974ce334aae"}},{"ruleId":"D1","level":"warning","message":{"text":"RigTeardownOrchestrator.recordAlreadyStoppedIntent (cyclomatic 21): RigTeardownOrchestrator.recordAlreadyStoppedIntent has cyclomatic complexity 21 (threshold 15). Of this number, 18 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/daemon/src/domain/rig-teardown.ts"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d8ef6a162826e81b2395143982b4bcb4d330f0ec4288284e75fea7ff8c99d4"}},{"ruleId":"D1","level":"warning","message":{"text":"RexAgentStatusRelay.reportNow (cyclomatic 21): RexAgentStatusRelay.reportNow has cyclomatic complexity 21 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 6 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/daemon/src/domain/terminal/rex-agent-status.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d4d2db17f37734d1dd5da194d9c66b72e7bfb8a93feb8518abfdf558914fed"}},{"ruleId":"D1","level":"warning","message":{"text":"workflow-boot-sweep.runWorkflowBootSweep (cyclomatic 21): workflow-boot-sweep.runWorkflowBootSweep 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/daemon/src/domain/workflow-boot-sweep.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"38fa2cfb1da99e4bbf25fcaf4fd2337a3e38e94733fa890859c557066f262e8b"}},{"ruleId":"D1","level":"warning","message":{"text":"rigspec.rigspecImportRoutes.post(\u0022/materialize\u0022) (cyclomatic 21): rigspec.rigspecImportRoutes.post(\u0022/materialize\u0022) 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/daemon/src/routes/rigspec.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77ce198ebced9d7ddb379cefb874ec006559bd9bc5cb50990e0ac70a92ebc6b"}},{"ruleId":"D1","level":"warning","message":{"text":"seat.seatRoutes.get(\u0022/status/:seatRef\u0022) (cyclomatic 21): seat.seatRoutes.get(\u0022/status/:seatRef\u0022) 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. This is NOT this file\u0027s highest cyclomatic complexity: seat.seatLifecycleStatus (cyclomatic 31) 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/daemon/src/routes/seat.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"43948950c5d52b6a648227820e9b52bdd233a6a9da70903d30d3132bff573640"}},{"ruleId":"D1","level":"warning","message":{"text":"views.viewsRoutes (cyclomatic 21): views.viewsRoutes has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to 5 function items inside it that branch (a function literal at line 113, errorResponse, a function literal at line 42, \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/daemon/src/routes/views.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"e293c92856285cefb85a70abf3c44811dbe25db4bdd2d10cfe4aa7b5b5248b66"}},{"ruleId":"D1","level":"warning","message":{"text":"watchdog.watchdogRoutes::errorResponse (cyclomatic 21): watchdog.watchdogRoutes::errorResponse 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/daemon/src/routes/watchdog.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa7a2a930b097bace14ff52d4fe023f8ebde9dfd7181fa43f9b60c50fdf723b"}},{"ruleId":"D1","level":"warning","message":{"text":"proof.proofRoutes::target (cyclomatic 21): proof.proofRoutes::target 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/daemon/src/routes/proof.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"607d73e408e27559f62e4d85ac390cc8058c00b39e6b22eacc1626f10df1c552"}},{"ruleId":"D1","level":"warning","message":{"text":"scope-approve.scopeApproveRoutes (cyclomatic 21): scope-approve.scopeApproveRoutes has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 15, 51). 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/daemon/src/routes/scope-approve.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b45bd131790c6c1ce9327245317050e581831db51ac914bafa5c736e9d5ab0"}},{"ruleId":"D1","level":"warning","message":{"text":"pairing.decideOnce (cyclomatic 21): pairing.decideOnce has cyclomatic complexity 21 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/tui/src/config/pairing.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ac5e90b7a8e4f9acaf9365967221b7f769a6f4671e4327dd634ee6dbca264dc"}},{"ruleId":"D1","level":"warning","message":{"text":"state.locationKey (cyclomatic 21): state.locationKey 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":"packages/tui/src/state.ts"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"857149e79a685f76f3998ee57fa3d15bf310ffcc6f31a5f637bf562eb81ecef7"}},{"ruleId":"D1","level":"warning","message":{"text":"input.resolveKeyAction (cyclomatic 21): input.resolveKeyAction 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/tui/src/input.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"cadb3d24a61c6d0f252b4baf4a1b81307d38042417c2d7130034bbdf8337cbe2"}},{"ruleId":"D1","level":"warning","message":{"text":"SyntaxHighlight.tokenizeWithKeywordsAndComments (cyclomatic 21): SyntaxHighlight.tokenizeWithKeywordsAndComments 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/ui/src/components/markdown/SyntaxHighlight.tsx"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"f80de9a180e2be7bb4d55139ad7469f26b4eeb8ebb67f7528a60db32f1d9541d"}},{"ruleId":"D1","level":"warning","message":{"text":"waiter (cyclomatic 21): waiter 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/daemon/assets/claude-hook-bridge.cjs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d28254148462d5c2b7491127a0dd507779d1bdc25bb90d3affa59d84a9830be"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 21): (anonymous) 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/daemon/assets/claude-statusline-context.cjs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c6e93f8c046ab3d534c816da4f5d1f4a42cf24a26c24915a1da24624cd563ff"}},{"ruleId":"D1","level":"warning","message":{"text":"input-read-diagnostic.inputReadDiagnostic (cyclomatic 20): input-read-diagnostic.inputReadDiagnostic 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/daemon/src/domain/input-read-diagnostic.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"037a31e06be88df7b2c41905e828d5ffca018a7df51bee6cfd57694dace31f88"}},{"ruleId":"D1","level":"warning","message":{"text":"community-harness-launch-result.readLaunchResult (cyclomatic 20): community-harness-launch-result.readLaunchResult 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/daemon/src/domain/community-harness-launch-result.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"092e5d7b782d5194dba9ca77bc24355aa2bd345b0f901fcfaf0c648fb55e2710"}},{"ruleId":"D1","level":"warning","message":{"text":"agent-activity-store.hookEventState (cyclomatic 20): agent-activity-store.hookEventState 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/daemon/src/domain/agent-activity-store.ts"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"f174638211b7a80d1b12f90a716906619130894c43439393c9c261ac51b1a2a8"}},{"ruleId":"D1","level":"warning","message":{"text":"native-process-arguments.readNativeProcessArguments (cyclomatic 20): native-process-arguments.readNativeProcessArguments 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, separate the cases: extract each independent branch into its own 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/daemon/src/domain/native-process-arguments.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68c46df84c99f1f9c8da1296e9e5f26b3ae5dae8fb6ac21f3ed106b8cdb6560"}},{"ruleId":"D1","level":"warning","message":{"text":"OutboxHandler.retain (cyclomatic 20): OutboxHandler.retain has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to one function literal inside it that branches (line 462). 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/daemon/src/domain/outbox-handler.ts"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b6763263dbfd61a57c77a105fa0b02755ff01fc39d543bf0c83646de2e9630"}},{"ruleId":"D1","level":"warning","message":{"text":"rig-repository.isStoredSessionSource (cyclomatic 20): rig-repository.isStoredSessionSource 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/daemon/src/domain/rig-repository.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"80114b67983a51db12078fb8171cdccb94626680b1b3252597285da19709f6b7"}},{"ruleId":"D1","level":"warning","message":{"text":"skill-catalog.resolvePluginSkills (cyclomatic 20): skill-catalog.resolvePluginSkills 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/daemon/src/domain/skill-catalog.ts"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4fc5537dc9b150ba5da760014d5fc05869b766a83950bb1a9613aa1b8ed7a2"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeManagedLaunch.credentialPrecedence (cyclomatic 20): ClaudeManagedLaunch.credentialPrecedence has cyclomatic complexity 20 (threshold 15). Of this number, 19 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/daemon/src/domain/claude-managed-launch.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"411a3b573ce68607b461af5cf0306f0242fc0c57823206510b73169970da09ba"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeResumeAdapter.resume::sendClassic (cyclomatic 20): ClaudeResumeAdapter.resume::sendClassic 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. This shape REPEATS in the file: one other method here (ClaudeResumeAdapter.resume) 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/daemon/src/adapters/claude-resume.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a09870b44bd9fd93d7f813b1fd134231a3c1ebd1306200bc7197368ebd8aea8"}},{"ruleId":"D1","level":"warning","message":{"text":"tmux-server-selection.readRecord (cyclomatic 20): tmux-server-selection.readRecord 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/daemon/src/domain/tmux-server-selection.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c0b085259f71b5df184de16fb896c979f0a952f1ee8faaec63f6f83b9a5c946"}},{"ruleId":"D1","level":"warning","message":{"text":"ThreadCoverageStore.read (cyclomatic 20): ThreadCoverageStore.read 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/daemon/src/domain/gateway/slack/state-store.ts"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa8b3192b1b5fe9f349c268e60f5fb3eac942f079a11899831c8b36e7898d97"}},{"ruleId":"D1","level":"warning","message":{"text":"inbound.ingestDecision (cyclomatic 20): inbound.ingestDecision 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/daemon/src/domain/gateway/slack/inbound.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b9964281c2cb2a8960adb540994208ff595e7ccd5b29b1f1c4e443fbbe8277d"}},{"ruleId":"D1","level":"warning","message":{"text":"compose.composeDelivered.items (cyclomatic 20): compose.composeDelivered.items has cyclomatic complexity 20 (threshold 15). Of this number, 16 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":"packages/daemon/src/domain/review/compose.ts"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"df30623f77352b99b1bb4243d5c221a05d51e0ec07ea13b2109abefc1b55d4d1"}},{"ruleId":"D1","level":"warning","message":{"text":"lifecycle-manifest.validateMissionComposition (cyclomatic 20): lifecycle-manifest.validateMissionComposition has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 6 of the 20 points are its own statements and the rest belongs to one function literal inside it that branches (line 45). 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/daemon/src/domain/lifecycle-manifest.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"c443f696ad69bf919753348db539ec7872d8882531a27fdd13554d0526912ad9"}},{"ruleId":"D1","level":"warning","message":{"text":"queue-stuck-sweep.runStuckSweep::custodyCandidate (cyclomatic 20): queue-stuck-sweep.runStuckSweep::custodyCandidate 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. This shape REPEATS in the file: 4 other methods here (queue-stuck-sweep.runStuckSweep, queue-stuck-sweep.runStuckSweep::undeliveredCandidate, queue-stuck-sweep.runStuckSweep::unclaimedCandidate, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 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/daemon/src/domain/queue-stuck-sweep.ts"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c07016ce172e768b42a4068bbf49681075f81af0d158a5bbb14fc486e4cfef"}},{"ruleId":"D1","level":"warning","message":{"text":"QueueRepository.fallbackLineStart (cyclomatic 20): QueueRepository.fallbackLineStart has cyclomatic complexity 20 (threshold 15). Of this number, 17 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":5977}}}],"partialFingerprints":{"codehealthFindingId/v1":"5127afeac79d0559ee7f691a10995e27e513a0b361133d14121f419ab2744b0a"}},{"ruleId":"D1","level":"warning","message":{"text":"session-transport.readInputBox (cyclomatic 20): session-transport.readInputBox 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. This is NOT this file\u0027s highest cyclomatic complexity: session-transport.bridgeable (cyclomatic 21) 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":1981}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab77a485580247e23b35d838f98d927f288af426b60af8bd7535f5549c6b0190"}},{"ruleId":"D1","level":"warning","message":{"text":"atomic-text-write.writeTextAtomically (cyclomatic 20): atomic-text-write.writeTextAtomically 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/atomic-text-write.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aec36d0db90fceadb3633e0b74b836da2f74132ffbc15800b3e7297f5279e83"}},{"ruleId":"D1","level":"warning","message":{"text":"broadcast.renderBroadcastResults (cyclomatic 20): broadcast.renderBroadcastResults 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/commands/broadcast.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"70ddce89aa8cb409fb5062d42dcc878bb23ce4b3476bf640abda974eaa404ea6"}},{"ruleId":"D1","level":"warning","message":{"text":"capture.captureCommand (cyclomatic 20): capture.captureCommand has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to one function literal inside it that branches (line 222). 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/commands/capture.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2a79e8e82a0eeab607efddf31bc112edc3e3f6b36128f89c731e5a084bc09f"}},{"ruleId":"D1","level":"warning","message":{"text":"reconstruction-reader.parseReconstructionJson (cyclomatic 20): reconstruction-reader.parseReconstructionJson has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 3 of the 20 points are its own statements and the rest belongs to 3 function items inside it that branch (value, quoted, space). 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/lib/reconstruction-reader.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4c927ad7a2faeff1ff67b7a530639e1bf930b923c70492ae83c71fdb133e349"}},{"ruleId":"D1","level":"warning","message":{"text":"recap-seat.resolveRecapSeat (cyclomatic 20): recap-seat.resolveRecapSeat 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/recap-seat.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d3c41d402c3d869d5a4bf9d5c86dc49f1142521300c05fd8bc7a9893557e46c"}},{"ruleId":"D1","level":"warning","message":{"text":"destroy-helpers.executeDestroy (cyclomatic 20): destroy-helpers.executeDestroy 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/destroy-helpers.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f92cb2160dd67a8e408ab793a9aa49840da1c6095d31a645ce69914035e80c"}},{"ruleId":"D1","level":"warning","message":{"text":"gateway.daemonHumanReadiness (cyclomatic 20): gateway.daemonHumanReadiness 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/cli/src/commands/gateway.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"185f29757c196d23502d2aea35c5ad24c14558c2d15b0d1d1d2a2c2069c6af2c"}},{"ruleId":"D1","level":"warning","message":{"text":"provider.providerCommand::renderAcrossHosts (cyclomatic 20): provider.providerCommand::renderAcrossHosts 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. This shape REPEATS in the file: 4 other methods here (provider.providerCommand::renderStatusHuman, provider.providerCommand::renderSeatAccounts, provider.providerCommand::renderUsageRow, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 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/commands/provider.ts"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c996383af98e8646393da1ff9ddf6384c836480b2b672700517307db13f322"}},{"ruleId":"D1","level":"warning","message":{"text":"seat.runSeatHandover (cyclomatic 20): seat.runSeatHandover 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/cli/src/commands/seat.ts"},"region":{"startLine":1843}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3bfcf12771639d9ace4df434793be4f32a053296ec0c5cc24a09a5a7d3b6688"}},{"ruleId":"D1","level":"warning","message":{"text":"terminal-window.defaultWindowDeps.columns (cyclomatic 20): terminal-window.defaultWindowDeps.columns has cyclomatic complexity 20 (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/terminal-window.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c6b28935be113462c2a56a1199a85add78c5c1f1389ebc32a75bac82ed404c"}},{"ruleId":"D1","level":"warning","message":{"text":"front-door.openMissionControl (cyclomatic 20): front-door.openMissionControl 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/cli/src/front-door.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c286b6086bb6f4e4c601475082e2e1b1e7dda1886bbd35ae5f22757bf14cbca"}},{"ruleId":"D1","level":"warning","message":{"text":"activity-relay.wallClockReset (cyclomatic 20): activity-relay.wallClockReset 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/daemon/assets/plugins/openrig-core/hooks/scripts/activity-relay.cjs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"318682f456acf194b64f9ca9ca3b1357f2f6604837d1a4b2034b861a2a8e55df"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeCodeAdapter.provisionManagedBootstrap (cyclomatic 20): ClaudeCodeAdapter.provisionManagedBootstrap 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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":1144}}}],"partialFingerprints":{"codehealthFindingId/v1":"e33c231aae48c0565256d3f1afcc46552f8aec166b4474b11905c2f442f7f2da"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-filesystem-preflight.compareRequirements (cyclomatic 20): codex-filesystem-preflight.compareRequirements 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/daemon/src/domain/codex-filesystem-preflight.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a9dc684df18c3a37c4eedfe9831df630e6d17b3d52f03cddf72b6d542e89f8"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-core-plugin-install.codexCorePluginEnablement (cyclomatic 20): codex-core-plugin-install.codexCorePluginEnablement 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/daemon/src/domain/codex-core-plugin-install.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1173e3e6eead7dfb9bb8d5daa29ef0711ca8c669bd1a3f2f4b1d4fb1061b64f"}},{"ruleId":"D1","level":"warning","message":{"text":"workflow-projector.readAlreadyClosedRecord (cyclomatic 20): workflow-projector.readAlreadyClosedRecord has cyclomatic complexity 20 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 4 belong to 3 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/daemon/src/domain/workflow-projector.ts"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4a8cae5d4d87c1d28ec5bb2e46dd8f3af63059b179d114897ce6b9a7e3ff8b"}},{"ruleId":"D1","level":"warning","message":{"text":"MissionControlWriteContract.resolveParked (cyclomatic 20): MissionControlWriteContract.resolveParked has cyclomatic complexity 20 (threshold 15). 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: 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/daemon/src/domain/mission-control/mission-control-write-contract.ts"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"1892f629d1583609eb153f6fc00f8d4160af17993158f727a65397d44922d827"}},{"ruleId":"D1","level":"warning","message":{"text":"relay-inbound.createRelayInboundHandler.listOutbox (cyclomatic 20): relay-inbound.createRelayInboundHandler.listOutbox 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/daemon/src/domain/gateway/relay-inbound.ts"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"12cf9aa136258a8b960dc929bd0ebf2dc155ce0ad819d8a70db5ac99084b6e36"}},{"ruleId":"D1","level":"warning","message":{"text":"watchdog-policy-engine.parseWatchdogSpec (cyclomatic 20): watchdog-policy-engine.parseWatchdogSpec 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/daemon/src/domain/watchdog-policy-engine.ts"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6211070acd0e163f2055d5d6983df70277f9099c0c240d7ee8c8828769e9c70"}},{"ruleId":"D1","level":"warning","message":{"text":"seat-cwd-preparation.projectionCopyDirectory (cyclomatic 20): seat-cwd-preparation.projectionCopyDirectory 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/daemon/src/domain/seat-cwd-preparation.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe1031b8df441e58c2010eebf17f842158bf84b2bdebddc83f6b02db19a12d86"}},{"ruleId":"D1","level":"warning","message":{"text":"SeatLifecycleService.effortReport (cyclomatic 20): SeatLifecycleService.effortReport 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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b6c76969960d090c167bf1e7c62a9264bc0450d527b0f9ff7c025ee0ee5b66"}},{"ruleId":"D1","level":"warning","message":{"text":"SeatLifecycleService.inPlaceTarget (cyclomatic 20): SeatLifecycleService.inPlaceTarget 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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":2035}}}],"partialFingerprints":{"codehealthFindingId/v1":"759688fca2111433ffafe915a863f5c5d655e780f7ba75ee561429498490bd31"}},{"ruleId":"D1","level":"warning","message":{"text":"queue-retention.pruneEvents (cyclomatic 20): queue-retention.pruneEvents 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/daemon/src/domain/queue-retention.ts"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7c33ef48dbe782a4f8dfde28495fdbb83a6c038fe8cc64148bf64422a8d500"}},{"ruleId":"D1","level":"warning","message":{"text":"RestoreCheckService.hasActivityRelayHook (cyclomatic 20): RestoreCheckService.hasActivityRelayHook has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 6 of the 20 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 1385, 1398). 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/daemon/src/domain/restore-check-service.ts"},"region":{"startLine":1379}}}],"partialFingerprints":{"codehealthFindingId/v1":"4218e1a80b6817df8175e35573b516189f8ae85e9744d7caa3640730c4dc2fd1"}},{"ruleId":"D1","level":"warning","message":{"text":"skill-audit.auditSkills.entries (cyclomatic 20): skill-audit.auditSkills.entries 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/daemon/src/domain/skill-audit.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f98a5670dea0a5a1fbe17af17e60622c9d8218883e38fa24bb90ade814ede7"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkflowRuntime.reconcileStuckExceptions (cyclomatic 20): WorkflowRuntime.reconcileStuckExceptions has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 937, 948, 947). 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/daemon/src/domain/workflow-runtime.ts"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ef0e51564dc37db03316f748bd099dfc28eeaf439709c1612d74863bc8201e"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkflowRuntime.resumeFailureOccurrence (cyclomatic 20): WorkflowRuntime.resumeFailureOccurrence has cyclomatic complexity 20 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 8 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/daemon/src/domain/workflow-runtime.ts"},"region":{"startLine":1395}}}],"partialFingerprints":{"codehealthFindingId/v1":"c445de0fe635d587175adcfc4755eebd6d5332a4cadb673f0b166e5deb37ff45"}},{"ruleId":"D1","level":"warning","message":{"text":"activity.piUsageRequest (cyclomatic 20): activity.piUsageRequest 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/daemon/src/routes/activity.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7702ac9ea4205684772152981e4379fabdf7d6e1a50036d108109670038ba0"}},{"ruleId":"D1","level":"warning","message":{"text":"browser-boundary.browserBoundary (cyclomatic 20): browser-boundary.browserBoundary 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 7 function items inside it that branch (acceptedTarget, knownTarget, explicitlyAllowedOrigin, \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/daemon/src/middleware/browser-boundary.ts"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1dd5f31e4cf47a385ec1f1e7a0154cc9b82735d0c5a0b94cebc85a3a2c3a3f"}},{"ruleId":"D1","level":"warning","message":{"text":"startup.createDaemon::topologyDestinationAdvisory (cyclomatic 20): startup.createDaemon::topologyDestinationAdvisory 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. This shape REPEATS in the file: one other method here (startup.createDaemon) 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/daemon/src/startup.ts"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a1fbf7d722756024e43dcbb2eee2408d66b37e1bcf1a6e4c0445c133d6185a"}},{"ruleId":"D1","level":"warning","message":{"text":"scopes-model.proofEvidence (cyclomatic 20): scopes-model.proofEvidence 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":"packages/tui/src/scopes/scopes-model.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e3a85e15d822ebadaf525c4eecd5fe38b828bb759ef80351a9eaa3b455596af"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkflowTopologyGraph.WorkflowStepNode (cyclomatic 20): WorkflowTopologyGraph.WorkflowStepNode 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/ui/src/components/workflow/WorkflowTopologyGraph.tsx"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"5618a5bdec644d14f354daca2cfaaa9646a30b2b6202e0a56205b3dc45a575e3"}},{"ruleId":"D1","level":"warning","message":{"text":"LibraryReview.LibraryRigReviewContent (cyclomatic 20): LibraryReview.LibraryRigReviewContent has cyclomatic complexity 20 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 8 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/ui/src/components/LibraryReview.tsx"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"06482268aba7cdee3daff6da47aa7783596c50bbc159813a5bc8a7d4fffdd77c"}},{"ruleId":"D1","level":"warning","message":{"text":"HostConfigCard.HostConfigCard (cyclomatic 20): HostConfigCard.HostConfigCard has cyclomatic complexity 20 (threshold 15). Of this number, 15 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/ui/src/components/dashboard/HostConfigCard.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"2124a5b70f0b49dd5529f1e8248ae43d3842551a65bd1ee753f2635cef190e44"}},{"ruleId":"D1","level":"warning","message":{"text":"useScopeMarkdown.useScopeMarkdown (cyclomatic 20): useScopeMarkdown.useScopeMarkdown 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/ui/src/hooks/useScopeMarkdown.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc004fef8b008bf701e7ebf88e87040fc28bec617b52e7bb3b526ba4bde37a27"}},{"ruleId":"D1","level":"warning","message":{"text":"ProofTab.ProofSliceCard (cyclomatic 20): ProofTab.ProofSliceCard 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":"packages/ui/src/components/project/ProofTab.tsx"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a99ece1ae5243d718bab28f61df6aee7b25078820d521ffcc3ea882b729753b"}},{"ruleId":"D1","level":"warning","message":{"text":"useTopologyEdgeActivity.normalizeEvent (cyclomatic 20): useTopologyEdgeActivity.normalizeEvent 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/ui/src/hooks/useTopologyEdgeActivity.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac78236b3015519475f3f1827b5d0fbdb4d4c14aede853ab87b40de2b4b5beb7"}},{"ruleId":"D1","level":"warning","message":{"text":"migrate-telemetry-state-0.5.9.validateLegacySources (cyclomatic 20): migrate-telemetry-state-0.5.9.validateLegacySources has cyclomatic complexity 20 (threshold 15). Of this number, 18 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. This is NOT this file\u0027s highest cyclomatic complexity: migrate-telemetry-state-0.5.9.verificationReceipt (cyclomatic 26) 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":"skills/_canonical/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f781462bc3155151a73e9f52d2601f26f1f2b6a80a3947bd72cbcf0a9ed717"}},{"ruleId":"D1","level":"warning","message":{"text":"compose.compose_progress (cyclomatic 20): compose.compose_progress 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/daemon/assets/plugins/openrig-core/skills/openrig-operating-model/scripts/compose.py"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b469f3110c39e7e9907aa62915ecd3a9915f93bebb14169f8c9939b8f264084"}},{"ruleId":"D1","level":"warning","message":{"text":"follow (cyclomatic 20): follow 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/daemon/assets/herdr-app/mods/rig-strip/main.js"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"4107896ee21bbafeac12cb5f602c2045efc88f83ca86625e860caf8c9cf9906c"}},{"ruleId":"D1","level":"warning","message":{"text":"pi-runner-protocol.buildPiRunnerCommand (cyclomatic 19): pi-runner-protocol.buildPiRunnerCommand 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/daemon/src/adapters/pi-runner-protocol.ts"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"85282666f0c83850d1cc22d5dd59c9b896deed1f6e883c7034b0206a48f793f1"}},{"ruleId":"D1","level":"warning","message":{"text":"ActivityGrantStore.reconcileBinding (cyclomatic 19): ActivityGrantStore.reconcileBinding 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 2 function literals inside it that branch (lines 138, 146). 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/daemon/src/domain/activity-grants.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d5a0adf45aa6573ab71aeb70b7a4f6feb97d43f31573491920af43451043bb"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionRegistry.assertAddressAvailable (cyclomatic 19): SessionRegistry.assertAddressAvailable 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":"packages/daemon/src/domain/session-registry.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"e88086c83a951285354748bc944d649cfc0a9d86313d628486f6baca9c676348"}},{"ruleId":"D1","level":"warning","message":{"text":"seat-skill-storage.seatSkillReplay (cyclomatic 19): seat-skill-storage.seatSkillReplay 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":"packages/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7e8ca9ab8fca32b3023fb3b38a442938539eb4e6fec997b2db241582f1c81d3"}},{"ruleId":"D1","level":"warning","message":{"text":"rigspec-schema.validateCrossPodEdge (cyclomatic 19): rigspec-schema.validateCrossPodEdge 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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a70b21b30026c91dfba9294dd25d51426b65796835dfefc51baf9d279f2d1d"}},{"ruleId":"D1","level":"warning","message":{"text":"rigspec-schema.validateSurfaces (cyclomatic 19): rigspec-schema.validateSurfaces 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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b0f7372de7a2d6ba8bf18a542dc4b4257d7c198906244e231497a041ed6f50"}},{"ruleId":"D1","level":"warning","message":{"text":"rigspec-schema.normalizePod.members (cyclomatic 19): rigspec-schema.normalizePod.members 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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":1320}}}],"partialFingerprints":{"codehealthFindingId/v1":"3925e7d56cb5a52d146cf6dc17fb3b8a448c3da57a5d8e17e00b92d6e59082f9"}},{"ruleId":"D1","level":"warning","message":{"text":"human-registry.canonicalProjectionSnapshot (cyclomatic 19): human-registry.canonicalProjectionSnapshot 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, separate the cases: extract each independent branch into its own 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/daemon/src/domain/gateway/human-registry.ts"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fde63799553121ba43130cd8395b1c87465e2774a0a1f0e2131a9f9fc3b2797"}},{"ruleId":"D1","level":"warning","message":{"text":"quiet-release.runQuietRelease (cyclomatic 19): quiet-release.runQuietRelease 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":"packages/daemon/src/domain/policies/quiet-release.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c74449eb54ef724c7f0e9c650355ced762953bf7723603440ca1d78199c53a"}},{"ruleId":"D1","level":"warning","message":{"text":"queue-pickup.deriveClaimPickup (cyclomatic 19): queue-pickup.deriveClaimPickup 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/daemon/src/domain/queue-pickup.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"2722078fece532fb44bb1f036dc25fad59b69b692ae85cad64bb1e9ea9ff9645"}},{"ruleId":"D1","level":"warning","message":{"text":"slack-api.callWebApi (cyclomatic 19): slack-api.callWebApi has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 2 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 102). 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/daemon/src/domain/gateway/slack/slack-api.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d035156e41a8199bb125623f23163ebf437581a05b66631414b992c86b0aa46"}},{"ruleId":"D1","level":"warning","message":{"text":"queue-wake-ladder.hasPickupEvidence (cyclomatic 19): queue-wake-ladder.hasPickupEvidence 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/daemon/src/domain/queue-wake-ladder.ts"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c1b9559553bb0be1f271cc686462bca6d1818d94970ffc841c1426ecdcac525"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionTransport.broadcast (cyclomatic 19): SessionTransport.broadcast has cyclomatic complexity 19 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 8 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. This is NOT this file\u0027s highest cyclomatic complexity: session-transport.bridgeable (cyclomatic 21) 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":5047}}}],"partialFingerprints":{"codehealthFindingId/v1":"1372be9693123d961dc7b901a3b214b880420b2c3ed79bad56609dc246574b58"}},{"ruleId":"D1","level":"warning","message":{"text":"session-transport.writtenFact (cyclomatic 19): session-transport.writtenFact 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. This is NOT this file\u0027s highest cyclomatic complexity: session-transport.bridgeable (cyclomatic 21) 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"4039eeabb8a796d5e33f80d5266834e4e5650752dd16913d9827e1791e5e0805"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeCompactionEnforcer.getOwedRestore (cyclomatic 19): ClaudeCompactionEnforcer.getOwedRestore 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"f49d29b06c1448e95eec00595e24f2db04f036b31cc9005997cb889a153e9f1b"}},{"ruleId":"D1","level":"warning","message":{"text":"ChainFollower.read (cyclomatic 19): ChainFollower.read 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/acp/agent-server.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b8c8c541ea1ef9c4cdbebecd90fc04ad28a2573a5e2f14bb0eefa385658711"}},{"ruleId":"D1","level":"warning","message":{"text":"ps.compactNodeProjection (cyclomatic 19): ps.compactNodeProjection has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to one function literal inside it that branches (line 750). 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/commands/ps.ts"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"283011b13308b954bc81853cd1c0b6603464fd4432bbf2ca410dafb15cedd2e3"}},{"ruleId":"D1","level":"warning","message":{"text":"bundle-check.checkBundleFolder::agent (cyclomatic 19): bundle-check.checkBundleFolder::agent 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. This shape REPEATS in the file: one other method here (bundle-check.checkBundleFolder) 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/lib/bundle-check.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe534c7f78aee287c6deb4212336bfc3d860d23676f7c18709b4c672f79cb8b"}},{"ruleId":"D1","level":"warning","message":{"text":"cross-host-target.resolveCrossHostTarget (cyclomatic 19): cross-host-target.resolveCrossHostTarget 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/cli/src/cross-host-target.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e7159e09c1fb965c08c951cce32374ee62e7d11ba46094850f8a98176e4e90"}},{"ruleId":"D1","level":"warning","message":{"text":"work-install.resolveWorkContextHome (cyclomatic 19): work-install.resolveWorkContextHome 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/lib/work-install.ts"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"b32e2d4e353b886c6d260960f03d820d927f15db274f33af577a92ce167bc71c"}},{"ruleId":"D1","level":"warning","message":{"text":"context-reconstruction.reconstructionCommand (cyclomatic 19): context-reconstruction.reconstructionCommand has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 3 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 35). 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/commands/context-reconstruction.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da86be7d2e79cd74bed0714813def379dcb99b20b40bee50152a54916f36c2c"}},{"ruleId":"D1","level":"warning","message":{"text":"edge.edgeCommand (cyclomatic 19): edge.edgeCommand has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to 3 function items inside it that branch (run, a function literal at line 147, a function literal at line 164). 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/commands/edge.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"61075b4eb59c66b3b820f1c50f3efcabfb52a9501727a95e339cf80bdba1187e"}},{"ruleId":"D1","level":"warning","message":{"text":"provider.providerCommand::renderSeatAccounts (cyclomatic 19): provider.providerCommand::renderSeatAccounts 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. This shape REPEATS in the file: 4 other methods here (provider.providerCommand::renderStatusHuman, provider.providerCommand::renderUsageRow, provider.providerCommand::renderAcrossHosts, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 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/commands/provider.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"5828fb40ce70b0c1061ffc56fe66a5a7ce2b7ef9324e80f4a3d1d8c9a4eaa1fd"}},{"ruleId":"D1","level":"warning","message":{"text":"restore-check.restoreCheckCommand (cyclomatic 19): restore-check.restoreCheckCommand has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to one function literal inside it that branches (line 246). 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/commands/restore-check.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef553147f0009d9f110caf8dbae47a3f26b72a31ba46cba276b6f21aeaa3e6e"}},{"ruleId":"D1","level":"warning","message":{"text":"front-door.probeFrontDoor (cyclomatic 19): front-door.probeFrontDoor 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/front-door.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2eab8be2687e2280edd51ab1b2d1398785d4eed8ca5bd5ba758c9159f60e15"}},{"ruleId":"D1","level":"warning","message":{"text":"usage.providerChargeText (cyclomatic 19): usage.providerChargeText 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/commands/usage.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"672fb5f0b5880fafc04249242e75709a3a98656bc7ca63ba178340df5016bed9"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeCodeAdapter.project (cyclomatic 19): ClaudeCodeAdapter.project 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":"packages/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b85cec2a1d0b0d82ea5af11a67e530c24fa762aa2a26164f378b7c17a21354"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeCodeAdapter.deliverStartup (cyclomatic 19): ClaudeCodeAdapter.deliverStartup 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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ebdac8cd7943942860db6752d010bb38c8430d90b96f7ee276eba19c4e83ef1"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeCodeAdapter.reconcileClaudeActivityHooks (cyclomatic 19): ClaudeCodeAdapter.reconcileClaudeActivityHooks 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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":1331}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a630359770575bf448b34a1122c92f35d6bc2ad1e2465f167aca1892337c36b"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-filesystem-preflight.compareFilesystem (cyclomatic 19): codex-filesystem-preflight.compareFilesystem 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. This shape REPEATS in the file: one other method here (codex-filesystem-preflight.compareFilesystem::at) 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/daemon/src/domain/codex-filesystem-preflight.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"d910d55fbe97d681e253b13d92b6a9e15224f9ae751104ee23736df61b38d460"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerCore.pumpManaged (cyclomatic 19): RunnerCore.pumpManaged 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":1144}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f70a29ede2012b53ce53bfa225e859bd55a2be4695b12340ef975a616eae2d"}},{"ruleId":"D1","level":"warning","message":{"text":"pi-runner.readPiSessionEntryIds (cyclomatic 19): pi-runner.readPiSessionEntryIds 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc6597720afbf4f14fd90cddd1b07d572cafa657bbaf37ff826f3779f4e56720"}},{"ruleId":"D1","level":"warning","message":{"text":"bundle-types.serializeLegacyBundleManifest (cyclomatic 19): bundle-types.serializeLegacyBundleManifest 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, 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/daemon/src/domain/bundle-types.ts"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6017785135d6e327970281df8c9a577c76f1dde5357c5dbc73fc7e7cf7d8ddc"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentImageLibraryService.readImageEntry (cyclomatic 19): AgentImageLibraryService.readImageEntry has cyclomatic complexity 19 (threshold 15). Of this number, 15 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":"packages/daemon/src/domain/agent-images/agent-image-library-service.ts"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2109bc3e1c11ebbde5022ccd90033395c2755a73b14660c3e7c4a592249541a"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentImageLibraryService.install (cyclomatic 19): AgentImageLibraryService.install 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/daemon/src/domain/agent-images/agent-image-library-service.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee4e7bf8f9f3d789e4b2bb6c904d7fdbdb83f25196b54f9ef2313382c166134"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaimService.bind (cyclomatic 19): ClaimService.bind 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/daemon/src/domain/claim-service.ts"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"df333fdd2970e7f41f6b6778c382cc262fd19f4317f5af8304d9708f3ec586d5"}},{"ruleId":"D1","level":"warning","message":{"text":"destination-successor.recordedSuccessorNotice (cyclomatic 19): destination-successor.recordedSuccessorNotice has cyclomatic complexity 19 (threshold 15). Of this number, 15 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/daemon/src/domain/destination-successor.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f460f4a33995181293145b8060935aa09e8855240e8861926957e18b8c6190f"}},{"ruleId":"D1","level":"warning","message":{"text":"restore-plan-preview.intendedActionFor (cyclomatic 19): restore-plan-preview.intendedActionFor 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/daemon/src/domain/restore-plan-preview.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8530717176db4e67d67d1365c161c9d8b253d471260ba0198c9107dcdfb13da"}},{"ruleId":"D1","level":"warning","message":{"text":"HumanModeService.endAvailability (cyclomatic 19): HumanModeService.endAvailability 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/daemon/src/domain/gateway/human-operating-modes.ts"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b20d65c379a2b12ad6df08f976a65194c1bfa711b68a43f5c845e5bfaecc85"}},{"ruleId":"D1","level":"warning","message":{"text":"relay-inbound.resolveOfferedReplyRefContext (cyclomatic 19): relay-inbound.resolveOfferedReplyRefContext 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/daemon/src/domain/gateway/relay-inbound.ts"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f5f333d60dbd87062dff89d05b1f831608e2d71bcf06d356e4fe1198fde1a1"}},{"ruleId":"D1","level":"warning","message":{"text":"rig-mode-validator.validateRecord (cyclomatic 19): rig-mode-validator.validateRecord 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/daemon/src/domain/rig-mode/rig-mode-validator.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"7162ed0095dba6010441b541d982f09aad4f41817dff627365db047045f54dbe"}},{"ruleId":"D1","level":"warning","message":{"text":"usage-series.computeTopBurn (cyclomatic 19): usage-series.computeTopBurn 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":"packages/daemon/src/domain/usage-series.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8002a2df639a08063993b569d56482399ef9c577bd5f4b648412fe6aa4fe04"}},{"ruleId":"D1","level":"warning","message":{"text":"HealthCheckpointSource.read (cyclomatic 19): HealthCheckpointSource.read has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 127, 149, 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":"packages/daemon/src/domain/health-checkpoints.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"890a2b071abd34647d4e487ea260093c1d1011282db788dce30ed917a5e73767"}},{"ruleId":"D1","level":"warning","message":{"text":"learned-host-bindings.loadLearnedHostBindings (cyclomatic 19): learned-host-bindings.loadLearnedHostBindings 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/daemon/src/domain/hosts/learned-host-bindings.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ed2446feb181f09a7120ed12a273454bd82a32eca5f0a5e755d7cb4113721f"}},{"ruleId":"D1","level":"warning","message":{"text":"queue-erasure.eraseRigRecords (cyclomatic 19): queue-erasure.eraseRigRecords has cyclomatic complexity 19 (threshold 15). Of this number, 15 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/daemon/src/domain/queue-erasure.ts"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"3965e335020beadf401d4a943b7c35ab0730c73a59aff2f5cf6060fe3d257530"}},{"ruleId":"D1","level":"warning","message":{"text":"queue-retention.pruneStreamItems (cyclomatic 19): queue-retention.pruneStreamItems has cyclomatic complexity 19 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 8 belong to 3 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/daemon/src/domain/queue-retention.ts"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ba7686ab92dfc88f3ccb4174d1986ce4ef093519129a3e44acf16b09b67526"}},{"ruleId":"D1","level":"warning","message":{"text":"RestoreCheckService.checkSeatReadiness (cyclomatic 19): RestoreCheckService.checkSeatReadiness 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/daemon/src/domain/restore-check-service.ts"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9e9792181ab0cda0f8dec0b5276a7fc37e5d97c98a1ba31312d8652d2680b7"}},{"ruleId":"D1","level":"warning","message":{"text":"RestoreCheckService.checkHooks (cyclomatic 19): RestoreCheckService.checkHooks 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/daemon/src/domain/restore-check-service.ts"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a5ada0c618bc1c0f2d62afcf2352484622a77bb35eb1e337f4274dd602a3b0"}},{"ruleId":"D1","level":"warning","message":{"text":"ReviewGatherer.attentionForTag (cyclomatic 19): ReviewGatherer.attentionForTag has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 8 of the 19 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 548, 568). 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/daemon/src/domain/review/gather.ts"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7323f148921eda03c23144d58e58b206f73c9822923def5a064bd180333aca4"}},{"ruleId":"D1","level":"warning","message":{"text":"StreamIntakeCoordinator.handleStreamItem (cyclomatic 19): StreamIntakeCoordinator.handleStreamItem has cyclomatic complexity 19 (threshold 15). Of this number, 15 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":"packages/daemon/src/domain/stream-intake.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f5965588ab5742265e58e054c735790d4638c8afc23d12fd6d098aee1f450d"}},{"ruleId":"D1","level":"warning","message":{"text":"view-composer.composeView (cyclomatic 19): view-composer.composeView 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":"packages/daemon/src/domain/terminal/view-composer.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb8ef075f1bcb77694788742cba2771371cc826b051e9a486f7a8946798fe60"}},{"ruleId":"D1","level":"warning","message":{"text":"task-terminal-view.projectTaskOwners (cyclomatic 19): task-terminal-view.projectTaskOwners 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":"packages/daemon/src/domain/terminal/task-terminal-view.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"808917de8ff83c6a6feab55ba5350849cf575a77831cb7a6f07e69f981a96b7e"}},{"ruleId":"D1","level":"warning","message":{"text":"scope-task-terminal-view.readScopeIndex::add (cyclomatic 19): scope-task-terminal-view.readScopeIndex::add 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/daemon/src/domain/terminal/scope-task-terminal-view.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"f756008ea729b7d2fe90edffeef4cd6240b6e2e622274c79b80280510400ace4"}},{"ruleId":"D1","level":"warning","message":{"text":"MultiRigLauncher.launch (cyclomatic 19): MultiRigLauncher.launch has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 7 of the 19 points are its own statements and the rest belongs to 2 function items inside it that branch (runEntry, a function literal at line 162). 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/daemon/src/domain/topology/multi-rig-launcher.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"8739543b5feefe1c21f9f1198fa9f871097fcb438d42264cf97c360258db2cf8"}},{"ruleId":"D1","level":"warning","message":{"text":"activity.evidenceFromHookActivity (cyclomatic 19): activity.evidenceFromHookActivity 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/daemon/src/routes/activity.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8aee9b29cddd12cc4639a3712f02af1b0603fd4232da18880d91db469f15ba8"}},{"ruleId":"D1","level":"warning","message":{"text":"activity.bindToGrant (cyclomatic 19): activity.bindToGrant 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/daemon/src/routes/activity.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"af42051ebcd26a9f8ba093e981b83f6482673b7fdd1ca917c6138152b712c6b9"}},{"ruleId":"D1","level":"warning","message":{"text":"activity.submitPermission (cyclomatic 19): activity.submitPermission 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/daemon/src/routes/activity.ts"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"396dd3525fae01fd11530e47fed2ba07648bd2d20256a64cb0e737079301b6ef"}},{"ruleId":"D1","level":"warning","message":{"text":"startup.observeSeat (cyclomatic 19): startup.observeSeat 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/daemon/src/routes/startup.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf190c9c0b5e8ebf16b779499cab42bd3baefd221fd8de97ac1d53c232670c3c"}},{"ruleId":"D1","level":"warning","message":{"text":"slices.resolveSliceProjectLookup.resolveProjectId (cyclomatic 19): slices.resolveSliceProjectLookup.resolveProjectId has cyclomatic complexity 19 (threshold 15). Of this number, 15 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":"packages/daemon/src/routes/slices.ts"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da452cc2b6bfd5af16b155282c5f30c1e352fb55f756b7fb591f053bdcd7f7c"}},{"ruleId":"D1","level":"warning","message":{"text":"browser-boundary.browserBoundary.\u003Creturned closure\u003E (cyclomatic 19): browser-boundary.browserBoundary.\u003Creturned closure\u003E 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/daemon/src/middleware/browser-boundary.ts"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6cc5db4849d69d54db65119e3aa6e6f8289094331ebe19a2a0a7f6e0069c304"}},{"ruleId":"D1","level":"warning","message":{"text":"scopes-model.scopeIdentityLines (cyclomatic 19): scopes-model.scopeIdentityLines 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/tui/src/scopes/scopes-model.ts"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a026e64c1e4abc334b9926429601b707e6ef6749829e57620570331818d210"}},{"ruleId":"D1","level":"warning","message":{"text":"cost-model.providerChargeText (cyclomatic 19): cost-model.providerChargeText 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/tui/src/cost/cost-model.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"c37b76c3ef11e6aec9dcaecc600a9e311ac432767818d03597721407731ad107"}},{"ruleId":"D1","level":"warning","message":{"text":"navigator.navigatorLabelsInner (cyclomatic 19): navigator.navigatorLabelsInner has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 169, 152, 177). 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/tui/src/navigator.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e7d3194bedd5f3e584a7d6786d2bd9093aa63e7bc65015e1e522320834e94f"}},{"ruleId":"D1","level":"warning","message":{"text":"main.run (cyclomatic 19): main.run 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. This shape REPEATS in the file: 3 other methods here (main.run::draw, main.run::executeAct, main.run::handleInput) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 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/tui/src/main.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f00edc87e9057cc4451c9744cc6d58c2d5b88a3d31156b2f0d77a6580e60b3e"}},{"ruleId":"D1","level":"warning","message":{"text":"ScopePages.HostScopePage (cyclomatic 19): ScopePages.HostScopePage 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/ui/src/components/topology/ScopePages.tsx"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d6a6bf56c74e2d2b71aa3e80cfc7c9d3aeaaf62b84f38bb4b44cb96cedef21"}},{"ruleId":"D1","level":"warning","message":{"text":"ScopePages.WorkspaceScopePage (cyclomatic 19): ScopePages.WorkspaceScopePage 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, 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/ui/src/components/project/ScopePages.tsx"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"17efb728bdea62d552db599333e6332461a6f7e595a250e9a790365ace5e6cce"}},{"ruleId":"D1","level":"warning","message":{"text":"migrate-telemetry-state-0.5.9.scanLegacy (cyclomatic 19): migrate-telemetry-state-0.5.9.scanLegacy 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. This is NOT this file\u0027s highest cyclomatic complexity: migrate-telemetry-state-0.5.9.verificationReceipt (cyclomatic 26) 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":"skills/_canonical/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a863724794730744dbfde6dbd24bb0a3b1b0976d014f654c47bc4f34c93d9a"}},{"ruleId":"D1","level":"warning","message":{"text":"claude-credential-precedence.settingsFileConflicts (cyclomatic 18): claude-credential-precedence.settingsFileConflicts 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/daemon/src/domain/claude-credential-precedence.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b5449ac83c4bbff81ff60303ff75f3834a3614e33a2acae01b6f96610e0082"}},{"ruleId":"D1","level":"warning","message":{"text":"PermissionStopObservations.read (cyclomatic 18): PermissionStopObservations.read 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/daemon/src/domain/permission-stop-observation.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"39fdfdfe3aea887838f4e17443c3bee5f8eafaba5c22614cddfe6535856cde99"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-thread-id.readLoggedThreadsIncrementally (cyclomatic 18): codex-thread-id.readLoggedThreadsIncrementally has cyclomatic complexity 18 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 8 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/daemon/src/domain/codex-thread-id.ts"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"e91c87290550b7801534fc46fd75b11a475ac6f8b0849bd47de7b10b215e5288"}},{"ruleId":"D1","level":"warning","message":{"text":"seat-effort.readNativeEffort (cyclomatic 18): seat-effort.readNativeEffort has cyclomatic complexity 18 (threshold 15). Of this number, 17 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/daemon/src/domain/seat-effort.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ede4db9062dd84a14c00ec85d51ba4340bb905d2be77f0f7f95eb4eac130b3f"}},{"ruleId":"D1","level":"warning","message":{"text":"effective-model-readers.piSeatPinReadings (cyclomatic 18): effective-model-readers.piSeatPinReadings has cyclomatic complexity 18 (threshold 15). Of this number, 16 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":"packages/daemon/src/domain/model-divergence/effective-model-readers.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"970da6d8b585b58aa40f91b01f9630348af0b0d766ff15edf4f525b56aa691e5"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsStore.writeConfig (cyclomatic 18): SettingsStore.writeConfig 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. This is NOT this file\u0027s highest cyclomatic complexity: settings-store.getDefaultValue (cyclomatic 99) 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/daemon/src/domain/user-settings/settings-store.ts"},"region":{"startLine":1381}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d4dac23fb8233a4a1dede89ad29249ef8c5b0a06416de79a296dc027060669"}},{"ruleId":"D1","level":"warning","message":{"text":"agent-manifest.validatePluginResources (cyclomatic 18): agent-manifest.validatePluginResources 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/daemon/src/domain/agent-manifest.ts"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"499c40a5752791b99063f2a0dc84145cc1337df32a28303e3aae7fc6b7a2e61f"}},{"ruleId":"D1","level":"warning","message":{"text":"native-permission-store.resolveLaunchOverrideFromFacts (cyclomatic 18): native-permission-store.resolveLaunchOverrideFromFacts 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/daemon/src/domain/native-permission-store.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c7fcf2967fee8c4cb51330c7ff7c8ca919639bac852b4075185a3fbd30a7ac"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenShellPodmanObserver.capture (cyclomatic 18): OpenShellPodmanObserver.capture has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 2 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/daemon/src/adapters/openshell-podman-observer.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a856c1804496365920b9d21ddbe9ddf1904204be27cf592f988ec5e7254e9d08"}},{"ruleId":"D1","level":"warning","message":{"text":"slack-api.postChatMessage (cyclomatic 18): slack-api.postChatMessage 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/daemon/src/domain/gateway/slack/slack-api.ts"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37098b973de521866d6d30fc33275386cceefdc9549ee26d7af68855a522203"}},{"ruleId":"D1","level":"warning","message":{"text":"host-usage-rollup.rollupClaude (cyclomatic 18): host-usage-rollup.rollupClaude has cyclomatic complexity 18 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 3 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/daemon/src/domain/provider/host-usage-rollup.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c916926f07cb8c20c061b6397a169b41c12bb39fcbfb85bb331975165126bad"}},{"ruleId":"D1","level":"warning","message":{"text":"SliceIndexer.missionIdAliasesForCounting (cyclomatic 18): SliceIndexer.missionIdAliasesForCounting 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/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eff5bad749530f9bee7f3a00f4e6eab378c7c5863622ac7e2922ab21a4ba11c"}},{"ruleId":"D1","level":"warning","message":{"text":"SliceIndexer.missionIdAliases (cyclomatic 18): SliceIndexer.missionIdAliases 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/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c0dc96875ac1a8e14358350a4f977c9ce4c6f5d13177a2942c3c416baa627b6"}},{"ruleId":"D1","level":"warning","message":{"text":"SliceIndexer.scanProofPacket::walk (cyclomatic 18): SliceIndexer.scanProofPacket::walk 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/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":1590}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3afa556ae340c11946eec39c1fe864fe18af8220836164156f8eae666a84b06"}},{"ruleId":"D1","level":"warning","message":{"text":"restore-guidance.seatGuidance (cyclomatic 18): restore-guidance.seatGuidance 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/daemon/src/domain/restore-guidance.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"497d239728ca14320318dba7cb1050e11d339b3a3b646428f25c74f522ee2e1e"}},{"ruleId":"D1","level":"warning","message":{"text":"persisted-restore-posture.resolvePersistedRestorePosture (cyclomatic 18): persisted-restore-posture.resolvePersistedRestorePosture 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/daemon/src/domain/permission-policy/persisted-restore-posture.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a315606e3d85eeacb72496276eb696afddc202376cd7377a7c2ae5d0cac09b9"}},{"ruleId":"D1","level":"warning","message":{"text":"queue-wake-ladder.refusedWatchdogJobs (cyclomatic 18): queue-wake-ladder.refusedWatchdogJobs has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 2 of the 18 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 1175, 1179). 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/daemon/src/domain/queue-wake-ladder.ts"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ba7788d7f20848965627c31f28c64d1dbbc462ffedf7d3a6557f4bcf06ba52"}},{"ruleId":"D1","level":"warning","message":{"text":"relay-outbound.decodeRelayReplyRef (cyclomatic 18): relay-outbound.decodeRelayReplyRef 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/daemon/src/domain/gateway/relay-outbound.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"d001343de1e385ec56e83b0ed662ccd6612034a7aa7eff5f84b5059698e5099f"}},{"ruleId":"D1","level":"warning","message":{"text":"QueueRepository.drainPendingWakeIntents (cyclomatic 18): QueueRepository.drainPendingWakeIntents has cyclomatic complexity 18 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 8 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":1941}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c1ffe59fd9c4b21663ce0205f70eccf60115966b0d17cd5006af5f62e33050"}},{"ruleId":"D1","level":"warning","message":{"text":"QueueRepository.listRows (cyclomatic 18): QueueRepository.listRows 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":5110}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad10ed836717c336a5ca5df18abdd81dba87f2c8ada62b0cc67928699c664d0a"}},{"ruleId":"D1","level":"warning","message":{"text":"queue-repository.listablePullOutboxKeys (cyclomatic 18): queue-repository.listablePullOutboxKeys 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":6456}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba937babdd932611c845244d3901e7ffadd6ab439178d03a1b390cb405e58a93"}},{"ruleId":"D1","level":"warning","message":{"text":"session-transport.styledTextLines (cyclomatic 18): session-transport.styledTextLines 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 one function literal inside it that branches (line 516). 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. This is NOT this file\u0027s highest cyclomatic complexity: session-transport.bridgeable (cyclomatic 21) 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"e20fa8b27a03104946684b2d917aeb5754392b452a96a6cf3e051e93c974c03f"}},{"ruleId":"D1","level":"warning","message":{"text":"ConfigStore.reset (cyclomatic 18): ConfigStore.reset 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/config-store.ts"},"region":{"startLine":1743}}}],"partialFingerprints":{"codehealthFindingId/v1":"797ab6bd5c60b58454e602864db580e7a626ad86efa10d611cb67bbab61aa1b1"}},{"ruleId":"D1","level":"warning","message":{"text":"model-observation.modelObservation (cyclomatic 18): model-observation.modelObservation 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/lib/model-observation.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1134195b4a5dc25cbf954a5405612b99d24ace8b6f9029b801bd8361a999dcd"}},{"ruleId":"D1","level":"warning","message":{"text":"run-on-host.runOnSshHost (cyclomatic 18): run-on-host.runOnSshHost 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/lib/run-on-host.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f6f9e385e50562db0b23d447589df649adbb26c7dee70938dc11a44e03e803"}},{"ruleId":"D1","level":"warning","message":{"text":"send.classifyDeliveryEffect (cyclomatic 18): send.classifyDeliveryEffect 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/commands/send.ts"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f2c5f9cb49268583c9ff9ac1031339f2d03ee5e724757fa586204c64bdb588"}},{"ruleId":"D1","level":"warning","message":{"text":"capture.renderCapture (cyclomatic 18): capture.renderCapture has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 5 of the 18 points are its own statements and the rest belongs to one function item inside it that branches (note). 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/commands/capture.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"f42fe538f2c2146bd80aff4c6bc54965b4a33d8385203183d4a38fd1cd35f9d2"}},{"ruleId":"D1","level":"warning","message":{"text":"reconstruction-reader.readReconstruction (cyclomatic 18): reconstruction-reader.readReconstruction 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/lib/reconstruction-reader.ts"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14c2b6c68d1fdcb6bca045d2807227f5690c5fb1498f4d14096b7a2e252836c"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp-server.mapResult (cyclomatic 18): mcp-server.mapResult has cyclomatic complexity 18 (threshold 15). Of this number, 17 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/mcp-server.ts"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"d11b286f302f9596986173ff745614a5155bef02ea9f1a57bc19d961a375cf5f"}},{"ruleId":"D1","level":"warning","message":{"text":"provider.providerCommand::statusAcrossHosts (cyclomatic 18): provider.providerCommand::statusAcrossHosts 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. This shape REPEATS in the file: 4 other methods here (provider.providerCommand::renderStatusHuman, provider.providerCommand::renderSeatAccounts, provider.providerCommand::renderUsageRow, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 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/commands/provider.ts"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3788aff61bea86c38bf6d89bb8d930a74e1806e28dbffa164d1368a9de038ed"}},{"ruleId":"D1","level":"warning","message":{"text":"release.releaseCommand (cyclomatic 18): release.releaseCommand 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 2 function items inside it that branch (a function literal at line 26, getClient). 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/commands/release.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"10261f90ccdc5e525cec253087ae6b6afe057353c9e2d2977a7292561c2c36bd"}},{"ruleId":"D1","level":"warning","message":{"text":"remove.removeCommand (cyclomatic 18): remove.removeCommand 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 2 function items inside it that branch (a function literal at line 23, getClient). 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/commands/remove.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b09d4fc80a2b8f170ffb26568bf21269d2c6572cae1cf7bdeb39762fa9b21a"}},{"ruleId":"D1","level":"warning","message":{"text":"requirements.requirementsCommand (cyclomatic 18): requirements.requirementsCommand 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 2 function items inside it that branch (a function literal at line 22, getTarget). 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/commands/requirements.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"289266e1d9467cf055603fc86b2c3dc2cbcd615ff2319f2de2b12fc570c489ac"}},{"ruleId":"D1","level":"warning","message":{"text":"progress-edit.addProgressRow (cyclomatic 18): progress-edit.addProgressRow 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/lib/scope/progress-edit.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa3df82150b054021660ee723117825a03959d99aec6511ed0b60b570ef0693"}},{"ruleId":"D1","level":"warning","message":{"text":"stream-outcome.work (cyclomatic 18): stream-outcome.work 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":"packages/cli/src/commands/stream-outcome.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"605cbfafa3de73e4a39e1fe271cd6bd0b59006e97dae34f744859976f6a722df"}},{"ruleId":"D1","level":"warning","message":{"text":"activity-relay.claudeLimitResetAt (cyclomatic 18): activity-relay.claudeLimitResetAt 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/daemon/assets/plugins/openrig-core/hooks/scripts/activity-relay.cjs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce4b67b33f58a63e5acb88cb07d8b3ff5339065745dca94edd2556f05909f0c"}},{"ruleId":"D1","level":"warning","message":{"text":"refocus.process.stdout.write() (cyclomatic 18): refocus.process.stdout.write() 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/daemon/assets/plugins/openrig-core/hooks/scripts/refocus.cjs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"22aa28f05c4c6c699902766057d40a5351b40d3d31285331bb9d57f0cdae756d"}},{"ruleId":"D1","level":"warning","message":{"text":"precompact-hook.readClaudeCompactionMessage (cyclomatic 18): precompact-hook.readClaudeCompactionMessage 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/daemon/assets/plugins/openrig-core/skills/claude-compaction-restore/scripts/precompact-hook.mjs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c7afb922745c11ee59f953d3836cf506db31e2ac86dcd41586ace449d1cda1c"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeCodeAdapter.provisionContextCollector (cyclomatic 18): ClaudeCodeAdapter.provisionContextCollector 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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":1268}}}],"partialFingerprints":{"codehealthFindingId/v1":"b291b459a9f2f07d8bc8e427c675d27c7c0a332a7f6937137da27ede1b4c2f7c"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenRouterChargeLookup.lookUp (cyclomatic 18): OpenRouterChargeLookup.lookUp 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/daemon/src/adapters/pi-openrouter-charge.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"77aefa042134bf7e5416288037e021b469630cfaff9397aa68d53d9dd74bd235"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-auth.copyOntoFresh (cyclomatic 18): codex-auth.copyOntoFresh 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/daemon/src/domain/codex-auth.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37efab15ea14ced09db4cd6b55eb5be2d0f1446ecfae58260ff1aa5ffbc8979"}},{"ruleId":"D1","level":"warning","message":{"text":"LegacyRigSpecCodec.serialize (cyclomatic 18): LegacyRigSpecCodec.serialize 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 one function literal inside it that branches (line 250). 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/daemon/src/domain/rigspec-codec.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7db2c2d2febd3dc45ece897b8124c6d4d0085a64190cae45da755a24e6c46d2"}},{"ruleId":"D1","level":"warning","message":{"text":"PodRigInstantiator.persistedMember (cyclomatic 18): PodRigInstantiator.persistedMember 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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":2283}}}],"partialFingerprints":{"codehealthFindingId/v1":"105e2bf2f0b6754880d43c2d5da506464aaaf0bf60eb24c677984962ffde6c33"}},{"ruleId":"D1","level":"warning","message":{"text":"BootstrapOrchestrator.buildServicePrelaunchHook (cyclomatic 18): BootstrapOrchestrator.buildServicePrelaunchHook has cyclomatic complexity 18 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 8 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/daemon/src/domain/bootstrap-orchestrator.ts"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"3475ff116558c3249f1d77dfdad6264276eea5e810d31736886741a8af583d13"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaimService.createAndBindToPod (cyclomatic 18): ClaimService.createAndBindToPod 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/daemon/src/domain/claim-service.ts"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"b279eb78d17288e73fdd808cd071ac4e65bb65eca1e5e2624b6b8b6d4124e382"}},{"ruleId":"D1","level":"warning","message":{"text":"current-work.deriveCurrentWork (cyclomatic 18): current-work.deriveCurrentWork 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/daemon/src/domain/current-work.ts"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ac2c79f945c94ee3127eabae4899919cfbdc404bd15b11c4f1bbb0c3b33834"}},{"ruleId":"D1","level":"warning","message":{"text":"current-work.frontmatterIntent (cyclomatic 18): current-work.frontmatterIntent 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/daemon/src/domain/current-work.ts"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"a480651b6aeefa6f5ea7e4b843ffb8be3e972eb569ec52c76cd19c8a74f57081"}},{"ruleId":"D1","level":"warning","message":{"text":"restore-plan-preview.tokenStateFor (cyclomatic 18): restore-plan-preview.tokenStateFor 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/daemon/src/domain/restore-plan-preview.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92d561794906704253e74be49fa3379058781727657b54311eedcd7d503b0bc"}},{"ruleId":"D1","level":"warning","message":{"text":"finite-telemetry.decode (cyclomatic 18): finite-telemetry.decode 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/daemon/src/domain/finite-telemetry.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a790fd4156d3d5eef54f774fbb7aefd11d82b3559dc75e6df9c61070d34da50"}},{"ruleId":"D1","level":"warning","message":{"text":"HumanModeService.endQuiet (cyclomatic 18): HumanModeService.endQuiet has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 6 of the 18 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 422, 441). 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/daemon/src/domain/gateway/human-operating-modes.ts"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d025ae90ac3d369cee64f56c709448736b30b39c56ce57121e717ec70da323"}},{"ruleId":"D1","level":"warning","message":{"text":"open-asks.deliveryFact (cyclomatic 18): open-asks.deliveryFact 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/daemon/src/domain/gateway/slack/open-asks.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc57f1f097e1bc7dc328ffdfe1779cda34f3dc8fa5376b7a8abf006db4ded70c"}},{"ruleId":"D1","level":"warning","message":{"text":"thread-routing.makeThreadRouteResolver.\u003Creturned closure\u003E (cyclomatic 18): thread-routing.makeThreadRouteResolver.\u003Creturned closure\u003E 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/daemon/src/domain/gateway/slack/thread-routing.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d095818843f23e463261661d59d3cad046418d548935a1ea53c608bb365921"}},{"ruleId":"D1","level":"warning","message":{"text":"slack-subsystem.buildSlackGatewayWire.deriveReplyToChoice (cyclomatic 18): slack-subsystem.buildSlackGatewayWire.deriveReplyToChoice 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/daemon/src/domain/gateway/slack/slack-subsystem.ts"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1202e3a598c8609d0c1fc14b90ff781e8836ae1b4e86e14aaf977115ccf5cad"}},{"ruleId":"D1","level":"warning","message":{"text":"guidance-projection.readGuidanceProjection (cyclomatic 18): guidance-projection.readGuidanceProjection 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/daemon/src/domain/guidance-projection.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"062356501503d13e1f1a2b606ee5ccde8912a9ccf047ae3e0594d53d7e84d57e"}},{"ruleId":"D1","level":"warning","message":{"text":"HealthCheckpointSource.submit (cyclomatic 18): HealthCheckpointSource.submit 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/daemon/src/domain/health-checkpoints.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e25590405e351ae4688edeb80a191ee0d876426cf5f7c47685cd5b30fe2b588"}},{"ruleId":"D1","level":"warning","message":{"text":"KernelBootTracker.getStatus (cyclomatic 18): KernelBootTracker.getStatus 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/daemon/src/domain/kernel-boot-tracker.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"3016262d5e8051fbcd72b768bbc18991474355465fa015591971adee9c34326f"}},{"ruleId":"D1","level":"warning","message":{"text":"SeatLifecycleService.stopSeatChecked (cyclomatic 18): SeatLifecycleService.stopSeatChecked has cyclomatic complexity 18 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 9 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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8db0b65ba5a5c2f74572845d8071570b361d549ccb39b438f046c7acea1f6bb"}},{"ruleId":"D1","level":"warning","message":{"text":"seat-lifecycle-service.effortSummary (cyclomatic 18): seat-lifecycle-service.effortSummary 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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":2583}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1035e3ced0d9965d4689d586637edc56a371f1052e1134c81c110c1d9ec15a2"}},{"ruleId":"D1","level":"warning","message":{"text":"skill-audit.isSelfReferential (cyclomatic 18): skill-audit.isSelfReferential 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/daemon/src/domain/skill-audit.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"f94567d40cefa2c779dea3ea58d5420da1b6780f8033e3bfa298dfad52f817f3"}},{"ruleId":"D1","level":"warning","message":{"text":"HerdrViewer.forgetClosed (cyclomatic 18): HerdrViewer.forgetClosed 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 one function literal inside it that branches (line 286). 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/daemon/src/domain/terminal/herdr-viewer.ts"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe4abfb45f83c5788cc043eacb57de14bb6fcf40ade3bb5e5e8bb6504bc5ed5"}},{"ruleId":"D1","level":"warning","message":{"text":"HerdrAppProvider.reconcileState (cyclomatic 18): HerdrAppProvider.reconcileState 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/daemon/src/domain/terminal/herdr-app-provider.ts"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"137abb9c509af6d17c42e473bc8340ec9584a311b2620d5673ff6e2916fd8ad9"}},{"ruleId":"D1","level":"warning","message":{"text":"scope-task-terminal-view.selectMission (cyclomatic 18): scope-task-terminal-view.selectMission 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/daemon/src/domain/terminal/scope-task-terminal-view.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c34ef445417a5925dcad96a12f3b23963c9850a5b06194dc2f8336a8180c12"}},{"ruleId":"D1","level":"warning","message":{"text":"UpCommandRouter.autoDetect (cyclomatic 18): UpCommandRouter.autoDetect 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/daemon/src/domain/up-command-router.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"66377ae2b91c140cc37e1701e7917e1d075584727580eb0afb5f733d23816a4b"}},{"ruleId":"D1","level":"warning","message":{"text":"watchdog-delivery-receipts.withWatchdogReceipts::reconcile (cyclomatic 18): watchdog-delivery-receipts.withWatchdogReceipts::reconcile 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/daemon/src/domain/watchdog-delivery-receipts.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8efdcf99e7ab17818240a8c2a42d467b2ce4326ef773da0e4523a2f83858721"}},{"ruleId":"D1","level":"warning","message":{"text":"frontmatter-validator.validateFile (cyclomatic 18): frontmatter-validator.validateFile 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/daemon/src/domain/workspace/frontmatter-validator.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"666c880d3d2aa3549600af3fd88e5fede977ec1d5002b0a6cbe693b2c162bf1f"}},{"ruleId":"D1","level":"warning","message":{"text":"sessions.nodesRoutes.post(\u0022/launch-subset\u0022) (cyclomatic 18): sessions.nodesRoutes.post(\u0022/launch-subset\u0022) 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/daemon/src/routes/sessions.ts"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef39ab88b7189920cb5eade38775258953d99c09022bfe53df108d94174d968f"}},{"ruleId":"D1","level":"warning","message":{"text":"packages.packagesRoutes.post(\u0022/plan\u0022) (cyclomatic 18): packages.packagesRoutes.post(\u0022/plan\u0022) 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, 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/daemon/src/routes/packages.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c94208b9ae319db9e4cd7380c59ba9c4059aa9a361f44ce56c13f92ee6ea190b"}},{"ruleId":"D1","level":"warning","message":{"text":"usage-model.seatLines (cyclomatic 18): usage-model.seatLines has cyclomatic complexity 18 (threshold 15). Of this number, 17 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/tui/src/usage/usage-model.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"acc203da92c3cb65ecebddc02d67b471f362b9cec8dbdd78b1e1468c8ea9ee03"}},{"ruleId":"D1","level":"warning","message":{"text":"SubscriptionToggleList.SubscriptionToggleList (cyclomatic 18): SubscriptionToggleList.SubscriptionToggleList has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 3 of the 18 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 83, 153, 114). 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/ui/src/components/for-you/SubscriptionToggleList.tsx"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd2ee7969f79a0b84bddc40353359db24525b76e1e94127dfc7d2e61ca656c7"}},{"ruleId":"D1","level":"warning","message":{"text":"SyntaxHighlight.tokenize (cyclomatic 18): SyntaxHighlight.tokenize 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/ui/src/components/markdown/SyntaxHighlight.tsx"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"867b41edb1c9d12707120bf8fd04c495a86c8d6530deb3d17d52d77ad2dc6b3e"}},{"ruleId":"D1","level":"warning","message":{"text":"BundleInstallFlow.BundleInstallFlow (cyclomatic 18): BundleInstallFlow.BundleInstallFlow has cyclomatic complexity 18 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 5 belong to 3 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/ui/src/components/BundleInstallFlow.tsx"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"1018d3cd491ba856832622787489ef028358669d33b40210f70ed814d39b4506"}},{"ruleId":"D1","level":"warning","message":{"text":"useMissionControlAction.postAction (cyclomatic 18): useMissionControlAction.postAction 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/ui/src/components/mission-control/hooks/useMissionControlAction.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"d12fc1f1348fe1d55606898a113170f602b2671bb2c5c7579c2a1ef47c56604b"}},{"ruleId":"D1","level":"warning","message":{"text":"FeedCardQuestionAsk.FeedCardQuestionAsk::refreshQueueRow (cyclomatic 18): FeedCardQuestionAsk.FeedCardQuestionAsk::refreshQueueRow 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. This shape REPEATS in the file: one other method here (FeedCardQuestionAsk.FeedCardQuestionAsk) 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/ui/src/components/for-you/FeedCardQuestionAsk.tsx"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ec3d7873f07dd2f766a88939227ad8eba1642878a55934810a6ad68beefc92"}},{"ruleId":"D1","level":"warning","message":{"text":"SliceReviewTab.SliceReviewTab (cyclomatic 18): SliceReviewTab.SliceReviewTab 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/ui/src/components/review/SliceReviewTab.tsx"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b6dee1ecace9a5033ed4e24bd8ec797dd82b5e55cb36e3e61b6d1ec90c94943"}},{"ruleId":"D1","level":"warning","message":{"text":"startup-submission-evidence.composerRegion (cyclomatic 17): startup-submission-evidence.composerRegion 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/daemon/src/domain/startup-submission-evidence.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18a469a70c2427637a6d8f46ceffd8d3275b368012da999133c147f05cc668d"}},{"ruleId":"D1","level":"warning","message":{"text":"connection-contract.readWakeOutcome (cyclomatic 17): connection-contract.readWakeOutcome 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/daemon/src/domain/connection-contract.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"041822d9508cce37be38bee7f79dd0a34bef9dbf426ed3d23a1b900045c1c36f"}},{"ruleId":"D1","level":"warning","message":{"text":"native-process-arguments.readNativeProcessLaunch (cyclomatic 17): native-process-arguments.readNativeProcessLaunch 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/daemon/src/domain/native-process-arguments.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a2b2d66ded26212f9d0222d37238bdfa21e9bcb03cbe63b35ca1f321243394d"}},{"ruleId":"D1","level":"warning","message":{"text":"native-process-lineage.findExactNativeResumeProcess (cyclomatic 17): native-process-lineage.findExactNativeResumeProcess 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/daemon/src/domain/native-process-lineage.ts"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"5431860b6ac42de5c6434f8729936332f129518b40f9bcf2003f783d145107da"}},{"ruleId":"D1","level":"warning","message":{"text":"SeatDeliveryGuard.custody (cyclomatic 17): SeatDeliveryGuard.custody has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 4 function items inside it that branch (acquire, validate, acquire::run, \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/daemon/src/domain/seat-delivery-guard.ts"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"022ca0a12fc34af7ac9952ef5b8794c0313702c9cc541a94b2dc9bacb52c699e"}},{"ruleId":"D1","level":"warning","message":{"text":"seat-skill-storage.writeSeatSkillCatalog (cyclomatic 17): seat-skill-storage.writeSeatSkillCatalog 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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":1090}}}],"partialFingerprints":{"codehealthFindingId/v1":"200b47857291b84cfc6cc5045530a86eee4e44c832ac7839a30303498f4a9e3a"}},{"ruleId":"D1","level":"warning","message":{"text":"EnvironmentPlatform.create (cyclomatic 17): EnvironmentPlatform.create 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/daemon/src/domain/environment-platform.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb233f5127e24cdf2b1b09d9d180e084320e6ccc76dad6ed157a909ce34deb94"}},{"ruleId":"D1","level":"warning","message":{"text":"InboundRouter.summaryOf (cyclomatic 17): InboundRouter.summaryOf 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/daemon/src/domain/gateway/slack/inbound.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"7471b74b677b90dcd9b5fe05f30a96820884906066cb351f05e84f08dab3b218"}},{"ruleId":"D1","level":"warning","message":{"text":"queue-access.personFacingBody (cyclomatic 17): queue-access.personFacingBody 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/daemon/src/domain/gateway/slack/queue-access.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dba50372efc999e636c1d42f8ff66e99d675e9ac6dc9f8e77a357cd494c9eac"}},{"ruleId":"D1","level":"warning","message":{"text":"queue-stuck-sweep.polledBacklogText (cyclomatic 17): queue-stuck-sweep.polledBacklogText has cyclomatic complexity 17 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 6 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":"packages/daemon/src/domain/queue-stuck-sweep.ts"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea9022bee53ebf8ef006ea1313d6d5ab71f15d5a84a028a01812e5419c9874b"}},{"ruleId":"D1","level":"warning","message":{"text":"relay-outbound.postRelayEnvelope (cyclomatic 17): relay-outbound.postRelayEnvelope 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/daemon/src/domain/gateway/relay-outbound.ts"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67849f464843507b62bbea3027ecd3159fbbbd64865aae4279922a9d51b568a"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnerPermissions.submit (cyclomatic 17): RunnerPermissions.submit has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 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/daemon/src/domain/runner-permissions.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eff240fb74380190365d63b59b7edd8b4994d5474ef13fce9cccbf903fddddc"}},{"ruleId":"D1","level":"warning","message":{"text":"QueueRepository.classifyOwnerNotification (cyclomatic 17): QueueRepository.classifyOwnerNotification 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":1435}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7aedaedb7e31b010855e06116a8bf32aa4cfb401ef75f88994290605d3783fa"}},{"ruleId":"D1","level":"warning","message":{"text":"QueueRepository.answersForAsk (cyclomatic 17): QueueRepository.answersForAsk has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 6 of the 17 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 2392, 2385, 2400). 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":2374}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee3179a631e2737d01bba08a7196fed71d72b8ca6e5b264b3e8e1e5032aa2132"}},{"ruleId":"D1","level":"warning","message":{"text":"QueueRepository.create (cyclomatic 17): QueueRepository.create has cyclomatic complexity 17 (threshold 15). Of this number, 13 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":2417}}}],"partialFingerprints":{"codehealthFindingId/v1":"d64d0a686eecfaea88197e92317483bf61bce5046128ba5aed073ee727e144b0"}},{"ruleId":"D1","level":"warning","message":{"text":"QueueRepository.currentDeliveryEpisode (cyclomatic 17): QueueRepository.currentDeliveryEpisode 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, separate the cases: extract each independent branch into its own 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":5710}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1223f75d50c7244a86789fa588365ebe947b1d88bac76dc1ff263594308ad7c"}},{"ruleId":"D1","level":"warning","message":{"text":"StartupOrchestrator.fail (cyclomatic 17): StartupOrchestrator.fail 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/daemon/src/domain/startup-orchestrator.ts"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69398f98aed008a108dd402a78964e283dd4b3c0a99501092720f65eb9552ee"}},{"ruleId":"D1","level":"warning","message":{"text":"native-resume-probe.claudeCurrentRows (cyclomatic 17): native-resume-probe.claudeCurrentRows has cyclomatic complexity 17 (threshold 15). Of this number, 13 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/daemon/src/domain/native-resume-probe.ts"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fcb859a685862131bef5fcbc53a3078cdac3f764650dd7f0b8eca1e9ff0f21c"}},{"ruleId":"D1","level":"warning","message":{"text":"check-runner.parseArgs (cyclomatic 17): check-runner.parseArgs has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs 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":"docs/reference/runner-conformance/check-runner.mjs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb87e8b332fdf811427edbd6bc2dbe471c4fc532bb7715ad5d354739b842677"}},{"ruleId":"D1","level":"warning","message":{"text":"daemon-lifecycle.waitForKernelReady (cyclomatic 17): daemon-lifecycle.waitForKernelReady 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/daemon-lifecycle.ts"},"region":{"startLine":1520}}}],"partialFingerprints":{"codehealthFindingId/v1":"7027954820d0369a37ade784c0ec88f304df3828fea5f6614f5e047d15e2a69d"}},{"ruleId":"D1","level":"warning","message":{"text":"ps.parseFilter (cyclomatic 17): ps.parseFilter 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/commands/ps.ts"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfdddcf81a5257f4a2119f393e45aebc1020893f404553bd44f29f2d85c2cf55"}},{"ruleId":"D1","level":"warning","message":{"text":"queue-receipt.rowReceipt (cyclomatic 17): queue-receipt.rowReceipt 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/queue-receipt.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"fafdb351274e9e7740181d1f8c82a837f08f536c91f65ffafbd977a19959bfbc"}},{"ruleId":"D1","level":"warning","message":{"text":"whoami.runCrossHostWhoami (cyclomatic 17): whoami.runCrossHostWhoami 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/commands/whoami.ts"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a828f7297275239d1d8eb5055346c14190ae42180bdbedc5bfed835ab828ab5"}},{"ruleId":"D1","level":"warning","message":{"text":"whoami.runFanOutWhoami (cyclomatic 17): whoami.runFanOutWhoami has cyclomatic complexity 17 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 7 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/commands/whoami.ts"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"e18eff2efe79ac5dd3db235b31d71cfccb715320c8caefa36f895a62746db42b"}},{"ruleId":"D1","level":"warning","message":{"text":"bundle-configuration.stageConfiguration (cyclomatic 17): bundle-configuration.stageConfiguration 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/lib/bundle-configuration.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"e086726d412ca834a85a94dec47249141f6a070a7e4b3697009da30e880082cf"}},{"ruleId":"D1","level":"warning","message":{"text":"scope-fs.resolveMissionsRoot (cyclomatic 17): scope-fs.resolveMissionsRoot 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/lib/scope/scope-fs.ts"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4f1687736dfe50a5f9b3f4c35061e93f7da7c2f6b22cb2f2f55f816b34d9fa"}},{"ruleId":"D1","level":"warning","message":{"text":"context-git.addGitContext (cyclomatic 17): context-git.addGitContext 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/lib/context-git.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4bb5a71e3247ebd2062b43a53fb40e2a26020a93f2fddb55c864f0404d6b6a6"}},{"ruleId":"D1","level":"warning","message":{"text":"down.showAgentsBeforeDown (cyclomatic 17): down.showAgentsBeforeDown has cyclomatic complexity 17 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 8 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/commands/down.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e1883a7e7063af49fc74f68b4c1c76c3ac41759a7108b99b16ee80b2d9ee27"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime-detect.detectRuntime (cyclomatic 17): runtime-detect.detectRuntime 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/restore-packet/runtime-detect.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"8723b863cbc7cab3b09fccf459d47b78c73d96c746e6fe7327c6fa55fd41f598"}},{"ruleId":"D1","level":"warning","message":{"text":"capability-delta.capabilityDeltaExpiryFindings (cyclomatic 17): capability-delta.capabilityDeltaExpiryFindings 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/lib/scope/capability-delta.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ea12c0ec2d3172b059aeb335e7af92a88c8b12beb2cbf45f1c9307ea28ca39"}},{"ruleId":"D1","level":"warning","message":{"text":"skill.skillCommand::printSeat (cyclomatic 17): skill.skillCommand::printSeat 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 (skill.skillCommand::seatLoadout) 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/commands/skill.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b728b2039836ac65d5be042975a4521486503be28b1de8632980da2c12b8608"}},{"ruleId":"D1","level":"warning","message":{"text":"terminal-window.openTerminalWindow::measureWindow (cyclomatic 17): terminal-window.openTerminalWindow::measureWindow 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 (terminal-window.openTerminalWindow) 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/terminal-window.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cdd400018a0deb71af7c805ddf9536b84f9caf0b394aa0b188277891ddec46b"}},{"ruleId":"D1","level":"warning","message":{"text":"activity-relay.settingsRelayReports (cyclomatic 17): activity-relay.settingsRelayReports has cyclomatic complexity 17 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 6 belong to 3 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/daemon/assets/plugins/openrig-core/hooks/scripts/activity-relay.cjs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41a5edbaa19bc3614c0df694f5e5900c715d84696e21fa30758e189820f7783"}},{"ruleId":"D1","level":"warning","message":{"text":"claude-activity-hooks.deriveRelayEvents (cyclomatic 17): claude-activity-hooks.deriveRelayEvents 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, separate the cases: extract each independent branch into its own 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/daemon/src/domain/claude-activity-hooks.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"e172f85036081b6d3c4e3083f761755276aceeacee312075b24d9606bfaff486"}},{"ruleId":"D1","level":"warning","message":{"text":"claude-owned-settings.cleanupOwnedClaudeCwd (cyclomatic 17): claude-owned-settings.cleanupOwnedClaudeCwd 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/daemon/src/domain/claude-owned-settings.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2a023e42dd7c311c27ea72714deaa60b7e2904519518258191232647b21904e"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeCodeAdapter.paneOccupant (cyclomatic 17): ClaudeCodeAdapter.paneOccupant 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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddcf7cca4bd45980f7822f13e897282212041c74872dce43a692255e8b251317"}},{"ruleId":"D1","level":"warning","message":{"text":"CodexRuntimeAdapter.deliverStartup (cyclomatic 17): CodexRuntimeAdapter.deliverStartup 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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"f445e1877a75a0554ec2921977c4845187b416ed1643deffee221ab6f873bd2a"}},{"ruleId":"D1","level":"warning","message":{"text":"PodRigInstantiator.launchExistingTerminalMember (cyclomatic 17): PodRigInstantiator.launchExistingTerminalMember 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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":2975}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd905a2e53bc1940d6b3943a8624177c58a9656bbf4651cb7f6f5852aa7215ae"}},{"ruleId":"D1","level":"warning","message":{"text":"profile-source-resolver.makeProfileReadFile.\u003Creturned closure\u003E (cyclomatic 17): profile-source-resolver.makeProfileReadFile.\u003Creturned closure\u003E 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":"packages/daemon/src/domain/context-packs/profile-source-resolver.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"423c615457cb7ae06021375cf4cf96c2173fd47e5fb39ff825eab87b694fdf56"}},{"ruleId":"D1","level":"warning","message":{"text":"current-restore-snapshot.currentRestoreSnapshot (cyclomatic 17): current-restore-snapshot.currentRestoreSnapshot 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/daemon/src/domain/current-restore-snapshot.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c3f070cc2b4bbd9da4efac283fb3f8cbfa66d7686f8f2ca17074f7d96827c54"}},{"ruleId":"D1","level":"warning","message":{"text":"restore-orchestrator.snapshotLaunchOutcome (cyclomatic 17): restore-orchestrator.snapshotLaunchOutcome 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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1df0ce9f8f073154a38f2424d9f11cfeb63ed12bf39149e9c14fb8641c9c6ff"}},{"ruleId":"D1","level":"warning","message":{"text":"feed-perspective.feedPerspective (cyclomatic 17): feed-perspective.feedPerspective 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/daemon/src/domain/feed-perspective.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de2f25d7c868b6345f5c07394c7638d75e54a74df2160e4027fe0d2d7418316"}},{"ruleId":"D1","level":"warning","message":{"text":"FileWriteService.writeAtomic (cyclomatic 17): FileWriteService.writeAtomic 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/daemon/src/domain/files/file-write-service.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5cc769709345198ead7548b3663485a1ba58bc233f6edf7614368c1689b826d"}},{"ruleId":"D1","level":"warning","message":{"text":"slack-recovery.threadOrder (cyclomatic 17): slack-recovery.threadOrder has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 3 function items inside it that branch (a function literal at line 282, stalledAt, scannedAt). 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/daemon/src/domain/gateway/slack/slack-recovery.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d68f360ba7bac8cb45adba327d95e46b1fe61ab895704f6363d17186b034ff"}},{"ruleId":"D1","level":"warning","message":{"text":"health-detectors.selectContextEpisodeEvidence (cyclomatic 17): health-detectors.selectContextEpisodeEvidence 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/daemon/src/domain/health-detectors.ts"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"339529b42f3eeb93d83f56a7cfab3a728e985615337ca7b85b55ffa88c9b280e"}},{"ruleId":"D1","level":"warning","message":{"text":"instance-initialization.ensureOpenRigInstance (cyclomatic 17): instance-initialization.ensureOpenRigInstance 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/daemon/src/domain/instance-initialization.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"b644d34cb6a60586a8d32a51fe778c66f35c07ece7249fbba1405b9c666659e3"}},{"ruleId":"D1","level":"warning","message":{"text":"MissionControlAuditBrowse.query (cyclomatic 17): MissionControlAuditBrowse.query 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/daemon/src/domain/mission-control/audit-browse.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc5c94b7089c68dfdf2180c0fa3b8b615cd7aa3014a8b8f64cd6f2ac9884194"}},{"ruleId":"D1","level":"warning","message":{"text":"NetworkInstallationStore.replace (cyclomatic 17): NetworkInstallationStore.replace 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/daemon/src/domain/network/network-installations.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3983f647a4d8f50cd91f27860628d14517b5c3d14fb6ece6aaf745151b2d202"}},{"ruleId":"D1","level":"warning","message":{"text":"NetworkInstallationStore.setParticipants (cyclomatic 17): NetworkInstallationStore.setParticipants 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/daemon/src/domain/network/network-installations.ts"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd7f1153c9e85bdee917132aec947f99976a4522a0b7ba5d5a4411d2f7e04d74"}},{"ruleId":"D1","level":"warning","message":{"text":"CodexInPlaceRestart.incomplete (cyclomatic 17): CodexInPlaceRestart.incomplete 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/daemon/src/domain/seat-restart-in-place.ts"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"297e49a9d9b32285528b0917ff987a070d21c98520d87842a4f43e8bbe825419"}},{"ruleId":"D1","level":"warning","message":{"text":"SeatLifecycleService.cleanSeat (cyclomatic 17): SeatLifecycleService.cleanSeat 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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":1289}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e61dac17b3e57dd2f57528c7f17d51d4b9c6e883eafb47172a3965b5afc85c"}},{"ruleId":"D1","level":"warning","message":{"text":"claude-seat-switch.effortNote (cyclomatic 17): claude-seat-switch.effortNote 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/daemon/src/domain/provider/claude-seat-switch.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3f89b8911b252a6c92c94e1d7834e049fbc44f74f080370c6f5f5bf0bc1328"}},{"ruleId":"D1","level":"warning","message":{"text":"ClaudeUsageWindows.project (cyclomatic 17): ClaudeUsageWindows.project 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/daemon/src/domain/provider/claude-usage-windows.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e3bc285d869bfc057721db31be8e45392fb42bf5ad72484975212fbec2f8c5c"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-usage-windows.normalizeCodexUsage (cyclomatic 17): codex-usage-windows.normalizeCodexUsage 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/daemon/src/domain/provider/codex-usage-windows.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"d575188e492f2bb6e9769afce63014f001a876cdff00224a95684113086f9794"}},{"ruleId":"D1","level":"warning","message":{"text":"RestoreCheckService.checkRestorePreconditions (cyclomatic 17): RestoreCheckService.checkRestorePreconditions has cyclomatic complexity 17 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 5 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/daemon/src/domain/restore-check-service.ts"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"75aaa8e3e6f119228567708b001e1f566912d40a1633c9a7d6f8c8b15e4bc978"}},{"ruleId":"D1","level":"warning","message":{"text":"StreamIntakeCoordinator.drain (cyclomatic 17): StreamIntakeCoordinator.drain 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/daemon/src/domain/stream-intake.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"d440090d8d6a3ab31afd030e8e3dac3201555e52a571ce5a9f52cb4d50da0723"}},{"ruleId":"D1","level":"warning","message":{"text":"rex-adapter.exitedTiles (cyclomatic 17): rex-adapter.exitedTiles 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 items inside it that branch (check, a function literal at line 50, unconfirmed). 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/daemon/src/domain/terminal/rex-adapter.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e98d403b66b14bd26a61a8b6e8dba3fcb0f3ffa9efc0e319a1636a98bca18d"}},{"ruleId":"D1","level":"warning","message":{"text":"TerminalService.resolveComposed (cyclomatic 17): TerminalService.resolveComposed 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/daemon/src/domain/terminal/terminal-service.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"9510bf6491161a979b912d47d11caf1b3c34def84aa13f54e5e454230cc40eff"}},{"ruleId":"D1","level":"warning","message":{"text":"activity.activityRoutes.get(\u0022/parked\u0022) (cyclomatic 17): activity.activityRoutes.get(\u0022/parked\u0022) 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/routes/activity.ts"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc871abf4730bc37946175a4b9ae496476a04f315e4bf0934a499703d9708027"}},{"ruleId":"D1","level":"warning","message":{"text":"rigs.rigsRoutes.post(\u0022/:id/up\u0022) (cyclomatic 17): rigs.rigsRoutes.post(\u0022/:id/up\u0022) 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/daemon/src/routes/rigs.ts"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1584eb82ea2d5e84a85c1b74032ec7d8019a002cc1a8996147992c56176d06"}},{"ruleId":"D1","level":"warning","message":{"text":"sessions.sessionAdminRoutes.post(\u0022/:sessionName/repair-missing-pane\u0022) (cyclomatic 17): sessions.sessionAdminRoutes.post(\u0022/:sessionName/repair-missing-pane\u0022) 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/daemon/src/routes/sessions.ts"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"2466c9cf96a976e289ae29858b1fc9f44e4ec1a72ac7dd8a4ffaefe9fa03cc53"}},{"ruleId":"D1","level":"warning","message":{"text":"bootstrap.bootstrapRoutes.post(\u0022/apply\u0022) (cyclomatic 17): bootstrap.bootstrapRoutes.post(\u0022/apply\u0022) has cyclomatic complexity 17 (threshold 15). Of this number, 12 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":"packages/daemon/src/routes/bootstrap.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c537ddc387b59dc6477e98c9832fc23de4eb3aabb595575120c15010c074d5"}},{"ruleId":"D1","level":"warning","message":{"text":"seat.setPermissionsHandler (cyclomatic 17): seat.setPermissionsHandler 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: seat.seatLifecycleStatus (cyclomatic 31) 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/daemon/src/routes/seat.ts"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"156fdf852d8f404b4174e9542e8d837bd677ecd3464e63242420729c99cbb420"}},{"ruleId":"D1","level":"warning","message":{"text":"scopes-model.proofProvenanceLines (cyclomatic 17): scopes-model.proofProvenanceLines 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/tui/src/scopes/scopes-model.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"a427aaffc3df3c0da3728d7a30957cfeaa5855c838ce53932fbcfa7fb5cfb2c1"}},{"ruleId":"D1","level":"warning","message":{"text":"pairing.pairingLines (cyclomatic 17): pairing.pairingLines 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/tui/src/config/pairing.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"578ab56659383551972be164cdddcf08f0f3d0f675569e35bcd2869558fbacf5"}},{"ruleId":"D1","level":"warning","message":{"text":"main.run::executeAct (cyclomatic 17): main.run::executeAct 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: 3 other methods here (main.run, main.run::draw, main.run::handleInput) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 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/tui/src/main.ts"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"11243a910bef3ba3cb24de2c378993ef795fbd60fae57b26eb618e7b2dbff73e"}},{"ruleId":"D1","level":"warning","message":{"text":"activity-visuals.getActivityStateWithSource (cyclomatic 17): activity-visuals.getActivityStateWithSource 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/lib/activity-visuals.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c56df17ab6675158ea84695d75e54adff1d59fbb523c565ea1487e2d574cf8"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeMark.ToolMark (cyclomatic 17): RuntimeMark.ToolMark 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/ui/src/components/graphics/RuntimeMark.tsx"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed83a7da00e19db4c8fded841ec285efd1bc8468e0a25306d87463f18f73d692"}},{"ruleId":"D1","level":"warning","message":{"text":"StoryGraph.StoryGraph (cyclomatic 17): StoryGraph.StoryGraph has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 2 of the 17 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 205, 225, 191, \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/ui/src/components/project/StoryGraph.tsx"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c5fa0102c74339977eb8c6b1f11ba02b3cc5f45aab05b4a77d6ea0b62f2205c"}},{"ruleId":"D1","level":"warning","message":{"text":"MissionReviewTab.BoardRowExpansion (cyclomatic 17): MissionReviewTab.BoardRowExpansion 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/review/MissionReviewTab.tsx"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"28efa8da899857dd20964ea8578239e71808de77855f489e89ab03fa612cec03"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkflowInstancePage.ExceptionBanner (cyclomatic 17): WorkflowInstancePage.ExceptionBanner 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/ui/src/components/workflow/WorkflowInstancePage.tsx"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d0b52c953f32e4315c356cf5a90a13dafab2fbbfb403af5843e1a794d0297b1"}},{"ruleId":"D1","level":"warning","message":{"text":"graph-layout.applyTreeLayout (cyclomatic 17): graph-layout.applyTreeLayout 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/ui/src/lib/graph-layout.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a8cd69f546e6f49c0ad272269d5773b2524665771e3754afcec014b2cb009b"}},{"ruleId":"D1","level":"warning","message":{"text":"trace-to-root.render_held_and_next (cyclomatic 17): trace-to-root.render_held_and_next 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/assets/plugins/openrig-core/skills/refocusing/scripts/trace-to-root.py"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"e111145339553ae701a192e0d8bcb8ec08df4b45c3cf3ea70691bf9d6597f740"}},{"ruleId":"D1","level":"warning","message":{"text":"claude-permission-rules.validateClaudePermissionRules (cyclomatic 16): claude-permission-rules.validateClaudePermissionRules 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":"packages/daemon/src/domain/claude-permission-rules.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8d2e88cb20eacc365fdd13e1f31f62411098f8d942028f4ea545a63abe0c0f"}},{"ruleId":"D1","level":"warning","message":{"text":"composer-prompts.composerContainsOwnedText (cyclomatic 16): composer-prompts.composerContainsOwnedText 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/daemon/src/domain/composer-prompts.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc301f166f38b4006d5bb322173683da370e8ac6c8f830ed5d2b217ead2515d"}},{"ruleId":"D1","level":"warning","message":{"text":"ContextUsageStore.runnerUsage (cyclomatic 16): ContextUsageStore.runnerUsage 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/daemon/src/domain/context-usage-store.ts"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f582fb4365c5cf7913fe453277dc807fd8a19ec51932f50bdcf6e576b191a3"}},{"ruleId":"D1","level":"warning","message":{"text":"pi-runner-protocol.buildPiChildEnv (cyclomatic 16): pi-runner-protocol.buildPiChildEnv 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/daemon/src/adapters/pi-runner-protocol.ts"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca8fe9c17484a265acc4007e4f781156f19b46fdeb5c8b8ef176218c92713c9b"}},{"ruleId":"D1","level":"warning","message":{"text":"native-process-executable.readNativeExecutablePaths (cyclomatic 16): native-process-executable.readNativeExecutablePaths 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, 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/daemon/src/domain/native-process-executable.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a5702353fd3606aae99df2a13932a3394b32443a9b9ffaf38f06a44b97115c1"}},{"ruleId":"D1","level":"warning","message":{"text":"ResumeMetadataRefresher.captureClaudeSessionId (cyclomatic 16): ResumeMetadataRefresher.captureClaudeSessionId 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/daemon/src/domain/resume-metadata-refresher.ts"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da5379ce9fc235f739ca487128b73c4b40307484c9fae23a96f00aa1ff2cf38"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsStore.reset (cyclomatic 16): SettingsStore.reset 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: settings-store.getDefaultValue (cyclomatic 99) 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/daemon/src/domain/user-settings/settings-store.ts"},"region":{"startLine":1528}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae8d6c890a461de28837538c4ef79fc0ba4555b3d7e99969b1d2079db59b6c6"}},{"ruleId":"D1","level":"warning","message":{"text":"claude-theme-menu.currentClaudeThemeMenu (cyclomatic 16): claude-theme-menu.currentClaudeThemeMenu 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, 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/daemon/src/domain/claude-theme-menu.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"5558e2979640e5eb37eb15c0f0368f23e05f6e2c15a300ad0940b0cd2c1e8f05"}},{"ruleId":"D1","level":"warning","message":{"text":"claude-continuation-launch.continuationArguments (cyclomatic 16): claude-continuation-launch.continuationArguments 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/daemon/src/domain/claude-continuation-launch.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a090bd61b93862b23163e516e812826f249549b671aade18fa65bef11d7b00"}},{"ruleId":"D1","level":"warning","message":{"text":"seat-skill-storage.recordedSeatSkillFiles (cyclomatic 16): seat-skill-storage.recordedSeatSkillFiles 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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1db6ba2d54da1777227b0b3afccfcd9ebfd6fc349d48ae88b4b55bb344a4159"}},{"ruleId":"D1","level":"warning","message":{"text":"policy-ref.resolvePermissionPolicyAttachment (cyclomatic 16): policy-ref.resolvePermissionPolicyAttachment 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/daemon/src/domain/permission-policy/policy-ref.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ec36fbdce97738b361710c42050b3dc8bf65ecba4bf76900c480afc3be9704"}},{"ruleId":"D1","level":"warning","message":{"text":"rigspec-schema.validatePod (cyclomatic 16): rigspec-schema.validatePod 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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"d328c85e7fab2c1dd5b8d2390ad2f627b69044fbe0a927d2227582fec865fc0a"}},{"ruleId":"D1","level":"warning","message":{"text":"seat-launch-additions.carrySeatLaunchAdditions (cyclomatic 16): seat-launch-additions.carrySeatLaunchAdditions 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/daemon/src/domain/seat-launch-additions.ts"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89e3ce5e391e6cad0d9a65abfc249332ce3f37c5743cb2d505d6e3bb97821e5"}},{"ruleId":"D1","level":"warning","message":{"text":"HumanQuietStore.quietStateFor (cyclomatic 16): HumanQuietStore.quietStateFor 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/daemon/src/domain/gateway/human-quiet-windows.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d46c4e962aae28415a9b8ca45ce346505050be80e30f1932529fa4b67d39c2"}},{"ruleId":"D1","level":"warning","message":{"text":"human-registry.parseBindingSpec (cyclomatic 16): human-registry.parseBindingSpec 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/daemon/src/domain/gateway/human-registry.ts"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4f20df714a167120ef4a169da43850c485fe43f15f0e223e78c95eef6041f2"}},{"ruleId":"D1","level":"warning","message":{"text":"message.richInline (cyclomatic 16): message.richInline has cyclomatic complexity 16 (threshold 15). 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, separate the cases: extract each independent branch into its own 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/daemon/src/domain/gateway/slack/message.ts"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f39ad512eebd90eb2c6cbf1d2f579c023a6b65052427b2fc3be61ebfb09f9d"}},{"ruleId":"D1","level":"warning","message":{"text":"queue-transition-log.formatRelayOwnerNotificationAccepted (cyclomatic 16): queue-transition-log.formatRelayOwnerNotificationAccepted 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/daemon/src/domain/queue-transition-log.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a02988d39394d6d671128ee7d3779163c2e5e8c5c3221adc75ef49ad9d12981"}},{"ruleId":"D1","level":"warning","message":{"text":"scope-audit.deriveMissionDependencyGraph (cyclomatic 16): scope-audit.deriveMissionDependencyGraph has cyclomatic complexity 16 (threshold 15). Of this number, 14 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/daemon/src/domain/scope/scope-audit.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc198665f41668fce60f9e4ea7c11400c308d95fe4ed25fa352e917d7969a570"}},{"ruleId":"D1","level":"warning","message":{"text":"logical-checkbox.parseLogicalCheckboxes (cyclomatic 16): logical-checkbox.parseLogicalCheckboxes has cyclomatic complexity 16 (threshold 15). Of this number, 15 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/daemon/src/domain/scope/logical-checkbox.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"6912b24d4ba326dbbad74272eebbc3856abf11de6d12377ec6ec74e3b9a14889"}},{"ruleId":"D1","level":"warning","message":{"text":"compose.deriveWorkflowExceptions (cyclomatic 16): compose.deriveWorkflowExceptions 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/daemon/src/domain/review/compose.ts"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"27442559bdb5ba27e40e76252afcf5c2c333edd70a9adc0578e9cb11037c1130"}},{"ruleId":"D1","level":"warning","message":{"text":"SliceIndexer.walkSliceLocations (cyclomatic 16): SliceIndexer.walkSliceLocations has cyclomatic complexity 16 (threshold 15). 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, separate the cases: extract each independent branch into its own 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/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"c540d462703a30ce8444c674c55e1bb015f75feb298344a40c207b8336876d90"}},{"ruleId":"D1","level":"warning","message":{"text":"SliceIndexer.matchQitems (cyclomatic 16): SliceIndexer.matchQitems has cyclomatic complexity 16 (threshold 15). Of this number, 12 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":"packages/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":1242}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea9c609cdbb100717797a040925020a7dc32f8718506cecf1c2639d4e92b1f5"}},{"ruleId":"D1","level":"warning","message":{"text":"fresh-occupant-relation.readReadyFreshLaunchFences (cyclomatic 16): fresh-occupant-relation.readReadyFreshLaunchFences 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/daemon/src/domain/fresh-occupant-relation.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f8914a0521addcbd7833c60bf7f07b8bf8bcab218f0831335066dffa7b067c"}},{"ruleId":"D1","level":"warning","message":{"text":"QueueRepository.classifyWakeResult (cyclomatic 16): QueueRepository.classifyWakeResult 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":1395}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca459f5f90908e1a9bc50773d2666e65826fe6a5fc2b4a7aa1b7f79e64954837"}},{"ruleId":"D1","level":"warning","message":{"text":"QueueRepository.closeCrossHostHandoffSource (cyclomatic 16): QueueRepository.closeCrossHostHandoffSource has cyclomatic complexity 16 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 7 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":3174}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7240cdabdd7d9b2336e054d41dcf076195e642ac7071744411c57dd194ea5f3"}},{"ruleId":"D1","level":"warning","message":{"text":"QueueRepository.recordWatchdogWakeAttempt (cyclomatic 16): QueueRepository.recordWatchdogWakeAttempt has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 4 of the 16 points are its own statements and the rest belongs to 2 function items inside it that branch (a function literal at line 4408, recordFired). 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":4363}}}],"partialFingerprints":{"codehealthFindingId/v1":"f805d0544778d97def42a2f7ab4b6674d6df2b35dbf5c7772fa4299239a6fc24"}},{"ruleId":"D1","level":"warning","message":{"text":"StartupOrchestrator.executeActions (cyclomatic 16): StartupOrchestrator.executeActions 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/daemon/src/domain/startup-orchestrator.ts"},"region":{"startLine":1166}}}],"partialFingerprints":{"codehealthFindingId/v1":"189c1b2ce8617744fc25a7b52edf7dcee43fa62f3b7558b62b53ebe6dd5fd738"}},{"ruleId":"D1","level":"warning","message":{"text":"session-transport.countEnvelopeOccurrences (cyclomatic 16): session-transport.countEnvelopeOccurrences has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs 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. This is NOT this file\u0027s highest cyclomatic complexity: session-transport.bridgeable (cyclomatic 21) 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"891676ccbe536dd42665c59ad59e5c44855a055f4771f7a7f88f7883420b5726"}},{"ruleId":"D1","level":"warning","message":{"text":"session-transport.claudeSeatIdle (cyclomatic 16): session-transport.claudeSeatIdle has cyclomatic complexity 16 (threshold 15). 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, 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: session-transport.bridgeable (cyclomatic 21) 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":1891}}}],"partialFingerprints":{"codehealthFindingId/v1":"a892fea69c8e688d2264bd5b902bcd34f8acd90b907c11e5fbe1875b9552b417"}},{"ruleId":"D1","level":"warning","message":{"text":"TmuxAdapter.seatScopeStart (cyclomatic 16): TmuxAdapter.seatScopeStart 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/daemon/src/adapters/tmux.ts"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db0d78bd0c9189cbb9a5fa9e18e4826e75d7a660004423a032d44a4bad72873"}},{"ruleId":"D1","level":"warning","message":{"text":"TmuxAdapter.createProbeSession (cyclomatic 16): TmuxAdapter.createProbeSession 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/daemon/src/adapters/tmux.ts"},"region":{"startLine":1277}}}],"partialFingerprints":{"codehealthFindingId/v1":"de8472c2100fb3d685ecc5d11abe4765a9364dacbea4b8a98ea8bea214d7c163"}},{"ruleId":"D1","level":"warning","message":{"text":"native-resume-probe.insideClaudeTrustDialog (cyclomatic 16): native-resume-probe.insideClaudeTrustDialog 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":"packages/daemon/src/domain/native-resume-probe.ts"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d985a3926e85f918cc04c0270fc4f546bc706ac83c94333865f8e8a8f9c894f"}},{"ruleId":"D1","level":"warning","message":{"text":"fake-acp-agent.handle (cyclomatic 16): fake-acp-agent.handle 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":"docs/reference/runner-conformance/fake-acp-agent.mjs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff38b01c704335b079adc8dceb997603288e56331d3887e467eb02a9fbbf72af"}},{"ruleId":"D1","level":"warning","message":{"text":"agent-server.serveAcpAgent::askPerson (cyclomatic 16): agent-server.serveAcpAgent::askPerson 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/cli/src/acp/agent-server.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2045b56c1d52e0d9a14d49d6ca1fa6b963de335f23f4fc783fa3e3119ccfc3"}},{"ruleId":"D1","level":"warning","message":{"text":"host-registry.updateHostEntry (cyclomatic 16): host-registry.updateHostEntry 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/cli/src/host-registry.ts"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"406cee07cbccc462943d689f09d96879eae5d9864fc65e33f9427d99d8dd984f"}},{"ruleId":"D1","level":"warning","message":{"text":"daemon-lifecycle.liveStartReservation (cyclomatic 16): daemon-lifecycle.liveStartReservation 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/cli/src/daemon-lifecycle.ts"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f69c76e50250699c2dc3f328d9f378442306fc18beca5dd32c0e3bce190969"}},{"ruleId":"D1","level":"warning","message":{"text":"scope-audit.deriveMissionDependencyGraph (cyclomatic 16): scope-audit.deriveMissionDependencyGraph has cyclomatic complexity 16 (threshold 15). Of this number, 14 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/lib/scope/scope-audit.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"19de2c5e7c79099fd8942fbd36bb617ab553d504b39d3e1a11ac9ebb3073089b"}},{"ruleId":"D1","level":"warning","message":{"text":"doctor.listenerOwnerCheck (cyclomatic 16): doctor.listenerOwnerCheck 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/cli/src/commands/doctor.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"8078ebd0a9b4abf78adc0cff2eb07d114bb281ac905c495ff7a081a7339ee089"}},{"ruleId":"D1","level":"warning","message":{"text":"doctor.doctorCommand (cyclomatic 16): doctor.doctorCommand 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 3 function literals inside it that branch (lines 626, 639, 630). 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/commands/doctor.ts"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"c115394bf2b0cfde8e2f2a31473caaa4b05e951be4ea36b7edf8ce17cbb3ab2e"}},{"ruleId":"D1","level":"warning","message":{"text":"roster.readRosterInventory (cyclomatic 16): roster.readRosterInventory 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/cli/src/commands/roster.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"99dd3a710de862fc0e74683d4d65c734123f1a1c724f800e5487b4bbfc840e36"}},{"ruleId":"D1","level":"warning","message":{"text":"policy-ref.resolvePermissionPolicyAttachment (cyclomatic 16): policy-ref.resolvePermissionPolicyAttachment 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/cli/src/lib/permission-policy/policy-ref.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b4630f9bbbe316a08411d53bb195961bdc973067733f561e823f5591e481d5c"}},{"ruleId":"D1","level":"warning","message":{"text":"logical-checkbox.parseLogicalCheckboxes (cyclomatic 16): logical-checkbox.parseLogicalCheckboxes has cyclomatic complexity 16 (threshold 15). Of this number, 15 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/lib/scope/logical-checkbox.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"983c5ac0149dea4590e1eaedc4c81dc06f220a61fba4a50b0f213263f3626a46"}},{"ruleId":"D1","level":"warning","message":{"text":"queue.emitHandoffScopeAdvisories (cyclomatic 16): queue.emitHandoffScopeAdvisories 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/cli/src/commands/queue.ts"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c2e12b683614ef0c9effc4b3004ecf8d8dbb29100b4e2b18af8cac72f45343"}},{"ruleId":"D1","level":"warning","message":{"text":"scope.buildSliceMoveCommand (cyclomatic 16): scope.buildSliceMoveCommand 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 2 function literals inside it that branch (lines 834, 852). 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/commands/scope.ts"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d059c692b0415cc682ec48b8437f2ba8464c20e700452aca67c1820d0bd814"}},{"ruleId":"D1","level":"warning","message":{"text":"seat.printRestartReport (cyclomatic 16): seat.printRestartReport 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/cli/src/commands/seat.ts"},"region":{"startLine":2063}}}],"partialFingerprints":{"codehealthFindingId/v1":"04edabdf2fcd07f43a7ce54f105c2d1105c3021a749f31fbcc5662014ce2085e"}},{"ruleId":"D1","level":"warning","message":{"text":"claude-team-permissions.decide (cyclomatic 16): claude-team-permissions.decide 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/daemon/assets/claude-team-permissions.cjs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6218f82a25327cd53c87a82a7ae9681c8626a3080b874d080fa6c9ac6055f1"}},{"ruleId":"D1","level":"warning","message":{"text":"refocus.readConfiguredContent (cyclomatic 16): refocus.readConfiguredContent 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, separate the cases: extract each independent branch into its own 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/daemon/assets/plugins/openrig-core/hooks/scripts/refocus.cjs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f40f661158f258ad995b293230ef7c042d612a994761701de18ea273c401b0"}},{"ruleId":"D1","level":"warning","message":{"text":"refocus.renderRole (cyclomatic 16): refocus.renderRole has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 2 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/daemon/assets/plugins/openrig-core/hooks/scripts/refocus.cjs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"9046ac3c7a8fe494fefb2e9f5a4f5e381d20ce05ab73bdc6c03a8240fdcdfd01"}},{"ruleId":"D1","level":"warning","message":{"text":"cmux-transport.normalizePayload (cyclomatic 16): cmux-transport.normalizePayload 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/daemon/src/adapters/cmux-transport.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ad9423408356335d904fb230996c356ed7397d42820cd34b1c549a4209e518"}},{"ruleId":"D1","level":"warning","message":{"text":"codex-owned-plugin-trust.codexPluginContentHash::visit (cyclomatic 16): codex-owned-plugin-trust.codexPluginContentHash::visit 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/daemon/src/domain/codex-owned-plugin-trust.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"05198494210343d06c686faebd34155e21dfb2ecf694f551fcb9a46e4a53c138"}},{"ruleId":"D1","level":"warning","message":{"text":"CodexRuntimeAdapter.ensureCodexCorePlugin::renewContentApproval (cyclomatic 16): CodexRuntimeAdapter.ensureCodexCorePlugin::renewContentApproval 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 shape REPEATS in the file: one other method here (CodexRuntimeAdapter.ensureCodexCorePlugin) 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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fde5f9f056dea16e1f5ce3a361e93b7d664ffacf09ab57dd0b53412c54c9ceb"}},{"ruleId":"D1","level":"warning","message":{"text":"CodexRuntimeAdapter.proveResumedProcess (cyclomatic 16): CodexRuntimeAdapter.proveResumedProcess 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":1858}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bafe816e7a5aade2acbb05ca9040f522c37d0ff650c6c81f74478394b3f114b"}},{"ruleId":"D1","level":"warning","message":{"text":"pi-runner.createPaneCompositor::paint (cyclomatic 16): pi-runner.createPaneCompositor::paint 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 shape REPEATS in the file: one other method here (pi-runner.createPaneCompositor) 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: RunnerCore.acceptRunnerRequest (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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"423268cad2f3343134c4c0e5a8bcebd7ffef725b7bdb5438ff137ce17d61ee03"}},{"ruleId":"D1","level":"warning","message":{"text":"pi-runner.resolveActivityEndpoint (cyclomatic 16): pi-runner.resolveActivityEndpoint 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. This is NOT this file\u0027s highest cyclomatic complexity: RunnerCore.acceptRunnerRequest (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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":2004}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c74224fcaa712a278946be983102a06f7d8b20979506bfec67c605f7e70b26"}},{"ruleId":"D1","level":"warning","message":{"text":"stub-runner.resolveStubActivityEndpoint (cyclomatic 16): stub-runner.resolveStubActivityEndpoint 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/daemon/src/adapters/stub-runner.ts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"028e09cf7c1eaf64547ea3d72b7acbdab3606b8b3eb4da024e31cced6972d2cc"}},{"ruleId":"D1","level":"warning","message":{"text":"bundle-types.validatePluginsBlock (cyclomatic 16): bundle-types.validatePluginsBlock 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: bundle-types.normalizeBundleSource (cyclomatic 17) 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/daemon/src/domain/bundle-types.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"f326feb65718171b0489f2a16e67dba5b2460fa2de1859f19c5577f935649058"}},{"ruleId":"D1","level":"warning","message":{"text":"bundle-types.normalizeLegacyBundleManifest (cyclomatic 16): bundle-types.normalizeLegacyBundleManifest 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: bundle-types.normalizeBundleSource (cyclomatic 17) 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/daemon/src/domain/bundle-types.ts"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3195865329f6aa0eca7082e2bdc71ea0f166745ff3893a33b2800e357f990db"}},{"ruleId":"D1","level":"warning","message":{"text":"bundle-context-packs-router.routeContextPacks (cyclomatic 16): bundle-context-packs-router.routeContextPacks 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, separate the cases: extract each independent branch into its own 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/daemon/src/domain/bundle-context-packs-router.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c748c4054497add1392ed35d914d177ee9d770520d72419c35fd925e2f4b639"}},{"ruleId":"D1","level":"warning","message":{"text":"compaction-restore-notice.recoveryRecipient (cyclomatic 16): compaction-restore-notice.recoveryRecipient has cyclomatic complexity 16 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 5 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/daemon/src/domain/compaction-restore-notice.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5813293d384979386d7e4c77849e984a9d1f87e640b412ee56d9f22e7a1c998"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkflowInstanceStore.listFiltered (cyclomatic 16): WorkflowInstanceStore.listFiltered 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/daemon/src/domain/workflow-instance-store.ts"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e3f38979b5d3f673e5dd847ae3895b07ba1adcec97832dbf3a9d8e15c5bf23a"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkflowInstanceStore.updateFrontier (cyclomatic 16): WorkflowInstanceStore.updateFrontier 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/daemon/src/domain/workflow-instance-store.ts"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08a823053c90abab91ffcc4bc18491cb61f9868c33c44c853630b6e680ccf4d"}},{"ruleId":"D1","level":"warning","message":{"text":"execution-view.isValidGitRef (cyclomatic 16): execution-view.isValidGitRef 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/daemon/src/domain/execution-view.ts"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"343e666a84e3ee8b1beaff85a0f8053425e439baa416b0b33753e0a0b1b0fadc"}},{"ruleId":"D1","level":"warning","message":{"text":"existing-rig-restore.joinAutomaticRestore (cyclomatic 16): existing-rig-restore.joinAutomaticRestore has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs 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/daemon/src/domain/existing-rig-restore.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5a4b360134e2d0b26c0b50196c65d6485f284becc2b43de4be4597135d363e"}},{"ruleId":"D1","level":"warning","message":{"text":"MissionControlWriteContract.recordAnswer (cyclomatic 16): MissionControlWriteContract.recordAnswer has cyclomatic complexity 16 (threshold 15). 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: 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/daemon/src/domain/mission-control/mission-control-write-contract.ts"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"b660f9326b33fbfd3e320b60be8e1af317127b6871154aa547e3f653b054c24f"}},{"ruleId":"D1","level":"warning","message":{"text":"health-detectors.evaluateCoordination (cyclomatic 16): health-detectors.evaluateCoordination 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/daemon/src/domain/health-detectors.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"0529e81a0339b0b587034ca616d72185b7142d1ce8e20ad746e81fcfd1a933b9"}},{"ruleId":"D1","level":"warning","message":{"text":"fleet-scopes.aggregateFleetScopes (cyclomatic 16): fleet-scopes.aggregateFleetScopes 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 2 function items inside it that branch (worker, a function literal at line 279). 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/daemon/src/domain/hosts/fleet-scopes.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"1822fc577b0dc14b64ab7727f7c05a1fd04022430f090b6129f305aa115f846d"}},{"ruleId":"D1","level":"warning","message":{"text":"hosts-registry-writer.updateHostEntry (cyclomatic 16): hosts-registry-writer.updateHostEntry 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/daemon/src/domain/hosts/hosts-registry-writer.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2784bfedfc42a256fc71cb5fe68e8bf10e6bd03989a9db1b23bccd69f0f665c"}},{"ruleId":"D1","level":"warning","message":{"text":"ViewProjector.runBuiltIn (cyclomatic 16): ViewProjector.runBuiltIn 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":"packages/daemon/src/domain/view-projector.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd88630a5feda85ee3de30c0f7625f058d0f1614da287cfccd15a0568f7a0823"}},{"ruleId":"D1","level":"warning","message":{"text":"plugin-discovery-service.extractHookIdentities (cyclomatic 16): plugin-discovery-service.extractHookIdentities 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/daemon/src/domain/plugin-discovery-service.ts"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4894791a9d63f806bff3235a0aa15bf575754e16f10797dd1f73de80176f2e1"}},{"ruleId":"D1","level":"warning","message":{"text":"mode-scheduled-end.runModeScheduledEnd (cyclomatic 16): mode-scheduled-end.runModeScheduledEnd 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/daemon/src/domain/policies/mode-scheduled-end.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf1117bc9308ffb9bd5f45d0131058681df183621057f3baeeec948db4e91ed"}},{"ruleId":"D1","level":"warning","message":{"text":"mode-scheduled-end.recipientFor (cyclomatic 16): mode-scheduled-end.recipientFor has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs 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/daemon/src/domain/policies/mode-scheduled-end.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d81e39838a174bb48b5fe89a1e0d7ec46b2da7233a21068a8c1ac2720061e87"}},{"ruleId":"D1","level":"warning","message":{"text":"CodexInPlaceRestart.stopUnderShell (cyclomatic 16): CodexInPlaceRestart.stopUnderShell 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 3 function items inside it that branch (gone, wait, a function literal at line 674). 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/daemon/src/domain/seat-restart-in-place.ts"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf2409f2ab155ff2f4b6e54a0e62a5521b4f4f5f2f6a5e27d17a31ce634e706"}},{"ruleId":"D1","level":"warning","message":{"text":"SeatLifecycleService.setPolicy (cyclomatic 16): SeatLifecycleService.setPolicy 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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":1138}}}],"partialFingerprints":{"codehealthFindingId/v1":"333bb82748ebc9375aef13d66056af3ca42db94884cb2ba56644eaa0c89b7f6e"}},{"ruleId":"D1","level":"warning","message":{"text":"queue-retention.runQueueRetentionSweep (cyclomatic 16): queue-retention.runQueueRetentionSweep 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/daemon/src/domain/queue-retention.ts"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"3492cc7654b18df807045f1d9257a010a3cafdb047523df0321a180a32457ffd"}},{"ruleId":"D1","level":"warning","message":{"text":"RestoreCheckService.buildRecovery (cyclomatic 16): RestoreCheckService.buildRecovery 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":"packages/daemon/src/domain/restore-check-service.ts"},"region":{"startLine":1587}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f2c1ecc20b2b8c47414af56b13e502e09e263c9bf3b69ba675cc6b44d6ccb4"}},{"ruleId":"D1","level":"warning","message":{"text":"RestoreCheckService.checkSharedConversations (cyclomatic 16): RestoreCheckService.checkSharedConversations 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/daemon/src/domain/restore-check-service.ts"},"region":{"startLine":1752}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03d0fcd065a38ebffc8bdeacfbe1c01bcdc45b4ffaadb27278ea373bf6d2284"}},{"ruleId":"D1","level":"warning","message":{"text":"RestoreCheckService.buildRigRollup (cyclomatic 16): RestoreCheckService.buildRigRollup 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/restore-check-service.ts"},"region":{"startLine":1798}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c2c1b3a0df90ad14811c1466f01e31158c29742d359703c81679795f98ba167"}},{"ruleId":"D1","level":"warning","message":{"text":"fleet-compose.readHostComposedRig (cyclomatic 16): fleet-compose.readHostComposedRig 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/daemon/src/domain/review/fleet-compose.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e647e5fd81718d14a7f4f63da7f22d70cabe7d562c6c6c010a8a3935e9b8ff"}},{"ruleId":"D1","level":"warning","message":{"text":"RigLifecycleService.releaseRig::release (cyclomatic 16): RigLifecycleService.releaseRig::release 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/daemon/src/domain/rig-lifecycle-service.ts"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29c7de26276361d7333bc14f906f4ab625cc75a201e7152fb628375faa6a86e"}},{"ruleId":"D1","level":"warning","message":{"text":"SeatSwitchClientService.switchClient (cyclomatic 16): SeatSwitchClientService.switchClient 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/daemon/src/domain/seat-switch-client-service.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b27bce95737001d9e43a7334461562de48c4839899056b270d8849a5758690f"}},{"ruleId":"D1","level":"warning","message":{"text":"SliceDetailProjector.buildStory (cyclomatic 16): SliceDetailProjector.buildStory has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs 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":"packages/daemon/src/domain/slices/slice-detail-projector.ts"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"7feb26e642b31c8af76e93104b88a5bd2f7a7260165bb9d36e79810f99bdd71a"}},{"ruleId":"D1","level":"warning","message":{"text":"herdr-live-workspace.findLiveHerdrWorkspace (cyclomatic 16): herdr-live-workspace.findLiveHerdrWorkspace 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 5 function items inside it that branch (a function literal at line 123, a function literal at line 125, a function literal at line 120, \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/daemon/src/domain/terminal/herdr-live-workspace.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bcd8439a3cb35452c86aa2d1b638302e8fd248ac829ef77fcb551611cb3bb49"}},{"ruleId":"D1","level":"warning","message":{"text":"HerdrAdapter.reuseLiveWorkspace (cyclomatic 16): HerdrAdapter.reuseLiveWorkspace 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/daemon/src/domain/terminal/herdr-adapter.ts"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3955f8930a88a186a52fef04525fea1ea15a62f84b83597a6f3b51aaa12b063"}},{"ruleId":"D1","level":"warning","message":{"text":"HerdrAppProvider.endVerified (cyclomatic 16): HerdrAppProvider.endVerified 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, separate the cases: extract each independent branch into its own 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/daemon/src/domain/terminal/herdr-app-provider.ts"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"dacc9cde51a65a0f802321bb6878896726bd5ed245b08c583de8a5eb5076fe09"}},{"ruleId":"D1","level":"warning","message":{"text":"TerminalFollowing.constructor (cyclomatic 16): TerminalFollowing.constructor has cyclomatic complexity 16 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 4 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/daemon/src/domain/terminal/terminal-following.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d3c6733c6efa2429d4e581b51d20802cf77ecb0f2e58ef574ccdb856582849c"}},{"ruleId":"D1","level":"warning","message":{"text":"TerminalService.renderFollowing (cyclomatic 16): TerminalService.renderFollowing has cyclomatic complexity 16 (threshold 15). 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: 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/daemon/src/domain/terminal/terminal-service.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"68753f3fb4fd3b0868ece0d5cc811f5960b36ce23e4fc7c6cf4f2ae57ed4f63d"}},{"ruleId":"D1","level":"warning","message":{"text":"frontmatter-validator.validateWorkspaceFrontmatter (cyclomatic 16): frontmatter-validator.validateWorkspaceFrontmatter has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to one function item inside it that branches (walk). 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/daemon/src/domain/workspace/frontmatter-validator.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b37d11f540aff3840f5aa5d350a46e21e252c23161bfddc0fd32b20d77b4692"}},{"ruleId":"D1","level":"warning","message":{"text":"activity.recordPromptObservation (cyclomatic 16): activity.recordPromptObservation has cyclomatic complexity 16 (threshold 15). Of this number, 14 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/daemon/src/routes/activity.ts"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"682cc799a1a6b06d3d7846a9a684acfa5c4449a9e7d2360654fbc5b096e8e2c6"}},{"ruleId":"D1","level":"warning","message":{"text":"sessions.sessionAdminRoutes.post(\u0022/:sessionName/reconcile\u0022) (cyclomatic 16): sessions.sessionAdminRoutes.post(\u0022/:sessionName/reconcile\u0022) 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/daemon/src/routes/sessions.ts"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d0f4abdebba36da66ef0d30d6d1e46e32bf7be5cd7440d2ebc07b3007b769cd"}},{"ruleId":"D1","level":"warning","message":{"text":"network.networkRoutes (cyclomatic 16): network.networkRoutes 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 6 function items inside it that branch (a function literal at line 42, a function literal at line 62, a function literal at line 53, \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/daemon/src/routes/network.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ad6a360a15c4f36222a873d9bd4b2fad99e2e7689f8bb0e4a0ce0bae7c1952"}},{"ruleId":"D1","level":"warning","message":{"text":"mission-control.missionControlRoutes::errorResponse (cyclomatic 16): mission-control.missionControlRoutes::errorResponse 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/daemon/src/routes/mission-control.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc8e536bb9bc7c63077e3168be577897725795a8540b25fe7819dfb6da31a3f0"}},{"ruleId":"D1","level":"warning","message":{"text":"terminal.readFollowControls (cyclomatic 16): terminal.readFollowControls 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":"packages/daemon/src/routes/terminal.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"dabcf2879fd8a2e7bdd3844c4d7b0696bc6d7724fe983b60140d10c7d8b4e6ae"}},{"ruleId":"D1","level":"warning","message":{"text":"terminal.readOpenBody (cyclomatic 16): terminal.readOpenBody 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/daemon/src/routes/terminal.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"c730a8881d16add276bcfa5834ab16350d50fd176576c59b2d82ca27d140c12a"}},{"ruleId":"D1","level":"warning","message":{"text":"execution-model.stateWord (cyclomatic 16): execution-model.stateWord 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/tui/src/execution/execution-model.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"dea783457c152773eeb79ac5169c9a05162607ff9d036ca708db575a6c08e3a1"}},{"ruleId":"D1","level":"warning","message":{"text":"detail.wrapDetailLines (cyclomatic 16): detail.wrapDetailLines 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 2 function literals inside it that branch (lines 43, 39). 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/tui/src/detail.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f7a34501d0d7a33bbec1de4ee24ef67597f88c63c650f4595dec3abab08fdc"}},{"ruleId":"D1","level":"warning","message":{"text":"stylize.paintContent (cyclomatic 16): stylize.paintContent 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/tui/src/stylize.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49b3cb03737ad226ce01fd419f1c49bb07198956b4976812f4d47828dc4cea5"}},{"ruleId":"D1","level":"warning","message":{"text":"useActivityFeed.eventColor (cyclomatic 16): useActivityFeed.eventColor 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/ui/src/hooks/useActivityFeed.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"60fccec0a27d147575be6daecd5ab59472832f98195f538c09b81472abf5a182"}},{"ruleId":"D1","level":"warning","message":{"text":"HotPotatoEdge.HotPotatoEdge (cyclomatic 16): HotPotatoEdge.HotPotatoEdge 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/ui/src/components/topology/HotPotatoEdge.tsx"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"8288268fd5ee4adcedb83618a38148f4295ca92abfc4ea675bfe4c25fc288342"}},{"ruleId":"D1","level":"warning","message":{"text":"LaunchRecoveryModal.LaunchRecoveryModal (cyclomatic 16): LaunchRecoveryModal.LaunchRecoveryModal has cyclomatic complexity 16 (threshold 15). Of this number, 12 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/ui/src/components/LaunchRecoveryModal.tsx"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"612cb367d2dd9e83aefe22d99eb73481e25da39abd862bdbc0249cc2d2eb388d"}},{"ruleId":"D1","level":"warning","message":{"text":"HostMultiRigGraph.HostMultiRigGraph (cyclomatic 16): HostMultiRigGraph.HostMultiRigGraph has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to 5 function items inside it that branch (onNodeClick, a function literal at line 134, a function literal at line 272, \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/ui/src/components/topology/HostMultiRigGraph.tsx"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"3846cba224c67cd720d7ffa5446e558e2160f13f3d168620e632a78fb4a48e25"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentsBandView.AgentsBandView (cyclomatic 16): AgentsBandView.AgentsBandView has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 3 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/ui/src/components/review/AgentsBandView.tsx"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a5c34fc98ab560938d00dbd841296a32ac39544a630daeeff8e63cf2f8ce22d"}},{"ruleId":"D1","level":"warning","message":{"text":"MissionReviewTab.MissionReviewTab (cyclomatic 16): MissionReviewTab.MissionReviewTab has cyclomatic complexity 16 (threshold 15). Of this number, 10 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":"packages/ui/src/components/review/MissionReviewTab.tsx"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b5440c980e673c22444839017cc6ccc76ead9fd138143e666664e8c1efca7d"}},{"ruleId":"D1","level":"warning","message":{"text":"DocsTab.DocsTab (cyclomatic 16): DocsTab.DocsTab has cyclomatic complexity 16 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 4 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/ui/src/components/slices/tabs/DocsTab.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a9adc2fa18d732f72da3dae05454869881304ecce3155d26f7a4d11e663450"}},{"ruleId":"D1","level":"warning","message":{"text":"graph-layout.layoutSingleColumn (cyclomatic 16): graph-layout.layoutSingleColumn has cyclomatic complexity 16 (threshold 15). Of this number, 8 points are the body\u0027s own statements and 8 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/ui/src/lib/graph-layout.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa01bb8327a54f45a63e585bf205134db4a247f882db7580c65e8f4dd7e19a0"}},{"ruleId":"D1","level":"warning","message":{"text":"compose.blocking_state (cyclomatic 16): compose.blocking_state 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/daemon/assets/plugins/openrig-core/skills/openrig-operating-model/scripts/compose.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"e65c7e8d94e297f1e7ef0fd376abd7b2abbda806670495b69f9d57f6569f3b60"}},{"ruleId":"D1","level":"warning","message":{"text":"trace-to-root.intent (cyclomatic 16): trace-to-root.intent 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/daemon/assets/plugins/openrig-core/skills/refocusing/scripts/trace-to-root.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f690c78274d0437cf69403123b33281618922fd7582ba487331218660ff4e87"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp-server.createMcpServer (cognitive 913): mcp-server.createMcpServer has cognitive complexity 913 (threshold 15). Drivers by points: if/else 223 (419 pts), ternaries 128 (282 pts), boolean chains 107, error handling 45 (96 pts), loops 4 (9 pts) (nesting depth added 406). Of this number, 48 points are the body\u0027s own statements and 865 belong to 73 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/mcp-server.ts"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb497c2c983605a3e1f47f49f976daf07cde923c2e02ada312652aeb7763183"}},{"ruleId":"D2","level":"warning","message":{"text":"queue.queueRoutes::errorResponse (cognitive 770): queue.queueRoutes::errorResponse has cognitive complexity 770 (threshold 15). Drivers by points: ternaries 44 (768 pts), if/else 2 (nesting depth added 724). 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. This shape REPEATS in the file: one other method here (queue.queueRoutes::crossHostHandoff) 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/daemon/src/routes/queue.ts"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a3e4a3c7b921982228e41cff6a55b723c527be73fb2146f6b8b9958a1af1c89"}},{"ruleId":"D2","level":"warning","message":{"text":"bundle-behaviour.describeBundleBehaviour (cognitive 577): bundle-behaviour.describeBundleBehaviour has cognitive complexity 577 (threshold 15). Drivers by points: ternaries 64 (306 pts), if/else 62 (167 pts), loops 20 (48 pts), boolean chains 46, error handling 4 (10 pts) (nesting depth added 381). Of this number, 499 points are the body\u0027s own statements and 78 belong to 16 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/daemon/src/domain/bundle-behaviour.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2619705ae471e9543903d32e77e493c423d069195b869f72d801c4a4f97192b"}},{"ruleId":"D2","level":"warning","message":{"text":"render.contentLines (cognitive 505): render.contentLines has cognitive complexity 505 (threshold 15). Drivers by points: ternaries 66 (221 pts), if/else 89 (208 pts), boolean chains 40, loops 8 (31 pts), error handling 1 (5 pts) (nesting depth added 301). Of this number, 474 points are the body\u0027s own statements and 31 belong to 12 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/tui/src/render.ts"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"b04df31c2c3d5b1e1eb23cc530a0704336554b80ab9bd88280e031df3e1ba6ba"}},{"ruleId":"D2","level":"warning","message":{"text":"up.upCommand (cognitive 428): up.upCommand has cognitive complexity 428 (threshold 15). Drivers by points: if/else 105 (191 pts), ternaries 35 (103 pts), loops 25 (69 pts), boolean chains 49, error handling 9 (16 pts) (nesting depth added 205). None of this is in the body itself: all 428 points belong to 9 function literals inside it that branch (lines 154, 380, 365, \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/commands/up.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f4cd77f76aa22f0bfb51f0e69ea54783109e7ffebb81ee6c036d54374b0149"}},{"ruleId":"D2","level":"warning","message":{"text":"StartupOrchestrator.startNodeWithWarnings (cognitive 427): StartupOrchestrator.startNodeWithWarnings has cognitive complexity 427 (threshold 15). Drivers by points: if/else 101 (201 pts), ternaries 43 (87 pts), boolean chains 61, error handling 22 (54 pts), loops 10 (24 pts) (nesting depth added 190). Of this number, 406 points are the body\u0027s own statements and 21 belong to 11 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/daemon/src/domain/startup-orchestrator.ts"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeab1e9d10904071cb811189fd3a224f6deb99cd01f4857c9939f4de1bd1b781"}},{"ruleId":"D2","level":"warning","message":{"text":"queue-wake-ladder.advancePromptRefusals (cognitive 388): queue-wake-ladder.advancePromptRefusals has cognitive complexity 388 (threshold 15). Drivers by points: if/else 95 (244 pts), boolean chains 62, ternaries 16 (49 pts), loops 14 (27 pts), error handling 4 (6 pts) (nesting depth added 197). Of this number, 359 points are the body\u0027s own statements and 29 belong to 14 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/daemon/src/domain/queue-wake-ladder.ts"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8363c140bbd9ccb5aec0dcb930c95e1c8f97274ca7aebfe6aef6f97b7f22933"}},{"ruleId":"D2","level":"warning","message":{"text":"RestoreOrchestrator.postLaunchRestore (cognitive 382): RestoreOrchestrator.postLaunchRestore has cognitive complexity 382 (threshold 15). Drivers by points: if/else 73 (195 pts), ternaries 39 (133 pts), boolean chains 62, error handling 8 (27 pts), loops 4 (12 pts) (nesting depth added 243). 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. This shape REPEATS in the file: one other method here (RestoreOrchestrator.postLaunchRestore::effortForRestore) 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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":1947}}}],"partialFingerprints":{"codehealthFindingId/v1":"898098cca3c618cf89cf73cf2de1e7e30fad6bbdf5b8484b0cb1d9f8011cb406"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionTransport.sendUnguarded (cognitive 362): SessionTransport.sendUnguarded has cognitive complexity 362 (threshold 15). Drivers by points: if/else 93 (156 pts), ternaries 65 (131 pts), boolean chains 57, error handling 12 (18 pts) (nesting depth added 135). Of this number, 278 points are the body\u0027s own statements and 84 belong to 23 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":3444}}}],"partialFingerprints":{"codehealthFindingId/v1":"e601b0be7337da80c845063a8c36bb5645bfde956cad4976aa2440ea694fbd56"}},{"ruleId":"D2","level":"warning","message":{"text":"queue.queueCommand (cognitive 321): queue.queueCommand has cognitive complexity 321 (threshold 15). Drivers by points: if/else 140 (172 pts), ternaries 56 (83 pts), boolean chains 40, error handling 11 (19 pts), loops 5, match/switch 1 (2 pts) (nesting depth added 68). None of this is in the body itself: all 321 points belong to 40 function literals inside it that branch (lines 1458, 1336, 2381, \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/commands/queue.ts"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad76cf949e1f2ca53e140f97c8ed1091c10ae69bc55dff6de2e835dc7e8f097a"}},{"ruleId":"D2","level":"warning","message":{"text":"workflow.workflowRoutes::errorResponse (cognitive 314): workflow.workflowRoutes::errorResponse has cognitive complexity 314 (threshold 15). Drivers by points: ternaries 33 (289 pts), boolean chains 18, if/else 7 (nesting depth added 256). 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/daemon/src/routes/workflow.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f195faba9b47fc84ef02c3dd2a33cf285852af4a6b4ef783253da213413c084"}},{"ruleId":"D2","level":"warning","message":{"text":"context.contextCommand (cognitive 312): context.contextCommand has cognitive complexity 312 (threshold 15). Drivers by points: if/else 111 (172 pts), ternaries 32 (65 pts), loops 25 (45 pts), error handling 15 (17 pts), boolean chains 13 (nesting depth added 116). Most of this is not in the body itself: 3 of the 312 points are its own statements and the rest belongs to 18 function items inside it that branch (a function literal at line 276, a function literal at line 892, a function literal at line 723, \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/commands/context.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1d718d0e2c478e881215da259fd729ea77ac06489ab566f1f7cbc3d40f08ac"}},{"ruleId":"D2","level":"warning","message":{"text":"queue-stuck-sweep.runStuckSweep (cognitive 308): queue-stuck-sweep.runStuckSweep has cognitive complexity 308 (threshold 15). Drivers by points: if/else 148 (273 pts), boolean chains 121, ternaries 63 (121 pts), loops 21 (27 pts), error handling 12 (20 pts), match/switch 1 (nesting depth added 197). To reduce it, split the body into named stages: move each independent 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: 4 other methods here (queue-stuck-sweep.runStuckSweep::undeliveredCandidate, queue-stuck-sweep.runStuckSweep::unclaimedCandidate, queue-stuck-sweep.runStuckSweep::custodyCandidate, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 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/daemon/src/domain/queue-stuck-sweep.ts"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf4bd10cf0f3765a5fa7c73181991ea4f6e3c2ea754c0116191ae952b1d38f1"}},{"ruleId":"D2","level":"warning","message":{"text":"attention.attentionRoutes (cognitive 296): attention.attentionRoutes has cognitive complexity 296 (threshold 15). Drivers by points: ternaries 54 (152 pts), if/else 30 (62 pts), boolean chains 44, error handling 9 (20 pts), loops 8 (18 pts) (nesting depth added 151). None of this is in the body itself: all 296 points belong to 24 function literals inside it that branch (lines 21, 117, 148, \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/daemon/src/routes/attention.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"4455e5780f6fa88fd676d898f2d80238360797e4b47b2b4d2eb5408cc491bc12"}},{"ruleId":"D2","level":"warning","message":{"text":"hydrate.hydrateSnapshot (cognitive 277): hydrate.hydrateSnapshot has cognitive complexity 277 (threshold 15). Drivers by points: ternaries 93 (144 pts), boolean chains 66, if/else 34 (53 pts), loops 5 (9 pts), error handling 3 (5 pts) (nesting depth added 76). Of this number, 227 points are the body\u0027s own statements and 50 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":"packages/tui/src/hydrate.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"be4802d1ae7ad144a30f6a87abea1a3e84c37c2592030e42e21be1c82e3391c3"}},{"ruleId":"D2","level":"warning","message":{"text":"start.startCommand (cognitive 261): start.startCommand has cognitive complexity 261 (threshold 15). Drivers by points: if/else 70 (142 pts), ternaries 19 (55 pts), loops 11 (32 pts), error handling 8 (17 pts), boolean chains 15 (nesting depth added 138). None of this is in the body itself: all 261 points belong to one function literal inside it that branches (line 210). 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/commands/start.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"1484b18ecf9c4a2ef95a93e693497df6a618fb468849e2d7655239662f716c34"}},{"ruleId":"D2","level":"warning","message":{"text":"agent-manifest.validateAgentSpec (cognitive 254): agent-manifest.validateAgentSpec has cognitive complexity 254 (threshold 15). Drivers by points: if/else 47 (176 pts), boolean chains 39, loops 8 (32 pts), ternaries 2 (7 pts) (nesting depth added 158). Of this number, 239 points are the body\u0027s own statements and 15 belong to 2 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/daemon/src/domain/agent-manifest.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b1a9dfe017f8a14b73ce6687fffe39fd4c807bd644c3b1d7fb8ee86b5b48a3"}},{"ruleId":"D2","level":"warning","message":{"text":"activity.postHook (cognitive 230): activity.postHook has cognitive complexity 230 (threshold 15). Drivers by points: if/else 57 (110 pts), boolean chains 50, ternaries 18 (50 pts), error handling 8 (20 pts) (nesting depth added 97). Of this number, 218 points are the body\u0027s own statements and 12 belong to 2 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/daemon/src/routes/activity.ts"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8bbc77f7ba843bc2536c039f0d836866df731354723f27e429b08b94dae9d71"}},{"ruleId":"D2","level":"warning","message":{"text":"main.run::handleInput (cognitive 229): main.run::handleInput has cognitive complexity 229 (threshold 15). Drivers by points: if/else 66 (178 pts), boolean chains 33, ternaries 3 (14 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 125). 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. This shape REPEATS in the file: 3 other methods here (main.run, main.run::draw, main.run::executeAct) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 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/tui/src/main.ts"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"b669ae8f835e4cd77b88315b17f5de131c8fdfec2c9f5bc92dc81ba45645653a"}},{"ruleId":"D2","level":"warning","message":{"text":"queue-wake-ladder.runWakeLadderTick (cognitive 219): queue-wake-ladder.runWakeLadderTick has cognitive complexity 219 (threshold 15). Drivers by points: if/else 48 (128 pts), ternaries 13 (36 pts), boolean chains 29, loops 10 (22 pts), error handling 3 (4 pts) (nesting depth added 116). Of this number, 212 points are the body\u0027s own statements and 7 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":"packages/daemon/src/domain/queue-wake-ladder.ts"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"d395986e607af5146ca04341a72f5c50e433c92b6338a0f83a46feb180f79356"}},{"ruleId":"D2","level":"warning","message":{"text":"gateway.gatewayCommand (cognitive 204): gateway.gatewayCommand has cognitive complexity 204 (threshold 15). Drivers by points: if/else 68 (84 pts), ternaries 57 (83 pts), loops 17 (20 pts), boolean chains 14, error handling 2 (3 pts) (nesting depth added 46). None of this is in the body itself: all 204 points belong to 33 function items inside it that branch (a function literal at line 579, a function literal at line 759, a function literal at line 192, \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/commands/gateway.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c3182a0ab16f19b0d92846fdee1cad7d7bf79d10df27eb6643edec9cb57cef"}},{"ruleId":"D2","level":"warning","message":{"text":"package-manifest.validateManifest (cognitive 200): package-manifest.validateManifest has cognitive complexity 200 (threshold 15). Drivers by points: if/else 49 (141 pts), loops 11 (40 pts), boolean chains 19 (nesting depth added 121). 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/daemon/src/domain/package-manifest.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3f76c0207f7d3c4a832b9da7fc8914f0acb8eca3c28d17959e44baa154faf6"}},{"ruleId":"D2","level":"warning","message":{"text":"slack.slackCommand (cognitive 198): slack.slackCommand has cognitive complexity 198 (threshold 15). Drivers by points: if/else 49 (86 pts), ternaries 29 (66 pts), loops 13 (26 pts), boolean chains 12, error handling 8 (nesting depth added 87). None of this is in the body itself: all 198 points belong to 16 function items inside it that branch (a function literal at line 241, a function literal at line 381, a function literal at line 355, \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/commands/slack.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea309a0c6b5d1c56734a4dc9e1ea82334e411d4f1feb22fc3d69bb6256305fc4"}},{"ruleId":"D2","level":"warning","message":{"text":"FeedCardQuestionAsk.FeedCardQuestionAsk (cognitive 198): FeedCardQuestionAsk.FeedCardQuestionAsk has cognitive complexity 198 (threshold 15). Drivers by points: ternaries 54 (112 pts), boolean chains 46, if/else 30 (37 pts), error handling 2, loops 1 (nesting depth added 65). Of this number, 86 points are the body\u0027s own statements and 112 belong to 20 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/ui/src/components/for-you/FeedCardQuestionAsk.tsx"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"debebfdfd565da57cf1c9043988d9f29d269a1368083b54b696dcfea33691464"}},{"ruleId":"D2","level":"warning","message":{"text":"watchdog.watchdogRoutes::errorResponse (cognitive 191): watchdog.watchdogRoutes::errorResponse has cognitive complexity 191 (threshold 15). Drivers by points: ternaries 19 (190 pts), if/else 1 (nesting depth added 171). 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/daemon/src/routes/watchdog.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"a092ca42337b3347321c168bfeaab2bb0f742daca55aafb2ec6a0127d0a4a591"}},{"ruleId":"D2","level":"warning","message":{"text":"launch.launchCommand (cognitive 190): launch.launchCommand has cognitive complexity 190 (threshold 15). Drivers by points: if/else 64 (113 pts), ternaries 14 (36 pts), boolean chains 23, loops 6 (13 pts), error handling 2 (5 pts) (nesting depth added 81). None of this is in the body itself: all 190 points belong to 7 function items inside it that branch (a function literal at line 93, a function literal at line 249, a function literal at line 273, \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/commands/launch.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b7802e65a8333ea6312542c8518ea357a153a07a4ada4963fc771ddcbd827f"}},{"ruleId":"D2","level":"warning","message":{"text":"walk.walkCommand (cognitive 187): walk.walkCommand has cognitive complexity 187 (threshold 15). Drivers by points: if/else 61 (136 pts), ternaries 9 (22 pts), boolean chains 12, error handling 4 (9 pts), loops 4 (8 pts) (nesting depth added 97). None of this is in the body itself: all 187 points belong to 7 function items inside it that branch (a function literal at line 96, a function literal at line 263, resolveProfilePieces, \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/commands/walk.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e5f4f7ed82fb4b10079c234cc43e70a3b98807ab3827743ef8d321867115ae"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionTransport.sendClassifiedInput (cognitive 182): SessionTransport.sendClassifiedInput has cognitive complexity 182 (threshold 15). Drivers by points: if/else 49 (86 pts), ternaries 22 (50 pts), boolean chains 35, error handling 3 (7 pts), loops 3 (4 pts) (nesting depth added 70). Of this number, 85 points are the body\u0027s own statements and 97 belong to 5 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":3046}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de8a58e767317e33a5e4a4bf50a8b1c43f1cd0d7ddc45f210a0fb0374bdcfc5"}},{"ruleId":"D2","level":"warning","message":{"text":"input.parseText (cognitive 182): input.parseText has cognitive complexity 182 (threshold 15). Drivers by points: if/else 26 (86 pts), ternaries 15 (80 pts), boolean chains 15, loops 1 (nesting depth added 125). 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/tui/src/input.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"6293ad36a1923146a1c2cf2baf4fc21353b820355a71ae6435c4e829bb3b9176"}},{"ruleId":"D2","level":"warning","message":{"text":"SeatHandoverService.handover (cognitive 180): SeatHandoverService.handover has cognitive complexity 180 (threshold 15). Drivers by points: if/else 50 (79 pts), ternaries 33 (70 pts), boolean chains 23, error handling 4 (6 pts), match/switch 1 (2 pts) (nesting depth added 69). Of this number, 172 points are the body\u0027s own statements and 8 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/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7501e71d2d1030532145598cf33dc61a29b3b7a46bb60aa8d0936ce16cd19d"}},{"ruleId":"D2","level":"warning","message":{"text":"terminal-window.openTerminalWindow (cognitive 179): terminal-window.openTerminalWindow has cognitive complexity 179 (threshold 15). Drivers by points: if/else 53 (94 pts), ternaries 37 (72 pts), boolean chains 41, loops 5 (9 pts), error handling 4 (8 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. This shape REPEATS in the file: one other method here (terminal-window.openTerminalWindow::measureWindow) 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/terminal-window.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d58d60c824de0c89f17ee07104638cf7962ee7c75451279afe1592c048d123"}},{"ruleId":"D2","level":"warning","message":{"text":"RestoreOrchestrator.restoreNodeWithCompensation (cognitive 178): RestoreOrchestrator.restoreNodeWithCompensation has cognitive complexity 178 (threshold 15). Drivers by points: if/else 53 (95 pts), ternaries 28 (35 pts), boolean chains 32, loops 3 (9 pts), error handling 2 (7 pts) (nesting depth added 60). Of this number, 175 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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"80732fa8ca650f5ae9cfe584bcd7891b128d99b43123d9b5e4539f266b23836f"}},{"ruleId":"D2","level":"warning","message":{"text":"context-packs.contextPacksRoutes (cognitive 177): context-packs.contextPacksRoutes has cognitive complexity 177 (threshold 15). Drivers by points: if/else 63 (95 pts), ternaries 17 (43 pts), boolean chains 24, error handling 12 (13 pts), loops 2 (nesting depth added 59). None of this is in the body itself: all 177 points belong to 16 function items inside it that branch (a function literal at line 351, a function literal at line 99, a function literal at line 166, \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/daemon/src/routes/context-packs.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad19e149bee7041e0f1d839c914da8c2f96f0e35caea9caf066dff093767988"}},{"ruleId":"D2","level":"warning","message":{"text":"LegacyRigSpecSchema.validate (cognitive 170): LegacyRigSpecSchema.validate has cognitive complexity 170 (threshold 15). Drivers by points: if/else 42 (114 pts), error handling 7 (28 pts), boolean chains 20, loops 2 (4 pts), ternaries 2 (4 pts) (nesting depth added 97). 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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":1399}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a992dc086405cfdb8d79c6e67790b258435f201c0455f274090697fb553a827"}},{"ruleId":"D2","level":"warning","message":{"text":"finite-telemetry.readTelemetryPage (cognitive 170): finite-telemetry.readTelemetryPage has cognitive complexity 170 (threshold 15). Drivers by points: if/else 36 (64 pts), ternaries 29 (53 pts), boolean chains 42, loops 4 (11 pts) (nesting depth added 59). Of this number, 26 points are the body\u0027s own statements and 144 belong to 7 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/daemon/src/domain/finite-telemetry.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"df74cb937bfa9f794ccb1766958a67837556896438c48943bb877c6451979482"}},{"ruleId":"D2","level":"warning","message":{"text":"HerdrFollowView.apply (cognitive 170): HerdrFollowView.apply has cognitive complexity 170 (threshold 15). Drivers by points: if/else 59 (102 pts), boolean chains 22, ternaries 13 (22 pts), loops 13 (14 pts), error handling 6 (10 pts) (nesting depth added 57). Of this number, 133 points are the body\u0027s own statements and 37 belong to 13 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/daemon/src/domain/terminal/herdr-follow-view.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6128741aed193f60acf627be9835717c2e70d46a1c9cd2a000e4db434a5c70"}},{"ruleId":"D2","level":"warning","message":{"text":"state.computeExplorerRows (cognitive 170): state.computeExplorerRows has cognitive complexity 170 (threshold 15). Drivers by points: if/else 20 (61 pts), ternaries 13 (58 pts), loops 11 (43 pts), boolean chains 8 (nesting depth added 118). Of this number, 169 points are the body\u0027s own statements and 1 belongs 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/tui/src/state.ts"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c40395dc88bc48576f98f34160c5b77b278b9c07499711f9b488b066c16965d"}},{"ruleId":"D2","level":"warning","message":{"text":"startup.applySelectedHistory (cognitive 154): startup.applySelectedHistory has cognitive complexity 154 (threshold 15). Drivers by points: ternaries 38 (75 pts), if/else 32 (42 pts), boolean chains 32, error handling 3 (4 pts), loops 1 (nesting depth added 48). Most of this is not in the body itself: 11 of the 154 points are its own statements and the rest belongs to 8 function literals inside it that branch (lines 397, 495, 402, \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/daemon/src/routes/startup.ts"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb7b0f543564aacf61034e80f8e7a62768ab4b31da8869e7e0aaadda443db06b"}},{"ruleId":"D2","level":"warning","message":{"text":"provider.providerRoutes (cognitive 154): provider.providerRoutes has cognitive complexity 154 (threshold 15). Drivers by points: if/else 51 (57 pts), boolean chains 50, ternaries 29 (40 pts), error handling 5, loops 2 (nesting depth added 17). Most of this is not in the body itself: 2 of the 154 points are its own statements and the rest belongs to 22 function items inside it that branch (a function literal at line 366, a function literal at line 264, a function literal at line 188, \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/daemon/src/routes/provider.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c334583a9d7cb7ea954b59cba34abf0ce51b3cd5dd3fe66b8920202cf312e11"}},{"ruleId":"D2","level":"warning","message":{"text":"QueueRepository.updateInTransactionalContext (cognitive 150): QueueRepository.updateInTransactionalContext has cognitive complexity 150 (threshold 15). Drivers by points: if/else 50 (74 pts), boolean chains 49, ternaries 15 (27 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":"packages/daemon/src/domain/queue-repository.ts"},"region":{"startLine":3628}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc8d2473769b092af0a4e483bb174c2adfa8c7d504f4863846cd7b4a24b2a78d"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerCore.handleResponse (cognitive 148): RunnerCore.handleResponse has cognitive complexity 148 (threshold 15). Drivers by points: if/else 43 (89 pts), ternaries 15 (37 pts), boolean chains 22 (nesting depth added 68). 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"cadfef91be31b40cc4b2801d781eabcdcb17632d6de3ac6431e2fece3c16b32a"}},{"ruleId":"D2","level":"warning","message":{"text":"host.hostCommand (cognitive 147): host.hostCommand has cognitive complexity 147 (threshold 15). Drivers by points: if/else 61 (76 pts), ternaries 19 (44 pts), boolean chains 12, error handling 8 (10 pts), loops 5 (nesting depth added 42). Most of this is not in the body itself: 3 of the 147 points are its own statements and the rest belongs to 11 function literals inside it that branch (lines 766, 603, 706, \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/commands/host.ts"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"379812870933338574c6eeb8dc67783af9fa51da9fb5bc01cfaee747b88770bd"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerCore.handleEvent (cognitive 147): RunnerCore.handleEvent has cognitive complexity 147 (threshold 15). Drivers by points: if/else 49 (77 pts), boolean chains 42, ternaries 11 (27 pts), loops 1 (nesting depth added 44). Of this number, 143 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":1594}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af835a06df7e7e4dbc4c4ca0920bbb0fa4cf44498904e472a725c214a31ccdc"}},{"ruleId":"D2","level":"warning","message":{"text":"PodRigInstantiator.launchExistingAgentMember (cognitive 147): PodRigInstantiator.launchExistingAgentMember has cognitive complexity 147 (threshold 15). Drivers by points: ternaries 35 (60 pts), if/else 35 (47 pts), boolean chains 24, error handling 6 (11 pts), loops 2 (5 pts) (nesting depth added 45). Of this number, 132 points are the body\u0027s own statements and 15 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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":2477}}}],"partialFingerprints":{"codehealthFindingId/v1":"794f273792a510748202b63f7cda13fbfbb6078a5fcd205dd6ef2a2d5c2cda35"}},{"ruleId":"D2","level":"warning","message":{"text":"parked-owner-consumer.makeParkedOwnerConsumerPolicy.evaluate (cognitive 144): parked-owner-consumer.makeParkedOwnerConsumerPolicy.evaluate has cognitive complexity 144 (threshold 15). Drivers by points: if/else 26 (52 pts), boolean chains 31, ternaries 11 (30 pts), error handling 9 (22 pts), loops 4 (9 pts) (nesting depth added 63). Of this number, 136 points are the body\u0027s own statements and 8 belong to 8 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/daemon/src/domain/policies/parked-owner-consumer.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84351b72feba0d95821f236f52cc3de33ba64d69530267c51bfdb584735319a"}},{"ruleId":"D2","level":"warning","message":{"text":"PassiveCeremonySource.read (cognitive 144): PassiveCeremonySource.read has cognitive complexity 144 (threshold 15). Drivers by points: if/else 31 (82 pts), ternaries 11 (35 pts), boolean chains 13, loops 6 (10 pts), error handling 1 (4 pts) (nesting depth added 82). Of this number, 137 points are the body\u0027s own statements and 7 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/daemon/src/domain/health-passive-ceremony.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"4862113aef5a35f86678267d7c10b09bf48a35853409ebbe7f9c2a60e3267950"}},{"ruleId":"D2","level":"warning","message":{"text":"seat.printHuman (cognitive 143): seat.printHuman has cognitive complexity 143 (threshold 15). Drivers by points: if/else 45 (71 pts), ternaries 23 (54 pts), loops 6 (14 pts), boolean chains 4 (nesting depth added 65). Of this number, 135 points are the body\u0027s own statements and 8 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/commands/seat.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"501bf69aeee2741590d2e502161930f9044a9919957dcbea4ce3f67c74f97f7b"}},{"ruleId":"D2","level":"warning","message":{"text":"startup.createDaemon (cognitive 143): startup.createDaemon has cognitive complexity 143 (threshold 15). Drivers by points: if/else 78 (104 pts), ternaries 61 (99 pts), error handling 43 (57 pts), boolean chains 55, loops 17 (22 pts) (nesting depth added 83). To reduce it, split the body into named stages: move each independent 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 (startup.createDaemon::topologyDestinationAdvisory) 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/daemon/src/startup.ts"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3cb6046707e854c8e96a22f11d3c3c0890634c9b166c66c86d5f392b9a84f5"}},{"ruleId":"D2","level":"warning","message":{"text":"render.renderBody (cognitive 143): render.renderBody has cognitive complexity 143 (threshold 15). Drivers by points: ternaries 44 (77 pts), if/else 23 (38 pts), boolean chains 22, loops 4 (6 pts) (nesting depth added 50). Of this number, 139 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/tui/src/render.ts"},"region":{"startLine":1925}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c923f7ca4c193fc33a55a3f6e6045724c3f8ac99f3934434fd78f024628aa6"}},{"ruleId":"D2","level":"warning","message":{"text":"scope-audit.classifyScopeItem (cognitive 141): scope-audit.classifyScopeItem has cognitive complexity 141 (threshold 15). Drivers by points: if/else 30 (64 pts), ternaries 17 (54 pts), boolean chains 19, error handling 1 (2 pts), loops 1 (2 pts) (nesting depth added 73). Of this number, 125 points are the body\u0027s own statements and 16 belong to one function item 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/daemon/src/domain/scope/scope-audit.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d4dd27bbc8365267c5a79839fc65a67e9dedcb46d94a01ec6d5863ce7fcd37"}},{"ruleId":"D2","level":"warning","message":{"text":"scope-audit.classifyScopeItem (cognitive 141): scope-audit.classifyScopeItem has cognitive complexity 141 (threshold 15). Drivers by points: if/else 30 (64 pts), ternaries 17 (54 pts), boolean chains 19, error handling 1 (2 pts), loops 1 (2 pts) (nesting depth added 73). Of this number, 125 points are the body\u0027s own statements and 16 belong to one function item 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/lib/scope/scope-audit.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ca4bb3895a4193b6b2c584421882b39594a954a76febb54b6dec2a49db8a1a"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkflowValidator.validate (cognitive 141): WorkflowValidator.validate has cognitive complexity 141 (threshold 15). Drivers by points: if/else 50 (86 pts), loops 12 (21 pts), boolean chains 19, ternaries 7 (15 pts) (nesting depth added 53). Of this number, 47 points are the body\u0027s own statements and 94 belong to 11 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/daemon/src/domain/workflow-validator.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49691d12438023c7c16cbbee9199e2b1676232801ab0125739be68998d35eb7"}},{"ruleId":"D2","level":"warning","message":{"text":"slack-subsystem.buildSlackGatewayWire.engineDeliver (cognitive 141): slack-subsystem.buildSlackGatewayWire.engineDeliver has cognitive complexity 141 (threshold 15). Drivers by points: if/else 34 (64 pts), ternaries 19 (49 pts), boolean chains 20, error handling 4 (8 pts) (nesting depth added 64). Of this number, 140 points are the body\u0027s own statements and 1 belongs 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/daemon/src/domain/gateway/slack/slack-subsystem.ts"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f537df2706d58026e5ec7d87d22551abf3ab0aaa8f9a2b7b68c1c5b6d72a82"}},{"ruleId":"D2","level":"warning","message":{"text":"bundle.bundleCommand (cognitive 140): bundle.bundleCommand has cognitive complexity 140 (threshold 15). Drivers by points: if/else 62 (83 pts), ternaries 18 (26 pts), loops 11 (15 pts), error handling 6 (10 pts), boolean chains 6 (nesting depth added 37). None of this is in the body itself: all 140 points belong to 7 function items inside it that branch (a function literal at line 93, a function literal at line 286, a function literal at line 221, \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/commands/bundle.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d92d77dc0ba09c1bfc61fd2c1ec528c02a419dbe5196aaed0d5f032b498eba7"}},{"ruleId":"D2","level":"warning","message":{"text":"proof.proofCommand (cognitive 138): proof.proofCommand has cognitive complexity 138 (threshold 15). Drivers by points: if/else 45 (67 pts), ternaries 28 (39 pts), boolean chains 15, loops 6 (11 pts), error handling 5 (6 pts) (nesting depth added 39). None of this is in the body itself: all 138 points belong to 10 function items inside it that branch (a function literal at line 247, a function literal at line 206, a function literal at line 188, \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/commands/proof.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d0e185c152d28360ceed15016cb73a266e8f7bc64a930de5192c51de6f21ea"}},{"ruleId":"D2","level":"warning","message":{"text":"settings-browser.settingsBrowser (cognitive 135): settings-browser.settingsBrowser has cognitive complexity 135 (threshold 15). Drivers by points: ternaries 37 (81 pts), if/else 14 (23 pts), loops 9 (14 pts), boolean chains 13, error handling 3 (4 pts) (nesting depth added 59). Of this number, 73 points are the body\u0027s own statements and 62 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":"packages/daemon/src/domain/user-settings/settings-browser.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"892e1d052d965c515af34b740183fc7a4de8cff8f440f35ac7b13be129bdff77"}},{"ruleId":"D2","level":"warning","message":{"text":"attention-model.attentionLines (cognitive 135): attention-model.attentionLines has cognitive complexity 135 (threshold 15). Drivers by points: if/else 24 (60 pts), ternaries 11 (46 pts), loops 5 (19 pts), boolean chains 10 (nesting depth added 85). Of this number, 133 points are the body\u0027s own statements and 2 belong to 2 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/tui/src/attention/attention-model.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a0a57128cc50331d2de58f01a6f49e5a93a70d39f92bdebfd1832c63a8f7318"}},{"ruleId":"D2","level":"warning","message":{"text":"manifest-parser.parseAtoms (cognitive 134): manifest-parser.parseAtoms has cognitive complexity 134 (threshold 15). Drivers by points: if/else 30 (77 pts), ternaries 7 (19 pts), loops 8 (16 pts), boolean chains 13, error handling 3 (9 pts) (nesting depth added 73). To reduce it, split the body into named stages: move each independent step or branch into 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/daemon/src/domain/context-packs/manifest-parser.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb1e7c4290177355dac608d5ffa323a5fccc9cac43929bebb9433fa8bc342be"}},{"ruleId":"D2","level":"warning","message":{"text":"slack-subsystem.buildSlackGatewayWire (cognitive 134): slack-subsystem.buildSlackGatewayWire has cognitive complexity 134 (threshold 15). Drivers by points: if/else 32 (60 pts), ternaries 18 (30 pts), boolean chains 23, error handling 6 (13 pts), loops 3 (8 pts) (nesting depth added 52). Of this number, 44 points are the body\u0027s own statements and 90 belong to 17 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/daemon/src/domain/gateway/slack/slack-subsystem.ts"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"df62154fec96d4067facffd60962d7379e4246d33d50be9b7cf871bb513c6406"}},{"ruleId":"D2","level":"warning","message":{"text":"RestoreOrchestrator.attemptResume (cognitive 133): RestoreOrchestrator.attemptResume has cognitive complexity 133 (threshold 15). Drivers by points: if/else 26 (56 pts), ternaries 25 (56 pts), boolean chains 10, loops 4 (10 pts), error handling 1 (nesting depth added 67). 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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":2790}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e23935d99555e2be212b37ae673d1bda72f16327d4dfcf5b6382ea2cfee2377"}},{"ruleId":"D2","level":"warning","message":{"text":"gateway.gatewayRoutes (cognitive 133): gateway.gatewayRoutes has cognitive complexity 133 (threshold 15). Drivers by points: if/else 54 (68 pts), ternaries 26 (38 pts), boolean chains 23, error handling 3, loops 1 (nesting depth added 26). Most of this is not in the body itself: 1 of the 133 points is its own statement and the rest belongs to 29 function items inside it that branch (a function literal at line 296, a function literal at line 196, a function literal at line 250, \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/daemon/src/routes/gateway.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a7251418449a71a80cca819996f51369451f95308bc0ad17fc9dba8af215da"}},{"ruleId":"D2","level":"warning","message":{"text":"BootstrapOrchestrator.bootstrap (cognitive 131): BootstrapOrchestrator.bootstrap has cognitive complexity 131 (threshold 15). Drivers by points: if/else 28 (75 pts), ternaries 7 (24 pts), boolean chains 18, error handling 6 (14 pts) (nesting depth added 72). 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/daemon/src/domain/bootstrap-orchestrator.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"0068c14a483b6cbd57e740c906bf6dd2e772e58827b5f083cbce4b4009aa3a55"}},{"ruleId":"D2","level":"warning","message":{"text":"agent-images.agentImagesRoutes (cognitive 131): agent-images.agentImagesRoutes has cognitive complexity 131 (threshold 15). Drivers by points: ternaries 33 (63 pts), if/else 32 (42 pts), boolean chains 15, error handling 8 (10 pts), loops 1 (nesting depth added 42). None of this is in the body itself: all 131 points belong to 10 function literals inside it that branch (lines 192, 140, 336, \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/daemon/src/routes/agent-images.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"876fc40c3f0cb8b70919271cb9f54cd5c42b4336011e1429ad8cb92896ccc999"}},{"ruleId":"D2","level":"warning","message":{"text":"execution-view.buildExecutionView (cognitive 130): execution-view.buildExecutionView has cognitive complexity 130 (threshold 15). Drivers by points: ternaries 66 (96 pts), if/else 45 (82 pts), boolean chains 38, loops 13 (18 pts), error handling 5 (11 pts) (nesting depth added 78). To reduce it, split the body into named stages: move each independent 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 (execution-view.buildExecutionView::ladderOf) 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/daemon/src/domain/execution-view.ts"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f77a17d69f4e3e3e812a4f91ee602a10192a08ef9dd0bbda52eeee07f3ebd4"}},{"ruleId":"D2","level":"warning","message":{"text":"setup.runSetup (cognitive 129): setup.runSetup has cognitive complexity 129 (threshold 15). Drivers by points: ternaries 17 (53 pts), if/else 27 (36 pts), error handling 10 (25 pts), boolean chains 11, loops 2 (4 pts) (nesting depth added 62). Of this number, 119 points are the body\u0027s own statements and 10 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":"packages/cli/src/commands/setup.ts"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"41916222d6214716eafe42dc32874c0c1b67da022bfc761fb331da607c56c3fa"}},{"ruleId":"D2","level":"warning","message":{"text":"permission-account.planPermissionAccount (cognitive 127): permission-account.planPermissionAccount has cognitive complexity 127 (threshold 15). Drivers by points: ternaries 41 (81 pts), if/else 17 (24 pts), boolean chains 18, error handling 2 (4 pts) (nesting depth added 49). To reduce it, split the body into named stages: move each independent step or branch into 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/daemon/src/domain/permission-account.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed84bab3e1c5b665164ca929007ee0758b98a1da1ed8d32fb868ced7c6a9b956"}},{"ruleId":"D2","level":"warning","message":{"text":"slack-delivery.deliverSinglePart.\u003Creturned closure\u003E (cognitive 126): slack-delivery.deliverSinglePart.\u003Creturned closure\u003E has cognitive complexity 126 (threshold 15). Drivers by points: if/else 39 (66 pts), error handling 10 (22 pts), ternaries 10 (22 pts), boolean chains 16 (nesting depth added 51). Of this number, 120 points are the body\u0027s own statements and 6 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/daemon/src/domain/gateway/slack/slack-delivery.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71a0ce0e1c4d90e7de2c1a95f4cf369ff6b597063c20b12a5ea5a49b1c6c255"}},{"ruleId":"D2","level":"warning","message":{"text":"skill-catalog.reconcileSkillLoadout (cognitive 125): skill-catalog.reconcileSkillLoadout has cognitive complexity 125 (threshold 15). Drivers by points: if/else 33 (63 pts), boolean chains 19, loops 14 (17 pts), error handling 8 (15 pts), ternaries 9 (11 pts) (nesting depth added 42). Of this number, 115 points are the body\u0027s own statements and 10 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/daemon/src/domain/skill-catalog.ts"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c8cc2213fb097e3dca27c1e78414159b5394d947140110714785070b0ed8f89"}},{"ruleId":"D2","level":"warning","message":{"text":"manifest-parser.parseProfiles (cognitive 125): manifest-parser.parseProfiles has cognitive complexity 125 (threshold 15). Drivers by points: if/else 26 (82 pts), loops 9 (31 pts), boolean chains 12 (nesting depth added 78). To reduce it, split the body into named stages: move each independent step or branch into 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/daemon/src/domain/context-packs/manifest-parser.ts"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"1801e4a238f8fb29316dd403751bcd2849ef771eaba0aec580f7b3bf11fe7c74"}},{"ruleId":"D2","level":"warning","message":{"text":"BootstrapOrchestrator.executeStages (cognitive 123): BootstrapOrchestrator.executeStages has cognitive complexity 123 (threshold 15). Drivers by points: if/else 34 (62 pts), loops 14 (26 pts), ternaries 13 (22 pts), boolean chains 13 (nesting depth added 49). Of this number, 119 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/daemon/src/domain/bootstrap-orchestrator.ts"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"0650d08395646061c02fe0ded45a3f02b272e03b120406e3f471cc18597f15d9"}},{"ruleId":"D2","level":"warning","message":{"text":"rigspec-schema.validateMember (cognitive 122): rigspec-schema.validateMember has cognitive complexity 122 (threshold 15). Drivers by points: if/else 64 (90 pts), boolean chains 15, error handling 7 (14 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"9445446dbd4c12439da3194a8e50b6fc729067173eee5bf1d769e821e086aa87"}},{"ruleId":"D2","level":"warning","message":{"text":"import.importCommand (cognitive 122): import.importCommand has cognitive complexity 122 (threshold 15). Drivers by points: if/else 38 (69 pts), boolean chains 20, ternaries 10 (17 pts), loops 4 (11 pts), error handling 3 (5 pts) (nesting depth added 47). None of this is in the body itself: all 122 points belong to one function literal inside it that branches (line 59). 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/commands/import.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d053910e77f486e676630f410e1629cc9db921b6759a2993aa1cb5dc6ec7be"}},{"ruleId":"D2","level":"warning","message":{"text":"compose.compose_up (cognitive 122): compose.compose_up has cognitive complexity 122 (threshold 15). Drivers by points: if/else 25 (67 pts), ternaries 11 (28 pts), boolean chains 14, loops 7 (13 pts) (nesting depth added 65). 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/daemon/assets/plugins/openrig-core/skills/openrig-operating-model/scripts/compose.py"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"efaa2ba0b193c6ce3cdd42d2bb17f7f9f6e80ff79382eb5e617fda9f35618a61"}},{"ruleId":"D2","level":"warning","message":{"text":"rig.rigCommand (cognitive 119): rig.rigCommand has cognitive complexity 119 (threshold 15). Drivers by points: if/else 34 (51 pts), ternaries 13 (26 pts), loops 12 (24 pts), boolean chains 11, error handling 6 (7 pts) (nesting depth added 43). None of this is in the body itself: all 119 points belong to 4 function literals inside it that branch (lines 104, 50, 220, \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/commands/rig.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"8622ea7b2effd39b73f16db4461dbdd33d2db752ea90c508c2ea3e5e9800697f"}},{"ruleId":"D2","level":"warning","message":{"text":"seat-attention-reconciler.rebindAndVerifyPaneIdentity (cognitive 118): seat-attention-reconciler.rebindAndVerifyPaneIdentity has cognitive complexity 118 (threshold 15). Drivers by points: ternaries 26 (71 pts), boolean chains 23, if/else 13 (20 pts), error handling 3 (4 pts) (nesting depth added 53). 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/daemon/src/domain/seat-attention-reconciler.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"a147e01246e3b73ae85c5cc514c6572a5dabdb8230c683f3e33be30884232129"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkflowRuntime.instantiate (cognitive 118): WorkflowRuntime.instantiate has cognitive complexity 118 (threshold 15). Drivers by points: if/else 38 (70 pts), ternaries 13 (23 pts), boolean chains 12, loops 7 (10 pts), error handling 2 (3 pts) (nesting depth added 46). Of this number, 93 points are the body\u0027s own statements and 25 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/daemon/src/domain/workflow-runtime.ts"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f792d94ab9840503f3c62952c4a751e17fcdb3af4a5c5d0af3125dac0f7995"}},{"ruleId":"D2","level":"warning","message":{"text":"CodexRuntimeAdapter.verifyResumeLaunch (cognitive 116): CodexRuntimeAdapter.verifyResumeLaunch has cognitive complexity 116 (threshold 15). Drivers by points: if/else 27 (65 pts), ternaries 20 (38 pts), boolean chains 12, loops 1 (nesting depth added 56). Of this number, 109 points are the body\u0027s own statements and 7 belong to 3 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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":1890}}}],"partialFingerprints":{"codehealthFindingId/v1":"411b0833bbadc51682b23759a59eb6d185f4c63361faf90992b55ec0a5b7a216"}},{"ruleId":"D2","level":"warning","message":{"text":"work-install.resolveWorkPosition (cognitive 115): work-install.resolveWorkPosition has cognitive complexity 115 (threshold 15). Drivers by points: if/else 35 (78 pts), ternaries 5 (19 pts), boolean chains 11, error handling 2 (6 pts), loops 1 (nesting depth added 61). 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/lib/work-install.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c44a97f33c890488f861639c40d4d414232c0e410aa121fd6212059d98084b"}},{"ruleId":"D2","level":"warning","message":{"text":"session-transport.inspectComposerInput (cognitive 114): session-transport.inspectComposerInput has cognitive complexity 114 (threshold 15). Drivers by points: if/else 27 (62 pts), boolean chains 25, ternaries 9 (18 pts), loops 4 (9 pts) (nesting depth added 49). Of this number, 110 points are the body\u0027s own statements and 4 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":"packages/daemon/src/domain/session-transport.ts"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"221bdf4c79f483a9071d570c362fb6358d02e47382c2954e0246cbc8ec5742d5"}},{"ruleId":"D2","level":"warning","message":{"text":"project.projectCommand (cognitive 114): project.projectCommand has cognitive complexity 114 (threshold 15). Drivers by points: if/else 25 (46 pts), ternaries 17 (42 pts), error handling 7 (15 pts), boolean chains 7, loops 4 (nesting depth added 54). Most of this is not in the body itself: 7 of the 114 points are its own statements and the rest belongs to 10 function literals inside it that branch (lines 129, 83, 167, \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/commands/project.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d4efc371d532d278b84718f4338264671e40ed7085a08ab8216b9b6f0d98048"}},{"ruleId":"D2","level":"warning","message":{"text":"SeatRuntimeSwitchService.setRuntime (cognitive 114): SeatRuntimeSwitchService.setRuntime has cognitive complexity 114 (threshold 15). Drivers by points: if/else 33 (44 pts), ternaries 17 (31 pts), boolean chains 27, error handling 7 (11 pts), loops 1 (nesting depth added 29). Of this number, 112 points are the body\u0027s own statements and 2 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/daemon/src/domain/seat-runtime-switch-service.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2a3748f6169e96ca577dd09246e86a81dcda413019a93d372eb1596b4805728"}},{"ruleId":"D2","level":"warning","message":{"text":"daemon-lifecycle.startOwnedDaemon (cognitive 112): daemon-lifecycle.startOwnedDaemon has cognitive complexity 112 (threshold 15). Drivers by points: if/else 36 (66 pts), ternaries 8 (18 pts), boolean chains 13, error handling 7 (13 pts), loops 2 (nesting depth added 46). Of this number, 81 points are the body\u0027s own statements and 31 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/daemon-lifecycle.ts"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bdcd8b23c3341f7e70f8e4e1de397287df1044a9b2f299429a1c8c31f4bc36c"}},{"ruleId":"D2","level":"warning","message":{"text":"rigspec-preflight.preflightMembers (cognitive 112): rigspec-preflight.preflightMembers has cognitive complexity 112 (threshold 15). Drivers by points: if/else 21 (68 pts), ternaries 4 (18 pts), loops 7 (16 pts), boolean chains 6, error handling 1 (4 pts) (nesting depth added 73). 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/daemon/src/domain/rigspec-preflight.ts"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce2d954f3657a783e22ae35c2b3f9bf4de16f99987c8de579fd96819edac35d4"}},{"ruleId":"D2","level":"warning","message":{"text":"participants.validateParticipantsFile (cognitive 111): participants.validateParticipantsFile has cognitive complexity 111 (threshold 15). Drivers by points: if/else 46 (91 pts), boolean chains 11, loops 4 (6 pts), ternaries 2 (3 pts) (nesting depth added 48). Of this number, 108 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/daemon/src/domain/gateway/participants.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"349d5a05a6115686d4b0200980f23e13cfb3788befedc89d13c49919b18b3322"}},{"ruleId":"D2","level":"warning","message":{"text":"workflow.workflowCommand (cognitive 111): workflow.workflowCommand has cognitive complexity 111 (threshold 15). Drivers by points: if/else 36 (40 pts), ternaries 26 (40 pts), boolean chains 18, loops 11 (13 pts) (nesting depth added 20). None of this is in the body itself: all 111 points belong to 19 function literals inside it that branch (lines 461, 688, 574, \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/commands/workflow.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"704ca2b5770dd96c3e597556034a9836c09271590f924b17ecf95a06c76aaddd"}},{"ruleId":"D2","level":"warning","message":{"text":"workflow-guidance.readWorkflowGuidance (cognitive 111): workflow-guidance.readWorkflowGuidance has cognitive complexity 111 (threshold 15). Drivers by points: if/else 31 (56 pts), ternaries 17 (30 pts), loops 7 (10 pts), boolean chains 9, error handling 3 (6 pts) (nesting depth added 44). Of this number, 108 points are the body\u0027s own statements and 3 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/daemon/src/domain/workflow-guidance.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c6ad7b5033de28f32cb85d88e11109e5f8c04eb6a0a96383d659de09cc597e1"}},{"ruleId":"D2","level":"warning","message":{"text":"RestoreOrchestrator.launchNodeTargets (cognitive 111): RestoreOrchestrator.launchNodeTargets has cognitive complexity 111 (threshold 15). Drivers by points: if/else 22 (43 pts), ternaries 16 (36 pts), boolean chains 18, loops 5 (8 pts), error handling 2 (6 pts) (nesting depth added 48). Of this number, 109 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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"6571d41bda814c829d3ce9bceefe92dcc56258262f250155311b8d0a87f2a1bf"}},{"ruleId":"D2","level":"warning","message":{"text":"export.exportCommand (cognitive 110): export.exportCommand has cognitive complexity 110 (threshold 15). Drivers by points: if/else 18 (48 pts), ternaries 6 (24 pts), loops 6 (20 pts), boolean chains 9, error handling 3 (9 pts) (nesting depth added 68). None of this is in the body itself: all 110 points belong to one function literal inside it that branches (line 72). 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/commands/export.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a78bc23d8770522fc966fb81bfe30fe151783fc3904fb9fb6c5e9b249cf1acf"}},{"ruleId":"D2","level":"warning","message":{"text":"rig-mode.rigModeCommand (cognitive 110): rig-mode.rigModeCommand has cognitive complexity 110 (threshold 15). Drivers by points: if/else 61 (76 pts), ternaries 13 (27 pts), boolean chains 4, loops 2, error handling 1 (nesting depth added 29). None of this is in the body itself: all 110 points belong to 8 function literals inside it that branch (lines 299, 559, 458, \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/commands/rig-mode.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"3075f754838c18fa5d692bf5ddedd7dab55c600962dd556f98ab315c01da49ce"}},{"ruleId":"D2","level":"warning","message":{"text":"SliceIndexer.observedQueueCounts (cognitive 108): SliceIndexer.observedQueueCounts has cognitive complexity 108 (threshold 15). Drivers by points: if/else 34 (65 pts), loops 15 (27 pts), boolean chains 9, ternaries 3 (7 pts) (nesting depth added 47). Of this number, 105 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":"packages/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a848d7b28b246b130cbcc09ac6ae214028b595d0426d9daff9aca37d6a2077"}},{"ruleId":"D2","level":"warning","message":{"text":"send.sendCommand (cognitive 108): send.sendCommand has cognitive complexity 108 (threshold 15). Drivers by points: if/else 45 (63 pts), ternaries 10 (19 pts), boolean chains 17, loops 2 (6 pts), error handling 2 (3 pts) (nesting depth added 32). None of this is in the body itself: all 108 points belong to 2 function literals inside it that branch (lines 363, 563). 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/commands/send.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d5a184e5aaf3c5af24170e542f79cf5c1221db251ed5cb4898c5fa6b04691c"}},{"ruleId":"D2","level":"warning","message":{"text":"state.reduce (cognitive 108): state.reduce has cognitive complexity 108 (threshold 15). Drivers by points: if/else 24 (48 pts), ternaries 20 (41 pts), boolean chains 18, match/switch 1 (nesting depth added 45). Of this number, 107 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/tui/src/state.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f3537ea16c082d8fba1c788707623e8d88bf4df78b4338a72e742c1dde083a"}},{"ruleId":"D2","level":"warning","message":{"text":"HerdrAdapter.openView (cognitive 106): HerdrAdapter.openView has cognitive complexity 106 (threshold 15). Drivers by points: if/else 26 (43 pts), ternaries 7 (21 pts), loops 8 (19 pts), error handling 8 (18 pts), boolean chains 5 (nesting depth added 52). To reduce it, split the body into named stages: move each independent step or branch into 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/daemon/src/domain/terminal/herdr-adapter.ts"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"70ab3359cdd37da84d5cf67d4ce4e871e54542c499f79004b5371a812784f91e"}},{"ruleId":"D2","level":"warning","message":{"text":"chatroom.chatroomCommand (cognitive 105): chatroom.chatroomCommand has cognitive complexity 105 (threshold 15). Drivers by points: if/else 46 (71 pts), error handling 10 (15 pts), loops 5 (9 pts), boolean chains 8, ternaries 2 (nesting depth added 34). None of this is in the body itself: all 105 points belong to 7 function items inside it that branch (a function literal at line 307, a function literal at line 180, a function literal at line 121, \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/commands/chatroom.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f4ee0679d818b581d47a80ca436f5f283fa138fc0b96c243e88b8cc5bfbe88"}},{"ruleId":"D2","level":"warning","message":{"text":"scope.buildSliceCloseCommand (cognitive 105): scope.buildSliceCloseCommand has cognitive complexity 105 (threshold 15). Drivers by points: ternaries 16 (44 pts), if/else 17 (37 pts), error handling 8 (18 pts), boolean chains 6 (nesting depth added 58). None of this is in the body itself: all 105 points belong to one function literal inside it that branches (line 576). 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/commands/scope.ts"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"f28bef51f5d0116965105ec5f9a51e4a092e66aa6ac0c6732fddcf94181bfda9"}},{"ruleId":"D2","level":"warning","message":{"text":"ps.handleNodes (cognitive 104): ps.handleNodes has cognitive complexity 104 (threshold 15). Drivers by points: if/else 28 (44 pts), ternaries 18 (35 pts), loops 9 (13 pts), boolean chains 12 (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/commands/ps.ts"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"106023b9b7ae55faca542bc13bf9f6ed105c1aab8b126304320af68e8a271082"}},{"ruleId":"D2","level":"warning","message":{"text":"execution-view.readArrangement (cognitive 104): execution-view.readArrangement has cognitive complexity 104 (threshold 15). Drivers by points: if/else 25 (50 pts), ternaries 13 (27 pts), boolean chains 15, loops 5 (11 pts), error handling 1 (nesting depth added 45). Of this number, 92 points are the body\u0027s own statements and 12 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/daemon/src/domain/execution-view.ts"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc9f55f65a98f2a1cfa87a0dfed0e7a4b27873d3b405dc3d5452add2e6bf0ab"}},{"ruleId":"D2","level":"warning","message":{"text":"bundles.bundleRoutes.post(\u0022/create\u0022) (cognitive 103): bundles.bundleRoutes.post(\u0022/create\u0022) has cognitive complexity 103 (threshold 15). Drivers by points: if/else 34 (55 pts), ternaries 19 (26 pts), boolean chains 11, loops 5 (10 pts), error handling 1 (nesting depth added 33). Of this number, 102 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/daemon/src/routes/bundles.ts"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e2303d75a74e0e1decff8d30b57fa5bbd4125a9efc2d0b9211a16832b050d7f"}},{"ruleId":"D2","level":"warning","message":{"text":"OperatingPostureService.context (cognitive 102): OperatingPostureService.context has cognitive complexity 102 (threshold 15). Drivers by points: if/else 36 (79 pts), boolean chains 15, loops 3 (6 pts), error handling 1 (2 pts) (nesting depth added 47). Of this number, 94 points are the body\u0027s own statements and 8 belong to 2 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/daemon/src/domain/rig-mode/operating-posture.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b0b0424c6b397830c678cf289459f8aeef5e618aa45a9d49a68230384c60fa3"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkflowProjector.projectStep (cognitive 100): WorkflowProjector.projectStep has cognitive complexity 100 (threshold 15). Drivers by points: if/else 48 (57 pts), boolean chains 25, ternaries 13 (18 pts) (nesting depth added 14). Of this number, 43 points are the body\u0027s own statements and 57 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/daemon/src/domain/workflow-projector.ts"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"460fae2c69c6f619b2683232ac83847ca8e4ba944ab71ef6252882559b6a780f"}},{"ruleId":"D2","level":"warning","message":{"text":"workflow-model.workflowDetail (cognitive 100): workflow-model.workflowDetail has cognitive complexity 100 (threshold 15). Drivers by points: if/else 20 (45 pts), ternaries 15 (36 pts), loops 8 (18 pts), boolean chains 1 (nesting depth added 56). To reduce it, split the body into named stages: move each independent step or branch into 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/tui/src/execution/workflow-model.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"d74e6b3761908d8ffd4545713baf1ab5dd2eeb69dcdcadcbaab5eda0879de482"}},{"ruleId":"D2","level":"warning","message":{"text":"ps.psCommand (cognitive 98): ps.psCommand has cognitive complexity 98 (threshold 15). Drivers by points: if/else 40 (50 pts), ternaries 19 (22 pts), boolean chains 18, loops 4 (8 pts) (nesting depth added 17). None of this is in the body itself: all 98 points belong to 2 function literals inside it that branch (lines 1066, 1276). 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/commands/ps.ts"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cfd4d4b290e03929adfaafeb2a21701c992c1882a1de41fa9fa1eed78720d79"}},{"ruleId":"D2","level":"warning","message":{"text":"down.downCommand (cognitive 98): down.downCommand has cognitive complexity 98 (threshold 15). Drivers by points: if/else 43 (63 pts), ternaries 7 (14 pts), boolean chains 11, loops 5 (10 pts) (nesting depth added 32). None of this is in the body itself: all 98 points belong to 5 function literals inside it that branch (lines 176, 193, 198, \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/commands/down.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8ef781af3c4a2f9f4cfd55acd3c3cde9130b483394ff51f186082ce6513b28"}},{"ruleId":"D2","level":"warning","message":{"text":"profile-resolver.resolveNodeConfig (cognitive 97): profile-resolver.resolveNodeConfig has cognitive complexity 97 (threshold 15). Drivers by points: if/else 25 (52 pts), ternaries 13 (22 pts), loops 6 (11 pts), boolean chains 9, error handling 1 (3 pts) (nesting depth added 43). Of this number, 84 points are the body\u0027s own statements and 13 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/daemon/src/domain/profile-resolver.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"40cd54e8d54dffce71a250c2fc07f386b85168981c77af76652bf3bbf9839fb8"}},{"ruleId":"D2","level":"warning","message":{"text":"daemon-lifecycle.getDaemonStatus (cognitive 97): daemon-lifecycle.getDaemonStatus has cognitive complexity 97 (threshold 15). Drivers by points: ternaries 17 (43 pts), if/else 13 (30 pts), boolean chains 15, error handling 5 (9 pts) (nesting depth added 47). Of this number, 90 points are the body\u0027s own statements and 7 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/daemon-lifecycle.ts"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b67fc4506e58128b5f876559172121348241b3ab2d27d3c6b649f15c3066ad"}},{"ruleId":"D2","level":"warning","message":{"text":"RigGraph.RigGraph (cognitive 97): RigGraph.RigGraph has cognitive complexity 97 (threshold 15). Drivers by points: if/else 31 (40 pts), ternaries 15 (32 pts), boolean chains 22, loops 2, error handling 1 (nesting depth added 26). Most of this is not in the body itself: 10 of the 97 points are its own statements and the rest belongs to 13 function literals inside it that branch (lines 378, 295, 272, \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/ui/src/components/RigGraph.tsx"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c89a2944578bafd713047e03f6ac2c4f221fc8adbe169541cd58c7db83d0680"}},{"ruleId":"D2","level":"warning","message":{"text":"SeatLaunchEnvironment.command (cognitive 96): SeatLaunchEnvironment.command has cognitive complexity 96 (threshold 15). Drivers by points: ternaries 24 (42 pts), if/else 20 (28 pts), boolean chains 24, error handling 1, loops 1 (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":"packages/daemon/src/domain/seat-launch-environment.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"134fe6e7b356c101bfef43d92039238681f1a4ad120eda5d12e2f4f131cc5ae7"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeCodeAdapter.launchHarness (cognitive 96): ClaudeCodeAdapter.launchHarness has cognitive complexity 96 (threshold 15). Drivers by points: ternaries 39 (54 pts), if/else 32 (45 pts), boolean chains 18, error handling 4 (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. This shape REPEATS in the file: one other method here (ClaudeCodeAdapter.launchHarness::sendClassic) 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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"910384617ad958149ee68a642360a7bf6d4c1e3485f6849a59af4e571f3cfa91"}},{"ruleId":"D2","level":"warning","message":{"text":"pi-runner.main (cognitive 96): pi-runner.main has cognitive complexity 96 (threshold 15). Drivers by points: if/else 29 (37 pts), ternaries 19 (28 pts), boolean chains 18, error handling 9 (13 pts) (nesting depth added 21). Of this number, 35 points are the body\u0027s own statements and 61 belong to 18 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":2252}}}],"partialFingerprints":{"codehealthFindingId/v1":"94e956a2ad293ab04b16c951ba9fdd73a67e9590edef9e6f7081969734f57ad8"}},{"ruleId":"D2","level":"warning","message":{"text":"project-lifecycle-compiler.compileProjectLifecycle (cognitive 95): project-lifecycle-compiler.compileProjectLifecycle has cognitive complexity 95 (threshold 15). Drivers by points: if/else 40 (68 pts), boolean chains 10, loops 4 (8 pts), ternaries 7, error handling 2 (nesting depth added 32). Of this number, 76 points are the body\u0027s own statements and 19 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/daemon/src/domain/project-lifecycle-compiler.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa930d5322f10bcf71cfbc4a17d2a200aaa04adba24a76b1b908f8ebae68dd4"}},{"ruleId":"D2","level":"warning","message":{"text":"bundle-behaviour.formatBundleBehaviour (cognitive 94): bundle-behaviour.formatBundleBehaviour has cognitive complexity 94 (threshold 15). Drivers by points: ternaries 16 (40 pts), if/else 12 (23 pts), loops 7 (19 pts), boolean chains 12 (nesting depth added 47). Of this number, 81 points are the body\u0027s own statements and 13 belong to 4 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/cli/src/bundle-behaviour.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da6dd2c8f9b9a766851701d033d9853657f9ae4bd41a8880f0c6727a3df65d8"}},{"ruleId":"D2","level":"warning","message":{"text":"policy.registerPermissionCommands (cognitive 94): policy.registerPermissionCommands has cognitive complexity 94 (threshold 15). Drivers by points: if/else 38 (60 pts), ternaries 8 (16 pts), loops 5 (13 pts), boolean chains 4, error handling 1 (nesting depth added 38). None of this is in the body itself: all 94 points belong to 6 function literals inside it that branch (lines 189, 235, 367, \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/commands/policy.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ecdbb1e834d370d75ff3eb0cedee6a197464f15dd0a803cc56299a1409c783e"}},{"ruleId":"D2","level":"warning","message":{"text":"RigSpecSchema.validate (cognitive 93): RigSpecSchema.validate has cognitive complexity 93 (threshold 15). Drivers by points: if/else 33 (68 pts), loops 5 (15 pts), boolean chains 9, ternaries 1 (nesting depth added 45). 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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2d5af916b115d9fd2d01b6b9188343a1ff686db90e98c8f2a694407487d3b1"}},{"ruleId":"D2","level":"warning","message":{"text":"terminal-window.windowLauncher (cognitive 92): terminal-window.windowLauncher has cognitive complexity 92 (threshold 15). Drivers by points: ternaries 21 (54 pts), if/else 12 (18 pts), boolean chains 14, error handling 2 (5 pts), loops 1 (nesting depth added 42). Of this number, 58 points are the body\u0027s own statements and 34 belong to 2 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/cli/src/terminal-window.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eeba68dfb7d7917002b066308ab289182dc15e24f45bf3079cc22117218c025"}},{"ruleId":"D2","level":"warning","message":{"text":"session-transport.annotateInputBox (cognitive 91): session-transport.annotateInputBox has cognitive complexity 91 (threshold 15). Drivers by points: ternaries 17 (35 pts), if/else 21 (29 pts), boolean chains 24, loops 2 (3 pts) (nesting depth added 27). Of this number, 81 points are the body\u0027s own statements and 10 belong 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":"packages/daemon/src/domain/session-transport.ts"},"region":{"startLine":5345}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa50a5ec70a681601ad9061f749163952f9596a1c09a5a8e18f9d978559dd24"}},{"ruleId":"D2","level":"warning","message":{"text":"queue-erasure.eraseQueue (cognitive 91): queue-erasure.eraseQueue has cognitive complexity 91 (threshold 15). Drivers by points: if/else 60 (105 pts), ternaries 23 (40 pts), boolean chains 31, loops 19 (30 pts), error handling 4 (7 pts) (nesting depth added 76). To reduce it, split the body into named stages: move each independent 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: 2 other methods here (queue-erasure.eraseQueue::page, queue-erasure.eraseQueue::planBatch) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 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/daemon/src/domain/queue-erasure.ts"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc5fbfed4a2185f0794d2575782ecae6934196cd0d7595b08e892e9a297efb8"}},{"ruleId":"D2","level":"warning","message":{"text":"SeatRuntimeSwitchService.execute (cognitive 90): SeatRuntimeSwitchService.execute has cognitive complexity 90 (threshold 15). Drivers by points: ternaries 27 (40 pts), if/else 18 (25 pts), boolean chains 17, error handling 4 (5 pts), loops 3 (nesting depth added 21). Of this number, 74 points are the body\u0027s own statements and 16 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/daemon/src/domain/seat-runtime-switch-service.ts"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"f50ece49617d2631aca16cb3bb2071888530a10c9cae7a20d1fb1b2f8719a808"}},{"ruleId":"D2","level":"warning","message":{"text":"render.instanceContentLines (cognitive 89): render.instanceContentLines has cognitive complexity 89 (threshold 15). Drivers by points: ternaries 17 (41 pts), if/else 18 (36 pts), loops 4 (8 pts), boolean chains 4 (nesting depth added 46). Of this number, 80 points are the body\u0027s own statements and 9 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/tui/src/render.ts"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd0db3f903c4313cbebb61a3c7c5462ae27c34159a72bc667f2516b9c3aafd7"}},{"ruleId":"D2","level":"warning","message":{"text":"ResumeMetadataRefresher.refresh (cognitive 87): ResumeMetadataRefresher.refresh has cognitive complexity 87 (threshold 15). Drivers by points: if/else 18 (62 pts), ternaries 6 (13 pts), boolean chains 8, error handling 1 (3 pts), loops 1 (nesting depth added 53). 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/daemon/src/domain/resume-metadata-refresher.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"89f45186e4f9ce5dac0358f6797b69af0b2f7d45aadeafcbc2cbe56d97efde88"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeCompactionEnforcer.recoverAfterRestart (cognitive 87): ClaudeCompactionEnforcer.recoverAfterRestart has cognitive complexity 87 (threshold 15). Drivers by points: if/else 23 (34 pts), boolean chains 24, ternaries 13 (24 pts), loops 2 (3 pts), error handling 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":2113}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b7a71e0c7cc2704339d04fb7160737a2f76f4bbacef1cdd72f3098ab419fbe"}},{"ruleId":"D2","level":"warning","message":{"text":"ask.askCommand (cognitive 86): ask.askCommand has cognitive complexity 86 (threshold 15). Drivers by points: if/else 29 (52 pts), ternaries 5 (14 pts), boolean chains 11, loops 3 (9 pts) (nesting depth added 38). None of this is in the body itself: all 86 points belong to one function literal inside it that branches (line 180). 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/commands/ask.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec69f7864132c9393f938fb91ae102083101c0c32f9ff4a473c34d6c4009f9dc"}},{"ruleId":"D2","level":"warning","message":{"text":"RigTeardownOrchestrator.teardown (cognitive 86): RigTeardownOrchestrator.teardown has cognitive complexity 86 (threshold 15). Drivers by points: if/else 29 (51 pts), error handling 6 (13 pts), boolean chains 12, ternaries 3 (8 pts), loops 2 (nesting depth added 34). Of this number, 85 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/daemon/src/domain/rig-teardown.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c9a5de38a4a8339c0c42b0783a3c49394f482d49ee66fdf667c8d03ead4b142"}},{"ruleId":"D2","level":"warning","message":{"text":"FeedCard.FeedCard (cognitive 86): FeedCard.FeedCard has cognitive complexity 86 (threshold 15). Drivers by points: ternaries 33 (53 pts), boolean chains 22, if/else 11 (nesting depth added 20). Of this number, 73 points are the body\u0027s own statements and 13 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/ui/src/components/for-you/FeedCard.tsx"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2db074073479a5c073a08bd228a090770607f455b0d073d8784c1e07bf43108"}},{"ruleId":"D2","level":"warning","message":{"text":"seat-skill-storage.followPackagedSeatSkills (cognitive 85): seat-skill-storage.followPackagedSeatSkills has cognitive complexity 85 (threshold 15). Drivers by points: if/else 22 (52 pts), error handling 6 (12 pts), loops 5 (12 pts), boolean chains 7, ternaries 1 (2 pts) (nesting depth added 44). Of this number, 82 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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec48bc725be934b2289b255ba2f20829206f099a26650ed485bad5f3884bb4d4"}},{"ruleId":"D2","level":"warning","message":{"text":"hosts-registry-reader.validateHostRegistry (cognitive 85): hosts-registry-reader.validateHostRegistry has cognitive complexity 85 (threshold 15). Drivers by points: if/else 21 (48 pts), ternaries 7 (21 pts), boolean chains 15, loops 1 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/hosts/hosts-registry-reader.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"6562162b0e888ef44d603c19b38a06cc54894a3ec533a349ee1c012ebf46434a"}},{"ruleId":"D2","level":"warning","message":{"text":"host-registry.validateHostRegistry (cognitive 85): host-registry.validateHostRegistry has cognitive complexity 85 (threshold 15). Drivers by points: if/else 21 (48 pts), ternaries 7 (21 pts), boolean chains 15, loops 1 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/host-registry.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a5d1c89606bbe14a71c6846d64e84f0c2f5965942cb7b226cddc68906b1f3d"}},{"ruleId":"D2","level":"warning","message":{"text":"snapshot-repository.isRestoreUsableSnapshotData (cognitive 84): snapshot-repository.isRestoreUsableSnapshotData has cognitive complexity 84 (threshold 15). Drivers by points: if/else 30 (62 pts), boolean chains 18, loops 3 (4 pts) (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":"packages/daemon/src/domain/snapshot-repository.ts"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7b983fbaadeaac3e7f4640a88c7cd6e9422f89992f6da96f2487f0045882af"}},{"ruleId":"D2","level":"warning","message":{"text":"PodRigInstantiator.instantiateOnce (cognitive 84): PodRigInstantiator.instantiateOnce has cognitive complexity 84 (threshold 15). Drivers by points: if/else 36 (70 pts), error handling 12 (26 pts), ternaries 10 (21 pts), loops 11 (17 pts), boolean chains 10 (nesting depth added 65). To reduce it, split the body into named stages: move each independent 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 (PodRigInstantiator.instantiateOnce::cleanup) 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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":1478}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cced0fa7c76157b6071dc5051efa0a204e1fba48bc3fecde814dfdfbec67fbe"}},{"ruleId":"D2","level":"warning","message":{"text":"status.statusCommand (cognitive 83): status.statusCommand has cognitive complexity 83 (threshold 15). Drivers by points: ternaries 19 (38 pts), if/else 20 (25 pts), boolean chains 10, loops 3 (7 pts), error handling 2 (3 pts) (nesting depth added 29). None of this is in the body itself: all 83 points belong to 2 function literals inside it that branch (lines 41, 45). 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/commands/status.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"852216c791f4dcc0e258d8645801ae97e2b61f53e19704119e71a4f5abbad4c1"}},{"ruleId":"D2","level":"warning","message":{"text":"grow.growCommand (cognitive 83): grow.growCommand has cognitive complexity 83 (threshold 15). Drivers by points: if/else 21 (30 pts), ternaries 12 (30 pts), loops 6 (14 pts), boolean chains 8, error handling 1 (nesting depth added 35). None of this is in the body itself: all 83 points belong to 2 function literals inside it that branch (lines 60, 134). 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/commands/grow.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ea76cb5a08f9de3b410a42c611963a5162914f9bd859bb7656afa8cc86e002"}},{"ruleId":"D2","level":"warning","message":{"text":"terminal-model.terminalLines (cognitive 83): terminal-model.terminalLines has cognitive complexity 83 (threshold 15). Drivers by points: ternaries 13 (35 pts), if/else 19 (29 pts), loops 5 (10 pts), boolean chains 9 (nesting depth added 37). Of this number, 73 points are the body\u0027s own statements and 10 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":"packages/tui/src/terminals/terminal-model.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c2f8de640f7adc81ecbbf35cf39ef0ab2894b41d7f222aacb37d91fc94aa37e"}},{"ruleId":"D2","level":"warning","message":{"text":"roster.rosterCommand (cognitive 82): roster.rosterCommand has cognitive complexity 82 (threshold 15). Drivers by points: ternaries 11 (36 pts), if/else 12 (28 pts), loops 5 (16 pts), boolean chains 2 (nesting depth added 52). Most of this is not in the body itself: 11 of the 82 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 144, 159). 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/commands/roster.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"34fb379076871d020d89a5e385bf63823b14efdfb54317fb2656ae24ddaf9b34"}},{"ruleId":"D2","level":"warning","message":{"text":"transport.transportRoutes::send (cognitive 82): transport.transportRoutes::send has cognitive complexity 82 (threshold 15). Drivers by points: if/else 22 (31 pts), ternaries 13 (24 pts), boolean chains 16, error handling 4 (11 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":"packages/daemon/src/routes/transport.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc36c2f090d64a19be9d1a7e71a947b1fb0f02e06d55a1aa58a10a272567e9f0"}},{"ruleId":"D2","level":"warning","message":{"text":"SliceIndexer.ensureMembershipIndex (cognitive 81): SliceIndexer.ensureMembershipIndex has cognitive complexity 81 (threshold 15). Drivers by points: if/else 15 (38 pts), loops 11 (22 pts), boolean chains 12, ternaries 4 (9 pts) (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into 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/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":1361}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f54ac8d0d79869bb54938834f13a8bcd113cb46104fe27c0d4f4c4f8808a91f"}},{"ruleId":"D2","level":"warning","message":{"text":"EnvironmentLifecycle.effect (cognitive 81): EnvironmentLifecycle.effect has cognitive complexity 81 (threshold 15). Drivers by points: if/else 32 (52 pts), ternaries 9 (15 pts), boolean chains 12, error handling 2 (nesting depth added 26). Of this number, 69 points are the body\u0027s own statements and 12 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/daemon/src/domain/environment-lifecycle.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae29bee167b861af063b101e2829e932765768d5b8e850d693a9accb67ef6ed"}},{"ruleId":"D2","level":"warning","message":{"text":"agent-image.agentImageCommand (cognitive 81): agent-image.agentImageCommand has cognitive complexity 81 (threshold 15). Drivers by points: if/else 39 (48 pts), loops 6 (14 pts), error handling 9, ternaries 6 (8 pts), boolean chains 2 (nesting depth added 19). None of this is in the body itself: all 81 points belong to 10 function items inside it that branch (a function literal at line 342, a function literal at line 234, a function literal at line 131, \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/commands/agent-image.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc105bc6fbd58c738a0c775a8b38216b6736081abd932eb9771aea8dbabb973e"}},{"ruleId":"D2","level":"warning","message":{"text":"subscription-move-report.checkMoveReport (cognitive 80): subscription-move-report.checkMoveReport has cognitive complexity 80 (threshold 15). Drivers by points: if/else 34 (59 pts), boolean chains 11, ternaries 3 (7 pts), loops 2 (3 pts) (nesting depth added 30). Of this number, 24 points are the body\u0027s own statements and 56 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":"packages/daemon/src/domain/provider/subscription-move-report.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68365f2cc0f0d0a63db14dd7f8dfa5dd84db194c138b2ef6179d55e34a49c6b"}},{"ruleId":"D2","level":"warning","message":{"text":"sessions.generationRecord (cognitive 80): sessions.generationRecord has cognitive complexity 80 (threshold 15). Drivers by points: if/else 22 (37 pts), ternaries 9 (18 pts), error handling 5 (11 pts), boolean chains 9, loops 2 (5 pts) (nesting depth added 33). Of this number, 76 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/daemon/src/routes/sessions.ts"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"905c92f477272f2049cba5278793ab55cf9aa470fb8ec201d8dbebf4d5aec699"}},{"ruleId":"D2","level":"warning","message":{"text":"files.filesRoutes (cognitive 80): files.filesRoutes has cognitive complexity 80 (threshold 15). Drivers by points: if/else 27 (34 pts), ternaries 16 (32 pts), boolean chains 9, error handling 5 (nesting depth added 23). None of this is in the body itself: all 80 points belong to 9 function items inside it that branch (a function literal at line 141, a function literal at line 209, pathSafetyErrorResponse, \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/daemon/src/routes/files.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"630747dce494d60a5dfc7b381032a558a3e011f7b05d1ac866e2d469cc6a6584"}},{"ruleId":"D2","level":"warning","message":{"text":"hydrate.toAgentRow (cognitive 80): hydrate.toAgentRow has cognitive complexity 80 (threshold 15). Drivers by points: ternaries 17 (66 pts), boolean chains 14 (nesting depth added 49). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/tui/src/hydrate.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3895d491f5dc4b08379ebf86c75c7e9b18ee5f997d5f559964c9467c3dfdc2"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeCodeAdapter.verifyResumeLaunch (cognitive 79): ClaudeCodeAdapter.verifyResumeLaunch has cognitive complexity 79 (threshold 15). Drivers by points: if/else 23 (47 pts), boolean chains 17, ternaries 5 (14 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":"packages/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ddf0bf2ff909220a81f87ab054a21432d6b5b26ba296fae01cbacab73c1fcc"}},{"ruleId":"D2","level":"warning","message":{"text":"SeatAttentionReconciler.clearAttention (cognitive 79): SeatAttentionReconciler.clearAttention has cognitive complexity 79 (threshold 15). Drivers by points: if/else 21 (35 pts), ternaries 13 (25 pts), boolean chains 14, error handling 2 (5 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into 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/daemon/src/domain/seat-attention-reconciler.ts"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd2dd31ef25a2d909d69415720620e743e519c9d052e96a0c734be2991e6aa31"}},{"ruleId":"D2","level":"warning","message":{"text":"rigspec.rigspecImportRoutes.post(\u0022/\u0022) (cognitive 79): rigspec.rigspecImportRoutes.post(\u0022/\u0022) has cognitive complexity 79 (threshold 15). Drivers by points: ternaries 19 (62 pts), if/else 9 (13 pts), boolean chains 2, error handling 2 (nesting depth added 47). 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/daemon/src/routes/rigspec.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b08698e81e9ea8c7e4ff7e6a496b761840843306a16f7e6001c2f8aba47a874"}},{"ruleId":"D2","level":"warning","message":{"text":"PiRuntimeAdapter.launchHarness (cognitive 78): PiRuntimeAdapter.launchHarness has cognitive complexity 78 (threshold 15). Drivers by points: if/else 24 (30 pts), ternaries 16 (23 pts), boolean chains 15, error handling 6 (10 pts) (nesting depth added 17). 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/daemon/src/adapters/pi-runtime-adapter.ts"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"460e48e671686281ae64fd10a07c23a1b9a756e63402f2a892ca8b02aa06e476"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionTransport.sendClassified (cognitive 78): SessionTransport.sendClassified has cognitive complexity 78 (threshold 15). Drivers by points: if/else 18 (34 pts), ternaries 10 (20 pts), boolean chains 10, error handling 3 (7 pts), loops 4 (7 pts) (nesting depth added 33). Of this number, 70 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":"packages/daemon/src/domain/session-transport.ts"},"region":{"startLine":2858}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2c22fb8c92c1cb670290f42f653d3bec3e7065d089da558239357294e210cf"}},{"ruleId":"D2","level":"warning","message":{"text":"native-resume-probe.assessNativeResumeProbe (cognitive 78): native-resume-probe.assessNativeResumeProbe has cognitive complexity 78 (threshold 15). Drivers by points: if/else 26 (51 pts), ternaries 4 (15 pts), boolean chains 12 (nesting depth added 36). 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/daemon/src/domain/native-resume-probe.ts"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"b77c31db8761119ddd60ba5f4b85c08b3cf550b1b3ab87f1aaf71810783ee12c"}},{"ruleId":"D2","level":"warning","message":{"text":"connector.runAcpAssignment (cognitive 77): connector.runAcpAssignment has cognitive complexity 77 (threshold 15). Drivers by points: if/else 25 (42 pts), ternaries 10 (18 pts), boolean chains 10, error handling 3 (4 pts), loops 2 (3 pts) (nesting depth added 27). Of this number, 28 points are the body\u0027s own statements and 49 belong to 5 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/acp/connector.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"753e066b60e0144a4ab5400b8e4bcc61f085ac5aa213fd72027519066ea17017"}},{"ruleId":"D2","level":"warning","message":{"text":"package.packageCommand (cognitive 77): package.packageCommand has cognitive complexity 77 (threshold 15). Drivers by points: if/else 29 (32 pts), loops 13 (30 pts), boolean chains 8, ternaries 2 (7 pts) (nesting depth added 25). None of this is in the body itself: all 77 points belong to 6 function items inside it that branch (a function literal at line 126, a function literal at line 62, a function literal at line 22, \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/commands/package.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"615900136c00bb7689d548d680670af4002f04068998812c5cfd311ac7b1b549"}},{"ruleId":"D2","level":"warning","message":{"text":"SnapshotCapture.captureSnapshot (cognitive 76): SnapshotCapture.captureSnapshot has cognitive complexity 76 (threshold 15). Drivers by points: ternaries 14 (30 pts), if/else 13 (28 pts), boolean chains 8, loops 3 (6 pts), error handling 2 (4 pts) (nesting depth added 36). Of this number, 70 points are the body\u0027s own statements and 6 belong to 2 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/daemon/src/domain/snapshot-capture.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"36fe60051940e09d1f261cc38e2e06ac20d50a3c893a5695e0d651e0b1fa156e"}},{"ruleId":"D2","level":"warning","message":{"text":"PodRigInstantiator.materializeValidatedSpec (cognitive 76): PodRigInstantiator.materializeValidatedSpec has cognitive complexity 76 (threshold 15). Drivers by points: if/else 21 (38 pts), ternaries 7 (16 pts), loops 9 (13 pts), boolean chains 8, error handling 1 (nesting depth added 30). Of this number, 21 points are the body\u0027s own statements and 55 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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f855d278cefd2cfac49640c9ec37be213aa2bff8acb94cb5eff633b8a10ef28"}},{"ruleId":"D2","level":"warning","message":{"text":"restore-preconditions.validatePreRestore (cognitive 76): restore-preconditions.validatePreRestore has cognitive complexity 76 (threshold 15). Drivers by points: if/else 26 (47 pts), boolean chains 15, loops 5 (7 pts), ternaries 5 (7 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":"packages/daemon/src/domain/restore-preconditions.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9817e4c3788ea0b11f6cbb9b84f6658fc26959556885b5e41a0a89b6bbe643"}},{"ruleId":"D2","level":"warning","message":{"text":"network-connector.runNetworkBindingPass (cognitive 76): network-connector.runNetworkBindingPass has cognitive complexity 76 (threshold 15). Drivers by points: if/else 17 (42 pts), ternaries 4 (12 pts), error handling 4 (9 pts), loops 3 (7 pts), boolean chains 6 (nesting depth added 42). Of this number, 75 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/daemon/src/domain/network/network-connector.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5a64aa413c3e3edf8f78e93ca3f238f2f94932bf49f34438d519aeb327eb45"}},{"ruleId":"D2","level":"warning","message":{"text":"projects.projectsRoutes::errorResponse (cognitive 76): projects.projectsRoutes::errorResponse has cognitive complexity 76 (threshold 15). Drivers by points: ternaries 16 (70 pts), boolean chains 3, if/else 3 (nesting depth added 54). 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/daemon/src/routes/projects.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"d050576ba6889c379cff580262704df0f35265a6109aa202a73f9815ba006283"}},{"ruleId":"D2","level":"warning","message":{"text":"RigRepository.addNode (cognitive 75): RigRepository.addNode has cognitive complexity 75 (threshold 15). Drivers by points: if/else 42 (61 pts), boolean chains 8, ternaries 3 (6 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/daemon/src/domain/rig-repository.ts"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"fccbc1d2d314339caec26fd948d62ec0459721a47e9685d6dac490972c6ae9c6"}},{"ruleId":"D2","level":"warning","message":{"text":"SeatIdentityReconciler.reconcileSweep (cognitive 75): SeatIdentityReconciler.reconcileSweep has cognitive complexity 75 (threshold 15). Drivers by points: if/else 21 (37 pts), boolean chains 15, ternaries 9 (10 pts), error handling 5 (9 pts), loops 3 (4 pts) (nesting depth added 22). Of this number, 55 points are the body\u0027s own statements and 20 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/daemon/src/domain/seat-identity-reconciler.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"8adb7aeccfafd07bf54551bfe31d2a63e95d606f8ccbb950c687021276b91ba5"}},{"ruleId":"D2","level":"warning","message":{"text":"InboundRouter.attemptAction (cognitive 74): InboundRouter.attemptAction has cognitive complexity 74 (threshold 15). Drivers by points: if/else 25 (39 pts), ternaries 9 (19 pts), boolean chains 8, error handling 5 (8 pts) (nesting depth added 27). Of this number, 63 points are the body\u0027s own statements and 11 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/daemon/src/domain/gateway/slack/inbound.ts"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ce4adaf0b8ed98666eb0b85a74f8824836cb613d6d8430291ff539738fe10a"}},{"ruleId":"D2","level":"warning","message":{"text":"health.healthCommand::diagnosisRequest (cognitive 73): health.healthCommand::diagnosisRequest has cognitive complexity 73 (threshold 15). Drivers by points: if/else 14 (35 pts), ternaries 8 (28 pts), loops 2 (6 pts), boolean chains 4 (nesting depth added 45). 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/commands/health.ts"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba3fae14c95d2fc6990b9b0cafc6965a660f3d0445afc457fa6d773f2c89fa1a"}},{"ruleId":"D2","level":"warning","message":{"text":"restore-from-jsonl.analyze (cognitive 73): restore-from-jsonl.analyze has cognitive complexity 73 (threshold 15). Drivers by points: if/else 17 (42 pts), loops 8 (26 pts), boolean chains 5 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into 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/daemon/assets/plugins/openrig-core/skills/claude-compaction-restore/scripts/restore-from-jsonl.mjs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f13fdb9ccc2afe7948a2538b4b1fdc38ea506c6b7c4bfbfb48b75178b013abe"}},{"ruleId":"D2","level":"warning","message":{"text":"host.doctorLegs (cognitive 72): host.doctorLegs has cognitive complexity 72 (threshold 15). Drivers by points: if/else 19 (33 pts), ternaries 8 (22 pts), boolean chains 10, error handling 4 (7 pts) (nesting depth added 31). 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/commands/host.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb7866843956add228ad87f6276ed571071e0e9921a61c4542a1bba42b400bf"}},{"ruleId":"D2","level":"warning","message":{"text":"workflow-reconciliation.compare (cognitive 72): workflow-reconciliation.compare has cognitive complexity 72 (threshold 15). Drivers by points: if/else 25 (42 pts), loops 12 (14 pts), boolean chains 12, ternaries 2 (3 pts), error handling 1 (nesting depth added 20). Of this number, 68 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/daemon/src/domain/workflow-reconciliation.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd419798af777aaaf2d9d9567f9ed23543d2157f75991ba084d5336d8caa1d3"}},{"ruleId":"D2","level":"warning","message":{"text":"scope-task-terminal-view.readScopedTaskTerminalView (cognitive 72): scope-task-terminal-view.readScopedTaskTerminalView has cognitive complexity 72 (threshold 15). Drivers by points: if/else 22 (46 pts), ternaries 5 (10 pts), boolean chains 9, loops 3 (5 pts), error handling 1 (2 pts) (nesting depth added 32). Most of this is not in the body itself: 10 of the 72 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 180, 170, 204, \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/daemon/src/domain/terminal/scope-task-terminal-view.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"07378a95dc51cafefb5a5a3ce807f1d15da145db9c8660d179a7579be5fd8087"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp-http.grantServiceCaller (cognitive 71): mcp-http.grantServiceCaller has cognitive complexity 71 (threshold 15). Drivers by points: ternaries 14 (50 pts), boolean chains 10, if/else 9, error handling 2 (nesting depth added 36). 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/mcp-http.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"361bdfbcd4b4933a99038b41fcc284bee7fd327a740ff53628edcd2bed1a9456"}},{"ruleId":"D2","level":"warning","message":{"text":"restore-packet.restorePacketCommand (cognitive 71): restore-packet.restorePacketCommand has cognitive complexity 71 (threshold 15). Drivers by points: if/else 29 (37 pts), ternaries 5 (11 pts), boolean chains 9, loops 5 (9 pts), error handling 4 (5 pts) (nesting depth added 19). None of this is in the body itself: all 71 points belong to 3 function literals inside it that branch (lines 457, 287, 378). 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/commands/restore-packet.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"4852772fadf64f4aa07805cefa4a9607069482d0b501c9d688271fb923230f16"}},{"ruleId":"D2","level":"warning","message":{"text":"CodexRuntimeAdapter.ensureCodexCorePlugin (cognitive 71): CodexRuntimeAdapter.ensureCodexCorePlugin has cognitive complexity 71 (threshold 15). Drivers by points: if/else 26 (30 pts), boolean chains 25, error handling 8, loops 6, ternaries 2 (nesting depth added 4). Of this number, 28 points are the body\u0027s own statements and 43 belong to 12 function items 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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fff27f7c3cd0c8063a822d288b7dd42bde08fed41a4449f3a933b883afd7e20"}},{"ruleId":"D2","level":"warning","message":{"text":"connections-projection.connectionsProjection (cognitive 71): connections-projection.connectionsProjection has cognitive complexity 71 (threshold 15). Drivers by points: ternaries 26 (61 pts), boolean chains 9, error handling 1 (nesting depth added 35). Of this number, 68 points are the body\u0027s own statements and 3 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/daemon/src/domain/gateway/connections-projection.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"96bc9aa486afffcaba0689481a6cdddcab9c1c9bf5126461f9e887d6dbea971f"}},{"ruleId":"D2","level":"warning","message":{"text":"SeatLifecycleService.launchFresh (cognitive 71): SeatLifecycleService.launchFresh has cognitive complexity 71 (threshold 15). Drivers by points: if/else 26 (34 pts), ternaries 11 (22 pts), boolean chains 11, error handling 1 (3 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":"packages/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":1638}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2d41e18b7083bbc4c7cb6823661075427290203f9872618fa7bb252d820bbe"}},{"ruleId":"D2","level":"warning","message":{"text":"render.agentDetailLines (cognitive 71): render.agentDetailLines has cognitive complexity 71 (threshold 15). Drivers by points: ternaries 41 (61 pts), boolean chains 10 (nesting depth added 20). Of this number, 67 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/tui/src/render.ts"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"7894970cbdf3af52472ac804726ea90f7a3ae765b7f1ab82fa38d53b4cecdfda"}},{"ruleId":"D2","level":"warning","message":{"text":"InboundRouter.attemptLand (cognitive 70): InboundRouter.attemptLand has cognitive complexity 70 (threshold 15). Drivers by points: boolean chains 23, if/else 16 (19 pts), ternaries 10 (16 pts), error handling 6 (12 pts) (nesting depth added 15). Of this number, 68 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":"packages/daemon/src/domain/gateway/slack/inbound.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad3403861ced10a802d44aecf9b3e8e3e25d675d31fca7712886ed88a754e60"}},{"ruleId":"D2","level":"warning","message":{"text":"seat.printHumanHandoverResult (cognitive 70): seat.printHumanHandoverResult has cognitive complexity 70 (threshold 15). Drivers by points: if/else 29 (45 pts), ternaries 7 (15 pts), loops 4 (7 pts), boolean chains 3 (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/commands/seat.ts"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"36952ce7010f694842a024564ef1c70da5884a1c6192e9b144c222a819931ffb"}},{"ruleId":"D2","level":"warning","message":{"text":"DraftAwareDelivery.attempt (cognitive 69): DraftAwareDelivery.attempt has cognitive complexity 69 (threshold 15). Drivers by points: ternaries 16 (37 pts), if/else 10 (13 pts), boolean chains 9, loops 3 (6 pts), error handling 3 (4 pts) (nesting depth added 28). Of this number, 54 points are the body\u0027s own statements and 15 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":"packages/daemon/src/domain/draft-aware-delivery.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc76441561f45bea7d0da4b583fd2dbf77d18136b156a3f07e5bad6d699c926c"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin.pluginCommand (cognitive 69): plugin.pluginCommand has cognitive complexity 69 (threshold 15). Drivers by points: if/else 33 (45 pts), loops 7 (9 pts), boolean chains 6, ternaries 4 (6 pts), error handling 3 (nesting depth added 16). None of this is in the body itself: all 69 points belong to 5 function items inside it that branch (a function literal at line 205, a function literal at line 154, a function literal at line 296, \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/commands/plugin.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a14aec3a44b739ad6c42c7b34eb82fa99c37f5fceb968346841f83fdadf15f7"}},{"ruleId":"D2","level":"warning","message":{"text":"pi-runner.createPaneCompositor (cognitive 69): pi-runner.createPaneCompositor has cognitive complexity 69 (threshold 15). Drivers by points: if/else 30 (35 pts), boolean chains 16, ternaries 13 (14 pts), loops 4 (nesting depth added 6). Of this number, 21 points are the body\u0027s own statements and 48 belong to 12 function items 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e21b6ca82553eca639269a2026a56b3fbbf067229e30b9fb1cbe5f118e6bcf"}},{"ruleId":"D2","level":"warning","message":{"text":"HerdrViewer.ensureOnce (cognitive 69): HerdrViewer.ensureOnce has cognitive complexity 69 (threshold 15). Drivers by points: if/else 28 (40 pts), boolean chains 16, error handling 5 (9 pts), ternaries 3 (4 pts) (nesting depth added 17). Of this number, 63 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/daemon/src/domain/terminal/herdr-viewer.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6adb3720331e3ff784a2633f774483e75428b84fda70c4c13a0b53f46212586"}},{"ruleId":"D2","level":"warning","message":{"text":"daemon.daemonCommand (cognitive 68): daemon.daemonCommand has cognitive complexity 68 (threshold 15). Drivers by points: if/else 20 (31 pts), ternaries 10 (21 pts), loops 4 (10 pts), boolean chains 3, error handling 2, match/switch 1 (nesting depth added 28). None of this is in the body itself: all 68 points belong to 4 function literals inside it that branch (lines 200, 337, 401, \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/commands/daemon.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"509e5452853abea7083df05ff5f32681ac971e00936f5316e097196845ccca92"}},{"ruleId":"D2","level":"warning","message":{"text":"SliceDetailProjector.buildAcceptance (cognitive 68): SliceDetailProjector.buildAcceptance has cognitive complexity 68 (threshold 15). Drivers by points: if/else 19 (45 pts), loops 6 (11 pts), boolean chains 6, ternaries 5 (6 pts) (nesting depth added 32). Of this number, 64 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/daemon/src/domain/slices/slice-detail-projector.ts"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"a03b4a1fbcc8c1dfe95be1552dac45e6128acbad772e9a692d72536c1af6c19f"}},{"ruleId":"D2","level":"warning","message":{"text":"ScopePages.MissionScopePage (cognitive 68): ScopePages.MissionScopePage has cognitive complexity 68 (threshold 15). Drivers by points: ternaries 24 (55 pts), boolean chains 11, if/else 1 (2 pts) (nesting depth added 32). Of this number, 61 points are the body\u0027s own statements and 7 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/ui/src/components/project/ScopePages.tsx"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"cddbb29063732821a4a9f21541dbfe51496f42e06f09cd533dbd4848f068dd15"}},{"ruleId":"D2","level":"warning","message":{"text":"walk-consumption.analyzeWalkSuffix (cognitive 67): walk-consumption.analyzeWalkSuffix has cognitive complexity 67 (threshold 15). Drivers by points: if/else 16 (40 pts), boolean chains 15, ternaries 3 (6 pts), loops 3 (4 pts), error handling 1 (2 pts) (nesting depth added 29). Of this number, 57 points are the body\u0027s own statements and 10 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/lib/walk-consumption.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ca87ba403ea2cf2a9e1950a36b4f6366f7c776ce4968b116ca407903ba36e9"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeLauncher.launchNode (cognitive 67): NodeLauncher.launchNode has cognitive complexity 67 (threshold 15). Drivers by points: if/else 25 (28 pts), ternaries 15 (19 pts), boolean chains 16, error handling 2, loops 1 (2 pts) (nesting depth added 8). Of this number, 53 points are the body\u0027s own statements and 14 belong to 4 function items 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/daemon/src/domain/node-launcher.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"116392f3a407250be9178c07641646c2342b08621c2b900e95e179b0693af273"}},{"ruleId":"D2","level":"warning","message":{"text":"execution-view.buildExecutionView::ladderOf (cognitive 67): execution-view.buildExecutionView::ladderOf has cognitive complexity 67 (threshold 15). Drivers by points: ternaries 20 (32 pts), if/else 11 (22 pts), boolean chains 7, loops 4 (6 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (execution-view.buildExecutionView) 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/daemon/src/domain/execution-view.ts"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"8058906864cb5f29e8acac0a7a4edbdc5b27763b5c96fdb0bbbf5feeb512212c"}},{"ruleId":"D2","level":"warning","message":{"text":"provider-seat-accounts.configuredSeatAccounts (cognitive 67): provider-seat-accounts.configuredSeatAccounts has cognitive complexity 67 (threshold 15). Drivers by points: if/else 14 (29 pts), ternaries 11 (29 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 34). Most of this is not in the body itself: 8 of the 67 points are its own statements and the rest belongs to one function literal inside it that branches (line 57). 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/daemon/src/domain/provider/provider-seat-accounts.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"b47feb6051f919b21ea22ad25fce45eff483698c5095b8e30e8fcc38bd177fee"}},{"ruleId":"D2","level":"warning","message":{"text":"render.renderPulseScreen (cognitive 67): render.renderPulseScreen has cognitive complexity 67 (threshold 15). Drivers by points: if/else 14 (29 pts), ternaries 14 (20 pts), boolean chains 11, loops 5 (7 pts) (nesting depth added 23). Of this number, 66 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/tui/src/render.ts"},"region":{"startLine":1640}}}],"partialFingerprints":{"codehealthFindingId/v1":"af781d60cc5e1382ead0fdd62af4c70fbe749f3bea3eb0b18d2302cc535d3f49"}},{"ruleId":"D2","level":"warning","message":{"text":"bootstrap.bootstrapCommand (cognitive 66): bootstrap.bootstrapCommand has cognitive complexity 66 (threshold 15). Drivers by points: if/else 22 (33 pts), loops 7 (20 pts), ternaries 6 (9 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 28). None of this is in the body itself: all 66 points belong to 2 function items inside it that branch (a function literal at line 47, getTarget). 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/commands/bootstrap.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2864f7792fbe4341f8540e59656455c0200d5597a386cc43af5c36fac732b0"}},{"ruleId":"D2","level":"warning","message":{"text":"exec.execCommand (cognitive 66): exec.execCommand has cognitive complexity 66 (threshold 15). Drivers by points: if/else 31 (42 pts), ternaries 10 (15 pts), boolean chains 7, loops 2 (nesting depth added 16). None of this is in the body itself: all 66 points belong to 9 function items inside it that branch (a function literal at line 464, waitForEnd, a function literal at line 553, \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/commands/exec.ts"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9fe2d9b046cc755e4b02a818de1b4c4b6863d43abb8c70f735450e5bebc6e10"}},{"ruleId":"D2","level":"warning","message":{"text":"PluginDiscoveryService.listPlugins (cognitive 66): PluginDiscoveryService.listPlugins has cognitive complexity 66 (threshold 15). Drivers by points: if/else 15 (45 pts), loops 8 (21 pts) (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into 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/daemon/src/domain/plugin-discovery-service.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da7def258222e4b4f6e494c2f4f4ba1ef49166fbba5f296b311c762a1f33396"}},{"ruleId":"D2","level":"warning","message":{"text":"task-terminal-view.readTaskTerminalSnapshot (cognitive 66): task-terminal-view.readTaskTerminalSnapshot has cognitive complexity 66 (threshold 15). Drivers by points: if/else 21 (42 pts), loops 10 (14 pts), boolean chains 6, error handling 2 (3 pts), ternaries 1 (nesting depth added 26). Of this number, 48 points are the body\u0027s own statements and 18 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/daemon/src/domain/terminal/task-terminal-view.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"140dfb02552776f08b508236d7ef8a2c9d52ed2e010d4aa512cce72bacd3b8b3"}},{"ruleId":"D2","level":"warning","message":{"text":"send.runFanOutSend (cognitive 65): send.runFanOutSend has cognitive complexity 65 (threshold 15). Drivers by points: if/else 24 (33 pts), ternaries 10 (18 pts), boolean chains 10, loops 2 (3 pts), error handling 1 (nesting depth added 18). Of this number, 53 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/commands/send.ts"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e6726f4377e5e22596675fa31d2ad6c869ad9b5bf83e7e74d66866d56a718d"}},{"ruleId":"D2","level":"warning","message":{"text":"RestoreOrchestrator.restore (cognitive 65): RestoreOrchestrator.restore has cognitive complexity 65 (threshold 15). Drivers by points: if/else 22 (32 pts), boolean chains 15, ternaries 8 (10 pts), loops 5 (6 pts), error handling 2 (nesting depth added 13). Of this number, 58 points are the body\u0027s own statements and 7 belong to 6 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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"5860e0f5a8f8b2bbdd99f33dfeb0a46e32d5fa3dcecd4b32c177734fc08eeb95"}},{"ruleId":"D2","level":"warning","message":{"text":"open-asks.postOpenAsks (cognitive 65): open-asks.postOpenAsks has cognitive complexity 65 (threshold 15). Drivers by points: if/else 13 (24 pts), ternaries 9 (24 pts), boolean chains 9, error handling 4, loops 4 (nesting depth added 26). Of this number, 48 points are the body\u0027s own statements and 17 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/daemon/src/domain/gateway/slack/open-asks.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e065439c22c04c57aad395811f2940bb856af8538fde4b5d995ee6a91930cd3"}},{"ruleId":"D2","level":"warning","message":{"text":"refocus-record.readRefocusRecord (cognitive 65): refocus-record.readRefocusRecord has cognitive complexity 65 (threshold 15). Drivers by points: ternaries 12 (43 pts), if/else 10 (17 pts), boolean chains 2, error handling 2, loops 1 (nesting depth added 38). 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/daemon/src/domain/refocus-record.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e033a181f6a7f1375f476dfd2553ff98104487e3568c310aebaf39e6f2eb38b"}},{"ruleId":"D2","level":"warning","message":{"text":"sessions.nodesRoutes.post(\u0022/:logicalId/launch\u0022) (cognitive 65): sessions.nodesRoutes.post(\u0022/:logicalId/launch\u0022) has cognitive complexity 65 (threshold 15). Drivers by points: ternaries 9 (32 pts), if/else 16 (31 pts), boolean chains 2 (nesting depth added 38). 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/daemon/src/routes/sessions.ts"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2e4f23052b7c7b8913f9f9efc4be0d710498b8b46e11cc76b6d65c5569e465"}},{"ruleId":"D2","level":"warning","message":{"text":"CodexInPlaceRestart.observe (cognitive 64): CodexInPlaceRestart.observe has cognitive complexity 64 (threshold 15). Drivers by points: if/else 29 (37 pts), boolean chains 12, ternaries 9 (10 pts), error handling 2 (4 pts), loops 1 (nesting depth added 11). Of this number, 63 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":"packages/daemon/src/domain/seat-restart-in-place.ts"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8f65584fd3a0f4956cd29bc8312535802382c397d14f3bd626491221ec9096"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkflowRuntime.route (cognitive 64): WorkflowRuntime.route has cognitive complexity 64 (threshold 15). Drivers by points: ternaries 17 (30 pts), if/else 19 (27 pts), boolean chains 7 (nesting depth added 21). Most of this is not in the body itself: 1 of the 64 points is its own statement and the rest belongs to 5 function literals inside it that branch (lines 1550, 1563, 1661, \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/daemon/src/domain/workflow-runtime.ts"},"region":{"startLine":1520}}}],"partialFingerprints":{"codehealthFindingId/v1":"602bdd6d185822e9d33a67f7ca60e818ffbbf634b411b50c8af1eb568316f7e4"}},{"ruleId":"D2","level":"warning","message":{"text":"DiscoveryPanel.DiscoveryPanel (cognitive 64): DiscoveryPanel.DiscoveryPanel has cognitive complexity 64 (threshold 15). Drivers by points: ternaries 16 (42 pts), if/else 11 (12 pts), boolean chains 10 (nesting depth added 27). Most of this is not in the body itself: 2 of the 64 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 260, handleConfirm, a function literal at line 163, \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/ui/src/components/DiscoveryPanel.tsx"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e19783a1360dcc13d3a7d16fc1613cba49e61afa065a29621c47747920a0917"}},{"ruleId":"D2","level":"warning","message":{"text":"trace-to-root.render_work (cognitive 64): trace-to-root.render_work has cognitive complexity 64 (threshold 15). Drivers by points: if/else 19 (43 pts), ternaries 4 (14 pts), error handling 1 (4 pts), boolean chains 2, loops 1 (nesting depth added 37). 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/daemon/assets/plugins/openrig-core/skills/refocusing/scripts/trace-to-root.py"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e301d84d3cf78010521e8b1f59ac9b169c9963605fd150382695b7b4d69bbfc"}},{"ruleId":"D2","level":"warning","message":{"text":"human-registry.validateHumanFragment (cognitive 63): human-registry.validateHumanFragment has cognitive complexity 63 (threshold 15). Drivers by points: if/else 31 (45 pts), boolean chains 11, ternaries 3 (5 pts), loops 2 (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/daemon/src/domain/gateway/human-registry.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca16791c1cd5d9893419376997e069779ee099d6cb4b312e88c228a05411e9cc"}},{"ruleId":"D2","level":"warning","message":{"text":"human-registry.setHumanField (cognitive 63): human-registry.setHumanField has cognitive complexity 63 (threshold 15). Drivers by points: if/else 27 (38 pts), ternaries 9 (16 pts), boolean chains 9 (nesting depth added 18). Of this number, 60 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/daemon/src/domain/gateway/human-registry.ts"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"314b713921fbc2f026faaf1bb22dc1207d247b1e74d627aac03daaa52665186e"}},{"ruleId":"D2","level":"warning","message":{"text":"seat.seatCommand::runLifecycleVerb (cognitive 63): seat.seatCommand::runLifecycleVerb has cognitive complexity 63 (threshold 15). Drivers by points: ternaries 10 (35 pts), if/else 10 (13 pts), boolean chains 12, loops 1 (2 pts), error handling 1 (nesting depth added 29). 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/commands/seat.ts"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaacca02921cf44b5811fee186550d2fdfbf8a98656e084ffb9a78a5455e1abe"}},{"ruleId":"D2","level":"warning","message":{"text":"relay-inbound.createRelayInboundHandler.ackOutbox (cognitive 63): relay-inbound.createRelayInboundHandler.ackOutbox has cognitive complexity 63 (threshold 15). Drivers by points: if/else 17 (24 pts), boolean chains 16, error handling 8 (11 pts), ternaries 4 (8 pts), loops 2 (4 pts) (nesting depth added 16). Most of this is not in the body itself: 7 of the 63 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 1051, 1070, 1087). 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/daemon/src/domain/gateway/relay-inbound.ts"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"c05d152f6d744a4c236aa29f75540196cd0abf38979f008b6541207f089784eb"}},{"ruleId":"D2","level":"warning","message":{"text":"mission-control.missionControlRoutes::errorResponse (cognitive 63): mission-control.missionControlRoutes::errorResponse has cognitive complexity 63 (threshold 15). Drivers by points: ternaries 12 (60 pts), if/else 2, boolean chains 1 (nesting depth added 48). 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. This shape REPEATS in the file: one other method here (mission-control.missionControlRoutes::listDestinations) 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/daemon/src/routes/mission-control.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"858707e111894a4c5eef9a0525b049c53f91b24050ff1290e91548198ba4c92c"}},{"ruleId":"D2","level":"warning","message":{"text":"up.formatRemoteUpFailure (cognitive 62): up.formatRemoteUpFailure has cognitive complexity 62 (threshold 15). Drivers by points: if/else 18 (32 pts), ternaries 8 (14 pts), boolean chains 13, loops 2 (3 pts) (nesting depth added 21). Of this number, 61 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/commands/up.ts"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"5297cb41409bd500a16c0245c77353cfea98fb7550e9d4875292d78af2cb82f0"}},{"ruleId":"D2","level":"warning","message":{"text":"SeatHandoverService.recoveredConversation (cognitive 62): SeatHandoverService.recoveredConversation has cognitive complexity 62 (threshold 15). Drivers by points: ternaries 21 (49 pts), if/else 8 (9 pts), boolean chains 4 (nesting depth added 29). Of this number, 61 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/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"d056972889ae13e741a420bafcd89a8832b4940d8d3015ded9f84fa9fd585298"}},{"ruleId":"D2","level":"warning","message":{"text":"RigLifecycleService.removeNodeWithin (cognitive 62): RigLifecycleService.removeNodeWithin has cognitive complexity 62 (threshold 15). Drivers by points: if/else 20 (29 pts), boolean chains 15, ternaries 8 (12 pts), loops 3 (6 pts) (nesting depth added 16). Of this number, 57 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/daemon/src/domain/rig-lifecycle-service.ts"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3dbe69d764ad37acca9a72346f19f82101fe0ae756e72cd0f8b60e6283afebf"}},{"ruleId":"D2","level":"warning","message":{"text":"connections-model.connectionsLines (cognitive 62): connections-model.connectionsLines has cognitive complexity 62 (threshold 15). Drivers by points: ternaries 13 (29 pts), loops 9 (18 pts), if/else 8 (14 pts), boolean chains 1 (nesting depth added 31). Of this number, 61 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/tui/src/connections/connections-model.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5bd4c3dd8615976d650d55dfcf2f18adf74d61bf2e3b3f5695b0b5d3086ade"}},{"ruleId":"D2","level":"warning","message":{"text":"queue-receipt.rowLines (cognitive 61): queue-receipt.rowLines has cognitive complexity 61 (threshold 15). Drivers by points: ternaries 13 (29 pts), if/else 21, boolean chains 9, loops 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":"packages/cli/src/queue-receipt.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"93b9ddae9c78740e65e59777000f5733453862669de20687e94902548de8f699"}},{"ruleId":"D2","level":"warning","message":{"text":"CodexResumeAdapter.resume (cognitive 61): CodexResumeAdapter.resume has cognitive complexity 61 (threshold 15). Drivers by points: ternaries 25 (35 pts), if/else 12 (16 pts), boolean chains 8, error handling 1 (2 pts) (nesting depth added 15). Of this number, 59 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/daemon/src/adapters/codex-resume.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e97899644c21ab555eb4d5a23a43092c608bc6189aeb52f6c23da0271336a13"}},{"ruleId":"D2","level":"warning","message":{"text":"HealthDiagnosisService.evaluateOnce (cognitive 61): HealthDiagnosisService.evaluateOnce has cognitive complexity 61 (threshold 15). Drivers by points: if/else 16 (33 pts), boolean chains 12, ternaries 4 (11 pts), error handling 1 (4 pts), loops 1 (nesting depth added 27). Of this number, 60 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/daemon/src/domain/health-diagnosis.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaca041929e5809e64072483ba4908c7ed9caa05e5b2175e3cfba772db60eea5"}},{"ruleId":"D2","level":"warning","message":{"text":"SeatRuntimeSwitchService.recover (cognitive 61): SeatRuntimeSwitchService.recover has cognitive complexity 61 (threshold 15). Drivers by points: if/else 16 (24 pts), ternaries 7 (21 pts), boolean chains 8, error handling 3 (6 pts), loops 1 (2 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":"packages/daemon/src/domain/seat-runtime-switch-service.ts"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22e84b4c86e67573f85f7afb38ac5f7303923d2951deb83fe61203ccaff246e"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamClassificationWorker.wake (cognitive 61): StreamClassificationWorker.wake has cognitive complexity 61 (threshold 15). Drivers by points: if/else 19 (39 pts), ternaries 3 (10 pts), error handling 4 (9 pts), boolean chains 2, loops 1 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/stream-classification-worker.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"c97546465d0aa4eed09c2e8242bdd0a93bc0eff71a5751c12676e2b94d3ba25a"}},{"ruleId":"D2","level":"warning","message":{"text":"compaction.compactionRoutes (cognitive 61): compaction.compactionRoutes has cognitive complexity 61 (threshold 15). Drivers by points: ternaries 17 (32 pts), if/else 20 (23 pts), boolean chains 6 (nesting depth added 18). None of this is in the body itself: all 61 points belong to 3 function literals inside it that branch (lines 28, 152, 133). 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/daemon/src/routes/compaction.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a5607043fdb1ddf9a7e290faa2119bd70d4aaeea40214c04eeafb212de47c6"}},{"ruleId":"D2","level":"warning","message":{"text":"rig-cmux.rigCmuxRoutes.post(\u0022/launch\u0022) (cognitive 61): rig-cmux.rigCmuxRoutes.post(\u0022/launch\u0022) has cognitive complexity 61 (threshold 15). Drivers by points: if/else 15 (33 pts), loops 8 (11 pts), boolean chains 8, ternaries 4 (6 pts), error handling 1 (3 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":"packages/daemon/src/routes/rig-cmux.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"616c8c1505fe159d1d4cfa71f35659e4b6813ebd253e127742add4607e4133f8"}},{"ruleId":"D2","level":"warning","message":{"text":"scopes.scopesRoutes (cognitive 61): scopes.scopesRoutes has cognitive complexity 61 (threshold 15). Drivers by points: if/else 29 (35 pts), boolean chains 10, error handling 6 (7 pts), ternaries 6 (7 pts), loops 2 (nesting depth added 8). None of this is in the body itself: all 61 points belong to 10 function literals inside it that branch (lines 160, 113, 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/daemon/src/routes/scopes.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c24d02845b5c6e4d9f92bb253988282c5cdec07e6150dd01e94f88f00d0a06"}},{"ruleId":"D2","level":"warning","message":{"text":"rig-repository.isStoredRigSpec (cognitive 60): rig-repository.isStoredRigSpec has cognitive complexity 60 (threshold 15). Drivers by points: boolean chains 41, if/else 17 (19 pts) (nesting depth added 2). Of this number, 25 points are the body\u0027s own statements and 35 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/daemon/src/domain/rig-repository.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b49b8e567eb2971efed0b96da8cf9d7e903f96a94e5f29e8ca41eed5776116b"}},{"ruleId":"D2","level":"warning","message":{"text":"seat-skill-storage.cleanSeatSkills (cognitive 60): seat-skill-storage.cleanSeatSkills has cognitive complexity 60 (threshold 15). Drivers by points: if/else 18 (31 pts), error handling 6 (11 pts), loops 8 (11 pts), boolean chains 7 (nesting depth added 21). Of this number, 51 points are the body\u0027s own statements and 9 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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb785a37911602811fb3d5e4f6929518836f7c8287eddc5ddd8db1732fc3a6d"}},{"ruleId":"D2","level":"warning","message":{"text":"EnvironmentStartup.launch (cognitive 60): EnvironmentStartup.launch has cognitive complexity 60 (threshold 15). Drivers by points: if/else 20 (33 pts), boolean chains 11, ternaries 6 (7 pts), error handling 3 (6 pts), loops 2 (3 pts) (nesting depth added 18). Of this number, 55 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/daemon/src/domain/environment-startup.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9dc5c1c43a89f60de4d347b39a6c189410942e9945971599089954d5f5cc3c4"}},{"ruleId":"D2","level":"warning","message":{"text":"scope.buildAuditCommand (cognitive 60): scope.buildAuditCommand has cognitive complexity 60 (threshold 15). Drivers by points: if/else 20 (34 pts), loops 7 (12 pts), ternaries 5 (10 pts), boolean chains 3, error handling 1 (nesting depth added 24). None of this is in the body itself: all 60 points belong to 2 function literals inside it that branch (lines 1271, 1447). 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/commands/scope.ts"},"region":{"startLine":1266}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4cc8a41689527f15d52d1738bec9960a482c4985be088076b3affbec29615ef"}},{"ruleId":"D2","level":"warning","message":{"text":"terminal.terminalCommand (cognitive 60): terminal.terminalCommand has cognitive complexity 60 (threshold 15). Drivers by points: if/else 20 (25 pts), ternaries 16 (22 pts), boolean chains 11, error handling 1, loops 1 (nesting depth added 11). None of this is in the body itself: all 60 points belong to 5 function literals inside it that branch (lines 211, 345, 306, \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/commands/terminal.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"e35215f957eae1da1de10a23f7c3aa84b5c0ee1d2f0954018904fc7795381eb3"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionFingerprinter.fingerprint (cognitive 60): SessionFingerprinter.fingerprint has cognitive complexity 60 (threshold 15). Drivers by points: if/else 15 (30 pts), loops 6 (14 pts), ternaries 3 (12 pts), boolean chains 4 (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/session-fingerprinter.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd0e3be74e80d40b871fccd84bad13e8adfd936f4df5e3a12f83e4b4328ef2be"}},{"ruleId":"D2","level":"warning","message":{"text":"StartupController.key (cognitive 60): StartupController.key has cognitive complexity 60 (threshold 15). Drivers by points: if/else 29 (35 pts), boolean chains 18, ternaries 4 (7 pts) (nesting depth added 9). Of this number, 56 points are the body\u0027s own statements and 4 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":"packages/tui/src/startup.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5b0fa8dee375334ba13b1180c9fd6f7d788942802387ed9e6da2ef83bf07c2"}},{"ruleId":"D2","level":"warning","message":{"text":"RigNode.RigNode (cognitive 60): RigNode.RigNode has cognitive complexity 60 (threshold 15). Drivers by points: ternaries 27 (35 pts), boolean chains 19, if/else 5, error handling 1 (nesting depth added 8). Of this number, 52 points are the body\u0027s own statements and 8 belong to 6 function items 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":"packages/ui/src/components/RigNode.tsx"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b0636b63532435e698b7f5fe4d082264d9afe5953224442f3620cf7e1a65cc"}},{"ruleId":"D2","level":"warning","message":{"text":"tmux-server-selection.selectTmuxServer (cognitive 59): tmux-server-selection.selectTmuxServer has cognitive complexity 59 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 16, ternaries 9 (14 pts), error handling 3 (6 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":"packages/daemon/src/domain/tmux-server-selection.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf291c41d6748e671d51c7173f898fef156fcbb96baefb16951d257a2055473"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionTransport.classifySendReadiness (cognitive 59): SessionTransport.classifySendReadiness has cognitive complexity 59 (threshold 15). Drivers by points: if/else 13 (27 pts), boolean chains 16, ternaries 7 (15 pts), error handling 1 (nesting depth added 22). Of this number, 58 points are the body\u0027s own statements and 1 belongs to one function item 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":4475}}}],"partialFingerprints":{"codehealthFindingId/v1":"6199f2c4a7ee2538a0b00bbd4d523e8dcaedec76299dfe1663bd4b76ed1f3bef"}},{"ruleId":"D2","level":"warning","message":{"text":"seat-attention.checkSeatAttention (cognitive 59): seat-attention.checkSeatAttention has cognitive complexity 59 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 8 (15 pts), ternaries 3 (10 pts), boolean chains 4, error handling 2 (4 pts) (nesting depth added 32). Of this number, 56 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/seat-attention.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb71796fa3aa0aad9734304e6f330be090d84c20bdce63783a66d76e7227dfc1"}},{"ruleId":"D2","level":"warning","message":{"text":"bundle-source-resolver.materializePodBundle (cognitive 59): bundle-source-resolver.materializePodBundle has cognitive complexity 59 (threshold 15). Drivers by points: if/else 15 (32 pts), loops 7 (12 pts), boolean chains 6, ternaries 3 (5 pts), error handling 2 (4 pts) (nesting depth added 26). Of this number, 53 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/daemon/src/domain/bundle-source-resolver.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"91454fa76339dcb81a790f5ae4fcf413bf52bd6a0d68bc7c22c3a95ad37ab107"}},{"ruleId":"D2","level":"warning","message":{"text":"stylize.stylizeLines (cognitive 59): stylize.stylizeLines has cognitive complexity 59 (threshold 15). Drivers by points: if/else 19 (27 pts), ternaries 7 (23 pts), boolean chains 6, loops 1 (3 pts) (nesting depth added 26). Most of this is not in the body itself: 1 of the 59 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 139, 229, 158). 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/tui/src/stylize.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e26ba358295dd2adc4eade77bc9ec87f0d349c86b0d750a40ec68e86fa97ee5"}},{"ruleId":"D2","level":"warning","message":{"text":"InstallPlanner.plan (cognitive 58): InstallPlanner.plan has cognitive complexity 58 (threshold 15). Drivers by points: if/else 15 (29 pts), ternaries 5 (11 pts), loops 7 (10 pts), boolean chains 8 (nesting depth added 23). Of this number, 56 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/daemon/src/domain/install-planner.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"27edf5c2d6d16be7d708699386eec5e001c287ae3fd229b5b66a7ebb3cd060a1"}},{"ruleId":"D2","level":"warning","message":{"text":"node-inventory.buildRestoreOutcomeMap (cognitive 58): node-inventory.buildRestoreOutcomeMap has cognitive complexity 58 (threshold 15). Drivers by points: if/else 10 (23 pts), ternaries 7 (15 pts), boolean chains 9, loops 5 (9 pts), error handling 1 (2 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":"packages/daemon/src/domain/node-inventory.ts"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa971adfcb9d83b76ee414dd20dcf274dbf4efa15e26ccb44e1e2d62f1fd240"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeCompactionEnforcer.maybeAutoCompactUnchecked (cognitive 58): ClaudeCompactionEnforcer.maybeAutoCompactUnchecked has cognitive complexity 58 (threshold 15). Drivers by points: if/else 29 (36 pts), boolean chains 13, ternaries 4 (9 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":"packages/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":1326}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b906a244be9006c1e1dfc391dcce6455d5d56afd1af23f206cdad508d91a92e"}},{"ruleId":"D2","level":"warning","message":{"text":"CodexRuntimeAdapter.prepareLaunch (cognitive 58): CodexRuntimeAdapter.prepareLaunch has cognitive complexity 58 (threshold 15). Drivers by points: ternaries 25 (32 pts), boolean chains 16, if/else 7 (8 pts), error handling 1 (2 pts) (nesting depth added 9). Of this number, 54 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":"packages/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"23cd956ea05216cb957f889d5735a9bb3a8444ba99d53fbbd1c7595e57cbbf5c"}},{"ruleId":"D2","level":"warning","message":{"text":"SeatIdentityReconciler.computeVerdict (cognitive 58): SeatIdentityReconciler.computeVerdict has cognitive complexity 58 (threshold 15). Drivers by points: if/else 18 (30 pts), ternaries 8 (14 pts), boolean chains 12, error handling 1 (2 pts) (nesting depth added 19). Of this number, 57 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/daemon/src/domain/seat-identity-reconciler.ts"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d51f628b80284cc819e10ab25a3cc7ccb7db53701660cef0fa0d8e5973e79b"}},{"ruleId":"D2","level":"warning","message":{"text":"stream.streamRoutes (cognitive 58): stream.streamRoutes has cognitive complexity 58 (threshold 15). Drivers by points: if/else 27 (34 pts), boolean chains 12, ternaries 6, error handling 3 (4 pts), loops 2 (nesting depth added 8). None of this is in the body itself: all 58 points belong to 11 function literals inside it that branch (lines 94, 217, 175, \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/daemon/src/routes/stream.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a3752adf517de41192490efc54dfdf044d06694b585f28ea268dbb878cfc763"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectTreeView.ProjectTreeView (cognitive 58): ProjectTreeView.ProjectTreeView has cognitive complexity 58 (threshold 15). Drivers by points: ternaries 25 (38 pts), if/else 6 (10 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 18). Of this number, 22 points are the body\u0027s own statements and 36 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":"packages/ui/src/components/project/ProjectTreeView.tsx"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57de12ce29db94fe7f33d4e0d25d00c460e7eb67ce7c005bff51f303ae3aa26"}},{"ruleId":"D2","level":"warning","message":{"text":"TerminalLauncher.TerminalLauncher (cognitive 58): TerminalLauncher.TerminalLauncher has cognitive complexity 58 (threshold 15). Drivers by points: ternaries 33 (43 pts), boolean chains 11, if/else 4 (nesting depth added 10). Of this number, 34 points are the body\u0027s own statements and 24 belong to 7 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":"packages/ui/src/components/topology/TerminalLauncher.tsx"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"a41a2f91e80a6b2c5a64c4dd66bb165eef4f506aa965cd95c097261ce9d87814"}},{"ruleId":"D2","level":"warning","message":{"text":"generated-file-hygiene.excludeNewGeneratedFiles (cognitive 57): generated-file-hygiene.excludeNewGeneratedFiles has cognitive complexity 57 (threshold 15). Drivers by points: if/else 16 (25 pts), ternaries 9 (13 pts), boolean chains 12, loops 3 (4 pts), error handling 3 (nesting depth added 14). Of this number, 49 points are the body\u0027s own statements and 8 belong to 5 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/daemon/src/domain/generated-file-hygiene.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ee580ecd18e9404159bf0124a0a77667fde01cccf9caf75fd8c8eb2e3a355d"}},{"ruleId":"D2","level":"warning","message":{"text":"projection-planner.planProjection (cognitive 57): projection-planner.planProjection has cognitive complexity 57 (threshold 15). Drivers by points: if/else 15 (43 pts), ternaries 2 (6 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 33). Of this number, 55 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/daemon/src/domain/projection-planner.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f29daebeededcbe2c2e188562456a51145db5df5fd84c3768e53fd898001aa"}},{"ruleId":"D2","level":"warning","message":{"text":"session-transport.classifyPaneActivity (cognitive 57): session-transport.classifyPaneActivity has cognitive complexity 57 (threshold 15). Drivers by points: boolean chains 21, if/else 17 (18 pts), ternaries 15 (18 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/session-transport.ts"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f010aeceaca37dfbe5bc7e14083df72d0dfd54d0dbc419dbd2bbfa1a3a9424"}},{"ruleId":"D2","level":"warning","message":{"text":"whoami.whoamiCommand (cognitive 57): whoami.whoamiCommand has cognitive complexity 57 (threshold 15). Drivers by points: if/else 27 (32 pts), ternaries 5 (10 pts), boolean chains 9, loops 3 (6 pts) (nesting depth added 13). None of this is in the body itself: all 57 points belong to one function literal inside it that branches (line 309). 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/commands/whoami.ts"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec6e3b46b67500f587e8e16b1f67b0cbcd09b48b97b1e8632c6106869cc2c582"}},{"ruleId":"D2","level":"warning","message":{"text":"doctor.runDoctorChecks (cognitive 57): doctor.runDoctorChecks has cognitive complexity 57 (threshold 15). Drivers by points: if/else 21 (30 pts), ternaries 7 (16 pts), error handling 4 (7 pts), boolean chains 4 (nesting depth added 21). Of this number, 42 points are the body\u0027s own statements and 15 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/commands/doctor.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea28b1096232d551204237e4c7606188e039dd4fe2750d06dde2e6f4d8997da4"}},{"ruleId":"D2","level":"warning","message":{"text":"workflow-follow.followInstance (cognitive 57): workflow-follow.followInstance has cognitive complexity 57 (threshold 15). Drivers by points: if/else 14 (33 pts), ternaries 4 (12 pts), loops 3 (6 pts), error handling 2 (4 pts), boolean chains 2 (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":"packages/cli/src/commands/workflow-follow.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"928567983c9ab9aa6b7175823f83da5de642bc5783d81fd4fb6eaaccf35fce77"}},{"ruleId":"D2","level":"warning","message":{"text":"CodexRuntimeAdapter.projectEntry (cognitive 57): CodexRuntimeAdapter.projectEntry has cognitive complexity 57 (threshold 15). Drivers by points: if/else 18 (30 pts), boolean chains 12, ternaries 6 (11 pts), error handling 1 (2 pts), 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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":1460}}}],"partialFingerprints":{"codehealthFindingId/v1":"29dc3c223f9f3da6f5ef6ffde694c98b704af358f593ad93fb27ff6cd82b6d3d"}},{"ruleId":"D2","level":"warning","message":{"text":"WhoamiService.resolve (cognitive 57): WhoamiService.resolve has cognitive complexity 57 (threshold 15). Drivers by points: if/else 19 (35 pts), ternaries 10 (12 pts), boolean chains 5, loops 4 (5 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/daemon/src/domain/whoami-service.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe392853199433028c8b8e793cd832dbc4729aebb0f509feda506b5af3d0d0a"}},{"ruleId":"D2","level":"warning","message":{"text":"WatchdogPolicyEngine.recordAttempt (cognitive 57): WatchdogPolicyEngine.recordAttempt has cognitive complexity 57 (threshold 15). Drivers by points: ternaries 19 (36 pts), if/else 12, boolean chains 9 (nesting depth added 17). Of this number, 45 points are the body\u0027s own statements and 12 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/daemon/src/domain/watchdog-policy-engine.ts"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f2f075c8d9e8da7182edc161dfd3e1f9a2b07b2ba919ad228468d941f214b19"}},{"ruleId":"D2","level":"warning","message":{"text":"claude-token-usage.parseClaudeTokenUsage (cognitive 57): claude-token-usage.parseClaudeTokenUsage has cognitive complexity 57 (threshold 15). Drivers by points: ternaries 9 (23 pts), if/else 10 (22 pts), boolean chains 6, loops 3 (4 pts), error handling 1 (2 pts) (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":"packages/daemon/src/domain/provider/claude-token-usage.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"14b294ae8a78e4cfb426b5210bb82aee1139691a95275723429888bf12eff490"}},{"ruleId":"D2","level":"warning","message":{"text":"rig-mode.rigModeRoutes (cognitive 57): rig-mode.rigModeRoutes has cognitive complexity 57 (threshold 15). Drivers by points: if/else 25 (32 pts), error handling 6 (13 pts), boolean chains 10, ternaries 2 (nesting depth added 14). None of this is in the body itself: all 57 points belong to 7 function items inside it that branch (a function literal at line 189, a function literal at line 223, unset, \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/daemon/src/routes/rig-mode.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c505967c23a7862e995a9e999ab9c20dfb666b4b25f781e3eb1a22ef5afcc03"}},{"ruleId":"D2","level":"warning","message":{"text":"migrate-telemetry-state-0.5.9.applyLibrary (cognitive 57): migrate-telemetry-state-0.5.9.applyLibrary has cognitive complexity 57 (threshold 15). Drivers by points: ternaries 11 (22 pts), if/else 15 (19 pts), boolean chains 8, loops 3 (5 pts), error handling 3 (nesting depth added 17). Of this number, 56 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":"skills/_canonical/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f86b0580d0d4d330e9fdcb9c9816b83181708b36746fd3b0c39073fce7f5aa7"}},{"ruleId":"D2","level":"warning","message":{"text":"SeatDeliveryGuard.beforeInput (cognitive 56): SeatDeliveryGuard.beforeInput has cognitive complexity 56 (threshold 15). Drivers by points: if/else 18 (32 pts), boolean chains 14, ternaries 4 (10 pts) (nesting depth added 20). Of this number, 54 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":"packages/daemon/src/domain/seat-delivery-guard.ts"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a0a82f8760db4d41022da7195ce120ca8827032de41dffe8772abb2e33b27c"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeResumeAdapter.resume (cognitive 56): ClaudeResumeAdapter.resume has cognitive complexity 56 (threshold 15). Drivers by points: if/else 23 (32 pts), ternaries 26 (30 pts), boolean chains 16, error handling 3 (6 pts) (nesting depth added 16). 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 (ClaudeResumeAdapter.resume::sendClassic) 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/daemon/src/adapters/claude-resume.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9424a8cbc971c4fa5cb8fbedd7855fc6898d90cf601c6b36aca8aa564ac982c"}},{"ruleId":"D2","level":"warning","message":{"text":"community-harness-presets.parsePreset (cognitive 56): community-harness-presets.parsePreset has cognitive complexity 56 (threshold 15). Drivers by points: if/else 26 (32 pts), boolean chains 18, ternaries 3 (4 pts), error handling 1, loops 1 (nesting depth added 7). 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/daemon/src/domain/community-harness-presets.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"f93d2f3a17f47ccb559d98c0e92a961bf4cdcd51564dd1ec165f539c7ca2d5ff"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeCompactionEnforcer.triggerManualCompactUnchecked (cognitive 56): ClaudeCompactionEnforcer.triggerManualCompactUnchecked has cognitive complexity 56 (threshold 15). Drivers by points: if/else 19 (29 pts), ternaries 5 (9 pts), boolean chains 8, error handling 2 (6 pts), loops 3 (4 pts) (nesting depth added 19). Of this number, 41 points are the body\u0027s own statements and 15 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e5f62fb2d4c0c920d7c367952d1f065677608bf8d19614841fe5e2edd4d37c"}},{"ruleId":"D2","level":"warning","message":{"text":"bundle-types.validateLegacyBundleManifest (cognitive 56): bundle-types.validateLegacyBundleManifest has cognitive complexity 56 (threshold 15). Drivers by points: if/else 21 (37 pts), boolean chains 14, loops 2 (5 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/daemon/src/domain/bundle-types.ts"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"4774496a629254133e37aeec92fff0b5b1fc2793a892ebd73bd8063203b0b4b3"}},{"ruleId":"D2","level":"warning","message":{"text":"manifest-parser.parseAgentImageManifest (cognitive 56): manifest-parser.parseAgentImageManifest has cognitive complexity 56 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 15, ternaries 11 (15 pts), loops 1 (2 pts), error handling 1 (nesting depth added 15). Of this number, 55 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/daemon/src/domain/agent-images/manifest-parser.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb33bd93dc0ab95e8855ad9d639eb94a59d1754aa3f90e9b22e8d768c550ab85"}},{"ruleId":"D2","level":"warning","message":{"text":"WatchdogPolicyEngine.evaluate (cognitive 56): WatchdogPolicyEngine.evaluate has cognitive complexity 56 (threshold 15). Drivers by points: if/else 23 (27 pts), boolean chains 19, ternaries 10 (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":"packages/daemon/src/domain/watchdog-policy-engine.ts"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"26003d79c5b6e4732a7536877d67d6c8d688482db4a0ef09843274158a171abd"}},{"ruleId":"D2","level":"warning","message":{"text":"bundles.consumeAuthorBundleYaml (cognitive 56): bundles.consumeAuthorBundleYaml has cognitive complexity 56 (threshold 15). Drivers by points: if/else 34 (61 pts), boolean chains 19, loops 9 (15 pts), error handling 4 (11 pts), ternaries 1 (2 pts) (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (bundles.consumeAuthorBundleYaml::assertNoSymlinkEscapeInTree) 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/daemon/src/routes/bundles.ts"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"569f7e37a34273ef6403a38ddef770dac635ac54cd2247d9fd30e614b6a6c260"}},{"ruleId":"D2","level":"warning","message":{"text":"up.upRoutes.post(\u0022/\u0022) (cognitive 56): up.upRoutes.post(\u0022/\u0022) has cognitive complexity 56 (threshold 15). Drivers by points: if/else 20 (32 pts), ternaries 9 (13 pts), boolean chains 7, error handling 3 (4 pts) (nesting depth added 17). Of this number, 42 points are the body\u0027s own statements and 14 belong to 5 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/daemon/src/routes/up.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"759c48101aa3cc96d9562d338b82a229d25b22c10e54e887209ae5b648a27a12"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkdownViewer.parseMarkdown (cognitive 56): MarkdownViewer.parseMarkdown has cognitive complexity 56 (threshold 15). Drivers by points: if/else 10 (30 pts), loops 6 (16 pts), boolean chains 6, ternaries 1 (4 pts) (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":"packages/ui/src/components/markdown/MarkdownViewer.tsx"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d7d3b466efc62d72f1d979167074fde5924ef414963b899167a3e7ecb1ccff"}},{"ruleId":"D2","level":"warning","message":{"text":"SeatActivityService.observeSeat (cognitive 55): SeatActivityService.observeSeat has cognitive complexity 55 (threshold 15). Drivers by points: ternaries 9 (22 pts), if/else 11 (21 pts), boolean chains 10, error handling 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/daemon/src/domain/seat-activity-service.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32bf36351b6c2cac65b42ab5888dd17aeb4e80c96e6973beb5fea01b2f311b2"}},{"ruleId":"D2","level":"warning","message":{"text":"relay-outbound.validateRelayOutboundEnvelope (cognitive 55): relay-outbound.validateRelayOutboundEnvelope has cognitive complexity 55 (threshold 15). Drivers by points: if/else 24 (41 pts), boolean chains 8, ternaries 2 (4 pts), loops 1 (2 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/gateway/relay-outbound.ts"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63364b87a8b3ad15830b8512df0cdc0539eb72301c5746b4cbba7a4afc2937a"}},{"ruleId":"D2","level":"warning","message":{"text":"PiResumeAdapter.resume (cognitive 55): PiResumeAdapter.resume has cognitive complexity 55 (threshold 15). Drivers by points: ternaries 14 (20 pts), error handling 7 (12 pts), if/else 12, boolean chains 11 (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":"packages/daemon/src/adapters/pi-resume.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2271bdffc3c64b6e1b2223b2f67430304f9a9efb611d3fb7d248d703b1735d"}},{"ruleId":"D2","level":"warning","message":{"text":"current-work.deriveWorkCandidates (cognitive 55): current-work.deriveWorkCandidates has cognitive complexity 55 (threshold 15). Drivers by points: if/else 11 (24 pts), ternaries 6 (19 pts), loops 4 (9 pts), boolean chains 3 (nesting depth added 31). Of this number, 54 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/daemon/src/domain/current-work.ts"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19561d3adf727e885bd669219f4416dd3b156a95b3541a2803b2674178cd28e"}},{"ruleId":"D2","level":"warning","message":{"text":"PodBundleAssembler.assemble (cognitive 55): PodBundleAssembler.assemble has cognitive complexity 55 (threshold 15). Drivers by points: if/else 16 (34 pts), loops 6 (14 pts), ternaries 2 (5 pts), boolean chains 2 (nesting depth added 29). Of this number, 48 points are the body\u0027s own statements and 7 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/daemon/src/domain/pod-bundle-assembler.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f018194a7830e080af2d6a2b115b086837b95981010cffa6e705b3ac9da47c"}},{"ruleId":"D2","level":"warning","message":{"text":"skills.skillsRoutes (cognitive 55): skills.skillsRoutes has cognitive complexity 55 (threshold 15). Drivers by points: if/else 20 (23 pts), ternaries 17 (23 pts), error handling 5, boolean chains 2, loops 2 (nesting depth added 9). None of this is in the body itself: all 55 points belong to 9 function items inside it that branch (a function literal at line 124, a function literal at line 187, a function literal at line 206, \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/daemon/src/routes/skills.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"215214f16cea5b1e5b25d367801c775f32d67e235e401dbafb35396a87151079"}},{"ruleId":"D2","level":"warning","message":{"text":"HybridTopologyNodes.HybridAgentNodeInner (cognitive 55): HybridTopologyNodes.HybridAgentNodeInner has cognitive complexity 55 (threshold 15). Drivers by points: ternaries 22 (40 pts), boolean chains 11, if/else 2 (4 pts) (nesting depth added 20). 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, split the body into named stages: move each independent step or branch into 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/ui/src/components/topology/HybridTopologyNodes.tsx"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e07e4c8bc20c9baba44614777a4e13f08c8de466cd80a03c204ca43ae126081"}},{"ruleId":"D2","level":"warning","message":{"text":"seat-launch-additions.prepareSeatLaunchAdditions (cognitive 54): seat-launch-additions.prepareSeatLaunchAdditions has cognitive complexity 54 (threshold 15). Drivers by points: if/else 16 (22 pts), ternaries 8 (12 pts), boolean chains 7, error handling 4 (7 pts), loops 5 (6 pts) (nesting depth added 14). Of this number, 53 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/daemon/src/domain/seat-launch-additions.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"0943b33a5e17e5d7ffe6f69404ded0a857a3b9051279d57caffb852477563884"}},{"ruleId":"D2","level":"warning","message":{"text":"QueueRepository.waitingView (cognitive 53): QueueRepository.waitingView has cognitive complexity 53 (threshold 15). Drivers by points: ternaries 10 (23 pts), if/else 9 (17 pts), boolean chains 13 (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/queue-repository.ts"},"region":{"startLine":6265}}}],"partialFingerprints":{"codehealthFindingId/v1":"800a85b0cccaeb4d75003a90c76a6ab0df5479d57c03ee305a38ee246e4d91f0"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionTransport.diagnoseProducerLink (cognitive 53): SessionTransport.diagnoseProducerLink has cognitive complexity 53 (threshold 15). Drivers by points: if/else 11 (20 pts), ternaries 12 (16 pts), error handling 3 (6 pts), boolean chains 5, loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 19). Of this number, 29 points are the body\u0027s own statements and 24 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":4674}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e52bd59e2170bb86329e5178ea5c237efb03385983fe8f7c1871e5ec2ee188"}},{"ruleId":"D2","level":"warning","message":{"text":"setup.setupCommand (cognitive 53): setup.setupCommand has cognitive complexity 53 (threshold 15). Drivers by points: if/else 14 (22 pts), ternaries 6 (16 pts), loops 7 (8 pts), boolean chains 7 (nesting depth added 19). None of this is in the body itself: all 53 points belong to 2 function literals inside it that branch (lines 887, 938). 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/commands/setup.ts"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bfb3179d842fa43f63782bb90ff2f12ed7ad7d8d5d2ba1c1221fe5e2d4e32e7"}},{"ruleId":"D2","level":"warning","message":{"text":"PodRigInstantiator.addMemberToPod (cognitive 53): PodRigInstantiator.addMemberToPod has cognitive complexity 53 (threshold 15). Drivers by points: ternaries 14 (27 pts), if/else 15 (17 pts), boolean chains 8, loops 1 (nesting depth added 15). Of this number, 50 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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d9c97f6b008352c1229b41e1c97cc62887b550f52d630aa1bee108f02735dcd"}},{"ruleId":"D2","level":"warning","message":{"text":"MissionControlWriteContract.answerAsk (cognitive 53): MissionControlWriteContract.answerAsk has cognitive complexity 53 (threshold 15). Drivers by points: if/else 14 (18 pts), ternaries 11 (18 pts), boolean chains 16, error handling 1 (nesting depth added 11). Of this number, 52 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/daemon/src/domain/mission-control/mission-control-write-contract.ts"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d61d5a89adffc218d1f299341c721012968c212f38b264940130ac726737af3"}},{"ruleId":"D2","level":"warning","message":{"text":"reactive-tap.collectReactiveEventSignals (cognitive 53): reactive-tap.collectReactiveEventSignals has cognitive complexity 53 (threshold 15). Drivers by points: if/else 20 (42 pts), boolean chains 7, ternaries 1 (3 pts), loops 1 (nesting depth added 24). Of this number, 52 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/daemon/src/domain/provider/reactive-tap.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"73effb2b5f7f9ded5ec991bbe10a5c6c64e31c53c683afc076150755da3762f2"}},{"ruleId":"D2","level":"warning","message":{"text":"rosters.parseRoster.members (cognitive 52): rosters.parseRoster.members has cognitive complexity 52 (threshold 15). Drivers by points: ternaries 24 (40 pts), boolean chains 11, if/else 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/daemon/src/domain/rosters.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"332c938dcfe019b13636631026fe9fc8b3cd9e674f8626eda01a9a013c2f20c4"}},{"ruleId":"D2","level":"warning","message":{"text":"workflow-render.renderInstanceShow (cognitive 52): workflow-render.renderInstanceShow has cognitive complexity 52 (threshold 15). Drivers by points: ternaries 8 (22 pts), if/else 15 (19 pts), loops 6 (9 pts), boolean chains 2 (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":"packages/cli/src/commands/workflow-render.ts"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"af27d78e9f2d54d7d60c5987b46edfb569281aa02abb843f47625b7203136b0e"}},{"ruleId":"D2","level":"warning","message":{"text":"RigSpecPreflight.check (cognitive 52): RigSpecPreflight.check has cognitive complexity 52 (threshold 15). Drivers by points: if/else 18 (37 pts), error handling 3 (9 pts), loops 4, boolean chains 2 (nesting depth added 25). Of this number, 51 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/daemon/src/domain/rigspec-preflight.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6251b9d425d973cab5cb56a2a9d46c060f8466806bb1bf23ff6fb84fff89a2"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkflowProjector.projectDependencyGraph (cognitive 52): WorkflowProjector.projectDependencyGraph has cognitive complexity 52 (threshold 15). Drivers by points: ternaries 17 (24 pts), if/else 13 (15 pts), boolean chains 12, loops 1 (nesting depth added 9). Of this number, 20 points are the body\u0027s own statements and 32 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":"packages/daemon/src/domain/workflow-projector.ts"},"region":{"startLine":1244}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a37715240a84133b365afc79059ecf75433f49464ad070b4b4cfa85c1bc16b"}},{"ruleId":"D2","level":"warning","message":{"text":"ChannelRecovery.page (cognitive 52): ChannelRecovery.page has cognitive complexity 52 (threshold 15). Drivers by points: if/else 22 (34 pts), boolean chains 15, ternaries 2, loops 1 (nesting depth added 12). Of this number, 51 points are the body\u0027s own statements and 1 belongs 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/daemon/src/domain/gateway/slack/channel-recovery.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"df05cb93b6a87f7081d938b5e5a31018b032262743a7e678902dcd472bc91b04"}},{"ruleId":"D2","level":"warning","message":{"text":"server.createApp (cognitive 52): server.createApp has cognitive complexity 52 (threshold 15). Drivers by points: if/else 33, ternaries 10, boolean chains 8, loops 1. Of this number, 25 points are the body\u0027s own statements and 27 belong to 9 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/daemon/src/server.ts"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3946218b1e109f6e8998511b65185dc7f49e3558b910a3d2a665db111c3359"}},{"ruleId":"D2","level":"warning","message":{"text":"startup.startupLines (cognitive 52): startup.startupLines has cognitive complexity 52 (threshold 15). Drivers by points: if/else 16 (26 pts), ternaries 7 (20 pts), boolean chains 6 (nesting depth added 23). Of this number, 44 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/tui/src/startup.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"629be7521698ecbea12d30df5ecdf1369c9e3b7e028280b71c18ba9acb3f8c90"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerChannel.post (cognitive 51): RunnerChannel.post has cognitive complexity 51 (threshold 15). Drivers by points: if/else 20 (30 pts), boolean chains 19, error handling 1, loops 1 (nesting depth added 10). Of this number, 50 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/daemon/src/domain/runner-channel.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"e403e0e1c8b79ca2d11c033abb0cd5089378fb5c4c631531e20e9221b341ff2f"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeCompactionEnforcer.sendPreparedCompact (cognitive 51): ClaudeCompactionEnforcer.sendPreparedCompact has cognitive complexity 51 (threshold 15). Drivers by points: boolean chains 21, if/else 11 (16 pts), ternaries 8 (13 pts), error handling 1 (nesting depth added 10). Of this number, 43 points are the body\u0027s own statements and 8 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":1765}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69b13a5da9c0e6a749bb7ccae775fa342625581492ac81ea2f3c56043c09b19"}},{"ruleId":"D2","level":"warning","message":{"text":"provider.providerCommand::renderStatusHuman (cognitive 51): provider.providerCommand::renderStatusHuman has cognitive complexity 51 (threshold 15). Drivers by points: if/else 15 (33 pts), loops 6 (11 pts), ternaries 2 (5 pts), boolean chains 2 (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. This shape REPEATS in the file: 5 other methods here (provider.providerCommand::renderSeatAccounts, provider.providerCommand::identityLabel, provider.providerCommand::renderUsageRow, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 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/commands/provider.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"7595535cd8935456ed806fb9a183c345e632ba6197183d59cf8abd32b37e48e1"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeCodeAdapter.projectEntry (cognitive 51): ClaudeCodeAdapter.projectEntry has cognitive complexity 51 (threshold 15). Drivers by points: if/else 15 (24 pts), ternaries 7 (12 pts), boolean chains 11, error handling 1 (2 pts), loops 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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a02fd1240d1359f2d7a99a6dc0a7f8f3ebc279d0e97e6b21711d4130dbd21d5"}},{"ruleId":"D2","level":"warning","message":{"text":"SlackAskSettlement.settleOne (cognitive 51): SlackAskSettlement.settleOne has cognitive complexity 51 (threshold 15). Drivers by points: if/else 19 (37 pts), boolean chains 7, ternaries 3 (6 pts), loops 1 (nesting depth added 21). 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":"packages/daemon/src/domain/gateway/slack/settled-asks.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5d281c7c241f989e4d41e3651eb94e316de8f913da69615fbf4bca98a02ee8"}},{"ruleId":"D2","level":"warning","message":{"text":"network-connector.reportBack (cognitive 51): network-connector.reportBack has cognitive complexity 51 (threshold 15). Drivers by points: if/else 10 (24 pts), ternaries 6 (14 pts), boolean chains 7, error handling 2 (5 pts), loops 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":"packages/daemon/src/domain/network/network-connector.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0071337e8fa957a45c325e642a6c9f0ddf108bce6136dd63deb8335483eeb09"}},{"ruleId":"D2","level":"warning","message":{"text":"context-usage-threshold.makeContextUsageThresholdPolicy.evaluate (cognitive 51): context-usage-threshold.makeContextUsageThresholdPolicy.evaluate has cognitive complexity 51 (threshold 15). Drivers by points: if/else 15 (23 pts), ternaries 12 (22 pts), boolean chains 4, error handling 1 (2 pts) (nesting depth added 19). Of this number, 45 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/daemon/src/domain/policies/context-usage-threshold.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ef4283164b0cce084d56aa5c028fa26bcd3120a10d615387b6cb3f7ca15f64"}},{"ruleId":"D2","level":"warning","message":{"text":"RigSpecExporter.exportPodAware (cognitive 51): RigSpecExporter.exportPodAware has cognitive complexity 51 (threshold 15). Drivers by points: if/else 24 (25 pts), ternaries 13, boolean chains 10, error handling 1 (2 pts), loops 1 (nesting depth added 2). Most of this is not in the body itself: 10 of the 51 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 245, a function literal at line 241, a function literal at line 325, \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/daemon/src/domain/rigspec-exporter.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"5abdbd79effc7f9707ec8ce7870e72314801b359a723efd210da3b09fc1a117c"}},{"ruleId":"D2","level":"warning","message":{"text":"guest.main (cognitive 51): guest.main has cognitive complexity 51 (threshold 15). Drivers by points: if/else 19 (34 pts), boolean chains 7, error handling 1 (4 pts), loops 2 (4 pts), ternaries 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":"packages/daemon/assets/openshell/guest.py"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1be23083e7143dfbd42e144194dec8208f68952c9e0084458e8968b5ac38ac8"}},{"ruleId":"D2","level":"warning","message":{"text":"scanQuotes (cognitive 51): scanQuotes has cognitive complexity 51 (threshold 15). Drivers by points: if/else 16 (38 pts), boolean chains 6, ternaries 2 (6 pts), loops 1 (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":"packages/daemon/assets/claude-team-permissions.cjs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2078323c25267519d3aaedcc8ded45108d1561c2db0f9e9db7a96e408e4ec9c"}},{"ruleId":"D2","level":"warning","message":{"text":"words (cognitive 51): words has cognitive complexity 51 (threshold 15). Drivers by points: if/else 20 (35 pts), boolean chains 8, loops 2 (4 pts), ternaries 1 (4 pts) (nesting depth added 20). Of this number, 49 points are the body\u0027s own statements and 2 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/daemon/assets/claude-team-permissions.cjs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"db8c38e8b19af86d5f9ca5f68bf5a9fc19874d8fc46e220c9fbada728f28c0ac"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeCompactionEnforcer.drainPendingStage (cognitive 50): ClaudeCompactionEnforcer.drainPendingStage has cognitive complexity 50 (threshold 15). Drivers by points: if/else 21 (34 pts), boolean chains 13, ternaries 3 (nesting depth added 13). Of this number, 48 points are the body\u0027s own statements and 2 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"af0eb842e4ca5545ecdc257b7ce1c6cdd82b2e33ee7634d2884e3f660e28eb06"}},{"ruleId":"D2","level":"warning","message":{"text":"watchdog.watchdogCommand (cognitive 50): watchdog.watchdogCommand has cognitive complexity 50 (threshold 15). Drivers by points: ternaries 14 (20 pts), boolean chains 14, if/else 12, error handling 2 (4 pts) (nesting depth added 8). None of this is in the body itself: all 50 points belong to 6 function literals inside it that branch (lines 124, 358, 276, \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/commands/watchdog.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f97e519bdfc9d5961358881a5f7bb91408f09c97e9938fcfb6f4e6f4f24883"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-runtime-adapter.lineStartsAtDocumentLevel (cognitive 50): codex-runtime-adapter.lineStartsAtDocumentLevel has cognitive complexity 50 (threshold 15). Drivers by points: if/else 14 (36 pts), boolean chains 7, loops 3 (7 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":"packages/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":2717}}}],"partialFingerprints":{"codehealthFindingId/v1":"e79ac6bc6e3dac0902086dcd5acd6753bb2499acc810fa64215e17f410e4c326"}},{"ruleId":"D2","level":"warning","message":{"text":"PodRigInstantiator.retryFirstStart (cognitive 50): PodRigInstantiator.retryFirstStart has cognitive complexity 50 (threshold 15). Drivers by points: if/else 23 (24 pts), boolean chains 14, ternaries 6 (9 pts), error handling 2, loops 1 (nesting depth added 4). Of this number, 37 points are the body\u0027s own statements and 13 belong to 3 function items 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":"packages/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":1333}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a73fb9e11b406d232b5a14887d57f13f563c2a0d091fba19d4e764f0ff2fcf3"}},{"ruleId":"D2","level":"warning","message":{"text":"execution-view.readLifecycleExecutions (cognitive 50): execution-view.readLifecycleExecutions has cognitive complexity 50 (threshold 15). Drivers by points: ternaries 16 (33 pts), boolean chains 9, if/else 4 (7 pts), loops 1 (nesting depth added 20). Of this number, 16 points are the body\u0027s own statements and 34 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/daemon/src/domain/execution-view.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"2365a0c8dfdc844cf0014c90e868b529a18223951145efd3842482f509973932"}},{"ruleId":"D2","level":"warning","message":{"text":"ThreadRecovery.page (cognitive 50): ThreadRecovery.page has cognitive complexity 50 (threshold 15). Drivers by points: if/else 21 (33 pts), boolean chains 12, ternaries 4, loops 1 (nesting depth added 12). Of this number, 49 points are the body\u0027s own statements and 1 belongs 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/daemon/src/domain/gateway/slack/thread-recovery.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"126b961c01ef2dd7ca0fbb7f3e8f09214e6be7fb3f63b9561c6da21287ce8fac"}},{"ruleId":"D2","level":"warning","message":{"text":"rigspec-schema.validateClaudeAdditions (cognitive 49): rigspec-schema.validateClaudeAdditions has cognitive complexity 49 (threshold 15). Drivers by points: if/else 14 (27 pts), ternaries 4 (13 pts), boolean chains 7, loops 2 (nesting depth added 22). Of this number, 24 points are the body\u0027s own statements and 25 belong to 4 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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f1ddba95e2063fc0e7ed2a69025896088ab0e8f06cbb26913273f9494209a1"}},{"ruleId":"D2","level":"warning","message":{"text":"restore-guidance.restoreMissingGuidance (cognitive 49): restore-guidance.restoreMissingGuidance has cognitive complexity 49 (threshold 15). Drivers by points: if/else 14 (32 pts), error handling 5 (9 pts), loops 3 (4 pts), boolean chains 2, ternaries 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/daemon/src/domain/restore-guidance.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"b759852498ce27861e79e96770f1e416d8dff46841a0934d536a09739a4564d9"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaimService.reconcileSession (cognitive 49): ClaimService.reconcileSession has cognitive complexity 49 (threshold 15). Drivers by points: if/else 25 (35 pts), boolean chains 6, error handling 5 (6 pts), loops 1, ternaries 1 (nesting depth added 11). 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":"packages/daemon/src/domain/claim-service.ts"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7114c1020972e3b8ad51d924d1e6763b7e3cf42fb4b4a2ad04b0c38e9293831"}},{"ruleId":"D2","level":"warning","message":{"text":"herdr-app-install.installRigMods (cognitive 49): herdr-app-install.installRigMods has cognitive complexity 49 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 7 (13 pts), boolean chains 9, ternaries 2 (5 pts), error handling 1 (nesting depth added 18). Of this number, 47 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/daemon/src/domain/terminal/herdr-app-install.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f3f554b2a903eefc0779a80c72a611285d2820fd22cd65215ddfc00884ad43"}},{"ruleId":"D2","level":"warning","message":{"text":"resume-token-capture.deriveResumeToken (cognitive 48): resume-token-capture.deriveResumeToken has cognitive complexity 48 (threshold 15). Drivers by points: if/else 20 (35 pts), ternaries 3 (9 pts), boolean chains 2, error handling 1 (2 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/daemon/src/domain/resume-token-capture.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"7564cc55793ba2a440c9ef5889676b3c0a311633b85133ca9033b157ee3fefaf"}},{"ruleId":"D2","level":"warning","message":{"text":"seat-skill-storage.followSeatSkills (cognitive 48): seat-skill-storage.followSeatSkills has cognitive complexity 48 (threshold 15). Drivers by points: if/else 14 (26 pts), error handling 5 (7 pts), loops 6 (7 pts), boolean chains 6, ternaries 1 (2 pts) (nesting depth added 16). Of this number, 31 points are the body\u0027s own statements and 17 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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82fc770668fd50233babfc754b143a02ec1553dc154f084db7bb58ee22a863a"}},{"ruleId":"D2","level":"warning","message":{"text":"CommunityHarnessRuntimeAdapter.launchPreset (cognitive 48): CommunityHarnessRuntimeAdapter.launchPreset has cognitive complexity 48 (threshold 15). Drivers by points: if/else 16 (22 pts), error handling 7 (13 pts), ternaries 5 (10 pts), boolean chains 3 (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/daemon/src/adapters/community-harness-runtime-adapter.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"31705580330c5d5069daa32ca50536fadcb7e93016b8023f8dcf0430794c9eac"}},{"ruleId":"D2","level":"warning","message":{"text":"TmuxAdapter.createSessionUnchecked (cognitive 48): TmuxAdapter.createSessionUnchecked has cognitive complexity 48 (threshold 15). Drivers by points: if/else 14 (23 pts), ternaries 9 (17 pts), boolean chains 3, error handling 3, loops 2 (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/daemon/src/adapters/tmux.ts"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bdaa2e9522e29e10253e48d9ec16abcdc5d97c31786932760e382ea3e26da09"}},{"ruleId":"D2","level":"warning","message":{"text":"host.postureCheck (cognitive 48): host.postureCheck has cognitive complexity 48 (threshold 15). Drivers by points: if/else 20 (22 pts), ternaries 8 (13 pts), boolean chains 9, error handling 2, loops 1 (2 pts) (nesting depth added 8). Of this number, 41 points are the body\u0027s own statements and 7 belong to 3 function items 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/commands/host.ts"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"08af10ffcb66b38b2f785c045d7596ff0fb913febeb0f6db98be71a7ee1dd64b"}},{"ruleId":"D2","level":"warning","message":{"text":"skill.skillCommand::seatLoadout (cognitive 48): skill.skillCommand::seatLoadout has cognitive complexity 48 (threshold 15). Drivers by points: ternaries 10 (18 pts), if/else 14 (17 pts), boolean chains 7, loops 3 (6 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. This shape REPEATS in the file: 2 other methods here (skill.skillCommand::printSeat, skill.skillCommand::describeDelivery) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 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/commands/skill.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"af50416ef20f451463a9eb3831c94c9322acc30ae5330780f63fe0544ed50434"}},{"ruleId":"D2","level":"warning","message":{"text":"extract-surface.extractFile::evalExpr (cognitive 48): extract-surface.extractFile::evalExpr has cognitive complexity 48 (threshold 15). Drivers by points: if/else 13 (37 pts), ternaries 2 (6 pts), boolean chains 5 (nesting depth added 28). 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. This shape REPEATS in the file: one other method here (extract-surface.extractFile::processBody) 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/release-surface/extract-surface.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb10a76a14c1a781c3a80d2001f6641fca46f520d6b959af01cefa350f74603"}},{"ruleId":"D2","level":"warning","message":{"text":"pi-runner.connectPiRunnerChannel (cognitive 48): pi-runner.connectPiRunnerChannel has cognitive complexity 48 (threshold 15). Drivers by points: if/else 13 (38 pts), loops 3 (6 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":2185}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4247ddcd187566d342e63c438d5a616ee842034f16e60336dd6bf2a3d191045"}},{"ruleId":"D2","level":"warning","message":{"text":"PodRigInstantiator.computePodLaunchOrder (cognitive 48): PodRigInstantiator.computePodLaunchOrder has cognitive complexity 48 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 8 (14 pts), ternaries 4 (10 pts), boolean chains 1 (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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":1960}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c66cc3e14df95ba8ae64040d499cad9f125b04ea292da01b94f62abd28191b9"}},{"ruleId":"D2","level":"warning","message":{"text":"bundle-content-routing.routeBundleContents (cognitive 48): bundle-content-routing.routeBundleContents has cognitive complexity 48 (threshold 15). Drivers by points: if/else 16 (34 pts), boolean chains 5, error handling 4 (5 pts), loops 1 (4 pts) (nesting depth added 22). Of this number, 36 points are the body\u0027s own statements and 12 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/daemon/src/domain/bundle-content-routing.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac361f5fa42e4cd94d116cc3e8e83110293bb03c2ad11f58fdbd8e24fbf20c4e"}},{"ruleId":"D2","level":"warning","message":{"text":"relay-inbound.createRelayInboundHandler.handle (cognitive 48): relay-inbound.createRelayInboundHandler.handle has cognitive complexity 48 (threshold 15). Drivers by points: if/else 16 (26 pts), error handling 5 (10 pts), ternaries 4 (9 pts), boolean chains 3 (nesting depth added 20). Most of this is not in the body itself: 5 of the 48 points are its own statements and the rest belongs to one function literal inside it that branches (line 704). 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/daemon/src/domain/gateway/relay-inbound.ts"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1bdbe1d153b035b2d01c16dd854d251478cd729f700e75b4d73c1e42c0fed3"}},{"ruleId":"D2","level":"warning","message":{"text":"watchdog-delivery-receipts.withWatchdogReceipts.deliver (cognitive 48): watchdog-delivery-receipts.withWatchdogReceipts.deliver has cognitive complexity 48 (threshold 15). Drivers by points: ternaries 8 (19 pts), if/else 11 (16 pts), boolean chains 9, loops 3, error handling 1 (nesting depth added 16). Most of this is not in the body itself: 6 of the 48 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 93, 68). 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/daemon/src/domain/watchdog-delivery-receipts.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a52d67b461af20dd791cb82bf8565a815030a31529537b350e412e6063a517"}},{"ruleId":"D2","level":"warning","message":{"text":"FocusedTerminal.FocusedTerminal (cognitive 48): FocusedTerminal.FocusedTerminal has cognitive complexity 48 (threshold 15). Drivers by points: if/else 24 (25 pts), boolean chains 15, ternaries 4 (5 pts), error handling 2, loops 1 (nesting depth added 2). Most of this is not in the body itself: 3 of the 48 points are its own statements and the rest belongs to 15 function literals inside it that branch (lines 211, 248, 394, \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/ui/src/components/terminal/FocusedTerminal.tsx"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"27be58546630a90b6134ad60ca2360a0d53e7343f1f34b35a80d14e6c4a9d47f"}},{"ruleId":"D2","level":"warning","message":{"text":"agent-activity-store.normalizeRunnerObservations (cognitive 47): agent-activity-store.normalizeRunnerObservations has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (32 pts), boolean chains 12, loops 1 (2 pts), ternaries 1 (nesting depth added 17). Of this number, 46 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/daemon/src/domain/agent-activity-store.ts"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"097ba51141a6ce42419aa57a84e03ac3e026f93bb502889ee1d90a0a7d4d54e4"}},{"ruleId":"D2","level":"warning","message":{"text":"native-process-lineage.claudeArgvIds (cognitive 47): native-process-lineage.claudeArgvIds has cognitive complexity 47 (threshold 15). Drivers by points: if/else 18 (39 pts), boolean chains 7, 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":"packages/daemon/src/domain/native-process-lineage.ts"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7521d6ede743b6f767dc1f201417044677c50a2dd634b4fbadc7f923e72bb9"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeManagedLaunch.prepare (cognitive 47): ClaudeManagedLaunch.prepare has cognitive complexity 47 (threshold 15). Drivers by points: ternaries 19 (23 pts), boolean chains 14, if/else 8, error handling 1 (2 pts) (nesting depth added 5). Of this number, 32 points are the body\u0027s own statements and 15 belong to 8 function items 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":"packages/daemon/src/domain/claude-managed-launch.ts"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"b712b4827d5674855c65abe3586c29831b7b02048643229dd0af87bf7a14296b"}},{"ruleId":"D2","level":"warning","message":{"text":"InboundRouter.attemptBot (cognitive 47): InboundRouter.attemptBot has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (21 pts), ternaries 10 (16 pts), boolean chains 9, error handling 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/daemon/src/domain/gateway/slack/inbound.ts"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a809468e3a60968c6473cf4ebe7c9fbab8032cf330f9fdada56cb16de576a1"}},{"ruleId":"D2","level":"warning","message":{"text":"queue-stuck-sweep.deliveryResolutionEvidence (cognitive 47): queue-stuck-sweep.deliveryResolutionEvidence has cognitive complexity 47 (threshold 15). Drivers by points: if/else 18 (30 pts), boolean chains 11, error handling 1 (3 pts), ternaries 1 (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":"packages/daemon/src/domain/queue-stuck-sweep.ts"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb6eeb016a4d4aa05929f22c11c6af6bc0aed04182e81881ae8e164be4d7365"}},{"ruleId":"D2","level":"warning","message":{"text":"queue.waitForDeliveryOutcome (cognitive 47): queue.waitForDeliveryOutcome has cognitive complexity 47 (threshold 15). Drivers by points: if/else 9 (23 pts), ternaries 4 (15 pts), boolean chains 6, error handling 1 (2 pts), loops 1 (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":"packages/cli/src/commands/queue.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd0fb48ef4601839ba2ae9f3a0f872eee312622d3afc85ab00fe958c0f93952"}},{"ruleId":"D2","level":"warning","message":{"text":"refocus.renderTrace (cognitive 47): refocus.renderTrace has cognitive complexity 47 (threshold 15). Drivers by points: if/else 17 (27 pts), boolean chains 13, ternaries 4 (5 pts), loops 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":"packages/daemon/assets/plugins/openrig-core/hooks/scripts/refocus.cjs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"f906625fde7b27f2aaed9db421a84b78ccea5502449e6faba6c72fe36482ad86"}},{"ruleId":"D2","level":"warning","message":{"text":"PsProjectionService.getEntries (cognitive 47): PsProjectionService.getEntries has cognitive complexity 47 (threshold 15). Drivers by points: ternaries 12 (21 pts), if/else 7 (16 pts), boolean chains 5, loops 4 (5 pts) (nesting depth added 19). Most of this is not in the body itself: 2 of the 47 points are its own statements and the rest belongs to one function literal inside it that branches (line 225). 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/daemon/src/domain/ps-projection.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"8813a9910bd245206d9b31487634641db99e40de8c076ba5423b2fb031457057"}},{"ruleId":"D2","level":"warning","message":{"text":"SeatHandoverService.recover (cognitive 47): SeatHandoverService.recover has cognitive complexity 47 (threshold 15). Drivers by points: ternaries 19 (26 pts), boolean chains 14, if/else 7 (nesting depth added 7). 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/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9dad8b4401d549a12f15e0b87d1fb72eefcae55575c8a1ea0169bd368dd601c"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime-switch-materials.planRuntimeSwitchMaterials (cognitive 47): runtime-switch-materials.planRuntimeSwitchMaterials has cognitive complexity 47 (threshold 15). Drivers by points: if/else 13 (24 pts), ternaries 9 (16 pts), boolean chains 4, loops 2, error handling 1 (nesting depth added 18). Of this number, 40 points are the body\u0027s own statements and 7 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":"packages/daemon/src/domain/runtime-switch-materials.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"9494e1b9fcd7083cfaab51182b7ec66671d1153a78e41226ffe6c920aeb46b14"}},{"ruleId":"D2","level":"warning","message":{"text":"workflow-boot-sweep.runWorkflowBootSweep (cognitive 47): workflow-boot-sweep.runWorkflowBootSweep has cognitive complexity 47 (threshold 15). Drivers by points: if/else 9 (24 pts), ternaries 3 (9 pts), loops 4 (7 pts), error handling 1 (4 pts), boolean chains 3 (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/daemon/src/domain/workflow-boot-sweep.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f74d338f989fe5a667cb8dc347c26180be32b7e42b508b1104fcbbe85bff009"}},{"ruleId":"D2","level":"warning","message":{"text":"guest.descriptor (cognitive 47): guest.descriptor has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (32 pts), boolean chains 9, loops 2 (3 pts), ternaries 2 (3 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/daemon/assets/openshell/guest.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ba372661b2e208244fcc007a5aeb810b838fda514665106d4152b93c515abb"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-thread-id.readCodexThreadIdFromLogs (cognitive 46): codex-thread-id.readCodexThreadIdFromLogs has cognitive complexity 46 (threshold 15). Drivers by points: loops 8 (16 pts), ternaries 8 (13 pts), if/else 6 (9 pts), boolean chains 4, error handling 2 (4 pts) (nesting depth added 18). Of this number, 44 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":"packages/daemon/src/domain/codex-thread-id.ts"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4542437caa5f6eff3e4cfedce980391b8ad984ad3c8f7d00d672a247735a8a0"}},{"ruleId":"D2","level":"warning","message":{"text":"operator-delivery-engine.makeOperatorDeliveryEngine.dispatchEscalation (cognitive 46): operator-delivery-engine.makeOperatorDeliveryEngine.dispatchEscalation has cognitive complexity 46 (threshold 15). Drivers by points: if/else 17 (22 pts), ternaries 9 (15 pts), error handling 5 (6 pts), boolean chains 3 (nesting depth added 12). Of this number, 39 points are the body\u0027s own statements and 7 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/daemon/src/domain/gateway/operator-delivery-engine.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"93664128f08b56e8bbac44c4630a44e40432979af6a1bec145ccbf93772c557c"}},{"ruleId":"D2","level":"warning","message":{"text":"queue-wake-ladder.readWakeLadderBackstop (cognitive 46): queue-wake-ladder.readWakeLadderBackstop has cognitive complexity 46 (threshold 15). Drivers by points: ternaries 14 (21 pts), boolean chains 14, if/else 10 (11 pts) (nesting depth added 8). Of this number, 44 points are the body\u0027s own statements and 2 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/daemon/src/domain/queue-wake-ladder.ts"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b074a3d1ddc26650106cf2dc8502a7bdf67440d26756173492f1feaeebf8e5"}},{"ruleId":"D2","level":"warning","message":{"text":"CommunityHarnessRuntimeAdapter.launchHarness (cognitive 46): CommunityHarnessRuntimeAdapter.launchHarness has cognitive complexity 46 (threshold 15). Drivers by points: if/else 12 (16 pts), ternaries 11 (16 pts), boolean chains 10, error handling 3 (4 pts) (nesting depth added 10). Of this number, 42 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/daemon/src/adapters/community-harness-runtime-adapter.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"35cb7930e0ddf0c381a6db6c32b4d150bd521acc5e9bb88f7ba5694736392ace"}},{"ruleId":"D2","level":"warning","message":{"text":"destroy-helpers.executeDestroy (cognitive 46): destroy-helpers.executeDestroy has cognitive complexity 46 (threshold 15). Drivers by points: if/else 14 (25 pts), ternaries 3 (8 pts), loops 3 (7 pts), error handling 2 (5 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":"packages/cli/src/destroy-helpers.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"064f80cbc8f436fb2b9deef99b7ce99fab340199ed4d6355f6e1b8f7afb6a071"}},{"ruleId":"D2","level":"warning","message":{"text":"slack-delivery.subsystemSlackDeliver::fn (cognitive 46): slack-delivery.subsystemSlackDeliver::fn has cognitive complexity 46 (threshold 15). Drivers by points: if/else 12 (20 pts), ternaries 7 (12 pts), error handling 6 (8 pts), boolean chains 5, 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":"packages/daemon/src/domain/gateway/slack/slack-delivery.ts"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"360433ec97a17f090079d8f2811122167da2a93620968d33bda7c8d10b30a00f"}},{"ruleId":"D2","level":"warning","message":{"text":"task-terminal-view.projectTaskOwners (cognitive 46): task-terminal-view.projectTaskOwners has cognitive complexity 46 (threshold 15). Drivers by points: ternaries 11 (35 pts), if/else 4 (8 pts), boolean chains 2, loops 1 (nesting depth added 28). Of this number, 45 points are the body\u0027s own statements and 1 belongs 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/daemon/src/domain/terminal/task-terminal-view.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f6b9b0e14506dd446baf0a021e6d1ba7ef8e7401040da222c663c40ee6c583b"}},{"ruleId":"D2","level":"warning","message":{"text":"migrate-telemetry-state-0.5.9.rollback (cognitive 46): migrate-telemetry-state-0.5.9.rollback has cognitive complexity 46 (threshold 15). Drivers by points: if/else 16 (26 pts), boolean chains 10, ternaries 3 (5 pts), loops 3, error handling 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":"skills/_canonical/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"74128da056dd7f4a920a16890aa8f49a3b6dffd622130cc52e1c0f7f4b9073aa"}},{"ruleId":"D2","level":"warning","message":{"text":"native-process-lineage.claudeSessionIdentity (cognitive 45): native-process-lineage.claudeSessionIdentity has cognitive complexity 45 (threshold 15). Drivers by points: if/else 17 (37 pts), boolean chains 6, loops 1, ternaries 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/daemon/src/domain/native-process-lineage.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"d356b510af231f90d0ae3678bd238a949be5df400c10183c608dad9b4a22e811"}},{"ruleId":"D2","level":"warning","message":{"text":"OutboxHandler.updateRunner (cognitive 45): OutboxHandler.updateRunner has cognitive complexity 45 (threshold 15). Drivers by points: ternaries 7 (17 pts), boolean chains 13, if/else 10 (12 pts), loops 2 (3 pts) (nesting depth added 13). None of this is in the body itself: all 45 points belong to one function literal inside it that branches (line 294). 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/daemon/src/domain/outbox-handler.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"707c4d241556b5acf585a2f408d0e5a9714559bc193e10bdf176263d2a802832"}},{"ruleId":"D2","level":"warning","message":{"text":"human-questions.parseHumanQuestions (cognitive 45): human-questions.parseHumanQuestions has cognitive complexity 45 (threshold 15). Drivers by points: if/else 14 (32 pts), boolean chains 7, loops 2 (3 pts), ternaries 1 (3 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":"packages/daemon/src/domain/human-questions.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"480a0653b8eee3cffd6862c063662fb92d5376d3ec9d996db59b065785a399ed"}},{"ruleId":"D2","level":"warning","message":{"text":"community-harness-presets.shellSyntaxIn (cognitive 45): community-harness-presets.shellSyntaxIn has cognitive complexity 45 (threshold 15). Drivers by points: if/else 17 (36 pts), boolean chains 7, loops 1, ternaries 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":"packages/daemon/src/domain/community-harness-presets.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc8da0ae5af0d9e84b61e6e448361d778d49d686a34d8c125e16d28985ef74b"}},{"ruleId":"D2","level":"warning","message":{"text":"QueueRepository.deliverWakeIntent (cognitive 45): QueueRepository.deliverWakeIntent has cognitive complexity 45 (threshold 15). Drivers by points: if/else 34 (55 pts), ternaries 16 (29 pts), boolean chains 12, loops 6 (9 pts) (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. This shape REPEATS in the file: one other method here (QueueRepository.deliverWakeIntent::claim) 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":1695}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc593c9e4a2c43e9b2fa3fe422ebd27f9c1eb3a15a0fe80c0453653a0f748f9"}},{"ruleId":"D2","level":"warning","message":{"text":"ps.runFanOutPs (cognitive 45): ps.runFanOutPs has cognitive complexity 45 (threshold 15). Drivers by points: if/else 19 (26 pts), ternaries 6 (12 pts), boolean chains 3, loops 2 (3 pts), error handling 1 (nesting depth added 14). Of this number, 31 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/commands/ps.ts"},"region":{"startLine":1899}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c214e66e8ef9cec234ecc7928c2ef539c153513ff4e47e4ca4780f7f91541b"}},{"ruleId":"D2","level":"warning","message":{"text":"HumanModeService.apply (cognitive 45): HumanModeService.apply has cognitive complexity 45 (threshold 15). Drivers by points: if/else 14 (19 pts), ternaries 6 (13 pts), boolean chains 8, error handling 3 (5 pts) (nesting depth added 14). Most of this is not in the body itself: 10 of the 45 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 212, a function literal at line 242, a function literal at line 216, \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/daemon/src/domain/gateway/human-operating-modes.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d024ec52c2c6a9973abc08316c0a51575927e2c6350f665e70505d25706f7e"}},{"ruleId":"D2","level":"warning","message":{"text":"stream-reader-actions.recordReaderAction (cognitive 45): stream-reader-actions.recordReaderAction has cognitive complexity 45 (threshold 15). Drivers by points: if/else 12 (19 pts), ternaries 6 (14 pts), boolean chains 10, loops 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/daemon/src/domain/stream-reader-actions.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"0902c27026339f086b2504b6e1089ae521aded81305d81d156859b07238f8f29"}},{"ruleId":"D2","level":"warning","message":{"text":"HerdrAppProvider.open (cognitive 45): HerdrAppProvider.open has cognitive complexity 45 (threshold 15). Drivers by points: ternaries 14 (19 pts), if/else 13 (18 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 11). Of this number, 35 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":"packages/daemon/src/domain/terminal/herdr-app-provider.ts"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"736639a0544d791677ae4b1efee7747a4f1e914f2fddf55ff8ee296c1f325d7d"}},{"ruleId":"D2","level":"warning","message":{"text":"topology-manifest.validateTopologyManifest (cognitive 45): topology-manifest.validateTopologyManifest has cognitive complexity 45 (threshold 15). Drivers by points: if/else 19 (32 pts), boolean chains 7, loops 3 (4 pts), ternaries 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":"packages/daemon/src/domain/topology/topology-manifest.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b056377cd3f6c903841386aaa3c57da9c5e7f5ad8788a2c8d0f45b70dc06461"}},{"ruleId":"D2","level":"warning","message":{"text":"watchdog-job-update.updateWatchdogJob (cognitive 45): watchdog-job-update.updateWatchdogJob has cognitive complexity 45 (threshold 15). Drivers by points: if/else 18 (27 pts), boolean chains 14, ternaries 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":"packages/daemon/src/domain/watchdog-job-update.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"216c9187f709219218ea4ca107c380a605cb5bc522d11c4931beafdefe6f8a7e"}},{"ruleId":"D2","level":"warning","message":{"text":"startup.startupRoutes.post(\u0022/:rigId/:logicalId\u0022) (cognitive 45): startup.startupRoutes.post(\u0022/:rigId/:logicalId\u0022) has cognitive complexity 45 (threshold 15). Drivers by points: if/else 16 (20 pts), ternaries 7 (13 pts), boolean chains 12 (nesting depth added 10). Most of this is not in the body itself: 2 of the 45 points are its own statements and the rest belongs to one function literal inside it that branches (line 579). 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/daemon/src/routes/startup.ts"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d07a968deff1dc37e682e6a8ed5f0f27e0e490eeac72e62aa13c5e4707b7b5"}},{"ruleId":"D2","level":"warning","message":{"text":"queue.queueRoutes::crossHostHandoff (cognitive 45): queue.queueRoutes::crossHostHandoff has cognitive complexity 45 (threshold 15). Drivers by points: ternaries 25 (31 pts), boolean chains 9, if/else 4, error handling 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition. This shape REPEATS in the file: one other method here (queue.queueRoutes::errorResponse) 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/daemon/src/routes/queue.ts"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1171b4a288bb2173f188196cf52621372863de8e4b393979b067eb731678f8d"}},{"ruleId":"D2","level":"warning","message":{"text":"trace-to-root.main (cognitive 45): trace-to-root.main has cognitive complexity 45 (threshold 15). Drivers by points: if/else 11 (22 pts), ternaries 6 (18 pts), boolean chains 5 (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":"packages/daemon/assets/plugins/openrig-core/skills/refocusing/scripts/trace-to-root.py"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d2169893b04eb8fa77d56764f7d08297b5141c6dde3298e1b3a444596db629"}},{"ruleId":"D2","level":"warning","message":{"text":"rigspec-schema.validateSurfaces (cognitive 44): rigspec-schema.validateSurfaces has cognitive complexity 44 (threshold 15). Drivers by points: if/else 13 (33 pts), loops 2 (6 pts), boolean chains 5 (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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c4ce8b469299b7b04b0a2b8b5d22224a9d50f542058624fdbf8fd23cd305868"}},{"ruleId":"D2","level":"warning","message":{"text":"config.configCommand (cognitive 44): config.configCommand has cognitive complexity 44 (threshold 15). Drivers by points: if/else 15 (18 pts), ternaries 5 (12 pts), error handling 5 (6 pts), loops 2 (5 pts), boolean chains 3 (nesting depth added 14). None of this is in the body itself: all 44 points belong to 5 function literals inside it that branch (lines 255, 285, 194, \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/commands/config.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb79f6a4869d43d08641d7b955fa1d30c29de5d4e2fc6508f635efb4496ef96"}},{"ruleId":"D2","level":"warning","message":{"text":"environment.environmentCommand (cognitive 44): environment.environmentCommand has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (20 pts), ternaries 7 (10 pts), boolean chains 8, loops 3 (5 pts), error handling 1 (nesting depth added 13). Most of this is not in the body itself: 5 of the 44 points are its own statements and the rest belongs to 12 function items inside it that branch (a function literal at line 75, a function literal at line 116, client, \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/commands/environment.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e4e3bc375491769855021abaf040e852b693473fc425273eb91540734d56c8"}},{"ruleId":"D2","level":"warning","message":{"text":"terminal.humanOpen (cognitive 44): terminal.humanOpen has cognitive complexity 44 (threshold 15). Drivers by points: ternaries 10 (26 pts), loops 6 (8 pts), if/else 5 (7 pts), boolean chains 3 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/commands/terminal.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5b2d593dcd35a62a4d84048666fd12a6edd9534c54b858b0894e7992de2712"}},{"ruleId":"D2","level":"warning","message":{"text":"CodexRuntimeAdapter.launchHarness (cognitive 44): CodexRuntimeAdapter.launchHarness has cognitive complexity 44 (threshold 15). Drivers by points: if/else 21 (31 pts), ternaries 6 (9 pts), boolean chains 4 (nesting depth added 13). Of this number, 42 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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae08e9d0663d53e3fe8540d569bb80a1bb167493729195ea225240f45d09758"}},{"ruleId":"D2","level":"warning","message":{"text":"slack-subsystem.buildSlackGatewayWire.deriveReplyToChoice (cognitive 44): slack-subsystem.buildSlackGatewayWire.deriveReplyToChoice has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (37 pts), ternaries 3 (5 pts), boolean chains 1, loops 1 (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/daemon/src/domain/gateway/slack/slack-subsystem.ts"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c2040e781a4c3d67c6822bd901a0524ea15137b70a857e84f572ba06d25f63"}},{"ruleId":"D2","level":"warning","message":{"text":"SeatHandoverService.commit (cognitive 44): SeatHandoverService.commit has cognitive complexity 44 (threshold 15). Drivers by points: if/else 13 (17 pts), ternaries 15 (17 pts), boolean chains 8, error handling 2 (nesting depth added 6). Of this number, 16 points are the body\u0027s own statements and 28 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/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":1864}}}],"partialFingerprints":{"codehealthFindingId/v1":"068aaa5d7e22a6f8ec86844f6708bc4e69be7b6d3f0113679d9d292c5f64e8e5"}},{"ruleId":"D2","level":"warning","message":{"text":"fetch-stub.route (cognitive 44): fetch-stub.route has cognitive complexity 44 (threshold 15). Drivers by points: if/else 23 (26 pts), ternaries 8 (17 pts), boolean chains 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/ui/twin/fetch-stub.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"6581bf69e4c6b7cd4f7af8fd70135b8aef510fa89a8ca0729ad75fa91f0d88f5"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentActivityStore.getLatestForNode (cognitive 43): AgentActivityStore.getLatestForNode has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (23 pts), error handling 3 (10 pts), ternaries 4 (7 pts), boolean chains 3 (nesting depth added 21). Of this number, 41 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/daemon/src/domain/agent-activity-store.ts"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c75be770b4fdcfc68e98d3e33ba009b015223907d31bdd5a0bea980864d100b"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionTransport.sweepHookBridgeOnce (cognitive 43): SessionTransport.sweepHookBridgeOnce has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (22 pts), ternaries 3 (12 pts), boolean chains 6, loops 2 (3 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":2944}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15efb8b79f5e07efaf8ebf1e8bfeca84c9eb3a701147eccf49aec5b9ffd97ca"}},{"ruleId":"D2","level":"warning","message":{"text":"session-transport.probeSessionActivity (cognitive 43): session-transport.probeSessionActivity has cognitive complexity 43 (threshold 15). Drivers by points: ternaries 10 (19 pts), if/else 11 (14 pts), boolean chains 6, error handling 3 (4 pts) (nesting depth added 13). Of this number, 37 points are the body\u0027s own statements and 6 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"deef45db8272361c5889d438917494129e5f12927a924eb5cde348c4402f18b9"}},{"ruleId":"D2","level":"warning","message":{"text":"add.addMemberCommand (cognitive 43): add.addMemberCommand has cognitive complexity 43 (threshold 15). Drivers by points: if/else 17 (19 pts), boolean chains 11, ternaries 6 (7 pts), loops 2 (4 pts), error handling 2 (nesting depth added 5). None of this is in the body itself: all 43 points belong to 2 function literals inside it that branch (lines 48, 99). 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/commands/add.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"086831690125757145130e46121aa2a684405482ba960fc63cbeb0d2c09588fd"}},{"ruleId":"D2","level":"warning","message":{"text":"ask.askLiveRunner (cognitive 43): ask.askLiveRunner has cognitive complexity 43 (threshold 15). Drivers by points: if/else 16 (26 pts), boolean chains 12, error handling 2, ternaries 1 (2 pts), loops 1 (nesting depth added 11). Of this number, 37 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/commands/ask.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7272f66437f7ce10b5ba6f2354ab19c22052b1da8986db664786da1d81d819"}},{"ruleId":"D2","level":"warning","message":{"text":"compact.compactCommand (cognitive 43): compact.compactCommand has cognitive complexity 43 (threshold 15). Drivers by points: ternaries 10 (23 pts), if/else 13 (18 pts), boolean chains 2 (nesting depth added 18). None of this is in the body itself: all 43 points belong to one function literal inside it that branches (line 110). 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/commands/compact.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b7a1266a2e17325e1d495d67402d192f974c18a1b58a7fc2f155728b118512"}},{"ruleId":"D2","level":"warning","message":{"text":"usage.usageCommand (cognitive 43): usage.usageCommand has cognitive complexity 43 (threshold 15). Drivers by points: if/else 24, ternaries 7 (13 pts), loops 5, boolean chains 1 (nesting depth added 6). None of this is in the body itself: all 43 points belong to 6 function items inside it that branch (a function literal at line 231, a function literal at line 143, a function literal at line 201, \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/commands/usage.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e40b0a909cd24b86c0c319575b0801a468cffeeec1010ccab87f9b9380348c"}},{"ruleId":"D2","level":"warning","message":{"text":"RestoreCheckService.check (cognitive 43): RestoreCheckService.check has cognitive complexity 43 (threshold 15). Drivers by points: if/else 11 (23 pts), ternaries 3 (8 pts), boolean chains 5, loops 3 (4 pts), error handling 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":"packages/daemon/src/domain/restore-check-service.ts"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1ee9dbfbbdfeded7057c038e398c1d02ba058497e2bb5aca890b5d2360b325"}},{"ruleId":"D2","level":"warning","message":{"text":"RigLifecycleService.shrinkPod (cognitive 43): RigLifecycleService.shrinkPod has cognitive complexity 43 (threshold 15). Drivers by points: ternaries 8 (19 pts), if/else 10 (16 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 19). Of this number, 41 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/daemon/src/domain/rig-lifecycle-service.ts"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1c544e8720d0c457fc96ede7a7baf45e8905fb2abd11d1d76cc3a86ad138ea"}},{"ruleId":"D2","level":"warning","message":{"text":"ScopeApproveService.approve (cognitive 43): ScopeApproveService.approve has cognitive complexity 43 (threshold 15). Drivers by points: ternaries 16 (21 pts), if/else 10 (13 pts), boolean chains 8, error handling 1 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/scope/scope-approve.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"672e0d344b5c02aaa022a6f6b0e2b7816ae71bd5465d05e2e7600a15c1f9baad"}},{"ruleId":"D2","level":"warning","message":{"text":"bundles.bundleRoutes.post(\u0022/install\u0022) (cognitive 43): bundles.bundleRoutes.post(\u0022/install\u0022) has cognitive complexity 43 (threshold 15). Drivers by points: if/else 13 (18 pts), ternaries 10 (16 pts), boolean chains 5, error handling 3 (4 pts) (nesting depth added 12). Of this number, 42 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/daemon/src/routes/bundles.ts"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d62697c2b5a216b430d232b5ef5ddcb6e3061c895e0e1cec141926ce5d2d1b2"}},{"ruleId":"D2","level":"warning","message":{"text":"expected-conversation.resolveExpectedConversation (cognitive 42): expected-conversation.resolveExpectedConversation has cognitive complexity 42 (threshold 15). Drivers by points: if/else 18 (26 pts), ternaries 5 (7 pts), boolean chains 6, error handling 2 (3 pts) (nesting depth added 11). Of this number, 32 points are the body\u0027s own statements and 10 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":"packages/daemon/src/domain/expected-conversation.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b5d45d387cd03ff86f848f8cee9fdcd0b3a99d2008b4a22ca57b7d5804b61bf"}},{"ruleId":"D2","level":"warning","message":{"text":"NativePermissionStore.resolve (cognitive 42): NativePermissionStore.resolve has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (24 pts), ternaries 7 (13 pts), boolean chains 4, error handling 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/daemon/src/domain/native-permission-store.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb85466a0d557ab26c2947979b7185a820500ee5bffa2e232fb5e5fd43de7f46"}},{"ruleId":"D2","level":"warning","message":{"text":"SeatStructuralActivityService.pollSeat (cognitive 42): SeatStructuralActivityService.pollSeat has cognitive complexity 42 (threshold 15). Drivers by points: boolean chains 18, ternaries 14 (15 pts), if/else 6 (7 pts), error handling 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":"packages/daemon/src/domain/seat-structural-activity-service.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"09eb9cbec38bfc636ed5a5e7b70fc75573da66d86ca2f5b6a42688d20e454d5f"}},{"ruleId":"D2","level":"warning","message":{"text":"relay-outbound.createRelayOutboundTransport.deliver (cognitive 42): relay-outbound.createRelayOutboundTransport.deliver has cognitive complexity 42 (threshold 15). Drivers by points: if/else 12 (17 pts), error handling 6 (11 pts), boolean chains 8, loops 2 (3 pts), ternaries 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":"packages/daemon/src/domain/gateway/relay-outbound.ts"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2217a35f9982cd8a870195e915b99b57b7d8e4d6f1457db83832f73218b93b8"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp.mcpCommand (cognitive 42): mcp.mcpCommand has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (20 pts), boolean chains 11, ternaries 4 (6 pts), error handling 4, loops 1 (nesting depth added 5). None of this is in the body itself: all 42 points belong to 6 function literals inside it that branch (lines 67, 165, 180, \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/commands/mcp.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0b5b0e9874ead47990c6825214e27b062ba4fdab808083da9a77c2fb0dcdb4"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-jsonl-parser.parseCodexJsonl (cognitive 42): codex-jsonl-parser.parseCodexJsonl has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (22 pts), ternaries 5 (14 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (nesting depth added 21). 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, split the body into named stages: move each independent step or branch into 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/restore-packet/codex-jsonl-parser.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d000e569366bd9d3a62d1aabea591e9a893cfe6efb5c595e8d65c5a7b681970"}},{"ruleId":"D2","level":"warning","message":{"text":"CodexResumeAdapter.verifyResume (cognitive 42): CodexResumeAdapter.verifyResume has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (25 pts), boolean chains 8, ternaries 4 (8 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":"packages/daemon/src/adapters/codex-resume.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34c62e0d05e1456c3fe765ced807ad070033cfcd685f572cf4bea47c77e18ac"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-owned-plugin-trust.planOwnedCodexContentApproval (cognitive 42): codex-owned-plugin-trust.planOwnedCodexContentApproval has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 13, loops 4 (5 pts), ternaries 4 (5 pts), error handling 1 (nesting depth added 7). Of this number, 31 points are the body\u0027s own statements and 11 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/daemon/src/domain/codex-owned-plugin-trust.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf7515c5d6750830f6fc8493b5377a504ca0a0e3b597dcdf118495c8fb68e2b"}},{"ruleId":"D2","level":"warning","message":{"text":"pi-runner.mapPiEvent (cognitive 42): pi-runner.mapPiEvent has cognitive complexity 42 (threshold 15). Drivers by points: ternaries 18 (38 pts), boolean chains 3, 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":"packages/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"555110d6607ba1d0ed09892ee4bed345e3844cdd4731cc2232ba7245f59d4fbd"}},{"ruleId":"D2","level":"warning","message":{"text":"seat-runtime-home-record.observeRuntimeHome (cognitive 42): seat-runtime-home-record.observeRuntimeHome has cognitive complexity 42 (threshold 15). Drivers by points: ternaries 10 (20 pts), if/else 9 (14 pts), boolean chains 4, error handling 3, loops 1 (nesting depth added 15). Of this number, 26 points are the body\u0027s own statements and 16 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/daemon/src/domain/seat-runtime-home-record.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f536538e534200717efb0ab9c34d1f392b65e5f3af560105d5e25b95a1065a"}},{"ruleId":"D2","level":"warning","message":{"text":"BootstrapOrchestrator.handlePodAwareSpec (cognitive 42): BootstrapOrchestrator.handlePodAwareSpec has cognitive complexity 42 (threshold 15). Drivers by points: ternaries 11 (18 pts), if/else 10 (13 pts), boolean chains 6, error handling 3 (5 pts) (nesting depth added 12). Of this number, 35 points are the body\u0027s own statements and 7 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/daemon/src/domain/bootstrap-orchestrator.ts"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32bd920a009a01b3d857ccf0f7d33b8e2b6b854108609916bc71196f1f161bb"}},{"ruleId":"D2","level":"warning","message":{"text":"human-mode-account.waitingFor (cognitive 42): human-mode-account.waitingFor has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (28 pts), boolean chains 8, loops 3, ternaries 2 (3 pts) (nesting depth added 15). Of this number, 36 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/daemon/src/domain/gateway/human-mode-account.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"b44f36f96edf9cb2e004d87d4ceb043b4b94dbf9b5a18ed4b0ee372bda7812aa"}},{"ruleId":"D2","level":"warning","message":{"text":"scope-approve.scopeApproveRoutes (cognitive 42): scope-approve.scopeApproveRoutes has cognitive complexity 42 (threshold 15). Drivers by points: ternaries 11 (32 pts), if/else 6 (7 pts), boolean chains 2, error handling 1 (nesting depth added 22). None of this is in the body itself: all 42 points belong to 2 function literals inside it that branch (lines 15, 51). 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/daemon/src/routes/scope-approve.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f7ceab1fb9b6af2d3b05f4237a1e53ffef45f11a99cf10938df60d752fc34a"}},{"ruleId":"D2","level":"warning","message":{"text":"execution-model.sliceDetail (cognitive 42): execution-model.sliceDetail has cognitive complexity 42 (threshold 15). Drivers by points: ternaries 20 (25 pts), boolean chains 11, if/else 3, loops 2 (3 pts) (nesting depth added 6). Of this number, 39 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/tui/src/execution/execution-model.ts"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"52dde45942a89a749c268c9a883dccddbc00c60f08255417c55081d2aacd5892"}},{"ruleId":"D2","level":"warning","message":{"text":"usage-model.allowanceLines (cognitive 42): usage-model.allowanceLines has cognitive complexity 42 (threshold 15). Drivers by points: ternaries 10 (20 pts), if/else 11 (14 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 14). 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, split the body into named stages: move each independent step or branch into 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/tui/src/usage/usage-model.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd322dce54e6f15b3376a78ed5346fb24900f400a829b798002fee1236d1d211"}},{"ruleId":"D2","level":"warning","message":{"text":"OutboxHandler.admitRunner (cognitive 41): OutboxHandler.admitRunner has cognitive complexity 41 (threshold 15). Drivers by points: boolean chains 16, if/else 13 (15 pts), ternaries 4 (8 pts), loops 2 (nesting depth added 6). Most of this is not in the body itself: 1 of the 41 points is its own statement and the rest belongs to one function literal inside it that branches (line 248). 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/daemon/src/domain/outbox-handler.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab0b4fbf79d8873dc5f0be257d23a7421cd677f110b05f1f71a9c4bd335449e"}},{"ruleId":"D2","level":"warning","message":{"text":"tmux-control.tmuxControlExec::exec (cognitive 41): tmux-control.tmuxControlExec::exec has cognitive complexity 41 (threshold 15). Drivers by points: ternaries 10 (14 pts), boolean chains 12, if/else 7 (12 pts), error handling 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":"packages/daemon/src/adapters/tmux-control.ts"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"842457bcdf0523c551982b01c172ec5e9c532081891efb88f610d8eac389d9b6"}},{"ruleId":"D2","level":"warning","message":{"text":"judgments.readMissionReadiness (cognitive 41): judgments.readMissionReadiness has cognitive complexity 41 (threshold 15). Drivers by points: ternaries 11 (20 pts), if/else 7 (9 pts), boolean chains 7, loops 3 (4 pts), error handling 1 (nesting depth added 12). Of this number, 31 points are the body\u0027s own statements and 10 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/daemon/src/domain/proof/judgments.ts"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cbbba91e5e6ed74d0a0a88867a37712b09d4ca66a29c18b24292309df771a77"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerPermissions.read (cognitive 41): RunnerPermissions.read has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 10, ternaries 5 (10 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":"packages/daemon/src/domain/runner-permissions.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"00eb8fc24fade685bb94a877d45190998ee3f20d8f8c077b428b0b7ad427d356"}},{"ruleId":"D2","level":"warning","message":{"text":"ChainFollower.read (cognitive 41): ChainFollower.read has cognitive complexity 41 (threshold 15). Drivers by points: ternaries 5 (16 pts), if/else 5 (13 pts), loops 3 (7 pts), boolean chains 5 (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/acp/agent-server.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"0156da8ca8a3f14e605ac9614ce474662e8eac3ddccf78aeb87066cbded53531"}},{"ruleId":"D2","level":"warning","message":{"text":"send.runHttpHostSend (cognitive 41): send.runHttpHostSend has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (18 pts), ternaries 10 (15 pts), boolean chains 8 (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/commands/send.ts"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e2d939f5d6dd15862428e5925d2dfe41d38dcf71045ad3a36f7e1b5a1503dc"}},{"ruleId":"D2","level":"warning","message":{"text":"env.envCommand (cognitive 41): env.envCommand has cognitive complexity 41 (threshold 15). Drivers by points: if/else 20 (21 pts), ternaries 5 (11 pts), boolean chains 4, error handling 3, loops 1 (2 pts) (nesting depth added 8). None of this is in the body itself: all 41 points belong to 5 function items inside it that branch (a function literal at line 49, resolveRigId, a function literal at line 107, \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/commands/env.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"0912e2aa5b61fda4e3fe409612f2140a8208659f1d063b6d080444a3ca95aa4f"}},{"ruleId":"D2","level":"warning","message":{"text":"stream-outcome.routed (cognitive 41): stream-outcome.routed has cognitive complexity 41 (threshold 15). Drivers by points: ternaries 14 (23 pts), boolean chains 9, if/else 8 (9 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/commands/stream-outcome.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a41bf85f6a57b18d50a4215700ad4b2996009151b385863219419565705778"}},{"ruleId":"D2","level":"warning","message":{"text":"InstallVerifier.verify (cognitive 41): InstallVerifier.verify has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (23 pts), ternaries 3 (9 pts), boolean chains 8, 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/daemon/src/domain/install-verifier.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a904538df72a2424c84edbebb26e8ec02b323402ba4729bb70379fe69cb2b4"}},{"ruleId":"D2","level":"warning","message":{"text":"RigInstantiator.instantiate (cognitive 41): RigInstantiator.instantiate has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (22 pts), loops 5 (7 pts), ternaries 4 (7 pts), error handling 4, boolean chains 1 (nesting depth added 14). Of this number, 29 points are the body\u0027s own statements and 12 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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b548aa965e5bc9a4cb9cc5462f436f74c93282c6b97824317589616eee02aa"}},{"ruleId":"D2","level":"warning","message":{"text":"manifest-parser.parseManifest (cognitive 41): manifest-parser.parseManifest has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (17 pts), ternaries 10 (12 pts), boolean chains 10, error handling 1, loops 1 (nesting depth added 7). 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/daemon/src/domain/context-packs/manifest-parser.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"251ab7daf386cf7edb6b9e01447c06cbe265bdea97d5801cf79a6d66bea68975"}},{"ruleId":"D2","level":"warning","message":{"text":"workflow-scope.normalizeWorkflowScope (cognitive 41): workflow-scope.normalizeWorkflowScope has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (29 pts), boolean chains 7, ternaries 3, loops 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/workflow-scope.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"8578fe770787d54fd99b2ad57abb791ab6c9c6a22ae8bf9469b3914adb3b8cde"}},{"ruleId":"D2","level":"warning","message":{"text":"UsageWindows.project (cognitive 41): UsageWindows.project has cognitive complexity 41 (threshold 15). Drivers by points: ternaries 15 (30 pts), boolean chains 8, if/else 2, loops 1 (nesting depth added 15). Of this number, 32 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":"packages/daemon/src/domain/provider/usage-windows.ts"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a5c05fd22d5afc9b7214c2191617fde4fe6fedf95fe7517fb0809aee064684a"}},{"ruleId":"D2","level":"warning","message":{"text":"herdr-live-workspace.hasLiveAttachments (cognitive 41): herdr-live-workspace.hasLiveAttachments has cognitive complexity 41 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 4 (7 pts), boolean chains 6, ternaries 3 (5 pts), error handling 1 (nesting depth added 18). Of this number, 37 points are the body\u0027s own statements and 4 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/daemon/src/domain/terminal/herdr-live-workspace.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d622f9a27a0d103410e51913adf31ec0ba51032bed1572012246b4cf0fea23"}},{"ruleId":"D2","level":"warning","message":{"text":"RexAdapter.openView (cognitive 41): RexAdapter.openView has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (15 pts), ternaries 8 (14 pts), error handling 3 (5 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 12). Of this number, 34 points are the body\u0027s own statements and 7 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/daemon/src/domain/terminal/rex-adapter.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"7789ddca831e3be1a49b9e2619c070a7ebb475aa2960e1fb8382c673e7d82897"}},{"ruleId":"D2","level":"warning","message":{"text":"workflow-exception-readiness.inspectExceptionReadiness (cognitive 41): workflow-exception-readiness.inspectExceptionReadiness has cognitive complexity 41 (threshold 15). Drivers by points: ternaries 12 (28 pts), if/else 3 (6 pts), boolean chains 4, error handling 1 (2 pts), loops 1 (nesting depth added 20). Of this number, 39 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/daemon/src/domain/workflow-exception-readiness.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fbb5bbbc66b7561b10684af766d99f847ce0f5abafdb97ded8d89ef730a0642"}},{"ruleId":"D2","level":"warning","message":{"text":"bundles.bundleRoutes.post(\u0022/inspect\u0022) (cognitive 41): bundles.bundleRoutes.post(\u0022/inspect\u0022) has cognitive complexity 41 (threshold 15). Drivers by points: ternaries 15 (26 pts), if/else 6 (7 pts), boolean chains 4, error handling 4 (nesting depth added 12). Of this number, 35 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/daemon/src/routes/bundles.ts"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"1536f25b156ad33b759ba445a931beca7cb32e6315639e965576592858308507"}},{"ruleId":"D2","level":"warning","message":{"text":"seat.seatRoutes.get(\u0022/status/:seatRef\u0022) (cognitive 41): seat.seatRoutes.get(\u0022/status/:seatRef\u0022) has cognitive complexity 41 (threshold 15). Drivers by points: ternaries 11 (32 pts), boolean chains 4, if/else 3, error handling 1 (2 pts) (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/routes/seat.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3105a0980abe93165aa49f53b1cdffb01a9606c758f2c136fdb7c688530757d"}},{"ruleId":"D2","level":"warning","message":{"text":"state.drillTo (cognitive 41): state.drillTo has cognitive complexity 41 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 3 (9 pts), ternaries 3 (6 pts), boolean chains 4, match/switch 1 (nesting depth added 21). 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/tui/src/state.ts"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"93341d982e44a179b6f4bbe0d740c9568f8661679e8b58ee569cedbf75965327"}},{"ruleId":"D2","level":"warning","message":{"text":"SyntaxHighlight.tokenizeWithKeywordsAndComments (cognitive 41): SyntaxHighlight.tokenizeWithKeywordsAndComments has cognitive complexity 41 (threshold 15). Drivers by points: if/else 9 (19 pts), ternaries 4 (12 pts), boolean chains 6, loops 2 (4 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/ui/src/components/markdown/SyntaxHighlight.tsx"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"a69467b3d6a50b6d52dacce8a5548de0b216220afe37a1910c659438d17bf7f9"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-member-permissions.validateCodexMemberPermissions (cognitive 40): codex-member-permissions.validateCodexMemberPermissions has cognitive complexity 40 (threshold 15). Drivers by points: if/else 16 (26 pts), boolean chains 9, loops 3 (4 pts), ternaries 1 (nesting depth added 11). Of this number, 38 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/daemon/src/domain/codex-member-permissions.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3fe8193c237b518aee8677b263bfa31d48dc079f38709baaed05887148bb52"}},{"ruleId":"D2","level":"warning","message":{"text":"rigspec-schema.validateContinuityPolicy (cognitive 40): rigspec-schema.validateContinuityPolicy has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (26 pts), loops 3 (9 pts), boolean chains 5 (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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e713bac702321e248509f1f03701aaef90d7804b8c5a8bdf3d36a4fd738197"}},{"ruleId":"D2","level":"warning","message":{"text":"SeatActivityService.arbitrate (cognitive 40): SeatActivityService.arbitrate has cognitive complexity 40 (threshold 15). Drivers by points: boolean chains 15, ternaries 8 (13 pts), if/else 10 (12 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/daemon/src/domain/seat-activity-service.ts"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"1020ae7c1f6ce8bce740a887a43851a5f46f42c3fe925a39482f0ee89019f3a7"}},{"ruleId":"D2","level":"warning","message":{"text":"queue-wake-ladder.readLadder (cognitive 40): queue-wake-ladder.readLadder has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (31 pts), boolean chains 8, 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/daemon/src/domain/queue-wake-ladder.ts"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"530e78bcd783e56621472d2dfd9dd5c0d8f05bed37add3f9555d4abf14c2b1af"}},{"ruleId":"D2","level":"warning","message":{"text":"provider.providerCommand::renderSeatAccounts (cognitive 40): provider.providerCommand::renderSeatAccounts has cognitive complexity 40 (threshold 15). Drivers by points: ternaries 7 (24 pts), if/else 7 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: 5 other methods here (provider.providerCommand::renderStatusHuman, provider.providerCommand::identityLabel, provider.providerCommand::renderUsageRow, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 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/commands/provider.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcfa16d8a406f49dba3a7bc1196cf368a7a20128a3fead69a9bf14287c0f6ed0"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeCodeAdapter.deliverStartup (cognitive 40): ClaudeCodeAdapter.deliverStartup has cognitive complexity 40 (threshold 15). Drivers by points: if/else 8 (27 pts), ternaries 3 (6 pts), error handling 3 (4 pts), match/switch 1 (2 pts), loops 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":"packages/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f828531bf5466043a7c83c2c281ce2f84cedceb5d5fdcf6b5333a8e8d20e1c9"}},{"ruleId":"D2","level":"warning","message":{"text":"CodexRuntimeAdapter.profileRemainsReadOnly (cognitive 40): CodexRuntimeAdapter.profileRemainsReadOnly has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (30 pts), boolean chains 6, loops 3, error handling 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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":1240}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a711c972e8b214253802e54da00a010696c9de26b148ba441850916365bff78"}},{"ruleId":"D2","level":"warning","message":{"text":"bundle-archive.unpack (cognitive 40): bundle-archive.unpack has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (20 pts), ternaries 3 (8 pts), boolean chains 5, loops 2 (4 pts), error handling 1 (3 pts) (nesting depth added 14). Of this number, 33 points are the body\u0027s own statements and 7 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/daemon/src/domain/bundle-archive.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d87f0c05884d9708a0c3d4806b37bf6d1f309b6285579589b1a184e84262b3"}},{"ruleId":"D2","level":"warning","message":{"text":"ProgressIndexer.parseProgressFile (cognitive 40): ProgressIndexer.parseProgressFile has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (28 pts), ternaries 2 (7 pts), boolean chains 3, error handling 1, loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/progress/progress-indexer.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2208c4951f589b783a624eb20fe1d27db1630764801ee99549e470d14798e92"}},{"ruleId":"D2","level":"warning","message":{"text":"SeatLifecycleService.setPermissions (cognitive 40): SeatLifecycleService.setPermissions has cognitive complexity 40 (threshold 15). Drivers by points: if/else 18 (23 pts), ternaries 6 (7 pts), boolean chains 5, error handling 3 (5 pts) (nesting depth added 8). Of this number, 23 points are the body\u0027s own statements and 17 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":"packages/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"d051f5bb4f9e895f87cf727cab57175ddbea76f4734061e604d8e0329608d412"}},{"ruleId":"D2","level":"warning","message":{"text":"queue-erasure.eraseQueue::planBatch (cognitive 40): queue-erasure.eraseQueue::planBatch has cognitive complexity 40 (threshold 15). Drivers by points: if/else 18 (28 pts), loops 7 (10 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 2 other methods here (queue-erasure.eraseQueue, queue-erasure.eraseQueue::page) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 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/daemon/src/domain/queue-erasure.ts"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ac436142be1c64cb61172db9f1a1e2305a5c70041eafc6d2460cd7f307ed5c"}},{"ruleId":"D2","level":"warning","message":{"text":"view-composer.composeView (cognitive 40): view-composer.composeView has cognitive complexity 40 (threshold 15). Drivers by points: ternaries 10 (21 pts), if/else 7 (18 pts), loops 1 (nesting depth added 22). Of this number, 39 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/daemon/src/domain/terminal/view-composer.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b0cdb3303df4b7a2197bb7a76d93c1fcc2830982bb772c8bca7b0eb652bf40"}},{"ruleId":"D2","level":"warning","message":{"text":"chat.chatRoutes (cognitive 40): chat.chatRoutes has cognitive complexity 40 (threshold 15). Drivers by points: if/else 23 (27 pts), boolean chains 11, loops 2 (nesting depth added 4). None of this is in the body itself: all 40 points belong to 7 function literals inside it that branch (lines 154, 28, 65, \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/daemon/src/routes/chat.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f57655a2441edfc59192c8fc01d767ec28bf2240722b4d9838f71f0b67d0268"}},{"ruleId":"D2","level":"warning","message":{"text":"attention-model.composeHumanUpdates (cognitive 40): attention-model.composeHumanUpdates has cognitive complexity 40 (threshold 15). Drivers by points: ternaries 11 (25 pts), boolean chains 8, if/else 4 (6 pts), loops 1 (nesting depth added 16). Of this number, 37 points are the body\u0027s own statements and 3 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/tui/src/attention/attention-model.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"fabf3408c6035079254e69ebb00f48139efd442b289e92ebed24dc78df34227d"}},{"ruleId":"D2","level":"warning","message":{"text":"message.buildOutboundMessage (cognitive 39): message.buildOutboundMessage has cognitive complexity 39 (threshold 15). Drivers by points: ternaries 15 (17 pts), boolean chains 12, if/else 10 (nesting depth added 2). Of this number, 38 points are the body\u0027s own statements and 1 belongs 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/gateway/slack/message.ts"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8c70afdab72989c72b05ea919f9a80e5b6039d7fba1fe5b6677835f2a4dd14"}},{"ruleId":"D2","level":"warning","message":{"text":"expand.expandCommand (cognitive 39): expand.expandCommand has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (15 pts), ternaries 4 (10 pts), boolean chains 6, loops 3 (6 pts), error handling 2 (nesting depth added 11). None of this is in the body itself: all 39 points belong to one function literal inside it that branches (line 30). 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/commands/expand.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"6399c21e8b3f04dc0ec04bffa9df95ae4368af3ae042d7150a6b8cfcf8a7188d"}},{"ruleId":"D2","level":"warning","message":{"text":"provider.providerCommand::renderUsageRow (cognitive 39): provider.providerCommand::renderUsageRow has cognitive complexity 39 (threshold 15). Drivers by points: ternaries 10 (20 pts), if/else 10 (12 pts), loops 4 (6 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. This shape REPEATS in the file: 5 other methods here (provider.providerCommand::renderStatusHuman, provider.providerCommand::renderSeatAccounts, provider.providerCommand::identityLabel, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 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/commands/provider.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"5468bd865eb9e13124013d65689a354f3d60b2b8846a3665682a67da51ed6601"}},{"ruleId":"D2","level":"warning","message":{"text":"provider.providerCommand::renderAcrossHosts (cognitive 39): provider.providerCommand::renderAcrossHosts has cognitive complexity 39 (threshold 15). Drivers by points: ternaries 11 (28 pts), loops 7 (10 pts), if/else 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. This shape REPEATS in the file: 5 other methods here (provider.providerCommand::renderStatusHuman, provider.providerCommand::renderSeatAccounts, provider.providerCommand::identityLabel, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 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/commands/provider.ts"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"af01639ba9baf040de608f5b777cf6de77effd5596df538b68b0294f5a7e9ded"}},{"ruleId":"D2","level":"warning","message":{"text":"restore.restoreCommand (cognitive 39): restore.restoreCommand has cognitive complexity 39 (threshold 15). Drivers by points: if/else 20 (26 pts), loops 5 (7 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 10). None of this is in the body itself: all 39 points belong to 2 function literals inside it that branch (lines 20, 127). 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/commands/restore.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"b895bd8b969eaaf4cfbdd2e5855f4bf9c8b2259d424faace6159cc9ffa9df977"}},{"ruleId":"D2","level":"warning","message":{"text":"workflow-render.composeAttentionRollup (cognitive 39): workflow-render.composeAttentionRollup has cognitive complexity 39 (threshold 15). Drivers by points: ternaries 7 (20 pts), if/else 10 (16 pts), boolean chains 2, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/commands/workflow-render.ts"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c42953a407b3c0835c36cd18d2d201661d4ce12f66224f87573b6b39a01bafe"}},{"ruleId":"D2","level":"warning","message":{"text":"claude-team-permissions.normalize (cognitive 39): claude-team-permissions.normalize has cognitive complexity 39 (threshold 15). Drivers by points: if/else 14 (28 pts), boolean chains 8, loops 2 (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/daemon/assets/claude-team-permissions.cjs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31070f03d83457e56f867928ddb6169a6051341dfc01851cb9f10b3756560a0"}},{"ruleId":"D2","level":"warning","message":{"text":"seat-recap-store.writeSeatRecap (cognitive 39): seat-recap-store.writeSeatRecap has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (18 pts), error handling 6 (14 pts), loops 2 (3 pts), ternaries 1 (3 pts), boolean chains 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/daemon/src/domain/context-packs/seat-recap-store.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"e20c25c71dff45a7f18f934cb322ac013cc3ecd4b6f2c61aba035e1da0dfc697"}},{"ruleId":"D2","level":"warning","message":{"text":"MissionControlWriteContract.actOn (cognitive 39): MissionControlWriteContract.actOn has cognitive complexity 39 (threshold 15). Drivers by points: ternaries 9 (14 pts), boolean chains 12, if/else 9 (10 pts), error handling 2 (3 pts) (nesting depth added 7). Of this number, 23 points are the body\u0027s own statements and 16 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/daemon/src/domain/mission-control/mission-control-write-contract.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f3bf695f23a0a0a51f09c4971621c2cf849fccb6c7b7998dbe8480b32e81e1d"}},{"ruleId":"D2","level":"warning","message":{"text":"usage-series.computeCostView (cognitive 39): usage-series.computeCostView has cognitive complexity 39 (threshold 15). Drivers by points: ternaries 8 (16 pts), if/else 7 (15 pts), loops 4 (5 pts), boolean chains 3 (nesting depth added 17). Of this number, 38 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/daemon/src/domain/usage-series.ts"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"9336a9acd149a177828b10f140ba910cbc3336de6952faa03fe5750204695edf"}},{"ruleId":"D2","level":"warning","message":{"text":"HealthCheckpointSource.validate (cognitive 39): HealthCheckpointSource.validate has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 14, ternaries 2 (5 pts), loops 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/daemon/src/domain/health-checkpoints.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a9ae75e568073009a3af239580dd6a031de8bc4749d11b19df7ffb81e5e240"}},{"ruleId":"D2","level":"warning","message":{"text":"delivery-digest-flush.runDeliveryDigestFlush (cognitive 39): delivery-digest-flush.runDeliveryDigestFlush has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (22 pts), ternaries 3 (6 pts), boolean chains 5, loops 3 (4 pts), error handling 2 (nesting depth added 10). Of this number, 33 points are the body\u0027s own statements and 6 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":"packages/daemon/src/domain/policies/delivery-digest-flush.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c4bffe746cdf43225b6f95a0c2cdfb3c2a54c8fd6f7b0ba04575478e2da12a"}},{"ruleId":"D2","level":"warning","message":{"text":"workflow-keepalive.makeWorkflowKeepalivePolicy.evaluate (cognitive 39): workflow-keepalive.makeWorkflowKeepalivePolicy.evaluate has cognitive complexity 39 (threshold 15). Drivers by points: ternaries 13, if/else 11 (12 pts), boolean chains 8, error handling 2 (4 pts), loops 1 (2 pts) (nesting depth added 4). 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/daemon/src/domain/policies/workflow-keepalive.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dbd2b99f6e656fd9ae4cc983d78ee1ab31dd0554a88419c6554fdaa5e2d5234"}},{"ruleId":"D2","level":"warning","message":{"text":"SeatLifecycleService.setCwd (cognitive 39): SeatLifecycleService.setCwd has cognitive complexity 39 (threshold 15). Drivers by points: if/else 19 (24 pts), boolean chains 5, error handling 4 (5 pts), ternaries 2 (4 pts), loops 1 (nesting depth added 8). Of this number, 34 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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ad8adbb949c263342bfdc03ac741cbb80785b8e8dae4067a97808c979f7a6c"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamIntakeCoordinator.catchUp (cognitive 39): StreamIntakeCoordinator.catchUp has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (23 pts), error handling 5 (7 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":"packages/daemon/src/domain/stream-intake.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac44517bdbf4929720d56df289e8870f8c491f97b897f93946386d6d4fb35eb"}},{"ruleId":"D2","level":"warning","message":{"text":"review.reviewRoutes (cognitive 39): review.reviewRoutes has cognitive complexity 39 (threshold 15). Drivers by points: if/else 22 (28 pts), ternaries 2 (5 pts), boolean chains 3, error handling 2 (3 pts) (nesting depth added 10). None of this is in the body itself: all 39 points belong to 6 function literals inside it that branch (lines 118, 45, 98, \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/daemon/src/routes/review.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ac5b00c32d5e863fa935a6dac8376defb062be8555da2f6d5325d34e3c3018"}},{"ruleId":"D2","level":"warning","message":{"text":"scope-audit.scopeAuditRoutes (cognitive 39): scope-audit.scopeAuditRoutes has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (27 pts), ternaries 3 (6 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 15). None of this is in the body itself: all 39 points belong to 3 function literals inside it that branch (lines 201, 168, 353). 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/daemon/src/routes/scope-audit.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff0cb00ec4e392fd4c7c201c7e10c932755f31342bddaa365d061be50c62c53"}},{"ruleId":"D2","level":"warning","message":{"text":"execution-model.overviewLines (cognitive 39): execution-model.overviewLines has cognitive complexity 39 (threshold 15). Drivers by points: ternaries 19 (26 pts), boolean chains 6, if/else 5, loops 2 (nesting depth added 7). Of this number, 38 points are the body\u0027s own statements and 1 belongs 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/tui/src/execution/execution-model.ts"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe71afc8578f5482aad84afcac0bc4485610833c8c4f2d8ba8d53aca07d483f"}},{"ruleId":"D2","level":"warning","message":{"text":"QueueItemViewer.QueueItemViewer (cognitive 39): QueueItemViewer.QueueItemViewer has cognitive complexity 39 (threshold 15). Drivers by points: ternaries 21 (30 pts), boolean chains 8, if/else 1 (nesting depth added 9). Of this number, 34 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/ui/src/components/drawer-viewers/QueueItemViewer.tsx"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c59ad19df8e1a31f704f79a6253ab8e9a085b292d59fba039dad88ada0efd08"}},{"ruleId":"D2","level":"warning","message":{"text":"rigspec-schema.validateWorkspaceBlock (cognitive 38): rigspec-schema.validateWorkspaceBlock has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 11, 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":"packages/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"3653e4d7e37bc0db78f9995989af1e76a35d072622d33d9c08d99577c1e41671"}},{"ruleId":"D2","level":"warning","message":{"text":"queue-waiting.readWaitingView (cognitive 38): queue-waiting.readWaitingView has cognitive complexity 38 (threshold 15). Drivers by points: ternaries 11 (15 pts), if/else 7 (12 pts), boolean chains 6, error handling 3 (5 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":"packages/daemon/src/domain/queue-waiting.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff46f64196a30fd79b5bdc5291b55aaa7b6f243810849a38619ec345720ec03"}},{"ruleId":"D2","level":"warning","message":{"text":"human-readiness.resolveHumanDeliveryReadiness (cognitive 38): human-readiness.resolveHumanDeliveryReadiness has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (17 pts), ternaries 6 (12 pts), boolean chains 7, error handling 1, 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/daemon/src/domain/gateway/human-readiness.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"887016def8d463429beceea63db89c009857c948ffed346ebec634855dd6d98b"}},{"ruleId":"D2","level":"warning","message":{"text":"provider-signals.deriveUsageLimitPools (cognitive 38): provider-signals.deriveUsageLimitPools has cognitive complexity 38 (threshold 15). Drivers by points: ternaries 9 (17 pts), if/else 6 (10 pts), boolean chains 8, loops 3 (nesting depth added 12). Of this number, 26 points are the body\u0027s own statements and 12 belong 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":"packages/daemon/src/domain/provider/provider-signals.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"040ba814d127f42705075e76c1c7f99d7571c7068c3ae4603df92506edb63350"}},{"ruleId":"D2","level":"warning","message":{"text":"node-inventory.computeRecoveryGuidance (cognitive 38): node-inventory.computeRecoveryGuidance has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (27 pts), ternaries 5 (10 pts), boolean chains 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":"packages/daemon/src/domain/node-inventory.ts"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"506564a952630488b53f7998da0887ebf89f33f9e0ae7dedbfdd293a1bf22b07"}},{"ruleId":"D2","level":"warning","message":{"text":"QueueRepository.recordHumanAnswer (cognitive 38): QueueRepository.recordHumanAnswer has cognitive complexity 38 (threshold 15). Drivers by points: boolean chains 14, if/else 12, ternaries 6 (10 pts), error handling 1 (2 pts) (nesting depth added 5). Most of this is not in the body itself: 8 of the 38 points are its own statements and the rest belongs to one function literal inside it that branches (line 4676). 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":4669}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5389fd5a4bba05924c80ab811f6ad80f717fb10b2d420e70ae89d84446a39d3"}},{"ruleId":"D2","level":"warning","message":{"text":"EnvironmentLifecycle.recreate (cognitive 38): EnvironmentLifecycle.recreate has cognitive complexity 38 (threshold 15). Drivers by points: if/else 20 (26 pts), boolean chains 7, ternaries 3, error handling 1 (2 pts) (nesting depth added 7). Of this number, 37 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/daemon/src/domain/environment-lifecycle.ts"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c49333ef37c7245694e984a222dc28019394df26cc2c38d39d194084e31b13"}},{"ruleId":"D2","level":"warning","message":{"text":"TmuxAdapter.scopedLaunchCommand (cognitive 38): TmuxAdapter.scopedLaunchCommand has cognitive complexity 38 (threshold 15). Drivers by points: if/else 20 (26 pts), ternaries 5, boolean chains 4, error handling 2 (3 pts) (nesting depth added 7). Of this number, 34 points are the body\u0027s own statements and 4 belong to 3 function items 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/daemon/src/adapters/tmux.ts"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc27f5c02d9ddbc498576261ef55604feb4e3ecab07ed346e1b0c65a2719a398"}},{"ruleId":"D2","level":"warning","message":{"text":"adopt.adoptCommand (cognitive 38): adopt.adoptCommand has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (22 pts), loops 3 (5 pts), ternaries 4 (5 pts), boolean chains 3, error handling 3 (nesting depth added 8). None of this is in the body itself: all 38 points belong to one function literal inside it that branches (line 94). 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/commands/adopt.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ee8e584a6546b2cfda4f83966c895a1335fa171a206de4a4f0ae966439bdd3"}},{"ruleId":"D2","level":"warning","message":{"text":"claude-transcript-parser.parseClaudeTranscript (cognitive 38): claude-transcript-parser.parseClaudeTranscript has cognitive complexity 38 (threshold 15). Drivers by points: if/else 7 (15 pts), ternaries 4 (10 pts), loops 4 (7 pts), boolean chains 4, error handling 1 (2 pts) (nesting depth added 18). Of this number, 37 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/restore-packet/claude-transcript-parser.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa2ac13497a773f4c0a30730d8db8bc63224fcd2309521278e4e9aad39dff6f"}},{"ruleId":"D2","level":"warning","message":{"text":"workflow-render.renderTraceTree (cognitive 38): workflow-render.renderTraceTree has cognitive complexity 38 (threshold 15). Drivers by points: ternaries 10 (18 pts), if/else 8 (12 pts), loops 4 (5 pts), boolean chains 3 (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/commands/workflow-render.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac1101df6706d35d4e2f3aec2f2d0d2ef2d563d43dc46bef4542ffcfbe81b77a"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-core-plugin-install.codexCorePluginEnablement (cognitive 38): codex-core-plugin-install.codexCorePluginEnablement has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (31 pts), boolean chains 2, error handling 1 (2 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/codex-core-plugin-install.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fbbf2d21032bf03e59a0db5026355085ace867a600e408bd793aefe8c49d71e"}},{"ruleId":"D2","level":"warning","message":{"text":"daemon-db-path.daemonDatabaseWarnings (cognitive 38): daemon-db-path.daemonDatabaseWarnings has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 7 (9 pts), boolean chains 7, error handling 4 (7 pts), loops 2 (nesting depth added 9). Most of this is not in the body itself: 11 of the 38 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 107, 145, 149, \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/daemon/src/daemon-db-path.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"872726530bd91c7e0745bf3606a21e62d395fec47d86b182db20431fc12d9bc7"}},{"ruleId":"D2","level":"warning","message":{"text":"seat-attention-reconciler.describeLineageFailure (cognitive 38): seat-attention-reconciler.describeLineageFailure has cognitive complexity 38 (threshold 15). Drivers by points: ternaries 12 (19 pts), if/else 8 (15 pts), boolean chains 2, error handling 1, match/switch 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-attention-reconciler.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e292c4e6415127d32aa07e222f41e2dec05d983f4cf5fd7f624b549e8f4fd9"}},{"ruleId":"D2","level":"warning","message":{"text":"RestoreOrchestrator.finishJoinedResume (cognitive 38): RestoreOrchestrator.finishJoinedResume has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 15, ternaries 3 (5 pts) (nesting depth added 8). Of this number, 32 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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":2647}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd448445d8f1a09c2b2d98efba86a4e976fcfe388d51fcc954ecf33016481c61"}},{"ruleId":"D2","level":"warning","message":{"text":"RigTeardownOrchestrator.recordAlreadyStoppedIntent (cognitive 38): RigTeardownOrchestrator.recordAlreadyStoppedIntent has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (28 pts), boolean chains 4, error handling 2 (4 pts), loops 2 (nesting depth added 17). Of this number, 31 points are the body\u0027s own statements and 7 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/daemon/src/domain/rig-teardown.ts"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"0933f5fa1daeafd4d626b356e829ac29a7a3407703c2b0aec8876da9553e099a"}},{"ruleId":"D2","level":"warning","message":{"text":"terminal-follow-policy.planFollowingTiles (cognitive 38): terminal-follow-policy.planFollowingTiles has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 9, ternaries 1 (3 pts), loops 2 (nesting depth added 12). Of this number, 33 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/daemon/src/domain/terminal/terminal-follow-policy.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"1793113510da3dbee26c42f296e2cac73ba84192cf4dda598136c0f2892e1efc"}},{"ruleId":"D2","level":"warning","message":{"text":"storytelling-cards.buildStorytellingFeedItems (cognitive 38): storytelling-cards.buildStorytellingFeedItems has cognitive complexity 38 (threshold 15). Drivers by points: ternaries 8 (17 pts), boolean chains 9, if/else 5 (7 pts), loops 5 (nesting depth added 11). Of this number, 37 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/ui/src/components/feed/cards/storytelling-cards.tsx"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"f358ec51b73aedc0e431a021d1a685323e49be010f69822c162fb5334497aef3"}},{"ruleId":"D2","level":"warning","message":{"text":"RigEnvPanel.RigEnvPanel (cognitive 38): RigEnvPanel.RigEnvPanel has cognitive complexity 38 (threshold 15). Drivers by points: boolean chains 14, if/else 11, ternaries 7 (11 pts), error handling 2 (nesting depth added 4). Of this number, 17 points are the body\u0027s own statements and 21 belong to 6 function items 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/ui/src/components/RigEnvPanel.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"382143297ac95dc725fd1bffe4addd867236674201014c35c07388750fe5e7aa"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeResumeAdapter.verifyResume (cognitive 37): ClaudeResumeAdapter.verifyResume has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (22 pts), ternaries 4 (11 pts), boolean chains 3, 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/daemon/src/adapters/claude-resume.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac8e8c9abc93bf37bae8dd84ba03c2a985d624f9e1e64e94e2fc62a20723991b"}},{"ruleId":"D2","level":"warning","message":{"text":"StartupOrchestrator.sendInteractiveText (cognitive 37): StartupOrchestrator.sendInteractiveText has cognitive complexity 37 (threshold 15). Drivers by points: if/else 19 (23 pts), ternaries 4 (7 pts), boolean chains 5, error handling 1, loops 1 (nesting depth added 7). Of this number, 34 points are the body\u0027s own statements and 3 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/startup-orchestrator.ts"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b313e1a6de6b0978115b688ee1eb982f45c1998bda88d77a3259b311c38e00"}},{"ruleId":"D2","level":"warning","message":{"text":"TmuxAdapter.guardedInput (cognitive 37): TmuxAdapter.guardedInput has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 11, ternaries 2 (3 pts), error handling 2 (nesting depth added 11). Most of this is not in the body itself: 10 of the 37 points are its own statements and the rest belongs to one function literal inside it that branches (line 1338). 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/daemon/src/adapters/tmux.ts"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f655f57d0843dd811837de3cedfcabff42f6d912df26aad7a6ee3768d96ba1"}},{"ruleId":"D2","level":"warning","message":{"text":"TmuxAdapter.capturePanesContent::captureChunk (cognitive 37): TmuxAdapter.capturePanesContent::captureChunk has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 3 (6 pts), boolean chains 5, ternaries 1 (2 pts), error handling 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":"packages/daemon/src/adapters/tmux.ts"},"region":{"startLine":2697}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc711ae22789d978e865078300d1f9b486141d1f5e9f671d625e827cfbecec88"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp-http.startMcpHttpServer.handle (cognitive 37): mcp-http.startMcpHttpServer.handle has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (17 pts), ternaries 4 (13 pts), error handling 2 (4 pts), boolean chains 3 (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/mcp-http.ts"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cab2c721ef7a738b2cb810c5b66b8e2060edb1db58618964b4c8dab41043af4"}},{"ruleId":"D2","level":"warning","message":{"text":"project-worker.runProjectWake (cognitive 37): project-worker.runProjectWake has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 11, ternaries 7, error handling 1 (nesting depth added 8). Most of this is not in the body itself: 14 of the 37 points are its own statements and the rest belongs to 5 function items inside it that branch (a function literal at line 107, suffix, a function literal at line 102, \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/commands/project-worker.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d9e5420b669a5fabe50cfb429efb5abd9dd9af5247fd62cc2106b65f5290266"}},{"ruleId":"D2","level":"warning","message":{"text":"decisions.judge (cognitive 37): decisions.judge has cognitive complexity 37 (threshold 15). Drivers by points: boolean chains 12, ternaries 8 (12 pts), if/else 9 (11 pts), error handling 1, 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/decisions/decisions.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"85a415c5009f6f412a6df8df77b2d0444bb4a889e93dcb6e824c89d491c04346"}},{"ruleId":"D2","level":"warning","message":{"text":"workflow-follow.consumeStream (cognitive 37): workflow-follow.consumeStream has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (29 pts), error handling 2 (4 pts), loops 2 (3 pts), boolean chains 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":"packages/cli/src/commands/workflow-follow.ts"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"75340244b692f20c62efb34c042d7473bb05cb90e3e32e1c8b43d8e3ce1f4e14"}},{"ruleId":"D2","level":"warning","message":{"text":"CodexRuntimeAdapter.removeCodexActivityHooks (cognitive 37): CodexRuntimeAdapter.removeCodexActivityHooks has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (22 pts), ternaries 5 (9 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (2 pts) (nesting depth added 17). Of this number, 31 points are the body\u0027s own statements and 6 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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f448dfcf808518cc39cb28dfddd69fca8e1dbf70d95eaeabfb8a6da9363036"}},{"ruleId":"D2","level":"warning","message":{"text":"CmuxLayoutService.buildWorkspacePanes (cognitive 37): CmuxLayoutService.buildWorkspacePanes has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 6 (9 pts), boolean chains 5, ternaries 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/cmux-layout-service.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"baaa9f7e8771b8113fffbaea618131fdc260db6759f891f9bd05f256f16ea0cc"}},{"ruleId":"D2","level":"warning","message":{"text":"slack-subsystem.makeHumanReplyResolver.\u003Creturned closure\u003E (cognitive 37): slack-subsystem.makeHumanReplyResolver.\u003Creturned closure\u003E has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 11, ternaries 7 (10 pts), error handling 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/daemon/src/domain/gateway/slack/slack-subsystem.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"a265c6d08b3b4eee1962ecda640433ad67ca7afe9ffed4a959f90ad3bf394296"}},{"ruleId":"D2","level":"warning","message":{"text":"SuccessorSessionLauncher.createSuccessor (cognitive 37): SuccessorSessionLauncher.createSuccessor has cognitive complexity 37 (threshold 15). Drivers by points: ternaries 14 (24 pts), if/else 7 (8 pts), error handling 2 (3 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/daemon/src/domain/successor-session-launcher.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de9ceff8722765d8585d8cf96cb71a4199f0d6883b43d0b38bc915b4cb75550"}},{"ruleId":"D2","level":"warning","message":{"text":"rigspec.rigspecImportRoutes.post(\u0022/materialize\u0022) (cognitive 37): rigspec.rigspecImportRoutes.post(\u0022/materialize\u0022) has cognitive complexity 37 (threshold 15). Drivers by points: ternaries 11 (29 pts), if/else 6, boolean chains 1, error handling 1 (nesting depth added 18). 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/daemon/src/routes/rigspec.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26c123518053d017cd8524ae3f91622d1ccd4334b3ab4bd278a22918a58236d"}},{"ruleId":"D2","level":"warning","message":{"text":"fleet-scopes-model.fleetScopesLines (cognitive 37): fleet-scopes-model.fleetScopesLines has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 5 (11 pts), loops 5 (8 pts), boolean chains 4 (nesting depth added 13). Of this number, 36 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/tui/src/scopes/fleet-scopes-model.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"8887feebaaa3966854e818a861138c2fa3be145ee5cfcf6d0fbfc011ce8c9b8b"}},{"ruleId":"D2","level":"warning","message":{"text":"main.run::draw (cognitive 37): main.run::draw has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (14 pts), ternaries 6 (12 pts), boolean chains 11 (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: 3 other methods here (main.run, main.run::executeAct, main.run::handleInput) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 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/tui/src/main.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d2a36c40aa44754daea7081701409ae2344f696f488a0b89519e7790eedd8b"}},{"ruleId":"D2","level":"warning","message":{"text":"HotPotatoEdge.HotPotatoEdge (cognitive 37): HotPotatoEdge.HotPotatoEdge has cognitive complexity 37 (threshold 15). Drivers by points: ternaries 15 (37 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/ui/src/components/topology/HotPotatoEdge.tsx"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a57f817ff600f3d1757877f96706a4c914de901248907bc6b7863841ee4c03"}},{"ruleId":"D2","level":"warning","message":{"text":"session-transport.styledTextLines (cognitive 36): session-transport.styledTextLines has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (15 pts), ternaries 3 (15 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 20). None of this is in the body itself: all 36 points belong to one function literal inside it that branches (line 516). 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"6caad99161a3350bb2e951718446b2ba72da224e5ac123a58b071a85987140ea"}},{"ruleId":"D2","level":"warning","message":{"text":"TmuxAdapter.seatScopeStart (cognitive 36): TmuxAdapter.seatScopeStart has cognitive complexity 36 (threshold 15). Drivers by points: ternaries 6 (19 pts), if/else 5 (10 pts), error handling 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/adapters/tmux.ts"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e166797bce3dd8362cfb33aee776cc315ed8f00ba7f6c7f12a2877bd693481"}},{"ruleId":"D2","level":"warning","message":{"text":"scope-fs.updateMappedFrontmatter (cognitive 36): scope-fs.updateMappedFrontmatter has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 5 (14 pts), boolean chains 7, loops 1 (nesting depth added 16). 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/lib/scope/scope-fs.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ab71aeadd799925aae996dac383f9f67845472b424ee41efd5d1cf94c650c5"}},{"ruleId":"D2","level":"warning","message":{"text":"roster.enrichRosterMember (cognitive 36): roster.enrichRosterMember has cognitive complexity 36 (threshold 15). Drivers by points: ternaries 20 (29 pts), boolean chains 7 (nesting depth added 9). Of this number, 32 points are the body\u0027s own statements and 4 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":"packages/cli/src/commands/roster.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0644ec206954eec6a1fc10d964db55877804ddaab849f09f13ccfb13dc455ea"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp-server.hostedMembersOf (cognitive 36): mcp-server.hostedMembersOf has cognitive complexity 36 (threshold 15). Drivers by points: ternaries 9 (20 pts), if/else 7 (10 pts), boolean chains 4, error handling 1, loops 1 (nesting depth added 14). Of this number, 32 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/mcp-server.ts"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"33fa186bde4437cb4d668fe931e54cc955a21e82183c690dc83f1d7a117ebaf4"}},{"ruleId":"D2","level":"warning","message":{"text":"skill.skillCommand::printSeat (cognitive 36): skill.skillCommand::printSeat has cognitive complexity 36 (threshold 15). Drivers by points: ternaries 8 (28 pts), if/else 4, boolean chains 2, loops 2 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: 2 other methods here (skill.skillCommand::seatLoadout, skill.skillCommand::describeDelivery) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 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/commands/skill.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1c9df91f324ea69887fbcde64c99538a10878007728f7bc60bb9d041c8bca3"}},{"ruleId":"D2","level":"warning","message":{"text":"stream.streamCommand (cognitive 36): stream.streamCommand has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14, ternaries 12 (14 pts), boolean chains 7, error handling 1 (nesting depth added 2). None of this is in the body itself: all 36 points belong to 13 function literals inside it that branch (lines 186, 336, 219, \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/commands/stream.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4445fcc4a2b1718113674efb81b7981b5b671c82b311ade14e3984b194f9e18"}},{"ruleId":"D2","level":"warning","message":{"text":"ContextPackLibraryService.composeFromFiles (cognitive 36): ContextPackLibraryService.composeFromFiles has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (23 pts), error handling 6 (7 pts), boolean chains 3, loops 2, ternaries 1 (nesting depth added 10). Of this number, 33 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/daemon/src/domain/context-packs/context-pack-library-service.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e73e8d4f8cdb43b8fcf79e7571de9a52dda904a0f53d1750f588b00424e3615"}},{"ruleId":"D2","level":"warning","message":{"text":"SeatHandoverService.finalizeWithDiscovered (cognitive 36): SeatHandoverService.finalizeWithDiscovered has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 12, error handling 3 (4 pts), ternaries 2 (3 pts) (nesting depth added 4). Of this number, 31 points are the body\u0027s own statements and 5 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9c8fe9f9b8972361c9a8701cbb59a67a3b5e6397f1decd41c22b6c27cfcb1c2"}},{"ruleId":"D2","level":"warning","message":{"text":"live-events.subscribeActivityEvents.connect (cognitive 36): live-events.subscribeActivityEvents.connect has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (26 pts), loops 2 (3 pts), ternaries 1 (3 pts), boolean chains 2, error handling 2 (nesting depth added 16). Of this number, 24 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":"packages/tui/src/live-events.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"075d664b72254724aaf15f5264fa159a3e9437d3d6b17239c3d07d93932ac502"}},{"ruleId":"D2","level":"warning","message":{"text":"Feed.Feed (cognitive 36): Feed.Feed has cognitive complexity 36 (threshold 15). Drivers by points: ternaries 15 (21 pts), if/else 9 (11 pts), boolean chains 3, loops 1 (nesting depth added 8). Most of this is not in the body itself: 6 of the 36 points are its own statements and the rest belongs to 12 function literals inside it that branch (lines 363, 497, 315, \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/ui/src/components/for-you/Feed.tsx"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"97cd9a97e51eeba8a46ea9d7edbba79454d8a79ee20726fa1c12a4351cba2c4c"}},{"ruleId":"D2","level":"warning","message":{"text":"ScopePages.SliceScopePage (cognitive 36): ScopePages.SliceScopePage has cognitive complexity 36 (threshold 15). Drivers by points: ternaries 15 (27 pts), boolean chains 7, if/else 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/ui/src/components/project/ScopePages.tsx"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff283384a465cfd8263cd0598a3310de501fd1402eb648f4443a1bd6be22fa8"}},{"ruleId":"D2","level":"warning","message":{"text":"compose.blocking_state (cognitive 36): compose.blocking_state has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 4 (14 pts), loops 2 (5 pts), boolean chains 3 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/assets/plugins/openrig-core/skills/openrig-operating-model/scripts/compose.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f32875ac76ec647b0c72646de80438bf25a36be2ca088079325b6ba37e1c66"}},{"ruleId":"D2","level":"warning","message":{"text":"compose.compose_progress (cognitive 36): compose.compose_progress has cognitive complexity 36 (threshold 15). Drivers by points: ternaries 7 (14 pts), if/else 5 (13 pts), loops 6 (8 pts), boolean chains 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/daemon/assets/plugins/openrig-core/skills/openrig-operating-model/scripts/compose.py"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbddb709c70300e8f731c0247c44e301d129739871da50f102bbbfd5966054ca"}},{"ruleId":"D2","level":"warning","message":{"text":"effective-model-readers.newestPiModel (cognitive 35): effective-model-readers.newestPiModel has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (16 pts), ternaries 5 (11 pts), boolean chains 5, 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":"packages/daemon/src/domain/model-divergence/effective-model-readers.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5e0570a84d29dc8370fd32c4e2921fce671d8bc8407738438eb832855511e5"}},{"ruleId":"D2","level":"warning","message":{"text":"native-process-lineage.explainNativeRejection (cognitive 35): native-process-lineage.explainNativeRejection has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (27 pts), boolean chains 4, ternaries 2 (4 pts) (nesting depth added 13). Of this number, 33 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/daemon/src/domain/native-process-lineage.ts"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"823e05481784e5929acbb81a37fb459fdc8c50a07f231bb81779652375f082a7"}},{"ruleId":"D2","level":"warning","message":{"text":"WatchdogJobsRepository.register (cognitive 35): WatchdogJobsRepository.register has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (13 pts), ternaries 8 (13 pts), boolean chains 9 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/watchdog-jobs-repository.ts"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"838cf2aa20a87dfb8c16f84b02bae59b7874b2b88e46ce6c4c4e9324d1edb10a"}},{"ruleId":"D2","level":"warning","message":{"text":"rigspec-schema.normalizeSessionSource (cognitive 35): rigspec-schema.normalizeSessionSource has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (20 pts), ternaries 4 (8 pts), boolean chains 5, 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":"packages/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38eb1ac7ab0909730b2c0d43da531e10ecda69f818885a5ccc20ebf211412a1"}},{"ruleId":"D2","level":"warning","message":{"text":"escalation-owner.resolveEscalationOwner (cognitive 35): escalation-owner.resolveEscalationOwner has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17 (20 pts), ternaries 5 (7 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 6). Of this number, 17 points are the body\u0027s own statements and 18 belong to 6 function items 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":"packages/daemon/src/domain/escalation-owner.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f2d916b2eb614004eebb3c85f5c3e5b0b5e9c85bb7bf192dae6920291c8449c"}},{"ruleId":"D2","level":"warning","message":{"text":"persisted-restore-posture.resolvePersistedRestorePosture (cognitive 35): persisted-restore-posture.resolvePersistedRestorePosture has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (25 pts), error handling 3 (8 pts), boolean chains 2 (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/permission-policy/persisted-restore-posture.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"6969473e0c26fd8371bdf52a1a2bcbf98fe27279a75bda2a478d55114dc45840"}},{"ruleId":"D2","level":"warning","message":{"text":"relay-outbound.prepareRelayDecision (cognitive 35): relay-outbound.prepareRelayDecision has cognitive complexity 35 (threshold 15). Drivers by points: ternaries 9 (15 pts), if/else 8 (11 pts), boolean chains 9 (nesting depth added 9). Of this number, 34 points are the body\u0027s own statements and 1 belongs 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/daemon/src/domain/gateway/relay-outbound.ts"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91c26bf7f6ade36597c9a6585f729f09b0fb82b2cc1b99505c9f043c52e6070"}},{"ruleId":"D2","level":"warning","message":{"text":"QueueRepository.createInTransactionalContext (cognitive 35): QueueRepository.createInTransactionalContext has cognitive complexity 35 (threshold 15). Drivers by points: if/else 18 (24 pts), boolean chains 7, ternaries 4 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/queue-repository.ts"},"region":{"startLine":2555}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b4f6d8a5ff4809b0e9f94fe5d899367c1718d824bd81af9d0968e6cd81f00a"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionTransport.waitForIdle (cognitive 35): SessionTransport.waitForIdle has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 8, ternaries 6 (8 pts), loops 1 (nesting depth added 11). Of this number, 28 points are the body\u0027s own statements and 7 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":4268}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd615da3cb680e958e2515cbab9e75351539224c214f02ed0f70fb64264e565"}},{"ruleId":"D2","level":"warning","message":{"text":"TmuxAdapter.sendShellCommandUnchecked (cognitive 35): TmuxAdapter.sendShellCommandUnchecked has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (17 pts), ternaries 5 (7 pts), error handling 3 (6 pts), boolean chains 5 (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/daemon/src/adapters/tmux.ts"},"region":{"startLine":1982}}}],"partialFingerprints":{"codehealthFindingId/v1":"24904fe8eba7e3e522e49975f357dafb558155c9d930622df41167d5e17d7850"}},{"ruleId":"D2","level":"warning","message":{"text":"reconstruction-reader.readReconstruction.materialize (cognitive 35): reconstruction-reader.readReconstruction.materialize has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 4 (10 pts), ternaries 2 (5 pts), boolean chains 3, error handling 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":"packages/cli/src/lib/reconstruction-reader.ts"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"a23c6b13d47f8ca219cd2c9c1af6c8faac7babed0f71180839464795607da38c"}},{"ruleId":"D2","level":"warning","message":{"text":"context-reconstruction.reconstructionCommand (cognitive 35): context-reconstruction.reconstructionCommand has cognitive complexity 35 (threshold 15). Drivers by points: ternaries 7 (19 pts), if/else 5 (11 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (nesting depth added 19). Most of this is not in the body itself: 3 of the 35 points are its own statements and the rest belongs to one function literal inside it that branches (line 35). 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/commands/context-reconstruction.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef01e003c9b34a4ebcf78b622c46a37325446bed1faad3743399905a15d9c273"}},{"ruleId":"D2","level":"warning","message":{"text":"queue.terminalDeliveryResult (cognitive 35): queue.terminalDeliveryResult has cognitive complexity 35 (threshold 15). Drivers by points: ternaries 18 (30 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/cli/src/commands/queue.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf09110f4ec7f463ef8c1cc38aff3560d1d8cca12d7a9489cc11781ecbd673e"}},{"ruleId":"D2","level":"warning","message":{"text":"CodexRuntimeAdapter.deliverStartup (cognitive 35): CodexRuntimeAdapter.deliverStartup has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (23 pts), ternaries 3 (6 pts), error handling 2 (3 pts), match/switch 1 (2 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":"packages/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"8709e0d256d20a18f23acec579de3e37e380ad4076636feafd0d2d0a94267b8a"}},{"ruleId":"D2","level":"warning","message":{"text":"CodexRuntimeAdapter.dismissSkippableCodexUpdatePrompt (cognitive 35): CodexRuntimeAdapter.dismissSkippableCodexUpdatePrompt has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (27 pts), boolean chains 4, ternaries 1 (3 pts), loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":1387}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bd73e76d3b8e02f9a7930564b95bc3f2e6d29aee3e5ab9946256d7306ec3fb4"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerCore.reportUsageFacts (cognitive 35): RunnerCore.reportUsageFacts has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 5 (10 pts), boolean chains 8, loops 2 (3 pts) (nesting depth added 10). Of this number, 24 points are the body\u0027s own statements and 11 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":1438}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7fdf9b7ff8b67e99789ed1ca2920d867590a50896fff3f47379733b852d6828"}},{"ruleId":"D2","level":"warning","message":{"text":"health-context.healthSelectedContext (cognitive 35): health-context.healthSelectedContext has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (22 pts), error handling 2 (4 pts), ternaries 2 (4 pts), boolean chains 3, loops 2 (nesting depth added 15). Of this number, 20 points are the body\u0027s own statements and 15 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/daemon/src/domain/health-context.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2cd89877d679d9e779ec7f40b8acbf0d8176d4c94202c0e7fd9a7889d66ba4"}},{"ruleId":"D2","level":"warning","message":{"text":"SeatHandoverService.proveAttemptSuccessorOnce (cognitive 35): SeatHandoverService.proveAttemptSuccessorOnce has cognitive complexity 35 (threshold 15). Drivers by points: ternaries 10 (19 pts), if/else 8 (9 pts), boolean chains 6, error handling 1 (nesting depth added 10). Of this number, 31 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":"packages/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d0f60602b2b990213567d02ffdbe78c4efc0b41e451b95c1ecbbb421b0b5e2"}},{"ruleId":"D2","level":"warning","message":{"text":"claude-seat-switch.switchHeld (cognitive 35): claude-seat-switch.switchHeld has cognitive complexity 35 (threshold 15). Drivers by points: ternaries 13 (21 pts), if/else 10 (11 pts), boolean chains 2, error handling 1 (nesting depth added 9). Of this number, 30 points are the body\u0027s own statements and 5 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/daemon/src/domain/provider/claude-seat-switch.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"073de8ff5398071459819a108b3f267f37222e1afef06320527e0899fd87a03c"}},{"ruleId":"D2","level":"warning","message":{"text":"seat-skill-apply.applySeatSkills (cognitive 35): seat-skill-apply.applySeatSkills has cognitive complexity 35 (threshold 15). Drivers by points: ternaries 7 (15 pts), if/else 11, boolean chains 5, error handling 3 (4 pts) (nesting depth added 9). Of this number, 28 points are the body\u0027s own statements and 7 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/daemon/src/domain/seat-skill-apply.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9bf112be5159e04a5ac5e21e48e3536a895a358c19ed7aefce9f295267f84b"}},{"ruleId":"D2","level":"warning","message":{"text":"events.eventsRoute.get(\u0022/\u0022) (cognitive 35): events.eventsRoute.get(\u0022/\u0022) has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (18 pts), ternaries 6 (9 pts), loops 4 (6 pts), boolean chains 2 (nesting depth added 13). Most of this is not in the body itself: 3 of the 35 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 32, 39). 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/daemon/src/routes/events.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6feb3853250515edcd766517a74aea7840ae7d51b43ff06b033c70d599bc37d"}},{"ruleId":"D2","level":"warning","message":{"text":"execution-model.executionContentLines (cognitive 35): execution-model.executionContentLines has cognitive complexity 35 (threshold 15). Drivers by points: ternaries 6 (27 pts), if/else 4 (6 pts), boolean chains 2 (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":"packages/tui/src/execution/execution-model.ts"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"643866c6825edefc91a939a3debff0cfe04b7894c3fe5fabd558567f7e66b173"}},{"ruleId":"D2","level":"warning","message":{"text":"permission-stop-observation.admittedRules (cognitive 34): permission-stop-observation.admittedRules has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 8, ternaries 2 (5 pts), loops 2 (3 pts), error handling 1 (nesting depth added 12). Of this number, 33 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/daemon/src/domain/permission-stop-observation.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"944204667e7bddd239cb21fecb7e6418ea9bef9d990ca3b6b8eb9d5077fc3a2f"}},{"ruleId":"D2","level":"warning","message":{"text":"current-generation-record.resolveIdentityVerifiedClaudeRecord (cognitive 34): current-generation-record.resolveIdentityVerifiedClaudeRecord has cognitive complexity 34 (threshold 15). Drivers by points: if/else 19 (22 pts), boolean chains 6, ternaries 3 (5 pts), 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/model-divergence/current-generation-record.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1430de50f7be86f36750a728ad6b575106e83ae962f24ad4da92e621c564b6d"}},{"ruleId":"D2","level":"warning","message":{"text":"startup-validation.validateStartupAction (cognitive 34): startup-validation.validateStartupAction has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 6, loops 1 (3 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":"packages/daemon/src/domain/startup-validation.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c3dc099c3ad5c88344841133c44d63af1c1e7202ce5404a34531d65f1b8f80"}},{"ruleId":"D2","level":"warning","message":{"text":"protocol.decodeGatewayMessage (cognitive 34): protocol.decodeGatewayMessage has cognitive complexity 34 (threshold 15). Drivers by points: if/else 17 (28 pts), boolean chains 3, ternaries 1 (2 pts), error handling 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/daemon/src/domain/gateway/protocol.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"48bf602b840d35aa0d5049b4fd76347318c908928bba28a0a1eb4c0cd63a9652"}},{"ruleId":"D2","level":"warning","message":{"text":"SliceIndexer.walkSliceLocations (cognitive 34): SliceIndexer.walkSliceLocations has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 3 (7 pts), error handling 2 (6 pts), boolean chains 3 (nesting depth added 19). Of this number, 29 points are the body\u0027s own statements and 5 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/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"c57067f72d307bfd29478518eb4f8e65ebfb29db1513d5e010515aa1c83415f2"}},{"ruleId":"D2","level":"warning","message":{"text":"SliceIndexer.missionIdAliasesForCounting (cognitive 34): SliceIndexer.missionIdAliasesForCounting has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (22 pts), error handling 2 (4 pts), loops 3 (4 pts), boolean chains 2, ternaries 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/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe52d002d7ad7aec824d71fb18b7eb4193bdb1af544374341f58c992d831151"}},{"ruleId":"D2","level":"warning","message":{"text":"TmuxAdapter.respawnPaneUnchecked (cognitive 34): TmuxAdapter.respawnPaneUnchecked has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 6, loops 2 (4 pts), ternaries 3 (4 pts), error handling 3 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/adapters/tmux.ts"},"region":{"startLine":2295}}}],"partialFingerprints":{"codehealthFindingId/v1":"e40495dc8fa4406de67d30a76d15433abf1784be27eb2538616731149ba170bd"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeCompactionEnforcer.beginPreparation (cognitive 34): ClaudeCompactionEnforcer.beginPreparation has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 8, error handling 3 (6 pts), ternaries 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":1599}}}],"partialFingerprints":{"codehealthFindingId/v1":"9220f5a9329904e3307c7a6850f4cfcc6a3cccf04b4605862f3d1663aa0901cd"}},{"ruleId":"D2","level":"warning","message":{"text":"attach.attachCommand (cognitive 34): attach.attachCommand has cognitive complexity 34 (threshold 15). Drivers by points: if/else 21 (24 pts), boolean chains 7, ternaries 3 (nesting depth added 3). None of this is in the body itself: all 34 points belong to 2 function items inside it that branch (a function literal at line 68, getClient). 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/commands/attach.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"24711bc7c45d31609ea8a2ceddf561fa9b10889665fcd566691f139d4f54f41b"}},{"ruleId":"D2","level":"warning","message":{"text":"PodRigInstantiator.launchFirstMaterializedNode (cognitive 34): PodRigInstantiator.launchFirstMaterializedNode has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15, ternaries 9 (11 pts), boolean chains 7, error handling 1 (nesting depth added 2). Of this number, 26 points are the body\u0027s own statements and 8 belong to 2 function items 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":"packages/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8937eacf3d031b5fbbcadea3c73800461adb5e6801028cc5601b465c948696"}},{"ruleId":"D2","level":"warning","message":{"text":"SeatAttentionReconciler.getDerivedAttentionOutcome (cognitive 34): SeatAttentionReconciler.getDerivedAttentionOutcome has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 5, ternaries 2 (5 pts), error handling 1 (2 pts), loops 1 (nesting depth added 15). Of this number, 33 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/daemon/src/domain/seat-attention-reconciler.ts"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab4d0b324230918ba721124781d36ab3ea8bfb085fbe6170348ddf984f109426"}},{"ruleId":"D2","level":"warning","message":{"text":"PiCompactionService.attemptState (cognitive 34): PiCompactionService.attemptState has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 16 (30 pts), if/else 3, 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":"packages/daemon/src/domain/pi-compaction-service.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"8edb97bcb642e3ce2ff1b98d3189c82b048a1b8c44b338b3441366597d62fb54"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin-discovery-service.extractHookIdentities (cognitive 34): plugin-discovery-service.extractHookIdentities has cognitive complexity 34 (threshold 15). Drivers by points: if/else 4 (12 pts), ternaries 4 (12 pts), loops 3 (6 pts), boolean chains 3, error handling 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":"packages/daemon/src/domain/plugin-discovery-service.ts"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e5628551406558761f280d3f632a7be08646b0131ec6519c61b18afe9930eb"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-usage-reader.converse (cognitive 34): codex-usage-reader.converse has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (18 pts), ternaries 3 (10 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (nesting depth added 14). None of this is in the body itself: all 34 points belong to 4 function literals inside it that branch (lines 113, 106, 95, \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/daemon/src/domain/provider/codex-usage-reader.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fbb6e21ce8370fe0b0dbfa61c813027ff978a25a86915c2d90545d0a13f65fc"}},{"ruleId":"D2","level":"warning","message":{"text":"activity.recordHookActivity (cognitive 34): activity.recordHookActivity has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 8 (12 pts), boolean chains 8 (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/daemon/src/routes/activity.ts"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"95214595b44db2edbc19233f579707cb3ede99321a645f66b79ba1d9b04bf4c3"}},{"ruleId":"D2","level":"warning","message":{"text":"slices.slicesRoutes (cognitive 34): slices.slicesRoutes has cognitive complexity 34 (threshold 15). Drivers by points: if/else 21 (22 pts), boolean chains 8, error handling 1 (2 pts), ternaries 2 (nesting depth added 2). None of this is in the body itself: all 34 points belong to 7 function literals inside it that branch (lines 147, 40, 64, \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/daemon/src/routes/slices.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"59aa1f1b2c9e8c0e858c4b299b6a67540a906dd928db74f49a8bd65215a86507"}},{"ruleId":"D2","level":"warning","message":{"text":"pairing.pairingLines (cognitive 34): pairing.pairingLines has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 7 (23 pts), if/else 6 (8 pts), boolean chains 2, loops 1 (nesting depth added 18). 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/tui/src/config/pairing.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"1500ff02be8296d584cf923f9706d9ddc13a9b7e1a28a5c96a930cc4b0320343"}},{"ruleId":"D2","level":"warning","message":{"text":"channel-map.validateChannelMap (cognitive 33): channel-map.validateChannelMap has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 6, ternaries 1 (3 pts), 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/daemon/src/domain/gateway/slack/channel-map.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"020138eee92fdaff20f4ee1e336f1c43fad7fefe94896ab11940c868aa140d94"}},{"ruleId":"D2","level":"warning","message":{"text":"judgments.recordJudgment (cognitive 33): judgments.recordJudgment has cognitive complexity 33 (threshold 15). Drivers by points: if/else 18 (23 pts), boolean chains 8, error handling 1, ternaries 1 (nesting depth added 5). Of this number, 32 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/daemon/src/domain/proof/judgments.ts"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3b9b3cf819e2bd2812e42e04e5b961d03dbd7847669acb1cdd5c954877c7bcb"}},{"ruleId":"D2","level":"warning","message":{"text":"QueueRepository.retryPromptWakesOnClear (cognitive 33): QueueRepository.retryPromptWakesOnClear has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (17 pts), loops 6 (9 pts), boolean chains 5, ternaries 1 (2 pts) (nesting depth added 9). Of this number, 29 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":2066}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c822bacbe768600de1c448c6ed24bf92c0dfe1f6ee2ede4049e44e86bb84d67"}},{"ruleId":"D2","level":"warning","message":{"text":"session-transport.hasExpectedStagedText (cognitive 33): session-transport.hasExpectedStagedText has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 2 (7 pts), boolean chains 4 (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":"packages/daemon/src/domain/session-transport.ts"},"region":{"startLine":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"95bb5971d894f47abc1eba83513ec6bd77750457d7ae236a87147ce587a20072"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeCompactionEnforcer.withDeliveryGuard (cognitive 33): ClaudeCompactionEnforcer.withDeliveryGuard has cognitive complexity 33 (threshold 15). Drivers by points: boolean chains 13, ternaries 6 (11 pts), if/else 5 (8 pts), error handling 1 (nesting depth added 8). Of this number, 22 points are the body\u0027s own statements and 11 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d3cd9d4db40021050ac2f6d9135b5289363a14f30744bfe91ba54c7134a8a6b"}},{"ruleId":"D2","level":"warning","message":{"text":"compact-plan.compactPlanCommand (cognitive 33): compact-plan.compactPlanCommand has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (18 pts), error handling 4 (6 pts), ternaries 3 (6 pts), boolean chains 2, loops 1 (nesting depth added 10). None of this is in the body itself: all 33 points belong to one function literal inside it that branches (line 452). 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/commands/compact-plan.ts"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c845ff6089f3ee869cd1ab5d063f0ad4d799c26d71daedbf18b42c0d93f9e27"}},{"ruleId":"D2","level":"warning","message":{"text":"fork.forkCommand.cmd (cognitive 33): fork.forkCommand.cmd has cognitive complexity 33 (threshold 15). Drivers by points: if/else 19 (22 pts), boolean chains 5, ternaries 4, 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, 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/commands/fork.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bbb9b8059b0dd5f0e247165ff5274bd25e3b7a8b63611514e8a1d66403507d6"}},{"ruleId":"D2","level":"warning","message":{"text":"pi-runner.parseRunnerArgs (cognitive 33): pi-runner.parseRunnerArgs has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (23 pts), boolean chains 7, match/switch 1 (2 pts), loops 1 (nesting depth added 9). Of this number, 31 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":"packages/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":1929}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be186c00c06596656d2014ac40a5b50a77eef1288988a7fcd9726e55e628b11"}},{"ruleId":"D2","level":"warning","message":{"text":"project-registration.registerBundleProject (cognitive 33): project-registration.registerBundleProject has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 6, ternaries 3 (4 pts), error handling 1 (3 pts) (nesting depth added 9). Of this number, 30 points are the body\u0027s own statements and 3 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/daemon/src/domain/workspace/project-registration.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f5b929d48a6fcd2e2075371630a17e3835f610c28296086e9e1bbac795190a"}},{"ruleId":"D2","level":"warning","message":{"text":"RestoreOrchestrator.reconcileNodeRuntimeTruth (cognitive 33): RestoreOrchestrator.reconcileNodeRuntimeTruth has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (17 pts), ternaries 6 (7 pts), boolean chains 6, error handling 2 (3 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":2979}}}],"partialFingerprints":{"codehealthFindingId/v1":"00084e8631f9e6f491c46a692a681f0a4c13dd6206283882086981019a5adfaf"}},{"ruleId":"D2","level":"warning","message":{"text":"default-workspace-scaffold.ensureDefaultWorkspace (cognitive 33): default-workspace-scaffold.ensureDefaultWorkspace has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 5 (7 pts), boolean chains 6, loops 4 (6 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":"packages/daemon/src/domain/workspace/default-workspace-scaffold.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"11129649a309d50c6cb3f3da055e6a8aeeab5d55080dccc2b6bcd3c171ad0a3f"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin-discovery-service.removeObsoleteLabRefocusCommands (cognitive 33): plugin-discovery-service.removeObsoleteLabRefocusCommands has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (26 pts), ternaries 1 (4 pts), loops 2 (3 pts) (nesting depth added 19). 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, split the body into named stages: move each independent step or branch into 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/daemon/src/domain/plugin-discovery-service.ts"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"2507029daeacf8a13f1e792edb111737d2a2f8b9226d9891f845edf77288869e"}},{"ruleId":"D2","level":"warning","message":{"text":"stream-dispositions.validateDisposition (cognitive 33): stream-dispositions.validateDisposition has cognitive complexity 33 (threshold 15). Drivers by points: boolean chains 14, if/else 13, ternaries 4 (6 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/stream-dispositions.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b410b8e84521372d083e472de78ddbd63dc8a5a2d4679179736c49e2bd6a6d0"}},{"ruleId":"D2","level":"warning","message":{"text":"CodexInPlaceRestart.restart (cognitive 33): CodexInPlaceRestart.restart has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (19 pts), ternaries 7 (13 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/daemon/src/domain/seat-restart-in-place.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d033076aeb5681486a3876adfa592bf090fe519864b715f56433fc0bb1b0c4b"}},{"ruleId":"D2","level":"warning","message":{"text":"SeatLifecycleService.readStartupContext (cognitive 33): SeatLifecycleService.readStartupContext has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 7 (14 pts), if/else 6 (10 pts), boolean chains 4, loops 3, error handling 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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":2187}}}],"partialFingerprints":{"codehealthFindingId/v1":"59394fb22d236cd37a1d2b74b3f26c382a9d2a3aa2095559f0bd1ed0a13b0716"}},{"ruleId":"D2","level":"warning","message":{"text":"usage-across-hosts.readHost (cognitive 33): usage-across-hosts.readHost has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 8, ternaries 4 (nesting depth added 7). Of this number, 32 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/daemon/src/domain/provider/usage-across-hosts.ts"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a12d0c06c036da15da5c1280b186f1e92611cee1768c0be526d6d2362a6df94"}},{"ruleId":"D2","level":"warning","message":{"text":"shared-history-selection.listSharedHistories (cognitive 33): shared-history-selection.listSharedHistories has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 10, ternaries 3 (4 pts), loops 2 (nesting depth added 6). Of this number, 32 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/daemon/src/domain/shared-history-selection.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"a36498e4f218c3700148c0c50e13388f2359216b55a855dbf9ab6a4a42082a67"}},{"ruleId":"D2","level":"warning","message":{"text":"herdr-adapter.exitedSeats (cognitive 33): herdr-adapter.exitedSeats has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 7, loops 6 (7 pts), error handling 1 (nesting depth added 6). Of this number, 28 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/daemon/src/domain/terminal/herdr-adapter.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"0172c6d61a5411472dda9c30da6c609757ac75a14ec789b28bb0424f56a2c272"}},{"ruleId":"D2","level":"warning","message":{"text":"settings-browser.safeValue (cognitive 33): settings-browser.safeValue has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (16 pts), boolean chains 11, ternaries 2 (4 pts), error handling 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/user-settings/settings-browser.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"3026bebb2f8334f5470df6637bfa9499429d34cdea073953d24d625a2da33a3d"}},{"ruleId":"D2","level":"warning","message":{"text":"plugins.pluginsRoutes (cognitive 33): plugins.pluginsRoutes has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (15 pts), ternaries 10 (14 pts), error handling 3, boolean chains 1 (nesting depth added 6). None of this is in the body itself: all 33 points belong to 7 function literals inside it that branch (lines 189, 147, 162, \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/daemon/src/routes/plugins.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df440255d0a5b648af8cff5cc9b74859ea682257983e124495b278965b0b716"}},{"ruleId":"D2","level":"warning","message":{"text":"terminal.terminalRoutes (cognitive 33): terminal.terminalRoutes has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15, ternaries 10 (12 pts), boolean chains 5, error handling 1 (nesting depth added 2). None of this is in the body itself: all 33 points belong to 7 function literals inside it that branch (lines 95, 139, 122, \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/daemon/src/routes/terminal.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9cc36fbf9a9366a4ab2f01d0cde3133587580cf72ea100d69b1b3df0f1ad76b"}},{"ruleId":"D2","level":"warning","message":{"text":"topology-activity.parseTopologyActivityEvent (cognitive 33): topology-activity.parseTopologyActivityEvent has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (15 pts), ternaries 6 (12 pts), boolean chains 6 (nesting depth added 8). Of this number, 32 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/ui/src/lib/topology-activity.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"25aac2a19edae9cfd43ac596e7cf8ebec6ae161b609d3de6e98c634955c6fc3c"}},{"ruleId":"D2","level":"warning","message":{"text":"EvidenceOpener.EvidenceOpener (cognitive 33): EvidenceOpener.EvidenceOpener has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 9 (19 pts), if/else 9 (11 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":"packages/ui/src/components/review/EvidenceOpener.tsx"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc7997526d7607d5e00ce055989d1e6d817c42a43ac218459efc2328df97e97"}},{"ruleId":"D2","level":"warning","message":{"text":"pi-readiness.piCredentialEvidence (cognitive 32): pi-readiness.piCredentialEvidence has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 4 (5 pts), error handling 3 (4 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/daemon/src/adapters/pi-readiness.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"c567a462eb6c83c2d056c9455b2c66ac16ff7a1b9131345c8840dd895740e477"}},{"ruleId":"D2","level":"warning","message":{"text":"rigspec-schema.validateServicesBlock (cognitive 32): rigspec-schema.validateServicesBlock has cognitive complexity 32 (threshold 15). Drivers by points: if/else 18 (24 pts), boolean chains 5, loops 1 (3 pts) (nesting depth added 8). Of this number, 28 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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5196664d79fb5e3e88e907b69135ccdfbe1c88b5ae7f56603b9d6c471732eca"}},{"ruleId":"D2","level":"warning","message":{"text":"queue-stuck-sweep.runStuckSweep::undeliveredCandidate (cognitive 32): queue-stuck-sweep.runStuckSweep::undeliveredCandidate has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 11 (16 pts), boolean chains 8, if/else 7 (8 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. This shape REPEATS in the file: 4 other methods here (queue-stuck-sweep.runStuckSweep, queue-stuck-sweep.runStuckSweep::unclaimedCandidate, queue-stuck-sweep.runStuckSweep::custodyCandidate, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 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/daemon/src/domain/queue-stuck-sweep.ts"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf51a11734c94fef473095285b6ed0e24008e5acce1f5d6caa60874d739ecd70"}},{"ruleId":"D2","level":"warning","message":{"text":"QueueRepository.recordDelegatedDecision (cognitive 32): QueueRepository.recordDelegatedDecision has cognitive complexity 32 (threshold 15). Drivers by points: if/else 18 (22 pts), boolean chains 5, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 6). Most of this is not in the body itself: 3 of the 32 points are its own statements and the rest belongs to one function literal inside it that branches (line 4919). 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":4904}}}],"partialFingerprints":{"codehealthFindingId/v1":"664ac510e26b295938c9fdd83af9fd136514fe4fa2ba20a2737c60bcf9dbc845"}},{"ruleId":"D2","level":"warning","message":{"text":"daemon-start-lock.archiveIfBeforeBoot (cognitive 32): daemon-start-lock.archiveIfBeforeBoot has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 5, error handling 4 (5 pts), loops 2 (3 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/daemon-start-lock.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"71075edfc660e8a6c8c41adb65e21debda52883a09f9a7ae44c1c8a117fd54e6"}},{"ruleId":"D2","level":"warning","message":{"text":"ps.runCrossHostPs (cognitive 32): ps.runCrossHostPs has cognitive complexity 32 (threshold 15). Drivers by points: if/else 24 (31 pts), boolean chains 1 (nesting depth added 7). 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/commands/ps.ts"},"region":{"startLine":1692}}}],"partialFingerprints":{"codehealthFindingId/v1":"145c118fbc83f4b4e6081e8c13ef64e7cba44cc8335e55aa5653bcc13ca544aa"}},{"ruleId":"D2","level":"warning","message":{"text":"ps.runHttpPs (cognitive 32): ps.runHttpPs has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (21 pts), ternaries 6 (7 pts), boolean chains 3, error handling 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/commands/ps.ts"},"region":{"startLine":1767}}}],"partialFingerprints":{"codehealthFindingId/v1":"f900f9a4495bf20f4fd051bb8fd56c5071c5340031f1791cca37de22ada0b998"}},{"ruleId":"D2","level":"warning","message":{"text":"bundle-configuration.stageConfiguration (cognitive 32): bundle-configuration.stageConfiguration has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 2 (5 pts), boolean chains 2, ternaries 1 (2 pts), error handling 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":"packages/cli/src/lib/bundle-configuration.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc71acf47fc94a7bfe1b75f6d1e19079b06e550088e8d06be0d92a64e4136a0"}},{"ruleId":"D2","level":"warning","message":{"text":"stream-consumer.toDisposition (cognitive 32): stream-consumer.toDisposition has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 8 (17 pts), if/else 8 (11 pts), boolean chains 4 (nesting depth added 12). Of this number, 31 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/decisions/stream-consumer.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"e880fad40a4cbe5c3ada972ba697142e47e4cdaa9ccd5ba0cafa9890da21906e"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeCodeAdapter.project (cognitive 32): ClaudeCodeAdapter.project has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (15 pts), ternaries 3 (7 pts), boolean chains 4, error handling 2 (3 pts), loops 2 (3 pts) (nesting depth added 14). Of this number, 31 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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb18f9112ec49142addc9a97648e426ea32b5419e089839b526346a6a3617ba"}},{"ruleId":"D2","level":"warning","message":{"text":"AskService.ask (cognitive 32): AskService.ask has cognitive complexity 32 (threshold 15). Drivers by points: if/else 21 (28 pts), boolean chains 3, ternaries 1 (nesting depth added 7). 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/daemon/src/domain/ask-service.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b440decb9196d69935b531da63295a1e3c3d3265fdd00ffb2699b11edc523a"}},{"ruleId":"D2","level":"warning","message":{"text":"classification-sources.classificationSources (cognitive 32): classification-sources.classificationSources has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (13 pts), ternaries 5 (7 pts), boolean chains 6, loops 3 (4 pts), error handling 2 (nesting depth added 6). Of this number, 19 points are the body\u0027s own statements and 13 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/daemon/src/domain/classification-sources.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac211aa49a6819ce22872fa98f788b7107d266a8911c1942c4fc067fcebed34"}},{"ruleId":"D2","level":"warning","message":{"text":"current-work.frontmatterIntent (cognitive 32): current-work.frontmatterIntent has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 6, error handling 1 (4 pts), loops 2 (4 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/current-work.ts"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"882d3914bdfbf1af15a36df93cd38d8fafd2553be8c4cb6d4f46687c59848b67"}},{"ruleId":"D2","level":"warning","message":{"text":"workflow-deadline.evaluateStepDeadline (cognitive 32): workflow-deadline.evaluateStepDeadline has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 4 (16 pts), if/else 7 (14 pts), boolean chains 1, 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":"packages/daemon/src/domain/workflow-deadline.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"b379537e92abf751c1fb59efddeb339849981aebc56109af7e615b78606a0106"}},{"ruleId":"D2","level":"warning","message":{"text":"CurrentModelReader.prepare (cognitive 32): CurrentModelReader.prepare has cognitive complexity 32 (threshold 15). Drivers by points: if/else 18 (23 pts), boolean chains 6, ternaries 2, error handling 1 (nesting depth added 5). Of this number, 16 points are the body\u0027s own statements and 16 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/model-divergence/current-model-reader.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4ef68654dc717f6a9138295b4a8b2aef37e4ffdb9f700ba1d52e2341119ded"}},{"ruleId":"D2","level":"warning","message":{"text":"SeatLifecycleService.effortReport (cognitive 32): SeatLifecycleService.effortReport has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 6 (17 pts), if/else 10 (13 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":"packages/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"32037c49c43c28ec527fffec30442a3bbe90f56a133ea63664e580a0705f01f8"}},{"ruleId":"D2","level":"warning","message":{"text":"TerminalService.resolveView (cognitive 32): TerminalService.resolveView has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (25 pts), ternaries 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":"packages/daemon/src/domain/terminal/terminal-service.ts"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c8b67d29c02dfccc109fb7b43ff3dc340175271f2b8fd556fcb59ac01e0d9c"}},{"ruleId":"D2","level":"warning","message":{"text":"rigs.rigsRoutes.post(\u0022/:id/attach-self\u0022) (cognitive 32): rigs.rigsRoutes.post(\u0022/:id/attach-self\u0022) has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 13, boolean chains 11, if/else 7, match/switch 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/daemon/src/routes/rigs.ts"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d703b99e35e7e44666309a1e9cd902b7f9cf7358c49a6bb3e4660da5827114"}},{"ruleId":"D2","level":"warning","message":{"text":"discovery.discoveryRoutes.post(\u0022/:id/adopt\u0022) (cognitive 32): discovery.discoveryRoutes.post(\u0022/:id/adopt\u0022) has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (16 pts), ternaries 7 (11 pts), match/switch 2 (4 pts), boolean chains 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/daemon/src/routes/discovery.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f655dad89f7c7f47b8cf656b7908c7ec2ee6e679c0c1fa0726397b5838f125"}},{"ruleId":"D2","level":"warning","message":{"text":"hosts.hostsRoutes::settlePairRequest (cognitive 32): hosts.hostsRoutes::settlePairRequest has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 8 (19 pts), if/else 5 (6 pts), error handling 3 (4 pts), boolean chains 3 (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/daemon/src/routes/hosts.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"3857093a079eff7c4679b5206bc461c5e9cf23e4eb5021af1b5c094b76df07d0"}},{"ruleId":"D2","level":"warning","message":{"text":"tool-brand.normalizeToolBrandId (cognitive 32): tool-brand.normalizeToolBrandId has cognitive complexity 32 (threshold 15). Drivers by points: boolean chains 16, if/else 16. 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/ui/src/lib/tool-brand.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b46b4d2de0e42de96a219577e25d4ade44be5e5cb2a0e4ca8f29a821bfb32d6"}},{"ruleId":"D2","level":"warning","message":{"text":"ImportFlow.ImportFlow (cognitive 32): ImportFlow.ImportFlow has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 12, ternaries 2 (4 pts), error handling 3 (nesting depth added 5). Most of this is not in the body itself: 11 of the 32 points are its own statements and the rest belongs to 4 function items inside it that branch (handleInstantiate, handlePreflight, handleValidate, \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/ui/src/components/ImportFlow.tsx"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c87a206f8a53ab1de1502c7dc52fd89450fab733f747663f98fc2a6a6321d8"}},{"ruleId":"D2","level":"warning","message":{"text":"composer-prompts.composerContainsOwnedText (cognitive 31): composer-prompts.composerContainsOwnedText has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 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/daemon/src/domain/composer-prompts.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d621e46cc2b4530695d562a2ae9fbf540e5495930f5497bbbcb92f0e0fda63"}},{"ruleId":"D2","level":"warning","message":{"text":"seat-skill-storage.seatSkillReplay (cognitive 31): seat-skill-storage.seatSkillReplay has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (19 pts), error handling 2 (6 pts), boolean chains 4, loops 2 (nesting depth added 14). 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":"packages/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"1946fb3dc882f3aae8c16bcfbb215e2330c32db26a2961bc74f1e80ed2c99c6f"}},{"ruleId":"D2","level":"warning","message":{"text":"delivery-rules-engine.decideDelivery (cognitive 31): delivery-rules-engine.decideDelivery has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (15 pts), ternaries 6 (9 pts), boolean chains 6, 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":"packages/daemon/src/domain/gateway/delivery-rules-engine.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5a162bb4b2999736b5040fe2658a6d8dc9603c3f6b90f12e5fca731ecb43d3"}},{"ruleId":"D2","level":"warning","message":{"text":"project-catalog.inferCatalogProject (cognitive 31): project-catalog.inferCatalogProject has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (nesting depth added 12). 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":"packages/daemon/src/domain/workspace/project-catalog.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d89d96dce9bdad815e9bdf1180ab428520fd1db6ffeadb802e19ac55b3e6ae"}},{"ruleId":"D2","level":"warning","message":{"text":"QueueRepository.create (cognitive 31): QueueRepository.create has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 4, ternaries 2 (4 pts), error handling 2 (3 pts) (nesting depth added 14). Of this number, 24 points are the body\u0027s own statements and 7 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":2417}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ceef1aea8691e1f5ffb4ecf87d4a12684c5e6ebfe8d0882b87734ca64a1542"}},{"ruleId":"D2","level":"warning","message":{"text":"EnvironmentLifecycle.checkpoint (cognitive 31): EnvironmentLifecycle.checkpoint has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 5, loops 2 (3 pts), error handling 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":"packages/daemon/src/domain/environment-lifecycle.ts"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5b52708a17eaaf708d51e98064e547c5f7039adaf38469ae5a6b84df4bf768"}},{"ruleId":"D2","level":"warning","message":{"text":"PiRuntimeAdapter.deliverStartup (cognitive 31): PiRuntimeAdapter.deliverStartup has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (23 pts), ternaries 2 (3 pts), error handling 1 (2 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/adapters/pi-runtime-adapter.ts"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"24cb1a603ecf68731dea9ba79604c871b47fc1728309e2321123453d5d2056a5"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeCompactionEnforcer.reconcilePreparations (cognitive 31): ClaudeCompactionEnforcer.reconcilePreparations has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 2 (9 pts), boolean chains 7, loops 1 (nesting depth added 12). 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":2016}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03a70ee4ecc949ed07b91d2e81813ba512c0f9555b41a2c75030b24ee119031"}},{"ruleId":"D2","level":"warning","message":{"text":"work-install.resolveWorkContextHome (cognitive 31): work-install.resolveWorkContextHome has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (22 pts), error handling 1 (5 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/lib/work-install.ts"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dabe9ad84ad27328ce5cbe6371ef7fd501565bdf907a0ec9d46fd729311abfe"}},{"ruleId":"D2","level":"warning","message":{"text":"provider.providerCommand::statusAcrossHosts (cognitive 31): provider.providerCommand::statusAcrossHosts has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (21 pts), ternaries 3 (6 pts), boolean chains 2, loops 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. This shape REPEATS in the file: 5 other methods here (provider.providerCommand::renderStatusHuman, provider.providerCommand::renderSeatAccounts, provider.providerCommand::identityLabel, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 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/commands/provider.ts"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"20bf1a68e67fa2f57bfeba1b791b03639a03bcb1c16005a891c2fc6410172d7c"}},{"ruleId":"D2","level":"warning","message":{"text":"shrink.shrinkCommand (cognitive 31): shrink.shrinkCommand has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (14 pts), ternaries 5 (11 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 10). None of this is in the body itself: all 31 points belong to 2 function items inside it that branch (a function literal at line 44, getClient). 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/commands/shrink.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"84fef5ba9534395780ad77cf1c4db50ef26c6f19d92f959ce2c46c6cb3d6cfa8"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-network-default.decideCodexNetworkDefault (cognitive 31): codex-network-default.decideCodexNetworkDefault has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 7, loops 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/daemon/src/domain/codex-network-default.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec43ae8ae6dd2af4133bca047d1c83de0c70aa197acac61c7bafcc180ba932ed"}},{"ruleId":"D2","level":"warning","message":{"text":"cmux-transport.buildCommand (cognitive 31): cmux-transport.buildCommand has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (17 pts), ternaries 5 (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":"packages/daemon/src/adapters/cmux-transport.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"4342031e84102b819afcb15667abe39d6582950afc6d6834f074466bbee4818f"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-filesystem-preflight.compareFilesystem::at (cognitive 31): codex-filesystem-preflight.compareFilesystem::at has cognitive complexity 31 (threshold 15). Drivers by points: boolean chains 13, if/else 10, ternaries 5 (8 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. This shape REPEATS in the file: one other method here (codex-filesystem-preflight.compareFilesystem) 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/daemon/src/domain/codex-filesystem-preflight.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"438b342462c1651b294f3ef432e75588feda7cf1567e02f33809cbc5425bd7b0"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-filesystem-preflight.compareRequirements (cognitive 31): codex-filesystem-preflight.compareRequirements has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 5, 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/daemon/src/domain/codex-filesystem-preflight.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f793cf6546303d9d20f25ad9af1db02081b46deddbc278439777dfff45232c"}},{"ruleId":"D2","level":"warning","message":{"text":"current-work.evaluateCreateScope (cognitive 31): current-work.evaluateCreateScope has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (26 pts), boolean chains 2, error handling 2, ternaries 1 (nesting depth added 10). Of this number, 30 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/daemon/src/domain/current-work.ts"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"3170a88fffc5210668e7b6d0ca70b4db4c541a265aba8d1da66a3f53163f0ff9"}},{"ruleId":"D2","level":"warning","message":{"text":"socket-inbound.startSocketInbound (cognitive 31): socket-inbound.startSocketInbound has cognitive complexity 31 (threshold 15). Drivers by points: boolean chains 20, if/else 9 (11 pts) (nesting depth added 2). None of this is in the body itself: all 31 points belong to 8 function literals inside it that branch (lines 283, 313, 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/daemon/src/domain/gateway/slack/socket-inbound.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"394d7bb833fee68d7bca6f3ebe869ecf3fc0b91e2bb37928208597850facfac4"}},{"ruleId":"D2","level":"warning","message":{"text":"slack-subsystem.buildSlackGatewayWire.deliverDigestPost (cognitive 31): slack-subsystem.buildSlackGatewayWire.deliverDigestPost has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (15 pts), ternaries 4 (7 pts), boolean chains 5, loops 1 (3 pts), error handling 1 (nesting depth added 10). Of this number, 25 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/daemon/src/domain/gateway/slack/slack-subsystem.ts"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b41945aad6858d186962929d47ec785644f684c1d6a9e2baf3ac9c69ef49b7f"}},{"ruleId":"D2","level":"warning","message":{"text":"usage-series.computeTopBurn (cognitive 31): usage-series.computeTopBurn has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (17 pts), ternaries 3 (6 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 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, split the body into named stages: move each independent step or branch into 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/daemon/src/domain/usage-series.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"905172580e0102aa128149b1a2a013e2c167f9a34444d11c86e77f96d6f60c4e"}},{"ruleId":"D2","level":"warning","message":{"text":"NetworkInstallationStore.replace (cognitive 31): NetworkInstallationStore.replace has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 5 (12 pts), if/else 5 (10 pts), error handling 5 (8 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":"packages/daemon/src/domain/network/network-installations.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c31212fca6f59dcdb9236bcc555ab29b3b9134b23ef775ef7613c370df8fe94"}},{"ruleId":"D2","level":"warning","message":{"text":"parked-query.diagnoseSeatParked (cognitive 31): parked-query.diagnoseSeatParked has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 11 (22 pts), boolean chains 8, if/else 1 (nesting depth added 11). Of this number, 26 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/daemon/src/domain/parked-query.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"95208bf9646423f5b3f2b716c3edcca55199a1e3b6f844be4a2eca8e9c8d82f9"}},{"ruleId":"D2","level":"warning","message":{"text":"config-model.configValue (cognitive 31): config-model.configValue has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (16 pts), ternaries 4 (8 pts), boolean chains 7 (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/tui/src/config/config-model.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"9119b1df370c445a27d87ea13aaba5f91422fe81f82b46e9e433166cb3197111"}},{"ruleId":"D2","level":"warning","message":{"text":"TerminalPreviewPopover.TerminalPreviewPopover (cognitive 31): TerminalPreviewPopover.TerminalPreviewPopover has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (17 pts), ternaries 6 (9 pts), boolean chains 5 (nesting depth added 5). Most of this is not in the body itself: 8 of the 31 points are its own statements and the rest belongs to 8 function items inside it that branch (a function literal at line 180, a function literal at line 162, a function literal at line 126, \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/ui/src/components/topology/TerminalPreviewPopover.tsx"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f0d7e8aa3d44fb4ad056c934705a57de08f5465e3d8217e9ac8d3c2d59da5c"}},{"ruleId":"D2","level":"warning","message":{"text":"useMissionControlAction.postAction (cognitive 31): useMissionControlAction.postAction has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 5, error handling 1 (2 pts), ternaries 1 (2 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":"packages/ui/src/components/mission-control/hooks/useMissionControlAction.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d0a3067723ba6478e6a0c66596c5a1941aca6fc500a7d06c0e85d3e1ab1516"}},{"ruleId":"D2","level":"warning","message":{"text":"VerbActions.VerbActions (cognitive 31): VerbActions.VerbActions has cognitive complexity 31 (threshold 15). Drivers by points: boolean chains 18, ternaries 10 (11 pts), if/else 2 (nesting depth added 1). 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, 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/ui/src/components/mission-control/components/VerbActions.tsx"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d68b89f04b3b1c93d3c3f212405d61722a230e39ed7d20e057f506b96e14ff4"}},{"ruleId":"D2","level":"warning","message":{"text":"SliceReviewTab.DeliveredSection (cognitive 31): SliceReviewTab.DeliveredSection has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 13 (31 pts) (nesting depth added 18). Most of this is not in the body itself: 3 of the 31 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 152, 140, 160). 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/ui/src/components/review/SliceReviewTab.tsx"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"245451041e987d48b51aa3eec3998d8a9a8f6618e168ef15046f1af2290fa59c"}},{"ruleId":"D2","level":"warning","message":{"text":"waiter (cognitive 31): waiter has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (20 pts), boolean chains 4, loops 2 (4 pts), other 3 (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/daemon/assets/claude-hook-bridge.cjs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"dadd7063903e0c2948a68b2a8823565632bdd59f0b8a6e9922dd3232ae3448bc"}},{"ruleId":"D2","level":"warning","message":{"text":"pi-readiness.piCredentialSource (cognitive 30): pi-readiness.piCredentialSource has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 8, ternaries 3, error handling 2 (nesting depth added 5). Of this number, 23 points are the body\u0027s own statements and 7 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/daemon/src/adapters/pi-readiness.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d60408171065c2f336b61cc7c20d33415ff470f31b69074cb7e8a07ab04a31"}},{"ruleId":"D2","level":"warning","message":{"text":"skill-catalog.resolveSkillLoadout (cognitive 30): skill-catalog.resolveSkillLoadout has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 6, loops 4 (5 pts), ternaries 2 (3 pts), error handling 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/daemon/src/domain/skill-catalog.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab783690b2a0e02f23059757c290d90b2205801fc0b06ed53d0da0947b383f6e"}},{"ruleId":"D2","level":"warning","message":{"text":"slack-api.callWebApi (cognitive 30): slack-api.callWebApi has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 5 (9 pts), boolean chains 4, loops 2 (4 pts), error handling 2 (nesting depth added 11). Most of this is not in the body itself: 1 of the 30 points is its own statement and the rest belongs to one function literal inside it that branches (line 102). 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/daemon/src/domain/gateway/slack/slack-api.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"139a3216cef3e0d027ceac682f28813d2a2a59446133c0d91c3e012deefa1cb6"}},{"ruleId":"D2","level":"warning","message":{"text":"EnvironmentLifecycle.verifyCheckpoint (cognitive 30): EnvironmentLifecycle.verifyCheckpoint has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 8, loops 3 (4 pts), error handling 1 (3 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/daemon/src/domain/environment-lifecycle.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad6466717519a1b488c2ed4e3961bd98f2492e60ed8d43aa4167c36ae1671ba3"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionTransport.readAtReadableSize (cognitive 30): SessionTransport.readAtReadableSize has cognitive complexity 30 (threshold 15). Drivers by points: if/else 17 (18 pts), boolean chains 8, ternaries 3 (4 pts) (nesting depth added 2). Most of this is not in the body itself: 14 of the 30 points are its own statements and the rest belongs to one function literal inside it that branches (line 4925). 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":4913}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdfbbd83e09026755d0e5935684821d27e471a83849158968a90f777dd513cde"}},{"ruleId":"D2","level":"warning","message":{"text":"session-transport.findClaudeComposer (cognitive 30): session-transport.findClaudeComposer has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 5, loops 3 (4 pts), ternaries 3 (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":"packages/daemon/src/domain/session-transport.ts"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"3801327bcfd64359ce3073ba256c83d0508639ab01f373ea12d62e7bb80d19a9"}},{"ruleId":"D2","level":"warning","message":{"text":"daemon-lifecycle.stopDaemon (cognitive 30): daemon-lifecycle.stopDaemon has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (16 pts), ternaries 5 (7 pts), boolean chains 4, loops 1 (2 pts), error handling 1 (nesting depth added 6). Of this number, 27 points are the body\u0027s own statements and 3 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/daemon-lifecycle.ts"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc79fcfdb9f67a3452fcefbf59a1945f11600201f8b6b2936a62352e7e0a179"}},{"ruleId":"D2","level":"warning","message":{"text":"queue-receipt.buildWriteReceipt (cognitive 30): queue-receipt.buildWriteReceipt has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 11 (21 pts), if/else 4 (5 pts), boolean chains 4 (nesting depth added 11). Of this number, 25 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/queue-receipt.ts"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a9f3cedae978a8722596f94b1303286a03be9dbb9a7062de0ca3de91942354"}},{"ruleId":"D2","level":"warning","message":{"text":"scope.buildMissionCreateCommand (cognitive 30): scope.buildMissionCreateCommand has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (18 pts), ternaries 5, boolean chains 4, loops 2, error handling 1 (nesting depth added 3). None of this is in the body itself: all 30 points belong to one function literal inside it that branches (line 1044). 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/commands/scope.ts"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b3945dbad6e7541c6b8fa10a2e3825d97fd84aa3c1c8d2155239616075bfc9"}},{"ruleId":"D2","level":"warning","message":{"text":"permission-stop-descriptor.buildPermissionRuleSuggestions (cognitive 30): permission-stop-descriptor.buildPermissionRuleSuggestions has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 5, loops 2 (3 pts), ternaries 1 (3 pts), error handling 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/daemon/assets/plugins/openrig-core/hooks/scripts/permission-stop-descriptor.cjs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d9a74f30ff87bb707ae6fa3578a93444f88affd31c51c8cbfaffcdeb633972a"}},{"ruleId":"D2","level":"warning","message":{"text":"claude-activity-hooks.deriveRelayEvents (cognitive 30): claude-activity-hooks.deriveRelayEvents has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 4 (12 pts), if/else 4 (9 pts), boolean chains 5, loops 2 (3 pts), error handling 1 (nesting depth added 14). Of this number, 26 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/daemon/src/domain/claude-activity-hooks.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dfa1765cfa3033c9894f9650963f82a5d351f1c15a71299569e2eb6ef4c8b08"}},{"ruleId":"D2","level":"warning","message":{"text":"ContextMonitor.normalizeStartupStatus (cognitive 30): ContextMonitor.normalizeStartupStatus has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 8 (10 pts), boolean chains 5, error handling 1 (nesting depth added 6). Of this number, 18 points are the body\u0027s own statements and 12 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/daemon/src/domain/context-monitor.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"939dc21d19a0f6cb1a007350bd0833134c1f23f085b9f01baec1f9e0403ce164"}},{"ruleId":"D2","level":"warning","message":{"text":"crash-cart-conductor.adoptLivePanesRig (cognitive 30): crash-cart-conductor.adoptLivePanesRig has cognitive complexity 30 (threshold 15). Drivers by points: loops 6 (16 pts), if/else 7 (12 pts), boolean chains 1, ternaries 1 (nesting depth added 15). Of this number, 29 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"packages/daemon/src/domain/crash-cart-conductor.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"f558906277274bcc350d2bf37577340de18f007f946bb520080bb0e7ce70af54"}},{"ruleId":"D2","level":"warning","message":{"text":"current-work.resolveWorkNodeDirs (cognitive 30): current-work.resolveWorkNodeDirs has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (18 pts), error handling 4 (10 pts), boolean chains 1, 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/daemon/src/domain/current-work.ts"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"e292ce768d5cea0b6ef407f852a4380ccd209d322d42742b4e7511e9c200436d"}},{"ruleId":"D2","level":"warning","message":{"text":"desired-claude-activity-hooks.agentResolvedAgainstRecordedRoots (cognitive 30): desired-claude-activity-hooks.agentResolvedAgainstRecordedRoots has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 6 (10 pts), boolean chains 7, loops 1 (nesting depth added 8). Of this number, 25 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/daemon/src/domain/desired-claude-activity-hooks.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc9033d2022047a64c2c03da424d751c31452c8006048f53272367c8838489c4"}},{"ruleId":"D2","level":"warning","message":{"text":"SeatLifecycleService.stopManagedTmuxSeat (cognitive 30): SeatLifecycleService.stopManagedTmuxSeat has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 7, error handling 2, ternaries 2 (nesting depth added 6). Of this number, 24 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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":2099}}}],"partialFingerprints":{"codehealthFindingId/v1":"e494e9ed72e5bba67eceb53649d104cb684bdd97f60b5256ad781facd3b89355"}},{"ruleId":"D2","level":"warning","message":{"text":"seat-lifecycle-service.effortSummary (cognitive 30): seat-lifecycle-service.effortSummary has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 12 (26 pts), boolean chains 2, if/else 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":"packages/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":2583}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5bdfaf781a1e9892e9def13f88d2c0ee710e95f783f2ae1f93f47c1cc9f667a"}},{"ruleId":"D2","level":"warning","message":{"text":"rigs.rigsRoutes.delete(\u0022/:rigId/pods/:podRef\u0022) (cognitive 30): rigs.rigsRoutes.delete(\u0022/:rigId/pods/:podRef\u0022) has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 7 (28 pts), if/else 2 (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/routes/rigs.ts"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eca84b6c658f2cb668f74cdb7e437e8bd83b5ffd2821718733fec4d7b3b8635"}},{"ruleId":"D2","level":"warning","message":{"text":"startup.reviewSelectedHistory (cognitive 30): startup.reviewSelectedHistory has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 9 (11 pts), if/else 9, boolean chains 7, 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/daemon/src/routes/startup.ts"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a67b1b3997e0fdf98e8cc7d9362fd1a4b371dd89935eff1fdf252d834865cb6"}},{"ruleId":"D2","level":"warning","message":{"text":"slices.resolveSliceProjectLookup.resolveProjectId (cognitive 30): slices.resolveSliceProjectLookup.resolveProjectId has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (16 pts), ternaries 3 (6 pts), boolean chains 5, error handling 1 (3 pts) (nesting depth added 11). Of this number, 23 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":"packages/daemon/src/routes/slices.ts"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61ad28ef1ccae4a85c66b40ed7c1e58550581adcf23262e936b2eceeb180cac"}},{"ruleId":"D2","level":"warning","message":{"text":"terminal-ws.registerTerminalWs (cognitive 30): terminal-ws.registerTerminalWs has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (15 pts), error handling 5 (7 pts), boolean chains 6, loops 1, ternaries 1 (nesting depth added 4). None of this is in the body itself: all 30 points belong to 5 function items inside it that branch (a function literal at line 66, a function literal at line 83, getRegistry, \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/daemon/src/routes/terminal-ws.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43e76890819b7d03f69e10deb739124d72bb57686a4f55586ffbad70adc8009"}},{"ruleId":"D2","level":"warning","message":{"text":"reading.fileLines (cognitive 30): reading.fileLines has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 5, ternaries 3 (5 pts), loops 1 (nesting depth added 10). Of this number, 15 points are the body\u0027s own statements and 15 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/tui/src/reading.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3624aa5f08d13e787a9a34fbf6786e831d107fc80e8e54fa878a1559038e6f6"}},{"ruleId":"D2","level":"warning","message":{"text":"trace-to-root.intent (cognitive 30): trace-to-root.intent has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 4, error handling 1 (4 pts), loops 2 (4 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/daemon/assets/plugins/openrig-core/skills/refocusing/scripts/trace-to-root.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f0ff82f81b5ad72461358d422aa6eacccc206a5131bcfb704863f7a1822d8a"}},{"ruleId":"D2","level":"warning","message":{"text":"PermissionStopObservations.observe (cognitive 29): PermissionStopObservations.observe has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 7, loops 2 (3 pts), 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/daemon/src/domain/permission-stop-observation.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e102c34d51b176cfce5cda657d86404d70eec4ec5ee592531a8e73201c65d4e"}},{"ruleId":"D2","level":"warning","message":{"text":"skill-discovery.scanSkillRoots (cognitive 29): skill-discovery.scanSkillRoots has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (14 pts), error handling 3 (8 pts), ternaries 1 (4 pts), loops 2 (3 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/daemon/src/domain/skill-discovery.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6e6eeb891ecc4efed9acdecc9be2aa4da926425779651df212d5d13022b8a8"}},{"ruleId":"D2","level":"warning","message":{"text":"EnvironmentPlatform.project (cognitive 29): EnvironmentPlatform.project has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 6, ternaries 3 (6 pts), error handling 1 (2 pts), loops 1 (nesting depth added 9). Of this number, 27 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/daemon/src/domain/environment-platform.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"2710000f3a9395eb125c5e5a95b59b72e0ec18da515406c3ad2c49baad6d2ee1"}},{"ruleId":"D2","level":"warning","message":{"text":"compose.deriveWorkflowExceptions (cognitive 29): compose.deriveWorkflowExceptions has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 7 (17 pts), if/else 4 (8 pts), boolean chains 3, 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/daemon/src/domain/review/compose.ts"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c4e29ec195b9ee8c861e1c3bd96b53eaa3f217c25e124d2ad89110b22735437"}},{"ruleId":"D2","level":"warning","message":{"text":"judgments.policyOf (cognitive 29): judgments.policyOf has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (17 pts), boolean chains 5, ternaries 1 (4 pts), 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":"packages/daemon/src/domain/proof/judgments.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f168da399247ea45f65a52e9fac9ea72cb1d98f1aecc08bd8db372b3336885a"}},{"ruleId":"D2","level":"warning","message":{"text":"SeatActivityService.reportEvidence (cognitive 29): SeatActivityService.reportEvidence has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 15, if/else 10 (13 pts), ternaries 1 (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/daemon/src/domain/seat-activity-service.ts"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f3e417c4f6d9550cd244eeb4910b7193d94b93dc6afb9acd61d302ecc4660b"}},{"ruleId":"D2","level":"warning","message":{"text":"node-inventory.buildInventoryItem (cognitive 29): node-inventory.buildInventoryItem has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 14 (16 pts), boolean chains 12, if/else 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/daemon/src/domain/node-inventory.ts"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a159bac14f6a76b5e097e04dbf059d276d672bf00820b8d3a44757176c1b32"}},{"ruleId":"D2","level":"warning","message":{"text":"queue-stuck-sweep.runStuckSweep::foldInto (cognitive 29): queue-stuck-sweep.runStuckSweep::foldInto has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 5, ternaries 1 (3 pts), error handling 1 (2 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. This shape REPEATS in the file: 4 other methods here (queue-stuck-sweep.runStuckSweep, queue-stuck-sweep.runStuckSweep::undeliveredCandidate, queue-stuck-sweep.runStuckSweep::unclaimedCandidate, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 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/daemon/src/domain/queue-stuck-sweep.ts"},"region":{"startLine":1697}}}],"partialFingerprints":{"codehealthFindingId/v1":"a210eb36f3ca82722c0b8ce2e6097cfc7225dc363102f74ed551cc848df546bd"}},{"ruleId":"D2","level":"warning","message":{"text":"hosted-wake.ringHostedWake (cognitive 29): hosted-wake.ringHostedWake has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 9, ternaries 7 (8 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/daemon/src/domain/hosted-wake.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e237d60c7fad95c834651630d278858bcee2557f38f58508989c8ba0631a85"}},{"ruleId":"D2","level":"warning","message":{"text":"bundle-source.checkGitHubBundleRefs (cognitive 29): bundle-source.checkGitHubBundleRefs has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 4 (8 pts), ternaries 4 (7 pts), boolean chains 3, error handling 1 (nesting depth added 9). Of this number, 17 points are the body\u0027s own statements and 12 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/lib/bundle-source.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6c927121290e957aeb66747001d5413761db24e82d63395e6edf3b8467378e"}},{"ruleId":"D2","level":"warning","message":{"text":"context-git.addGitContext (cognitive 29): context-git.addGitContext has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (20 pts), ternaries 3 (5 pts), error handling 2 (3 pts), boolean chains 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/lib/context-git.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7afffc6c38eeccf9b49743c5c4aa98d26220afff9657d15aa3520897ed1fe78"}},{"ruleId":"D2","level":"warning","message":{"text":"tmux-attachment.readRecordedTmuxServerArgs (cognitive 29): tmux-attachment.readRecordedTmuxServerArgs has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 3 (8 pts), boolean chains 7, error handling 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":"packages/cli/src/tmux-attachment.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"261e983356aaabeb6d8aa521a2d550b7402a76065f83c9448ccd7409b2df8c7c"}},{"ruleId":"D2","level":"warning","message":{"text":"file.fileCommand (cognitive 29): file.fileCommand has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (15 pts), ternaries 3 (9 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 13). None of this is in the body itself: all 29 points belong to one function literal inside it that branches (line 38). 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/commands/file.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f36c9af8c77adbc26659945a65634ef421bd1b26b4043f897860dd27fc4c6e5"}},{"ruleId":"D2","level":"warning","message":{"text":"slack.socketDeliveryLines (cognitive 29): slack.socketDeliveryLines has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 7 (24 pts), if/else 5 (nesting depth added 17). 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/commands/slack.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d6625f448f8616b927e4353c1c7184efa910d69adc4d4948b6a6bf4c20357e8"}},{"ruleId":"D2","level":"warning","message":{"text":"stream-outcome.work (cognitive 29): stream-outcome.work has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 5 (13 pts), if/else 5 (10 pts), boolean chains 5, loops 1 (nesting depth added 13). 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, split the body into named stages: move each independent step or branch into 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/commands/stream-outcome.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"94db98489d51ccc2c2c203dab8a476cf9cfbc308dc489dce44c56aac2bf9ed9c"}},{"ruleId":"D2","level":"warning","message":{"text":"refocus-state.acquire (cognitive 29): refocus-state.acquire has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (19 pts), error handling 4 (9 pts), loops 1 (nesting depth added 17). 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":"packages/daemon/assets/plugins/openrig-core/hooks/scripts/refocus-state.cjs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"9876ac0b9c9172a8549052ed62c6508c5b2b3a1cda7a4de89a8443e55c1b177b"}},{"ruleId":"D2","level":"warning","message":{"text":"gen-control-plane-json.extractSkillEdgeLayout (cognitive 29): gen-control-plane-json.extractSkillEdgeLayout has cognitive complexity 29 (threshold 15). Drivers by points: if/else 4 (11 pts), ternaries 3 (10 pts), loops 4 (7 pts), boolean chains 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/daemon/scripts/gen-control-plane-json.mjs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1dab2878629b85a82c0b60d95e44644a0d53ceb21dbb2b6c6bbad06dd1ea8f4"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeCodeAdapter.reconcileClaudeActivityHooks (cognitive 29): ClaudeCodeAdapter.reconcileClaudeActivityHooks has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 6, error handling 2 (4 pts), ternaries 1 (3 pts), loops 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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":1331}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeed04cbbbdbfb0143a86d0042da92aa256548c89015a99667b02dba8e99a334"}},{"ruleId":"D2","level":"warning","message":{"text":"bundle-types.validatePodBundleManifest (cognitive 29): bundle-types.validatePodBundleManifest has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 8, 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/daemon/src/domain/bundle-types.ts"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ef0fb0e3ffb0904cbd14647f9a3c9b2f39a5dd8de81bf193932f7f733857b6"}},{"ruleId":"D2","level":"warning","message":{"text":"RigInstantiator.computeLaunchOrder (cognitive 29): RigInstantiator.computeLaunchOrder has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 5 (9 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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f378eb5d284292ed37c3ea91efe6c90385a18b461662e558b6881c9c60c250"}},{"ruleId":"D2","level":"warning","message":{"text":"services-readiness.evaluateWaitTargets (cognitive 29): services-readiness.evaluateWaitTargets has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 5 (16 pts), if/else 7 (10 pts), boolean chains 2, 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/daemon/src/domain/services-readiness.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5cd128fe722422eced98e046db5b141c57ac5060b0b17519b0679e2483c13b"}},{"ruleId":"D2","level":"warning","message":{"text":"rehydrate-eligibility.assessSnapshotCurrentOccupants (cognitive 29): rehydrate-eligibility.assessSnapshotCurrentOccupants has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 9, ternaries 2 (5 pts), loops 1 (nesting depth added 10). Of this number, 25 points are the body\u0027s own statements and 4 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/daemon/src/domain/rehydrate-eligibility.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d273e9fc1c27813519dd9d32e96d50b1cb7ea44469b34beb8cfb8e217624a5"}},{"ruleId":"D2","level":"warning","message":{"text":"current-work.deriveCurrentWork (cognitive 29): current-work.deriveCurrentWork has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (26 pts), loops 2, 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/daemon/src/domain/current-work.ts"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa9d14279baca97e76b54c447877fef87b5f8978e83c4c884d29908a9454d05c"}},{"ruleId":"D2","level":"warning","message":{"text":"RestoreOrchestrator.computeRestorePlan (cognitive 29): RestoreOrchestrator.computeRestorePlan has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 5 (9 pts), boolean chains 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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9c80f736b7f45813706ac8fa7a1df3ab9097c4aae2f40a4649dfa129b4858d"}},{"ruleId":"D2","level":"warning","message":{"text":"PiCompactionService.request (cognitive 29): PiCompactionService.request has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 8, ternaries 4 (7 pts), error handling 1 (nesting depth added 5). 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":"packages/daemon/src/domain/pi-compaction-service.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d2be1e2a3f35d37bcba02dc64ee4b227049b9ee19015092568593002681582"}},{"ruleId":"D2","level":"warning","message":{"text":"project-classifier.validateClassifyInput (cognitive 29): project-classifier.validateClassifyInput has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 11, ternaries 1 (3 pts), loops 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/daemon/src/domain/project-classifier.ts"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"19aaf572732f25bec6282ce64d8d97d72ada41f9e3eabf5412d3543c3e1dd968"}},{"ruleId":"D2","level":"warning","message":{"text":"source-watch.shallowWatches (cognitive 29): source-watch.shallowWatches has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 5 (8 pts), boolean chains 7, ternaries 2 (3 pts) (nesting depth added 10). Of this number, 25 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/daemon/src/domain/proof/source-watch.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"f566b2ed38052dc448aa9539147a73ae9694df20f971b66d4e249f064e53fb9f"}},{"ruleId":"D2","level":"warning","message":{"text":"usage-across-hosts.groupUsageAcrossHosts (cognitive 29): usage-across-hosts.groupUsageAcrossHosts has cognitive complexity 29 (threshold 15). Drivers by points: if/else 4 (12 pts), ternaries 3 (12 pts), loops 4 (5 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/daemon/src/domain/provider/usage-across-hosts.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc1f1afb3b027839e997813782970178a2597a6c2ad0cb0a799ecd096e2d0648"}},{"ruleId":"D2","level":"warning","message":{"text":"usage-across-hosts.remoteRefreshLeg (cognitive 29): usage-across-hosts.remoteRefreshLeg has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (15 pts), ternaries 4 (8 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":"packages/daemon/src/domain/provider/usage-across-hosts.ts"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"0707e4f380466e328a7b6cbd832d186fee7c49c7dda4d3015509c0773ce91644"}},{"ruleId":"D2","level":"warning","message":{"text":"RestoreCheckService.checkStartupContext (cognitive 29): RestoreCheckService.checkStartupContext has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 7, ternaries 4 (6 pts), match/switch 1 (nesting depth added 7). Of this number, 24 points are the body\u0027s own statements and 5 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/daemon/src/domain/restore-check-service.ts"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7278322140f9ee8084eb2fa309b193c111b323ca71950940ceea33ef397d82c"}},{"ruleId":"D2","level":"warning","message":{"text":"RestoreCheckService.checkSharedConversations (cognitive 29): RestoreCheckService.checkSharedConversations has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 7 (10 pts), ternaries 1 (3 pts), error handling 1 (2 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":"packages/daemon/src/domain/restore-check-service.ts"},"region":{"startLine":1752}}}],"partialFingerprints":{"codehealthFindingId/v1":"03aca5f3b1bf5be28338850808cc89ce3dcfc179014bce6587623afc4de23508"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkflowRuntime.reconcileStuckExceptions (cognitive 29): WorkflowRuntime.reconcileStuckExceptions has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (16 pts), ternaries 3 (7 pts), boolean chains 5, loops 1 (nesting depth added 13). None of this is in the body itself: all 29 points belong to 3 function literals inside it that branch (lines 937, 948, 947). 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/daemon/src/domain/workflow-runtime.ts"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b2dc1660aedcf68ef673db94266f2c7c97cbc16e91de1e7f71f11ccd8de08d"}},{"ruleId":"D2","level":"warning","message":{"text":"restore-check.getStartupContext (cognitive 29): restore-check.getStartupContext has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12, ternaries 9 (10 pts), boolean chains 6, error handling 1 (nesting depth added 1). Most of this is not in the body itself: 13 of the 29 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 127, 115, 93). 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/daemon/src/routes/restore-check.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e2c46f2d543245836c3557799134bba430ff3dfd34dbf99c861b623a8da71d1"}},{"ruleId":"D2","level":"warning","message":{"text":"rigs.rigsRoutes.post(\u0022/:rigId/pods/:podNamespace/members\u0022) (cognitive 29): rigs.rigsRoutes.post(\u0022/:rigId/pods/:podNamespace/members\u0022) has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 8 (16 pts), if/else 8, boolean chains 3, match/switch 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/daemon/src/routes/rigs.ts"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b57205da8036f497b3962cbbb60a6d760a2df9698a683f9dcc07a47c47204a"}},{"ruleId":"D2","level":"warning","message":{"text":"sessions.nodesRoutes.delete(\u0022/:logicalId\u0022) (cognitive 29): sessions.nodesRoutes.delete(\u0022/:logicalId\u0022) has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 6 (27 pts), if/else 2 (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/routes/sessions.ts"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a6c8208418f803f3fbc321a7b83e92a409853358cec1ee4385b9ff2a9072c41"}},{"ruleId":"D2","level":"warning","message":{"text":"config.configRoutes (cognitive 29): config.configRoutes has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (17 pts), error handling 6 (8 pts), boolean chains 2, ternaries 2 (nesting depth added 3). None of this is in the body itself: all 29 points belong to 5 function literals inside it that branch (lines 40, 94, 116, \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/daemon/src/routes/config.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"20034bb060a5839c6986423627389c103075ce4205ae924da9b34c7ac5fb26be"}},{"ruleId":"D2","level":"warning","message":{"text":"open-window.openTerminalInWindow (cognitive 29): open-window.openTerminalInWindow has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 6 (10 pts), if/else 6 (8 pts), boolean chains 7, error handling 2, loops 1 (2 pts) (nesting depth added 7). Of this number, 27 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/tui/src/terminals/open-window.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"6795237c0568a286a0368b19560f10537338e0147e00b9a15c68bb7edf9001b5"}},{"ruleId":"D2","level":"warning","message":{"text":"seat-effort.readNativeEffort (cognitive 28): seat-effort.readNativeEffort has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 2, error handling 2, ternaries 1 (2 pts), loops 1 (nesting depth added 11). Of this number, 27 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/daemon/src/domain/seat-effort.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd73c7a74057f825575938982af9b992d3ff7c72b72fccc5ae1763b828906dc9"}},{"ruleId":"D2","level":"warning","message":{"text":"conflict-detector.detectConflicts (cognitive 28): conflict-detector.detectConflicts has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 5, error handling 1 (3 pts), 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/daemon/src/domain/conflict-detector.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4b2b0d58d18f7fc063c2571bbe075f05e8f98f2b798ec6114c40a934b85561"}},{"ruleId":"D2","level":"warning","message":{"text":"skill-catalog.scanCatalog (cognitive 28): skill-catalog.scanCatalog has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 3, loops 3, error handling 1, ternaries 1 (nesting depth added 8). Of this number, 21 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/skill-catalog.ts"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"e61093c2d83a9915193d9d4da12d464ca518d7cb7bbde91cbaeecff60a6dacda"}},{"ruleId":"D2","level":"warning","message":{"text":"kernel-hook-review.makeKernelHookReviewReader.\u003Creturned closure\u003E (cognitive 28): kernel-hook-review.makeKernelHookReviewReader.\u003Creturned closure\u003E has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 6, ternaries 2 (6 pts), error handling 1 (2 pts), 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/daemon/src/domain/kernel-hook-review.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5c108d24df239db9b4eb0a40db8fa18c5c9f87b4e162ebf7cdb0bb21c9ac18"}},{"ruleId":"D2","level":"warning","message":{"text":"scope-audit.deriveMissionDependencyGraph (cognitive 28): scope-audit.deriveMissionDependencyGraph has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (16 pts), ternaries 4 (6 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 12). Of this number, 26 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/daemon/src/domain/scope/scope-audit.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c59274297e032e8adbc18456e5e1b7d8758e5df9653419af4d1b6f1ffbada38"}},{"ruleId":"D2","level":"warning","message":{"text":"compose.composeSliceReview (cognitive 28): compose.composeSliceReview has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 15 (18 pts), boolean chains 9, if/else 1 (nesting depth added 3). Of this number, 22 points are the body\u0027s own statements and 6 belong to 5 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":"packages/daemon/src/domain/review/compose.ts"},"region":{"startLine":1114}}}],"partialFingerprints":{"codehealthFindingId/v1":"6143ad85c891c84f9d156d7353cff9dc68002d07b927360ad5ec6e57e38d33b7"}},{"ruleId":"D2","level":"warning","message":{"text":"SliceIndexer.missionIdAliases (cognitive 28): SliceIndexer.missionIdAliases has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 4 (5 pts), boolean chains 3, error handling 1 (2 pts), ternaries 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":"packages/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce3cc4277b5ba6a384afbd52b7567d067c337d65c04886aa9b5b9d12232cbc0"}},{"ruleId":"D2","level":"warning","message":{"text":"SeatActivityService.pollAllRunningTmuxSeats (cognitive 28): SeatActivityService.pollAllRunningTmuxSeats has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 2 (6 pts), boolean chains 4, error handling 2 (3 pts), loops 3 (nesting depth added 9). Of this number, 25 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/daemon/src/domain/seat-activity-service.ts"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"c081127db66e0cb91518aedf1de4aa76b2776afb84d490cb0d2dfa6fbcf3fd38"}},{"ruleId":"D2","level":"warning","message":{"text":"QueueRepository.retryUnroutableWakesOnReachable (cognitive 28): QueueRepository.retryUnroutableWakesOnReachable has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 5, loops 2 (4 pts), ternaries 3 (4 pts) (nesting depth added 8). Of this number, 23 points are the body\u0027s own statements and 5 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":2147}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f3a0e76479b4ad94c7997cae3aa63071c32cf96777b67a2933638a77e41121"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionTransport.doReconcileStartupReadiness (cognitive 28): SessionTransport.doReconcileStartupReadiness has cognitive complexity 28 (threshold 15). Drivers by points: if/else 16 (18 pts), boolean chains 6, ternaries 3, error handling 1 (nesting depth added 2). Of this number, 16 points are the body\u0027s own statements and 12 belong to 2 function items 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":"packages/daemon/src/domain/session-transport.ts"},"region":{"startLine":5148}}}],"partialFingerprints":{"codehealthFindingId/v1":"b83e8099899b2edb4dae7d66e37c9b72641eab6c8a6952dc00b024f53ccf9a6c"}},{"ruleId":"D2","level":"warning","message":{"text":"check-runner.server (cognitive 28): check-runner.server has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 8, ternaries 2 (3 pts), error handling 1 (nesting depth added 4). None of this is in the body itself: all 28 points belong to one function literal inside it that branches (line 89). 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":"docs/reference/runner-conformance/check-runner.mjs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"402da3ee7e49f97fa8871f819aeb033b74ebdb688800a1cd57830542001881fb"}},{"ruleId":"D2","level":"warning","message":{"text":"auth.authCommand (cognitive 28): auth.authCommand has cognitive complexity 28 (threshold 15). Drivers by points: if/else 18, ternaries 6, boolean chains 2, loops 2. None of this is in the body itself: all 28 points belong to 11 function items inside it that branch (a function literal at line 113, a function literal at line 75, onHost, \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/commands/auth.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8968509c2d652dfc2084db7499a6c3013c7cec40a2ffd5229c8e06d66ead633"}},{"ruleId":"D2","level":"warning","message":{"text":"scope-audit.deriveMissionDependencyGraph (cognitive 28): scope-audit.deriveMissionDependencyGraph has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (16 pts), ternaries 4 (6 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 12). Of this number, 26 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/lib/scope/scope-audit.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"08fa30ac76311833a5d8e2ce880d85b93ec08812d3bf412bf53af4de7b05de23"}},{"ruleId":"D2","level":"warning","message":{"text":"work-install.resolveExplicitSlice (cognitive 28): work-install.resolveExplicitSlice has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 4, ternaries 1 (3 pts), loops 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/lib/work-install.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2f3015d15d4cd572c6ed84bdff3248f8992e00605bd9bedf45ee553e6efdf0"}},{"ruleId":"D2","level":"warning","message":{"text":"work-install.resolveWorkProject (cognitive 28): work-install.resolveWorkProject has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 3, error handling 2 (3 pts), 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/lib/work-install.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a79e8888e2b847c86a1bc31ad9858ee5ac8d63723cb1de3774c1c72eb84908"}},{"ruleId":"D2","level":"warning","message":{"text":"context-install.validateContextPackManifestForInstall (cognitive 28): context-install.validateContextPackManifestForInstall has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 9, error handling 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":"packages/cli/src/lib/context-install.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"042f4ef1dc89595b5b0d82de281476af35b31ab11819bc3449c77ea371fcfa41"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp-server.namedSeats (cognitive 28): mcp-server.namedSeats has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 4 (7 pts), boolean chains 6, 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/mcp-server.ts"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b323592b22f7b4f06b977c2ad1a417a029c0d5651cb0613534a94378bd8489a"}},{"ruleId":"D2","level":"warning","message":{"text":"stream-consumer.applyEffect (cognitive 28): stream-consumer.applyEffect has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 6, ternaries 1 (nesting depth added 6). Of this number, 20 points are the body\u0027s own statements and 8 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/decisions/stream-consumer.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"586170d80e154ae5e0d2666085678067a66d774dae8b90e6c48df04ca5b54f21"}},{"ruleId":"D2","level":"warning","message":{"text":"reconcile-session.reconcileSessionCommand (cognitive 28): reconcile-session.reconcileSessionCommand has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 7, ternaries 3 (4 pts), loops 1 (2 pts) (nesting depth added 4). None of this is in the body itself: all 28 points belong to one function literal inside it that branches (line 68). 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/commands/reconcile-session.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"6959da51e19234b7afc497cae0535cb2f2d8041124be5579a550dee534e1d9d0"}},{"ruleId":"D2","level":"warning","message":{"text":"restore-check.restoreCheckCommand (cognitive 28): restore-check.restoreCheckCommand has cognitive complexity 28 (threshold 15). Drivers by points: if/else 19 (24 pts), ternaries 2 (3 pts), error handling 1 (nesting depth added 6). None of this is in the body itself: all 28 points belong to one function literal inside it that branches (line 246). 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/commands/restore-check.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d7cdc059fcc685a9ebca7249cf7cc0adeede8508951660bc88f8df5c123b4a2"}},{"ruleId":"D2","level":"warning","message":{"text":"terminal-window-rex.openRexView (cognitive 28): terminal-window-rex.openRexView has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 8 (11 pts), if/else 9, boolean chains 6, error handling 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/cli/src/terminal-window-rex.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f53704be458a931259772aee742260a25195de8989df4e53271d08aca1cbf1f"}},{"ruleId":"D2","level":"warning","message":{"text":"bounded-probe-exec.boundedProbeExec.\u003Creturned closure\u003E (cognitive 28): bounded-probe-exec.boundedProbeExec.\u003Creturned closure\u003E has cognitive complexity 28 (threshold 15). Drivers by points: if/else 17, ternaries 3 (5 pts), boolean chains 4, error handling 1, loops 1 (nesting depth added 2). None of this is in the body itself: all 28 points belong to 16 function literals inside it that branch (lines 177, 97, 126, \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/daemon/src/adapters/bounded-probe-exec.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"00845037d3f5a69d87c42f41d00028746bf84607e91a0812d5408aa5b14b6876"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-runtime-adapter.tomlSections (cognitive 28): codex-runtime-adapter.tomlSections has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 5 (9 pts), boolean chains 7, error handling 1 (2 pts) (nesting depth added 10). Of this number, 27 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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":2460}}}],"partialFingerprints":{"codehealthFindingId/v1":"88abddc3fa99bd12baf756475ff52020c3d98c96b60abb0d5b728f1bf2306eb3"}},{"ruleId":"D2","level":"warning","message":{"text":"topology-defaults-installer.installTopologyDefaults (cognitive 28): topology-defaults-installer.installTopologyDefaults has cognitive complexity 28 (threshold 15). Drivers by points: loops 7 (9 pts), ternaries 4 (8 pts), if/else 6 (7 pts), error handling 4 (nesting depth added 7). Most of this is not in the body itself: 6 of the 28 points are its own statements and the rest belongs to 8 function items inside it that branch (copyIfAbsent, ensureDir, section, \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/daemon/src/domain/topology-defaults-installer.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"26bf280d2c071664a6e203f886010bb9798a66d87e6d98aa48a7ca19b15033a4"}},{"ruleId":"D2","level":"warning","message":{"text":"bundle-context-packs-router.routeContextPacks (cognitive 28): bundle-context-packs-router.routeContextPacks has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (16 pts), ternaries 2 (6 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (nesting depth added 13). 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":"packages/daemon/src/domain/bundle-context-packs-router.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"1554f7b6d10ff192feef90fed36068e1dfb79e51a883be867e0580144379af38"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaimService.repairMissingPane (cognitive 28): ClaimService.repairMissingPane has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13, boolean chains 10, ternaries 2 (4 pts), error handling 1 (nesting depth added 2). Of this number, 15 points are the body\u0027s own statements and 13 belong to 3 function items 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":"packages/daemon/src/domain/claim-service.ts"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b2bf95a62208354d3dca1a915d89f78c63f54acc4c86ee77ca516815567341"}},{"ruleId":"D2","level":"warning","message":{"text":"open-asks.deliveryFact (cognitive 28): open-asks.deliveryFact has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (15 pts), ternaries 3 (7 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/daemon/src/domain/gateway/slack/open-asks.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"3286df386875487a59c396186ff02b5551f66e3083f8b0b904cd5ace75f72a99"}},{"ruleId":"D2","level":"warning","message":{"text":"fleet-scopes.remoteCounts (cognitive 28): fleet-scopes.remoteCounts has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 5, 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":"packages/daemon/src/domain/hosts/fleet-scopes.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb7e4fcb47d5cb72b0ced53682520b26f86af1552fdc134469fb8e8a1a1cbc0"}},{"ruleId":"D2","level":"warning","message":{"text":"SuccessorSessionLauncher.startAgent (cognitive 28): SuccessorSessionLauncher.startAgent has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 11 (18 pts), if/else 6, error handling 3 (4 pts) (nesting depth added 8). Of this number, 27 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/daemon/src/domain/successor-session-launcher.ts"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"55731176fe5bcab90b6dc5179cdccc118738b98c379425aa6b51652cd9f9ee25"}},{"ruleId":"D2","level":"warning","message":{"text":"SeatLifecycleService.planFresh (cognitive 28): SeatLifecycleService.planFresh has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (16 pts), ternaries 7 (9 pts), boolean chains 3 (nesting depth added 5). Of this number, 24 points are the body\u0027s own statements and 4 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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":1569}}}],"partialFingerprints":{"codehealthFindingId/v1":"f665b3fe5fd509e849196c93f0b891bb3434698b8a2d090533544377df0a2108"}},{"ruleId":"D2","level":"warning","message":{"text":"RestoreCheckService.checkHooks (cognitive 28): RestoreCheckService.checkHooks has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 4 (8 pts), boolean chains 4, 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/daemon/src/domain/restore-check-service.ts"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3305ab8eb44d86334baafc6aa78e87bdae2fcb15f509b0b98cb2b2edd527152"}},{"ruleId":"D2","level":"warning","message":{"text":"fleet-compose.unionFleet (cognitive 28): fleet-compose.unionFleet has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 5 (8 pts), ternaries 4 (nesting depth added 14). 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":"packages/daemon/src/domain/review/fleet-compose.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d957c5ef9416053ef2d4c486ec4d51c7aed19bad5b1cf1eb05e33a166951291"}},{"ruleId":"D2","level":"warning","message":{"text":"RigSpecExporter.exportLegacy (cognitive 28): RigSpecExporter.exportLegacy has cognitive complexity 28 (threshold 15). Drivers by points: if/else 19, boolean chains 5, ternaries 4. None of this is in the body itself: all 28 points belong to 3 function literals inside it that branch (lines 142, 188, 146). 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/daemon/src/domain/rigspec-exporter.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"548f7f451dd0f25e6b1720f1e475c61e846d4812d294e7b598b50a1d7b2f3ad6"}},{"ruleId":"D2","level":"warning","message":{"text":"watchdog-delivery.makeWatchdogDeliver::deliver (cognitive 28): watchdog-delivery.makeWatchdogDeliver::deliver has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 11 (19 pts), boolean chains 6, if/else 2, error handling 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/daemon/src/domain/watchdog-delivery.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12efcfa55016f8fc25143104eafa694fccf440c9bd08a6b8b0d2909cbf5d2c2"}},{"ruleId":"D2","level":"warning","message":{"text":"bootstrap-failure-response.bootstrapFailureResponse (cognitive 28): bootstrap-failure-response.bootstrapFailureResponse has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 10, ternaries 4 (6 pts) (nesting depth added 5). Of this number, 15 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":"packages/daemon/src/routes/bootstrap-failure-response.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b3a293917d79e1ba194a674d2a7019ff99b1af5d6da7b371700446488da40a"}},{"ruleId":"D2","level":"warning","message":{"text":"env.envRoutes (cognitive 28): env.envRoutes has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (16 pts), error handling 4 (6 pts), ternaries 5, boolean chains 1 (nesting depth added 3). None of this is in the body itself: all 28 points belong to 3 function literals inside it that branch (lines 18, 74, 111). 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/daemon/src/routes/env.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c079cd62a37c49214d45b513724b20b147e832f89b7eca4be30850c9fe66c3"}},{"ruleId":"D2","level":"warning","message":{"text":"scopes-model.proofEvidence (cognitive 28): scopes-model.proofEvidence has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (10 pts), ternaries 5 (10 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 9). 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":"packages/tui/src/scopes/scopes-model.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d10b7e1ed00adb59db0bdf19332f21a9c281ed9846739bf9b1e329fd437cfcd"}},{"ruleId":"D2","level":"warning","message":{"text":"input.resolveKeyAction (cognitive 28): input.resolveKeyAction has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 5 (9 pts), boolean chains 5 (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/tui/src/input.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d4b1fffb693cb10b2904acdc0702a3d20689a4ee466fb0f730d9e2a6104e68"}},{"ruleId":"D2","level":"warning","message":{"text":"useActivityFeed.eventSummary (cognitive 28): useActivityFeed.eventSummary has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 13 (26 pts), boolean chains 1, match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/hooks/useActivityFeed.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"859816462161acebfb724b5c37d1f66e6e16f0daab6e2c6af7034f9e41a1bc59"}},{"ruleId":"D2","level":"warning","message":{"text":"HostConfigCard.HostConfigCard (cognitive 28): HostConfigCard.HostConfigCard has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 11 (21 pts), boolean chains 3, if/else 2 (3 pts), error handling 1 (nesting depth added 11). Of this number, 18 points are the body\u0027s own statements and 10 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/ui/src/components/dashboard/HostConfigCard.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e6c796c9180ea054fb80516f8967e45c09103c3ad02a9442f4332c4b461950"}},{"ruleId":"D2","level":"warning","message":{"text":"LaunchCmuxButton.LaunchCmuxButton (cognitive 28): LaunchCmuxButton.LaunchCmuxButton has cognitive complexity 28 (threshold 15). Drivers by points: if/else 16 (18 pts), ternaries 4 (8 pts), boolean chains 1, error handling 1 (nesting depth added 6). None of this is in the body itself: all 28 points belong to 10 function items inside it that branch (a function literal at line 85, a function literal at line 150, setPendingUi, \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/ui/src/components/topology/LaunchCmuxButton.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"31cf77024501bd801fe441b8bfd29aec80775f43c0c249778a754115c94b8de1"}},{"ruleId":"D2","level":"warning","message":{"text":"useTopologyEdgeActivity.normalizeEvent (cognitive 28): useTopologyEdgeActivity.normalizeEvent has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 7 (13 pts), if/else 8 (11 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":"packages/ui/src/hooks/useTopologyEdgeActivity.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"385b5c9f56b6306b041e565c3291bec63712aa05a6c646534ca15869c9656088"}},{"ruleId":"D2","level":"warning","message":{"text":"effective-model-readers.newestCodexModel (cognitive 27): effective-model-readers.newestCodexModel has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (18 pts), error handling 2 (6 pts), boolean chains 2, 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/daemon/src/domain/model-divergence/effective-model-readers.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec47ff5fad56db9618409b72b8af9656c6c217d0070dda8846b40cdecaa66ca"}},{"ruleId":"D2","level":"warning","message":{"text":"native-process-lineage.selectNativeProcess (cognitive 27): native-process-lineage.selectNativeProcess has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 11, 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/daemon/src/domain/native-process-lineage.ts"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"5957c5b7f3f11fde5aa9f6a30c5f70ab95aed30f931f5364f15c7f9161e28402"}},{"ruleId":"D2","level":"warning","message":{"text":"claude-continuation-launch.continuationArguments (cognitive 27): claude-continuation-launch.continuationArguments has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 4 (7 pts), boolean chains 4, ternaries 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":"packages/daemon/src/domain/claude-continuation-launch.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3aea948b4c94c4c54b6ee9ca18ef9c33a8b50e8d472764604b59462b6200779"}},{"ruleId":"D2","level":"warning","message":{"text":"rigspec-schema.validatePod (cognitive 27): rigspec-schema.validatePod has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (18 pts), loops 2 (6 pts), boolean chains 3 (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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"5472d230945f7293e05de06c57c59542234c5e37983fffc796e7d28309d6617f"}},{"ruleId":"D2","level":"warning","message":{"text":"InboundRouter.retryOwnDeadLetters (cognitive 27): InboundRouter.retryOwnDeadLetters has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (23 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":"packages/daemon/src/domain/gateway/slack/inbound.ts"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fedf7cdcc4fad68c9e6c3a1428cfa0a6942209d4b98d98facf22391afd12e1d"}},{"ruleId":"D2","level":"warning","message":{"text":"SliceIndexer.matchQitems (cognitive 27): SliceIndexer.matchQitems has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 4 (9 pts), ternaries 3 (6 pts), boolean chains 1, error handling 1 (nesting depth added 11). 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":"packages/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":1242}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f40da690a990376739ef4c9062cd43a130ba57a39ae5dd0778ebf643e5326ee"}},{"ruleId":"D2","level":"warning","message":{"text":"transcript-rotation.startTranscriptRotation::tick (cognitive 27): transcript-rotation.startTranscriptRotation::tick has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (16 pts), boolean chains 8, error handling 2, ternaries 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/daemon/src/domain/transcript-rotation.ts"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a98b30499859968bf8e3a5fa1a14006d792e44e43191d12fb3f3bf89d49fd7"}},{"ruleId":"D2","level":"warning","message":{"text":"SeatActivityService.rawCandidate (cognitive 27): SeatActivityService.rawCandidate has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 10, 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/daemon/src/domain/seat-activity-service.ts"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c9c4916613d806e06da1cfd42c0f105b75a71ac0e3910d813381ab02be537b"}},{"ruleId":"D2","level":"warning","message":{"text":"node-inventory.getNodeDetail (cognitive 27): node-inventory.getNodeDetail has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (15 pts), ternaries 5, boolean chains 4, error handling 1 (2 pts), loops 1 (nesting depth added 5). Of this number, 25 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/daemon/src/domain/node-inventory.ts"},"region":{"startLine":1271}}}],"partialFingerprints":{"codehealthFindingId/v1":"18bd9b68a5dd9af31df6d5f56f2852347161135f53ba7eff61573d70e6459d04"}},{"ruleId":"D2","level":"warning","message":{"text":"QueueRepository.fallbackLineStart (cognitive 27): QueueRepository.fallbackLineStart has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 3 (6 pts), boolean chains 5, loops 3 (4 pts) (nesting depth added 10). Of this number, 25 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":"packages/daemon/src/domain/queue-repository.ts"},"region":{"startLine":5977}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aaad2bb6b454efc2de6d89f00980a5a90a336ba76e0cfe7f04a2528157a0be5"}},{"ruleId":"D2","level":"warning","message":{"text":"claude-compaction-enforcer.readCompactionRecord (cognitive 27): claude-compaction-enforcer.readCompactionRecord has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 25, error handling 1, ternaries 1. Of this number, 26 points are the body\u0027s own statements and 1 belongs 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"98dc47569a97f3539e36976e94dfb95a8cef0e9c41afa868b9b78e3c315d46d0"}},{"ruleId":"D2","level":"warning","message":{"text":"agent-server.serveAcpAgent::askPerson (cognitive 27): agent-server.serveAcpAgent::askPerson has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 4 (10 pts), error handling 1 (2 pts), boolean chains 1, 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/acp/agent-server.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"c027d2ef4484f894902cb227612aad4dba3bc23b51e8bc59855f5d9d109426d1"}},{"ruleId":"D2","level":"warning","message":{"text":"daemon-lifecycle.liveStartReservation (cognitive 27): daemon-lifecycle.liveStartReservation has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 4 (9 pts), error handling 2 (3 pts), 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/daemon-lifecycle.ts"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"12fc2397a6bb94839e61a2233c2dbc7433b74d7764124dfbe7708552b74759c4"}},{"ruleId":"D2","level":"warning","message":{"text":"roster.readRosterInventory (cognitive 27): roster.readRosterInventory has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 8 (17 pts), if/else 2 (4 pts), boolean chains 3, error handling 1 (2 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":"packages/cli/src/commands/roster.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5295c55dc90d55bfd5010e84117895337c11539ec0af1b7e2e31bf65c1d063"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp-server.projectForExternal (cognitive 27): mcp-server.projectForExternal has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 9, ternaries 1 (3 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/mcp-server.ts"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb6878311706cc754caefc52af54639d532a2a34c026e1c196f24d7a0ec469f5"}},{"ruleId":"D2","level":"warning","message":{"text":"queue.readBackQueueUpdate (cognitive 27): queue.readBackQueueUpdate has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 7, error handling 2 (3 pts), ternaries 2 (nesting depth added 6). Of this number, 18 points are the body\u0027s own statements and 9 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/commands/queue.ts"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6ed5af989ddeec83f90b0731a441bba06a004fb0535e66c1b1ae2faf37fc08"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeCodeAdapter.assessManagedProbe (cognitive 27): ClaudeCodeAdapter.assessManagedProbe has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 7, ternaries 1 (2 pts), error handling 1 (nesting depth added 3). Of this number, 26 points are the body\u0027s own statements and 1 belongs 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3405f4b3bbca2b5cb0270cbf56c377aadc42355dcc8a27bcfed1e748c093731"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-filesystem-preflight.decideCodexFilesystemPolicy (cognitive 27): codex-filesystem-preflight.decideCodexFilesystemPolicy has cognitive complexity 27 (threshold 15). Drivers by points: if/else 18 (21 pts), boolean chains 6 (nesting depth added 3). 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: 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/daemon/src/domain/codex-filesystem-preflight.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a7e31e7518f528fca6d6e75617c37ed66bb0f69e9d4df649dc1904fe8ae8c0"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-runtime-adapter.upsertManagedCodexConfigFragment (cognitive 27): codex-runtime-adapter.upsertManagedCodexConfigFragment has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 8, loops 3 (5 pts), ternaries 3 (5 pts) (nesting depth added 8). Of this number, 21 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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":2906}}}],"partialFingerprints":{"codehealthFindingId/v1":"45d7b5c2cb407adff1a705cfb766d46f5edaaca2f12c019047eca05a5a1fcb1e"}},{"ruleId":"D2","level":"warning","message":{"text":"OmpFrameDecoder.push (cognitive 27): OmpFrameDecoder.push has cognitive complexity 27 (threshold 15). Drivers by points: if/else 17 (19 pts), boolean chains 6, error handling 1, ternaries 1 (nesting depth added 2). Of this number, 25 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/adapters/omp-rpc-frame.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"4422c02148efe32f2a48b15e5dce6e0b48d7e432ad3eda6f46f9f3876bfde959"}},{"ruleId":"D2","level":"warning","message":{"text":"StubRuntimeAdapter.deliverStartup (cognitive 27): StubRuntimeAdapter.deliverStartup has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (19 pts), ternaries 2 (3 pts), error handling 1 (2 pts), match/switch 1 (2 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/daemon/src/adapters/stub-runtime-adapter.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c65e67eb58df2974f13f1a56bf41d0ec099661e36f476c02b56a76da2ee0565"}},{"ruleId":"D2","level":"warning","message":{"text":"PeriodicSnapshotScheduler.tick (cognitive 27): PeriodicSnapshotScheduler.tick has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (12 pts), error handling 3 (9 pts), ternaries 1 (3 pts), boolean chains 2, 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":"packages/daemon/src/domain/periodic-snapshot-scheduler.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7080aeed250e7a18ea85c4be61c4710f7ecd8a0c45572861ad8f990f1d3cb88"}},{"ruleId":"D2","level":"warning","message":{"text":"thread-routing.makeThreadRouteResolver.\u003Creturned closure\u003E (cognitive 27): thread-routing.makeThreadRouteResolver.\u003Creturned closure\u003E has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 3 (9 pts), boolean chains 7 (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/daemon/src/domain/gateway/slack/thread-routing.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea25c67af8c37e5862ba51ea173035691ba4da46b9e65add5bac9426250591c"}},{"ruleId":"D2","level":"warning","message":{"text":"SeatLifecycleService.setEffort (cognitive 27): SeatLifecycleService.setEffort has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (20 pts), ternaries 5 (6 pts), boolean chains 1 (nesting depth added 8). 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 into named stages: move each independent step or branch into 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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ad11b30dfdc538bba1ea43e6d7487c072a383590495ca71c8587b902e86e82"}},{"ruleId":"D2","level":"warning","message":{"text":"queue-erasure.eraseRigRecords (cognitive 27): queue-erasure.eraseRigRecords has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 9). 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 into named stages: move each independent step or branch into 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/daemon/src/domain/queue-erasure.ts"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"27819f948050cf9fd6201d92bc7b683fae54a0944c3583472c80ca32c444b133"}},{"ruleId":"D2","level":"warning","message":{"text":"SeatRuntimeSwitchService.commit (cognitive 27): SeatRuntimeSwitchService.commit has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 10 (12 pts), boolean chains 8, if/else 6 (7 pts) (nesting depth added 3). None of this is in the body itself: all 27 points belong to one function literal inside it that branches (line 602). 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/daemon/src/domain/seat-runtime-switch-service.ts"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cdb6a2a9b47eaa8eac21f1a3d6610e1d0cc8f406e5f60e6786815155c77f6ae"}},{"ruleId":"D2","level":"warning","message":{"text":"skill-audit.auditSkills.entries (cognitive 27): skill-audit.auditSkills.entries has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 10 (15 pts), if/else 6 (9 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":"packages/daemon/src/domain/skill-audit.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb20666eb19ce2c29d23c9097f5c0c673631b4d21201c1791239f8a0c48a3123"}},{"ruleId":"D2","level":"warning","message":{"text":"scope-task-terminal-view.readScopeIndex::add (cognitive 27): scope-task-terminal-view.readScopeIndex::add has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 6, ternaries 4 (5 pts), error handling 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. This shape REPEATS in the file: one other method here (scope-task-terminal-view.readScopeIndex) 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/daemon/src/domain/terminal/scope-task-terminal-view.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c8143b570a217487ea0b30e88faa4d3a2348ce4142fac1e9f807f90b9f03dae"}},{"ruleId":"D2","level":"warning","message":{"text":"pi-usage-facts.extractPiUsageFacts (cognitive 26): pi-usage-facts.extractPiUsageFacts has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 8, ternaries 3 (6 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/daemon/src/domain/pi-usage-facts.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"120f1e1fa5d43fffba1660a7b731645a6b931ee7836229f85fcf24fbd58c0f7a"}},{"ruleId":"D2","level":"warning","message":{"text":"skill-discovery.discoverSkillsWithProvenance (cognitive 26): skill-discovery.discoverSkillsWithProvenance has cognitive complexity 26 (threshold 15). Drivers by points: error handling 4 (11 pts), if/else 2 (6 pts), ternaries 2 (6 pts), 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":"packages/daemon/src/domain/skill-discovery.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f8ca1b501d58e967329cc67d7ac38bc542424e693c4345f06319594d660bda"}},{"ruleId":"D2","level":"warning","message":{"text":"skill-catalog.resolvePluginSkills (cognitive 26): skill-catalog.resolvePluginSkills has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (15 pts), error handling 3 (5 pts), ternaries 4, 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":"packages/daemon/src/domain/skill-catalog.ts"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1792232780a2cd56dfea71008332d04fe0ecfdaec2ab76b19b6e8611fc5188"}},{"ruleId":"D2","level":"warning","message":{"text":"seat-launch-additions.seatLaunchAdditionsAt (cognitive 26): seat-launch-additions.seatLaunchAdditionsAt has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (17 pts), ternaries 3 (4 pts), boolean chains 2, loops 2, error handling 1 (nesting depth added 4). Of this number, 23 points are the body\u0027s own statements and 3 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/daemon/src/domain/seat-launch-additions.ts"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc8285f8194acd45e551a36eadfccd6b7ea5822dcc1ad07d62bc0d71833b8ec"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeManagedLaunch.credentialPrecedence (cognitive 26): ClaudeManagedLaunch.credentialPrecedence has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 8 (10 pts), boolean chains 3, loops 3 (nesting depth added 7). Of this number, 25 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/daemon/src/domain/claude-managed-launch.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceed9c0dd23484882113da2245948d04ab21b769eb1c8a23c53a5b8244d1ffa9"}},{"ruleId":"D2","level":"warning","message":{"text":"message.richInline (cognitive 26): message.richInline has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 3 (8 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 10). Of this number, 23 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/daemon/src/domain/gateway/slack/message.ts"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91a3f2488fb755eb68f932d6a0ae73b6e6b18ec7a4c6f630f0717b5bf54491d"}},{"ruleId":"D2","level":"warning","message":{"text":"SeatActivityService.pollPermissionPrompt (cognitive 26): SeatActivityService.pollPermissionPrompt has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 13, if/else 7 (9 pts), ternaries 3, loops 1 (nesting depth added 2). Of this number, 24 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/daemon/src/domain/seat-activity-service.ts"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"e970a9ad40b906a701e6f89a41b5d8520655ca57263943279b802931b3eb40bf"}},{"ruleId":"D2","level":"warning","message":{"text":"QueueRepository.performWakeSend (cognitive 26): QueueRepository.performWakeSend has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 10 (14 pts), if/else 8 (9 pts), boolean chains 2, error handling 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":2207}}}],"partialFingerprints":{"codehealthFindingId/v1":"65647806d7c7bc31d2c28e37aaed47a6e0df819ba2f5ea7daf49c7077fb5d2e1"}},{"ruleId":"D2","level":"warning","message":{"text":"session-transport.readInputBox (cognitive 26): session-transport.readInputBox has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (14 pts), ternaries 3 (8 pts), boolean chains 4 (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/daemon/src/domain/session-transport.ts"},"region":{"startLine":1981}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeda93812f027830f5dcebc4d934c66ad205c38b23684bdcfcc486e64c431eac"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeCompactionEnforcer.getOwedRestore (cognitive 26): ClaudeCompactionEnforcer.getOwedRestore has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 10 (19 pts), boolean chains 4, if/else 3 (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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"a62b21d64bd3e19fd5f3f67461ad2b5bc41894731e3ce4aca5bbda3b5b6f72a0"}},{"ruleId":"D2","level":"warning","message":{"text":"whoami.runFanOutWhoami (cognitive 26): whoami.runFanOutWhoami has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (17 pts), ternaries 2 (5 pts), loops 1 (2 pts), boolean chains 1, error handling 1 (nesting depth added 7). Of this number, 19 points are the body\u0027s own statements and 7 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/commands/whoami.ts"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"802ad9da4fa6eebd6fa97d2007a8b9c96c336ab1454b823ab504d67d9ed8fd95"}},{"ruleId":"D2","level":"warning","message":{"text":"bundle-check.checkBundleFolder (cognitive 26): bundle-check.checkBundleFolder has cognitive complexity 26 (threshold 15). Drivers by points: if/else 32 (46 pts), loops 11 (16 pts), boolean chains 14, ternaries 8 (14 pts), error handling 6 (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. This shape REPEATS in the file: 2 other methods here (bundle-check.checkBundleFolder::startupFiles, bundle-check.checkBundleFolder::agent) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 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/lib/bundle-check.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0912e083df908d2d25b2fbecd3bf7d395e01bc188c1a0e83b0247872ce85f75"}},{"ruleId":"D2","level":"warning","message":{"text":"send.runCrossHostSend (cognitive 26): send.runCrossHostSend has cognitive complexity 26 (threshold 15). Drivers by points: if/else 18 (21 pts), ternaries 3 (4 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/commands/send.ts"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cdbb5a1196563542278648772e19aa9cc8c01f60ec4daecb90c201915d95d62"}},{"ruleId":"D2","level":"warning","message":{"text":"scope-fs.resolveMissionsRoot (cognitive 26): scope-fs.resolveMissionsRoot has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 3 (8 pts), boolean chains 5 (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/lib/scope/scope-fs.ts"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b4e8295ce0de31c6ec2158bc04daa0f2d6d28536131c4ef63c28ec711bb24d"}},{"ruleId":"D2","level":"warning","message":{"text":"reconstruction-reader.parseReconstructionJson::value (cognitive 26): reconstruction-reader.parseReconstructionJson::value has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 3 (7 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/lib/reconstruction-reader.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78d5d6bbca560087e5952aeb36cd5af9ff32e7e8276e7b118c1eb88a052d2e4"}},{"ruleId":"D2","level":"warning","message":{"text":"down.confirmOwnRig (cognitive 26): down.confirmOwnRig has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (13 pts), ternaries 8 (9 pts), boolean chains 3, 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/commands/down.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"b27e1fdf36ea32b7abb222514e40851d3589d86d0007313b6f99d0c22f6393aa"}},{"ruleId":"D2","level":"warning","message":{"text":"parked.renderSeat (cognitive 26): parked.renderSeat has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 8 (19 pts), if/else 2 (3 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/commands/parked.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"586a7935be7f056f6e62fabc168077913dd25ee170fb3f597e4adc68a17936ca"}},{"ruleId":"D2","level":"warning","message":{"text":"decisions.parseTemplate (cognitive 26): decisions.parseTemplate has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 6, 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/decisions/decisions.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"69bfe091a19645117c5ed8dd4610d25e7bee87da16ce933bc677a032fc82fdc5"}},{"ruleId":"D2","level":"warning","message":{"text":"scope.buildApproveCommand (cognitive 26): scope.buildApproveCommand has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 9 (10 pts), if/else 9, boolean chains 6, error handling 1 (nesting depth added 1). Most of this is not in the body itself: 4 of the 26 points are its own statements and the rest belongs to one function literal inside it that branches (line 2206). 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/commands/scope.ts"},"region":{"startLine":2190}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdfdb52ddcd56f8f937a3f0117e65ec4fcd214c7cfb56a1814fb890a1a7f7d17"}},{"ruleId":"D2","level":"warning","message":{"text":"usage.providerChargeText (cognitive 26): usage.providerChargeText has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 10 (22 pts), boolean chains 2, if/else 1, 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":"packages/cli/src/commands/usage.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d405502c995223c0abfb546455b63e254a96a822dce0d936faa58a6876b527"}},{"ruleId":"D2","level":"warning","message":{"text":"claude-team-permissions.decide (cognitive 26): claude-team-permissions.decide has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 5 (9 pts), boolean chains 4, ternaries 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/daemon/assets/claude-team-permissions.cjs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb8997b490e94da05fc4ff1386d3090d06ede7de52f3991bf2ada2be7e89f1b"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeCodeAdapter.launchHarness::sendClassic (cognitive 26): ClaudeCodeAdapter.launchHarness::sendClassic has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 7 (8 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. This shape REPEATS in the file: one other method here (ClaudeCodeAdapter.launchHarness) 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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ac7184b54daae32377579bec1c19806c7b198333aa645f763891cec836c787"}},{"ruleId":"D2","level":"warning","message":{"text":"pi-runner.createRunnerInput::receive (cognitive 26): pi-runner.createRunnerInput::receive has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 3 (7 pts), loops 2 (4 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"3349c2aab06324d478142e4624c3fddb70c8b26fa596bdf1fcc0571a5f21a481"}},{"ruleId":"D2","level":"warning","message":{"text":"evidence-guard.evaluateProtection (cognitive 26): evidence-guard.evaluateProtection has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 5 (9 pts), ternaries 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/daemon/src/domain/agent-images/evidence-guard.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d3bfb3c1838e4f3d08881ebac08497858cd4f6afd46355efc64f835a62b6852"}},{"ruleId":"D2","level":"warning","message":{"text":"EnvironmentArtifacts.export (cognitive 26): EnvironmentArtifacts.export has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 8, error handling 1 (2 pts), loops 1 (nesting depth added 4). Of this number, 19 points are the body\u0027s own statements and 7 belong to 4 function items 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/daemon/src/domain/environment-artifacts.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf7074b815bc08bc7b19e6c339c2780e09136c5185167880c40a3721c4731352"}},{"ruleId":"D2","level":"warning","message":{"text":"restore-plan-preview.buildRestorePlanPreview.nodes (cognitive 26): restore-plan-preview.buildRestorePlanPreview.nodes has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 15 (21 pts), boolean chains 5 (nesting depth added 6). 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/daemon/src/domain/restore-plan-preview.ts"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff9212246dc82ef5b963b5f4398094eaccb81228cd4fc67026cbedd725c0ee4e"}},{"ruleId":"D2","level":"warning","message":{"text":"SlackAskSettlement.desired (cognitive 26): SlackAskSettlement.desired has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 8, ternaries 3 (7 pts) (nesting depth added 6). Of this number, 21 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/daemon/src/domain/gateway/slack/settled-asks.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b2db6e09adc81a6294abfefc55b94f7f108f01a5a90773c3f31f3b483edb57"}},{"ruleId":"D2","level":"warning","message":{"text":"HealthDiagnosisService.notifyOccurrence (cognitive 26): HealthDiagnosisService.notifyOccurrence has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 13, if/else 11, 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/daemon/src/domain/health-diagnosis.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79832543219eda94731f387d981a771f55d7e069d38f0562a324c8af87dc732"}},{"ruleId":"D2","level":"warning","message":{"text":"seat-cwd-preparation.projectionCopyDirectory (cognitive 26): seat-cwd-preparation.projectionCopyDirectory has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 5 (10 pts), boolean chains 4 (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/daemon/src/domain/seat-cwd-preparation.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb98dc792dcd2cc0b3a9180c65bb693ac7552dcc74c1b1a68bf54a2ccdcc0e3"}},{"ruleId":"D2","level":"warning","message":{"text":"SliceDetailProjector.buildStory (cognitive 26): SliceDetailProjector.buildStory has cognitive complexity 26 (threshold 15). Drivers by points: error handling 4 (7 pts), loops 4 (7 pts), ternaries 3 (7 pts), if/else 3 (4 pts), boolean chains 1 (nesting depth added 11). Of this number, 25 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/daemon/src/domain/slices/slice-detail-projector.ts"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b73a918413b7383cfd9d75bf8238c6fd6c4267a60127fa385e03ad7f294eb0b"}},{"ruleId":"D2","level":"warning","message":{"text":"scope-task-terminal-view.selectMission (cognitive 26): scope-task-terminal-view.selectMission has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 4 (6 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/daemon/src/domain/terminal/scope-task-terminal-view.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef0297bf7c4dc71ffd9883dfdd8b6c684a03e5adda6eaa3e77b3c0306388cb32"}},{"ruleId":"D2","level":"warning","message":{"text":"bundles.consumeAuthorBundleYaml::assertNoSymlinkEscapeInTree (cognitive 26): bundles.consumeAuthorBundleYaml::assertNoSymlinkEscapeInTree has cognitive complexity 26 (threshold 15). Drivers by points: if/else 4 (12 pts), error handling 3 (10 pts), loops 2 (3 pts), boolean chains 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. This shape REPEATS in the file: one other method here (bundles.consumeAuthorBundleYaml) 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/daemon/src/routes/bundles.ts"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bd069bc9a5604906fdc639e248ff14f2b9425f01a65c2ad3d703fbfe7c8ac49"}},{"ruleId":"D2","level":"warning","message":{"text":"telemetry.telemetryRoutes (cognitive 26): telemetry.telemetryRoutes has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 8, ternaries 2 (3 pts), error handling 1 (2 pts), loops 1 (nesting depth added 6). Most of this is not in the body itself: 1 of the 26 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 37, 72, 24, \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/daemon/src/routes/telemetry.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93dcebc8086ef1846d7275bef743e1f8c22438888baa48884596097f3d2c5e3"}},{"ruleId":"D2","level":"warning","message":{"text":"cost-model.providerChargeText (cognitive 26): cost-model.providerChargeText has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 10 (22 pts), boolean chains 2, if/else 1, 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":"packages/tui/src/cost/cost-model.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"acec7f912787bb8db234c54ab5090116a7d44dc057af94c09cdc42cacaf536fa"}},{"ruleId":"D2","level":"warning","message":{"text":"navigator.navigatorLabelsInner (cognitive 26): navigator.navigatorLabelsInner has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (15 pts), ternaries 6 (10 pts), loops 1 (nesting depth added 8). None of this is in the body itself: all 26 points belong to 3 function literals inside it that branch (lines 169, 152, 177). 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/tui/src/navigator.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1936a02759ba4e9f2dc6d93e282c9019de156268d423ffe30575e81011d2d7"}},{"ruleId":"D2","level":"warning","message":{"text":"useMissionDiscovery.useMissionDiscovery (cognitive 26): useMissionDiscovery.useMissionDiscovery has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 8, ternaries 5 (6 pts) (nesting depth added 4). Of this number, 22 points are the body\u0027s own statements and 4 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/ui/src/hooks/useMissionDiscovery.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b172a19e46f2805bb2779c260a6a123ebe1cb908da7fcbb4457330e92793b4f"}},{"ruleId":"D2","level":"warning","message":{"text":"PackageInstallFlow.PackageInstallFlow (cognitive 26): PackageInstallFlow.PackageInstallFlow has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 19, if/else 4, error handling 3. Of this number, 17 points are the body\u0027s own statements and 9 belong to 4 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/ui/src/components/PackageInstallFlow.tsx"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b007c3b73ac30841497a082f93b345c415ec79791f314249d55c8efc6fe6d63"}},{"ruleId":"D2","level":"warning","message":{"text":"ProofTab.ProofSliceCard (cognitive 26): ProofTab.ProofSliceCard has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 14 (22 pts), boolean chains 2, if/else 2 (nesting depth added 8). Of this number, 24 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/ui/src/components/project/ProofTab.tsx"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"88050ddd739186164210ed6c837b2197efda95a6a35de49a42c89c0e4d7ac4fd"}},{"ruleId":"D2","level":"warning","message":{"text":"MissionReviewTab.BoardRowExpansion (cognitive 26): MissionReviewTab.BoardRowExpansion has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 11 (21 pts), if/else 3, boolean chains 2 (nesting depth added 10). Most of this is not in the body itself: 12 of the 26 points are its own statements and the rest belongs to 2 function items inside it that branch (a function literal at line 89, onApprove). 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/ui/src/components/review/MissionReviewTab.tsx"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"a759e79723a9e5225c8f1cfcf6278a81f68be06e1fd3b386e505878fb469e49b"}},{"ruleId":"D2","level":"warning","message":{"text":"trace-to-root.render_candidates (cognitive 26): trace-to-root.render_candidates has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 9, ternaries 2 (4 pts), loops 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":"packages/daemon/assets/plugins/openrig-core/skills/refocusing/scripts/trace-to-root.py"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"607de54e52d65b761e70de7c81989075c87388ced39fd1974e83819d80e34285"}},{"ruleId":"D2","level":"warning","message":{"text":"native-process-lineage.tokens (cognitive 25): native-process-lineage.tokens has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 10, loops 1, ternaries 1 (nesting depth added 5). Of this number, 18 points are the body\u0027s own statements and 7 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/daemon/src/domain/native-process-lineage.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17c76a51046a9af21d86480819b313f7bed910466ebf70a3ac9f877d2bd4105"}},{"ruleId":"D2","level":"warning","message":{"text":"native-process-lineage.findExactNativeResumeProcess (cognitive 25): native-process-lineage.findExactNativeResumeProcess has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (4 pts), ternaries 1 (4 pts), boolean chains 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":"packages/daemon/src/domain/native-process-lineage.ts"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad64b75b7164aaac1e4e48d3f2d0240b005785dcbfbe2a08ad05caec8b9b011"}},{"ruleId":"D2","level":"warning","message":{"text":"current-generation-record.resolveIdentityVerifiedPiRecord (cognitive 25): current-generation-record.resolveIdentityVerifiedPiRecord has cognitive complexity 25 (threshold 15). Drivers by points: if/else 18, boolean chains 5, ternaries 2. 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: 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/daemon/src/domain/model-divergence/current-generation-record.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"de021f3525b3a1cf1f7e2f35add724337b60038ec180b77998620247a029d41e"}},{"ruleId":"D2","level":"warning","message":{"text":"pane-envelope.wrapPaneEnvelope (cognitive 25): pane-envelope.wrapPaneEnvelope has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 9 (21 pts), boolean chains 3, if/else 1 (nesting depth added 12). 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/daemon/src/lib/pane-envelope.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3de0b7cf022bcd8f978a0ef878078b944e721bd0655345d3d8fd90ae73f418b"}},{"ruleId":"D2","level":"warning","message":{"text":"agent-resolver.resolveWithImports (cognitive 25): agent-resolver.resolveWithImports has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (22 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/daemon/src/domain/agent-resolver.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c203c9548a08e918227c3772656c420a16ef86b7b878abb990c043dfb522871"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeResumeAdapter.resume::sendClassic (cognitive 25): ClaudeResumeAdapter.resume::sendClassic has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 6 (7 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. This shape REPEATS in the file: one other method here (ClaudeResumeAdapter.resume) 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/daemon/src/adapters/claude-resume.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e11f146c5fd9567a9db638e9cae0967aa1b60699e14cf9b7d8ce8d244bc3ba"}},{"ruleId":"D2","level":"warning","message":{"text":"InboundRouter.summaryOf (cognitive 25): InboundRouter.summaryOf has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 7 (12 pts), if/else 4 (5 pts), loops 2 (5 pts), boolean chains 3 (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/daemon/src/domain/gateway/slack/inbound.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"802c54d05b2c8ec86011dce0997b3883f0efcbe4a9f033b5197d04118ddf24d9"}},{"ruleId":"D2","level":"warning","message":{"text":"queue-pickup.deriveClaimPickup (cognitive 25): queue-pickup.deriveClaimPickup has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, ternaries 3 (5 pts), 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/daemon/src/domain/queue-pickup.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2f70167b80f617505210b32e102b7541c8cc41a7fd7b0e6b1bf2c9d12bb8f6"}},{"ruleId":"D2","level":"warning","message":{"text":"host-usage-rollup.rollupClaude (cognitive 25): host-usage-rollup.rollupClaude has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 3 (7 pts), boolean chains 2, loops 2 (nesting depth added 8). Of this number, 20 points are the body\u0027s own statements and 5 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":"packages/daemon/src/domain/provider/host-usage-rollup.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"043e901dfa2f887cd918960cbfdda7f629d9d18d367c4ccbe1d949b736d13929"}},{"ruleId":"D2","level":"warning","message":{"text":"markdown-address.scanHeaders (cognitive 25): markdown-address.scanHeaders has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 3, 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/daemon/src/domain/markdown-address.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2753e3d22642b947b06a1105a2983df09ccff2e8a18e72a4cfe18c6d8833937"}},{"ruleId":"D2","level":"warning","message":{"text":"slice-indexer.parseTypedQueueScope (cognitive 25): slice-indexer.parseTypedQueueScope has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 2 (3 pts), error handling 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/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba481bc3ad67158e1bd529b41d498a20843883c1719af72666efc94eef20bc2"}},{"ruleId":"D2","level":"warning","message":{"text":"judgments.readSliceReadiness (cognitive 25): judgments.readSliceReadiness has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 5 (12 pts), boolean chains 10, if/else 2, 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/daemon/src/domain/proof/judgments.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c414f6699fe7056c30eb257e090d3c07efa22b906abfe0abc2c0eeb97713a9"}},{"ruleId":"D2","level":"warning","message":{"text":"restore-guidance.seatGuidance (cognitive 25): restore-guidance.seatGuidance has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 5, error handling 1 (3 pts), loops 3 (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/daemon/src/domain/restore-guidance.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d670f55ea386beacdbd55a2b7e6aaac2910987125f2312a7b490b3ad23773c"}},{"ruleId":"D2","level":"warning","message":{"text":"node-inventory.attachAgentActivity (cognitive 25): node-inventory.attachAgentActivity has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10, boolean chains 8, ternaries 6 (7 pts) (nesting depth added 1). None of this is in the body itself: all 25 points belong to 3 function literals inside it that branch (lines 1862, 1945, 1905). 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/daemon/src/domain/node-inventory.ts"},"region":{"startLine":1824}}}],"partialFingerprints":{"codehealthFindingId/v1":"900aae337c285faf9a9cda1e07c409444d26cbde29fa9e3fc69d060b1ed0dc50"}},{"ruleId":"D2","level":"warning","message":{"text":"relay-outbound.findPendingRelayReplyRef (cognitive 25): relay-outbound.findPendingRelayReplyRef has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 5, ternaries 2 (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/daemon/src/domain/gateway/relay-outbound.ts"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"249aeb5a98014798ea12acaf48539be543d29b1b2f7a1462681ca56d2f82a23e"}},{"ruleId":"D2","level":"warning","message":{"text":"QueueRepository.drainPendingWakeIntents (cognitive 25): QueueRepository.drainPendingWakeIntents has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 8). Of this number, 16 points are the body\u0027s own statements and 9 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":1941}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c827ee4da502d8ec2c4d1640bf1c5b19451a3616189646087347ccc25cb728d"}},{"ruleId":"D2","level":"warning","message":{"text":"StartupOrchestrator.executeActions (cognitive 25): StartupOrchestrator.executeActions has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 2, error handling 1 (2 pts), ternaries 2, 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/daemon/src/domain/startup-orchestrator.ts"},"region":{"startLine":1166}}}],"partialFingerprints":{"codehealthFindingId/v1":"645bb54fdec6844cc27f35a2a0a5a2c36195fe33f1cdfd411de8b5f7fc6530cc"}},{"ruleId":"D2","level":"warning","message":{"text":"session-transport.writtenFact (cognitive 25): session-transport.writtenFact has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 5, ternaries 2 (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":"packages/daemon/src/domain/session-transport.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c122b2d59f3b9f1f8726dbf5a488eb58a489f55975dfcb6f82b2119cf39992"}},{"ruleId":"D2","level":"warning","message":{"text":"native-resume-probe.buildCodexResumeDisplay (cognitive 25): native-resume-probe.buildCodexResumeDisplay has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 8, ternaries 4 (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/daemon/src/domain/native-resume-probe.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"9362aa183663a6e0007033decc439e6eda7d2707c394e176508098511e0bd3b6"}},{"ruleId":"D2","level":"warning","message":{"text":"native-resume-probe.currentCodexAuthRefusal (cognitive 25): native-resume-probe.currentCodexAuthRefusal has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 7, loops 3, ternaries 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":"packages/daemon/src/domain/native-resume-probe.ts"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf2deb35ae69d52b0fe3e8113b293c8bfb84d1cddf21b9901a316c54741f459"}},{"ruleId":"D2","level":"warning","message":{"text":"atomic-text-write.writeTextAtomically (cognitive 25): atomic-text-write.writeTextAtomically has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (12 pts), error handling 3 (6 pts), boolean chains 5, loops 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":"packages/cli/src/atomic-text-write.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"854f946cf77615051e1a0c05443fba002d6c5709327393d8a8c8d056b8ae8b23"}},{"ruleId":"D2","level":"warning","message":{"text":"ps.parsePsControls (cognitive 25): ps.parsePsControls has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 7, ternaries 4 (6 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/commands/ps.ts"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"267f8881ffea81b1db590543269225f9cdc604aed38646e86ee820ece1435363"}},{"ruleId":"D2","level":"warning","message":{"text":"acp.acpCommand (cognitive 25): acp.acpCommand has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (15 pts), ternaries 4 (5 pts), boolean chains 4, error handling 1 (nesting depth added 2). None of this is in the body itself: all 25 points belong to 7 function items inside it that branch (a function literal at line 336, a function literal at line 295, a function literal at line 225, \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/commands/acp.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce2f0b364f17df412c63072ad4379921b641eebb83052d4baf3d52c21fddd718"}},{"ruleId":"D2","level":"warning","message":{"text":"broadcast.renderBroadcastResults (cognitive 25): broadcast.renderBroadcastResults has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 5 (11 pts), if/else 8 (10 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":"packages/cli/src/commands/broadcast.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9680d13f489eb3c0a9152c6be20ea71fd3db66de7a4202a8f4c63662c900066"}},{"ruleId":"D2","level":"warning","message":{"text":"capture.runCrossHostCapture (cognitive 25): capture.runCrossHostCapture has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (19 pts), ternaries 2 (4 pts), boolean chains 2 (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":"packages/cli/src/commands/capture.ts"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78351ec8e5812226741ee7a4803cd483d7be1cc07fe37acef19bb5946a216b5"}},{"ruleId":"D2","level":"warning","message":{"text":"reconstruction-reader.readReconstruction (cognitive 25): reconstruction-reader.readReconstruction has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 6 (9 pts), if/else 4 (8 pts), loops 3 (4 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 9). Of this number, 15 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":"packages/cli/src/lib/reconstruction-reader.ts"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c593e04625ded52d35fb6e26681368836251c355a9881944e98c51dae095b9"}},{"ruleId":"D2","level":"warning","message":{"text":"requirements.requirementsCommand (cognitive 25): requirements.requirementsCommand has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (14 pts), ternaries 4 (8 pts), boolean chains 2, loops 1 (nesting depth added 7). None of this is in the body itself: all 25 points belong to 2 function items inside it that branch (a function literal at line 22, getTarget). 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/commands/requirements.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a7753096d91dbc2593435207881fb15ccda7897294c7e894f716c55fc4f48c"}},{"ruleId":"D2","level":"warning","message":{"text":"seat.runSeatHandover (cognitive 25): seat.runSeatHandover has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 3, error handling 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/commands/seat.ts"},"region":{"startLine":1843}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc68ab3cec9c5435da7a5c38f4652b0fe6143dda48e1ff3f389269ac52c7015b"}},{"ruleId":"D2","level":"warning","message":{"text":"workflow-errors.describeDaemonRejection (cognitive 25): workflow-errors.describeDaemonRejection has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 11 (19 pts), boolean chains 3, if/else 2, 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":"packages/cli/src/commands/workflow-errors.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a6ac0f4c979ca26d4413f0d74dd472c78bfbe52589794943d06c9aaad17933"}},{"ruleId":"D2","level":"warning","message":{"text":"InstallEngine.apply (cognitive 25): InstallEngine.apply has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 3 (6 pts), ternaries 3 (6 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":"packages/daemon/src/domain/install-engine.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a2303eeb172322fa5a58eed7e61b30edeade205f4293fd5fd4ba7c4d441381c"}},{"ruleId":"D2","level":"warning","message":{"text":"relay-inbound.createRelayInboundHandler.listOutbox (cognitive 25): relay-inbound.createRelayInboundHandler.listOutbox has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 4, ternaries 2 (4 pts), error handling 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/daemon/src/domain/gateway/relay-inbound.ts"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a9fa3e8111126b39cc03c60f61c1f1ab4a7d9db780d8c3c8a44cc411737399"}},{"ruleId":"D2","level":"warning","message":{"text":"slack-recovery.threadOrder (cognitive 25): slack-recovery.threadOrder has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 8 (14 pts), if/else 6 (9 pts), boolean chains 2 (nesting depth added 9). None of this is in the body itself: all 25 points belong to 3 function items inside it that branch (a function literal at line 282, stalledAt, scannedAt). 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/daemon/src/domain/gateway/slack/slack-recovery.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"db0ceaeb758003dedf84d6f1a0784be17eb069e280844d0303ec49af9ae6f485"}},{"ruleId":"D2","level":"warning","message":{"text":"fleet-scopes.readHostScopes (cognitive 25): fleet-scopes.readHostScopes has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 5 (10 pts), boolean chains 3, match/switch 1 (nesting depth added 8). 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, split the body into named stages: move each independent step or branch into 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/daemon/src/domain/hosts/fleet-scopes.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"07dcae5981648e4bcc12cc53a865e8da736c1f12bf5ef5f38681c72df17c2964"}},{"ruleId":"D2","level":"warning","message":{"text":"artifact-pool-helpers.scanArtifactPools (cognitive 25): artifact-pool-helpers.scanArtifactPools has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (15 pts), error handling 2 (6 pts), loops 2 (3 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":"packages/daemon/src/domain/policies/artifact-pool-helpers.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"f25d61f71ff1ab5cec0f6ba73d1a4ebb520414649cb8c5eca8ba809b243f8478"}},{"ruleId":"D2","level":"warning","message":{"text":"SeatHandoverService.deliverRebuildPrimingPacket (cognitive 25): SeatHandoverService.deliverRebuildPrimingPacket has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (11 pts), loops 3 (6 pts), boolean chains 3, ternaries 1 (3 pts), error handling 1 (2 pts) (nesting depth added 7). 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/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":1607}}}],"partialFingerprints":{"codehealthFindingId/v1":"b83c3ea9953abc0dc81dc093d27ed360c8fc7bf3d7b90666f52697184be677c2"}},{"ruleId":"D2","level":"warning","message":{"text":"claude-seat-switch.checkClaudeSeat (cognitive 25): claude-seat-switch.checkClaudeSeat has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 8 (10 pts), boolean chains 3 (nesting depth added 5). 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, 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/daemon/src/domain/provider/claude-seat-switch.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff6fbe5c2bcfcd5a22c82b00403f39f265c3c63ba32c4523385f8d346355066f"}},{"ruleId":"D2","level":"warning","message":{"text":"HerdrAppProvider.reconcileState (cognitive 25): HerdrAppProvider.reconcileState has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 4, loops 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/daemon/src/domain/terminal/herdr-app-provider.ts"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa23691ae9d320b1c139e492837175f03c312da60460b9f453b37b6a79353bcd"}},{"ruleId":"D2","level":"warning","message":{"text":"seat.seatRoutes.post(\u0022/set-runtime/:seatRef\u0022) (cognitive 25): seat.seatRoutes.post(\u0022/set-runtime/:seatRef\u0022) has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 11 (13 pts), boolean chains 6, if/else 6 (nesting depth added 2). Of this number, 22 points are the body\u0027s own statements and 3 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/routes/seat.ts"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3fa68abedfd3fed431052e272ab39933c3b4b8a3a0e24f64bc093f6a0234c66"}},{"ruleId":"D2","level":"warning","message":{"text":"workspace.workspaceRoutes (cognitive 25): workspace.workspaceRoutes has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 11 (13 pts), boolean chains 5, if/else 4 (5 pts), error handling 2 (nesting depth added 3). None of this is in the body itself: all 25 points belong to 2 function literals inside it that branch (lines 85, 37). 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/daemon/src/routes/workspace.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ce6842348c4e7fb67491aaf52e745f34ff6c9c9f42de17b2345c01558f0322"}},{"ruleId":"D2","level":"warning","message":{"text":"views.viewsRoutes (cognitive 25): views.viewsRoutes has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 4 (10 pts), if/else 9, boolean chains 3, error handling 3 (nesting depth added 6). None of this is in the body itself: all 25 points belong to 5 function items inside it that branch (errorResponse, a function literal at line 113, a function literal at line 42, \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/daemon/src/routes/views.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"93fe8cbb0947920ee32dc3a707b59078d500acbc1103591c0aa5738c905dd011"}},{"ruleId":"D2","level":"warning","message":{"text":"scopes-model.proofProvenanceLines (cognitive 25): scopes-model.proofProvenanceLines has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 5 (8 pts), ternaries 2 (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":"packages/tui/src/scopes/scopes-model.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"13beff6125bdd415deaab88bd7e57d237beac5251718c903aa4e95c079395e4c"}},{"ruleId":"D2","level":"warning","message":{"text":"registry.resourceNames (cognitive 25): registry.resourceNames has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 4 (11 pts), ternaries 1 (nesting depth added 15). 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":"packages/tui/src/commands/registry.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6a984793f80181f07df066516b77295ea29a0308fccb7cffce712118b7949d"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectMetaPrimitives.eventToken (cognitive 25): ProjectMetaPrimitives.eventToken has cognitive complexity 25 (threshold 15). Drivers by points: if/else 18, boolean chains 7. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/project/ProjectMetaPrimitives.tsx"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf9197a93292b8a816d8dc2911162cac516fdd69f208d746c84539dd90b6cc53"}},{"ruleId":"D2","level":"warning","message":{"text":"CompactStatusRow.CompactStatusRow (cognitive 25): CompactStatusRow.CompactStatusRow has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 15 (20 pts), boolean chains 3, if/else 2 (nesting depth added 5). Of this number, 23 points are the body\u0027s own statements and 2 belong to 2 function items 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":"packages/ui/src/components/mission-control/components/CompactStatusRow.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d8fa0aecc22f254b6dbeca4db7553a686554fe903725313ab4cf89a470aa933"}},{"ruleId":"D2","level":"warning","message":{"text":"graph-layout.applyTreeLayout (cognitive 25): graph-layout.applyTreeLayout has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 6 (9 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/ui/src/lib/graph-layout.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b2252a39964a7f30056376bb8308e851b8c1479ea7ff0cebcc31a14bb14e8a"}},{"ruleId":"D2","level":"warning","message":{"text":"migrate-telemetry-state-0.5.9.scanLegacy (cognitive 25): migrate-telemetry-state-0.5.9.scanLegacy has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 4, ternaries 2 (4 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":"skills/_canonical/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"efbff1606a23888495cd7d1e1c68a3f6e68c6f729e49cc61d69e08a2fb6bf1c1"}},{"ruleId":"D2","level":"warning","message":{"text":"claude-auto-mode.claudeAutoModeStatus (cognitive 24): claude-auto-mode.claudeAutoModeStatus has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 10 (15 pts), boolean chains 4, if/else 4, 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":"packages/daemon/src/domain/claude-auto-mode.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"82494c91cddfb779acd7bf7af633d36a84a8233ad8b68faf32dc0509a9762282"}},{"ruleId":"D2","level":"warning","message":{"text":"pi-runner-protocol.buildPiChildEnv (cognitive 24): pi-runner-protocol.buildPiChildEnv has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 2 (3 pts), ternaries 2 (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":"packages/daemon/src/adapters/pi-runner-protocol.ts"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c9b3c88750c49f3cfa1444a89fd37be1b7bcfec53f6aed82fec62aa10a1f35"}},{"ruleId":"D2","level":"warning","message":{"text":"native-process-lineage.candidatesMatching (cognitive 24): native-process-lineage.candidatesMatching has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 5, ternaries 3 (4 pts), loops 2 (3 pts) (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":"packages/daemon/src/domain/native-process-lineage.ts"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e1dabf8081a84f52c31b098decdae57ff41c557edcd1d1f7badb2163537cec"}},{"ruleId":"D2","level":"warning","message":{"text":"remote-daemon-http.remoteJsonRequest (cognitive 24): remote-daemon-http.remoteJsonRequest has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (15 pts), ternaries 2 (4 pts), boolean chains 3, error handling 2 (nesting depth added 5). Of this number, 22 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/daemon/src/domain/hosts/remote-daemon-http.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"9104f3fd3af8d55291417b7b4be2c881c54c1609e244a6c192e9e1b27d987122"}},{"ruleId":"D2","level":"warning","message":{"text":"quiet-hold-custody.quietHoldCustody (cognitive 24): quiet-hold-custody.quietHoldCustody has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 7, ternaries 3, error handling 1, loops 1 (nesting depth added 3). Of this number, 23 points are the body\u0027s own statements and 1 belongs 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":"packages/daemon/src/domain/quiet-hold-custody.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f59a162d5e431b9719a1be7456f5ac8bcca98d96bde5d04db26538a30af392"}},{"ruleId":"D2","level":"warning","message":{"text":"relay-outbound.renderPlainTextBody (cognitive 24): relay-outbound.renderPlainTextBody has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 2 (8 pts), loops 2 (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/daemon/src/domain/gateway/relay-outbound.ts"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"183d4b157a9163403e37c11753e57713bc548865ce625e39ce0b3a5b900690b9"}},{"ruleId":"D2","level":"warning","message":{"text":"harness-not-started-notice.noticeHarnessNotStarted (cognitive 24): harness-not-started-notice.noticeHarnessNotStarted has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 3 (7 pts), boolean chains 4, error handling 1 (2 pts), loops 2 (nesting depth added 9). Of this number, 22 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/daemon/src/domain/harness-not-started-notice.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"d224d96b7a7d5af8ef7b4a32914780d63ac362a9f4e50c9c88f3578257234ac8"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigStore.reset (cognitive 24): ConfigStore.reset has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 4, error handling 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/config-store.ts"},"region":{"startLine":1743}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab90b2a584f8ce28b528001de80eda1f11865ae63735086b10a2fb7917c3a599"}},{"ruleId":"D2","level":"warning","message":{"text":"daemon-lifecycle.waitForKernelReady (cognitive 24): daemon-lifecycle.waitForKernelReady has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 3, error handling 1 (2 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":"packages/cli/src/daemon-lifecycle.ts"},"region":{"startLine":1520}}}],"partialFingerprints":{"codehealthFindingId/v1":"86bf362625c417bded6de781efe039eb8c7a8438b96b6f6f3d256650b0d62b88"}},{"ruleId":"D2","level":"warning","message":{"text":"reconstruction-reader.reconstructionOutput (cognitive 24): reconstruction-reader.reconstructionOutput has cognitive complexity 24 (threshold 15). Drivers by points: loops 5 (13 pts), if/else 5 (8 pts), boolean chains 2, ternaries 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, 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":"packages/cli/src/lib/reconstruction-reader.ts"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ff7614c4242af3c2d1985ddab338500a9cf4aad897f4cd54e428e57741bd24"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp-server.requestsAdvisoryFor (cognitive 24): mcp-server.requestsAdvisoryFor has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 7 (11 pts), if/else 7, boolean chains 5, error handling 1 (nesting depth added 4). 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: 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/mcp-server.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6d1ee05b148b2058ae0e9872670ff8f5fbc15b6da20a94a9e025ec7e4a3d53"}},{"ruleId":"D2","level":"warning","message":{"text":"setup.routerLineStep (cognitive 24): setup.routerLineStep has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 8 (16 pts), if/else 3 (4 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/commands/setup.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"7501bd4a0e31a4a27b24ab6daac1ae2108bd3d45a8d65ca50bcc5af48d682ab3"}},{"ruleId":"D2","level":"warning","message":{"text":"DecisionRun.decide (cognitive 24): DecisionRun.decide has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (14 pts), ternaries 4 (6 pts), boolean chains 3, 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/cli/src/decisions/decisions.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff143d1bd5ce16b9ca2b5d467b5b9c471cc4aeabf13841c8f21b725f8fa14dc"}},{"ruleId":"D2","level":"warning","message":{"text":"progress-edit.addProgressRow (cognitive 24): progress-edit.addProgressRow has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 5 (6 pts), boolean chains 3, ternaries 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/lib/scope/progress-edit.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc467e3aed451f9d26ea878b0b2afef5ee4e5297bd0b3884dc393a997c45fde"}},{"ruleId":"D2","level":"warning","message":{"text":"capability-delta.capabilityDeltaExpiryFindings (cognitive 24): capability-delta.capabilityDeltaExpiryFindings has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (8 pts), error handling 4 (7 pts), ternaries 3 (6 pts), boolean chains 2, 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/lib/scope/capability-delta.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4bc80ae6e18c37d0a68e14966c53bd2413f86f86aea4b5358d5885b5b71dfb6"}},{"ruleId":"D2","level":"warning","message":{"text":"transcript.renderTranscript (cognitive 24): transcript.renderTranscript has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (6 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/cli/src/commands/transcript.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"b02efeb07fc067b7b62156a268d0e1c3857b84bbbf06a9b36a3c7fc4f0462488"}},{"ruleId":"D2","level":"warning","message":{"text":"activity-relay.buildOpenRigPayload (cognitive 24): activity-relay.buildOpenRigPayload has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 6 (10 pts), boolean chains 8, error handling 2 (4 pts), if/else 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/daemon/assets/plugins/openrig-core/hooks/scripts/activity-relay.cjs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"3feea7829df8044e6fe09df1903801b2d1779478fcec13ab7fd8d2a06864909e"}},{"ruleId":"D2","level":"warning","message":{"text":"activity-relay.wallClockReset (cognitive 24): activity-relay.wallClockReset has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 4, loops 1 (2 pts), ternaries 2, error handling 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/daemon/assets/plugins/openrig-core/hooks/scripts/activity-relay.cjs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed6f85841b109cf2d441d31f4d352284d4779f49263c5845f3c9b37c8888dd1"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeCodeAdapter.provisionManagedBootstrap (cognitive 24): ClaudeCodeAdapter.provisionManagedBootstrap has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 5 (7 pts), error handling 2 (4 pts), boolean chains 3, 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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":1144}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f62a220e3eebbfaf4f1d6c19d7503f41a4d6c89623c8899f188236316b9f5ce"}},{"ruleId":"D2","level":"warning","message":{"text":"stub-runner.executeStubScript (cognitive 24): stub-runner.executeStubScript has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 2 (4 pts), boolean chains 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/daemon/src/adapters/stub-runner.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c60968b453953257914f377b34b25ac117aa56ce0998839140342a66f7296e2"}},{"ruleId":"D2","level":"warning","message":{"text":"continuity-policy-materializer.armContinuityPolicy (cognitive 24): continuity-policy-materializer.armContinuityPolicy has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 10, if/else 6 (8 pts), ternaries 2 (4 pts), loops 2 (nesting depth added 4). Most of this is not in the body itself: 10 of the 24 points are its own statements and the rest belongs to 9 function items inside it that branch (retireUnexpected, isCurrentShapeCandidate, a function literal at line 319, \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/daemon/src/domain/continuity-policy-materializer.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd3d505b1fcc88522bbb06c8ec13511648e6e758fb26087bfa7b9c1a0c99822f"}},{"ruleId":"D2","level":"warning","message":{"text":"PodRigInstantiator.instantiateOnce::cleanup (cognitive 24): PodRigInstantiator.instantiateOnce::cleanup has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (15 pts), error handling 2 (5 pts), boolean chains 2, loops 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. This shape REPEATS in the file: one other method here (PodRigInstantiator.instantiateOnce) 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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":1859}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82e040cfd5c8b1624fe148926a470e8ae8a2ffdd10fd9de60123b26301b195c"}},{"ruleId":"D2","level":"warning","message":{"text":"profile-source-resolver.makeProfileReadFile.\u003Creturned closure\u003E (cognitive 24): profile-source-resolver.makeProfileReadFile.\u003Creturned closure\u003E has cognitive complexity 24 (threshold 15). Drivers by points: error handling 5 (9 pts), ternaries 3 (6 pts), if/else 4 (5 pts), boolean chains 4 (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/daemon/src/domain/context-packs/profile-source-resolver.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ef287a7037e70fb30deb72e733157482f1c626d94d03567b7554e0ed221eb7"}},{"ruleId":"D2","level":"warning","message":{"text":"current-work.parseCreateScopeTags (cognitive 24): current-work.parseCreateScopeTags has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 2, boolean chains 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/daemon/src/domain/current-work.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe84e4fdc9596e533ebf0f57fe8eec748602ccda4e564f90bd172c94c3e16a3"}},{"ruleId":"D2","level":"warning","message":{"text":"FileWriteService.writeAtomic (cognitive 24): FileWriteService.writeAtomic has cognitive complexity 24 (threshold 15). Drivers by points: error handling 8 (11 pts), ternaries 4 (8 pts), if/else 3 (4 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/daemon/src/domain/files/file-write-service.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"0279b53e847747931d56780d4ab3513c77bc44e6cf64ff6d70fe9bf3720eeddb"}},{"ruleId":"D2","level":"warning","message":{"text":"guidance-projection.readGuidanceProjection (cognitive 24): guidance-projection.readGuidanceProjection has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 11 (18 pts), boolean chains 2, error handling 2, if/else 1, 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/daemon/src/domain/guidance-projection.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"3497b2dab52f75e812d8ae977bb8efd78233e8a2f537f1c1ad6702571dba1f99"}},{"ruleId":"D2","level":"warning","message":{"text":"usage-series.providerChargeView (cognitive 24): usage-series.providerChargeView has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 7 (18 pts), if/else 2 (3 pts), boolean chains 2, loops 1 (nesting depth added 12). Of this number, 22 points are the body\u0027s own statements and 2 belong to 2 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/daemon/src/domain/usage-series.ts"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a5cf6763e648adbc75db34dc40c831433b911bea9ae77955e597ee53de77cc"}},{"ruleId":"D2","level":"warning","message":{"text":"SeatLifecycleService.setCodexProfile (cognitive 24): SeatLifecycleService.setCodexProfile has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 7, ternaries 6 (7 pts), error handling 1 (nesting depth added 2). Most of this is not in the body itself: 9 of the 24 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 1100, 1114). 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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed14c12fb680fed2a633b9d0b3554d21742ce2ecac12a3741bf35fe040cd9a1"}},{"ruleId":"D2","level":"warning","message":{"text":"claude-token-usage.claudeTokenUsageReader.\u003Creturned closure\u003E (cognitive 24): claude-token-usage.claudeTokenUsageReader.\u003Creturned closure\u003E has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (13 pts), ternaries 3 (5 pts), boolean chains 4, 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":"packages/daemon/src/domain/provider/claude-token-usage.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"7351e9b92d926ade460e556e96320d30dca10a3f2ef0271b283df16ba4853a99"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-usage-windows.normalizeCodexUsage (cognitive 24): codex-usage-windows.normalizeCodexUsage has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 8 (10 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":"packages/daemon/src/domain/provider/codex-usage-windows.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa113f58ed2a2bf1bf2633347d76f58f438203d16f481d406e471bfe1d9c225"}},{"ruleId":"D2","level":"warning","message":{"text":"TerminalService.followView (cognitive 24): TerminalService.followView has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 7, ternaries 3 (4 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/daemon/src/domain/terminal/terminal-service.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ba293020a6c1d5da607ade756fa1f5d6b729dc553670ae5ca4ceaf2ef0351a"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiRigLauncher.launch (cognitive 24): MultiRigLauncher.launch has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 2 (3 pts), error handling 1, ternaries 1 (nesting depth added 10). Of this number, 15 points are the body\u0027s own statements and 9 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/daemon/src/domain/topology/multi-rig-launcher.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"358da26fad872951c3388830201e1cd282f5cd3366e764cc774eb585011262a5"}},{"ruleId":"D2","level":"warning","message":{"text":"transcripts.transcriptRoutes (cognitive 24): transcripts.transcriptRoutes has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13, ternaries 4 (7 pts), boolean chains 3, error handling 1 (nesting depth added 3). None of this is in the body itself: all 24 points belong to 3 function literals inside it that branch (lines 158, 207, 274). 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/daemon/src/routes/transcripts.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8feb730b8f1fc23bd8112602faab04abd166a14f467bfde415b544ecfd2af4"}},{"ruleId":"D2","level":"warning","message":{"text":"proof.proofRoutes::target (cognitive 24): proof.proofRoutes::target has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 5 (9 pts), if/else 7 (8 pts), boolean chains 6, 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":"packages/daemon/src/routes/proof.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"255753d4f02b3f38de20ea67b2254c8dd9c800390496c12008a301ca7614c729"}},{"ruleId":"D2","level":"warning","message":{"text":"index.startServer (cognitive 24): index.startServer has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 4, ternaries 3 (4 pts), loops 1 (nesting depth added 3). Of this number, 18 points are the body\u0027s own statements and 6 belong to 4 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/daemon/src/index.ts"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c9520a4b7c72c26b348994cd33a877e57954789e95fc33dfe954d9d01e3b74"}},{"ruleId":"D2","level":"warning","message":{"text":"scopes-model.wrapText (cognitive 24): scopes-model.wrapText has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 3 (6 pts), boolean chains 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/tui/src/scopes/scopes-model.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd3cc7288ac10e899ee170af8a780382e6b39d06b0ed72cff77568ee3e17c97f"}},{"ruleId":"D2","level":"warning","message":{"text":"pairing.decideOnce (cognitive 24): pairing.decideOnce has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 7 (12 pts), if/else 6, boolean chains 3, error handling 3 (nesting depth added 5). Of this number, 19 points are the body\u0027s own statements and 5 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/tui/src/config/pairing.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92e1e2db964616126f888cae13b3543fd33186581b31b50928f2a7d23379916"}},{"ruleId":"D2","level":"warning","message":{"text":"usage-model.seatLines (cognitive 24): usage-model.seatLines has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 6 (12 pts), if/else 8 (9 pts), boolean chains 2, loops 1 (nesting depth added 7). Of this number, 23 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/tui/src/usage/usage-model.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"82dee90c8d6ab1f03ef186daa8e4fc0c91f12463089a7dabf4a703b75184ed70"}},{"ruleId":"D2","level":"warning","message":{"text":"useGlobalEvents.useGlobalEvents (cognitive 24): useGlobalEvents.useGlobalEvents has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 4). None of this is in the body itself: all 24 points belong to 4 function literals inside it that branch (lines 22, 18, 99, \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/ui/src/hooks/useGlobalEvents.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"c138198dd6e6ffb6ea76463009bcfef194c0d7fbd4a3691ef1e258b1f1a52eea"}},{"ruleId":"D2","level":"warning","message":{"text":"migrate-telemetry-state-0.5.9.managedSystemWorldState (cognitive 24): migrate-telemetry-state-0.5.9.managedSystemWorldState has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 9 (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":"skills/_canonical/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb33ce18320c191f49b1e7b3be9620f261fa83646dbb41e902b0f43a725005b4"}},{"ruleId":"D2","level":"warning","message":{"text":"effective-model-readers.piSeatPinReadings (cognitive 23): effective-model-readers.piSeatPinReadings has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 2 (3 pts), ternaries 2 (3 pts), boolean chains 2, error handling 1 (nesting depth added 7). Of this number, 22 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/daemon/src/domain/model-divergence/effective-model-readers.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d984653e93ed3d9efa863f895776489ff2bb2aa1232935d44d5f0986a95a5da"}},{"ruleId":"D2","level":"warning","message":{"text":"ResumeMetadataRefresher.captureCodexThreadId::discover (cognitive 23): ResumeMetadataRefresher.captureCodexThreadId::discover has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 2 (4 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/daemon/src/domain/resume-metadata-refresher.ts"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"d05fe2f0257d629476786e1dba4536ea94030624c693622144623d2e7564737e"}},{"ruleId":"D2","level":"warning","message":{"text":"ActivityGrantStore.bindingMatch (cognitive 23): ActivityGrantStore.bindingMatch has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 12, if/else 8 (9 pts), error handling 1, ternaries 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":"packages/daemon/src/domain/activity-grants.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2250cebbf03eda8f5462600f5d0110635e9e6baabdde99757ac0328cc737da1"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsStore.writeConfig (cognitive 23): SettingsStore.writeConfig has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (11 pts), error handling 3 (6 pts), boolean chains 4, loops 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":"packages/daemon/src/domain/user-settings/settings-store.ts"},"region":{"startLine":1381}}}],"partialFingerprints":{"codehealthFindingId/v1":"07cdb816eb53197c8859169762fac864910e535c2061ee88bd83cac6eb0d1b37"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsStore.reset (cognitive 23): SettingsStore.reset has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 3, error handling 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/daemon/src/domain/user-settings/settings-store.ts"},"region":{"startLine":1528}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f83d55c50be14745fd1d63a28ba1d6b3c99d3be74872c729ec4e68e1c8c8d44"}},{"ruleId":"D2","level":"warning","message":{"text":"skill-catalog.gitState (cognitive 23): skill-catalog.gitState has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 3 (9 pts), if/else 3 (8 pts), loops 2 (3 pts), boolean chains 2, error handling 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/daemon/src/domain/skill-catalog.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62bbfcc3929ea7289bad5977644b92564bacd2a918292aceebeb4eef20e5122"}},{"ruleId":"D2","level":"warning","message":{"text":"seat-skill-storage.writeSeatSkillCatalog (cognitive 23): seat-skill-storage.writeSeatSkillCatalog has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 5, error handling 3 (5 pts), ternaries 2 (4 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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":1090}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e6a9e7c68ad22559be0f223d0de5290f00677ee6bde7ab406813c62506f0b5"}},{"ruleId":"D2","level":"warning","message":{"text":"human-registry.canonicalProjectionSnapshot (cognitive 23): human-registry.canonicalProjectionSnapshot has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (16 pts), ternaries 2 (3 pts), boolean chains 2, error handling 1, loops 1 (nesting depth added 5). 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":"packages/daemon/src/domain/gateway/human-registry.ts"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb6c77b007b802538c9c39f711590189b32dcfb2d0eb88c5b14b008fecf8a5c2"}},{"ruleId":"D2","level":"warning","message":{"text":"slack-api.fetchRecentMessageTexts (cognitive 23): slack-api.fetchRecentMessageTexts has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 5 (8 pts), boolean chains 2, loops 1 (nesting depth added 9). Of this number, 22 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/daemon/src/domain/gateway/slack/slack-api.ts"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d08a2768ac6b6eb6892ce0614581b2dc8fe0d98daec2e7cee1fd0c9d6404db7"}},{"ruleId":"D2","level":"warning","message":{"text":"community-harness-presets.communityHarnessLabel (cognitive 23): community-harness-presets.communityHarnessLabel has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 12 (15 pts), boolean chains 8 (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/daemon/src/domain/community-harness-presets.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c5a98114a35cacd286239a04c9f3551d440f7f47b4ecb93902369bfe0f8d7c"}},{"ruleId":"D2","level":"warning","message":{"text":"relay-outbound.postRelayEnvelope (cognitive 23): relay-outbound.postRelayEnvelope has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 5 (11 pts), if/else 7 (8 pts), boolean chains 3, 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/daemon/src/domain/gateway/relay-outbound.ts"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"7151c0eb08e393a177c89f47e933672aa1c9e1c080c7d42397eee4b38ffc7549"}},{"ruleId":"D2","level":"warning","message":{"text":"QueueRepository.recordWatchdogWakeAttempt (cognitive 23): QueueRepository.recordWatchdogWakeAttempt has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 3, ternaries 2 (3 pts), loops 1 (nesting depth added 8). Most of this is not in the body itself: 4 of the 23 points are its own statements and the rest belongs to 2 function items inside it that branch (a function literal at line 4408, recordFired). 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":4363}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae0b162c99a773199665324da676351154b06ff3f6abf72e6f373de7e9f82247"}},{"ruleId":"D2","level":"warning","message":{"text":"session-transport.findCurrentPiDialog (cognitive 23): session-transport.findCurrentPiDialog has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 7, loops 2 (3 pts), ternaries 1 (nesting depth added 7). Of this number, 22 points are the body\u0027s own statements and 1 belongs 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c2fdda42eed085d2ddadca3820a253cc403764ab8dc3fc79045b709eb242e3f"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeCompactionEnforcer.deliverPreparation (cognitive 23): ClaudeCompactionEnforcer.deliverPreparation has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 9, error handling 1, ternaries 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":1706}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac3175e1c2b5f03996ae2e4ad91f5b471b18857d41829e215318947ad9b22059"}},{"ruleId":"D2","level":"warning","message":{"text":"whoami.runCrossHostWhoami (cognitive 23): whoami.runCrossHostWhoami 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":"packages/cli/src/commands/whoami.ts"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"07538944c392a5186c891ef779cb94fcf346f5f78cb567ab966c18cbddf22d20"}},{"ruleId":"D2","level":"warning","message":{"text":"broadcast.broadcastCommand (cognitive 23): broadcast.broadcastCommand has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 6, error handling 1 (2 pts) (nesting depth added 3). None of this is in the body itself: all 23 points belong to one function literal inside it that branches (line 61). 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/commands/broadcast.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa837b351cac387ddf860a69441af7ca7b91a6960cc857500133b902c7cb1fa7"}},{"ruleId":"D2","level":"warning","message":{"text":"capture.captureCommand (cognitive 23): capture.captureCommand has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 2, ternaries 2 (nesting depth added 4). None of this is in the body itself: all 23 points belong to one function literal inside it that branches (line 222). 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/commands/capture.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"df6dfa95c435c40c6f7a44affbf653558ebb232e0425bd0195ce7b8a6ab44975"}},{"ruleId":"D2","level":"warning","message":{"text":"config-init-workspace.initWorkspaceCommand.cmd (cognitive 23): config-init-workspace.initWorkspaceCommand.cmd has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 3 (9 pts), loops 2 (4 pts), error handling 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/commands/config-init-workspace.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0249c55d5d540144375ccdbe2b46eafda096e8ed93c9cc63578c6367ecb3642"}},{"ruleId":"D2","level":"warning","message":{"text":"recap-seat.resolveRecapSeat (cognitive 23): recap-seat.resolveRecapSeat has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 8 (11 pts), if/else 7 (8 pts), boolean chains 4 (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":"packages/cli/src/recap-seat.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"81376b03334dfd9f10ce9b37e643ae05e140265c9e0e44c069fda83e193146a1"}},{"ruleId":"D2","level":"warning","message":{"text":"network.networkCommand (cognitive 23): network.networkCommand has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11, ternaries 4 (6 pts), loops 2 (3 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 4). None of this is in the body itself: all 23 points belong to 9 function items inside it that branch (a function literal at line 100, a function literal at line 122, finish, \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/commands/network.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a53063cf79c1bd61e58314691e8625c11eddd33219ef855801b413e0ab23db"}},{"ruleId":"D2","level":"warning","message":{"text":"release.releaseCommand (cognitive 23): release.releaseCommand has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (13 pts), ternaries 5 (6 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 5). None of this is in the body itself: all 23 points belong to 2 function items inside it that branch (a function literal at line 26, getClient). 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/commands/release.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8fe42bd63766e3c659582c102a2671094cabec4ec2d6093d69992b10b5678e4"}},{"ruleId":"D2","level":"warning","message":{"text":"scope.buildSliceCreateCommand (cognitive 23): scope.buildSliceCreateCommand has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 2 (3 pts), error handling 2, boolean chains 1, ternaries 1 (nesting depth added 8). None of this is in the body itself: all 23 points belong to one function literal inside it that branches (line 334). 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/commands/scope.ts"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d0c85625e8b83071caf6c76317f1e38cbf86d3057b9904f43a3185dfdace205"}},{"ruleId":"D2","level":"warning","message":{"text":"precompact-hook.readClaudeCompactionMessage (cognitive 23): precompact-hook.readClaudeCompactionMessage has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 4, error handling 2 (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":"packages/daemon/assets/plugins/openrig-core/skills/claude-compaction-restore/scripts/precompact-hook.mjs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e873ba028e0153248629b129ba6dd0b49762af47a5782e13663b4fea8f511ba"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentImageLibraryService.install (cognitive 23): AgentImageLibraryService.install has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 4 (5 pts), error handling 2 (3 pts), boolean chains 2, ternaries 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/agent-images/agent-image-library-service.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b8a9c8114c35515e4c4f529711c36dbdf5958406a4c58dd81a4430c225d21e"}},{"ruleId":"D2","level":"warning","message":{"text":"bundle-integrity.verifyIntegrity (cognitive 23): bundle-integrity.verifyIntegrity has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 3, ternaries 1 (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/daemon/src/domain/bundle-integrity.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff352a419945d87a26a271fd877388f252c6a38f58ac1969b8e8e442fecad1f"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkflowInstanceStore.create (cognitive 23): WorkflowInstanceStore.create has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 13 (16 pts), if/else 6, boolean chains 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/daemon/src/domain/workflow-instance-store.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c7ecd7cbdfd7e7a6bdf1942d7838ecda92ff8558495018eccbc2a0340bd9b8"}},{"ruleId":"D2","level":"warning","message":{"text":"pi-usage-entries-store.validPiProviderCharge (cognitive 23): pi-usage-entries-store.validPiProviderCharge has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 11, if/else 8, ternaries 4. Of this number, 18 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/daemon/src/domain/pi-usage-entries-store.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"075233af3db85ce9001e8d98829dced49c1982c570bcb75d4a9a3b6a528f97fa"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeUsageWindows.project (cognitive 23): ClaudeUsageWindows.project has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 8 (17 pts), if/else 3, boolean chains 1, error handling 1, 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/daemon/src/domain/provider/claude-usage-windows.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"026087ce28f1f5973ef7e2ddbca687e900aaea399950e3316e8f925e2b332a1a"}},{"ruleId":"D2","level":"warning","message":{"text":"queue-erasure.walkEvents (cognitive 23): queue-erasure.walkEvents has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 3 (6 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/daemon/src/domain/queue-erasure.ts"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb3aea2a32a5187dfd0272eaf1fd09703716d443aa21e3702a16cb3222bd8260"}},{"ruleId":"D2","level":"warning","message":{"text":"queue-erasure.neverMemberGuard.\u003Creturned closure\u003E (cognitive 23): queue-erasure.neverMemberGuard.\u003Creturned closure\u003E has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 9). Of this number, 21 points are the body\u0027s own statements and 2 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/daemon/src/domain/queue-erasure.ts"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec9fbdfda6e349d2dcc8957bf419523e38a4c007b2f7832ee46fe7c915a803d"}},{"ruleId":"D2","level":"warning","message":{"text":"RestoreCheckService.validateHostInfraDeclaration (cognitive 23): RestoreCheckService.validateHostInfraDeclaration has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 7 (8 pts), boolean chains 7 (nesting depth added 2). 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: 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/daemon/src/domain/restore-check-service.ts"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"3496392fa7d8dda12b45a9cd746481696f3838559d1e85bada8aeee8a6becfae"}},{"ruleId":"D2","level":"warning","message":{"text":"HerdrAppProvider.remove (cognitive 23): HerdrAppProvider.remove has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 10). Of this number, 18 points are the body\u0027s own statements and 5 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/daemon/src/domain/terminal/herdr-app-provider.ts"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7190a07262f19c66e1d788f22196613a406226082fd2381f76c634fc6bad7f"}},{"ruleId":"D2","level":"warning","message":{"text":"watchdog-delivery-receipts.withWatchdogReceipts::reconcile (cognitive 23): watchdog-delivery-receipts.withWatchdogReceipts::reconcile has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 5, 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/daemon/src/domain/watchdog-delivery-receipts.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"4450ef9f16c939fc601f29ea29850ba57a9924294314dbec006de47bc12d020f"}},{"ruleId":"D2","level":"warning","message":{"text":"packages.packagesRoutes.post(\u0022/install\u0022) (cognitive 23): packages.packagesRoutes.post(\u0022/install\u0022) has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (9 pts), ternaries 8 (9 pts), boolean chains 3, error handling 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":"packages/daemon/src/routes/packages.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9400ef849cc2b319adfc23100d93fa6fda289b7a7707248f64aa2cc2dd2051"}},{"ruleId":"D2","level":"warning","message":{"text":"scopes-model.scopeIdentityLines (cognitive 23): scopes-model.scopeIdentityLines has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 11 (15 pts), if/else 6, 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":"packages/tui/src/scopes/scopes-model.ts"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4292f20b481785dce4a53502a284db6f9d860e8387f29f3af9b2ad6fcbead54"}},{"ruleId":"D2","level":"warning","message":{"text":"render.wrapContentLines (cognitive 23): render.wrapContentLines has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (10 pts), ternaries 3 (9 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":"packages/tui/src/render.ts"},"region":{"startLine":1813}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d108d778dabe86c14cf24e6540b4a1413851e639724fdc3667478ff6b9836f0"}},{"ruleId":"D2","level":"warning","message":{"text":"keys.resolveCrashCartKey (cognitive 23): keys.resolveCrashCartKey has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 4 (10 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":"packages/tui/src/crash-cart/keys.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"0531f052cfbd09ed47ed1708346ed418b95b7c4f9fe123871697fd3b4873b948"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkdownViewer.renderInline (cognitive 23): MarkdownViewer.renderInline has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 2, loops 1 (nesting depth added 11). Of this number, 22 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/ui/src/components/markdown/MarkdownViewer.tsx"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"c576a5e48966c97cd81a169a9b882038b4dd0037be5b373efba37d7f5410815d"}},{"ruleId":"D2","level":"warning","message":{"text":"BundleInspector.BundleInspector (cognitive 23): BundleInspector.BundleInspector has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 21, if/else 1, ternaries 1. Of this number, 22 points are the body\u0027s own statements and 1 belongs 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/ui/src/components/BundleInspector.tsx"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aab2701efbcb5702f54fa7957f2a8aabad127c90b7ce7d312991771c4df8bb9"}},{"ruleId":"D2","level":"warning","message":{"text":"AuditHistoryView.AuditHistoryView (cognitive 23): AuditHistoryView.AuditHistoryView has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 5 (14 pts), boolean chains 8, if/else 1 (nesting depth added 9). Most of this is not in the body itself: 11 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 142, a function literal at line 20, a function literal at line 21, \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/ui/src/components/mission-control/views/AuditHistoryView.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbfc7b57d113966d4d2803ecce6b66489f823686fb08883b194034e09f4e3d3b"}},{"ruleId":"D2","level":"warning","message":{"text":"migrate-telemetry-state-0.5.9.validateLegacySources (cognitive 23): migrate-telemetry-state-0.5.9.validateLegacySources has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 5, loops 4 (5 pts), ternaries 2 (3 pts) (nesting depth added 6). 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 into named stages: move each independent step or branch into 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/_canonical/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"08bd432c5e857385e2e10e84fc9eb754a8fa043eb39fc331fa7a0407661e40f0"}},{"ruleId":"D2","level":"warning","message":{"text":"EventBus.discardOnThrow (cognitive 22): EventBus.discardOnThrow has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (6 pts), boolean chains 2, ternaries 2, error handling 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/daemon/src/domain/event-bus.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e332da7054f6bbb5a9db28b6a5168bc4559fe3c8756fee0eb6916b7f6a9993f"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentActivityStore.recordRunnerObservation (cognitive 22): AgentActivityStore.recordRunnerObservation has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 8, ternaries 1 (3 pts), error handling 1 (nesting depth added 4). Most of this is not in the body itself: 3 of the 22 points are its own statements and the rest belongs to one function literal inside it that branches (line 224). 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/daemon/src/domain/agent-activity-store.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"913595cf026ee485856abdfc0b58677100f9d4e8722b017292b67aebeba03f8a"}},{"ruleId":"D2","level":"warning","message":{"text":"pi-runner-protocol.buildPiRunnerCommand (cognitive 22): pi-runner-protocol.buildPiRunnerCommand has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (10 pts), ternaries 4 (6 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/adapters/pi-runner-protocol.ts"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"6360c77748096ecc628806f14670240c155dc23772f3e02fba33bdfb94b66c6e"}},{"ruleId":"D2","level":"warning","message":{"text":"seat-effort.emittedEffortFromArgv (cognitive 22): seat-effort.emittedEffortFromArgv has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 1, loops 1, ternaries 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/daemon/src/domain/seat-effort.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"7103b9401afc996ffdfe89dd5a38ec9f70d117338c9cef6f9f7be07ce0fa3b44"}},{"ruleId":"D2","level":"warning","message":{"text":"native-process-lineage.directClaudeChildren (cognitive 22): native-process-lineage.directClaudeChildren has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 4, loops 2 (3 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/daemon/src/domain/native-process-lineage.ts"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc8de2d24b027146538185e3c0289e62551d0d7f0f01f8c0c75bc212e10c2737"}},{"ruleId":"D2","level":"warning","message":{"text":"permission-drift.inspectClaude (cognitive 22): permission-drift.inspectClaude has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9, boolean chains 5, ternaries 4 (5 pts), error handling 3 (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/daemon/src/domain/permission-drift.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ca3a1360c1592aa303dacd7c46aebede6a21e0996d4c635af8881cd44e538b"}},{"ruleId":"D2","level":"warning","message":{"text":"skill-catalog.findDirectPluginCopies (cognitive 22): skill-catalog.findDirectPluginCopies has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 2, error handling 1 (2 pts), loops 2 (nesting depth added 8). Of this number, 19 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/daemon/src/domain/skill-catalog.ts"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"23740d2b5308f729dbaa5363c0953c459852f5b8ef4174d9e921916497b13911"}},{"ruleId":"D2","level":"warning","message":{"text":"bot-inbox.botInboxProblems (cognitive 22): bot-inbox.botInboxProblems has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12, boolean chains 10. Most of this is not in the body itself: 8 of the 22 points are its own statements and the rest belongs to one function literal inside it that branches (line 46). 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/daemon/src/domain/gateway/slack/bot-inbox.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2a44a2eb93161100527918199ef0e7db3252eaac4f38ee89e8b9969bac67c7"}},{"ruleId":"D2","level":"warning","message":{"text":"quiet-release.runQuietRelease (cognitive 22): quiet-release.runQuietRelease has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 5, ternaries 1 (2 pts), error handling 1, loops 1 (nesting depth added 6). 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/daemon/src/domain/policies/quiet-release.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"129b2a2b1c2a03bdb6ba6fc433dcdb9d9b42d0567e4c03526c47c602d8a6246d"}},{"ruleId":"D2","level":"warning","message":{"text":"QueueRepository.propagateBlockerCompletion (cognitive 22): QueueRepository.propagateBlockerCompletion has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 4 (10 pts), if/else 4 (8 pts), boolean chains 3, 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":4209}}}],"partialFingerprints":{"codehealthFindingId/v1":"06aa9f856b207336b620545b0ae03cdf8e363edc73fb27bb204608fb46dd1655"}},{"ruleId":"D2","level":"warning","message":{"text":"QueueRepository.currentDeliveryEpisode (cognitive 22): QueueRepository.currentDeliveryEpisode has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 8 (14 pts), if/else 5 (6 pts), boolean chains 2 (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":"packages/daemon/src/domain/queue-repository.ts"},"region":{"startLine":5710}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f64c0f90f245841c781e010b8686d1e787725c1a91baa68bfa43be652483721"}},{"ruleId":"D2","level":"warning","message":{"text":"EnvironmentStartup.retainedResume (cognitive 22): EnvironmentStartup.retainedResume has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 10 (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/daemon/src/domain/environment-startup.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef6697aed619419ce2abac6c00fbd70f1803785471c2f97051dd56cf49f459b"}},{"ruleId":"D2","level":"warning","message":{"text":"check-runner.submitAsk (cognitive 22): check-runner.submitAsk has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 4, ternaries 2, loops 1 (nesting depth added 1). Of this number, 21 points are the body\u0027s own statements and 1 belongs to 3 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":"docs/reference/runner-conformance/check-runner.mjs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a988fdf077feff84e514ce0af166b5b70a381b4399b83ed84e8c95c37c55cc"}},{"ruleId":"D2","level":"warning","message":{"text":"queue-artifact.codeResultOf (cognitive 22): queue-artifact.codeResultOf has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 10, if/else 7 (8 pts), ternaries 2, error handling 1, loops 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":"packages/cli/src/queue-artifact.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"4834fc8dbe1ccaf6093ae4a86051631c7b001ae35e73bd33d53d6f5c1f857578"}},{"ruleId":"D2","level":"warning","message":{"text":"claude-transcript-parser.walkClaudeContent (cognitive 22): claude-transcript-parser.walkClaudeContent has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 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":"packages/cli/src/restore-packet/claude-transcript-parser.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a42d59034f1bd65d74a550d69ed6f3b07231c32470f610f72f2a457bb392ac"}},{"ruleId":"D2","level":"warning","message":{"text":"terminal-window.defaultWindowDeps.columns (cognitive 22): terminal-window.defaultWindowDeps.columns has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 7, if/else 5 (7 pts), error handling 3 (4 pts), ternaries 1 (3 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/cli/src/terminal-window.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e13ab47913296ec3faa66477f3b9b7628f5a68b2ae6fc4509453a8c6426261"}},{"ruleId":"D2","level":"warning","message":{"text":"terminal-window.openTerminalWindow::measureWindow (cognitive 22): terminal-window.openTerminalWindow::measureWindow has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 5, ternaries 2 (5 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. This shape REPEATS in the file: one other method here (terminal-window.openTerminalWindow) 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/terminal-window.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"9449ea288417d625a7ae355e06510071960194f18249efb1a5b75cd225ff0c70"}},{"ruleId":"D2","level":"warning","message":{"text":"pi-runner.readPiSessionEntryIds (cognitive 22): pi-runner.readPiSessionEntryIds has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 4, loops 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":"packages/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ddd118962c21c981dd22dc821c435f1ed8f2e4c9b6e0391c965ab83b4dc7af"}},{"ruleId":"D2","level":"warning","message":{"text":"DiscoveryCoordinator.scanOnce (cognitive 22): DiscoveryCoordinator.scanOnce has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (18 pts), 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":"packages/daemon/src/domain/discovery-coordinator.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d020e74e47e3fd5af103c7d9419a0879d50a61104718b82e201462c3160fc4a"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkflowInstanceStore.listFiltered (cognitive 22): WorkflowInstanceStore.listFiltered has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 5 (8 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":"packages/daemon/src/domain/workflow-instance-store.ts"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf99fd0fc30c1600927ac08aac5d8ee2213783a397fe7d4980fd6a8547b8624"}},{"ruleId":"D2","level":"warning","message":{"text":"lifecycle-obligations.lifecycleObligations (cognitive 22): lifecycle-obligations.lifecycleObligations has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 8 (17 pts), boolean chains 3, error handling 1, if/else 1 (nesting depth added 9). Most of this is not in the body itself: 1 of the 22 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 35, 42). 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/daemon/src/domain/lifecycle-obligations.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f3304c322c742a7bf4af76e4781a7970d443d2211f5d7ade5fe2e59038751e"}},{"ruleId":"D2","level":"warning","message":{"text":"feed-perspective.feedPerspective (cognitive 22): feed-perspective.feedPerspective has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 11 (18 pts), boolean chains 3, if/else 1 (nesting depth added 7). 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, split the body into named stages: move each independent step or branch into 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/daemon/src/domain/feed-perspective.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"87cc52e8e2b2baa810ee03122a4c06c808b9f785721170ee7b1324429bd305c2"}},{"ruleId":"D2","level":"warning","message":{"text":"FileWriteService.createAtomic (cognitive 22): FileWriteService.createAtomic has cognitive complexity 22 (threshold 15). Drivers by points: error handling 7 (10 pts), ternaries 4 (8 pts), if/else 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/daemon/src/domain/files/file-write-service.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5cee8da454325ec0449d22891cd823f636d427cc90bdf80eeda8e970c64ef18"}},{"ruleId":"D2","level":"warning","message":{"text":"seat-restart-in-place.parseEffectiveSettings (cognitive 22): seat-restart-in-place.parseEffectiveSettings has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), ternaries 2 (4 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":"packages/daemon/src/domain/seat-restart-in-place.ts"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f7c586d06237d7e77c46046e69259325dde182d98084e4e1d7b712bb439710"}},{"ruleId":"D2","level":"warning","message":{"text":"claude-usage-reader.collectClaudeSignalsFromProviderUsageDirectory (cognitive 22): claude-usage-reader.collectClaudeSignalsFromProviderUsageDirectory has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (9 pts), error handling 3 (6 pts), loops 3 (4 pts), ternaries 2 (3 pts) (nesting depth added 10). 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/daemon/src/domain/provider/claude-usage-reader.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"cded25a24acb3e795bea44b2bb3add13eb9f0f4419b7150a228b1250f4616a0c"}},{"ruleId":"D2","level":"warning","message":{"text":"queue-erasure.eraseQueue::page (cognitive 22): queue-erasure.eraseQueue::page has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 3 (5 pts), ternaries 1 (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. This shape REPEATS in the file: 2 other methods here (queue-erasure.eraseQueue, queue-erasure.eraseQueue::planBatch) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 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/daemon/src/domain/queue-erasure.ts"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9234f18625aeacf465e72488079f0ed2cf42cc3a4ec8bab430b44b5104bc8e6"}},{"ruleId":"D2","level":"warning","message":{"text":"RestoreCheckService.checkSeatReadiness (cognitive 22): RestoreCheckService.checkSeatReadiness has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 6, ternaries 3 (6 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/daemon/src/domain/restore-check-service.ts"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"609b76efd54cf1116808426ba9cd49a516c0aaa577d6f101933c0a6287842e3d"}},{"ruleId":"D2","level":"warning","message":{"text":"RestoreCheckService.buildRecovery (cognitive 22): RestoreCheckService.buildRecovery has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 3 (6 pts), boolean chains 2, loops 1 (nesting depth added 8). 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/daemon/src/domain/restore-check-service.ts"},"region":{"startLine":1587}}}],"partialFingerprints":{"codehealthFindingId/v1":"9070ee6604d7d7565118165df035f9c976a6f474f01119c5de8f4725033678a4"}},{"ruleId":"D2","level":"warning","message":{"text":"RigLifecycleService.releaseRig::release (cognitive 22): RigLifecycleService.releaseRig::release has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 4, loops 2, 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/daemon/src/domain/rig-lifecycle-service.ts"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"5218bf5a48990d3a701c40a9acbde3385fba12565c10e18ca46de2d18b027594"}},{"ruleId":"D2","level":"warning","message":{"text":"RexAgentStatusRelay.reportNow (cognitive 22): RexAgentStatusRelay.reportNow has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 4, loops 2 (3 pts), error handling 1, ternaries 1 (nesting depth added 4). Of this number, 15 points are the body\u0027s own statements and 7 belong to 2 function items 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":"packages/daemon/src/domain/terminal/rex-agent-status.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"98edee259e86a0c57f230c7bf8db20a9da3333d21ec6c41a4f303832dc1b97a7"}},{"ruleId":"D2","level":"warning","message":{"text":"TerminalService.openView (cognitive 22): TerminalService.openView has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 7 (9 pts), if/else 7, boolean chains 4, loops 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/daemon/src/domain/terminal/terminal-service.ts"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade2edfd2aa5c592874bda456a2d0a47247a9041399d82d38a855d040ad480e5"}},{"ruleId":"D2","level":"warning","message":{"text":"activity.submitPermission (cognitive 22): activity.submitPermission has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 4, error handling 2 (3 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/routes/activity.ts"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b06b17f7df6f308394c8dafd7bf6db7d4fb594c3bd1d959bfdb02e257b69b4"}},{"ruleId":"D2","level":"warning","message":{"text":"rigs.rigsRoutes.post(\u0022/:id/up\u0022) (cognitive 22): rigs.rigsRoutes.post(\u0022/:id/up\u0022) has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 4 (6 pts), 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":"packages/daemon/src/routes/rigs.ts"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ffd57e7aa5168d3213d0e700e648ac69cbdee0274c3bc3c77ac163e4871d704"}},{"ruleId":"D2","level":"warning","message":{"text":"startup.createDaemon::topologyDestinationAdvisory (cognitive 22): startup.createDaemon::topologyDestinationAdvisory has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 7, ternaries 1 (2 pts), 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. This shape REPEATS in the file: one other method here (startup.createDaemon) 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/daemon/src/startup.ts"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb1e0f294622aa1cfbb4aa5233ac57c420ad3c59ab71306dc22b679ed221e2cd"}},{"ruleId":"D2","level":"warning","message":{"text":"hatchet.drawEdge (cognitive 22): hatchet.drawEdge has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 3 (9 pts), if/else 5 (8 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 11). Of this number, 11 points are the body\u0027s own statements and 11 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/tui/src/topology/styles/hatchet.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c132e3154e370a2aa4b50afa35645a070d7bb2fc708c8938c5194e0284a134"}},{"ruleId":"D2","level":"warning","message":{"text":"local-reading.localLines (cognitive 22): local-reading.localLines has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 4 (11 pts), if/else 7 (9 pts), loops 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/tui/src/local-reading.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ad2461af7802a5f0a95aaff1f8c6577c1ecf0783fa4252328b046aec356283"}},{"ruleId":"D2","level":"warning","message":{"text":"AppShell.AppShellInner (cognitive 22): AppShell.AppShellInner has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 11, ternaries 6 (7 pts), if/else 4 (nesting depth added 1). Of this number, 17 points are the body\u0027s own statements and 5 belong to 4 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/ui/src/components/AppShell.tsx"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a6c939db052236a9b670958a8bd3c60337ace1efc070f9617574ea67de5b697"}},{"ruleId":"D2","level":"warning","message":{"text":"BootstrapWizard.BootstrapWizard (cognitive 22): BootstrapWizard.BootstrapWizard has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 18, error handling 2, if/else 1, ternaries 1. Of this number, 17 points are the body\u0027s own statements and 5 belong to 7 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/ui/src/components/BootstrapWizard.tsx"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"9394fa71ef7247da0910e20a65690e201cc22a9d8066a431b4afefdab0c99de4"}},{"ruleId":"D2","level":"warning","message":{"text":"SeatOverviewTable.SeatOverviewTable (cognitive 22): SeatOverviewTable.SeatOverviewTable has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 16 (17 pts), boolean chains 5 (nesting depth added 1). Of this number, 19 points are the body\u0027s own statements and 3 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/ui/src/components/SeatOverviewTable.tsx"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"e127b589e69591a46f95e854d9faaa4eecf83fb97fce0e772a17fd43a294a20f"}},{"ruleId":"D2","level":"warning","message":{"text":"startup-submission-evidence.composerRegion (cognitive 21): startup-submission-evidence.composerRegion has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (7 pts), ternaries 5 (7 pts), boolean chains 5, loops 1 (2 pts) (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":"packages/daemon/src/domain/startup-submission-evidence.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"992ed47be30ba2015be63f442b4ecf29533501b2724adf8b4fe07b59fc14ec08"}},{"ruleId":"D2","level":"warning","message":{"text":"PermissionStopObservations.read (cognitive 21): PermissionStopObservations.read has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, ternaries 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":"packages/daemon/src/domain/permission-stop-observation.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"3935d3f5f3a842113e7345d8ef3d43ac1bf2e74406c35d49081eb6baaa9dc3a4"}},{"ruleId":"D2","level":"warning","message":{"text":"process-table.startReader (cognitive 21): process-table.startReader has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). None of this is in the body itself: all 21 points belong to 2 function items inside it that branch (a function literal at line 176, lost). 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/daemon/src/domain/process-table.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"952ab8e462b58a379d6829588f0536aa2767b58ffc7b2d0cda0dea0c9ba5cd88"}},{"ruleId":"D2","level":"warning","message":{"text":"native-process-lineage.codexConversationToken (cognitive 21): native-process-lineage.codexConversationToken has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 2, ternaries 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/daemon/src/domain/native-process-lineage.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c5d2cd0f7c74da806d5e77bf5596d47cce6aa2c03a197f2388b4c667188c96"}},{"ruleId":"D2","level":"warning","message":{"text":"session-name.tmuxFormatChange (cognitive 21): session-name.tmuxFormatChange has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (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":"packages/daemon/src/domain/session-name.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ce04a936cadc3d3472df5e0b3fb214841e8d5cacee09984e101a189542e9d7"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionRegistry.assertAddressAvailable (cognitive 21): SessionRegistry.assertAddressAvailable has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 8, loops 2 (3 pts), ternaries 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/daemon/src/domain/session-registry.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f8735087a03ce28f632a43d1b571d968a3368424008bead982fc9b909c25ec"}},{"ruleId":"D2","level":"warning","message":{"text":"skill-catalog.readOwnershipManifest (cognitive 21): skill-catalog.readOwnershipManifest has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 14, if/else 6, error handling 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/daemon/src/domain/skill-catalog.ts"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"0088125e17a79dcc16ce8bd7bf8a192ba35ddaa6a1eb9f7157c46e73efaa6d6e"}},{"ruleId":"D2","level":"warning","message":{"text":"skill-catalog.retireDirectPluginCopies (cognitive 21): skill-catalog.retireDirectPluginCopies has cognitive complexity 21 (threshold 15). Drivers by points: error handling 5 (8 pts), if/else 5 (8 pts), loops 2, ternaries 1 (2 pts), boolean chains 1 (nesting depth added 7). Of this number, 16 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/daemon/src/domain/skill-catalog.ts"},"region":{"startLine":1352}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f3518399bce0f586c59043ce66d7c6d0bb9478f5327321a5aaba7d51ac62db"}},{"ruleId":"D2","level":"warning","message":{"text":"relay-config.evaluateRelayCandidate (cognitive 21): relay-config.evaluateRelayCandidate has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 4, error handling 1, loops 1, ternaries 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/daemon/src/domain/gateway/relay-config.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"11edf83e4763ed4885ef2c6534f899a82f2e935dc28a81228bc744062a5bdcaa"}},{"ruleId":"D2","level":"warning","message":{"text":"operator-delivery-engine.makeOperatorDeliveryEngine.resolvedFor (cognitive 21): operator-delivery-engine.makeOperatorDeliveryEngine.resolvedFor has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 1, loops 1, ternaries 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/daemon/src/domain/gateway/operator-delivery-engine.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"319ff8743cf55098ec959e01e82df740018672b32ed8db2d59e0f395b1a54380"}},{"ruleId":"D2","level":"warning","message":{"text":"logical-checkbox.parseLogicalCheckboxes (cognitive 21): logical-checkbox.parseLogicalCheckboxes has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 3, loops 1 (nesting depth added 8). 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/daemon/src/domain/scope/logical-checkbox.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb0ad1b3e9c166977e229269567287b2bc1d82b9e0fed24f23b237bbe97293a"}},{"ruleId":"D2","level":"warning","message":{"text":"SliceIndexer.missionAuthoredStatuses (cognitive 21): SliceIndexer.missionAuthoredStatuses has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (4 pts), boolean chains 2, error handling 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/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f862d8a31733a34b3e44d8ecc9e7fd9363145641c267d62cc091d68848c286"}},{"ruleId":"D2","level":"warning","message":{"text":"fresh-occupant-relation.readReadyFreshLaunchFences (cognitive 21): fresh-occupant-relation.readReadyFreshLaunchFences has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (6 pts), ternaries 4 (6 pts), boolean chains 5, error handling 1 (2 pts), loops 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/daemon/src/domain/fresh-occupant-relation.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"08cad71814c8944237f03843ca11957c412de2f2a59f40aceea038610d45b8d7"}},{"ruleId":"D2","level":"warning","message":{"text":"queue-wake-ladder.refusedWatchdogJobs (cognitive 21): queue-wake-ladder.refusedWatchdogJobs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 6 (7 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 4). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 1175, 1179). 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/daemon/src/domain/queue-wake-ladder.ts"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a43e808f94b0ed9414554917a45bd4554ed92d66f3263e097d552aaed3a428"}},{"ruleId":"D2","level":"warning","message":{"text":"queue-repository.listablePullOutboxKeys (cognitive 21): queue-repository.listablePullOutboxKeys has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (7 pts), boolean chains 6, ternaries 2 (4 pts), loops 2 (3 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":6456}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fbac9a518c77e62d33572076b2dfba4a4b4b66d4c0d9e7ddcb035fda132bd82"}},{"ruleId":"D2","level":"warning","message":{"text":"TmuxAdapter.proveSeatScope (cognitive 21): TmuxAdapter.proveSeatScope has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 2, error handling 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":"packages/daemon/src/adapters/tmux.ts"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"e054756210a750255c4a35ddc16149997227979f7408e1bbcd663f4fb2013a37"}},{"ruleId":"D2","level":"warning","message":{"text":"queue-receipt.rowReceipt (cognitive 21): queue-receipt.rowReceipt has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 4 (5 pts), 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":"packages/cli/src/queue-receipt.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ac4dd4c8a966e15c47d5d8aebcd997108d405fbd7b34906b896979a54428578"}},{"ruleId":"D2","level":"warning","message":{"text":"run-on-host.runOnSshHost (cognitive 21): run-on-host.runOnSshHost has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 4, ternaries 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/lib/run-on-host.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"c546606aa0a90acc3156835f6c2a580180eee74c147f4ebad52c0d9e2d58495f"}},{"ruleId":"D2","level":"warning","message":{"text":"bundle-check.checkBundleFolder::startupFiles (cognitive 21): bundle-check.checkBundleFolder::startupFiles has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (6 pts), boolean chains 4 (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. This shape REPEATS in the file: 2 other methods here (bundle-check.checkBundleFolder, bundle-check.checkBundleFolder::agent) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 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/lib/bundle-check.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ba36f31af0740d0965b27a0f3b305f44fce7046cdaed389f32b3b42db40c1e"}},{"ruleId":"D2","level":"warning","message":{"text":"capture.renderCapture (cognitive 21): capture.renderCapture has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 4, ternaries 2 (4 pts), loops 1 (2 pts) (nesting depth added 5). Most of this is not in the body itself: 8 of the 21 points are its own statements and the rest belongs to one function item inside it that branches (note). 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/commands/capture.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"04da198622094e0a7e6fca4fc704782ea2bd43158d5123f1bb6a36324c8f5fc3"}},{"ruleId":"D2","level":"warning","message":{"text":"scope-fs.findSlice (cognitive 21): scope-fs.findSlice has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 1 (4 pts), boolean chains 2, 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/lib/scope/scope-fs.ts"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bdff203793b75ab9b648fdbc8c6a7ef2c4388671a652887160fde2b1ec96947"}},{"ruleId":"D2","level":"warning","message":{"text":"logical-checkbox.parseLogicalCheckboxes (cognitive 21): logical-checkbox.parseLogicalCheckboxes has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 3, loops 1 (nesting depth added 8). 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/lib/scope/logical-checkbox.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"541a1c2e5d19bf7d8954283674ce3122573cf79fb3449704ea8716a807a59676"}},{"ruleId":"D2","level":"warning","message":{"text":"remove.removeCommand (cognitive 21): remove.removeCommand has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 4, ternaries 3 (nesting depth added 3). None of this is in the body itself: all 21 points belong to 2 function items inside it that branch (a function literal at line 23, getClient). 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/commands/remove.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c3eab43b68fad2c5474848a0d9bb154ac1fb77dec5187e6895a6c3223fc1813"}},{"ruleId":"D2","level":"warning","message":{"text":"stream-outcome.streamOutcome (cognitive 21): stream-outcome.streamOutcome has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 10 (12 pts), boolean chains 5, if/else 3, loops 1 (nesting depth added 2). 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: 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/commands/stream-outcome.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"56450d23753aa32233041b2f505523f0c63e65cafcbca63f6a860b79dfc311a2"}},{"ruleId":"D2","level":"warning","message":{"text":"front-door.probeFrontDoor (cognitive 21): front-door.probeFrontDoor has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 4 (6 pts), boolean chains 3, 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":"packages/cli/src/front-door.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f879d72e8bb9ca475b946f718654cb11503c0a93610deeb68d2653a99d88f43"}},{"ruleId":"D2","level":"warning","message":{"text":"local-reading.localRead (cognitive 21): local-reading.localRead has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 6 (12 pts), if/else 4, error handling 2 (3 pts), boolean chains 2 (nesting depth added 7). Most of this is not in the body itself: 7 of the 21 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 21, 38, 25). 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/local-reading.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5654c94d004f3be1fe1a2f4a33498e9e6fd00d8574051b11fe0ac95ec834007"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeCodeAdapter.mergeJsonFragment (cognitive 21): ClaudeCodeAdapter.mergeJsonFragment has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 2 (9 pts), if/else 3 (6 pts), error handling 2 (5 pts), boolean chains 1 (nesting depth added 13). 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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":1085}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ba872dd53c494d914751f3be3edce328ff25bcbecc5f3272b90d3904686f49"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-filesystem-preflight.compareFilesystem (cognitive 21): codex-filesystem-preflight.compareFilesystem has cognitive complexity 21 (threshold 15). Drivers by points: if/else 19 (25 pts), boolean chains 19, ternaries 5 (8 pts), loops 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. This shape REPEATS in the file: one other method here (codex-filesystem-preflight.compareFilesystem::at) 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/daemon/src/domain/codex-filesystem-preflight.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"753566251db38cf334772e5070e45ce61ab59cb8a052793303e32a86f996ab3a"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-runtime-adapter.withoutTomlPath (cognitive 21): codex-runtime-adapter.withoutTomlPath has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (5 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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":3016}}}],"partialFingerprints":{"codehealthFindingId/v1":"c047fa3c987566918f194728b29c9a7058e8c8c58a1ecf56eee159908cd55103"}},{"ruleId":"D2","level":"warning","message":{"text":"seat-runtime-home-record.recordRuntimeHome (cognitive 21): seat-runtime-home-record.recordRuntimeHome has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12, boolean chains 8, ternaries 1. Of this number, 13 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/daemon/src/domain/seat-runtime-home-record.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b504a85adb401a3a22fda54f6e432a8d4950510986b226923f391093c09e3d"}},{"ruleId":"D2","level":"warning","message":{"text":"running-name-guard.confirmStoppedGenerations (cognitive 21): running-name-guard.confirmStoppedGenerations has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (8 pts), ternaries 2 (7 pts), error handling 1 (3 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":"packages/daemon/src/domain/running-name-guard.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f012f57d5c9055506e8410bb595b3ae6bef52226e6a773c430786198b37a1f"}},{"ruleId":"D2","level":"warning","message":{"text":"BootstrapOrchestrator.buildServicePrelaunchHook (cognitive 21): BootstrapOrchestrator.buildServicePrelaunchHook has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 4, ternaries 3 (4 pts), error handling 2 (3 pts) (nesting depth added 4). Most of this is not in the body itself: 10 of the 21 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 944, 950, 962). 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/daemon/src/domain/bootstrap-orchestrator.ts"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc62796d8118e8a8576ecf97c857886abe867f9827a9d460cec6d760a63f9d7b"}},{"ruleId":"D2","level":"warning","message":{"text":"compaction-restore-notice.recoveryRecipient (cognitive 21): compaction-restore-notice.recoveryRecipient has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 2 (4 pts), boolean chains 3 (nesting depth added 6). Of this number, 16 points are the body\u0027s own statements and 5 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/daemon/src/domain/compaction-restore-notice.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ff90d6fe7b159aefaf697c829d9e1e38993e2f4bc7f9c05f19da419d5037bc"}},{"ruleId":"D2","level":"warning","message":{"text":"ContextMonitor.runPoll (cognitive 21): ContextMonitor.runPoll has cognitive complexity 21 (threshold 15). Drivers by points: error handling 3 (11 pts), if/else 3 (7 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/daemon/src/domain/context-monitor.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"a530d6cde72ca7cbaa4a9dda9e0947914acca0943bb4838b15ea1f98d881b2eb"}},{"ruleId":"D2","level":"warning","message":{"text":"current-restore-snapshot.currentRestoreSnapshot (cognitive 21): current-restore-snapshot.currentRestoreSnapshot has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 6, ternaries 2 (nesting depth added 8). 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/daemon/src/domain/current-restore-snapshot.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e502ee0594e478a519f89c760e41d414f454feca427c79d26ec949b3c251ca"}},{"ruleId":"D2","level":"warning","message":{"text":"MissionControlWriteContract.resolveParked (cognitive 21): MissionControlWriteContract.resolveParked has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (7 pts), ternaries 5 (7 pts), boolean chains 4, error handling 2 (3 pts) (nesting depth added 4). 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: 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/daemon/src/domain/mission-control/mission-control-write-contract.ts"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0467bad5f941a0aa9fac3506c24b7b917fabeea43d3d4ecce0bfd617dc692f"}},{"ruleId":"D2","level":"warning","message":{"text":"health-detectors.evaluatePassiveCeremony (cognitive 21): health-detectors.evaluatePassiveCeremony has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 9 (13 pts), boolean chains 8 (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/daemon/src/domain/health-detectors.ts"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"601b4c296f6c5300ba9569a7632e15d738dfd535074426932999e92e82aeed6a"}},{"ruleId":"D2","level":"warning","message":{"text":"PassiveCeremonySource.context (cognitive 21): PassiveCeremonySource.context has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 3, error handling 1 (3 pts), loops 1 (2 pts) (nesting depth added 11). 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/daemon/src/domain/health-passive-ceremony.ts"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca0830116a288164756938e92185ea35c231b6490590ccf2583341daa240feb"}},{"ruleId":"D2","level":"warning","message":{"text":"WatchdogPolicyEngine.deliverHeldGroup (cognitive 21): WatchdogPolicyEngine.deliverHeldGroup has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/watchdog-policy-engine.ts"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db96d17459400b137064bd03ce3dfc87821a967f9ffd1fa3881734073b85cfe"}},{"ruleId":"D2","level":"warning","message":{"text":"PluginVendorService.ensureVendored (cognitive 21): PluginVendorService.ensureVendored has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 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/daemon/src/domain/plugin-vendor-service.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f85cd49a28d874fcb55c417010a010c4097c9f9129ff44e201807d0d5101ba"}},{"ruleId":"D2","level":"warning","message":{"text":"seat-restart-in-place.shellWords (cognitive 21): seat-restart-in-place.shellWords has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (4 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":"packages/daemon/src/domain/seat-restart-in-place.ts"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"10baf0b5c8de93ce1af16a2eab1a5cbf56fe22d3ed57058f52b2edfb874d759b"}},{"ruleId":"D2","level":"warning","message":{"text":"SeatLifecycleService.cleanSeat (cognitive 21): SeatLifecycleService.cleanSeat has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 2 (4 pts), boolean chains 3, loops 3 (nesting depth added 5). 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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":1289}}}],"partialFingerprints":{"codehealthFindingId/v1":"df0caada99878d496b607f9816522eab5d53c067649c3ea588dd337585833872"}},{"ruleId":"D2","level":"warning","message":{"text":"RestoreCheckService.checkRestorePreconditions (cognitive 21): RestoreCheckService.checkRestorePreconditions has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 8 (14 pts), boolean chains 4, if/else 2, error handling 1 (nesting depth added 6). Of this number, 17 points are the body\u0027s own statements and 4 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":"packages/daemon/src/domain/restore-check-service.ts"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad562ec5f380ef68c2ccf1ce80f77808b4c74ebf5eb00c4de52f0417fc2939f"}},{"ruleId":"D2","level":"warning","message":{"text":"RestoreCheckService.hasActivityRelayHook (cognitive 21): RestoreCheckService.hasActivityRelayHook has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 5, ternaries 3 (5 pts), error handling 1 (2 pts) (nesting depth added 5). Most of this is not in the body itself: 6 of the 21 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 1385, 1398). 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/daemon/src/domain/restore-check-service.ts"},"region":{"startLine":1379}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a85e2469de1c88cf071284bef522d19e6e01e5448ca4b7f28fdb57c4444749"}},{"ruleId":"D2","level":"warning","message":{"text":"rig-edge-ops.addRigEdge (cognitive 21): rig-edge-ops.addRigEdge has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 7 (9 pts), boolean chains 6, if/else 6 (nesting depth added 2). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 114, 128). 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/daemon/src/domain/rig-edge-ops.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a231b6a4d02bab352a8da6124fb16ef35266d9942c41381e9df45e4877b5528"}},{"ruleId":"D2","level":"warning","message":{"text":"RigLifecycleService.unclaimSession (cognitive 21): RigLifecycleService.unclaimSession has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8, boolean chains 7, error handling 1 (3 pts), loops 1 (2 pts), ternaries 1 (nesting depth added 3). Of this number, 16 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/daemon/src/domain/rig-lifecycle-service.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff1b867b17bfe1bdf6a4276186d6580d1d9e2cfbead47687276c0c664b70064"}},{"ruleId":"D2","level":"warning","message":{"text":"RigTeardownOrchestrator.cleanupSeatSkills (cognitive 21): RigTeardownOrchestrator.cleanupSeatSkills has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (4 pts), error handling 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":"packages/daemon/src/domain/rig-teardown.ts"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bab9eb10a0e5179ffb7749c3cdfef61cc941dd853a6c75cf0bcef45026805e8"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamIntakeCoordinator.drain (cognitive 21): StreamIntakeCoordinator.drain has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), error handling 3 (5 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/daemon/src/domain/stream-intake.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5c40edbf23ff2934cc367123d8ba36b645cb50a8ffdb8c27bbeeff94942ebd"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamIntakeCoordinator.handleStreamItem (cognitive 21): StreamIntakeCoordinator.handleStreamItem has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (10 pts), error handling 3 (6 pts), boolean chains 5 (nesting depth added 6). Of this number, 18 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/daemon/src/domain/stream-intake.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a55d9d8217aa0a1ec4a93effad600c879f377e11674f2ad2a05e014dcf3940"}},{"ruleId":"D2","level":"warning","message":{"text":"herdr-adapter.reportResumeCommands (cognitive 21): herdr-adapter.reportResumeCommands has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 1 (4 pts), error handling 1 (3 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/terminal/herdr-adapter.ts"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc117d6eb8d6f67508ef623f5d880bcace7de08980404130c5e8cb6c95f4b005"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkflowRuntime.resumeFailureOccurrence (cognitive 21): WorkflowRuntime.resumeFailureOccurrence has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 4, ternaries 4 (nesting depth added 2). Of this number, 13 points are the body\u0027s own statements and 8 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/daemon/src/domain/workflow-runtime.ts"},"region":{"startLine":1395}}}],"partialFingerprints":{"codehealthFindingId/v1":"f339c41670bc75e43ce35c8661951b1bd07f4938a0d43b12ef48492b8282ec94"}},{"ruleId":"D2","level":"warning","message":{"text":"seat.setPermissionsHandler (cognitive 21): seat.setPermissionsHandler has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 5 (11 pts), if/else 7, 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":"packages/daemon/src/routes/seat.ts"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba01e7e260e387db2c7384b9fd459066e523f6054576413440b9ebf5b43c9398"}},{"ruleId":"D2","level":"warning","message":{"text":"state.agentMatches (cognitive 21): state.agentMatches has cognitive complexity 21 (threshold 15). Drivers by points: loops 4 (10 pts), boolean chains 6, if/else 1 (5 pts) (nesting depth added 10). 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":"packages/tui/src/state.ts"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f368f9f26d86dcdaa3b329fc54f7be838f5586fa0f0339b3da736e2710a8cc"}},{"ruleId":"D2","level":"warning","message":{"text":"main.run::executeAct (cognitive 21): main.run::executeAct has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (9 pts), ternaries 4 (9 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. This shape REPEATS in the file: 3 other methods here (main.run, main.run::draw, main.run::handleInput) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 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/tui/src/main.ts"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d43d3a5a12abacb5e29f9ebadda140550ea11cfa72fbc7d7bc96b1a0ae64b5"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkdownViewer.BlockRenderer (cognitive 21): MarkdownViewer.BlockRenderer has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (10 pts), ternaries 5 (10 pts), boolean chains 1 (nesting depth added 7). Of this number, 16 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/ui/src/components/markdown/MarkdownViewer.tsx"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"015037f4487a213e2d2073ae8dcad93cc59fe8dc28d35f42bdfab06ea99f10c4"}},{"ruleId":"D2","level":"warning","message":{"text":"ForkNowAction.ForkNowAction (cognitive 21): ForkNowAction.ForkNowAction has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 15, if/else 5, ternaries 1. Of this number, 12 points are the body\u0027s own statements and 9 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/ui/src/components/agent-images/ForkNowAction.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"858ce0c1c1122fe2bcef692d0c9546b66233fe0b70eccf36eb5c82ace8f5aaab"}},{"ruleId":"D2","level":"warning","message":{"text":"migrate-telemetry-state-0.5.9.readLibraryConfig (cognitive 21): migrate-telemetry-state-0.5.9.readLibraryConfig has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 6 (7 pts), boolean chains 6 (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":"skills/_canonical/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b39c4b69342f0e643aa7f690d46b8adf370e0b1e1f9e0465cf2a584540f10b"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 21): (anonymous) has cognitive complexity 21 (threshold 15). Drivers by points: other 9, if/else 4 (5 pts), boolean chains 3, ternaries 2 (3 pts), error handling 1 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into 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/daemon/assets/claude-statusline-context.cjs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbfea301034789098073108173f7eec1bf0c9a43d8a696089782d9643e84e7ce"}},{"ruleId":"D2","level":"warning","message":{"text":"claude-credential-precedence.settingsFileConflicts (cognitive 20): claude-credential-precedence.settingsFileConflicts has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 7 (11 pts), boolean chains 3, if/else 2 (3 pts), error handling 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":"packages/daemon/src/domain/claude-credential-precedence.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f0dd0d9ecb70c68a06ae4fb0fd9777ea45be409c594cc1e11b5963f4e0ee6e"}},{"ruleId":"D2","level":"warning","message":{"text":"native-process-arguments.readNativeProcessArguments (cognitive 20): native-process-arguments.readNativeProcessArguments has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, loops 2 (3 pts), error handling 1 (nesting depth added 5). 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 into named stages: move each independent step or branch into 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/daemon/src/domain/native-process-arguments.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ea9e501cb18d0f32a870ebe7cc017be899510bcf4983a5c1f1ee01066ac05a"}},{"ruleId":"D2","level":"warning","message":{"text":"SnapshotRepository.selectRestoreUsable (cognitive 20): SnapshotRepository.selectRestoreUsable has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 5 (6 pts), boolean chains 1, 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/daemon/src/domain/snapshot-repository.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2da946ac81fcacb5741df580c3a95f3100f83b88ee35942dc15ab4eddc3ea7b"}},{"ruleId":"D2","level":"warning","message":{"text":"startup-validation.validateStartupFile (cognitive 20): startup-validation.validateStartupFile has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 3, loops 1 (3 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/daemon/src/domain/startup-validation.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"50f164753f3fe8efdc52a878e55f362a0aa665262b9b62011680afdfd2a5a49a"}},{"ruleId":"D2","level":"warning","message":{"text":"agent-manifest.validatePluginResources (cognitive 20): agent-manifest.validatePluginResources 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/daemon/src/domain/agent-manifest.ts"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"35aa8162d7a5fae8d6e2f3923173de8bbf922beb29b2f965c3baaa4fd94afd71"}},{"ruleId":"D2","level":"warning","message":{"text":"native-permission-store.resolveLaunchOverrideFromFacts (cognitive 20): native-permission-store.resolveLaunchOverrideFromFacts has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 4 (5 pts), boolean chains 3 (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":"packages/daemon/src/domain/native-permission-store.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f981a78b96ae295b9f42b4d79c348a030f79dfb95d1428a013077889848e5a8"}},{"ruleId":"D2","level":"warning","message":{"text":"EnvironmentPlatform.config (cognitive 20): EnvironmentPlatform.config has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 7, ternaries 3, error handling 1, 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/daemon/src/domain/environment-platform.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad6c35f749d0dd9e8fe85d228af0edbaae7fdbc102edaa55bd753873b17faf40"}},{"ruleId":"D2","level":"warning","message":{"text":"message.buildBodyBlocks (cognitive 20): message.buildBodyBlocks has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 7). Of this number, 17 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":"packages/daemon/src/domain/gateway/slack/message.ts"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1598c1cb07e629c890445ebd442a7d5a1705493b879075251aceb37e039fe4"}},{"ruleId":"D2","level":"warning","message":{"text":"default-receiver.describeDefaultReceiver (cognitive 20): default-receiver.describeDefaultReceiver has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 8 (19 pts), if/else 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":"packages/daemon/src/domain/default-receiver.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f5c65295e73374aba787f085d520965d3f4dd9f8e3cdbe5c8cf43358f83a9f"}},{"ruleId":"D2","level":"warning","message":{"text":"relay-config.loadRelayProfiles (cognitive 20): relay-config.loadRelayProfiles has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (5 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 7). Of this number, 18 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/daemon/src/domain/gateway/relay-config.ts"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc46b0c438e04c311171760945f0dbe04495a35a86ce3c120a56e28e2d4a147"}},{"ruleId":"D2","level":"warning","message":{"text":"lifecycle-manifest.validateMissionComposition (cognitive 20): lifecycle-manifest.validateMissionComposition has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11, boolean chains 7, ternaries 1 (2 pts) (nesting depth added 1). Most of this is not in the body itself: 6 of the 20 points are its own statements and the rest belongs to one function literal inside it that branches (line 45). 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/daemon/src/domain/lifecycle-manifest.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b599ec6674e00fd48de81d0a5bce6ca39e516625c0163a17cb936d95f067c4"}},{"ruleId":"D2","level":"warning","message":{"text":"judgments.ledger (cognitive 20): judgments.ledger has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 6, 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/daemon/src/domain/proof/judgments.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"c69c478ec142e5deecfbf6e8ab8a070ab2ee04fe847eb257aa6b045d0c7af52d"}},{"ruleId":"D2","level":"warning","message":{"text":"TranscriptStore.grepSync (cognitive 20): TranscriptStore.grepSync has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (8 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":"packages/daemon/src/domain/transcript-store.ts"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"630262c97b90d63fe9515f5b885c02643d893b8f7fa24de1da0e97c8f38348e6"}},{"ruleId":"D2","level":"warning","message":{"text":"queue-stuck-sweep.runStuckSweep::custodyCandidate (cognitive 20): queue-stuck-sweep.runStuckSweep::custodyCandidate has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 9, if/else 7 (9 pts), error handling 1, ternaries 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. This shape REPEATS in the file: 4 other methods here (queue-stuck-sweep.runStuckSweep, queue-stuck-sweep.runStuckSweep::undeliveredCandidate, queue-stuck-sweep.runStuckSweep::unclaimedCandidate, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 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/daemon/src/domain/queue-stuck-sweep.ts"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a0ae776b1943c91f8d2aa16ac9bec18b1c24d7927c21b0dbce19e3210aac053"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionTransport.claudeDeliveryObservation (cognitive 20): SessionTransport.claudeDeliveryObservation has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 8, error handling 1, ternaries 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":4405}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5367fce475e25e807537508d99d3925020d7cbc240661529a591444590c35ea"}},{"ruleId":"D2","level":"warning","message":{"text":"local-daemon-owner.assessLocalDaemonOwner (cognitive 20): local-daemon-owner.assessLocalDaemonOwner has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10, boolean chains 8, error handling 1, ternaries 1. Most of this is not in the body itself: 3 of the 20 points are its own statements and the rest belongs to 3 function items inside it that branch (a function literal at line 58, a function literal at line 59, observe). 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/local-daemon-owner.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"3370720228cacd5b699a993e243259c93d3888ecac8a49fcd0bfccc7885e9f9d"}},{"ruleId":"D2","level":"warning","message":{"text":"bundle-check.checkBundleFolder::agent (cognitive 20): bundle-check.checkBundleFolder::agent has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 3 (4 pts), boolean chains 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. This shape REPEATS in the file: 2 other methods here (bundle-check.checkBundleFolder, bundle-check.checkBundleFolder::startupFiles) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 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/lib/bundle-check.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8484750580c97128fa02fdc73652d39e6d6e5261fffeba0bca1eff5a2abc887"}},{"ruleId":"D2","level":"warning","message":{"text":"send.wrapSendBody (cognitive 20): send.wrapSendBody has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 8 (16 pts), boolean chains 3, if/else 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/commands/send.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5800625c7b2037552fafe274dffec4afe0e652d807f4bf2bfe76753da06a50b"}},{"ruleId":"D2","level":"warning","message":{"text":"doctor.doctorCommand (cognitive 20): doctor.doctorCommand has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 4 (10 pts), if/else 5 (8 pts), boolean chains 1, loops 1 (nesting depth added 9). None of this is in the body itself: all 20 points belong to 3 function literals inside it that branch (lines 626, 630, 639). 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/commands/doctor.ts"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54ffd2b46fb2b45b7f98331b7abe26ede94c3b6fe8e67fddbaf4b95fce53c3f"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp-server.mapResult (cognitive 20): mcp-server.mapResult has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 8 (12 pts), boolean chains 5, if/else 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/mcp-server.ts"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"84409ef56130809f624405abe626da1a8371f592aeef254cc9934e3210666a7e"}},{"ruleId":"D2","level":"warning","message":{"text":"stream-consumer.applyPending (cognitive 20): stream-consumer.applyPending has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 2 (5 pts), error handling 1 (2 pts), boolean chains 1, 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/decisions/stream-consumer.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1c5ecbb92e50fb486823bfe5422443960055ee4aef4436b89ca9286468dfb8"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime-detect.detectRuntime (cognitive 20): runtime-detect.detectRuntime has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, error handling 1 (2 pts), ternaries 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/restore-packet/runtime-detect.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2f14652a54662ad3a73c105312b8b0ea69ce9f02c4fe4056cf08687a59f845"}},{"ruleId":"D2","level":"warning","message":{"text":"telemetry.telemetryCommand::read (cognitive 20): telemetry.telemetryCommand::read has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 3 (5 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/commands/telemetry.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"35693f26a625a2eb641628955d34768db585ca49152ef8a4c79ebeea52b8d228"}},{"ruleId":"D2","level":"warning","message":{"text":"claude-team-permissions.substitutions (cognitive 20): claude-team-permissions.substitutions has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (4 pts), ternaries 1 (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":"packages/daemon/assets/claude-team-permissions.cjs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"4210fc7a58d625b2feeaec55cbd9d216f1677d380075e05718b11deba766bd5b"}},{"ruleId":"D2","level":"warning","message":{"text":"refocus.process.stdout.write() (cognitive 20): refocus.process.stdout.write() has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 5 (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/daemon/assets/plugins/openrig-core/hooks/scripts/refocus.cjs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a6c7600ab3e63f9fed1ff4992d2ae912b6a15a7c939185bce096c96dc34d42"}},{"ruleId":"D2","level":"warning","message":{"text":"claude-owned-settings.stripOwnedRelayHooks (cognitive 20): claude-owned-settings.stripOwnedRelayHooks has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 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/daemon/src/domain/claude-owned-settings.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"de1f9bb667f919f0933e1ef551d9186a7a3c3dff8b641c8f396f693ce9ba21de"}},{"ruleId":"D2","level":"warning","message":{"text":"cmux.normalizeCapabilities (cognitive 20): cmux.normalizeCapabilities has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 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":"packages/daemon/src/adapters/cmux.ts"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c424bac3eea14a6e69c234f569e9c54e0458fcfd6ea822f434c00bd585b0ef0"}},{"ruleId":"D2","level":"warning","message":{"text":"cmux-transport.normalizePayload (cognitive 20): cmux-transport.normalizePayload has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 3 (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/daemon/src/adapters/cmux-transport.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b5cc9684c0545362cb8504e4cdd97d5695096351e7d1e2ac4fd536aa5c84d17"}},{"ruleId":"D2","level":"warning","message":{"text":"cmux-transport.normalizeSurfaceRow (cognitive 20): cmux-transport.normalizeSurfaceRow has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 6 (12 pts), boolean chains 6, if/else 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/daemon/src/adapters/cmux-transport.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"796611e91969d4dce56bebda8e249200fc5616497cb21efc4dbd6a45908c2ce5"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-auth.copyOntoFresh (cognitive 20): codex-auth.copyOntoFresh has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (8 pts), error handling 5 (7 pts), boolean chains 3, 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":"packages/daemon/src/domain/codex-auth.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"3162ec675fef938cf3b30ebf31a53449a38e0ee8873c0a044fa804234ee5b597"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeVerifier.verifyVersionOrHelp (cognitive 20): RuntimeVerifier.verifyVersionOrHelp has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (17 pts), error handling 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":"packages/daemon/src/domain/runtime-verifier.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"d11c9b03632046c71acf690f8b8fdd0588ec92474f0aaecefef5befcd311e526"}},{"ruleId":"D2","level":"warning","message":{"text":"ServiceOrchestrator.boot (cognitive 20): ServiceOrchestrator.boot has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 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/daemon/src/domain/service-orchestrator.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3ff0fde72015a96d8f66c7479d348fcfdb8f8f270996853dc8c53451f9a3b7"}},{"ruleId":"D2","level":"warning","message":{"text":"current-work.inspectWorkNodeDirs (cognitive 20): current-work.inspectWorkNodeDirs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), error handling 3 (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":"packages/daemon/src/domain/current-work.ts"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa96bd79e1c73ec7d84202dd48a27c6b67fba514fb681c67d5028f6136e4c11"}},{"ruleId":"D2","level":"warning","message":{"text":"destination-successor.recordedSuccessorNotice (cognitive 20): destination-successor.recordedSuccessorNotice has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, ternaries 1 (2 pts), error handling 1, loops 1 (nesting depth added 5). 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 into named stages: move each independent step or branch into 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/daemon/src/domain/destination-successor.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc90722e7198ec09afd216e47b764db60410c171b7f5153751f021a62e5133d0"}},{"ruleId":"D2","level":"warning","message":{"text":"existing-rig-restore.automaticRestoreOverrides (cognitive 20): existing-rig-restore.automaticRestoreOverrides has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 8, if/else 5 (7 pts), ternaries 3 (4 pts), loops 1 (nesting depth added 3). Of this number, 13 points are the body\u0027s own statements and 7 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/daemon/src/domain/existing-rig-restore.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4ebd59064fddee1388419c7b27ac4f6c82b6bf701f30559a04f1db4dad7579"}},{"ruleId":"D2","level":"warning","message":{"text":"relay-inbound.resolveOfferedReplyRefContext (cognitive 20): relay-inbound.resolveOfferedReplyRefContext has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), error handling 2 (3 pts), ternaries 1 (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":"packages/daemon/src/domain/gateway/relay-inbound.ts"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a32361359826a85ef00dc6cc2d33c7656b2ae2b9dbc75370efe040e38517e84"}},{"ruleId":"D2","level":"warning","message":{"text":"instance-initialization.ensureOpenRigInstance (cognitive 20): instance-initialization.ensureOpenRigInstance has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 4, boolean chains 3, loops 2 (3 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/instance-initialization.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c6fef97974a4f67929fec8af5e69054c5adfe5d6c71ad637486f458b99d203"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectClassifier.classify (cognitive 20): ProjectClassifier.classify has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), error handling 2 (4 pts), ternaries 2 (3 pts), boolean chains 1 (nesting depth added 7). Most of this is not in the body itself: 6 of the 20 points are its own statements and the rest belongs to one function literal inside it that branches (line 170). 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/daemon/src/domain/project-classifier.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5b2b1f1855b9f2dd5b6f12ad724bec4bfd7b6902ed11142bdda36cb206e924"}},{"ruleId":"D2","level":"warning","message":{"text":"Reconciler.reconcile (cognitive 20): Reconciler.reconcile has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (7 pts), ternaries 2 (7 pts), error handling 2 (5 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":"packages/daemon/src/domain/reconciler.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb3dc3dc72aabbde4a7fcf6b64845bd49ec0d3a234f463dd091c066efdadad0"}},{"ruleId":"D2","level":"warning","message":{"text":"claude-seat-switch.effortNote (cognitive 20): claude-seat-switch.effortNote has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (13 pts), ternaries 4 (6 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/daemon/src/domain/provider/claude-seat-switch.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"a494d1a4a4e47942bffd9f449bca6189065641461ba28227646d8491586b23d5"}},{"ruleId":"D2","level":"warning","message":{"text":"queue-retention.pruneEvents (cognitive 20): queue-retention.pruneEvents has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 7 (8 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":"packages/daemon/src/domain/queue-retention.ts"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b8623135441afc3c4436c563c3c3a1359ed10142bdbb130b517c152b928227"}},{"ruleId":"D2","level":"warning","message":{"text":"queue-retention.runQueueRetentionSweep (cognitive 20): queue-retention.runQueueRetentionSweep has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4, error handling 1 (2 pts), ternaries 1 (2 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":"packages/daemon/src/domain/queue-retention.ts"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c703d7a616e1bded4f8b23d068d0fc12a098a34a14302999cae1aa8a999b58"}},{"ruleId":"D2","level":"warning","message":{"text":"RestoreCheckService.checkOtherHookChannels (cognitive 20): RestoreCheckService.checkOtherHookChannels has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), ternaries 3 (4 pts), error handling 2 (3 pts), boolean chains 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/daemon/src/domain/restore-check-service.ts"},"region":{"startLine":1346}}}],"partialFingerprints":{"codehealthFindingId/v1":"54df0ed964037d62a51f13617fc8e6c6829ef22482b60e2acc0c0a809dc16934"}},{"ruleId":"D2","level":"warning","message":{"text":"ReviewGatherer.attentionForTag (cognitive 20): ReviewGatherer.attentionForTag has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 9 (10 pts), if/else 6, boolean chains 2, error handling 1 (2 pts) (nesting depth added 2). Most of this is not in the body itself: 8 of the 20 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 548, 568). 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/daemon/src/domain/review/gather.ts"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b0b537f838cffaa27f68411942d5c6a07fe188e686e63ce898353e753df6bc"}},{"ruleId":"D2","level":"warning","message":{"text":"SeatSwitchClientService.switchClient (cognitive 20): SeatSwitchClientService.switchClient has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (15 pts), error handling 3 (4 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-switch-client-service.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"2615f448712248e4b20d950ff8017f6db1338cbe94c3e2c8a86668c556da5854"}},{"ruleId":"D2","level":"warning","message":{"text":"frontmatter-validator.validateFile (cognitive 20): frontmatter-validator.validateFile has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, error handling 2, loops 1 (2 pts), 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/daemon/src/domain/workspace/frontmatter-validator.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a7d3294916f9a9c653cf2ca6382d86835c27a347ced41c709d6ad4a41725f2c"}},{"ruleId":"D2","level":"warning","message":{"text":"sessions.nodesRoutes.post(\u0022/launch-subset\u0022) (cognitive 20): sessions.nodesRoutes.post(\u0022/launch-subset\u0022) has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 6 (9 pts), if/else 5 (6 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":"packages/daemon/src/routes/sessions.ts"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a49f69b2539b11cc79da5fe5556ce60df4cd6c9a37ed728a602b3280a420d5"}},{"ruleId":"D2","level":"warning","message":{"text":"snapshots.snapshotsRoutes.post(\u0022/\u0022) (cognitive 20): snapshots.snapshotsRoutes.post(\u0022/\u0022) has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, error handling 2 (3 pts), 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/daemon/src/routes/snapshots.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"741ce5244e7a6a67b06312d0962ed72fbc8c2bb4c6205b64db06f6198ea05d0b"}},{"ruleId":"D2","level":"warning","message":{"text":"scope-audit.buildAuditDependencyGraph (cognitive 20): scope-audit.buildAuditDependencyGraph has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (8 pts), ternaries 2 (6 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 10). 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 into named stages: move each independent step or branch into 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/daemon/src/routes/scope-audit.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea86ce50bda917b2bab5126b1ee08e6ea93318467e5e237bec77be734bb35d2f"}},{"ruleId":"D2","level":"warning","message":{"text":"execution-model.laneDetail (cognitive 20): execution-model.laneDetail has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 8 (15 pts), if/else 3, boolean chains 2 (nesting depth added 7). 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 into named stages: move each independent step or branch into 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/tui/src/execution/execution-model.ts"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b3e317a839102d159bb320e0909173be90c92683e4a52ac7be3e1922da47677"}},{"ruleId":"D2","level":"warning","message":{"text":"usage-hosts-model.usageHostsLines (cognitive 20): usage-hosts-model.usageHostsLines has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 3 (7 pts), if/else 5 (6 pts), loops 5 (6 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":"packages/tui/src/usage/usage-hosts-model.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c38fe86d164166d4cb1d60225ee364cd423a6336e8edf8687f491c1528b921b"}},{"ruleId":"D2","level":"warning","message":{"text":"DaemonClient.configBrowser (cognitive 20): DaemonClient.configBrowser has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 5 (14 pts), boolean chains 3, if/else 2, 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/tui/src/daemon-client.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"170d05e31ac36b6c29286a379242baea88e72dea133bb528f166c7391cccf71e"}},{"ruleId":"D2","level":"warning","message":{"text":"terminal-model.terminalExplorerRows (cognitive 20): terminal-model.terminalExplorerRows has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 4 (10 pts), boolean chains 4, if/else 2 (3 pts), loops 2 (3 pts) (nesting depth added 8). 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 into named stages: move each independent step or branch into 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/tui/src/terminals/terminal-model.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"31efa04bab9944c1f0a1473e3086209b8d0096b842342dc328ed72167cc8fc88"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalReadingController.key (cognitive 20): LocalReadingController.key has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (15 pts), ternaries 1 (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":"packages/tui/src/local-reading.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"305505cef6a74bfaadbc4bfdb1694993adb996bb293e102a6357084c56ee587c"}},{"ruleId":"D2","level":"warning","message":{"text":"useActivityFeed.useActivityFeed (cognitive 20): useActivityFeed.useActivityFeed has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 4, ternaries 1 (nesting depth added 4). None of this is in the body itself: all 20 points belong to one function literal inside it that branches (line 32). 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/ui/src/hooks/useActivityFeed.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"950ec28c1b2e8d7a524ac7728f7492212fb5bcfdd7b775bc703f0b9186da39e2"}},{"ruleId":"D2","level":"warning","message":{"text":"FocusedTerminal.mapXtermInput (cognitive 20): FocusedTerminal.mapXtermInput has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 10). Of this number, 19 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/ui/src/components/terminal/FocusedTerminal.tsx"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e347e9438af8e85dc3b370bbb4dfd66d8c4ae79ef9032631837ba2b930d9d69"}},{"ruleId":"D2","level":"warning","message":{"text":"useTopologyActivity.useTopologyActivity (cognitive 20): useTopologyActivity.useTopologyActivity has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 1, loops 1 (nesting depth added 7). None of this is in the body itself: all 20 points belong to 3 function literals inside it that branch (lines 112, 164, 174). 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/ui/src/hooks/useTopologyActivity.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddbc8131c771da157f822734c3515b9c33429e3f1284fcdf74e189304dc12436"}},{"ruleId":"D2","level":"warning","message":{"text":"LiveNodeDetails.AgentSpecSection (cognitive 20): LiveNodeDetails.AgentSpecSection has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 7 (17 pts), boolean chains 3 (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":"packages/ui/src/components/LiveNodeDetails.tsx"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"95004c44fde909f723e921bdfbf452ff26316e8a19445bda89f9afde743963ae"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentsBandView.AgentsBandView (cognitive 20): AgentsBandView.AgentsBandView has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 14 (19 pts), boolean chains 1 (nesting depth added 5). Of this number, 14 points are the body\u0027s own statements and 6 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":"packages/ui/src/components/review/AgentsBandView.tsx"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce4de7e8cf23b94997b5ab85c12b509b898c003ea4b9bc7b3021ba006af5e1f"}},{"ruleId":"D2","level":"warning","message":{"text":"SliceReviewTab.SliceReviewTab (cognitive 20): SliceReviewTab.SliceReviewTab has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 11 (16 pts), boolean chains 2, if/else 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/ui/src/components/review/SliceReviewTab.tsx"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecff4b4503b6a60a5537c58263389adf86bb656717d1a00bf09b26070e8bb31c"}},{"ruleId":"D2","level":"warning","message":{"text":"MissionReviewTab.Board (cognitive 20): MissionReviewTab.Board has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 10 (18 pts), boolean chains 2 (nesting depth added 8). Most of this is not in the body itself: 7 of the 20 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 177, 190, 196). 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/ui/src/components/review/MissionReviewTab.tsx"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"8699474b51b9eea90f96f6a0f4ad5505bc7ce3681cf571b24572904aded86864"}},{"ruleId":"D2","level":"warning","message":{"text":"MissionReviewTab.MissionReviewTab (cognitive 20): MissionReviewTab.MissionReviewTab has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 9 (16 pts), boolean chains 2, if/else 2 (nesting depth added 7). Most of this is not in the body itself: 8 of the 20 points are its own statements and the rest belongs to one function literal inside it that branches (line 331). 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/ui/src/components/review/MissionReviewTab.tsx"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"743bc86d6ad44f0a60bc73e677a0919bb370dba68a852ef6eb1967441c60f1d4"}},{"ruleId":"D2","level":"warning","message":{"text":"priority-rail-rule.computeLintWarnings (cognitive 20): priority-rail-rule.computeLintWarnings has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 3, loops 3 (nesting depth added 6). Of this number, 17 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":"packages/ui/src/components/progress/priority-rail-rule.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7153d67bce12429cbde4d6d8f9d51380ab8349987bff83547760bf6a183eba4"}},{"ruleId":"D2","level":"warning","message":{"text":"graph-layout.layoutSingleColumn (cognitive 20): graph-layout.layoutSingleColumn has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 6 (8 pts), boolean chains 4 (nesting depth added 6). Of this number, 10 points are the body\u0027s own statements and 10 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/ui/src/lib/graph-layout.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f1f7ee65e41d9021b41cf532615d7aa88ce7241161eed0c30f7aa9f854b04af"}},{"ruleId":"D2","level":"warning","message":{"text":"trace-to-root.render_held_and_next (cognitive 20): trace-to-root.render_held_and_next has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 9, if/else 4, loops 2 (4 pts), ternaries 1 (3 pts) (nesting depth added 4). 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/daemon/assets/plugins/openrig-core/skills/refocusing/scripts/trace-to-root.py"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"317234a34988c5c02255e524d92c775917264277b0b6f649ea21f02a691a26a7"}},{"ruleId":"D2","level":"warning","message":{"text":"community-harness-launch-result.readLaunchResult (cognitive 19): community-harness-launch-result.readLaunchResult has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 4, error handling 3 (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/daemon/src/domain/community-harness-launch-result.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"18554672145851a6c675c42b6e7ab4c0b7a1dfcc31ac02b39c7900110a22dabb"}},{"ruleId":"D2","level":"warning","message":{"text":"seat-effort.codexTurnOutcome (cognitive 19): seat-effort.codexTurnOutcome has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 4, 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/daemon/src/domain/seat-effort.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"743230dfe98af62e404b8bc86d690e408353584017e0b885c7080518c94b0b11"}},{"ruleId":"D2","level":"warning","message":{"text":"native-process-lineage.observeClaudeDelivery::sample (cognitive 19): native-process-lineage.observeClaudeDelivery::sample has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 2 (3 pts), boolean chains 1, 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/daemon/src/domain/native-process-lineage.ts"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e0d14fa340ec7e7f5c412d46c9652bde3a9e9ee69862c92bd33eac636a2028"}},{"ruleId":"D2","level":"warning","message":{"text":"OutboxHandler.replaceRunnerRun (cognitive 19): OutboxHandler.replaceRunnerRun has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 2 (7 pts), loops 3 (6 pts), if/else 2 (4 pts), boolean chains 2 (nesting depth added 10). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to one function literal inside it that branches (line 333). 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/daemon/src/domain/outbox-handler.ts"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"88cc99c64ad87930806693edc0ca247883adfd93823e13dfc6be600ac3663cf0"}},{"ruleId":"D2","level":"warning","message":{"text":"settings-store.acceptedIntegerRange (cognitive 19): settings-store.acceptedIntegerRange has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (4 pts), boolean chains 1, error handling 1, ternaries 1 (nesting depth added 6). 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 into named stages: move each independent step or branch into 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/daemon/src/domain/user-settings/settings-store.ts"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c3e1f78a9d811f6c2506f06e7aa8b1d0f7ab4884a338b8bb42dd98b1c0b4d5e"}},{"ruleId":"D2","level":"warning","message":{"text":"SeatDeliveryGuard.custody (cognitive 19): SeatDeliveryGuard.custody has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 4, loops 1 (2 pts), ternaries 1 (2 pts), error handling 1 (nesting depth added 4). None of this is in the body itself: all 19 points belong to 4 function items inside it that branch (acquire, validate, acquire::run, \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/daemon/src/domain/seat-delivery-guard.ts"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"68efa307a2ec35ae91585236b65fe203611ccf7d4bb95fa68b01a8a4561d5902"}},{"ruleId":"D2","level":"warning","message":{"text":"package-manifest.serializeManifest (cognitive 19): package-manifest.serializeManifest 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/daemon/src/domain/package-manifest.ts"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"70cdca61267a16fb2261dbb1f0b9517fb7c611c533b4b953c02bc76e71e9cfb0"}},{"ruleId":"D2","level":"warning","message":{"text":"profile-resolver.buildResourcePool (cognitive 19): profile-resolver.buildResourcePool has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 5 (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":"packages/daemon/src/domain/profile-resolver.ts"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"db497ce6ff36d9a603cc57429d53a22f80c614928937b9e1998ed7559d543c10"}},{"ruleId":"D2","level":"warning","message":{"text":"policy-ref.resolvePermissionPolicyAttachment (cognitive 19): policy-ref.resolvePermissionPolicyAttachment has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5, ternaries 1 (2 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":"packages/daemon/src/domain/permission-policy/policy-ref.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"208ca3044eeae48a28863ae31158b5550498c75ffde5522ffab52143108d69e8"}},{"ruleId":"D2","level":"warning","message":{"text":"HumanQuietStore.quietStateFor (cognitive 19): HumanQuietStore.quietStateFor has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, ternaries 2 (3 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/daemon/src/domain/gateway/human-quiet-windows.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8530c123ec81742a9d95d5da4f7c6e00cb3127f8e83179427f81a069aa45d23"}},{"ruleId":"D2","level":"warning","message":{"text":"SliceIndexer.scanProofPacket::walk (cognitive 19): SliceIndexer.scanProofPacket::walk has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (9 pts), error handling 2 (4 pts), boolean chains 3, ternaries 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/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":1590}}}],"partialFingerprints":{"codehealthFindingId/v1":"e559c1264ee42ecd2cff1144935d46715f997eaae38244a111f1aaaf2a5a0dcf"}},{"ruleId":"D2","level":"warning","message":{"text":"queue-wait-backoff.refreshQueueWaits (cognitive 19): queue-wait-backoff.refreshQueueWaits has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 5, 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/daemon/src/domain/queue-wait-backoff.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc80c93328f5fe67b2ad7936f6ef56d4e25df0b0b5de84a63318426f31ba91ec"}},{"ruleId":"D2","level":"warning","message":{"text":"SeatStructuralActivityService.pollAllRunningTmuxSeats (cognitive 19): SeatStructuralActivityService.pollAllRunningTmuxSeats has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 5, loops 2, ternaries 2, error handling 1 (nesting depth added 2). Of this number, 11 points are the body\u0027s own statements and 8 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/daemon/src/domain/seat-structural-activity-service.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"683d82dfd3048b3a1166b858aba6c84e970effbfc1af3a826074f7ed6f5a63b4"}},{"ruleId":"D2","level":"warning","message":{"text":"workspace-resolver.resolveNodeWorkspace (cognitive 19): workspace-resolver.resolveNodeWorkspace has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 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/daemon/src/domain/workspace/workspace-resolver.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"34959ee6d02aa1f71b73a42812929d349d44178d7c98d5c5e1a5e21aa28dc15d"}},{"ruleId":"D2","level":"warning","message":{"text":"queue-stuck-sweep.runStuckSweep::unclaimedCandidate (cognitive 19): queue-stuck-sweep.runStuckSweep::unclaimedCandidate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 4, 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. This shape REPEATS in the file: 4 other methods here (queue-stuck-sweep.runStuckSweep, queue-stuck-sweep.runStuckSweep::undeliveredCandidate, queue-stuck-sweep.runStuckSweep::custodyCandidate, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 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/daemon/src/domain/queue-stuck-sweep.ts"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"1600654e66730f25b205a28794dd1b7a3d07fc8c6571572e62d6f0c6d0873bad"}},{"ruleId":"D2","level":"warning","message":{"text":"queue-wake-ladder.ensureEscalationRow (cognitive 19): queue-wake-ladder.ensureEscalationRow has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 8 (11 pts), boolean chains 4, if/else 3 (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/daemon/src/domain/queue-wake-ladder.ts"},"region":{"startLine":1863}}}],"partialFingerprints":{"codehealthFindingId/v1":"311635c912768a63bed18e8c29e419847c0208bd15077644ae6cb15f5f5cb0a3"}},{"ruleId":"D2","level":"warning","message":{"text":"QueueRepository.closeCrossHostHandoffSource (cognitive 19): QueueRepository.closeCrossHostHandoffSource has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 3 (4 pts), boolean chains 2, error handling 1 (2 pts), loops 2 (nesting depth added 5). Most of this is not in the body itself: 8 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 3220). 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":3174}}}],"partialFingerprints":{"codehealthFindingId/v1":"064cf0d88841480bbe4680198278c4b538d7d92eda26594102cf2f642f5c6b04"}},{"ruleId":"D2","level":"warning","message":{"text":"QueueRepository.passRunnerAnswerToDecider (cognitive 19): QueueRepository.passRunnerAnswerToDecider has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 6, ternaries 5 (6 pts), if/else 3 (4 pts), error handling 2, loops 1 (nesting depth added 2). Of this number, 17 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/queue-repository.ts"},"region":{"startLine":4488}}}],"partialFingerprints":{"codehealthFindingId/v1":"8568c45916c9f6c8904d2a4114de247fa5d91ecb52681f57834774fad589aa89"}},{"ruleId":"D2","level":"warning","message":{"text":"QueueRepository.findUndelivered (cognitive 19): QueueRepository.findUndelivered has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 5, ternaries 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":"packages/daemon/src/domain/queue-repository.ts"},"region":{"startLine":5503}}}],"partialFingerprints":{"codehealthFindingId/v1":"201abcda76c05628ac3153c07b9b6f87a4e5bacbab325dcb51c16cd6349103ac"}},{"ruleId":"D2","level":"warning","message":{"text":"PiRuntimeAdapter.projectEntry (cognitive 19): PiRuntimeAdapter.projectEntry has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), error handling 1 (3 pts), loops 1 (3 pts), boolean chains 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/daemon/src/adapters/pi-runtime-adapter.ts"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"e560ccb3dd4d5be48acc259377144b688263123c8d89f60da65f950a87279cd8"}},{"ruleId":"D2","level":"warning","message":{"text":"StartupOrchestrator.owedStartup (cognitive 19): StartupOrchestrator.owedStartup has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 10 (19 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/daemon/src/domain/startup-orchestrator.ts"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"d92b2152ced5a3d84554b4e081d1b1620545a222e4f1230f6680175ccf84001f"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionTransport.preWaitForIdle (cognitive 19): SessionTransport.preWaitForIdle has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 3, error handling 2, ternaries 1 (2 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/session-transport.ts"},"region":{"startLine":3309}}}],"partialFingerprints":{"codehealthFindingId/v1":"090d3975b0651fc32ad7c07f1658252e54bff4f3038e42845bba5981b5776746"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionTransport.broadcast (cognitive 19): SessionTransport.broadcast has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 8 (13 pts), boolean chains 4, if/else 1, loops 1 (nesting depth added 5). Of this number, 15 points are the body\u0027s own statements and 4 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":"packages/daemon/src/domain/session-transport.ts"},"region":{"startLine":5047}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c48c0a3f16c41c1294d6b9f3b3fea13f2d6e88f2c10438e008fb337085d269f"}},{"ruleId":"D2","level":"warning","message":{"text":"TmuxAdapter.startServerInUserScope (cognitive 19): TmuxAdapter.startServerInUserScope has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 2, error handling 1 (2 pts), ternaries 2, loops 1 (nesting depth added 7). 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 into named stages: move each independent step or branch into 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/daemon/src/adapters/tmux.ts"},"region":{"startLine":1497}}}],"partialFingerprints":{"codehealthFindingId/v1":"6baaa6e8554acabaf62c6d7a14c966b6bb855ecd806e1d6f4cbced9549525be4"}},{"ruleId":"D2","level":"warning","message":{"text":"TmuxAdapter.readAllPaneProcesses (cognitive 19): TmuxAdapter.readAllPaneProcesses has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 4 (9 pts), boolean chains 4, if/else 2 (4 pts), error handling 1, 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/daemon/src/adapters/tmux.ts"},"region":{"startLine":2986}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca0dc4185c86149e355bd552d34e0cc81bc99a52496cbacd7e579e2b766a667"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeCompactionEnforcer.endedAttemptGate (cognitive 19): ClaudeCompactionEnforcer.endedAttemptGate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9, boolean chains 8, error handling 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"b196f81e76fad83c9f8045436b1c1949ab33dfc5d8ad8a6a587735f68169abbe"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeCompactionEnforcer.drainPendingPreparedCompact (cognitive 19): ClaudeCompactionEnforcer.drainPendingPreparedCompact has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 7, ternaries 2 (3 pts) (nesting depth added 2). Of this number, 15 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":"packages/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2fde50b6766213f6eddf631798c426f520e1a866b5a7d90e2b075e8a6084ccf"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeCompactionEnforcer.noteEndedPreparation (cognitive 19): ClaudeCompactionEnforcer.noteEndedPreparation has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 8, if/else 7 (8 pts), ternaries 2, error handling 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":2235}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc2ffab44b2d3966f041d506ff780aef01a40a576b92c593a67ebe6668835a8"}},{"ruleId":"D2","level":"warning","message":{"text":"native-resume-probe.looksLikeCodexLoginPrompt (cognitive 19): native-resume-probe.looksLikeCodexLoginPrompt has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 8, if/else 5 (6 pts), ternaries 2 (4 pts), loops 1 (nesting depth added 3). Of this number, 17 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/daemon/src/domain/native-resume-probe.ts"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"8292265dd736fdb8aaa825a6d0c8ad48bcc3e51a906fde8917f33ee5d63401e2"}},{"ruleId":"D2","level":"warning","message":{"text":"check-runner.parseArgs (cognitive 19): check-runner.parseArgs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16 (18 pts), loops 1 (nesting depth added 2). 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: 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":"docs/reference/runner-conformance/check-runner.mjs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ac7a3b24457c0f1907b051d9bcae8b645fad60173ee7d5a06c9e8eb961b23f"}},{"ruleId":"D2","level":"warning","message":{"text":"host-registry.updateHostEntry (cognitive 19): host-registry.updateHostEntry has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 2, loops 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, 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/host-registry.ts"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bfe0821a8df7dc352d3ddd12da17b696ec4e5adb2bc823025c585af54ed5366"}},{"ruleId":"D2","level":"warning","message":{"text":"ps.parseFilter (cognitive 19): ps.parseFilter 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":"packages/cli/src/commands/ps.ts"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"47dfcfad74a1283001c0944d481d19d5ecccd28ae13e0b45821dd948aa147a11"}},{"ruleId":"D2","level":"warning","message":{"text":"queue-receipt.wakeEvidence (cognitive 19): queue-receipt.wakeEvidence has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 8 (13 pts), if/else 4, 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/queue-receipt.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c03a5cdbebd593723cbb5ba025ae9f7fd1d66b045e05af745940fc1173e2c7"}},{"ruleId":"D2","level":"warning","message":{"text":"whoami.resolveIdentitySource (cognitive 19): whoami.resolveIdentitySource has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), error handling 3 (6 pts), ternaries 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/commands/whoami.ts"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e22b102b42b3b2fc85eb806f17c77837dd0e73d494424bf6a2298d1645887c"}},{"ruleId":"D2","level":"warning","message":{"text":"bundle-source.importGitHubBundle (cognitive 19): bundle-source.importGitHubBundle has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 4, ternaries 2 (3 pts), error handling 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/cli/src/lib/bundle-source.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"d97e740da25be7728c399e2e8c7189fab6b6736a18bb90a8a0bd8fb5b8e14718"}},{"ruleId":"D2","level":"warning","message":{"text":"bundle-check.schemaNameProblem (cognitive 19): bundle-check.schemaNameProblem has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 4 (6 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/lib/bundle-check.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9585521140e13d75fc497c48fad56fd3cbe7c0d00a16a20c6400b1dd50756c"}},{"ruleId":"D2","level":"warning","message":{"text":"policy-ref.resolvePermissionPolicyAttachment (cognitive 19): policy-ref.resolvePermissionPolicyAttachment has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5, ternaries 1 (2 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":"packages/cli/src/lib/permission-policy/policy-ref.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2656390822cef2ce0f94076a46917cccdd0f2111c15f76d97fffee01a03c125"}},{"ruleId":"D2","level":"warning","message":{"text":"usage.piCostLine (cognitive 19): usage.piCostLine has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 13 (19 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/commands/usage.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1314ce99a5c1bd1607caea8c477872fa46ca4677fb5f7899f01b2e3bd67054"}},{"ruleId":"D2","level":"warning","message":{"text":"extract-surface.extractFile::processBody (cognitive 19): extract-surface.extractFile::processBody has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (4 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. This shape REPEATS in the file: one other method here (extract-surface.extractFile::evalExpr) 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/release-surface/extract-surface.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d155c5bb55a50ef290557cddbe4ec722e54c545290b9c299daf4731550822b"}},{"ruleId":"D2","level":"warning","message":{"text":"claude-owned-settings.cleanupOwnedClaudeCwd (cognitive 19): claude-owned-settings.cleanupOwnedClaudeCwd has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (11 pts), error handling 2 (4 pts), boolean chains 3, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/claude-owned-settings.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"384a43a859e7ce9a09bb97048c2eb1a5b22da51c4be4b1479054253ea709c2a8"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeCodeAdapter.paneOccupant (cognitive 19): ClaudeCodeAdapter.paneOccupant has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 4 (7 pts), boolean chains 3, 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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"f827dd6bd755a29933dc9f3a7294b989a36bc8fbfe6b213c7f8a96a8b1547848"}},{"ruleId":"D2","level":"warning","message":{"text":"CodexRuntimeAdapter.project (cognitive 19): CodexRuntimeAdapter.project has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 2 (5 pts), boolean chains 2, error handling 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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"a798083eb8eeb258cda6d68e06163c042e0c908163d1ed8fd2507384a47e6493"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-runtime-adapter.rekeyCodexHookStateText (cognitive 19): codex-runtime-adapter.rekeyCodexHookStateText has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (11 pts), ternaries 2 (6 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":"packages/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":2638}}}],"partialFingerprints":{"codehealthFindingId/v1":"18163fc2a93c5a83517189c03157dd2d70d5ab46c6bc391ab25751bdc15ebb54"}},{"ruleId":"D2","level":"warning","message":{"text":"StubRuntimeAdapter.launchHarness (cognitive 19): StubRuntimeAdapter.launchHarness has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 3 (5 pts), 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":"packages/daemon/src/adapters/stub-runtime-adapter.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"015b928ac9f86e8ed6e66896a3d7268e9bd6be38aaa476d28b7f4f883564c256"}},{"ruleId":"D2","level":"warning","message":{"text":"bundle-types.serializePodBundleManifest (cognitive 19): bundle-types.serializePodBundleManifest has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14, boolean chains 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/daemon/src/domain/bundle-types.ts"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"312d196fbdedec9dcc60e8964dfcc92233ed66c77a7b6e270a18cfb2586776ca"}},{"ruleId":"D2","level":"warning","message":{"text":"daemon-shutdown.createDaemonShutdown.\u003Creturned closure\u003E (cognitive 19): daemon-shutdown.createDaemonShutdown.\u003Creturned closure\u003E has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), error handling 3 (5 pts), ternaries 3, loops 1 (nesting depth added 5). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to 2 function items inside it that branch (a function literal at line 164, finish). 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/daemon/src/daemon-shutdown.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"27384d87263a9a8390120cd8c32a2576d787a789bdf912c25767b7c513815073"}},{"ruleId":"D2","level":"warning","message":{"text":"evidence-guard.walkYaml (cognitive 19): evidence-guard.walkYaml has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (8 pts), error handling 2 (6 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":"packages/daemon/src/domain/agent-images/evidence-guard.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ac58a03d95d37685566ffc3c89933badcc5be0a29c857113d86d0a1e52a989"}},{"ruleId":"D2","level":"warning","message":{"text":"evidence-guard.collectImageRefs (cognitive 19): evidence-guard.collectImageRefs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 4, 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/daemon/src/domain/agent-images/evidence-guard.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae31e43a45b22abc4839ab9a29e0181f01a1b5b3d01bb22bd6c3bbac3f5e1c5"}},{"ruleId":"D2","level":"warning","message":{"text":"rigspec-preflight.verifyCodexProfiles (cognitive 19): rigspec-preflight.verifyCodexProfiles has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (12 pts), ternaries 1 (4 pts), 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":"packages/daemon/src/domain/rigspec-preflight.ts"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d3e35ae28c4166b5f3fe7c18b8af514b233267b74d52a9862fbbb9a5575619"}},{"ruleId":"D2","level":"warning","message":{"text":"LegacyBundleAssembler.assemble (cognitive 19): LegacyBundleAssembler.assemble has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3, ternaries 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/daemon/src/domain/bundle-assembler.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"433e50dd9d8039001704898015515ab95193ab480179b35e1269b9540dd842a1"}},{"ruleId":"D2","level":"warning","message":{"text":"ContextPackLibraryService.scan (cognitive 19): ContextPackLibraryService.scan has cognitive complexity 19 (threshold 15). Drivers by points: error handling 3 (9 pts), ternaries 1 (4 pts), if/else 1 (3 pts), 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":"packages/daemon/src/domain/context-packs/context-pack-library-service.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"815a3a76e8c6524b53511708a2dcb579d52dfbcf831ade761de300a1aa49efde"}},{"ruleId":"D2","level":"warning","message":{"text":"workflow-role-resolver.selectRoleSeat (cognitive 19): workflow-role-resolver.selectRoleSeat has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 2 (3 pts), boolean chains 2, loops 1 (nesting depth added 7). Of this number, 15 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/daemon/src/domain/workflow-role-resolver.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"db653bd61e92ae5c88343b52d311300d8a0e09c6f35024cde21c1a9995b8fe70"}},{"ruleId":"D2","level":"warning","message":{"text":"RestoreOrchestrator.classifyRunningSessions (cognitive 19): RestoreOrchestrator.classifyRunningSessions has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"d83db98d998bf1832dd0dfb856ea7365a2104205c9b3439c267f9801bd6a87a6"}},{"ruleId":"D2","level":"warning","message":{"text":"restore-orchestrator.snapshotLaunchOutcome (cognitive 19): restore-orchestrator.snapshotLaunchOutcome has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8, ternaries 4 (7 pts), boolean chains 4 (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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"548e8aa77278ec2cd228eb43d7f5e8972ebce86e8d54664912caa665bd62b502"}},{"ruleId":"D2","level":"warning","message":{"text":"OperatingPostureService.target (cognitive 19): OperatingPostureService.target has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 4 (10 pts), if/else 6, 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":"packages/daemon/src/domain/rig-mode/operating-posture.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"bab66e18709ac712aeeea85843e11e427596b0805dff570a76ba040f535a43ae"}},{"ruleId":"D2","level":"warning","message":{"text":"health-policy.validateHealthPolicy (cognitive 19): health-policy.validateHealthPolicy has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 10, if/else 7 (8 pts), loops 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":"packages/daemon/src/domain/health-policy.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1a788d40f88f7a5cad78b255fea9c95d67670354a86955737f028fb643972a"}},{"ruleId":"D2","level":"warning","message":{"text":"health-detectors.evaluateCoordination (cognitive 19): health-detectors.evaluateCoordination has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 6 (12 pts), boolean chains 4, if/else 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":"packages/daemon/src/domain/health-detectors.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cc007b406be2cd44255015a4a59ab89f418010a9a93cddc4a03e4ff28a492f6"}},{"ruleId":"D2","level":"warning","message":{"text":"HealthDiagnosisService.validateProgress (cognitive 19): HealthDiagnosisService.validateProgress has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 10, if/else 7 (8 pts), loops 1 (nesting depth added 1). Of this number, 17 points are the body\u0027s own statements and 2 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/daemon/src/domain/health-diagnosis.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"672d38d66cd807257ca33881e07614a853b2cc23897f93517c1e33b5d2d8f288"}},{"ruleId":"D2","level":"warning","message":{"text":"health-context.healthAuthority (cognitive 19): health-context.healthAuthority has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 7, if/else 6, ternaries 5, error handling 1. Most of this is not in the body itself: 7 of the 19 points are its own statements and the rest belongs to 2 function items inside it that branch (belongs, a function literal at line 118). 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/daemon/src/domain/health-context.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae4fc41869ce3bdab614e21b5b69369565afc5eca6539d4a293e91c461aa233"}},{"ruleId":"D2","level":"warning","message":{"text":"hosts-registry-writer.updateHostEntry (cognitive 19): hosts-registry-writer.updateHostEntry has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 2, loops 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, 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/daemon/src/domain/hosts/hosts-registry-writer.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"754be817a8e4468bafd01443035abd7c921762fec3e0a02d0a7e0728cbb5b777"}},{"ruleId":"D2","level":"warning","message":{"text":"PluginDiscoveryService.scanCwdBundledPlugins (cognitive 19): PluginDiscoveryService.scanCwdBundledPlugins has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (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":"packages/daemon/src/domain/plugin-discovery-service.ts"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff6266492d238687cc0f4884d4a50f31f0ace3ba41a02eeadbb2c9abced88ebb"}},{"ruleId":"D2","level":"warning","message":{"text":"SeatLifecycleService.stopSeatChecked (cognitive 19): SeatLifecycleService.stopSeatChecked has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10, ternaries 2 (5 pts), boolean chains 3, error handling 1 (nesting depth added 3). Of this number, 11 points are the body\u0027s own statements and 8 belong to 2 function items 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":"packages/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb385bfbbe948241c18d477f76493850ab8f3a771d4f9427674b2933cc940b6"}},{"ruleId":"D2","level":"warning","message":{"text":"SeatLifecycleService.inPlaceTarget (cognitive 19): SeatLifecycleService.inPlaceTarget has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8, ternaries 6 (7 pts), boolean chains 3, error handling 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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":2035}}}],"partialFingerprints":{"codehealthFindingId/v1":"148a8bc26ea1861d83253d9ba57fd07bf8cf54a614de0eaa2ee2e3ee0a9c27e9"}},{"ruleId":"D2","level":"warning","message":{"text":"subscription-move-report.findCredential (cognitive 19): subscription-move-report.findCredential has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts), ternaries 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/daemon/src/domain/provider/subscription-move-report.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba7e727903e38971ae9e6afda0efce10af40a5cd3fc484103a5e56f77d82c72"}},{"ruleId":"D2","level":"warning","message":{"text":"queue-erasure.addressesAtRig (cognitive 19): queue-erasure.addressesAtRig has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 2 (7 pts), boolean chains 2 (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":"packages/daemon/src/domain/queue-erasure.ts"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cec353501d53d39a9a569e1fd7e08a16e2bc77d909b44634f8684a882678d4a"}},{"ruleId":"D2","level":"warning","message":{"text":"RestoreCheckService.buildRigRollup (cognitive 19): RestoreCheckService.buildRigRollup has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 2, loops 1 (nesting depth added 3). 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: 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/daemon/src/domain/restore-check-service.ts"},"region":{"startLine":1798}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4e4f991585fd14737efdbb1aa28eaee77b589360120248bc7bc4f3fd5675c9"}},{"ruleId":"D2","level":"warning","message":{"text":"UpCommandRouter.autoDetect (cognitive 19): UpCommandRouter.autoDetect has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 5, error handling 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":"packages/daemon/src/domain/up-command-router.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"1864366edd0c4312faafa1d7b60506f14c70883e7ff4880e233df0f34fbb99b7"}},{"ruleId":"D2","level":"warning","message":{"text":"frontmatter-validator.validateWorkspaceFrontmatter::walk (cognitive 19): frontmatter-validator.validateWorkspaceFrontmatter::walk has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 2, error handling 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":"packages/daemon/src/domain/workspace/frontmatter-validator.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"30bc3164750a5f3c8f419a3ccfc20fa616db542cd74157e47995f1503d462372"}},{"ruleId":"D2","level":"warning","message":{"text":"packages.packagesRoutes.post(\u0022/plan\u0022) (cognitive 19): packages.packagesRoutes.post(\u0022/plan\u0022) has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (11 pts), ternaries 5, boolean chains 2, error handling 1 (nesting depth added 1). Of this number, 13 points are the body\u0027s own statements and 6 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/daemon/src/routes/packages.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecdb76c137d09a3311b2b4b93e4d164e89b8a31277b7b60d8d2aa4377c216331"}},{"ruleId":"D2","level":"warning","message":{"text":"bootstrap.bootstrapRoutes.post(\u0022/apply\u0022) (cognitive 19): bootstrap.bootstrapRoutes.post(\u0022/apply\u0022) has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 6 (9 pts), if/else 6 (7 pts), boolean chains 2, error handling 1 (nesting depth added 4). Of this number, 15 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/daemon/src/routes/bootstrap.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16ef3af155d975546df3700327288bd9d546f4b69a626b60ef0ab8c8aa14537"}},{"ruleId":"D2","level":"warning","message":{"text":"mission-control.missionControlRoutes::listDestinations (cognitive 19): mission-control.missionControlRoutes::listDestinations has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 2 (6 pts), if/else 4 (5 pts), boolean chains 4, loops 2 (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. This shape REPEATS in the file: one other method here (mission-control.missionControlRoutes::errorResponse) 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/daemon/src/routes/mission-control.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea64ab5bdc94dbb111d4f0f0402242d02bf3ec6b39a4aafe2b18614192bea99e"}},{"ruleId":"D2","level":"warning","message":{"text":"TerminalBrokerRegistry.attach (cognitive 19): TerminalBrokerRegistry.attach has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 1 (3 pts), ternaries 1 (3 pts), boolean chains 1, error handling 1 (nesting depth added 10). Most of this is not in the body itself: 9 of the 19 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 701, 705, 689). 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/daemon/src/terminal/TerminalSessionBroker.ts"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b828f9a5e4d71367b7f63d06f6b21833230498114083d80615c9b804781a89a"}},{"ruleId":"D2","level":"warning","message":{"text":"browser-boundary.browserBoundary.\u003Creturned closure\u003E (cognitive 19): browser-boundary.browserBoundary.\u003Creturned closure\u003E has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 4 (6 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":"packages/daemon/src/middleware/browser-boundary.ts"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"e505b8462a715ec2fe1bba173d67c249908ab4cfc384c972c5a3e93ed727b643"}},{"ruleId":"D2","level":"warning","message":{"text":"execution-model.stateWord (cognitive 19): execution-model.stateWord has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9, ternaries 4 (8 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/tui/src/execution/execution-model.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e14e2e14a9ce6b1ce7f8e34110a1bb3fd05ea175f7bb531f7a40727512de3f"}},{"ruleId":"D2","level":"warning","message":{"text":"usage-model.usageLines (cognitive 19): usage-model.usageLines has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 2 (4 pts), 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/tui/src/usage/usage-model.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c007b1159afc5634b790e51b2e12d045137fa9dcd468f21962dd66fbbec4491"}},{"ruleId":"D2","level":"warning","message":{"text":"layout.rankNodes (cognitive 19): layout.rankNodes has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 5 (6 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/tui/src/topology/layout.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"db70bb910927e3615e7eb4574da71610423b5ddfd14bd6ed68b2b82b64da8b4a"}},{"ruleId":"D2","level":"warning","message":{"text":"braille.renderBraille (cognitive 19): braille.renderBraille has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 3 (7 pts), loops 3, 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/tui/src/topology/styles/braille.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9fe2f7df356b4f5413f75bebfa5beb06a8b041fef0b481694790533ba4e1e4e"}},{"ruleId":"D2","level":"warning","message":{"text":"help.helpScreen (cognitive 19): help.helpScreen has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 9 (16 pts), loops 2, if/else 1 (nesting depth added 7). 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":"packages/tui/src/commands/help.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d69fe8f4cf453d31b63394710272f7d40d8c5c7e39953d2e63c5e0acf969715"}},{"ruleId":"D2","level":"warning","message":{"text":"cost-model.piHeadLine (cognitive 19): cost-model.piHeadLine has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 13 (19 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/tui/src/cost/cost-model.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df2206f81b79c67e8fbecbf4f36f31dd5215c235d743a015201425155551a0d"}},{"ruleId":"D2","level":"warning","message":{"text":"health-model.healthDetailLines (cognitive 19): health-model.healthDetailLines has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 8 (12 pts), if/else 3, loops 2 (3 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/tui/src/health/health-model.ts"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b1598523b0c465523547a4deb6e6fa836a0914658cdecb64b97ac9898283412"}},{"ruleId":"D2","level":"warning","message":{"text":"restore-input.restoreKeyAction (cognitive 19): restore-input.restoreKeyAction has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 2 (5 pts), boolean chains 4 (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/tui/src/crash-cart/restore-input.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e95a4b57e519b5cd47fe141941989954b3909f563aa3c9b308851cc1b144b9"}},{"ruleId":"D2","level":"warning","message":{"text":"SyntaxHighlight.tokenizeJson (cognitive 19): SyntaxHighlight.tokenizeJson has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 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/ui/src/components/markdown/SyntaxHighlight.tsx"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"28917927d887bd0b3dbc6f242f4e2e0f8f2b4ed7ef66cf1a6885490441657fb7"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsSystemStatusPanel.SettingsSystemStatusPanel (cognitive 19): SettingsSystemStatusPanel.SettingsSystemStatusPanel has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 11 (19 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/ui/src/components/system/SettingsSystemStatusPanel.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"b27b0b785994bf8441fa9df1d9cfa5b85085095eba084dab5421cbeaad4575fe"}},{"ruleId":"D2","level":"warning","message":{"text":"StoryGraph.StoryGraph (cognitive 19): StoryGraph.StoryGraph has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 9 (11 pts), if/else 5, loops 2, boolean chains 1 (nesting depth added 2). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to 6 function literals inside it that branch (lines 205, 225, 133, \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/ui/src/components/project/StoryGraph.tsx"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e56ffb055d5be26211f27283418847a63fbdf1ad510900870a44ce97b287a1"}},{"ruleId":"D2","level":"warning","message":{"text":"managed-blocks.mergeManagedBlockText (cognitive 18): managed-blocks.mergeManagedBlockText has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 4 (5 pts), boolean chains 2, ternaries 1 (nesting depth added 3). 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: 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/daemon/src/domain/managed-blocks.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"188b2293986216dc630f055840f190f0e39d6388c21ed58dd275f99d4b46ed7e"}},{"ruleId":"D2","level":"warning","message":{"text":"agent-activity-store.hookEventState (cognitive 18): agent-activity-store.hookEventState has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 6, ternaries 2 (4 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":"packages/daemon/src/domain/agent-activity-store.ts"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2e883658e04218811be7898bcbc6810d811eba85de9514b4df6af05a6bc642a"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-thread-id.resolveCodexDbPaths (cognitive 18): codex-thread-id.resolveCodexDbPaths has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 2 (4 pts), boolean chains 3, error handling 2, loops 1 (nesting depth added 5). 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, split the body into named stages: move each independent step or branch into 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/daemon/src/domain/codex-thread-id.ts"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"d058c71c27259175c065f638d14266b215cd724fbea0d7fe730fc554c7520538"}},{"ruleId":"D2","level":"warning","message":{"text":"pi-readiness.judgeChargeProvenance (cognitive 18): pi-readiness.judgeChargeProvenance has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 3 (7 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":"packages/daemon/src/adapters/pi-readiness.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1862531bd66bec77459eba6a81e857d62b7cbee28bbc1a08f2ad3c3775b1d2"}},{"ruleId":"D2","level":"warning","message":{"text":"OutboxHandler.retain (cognitive 18): OutboxHandler.retain has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 6 (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 462). 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/daemon/src/domain/outbox-handler.ts"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"87140973d77a36c86c043c8a7411fec8fa0bace8f4b7d2d3aa830d1640a63600"}},{"ruleId":"D2","level":"warning","message":{"text":"ActivityGrantStore.reconcileBinding (cognitive 18): ActivityGrantStore.reconcileBinding has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 6, error handling 1, loops 1 (nesting depth added 3). Most of this is not in the body itself: 3 of the 18 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 138, 146). 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/daemon/src/domain/activity-grants.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3dff6cba2ed261c22e23bc10bad7e549cab8870794a0e6013071acefcea3b39"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-rebuild-permissions.parseCodexPermissionEnvelope (cognitive 18): codex-rebuild-permissions.parseCodexPermissionEnvelope has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 10, if/else 8. 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/daemon/src/domain/codex-rebuild-permissions.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6361890635173968abf2272344ff49cb7bf6a483cef5359b739059e06b413c8"}},{"ruleId":"D2","level":"warning","message":{"text":"rig-repository.isStoredServices (cognitive 18): rig-repository.isStoredServices has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 10, if/else 8. 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/daemon/src/domain/rig-repository.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"354ad79453c519bac519a9709d95d18095c7c92cb6d66bd04f6a68e86cae13ed"}},{"ruleId":"D2","level":"warning","message":{"text":"claude-continuation-launch.resumedClaudeArguments (cognitive 18): claude-continuation-launch.resumedClaudeArguments has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 2 (4 pts), boolean chains 2, loops 1 (2 pts) (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":"packages/daemon/src/domain/claude-continuation-launch.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"d995cb2bf4153c1be8e96a1d896847bb14a703eb19d0df1d42cfbaf656ed0975"}},{"ruleId":"D2","level":"warning","message":{"text":"seat-skill-storage.writeSeatSkillRouter (cognitive 18): seat-skill-storage.writeSeatSkillRouter has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (7 pts), error handling 3 (5 pts), boolean chains 4, 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":"packages/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db35f72ea023ebfa9f055279685f3dc1269377e361e2752370592c8ccf47fc3"}},{"ruleId":"D2","level":"warning","message":{"text":"rigspec-schema.normalizePod.members (cognitive 18): rigspec-schema.normalizePod.members has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 16, boolean chains 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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":1320}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ccf25cf0d08e8b8ed4bdcd3d8532eb6da2594075151b3d7606149eca09ddf4"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeManagedLaunch.seatTokenLaunch (cognitive 18): ClaudeManagedLaunch.seatTokenLaunch has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 3 (4 pts), boolean chains 3, loops 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/daemon/src/domain/claude-managed-launch.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9fd72eccca7db05c5e75e5ad60582b9a7a0bf828fced04d2d47b46a02db20b"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenShellPodmanObserver.capture (cognitive 18): OpenShellPodmanObserver.capture has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 5). Of this number, 16 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/daemon/src/adapters/openshell-podman-observer.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd63467a35d7667665582268009c0c156629fb4e01d2d1a2e2af1258458bfd8"}},{"ruleId":"D2","level":"warning","message":{"text":"ChannelCoverageStore.read (cognitive 18): ChannelCoverageStore.read has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 8, 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/daemon/src/domain/gateway/slack/state-store.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"92692675cb8d9ed7e401277893162785927fe0aaea516d23bd55ffab9e23bcb1"}},{"ruleId":"D2","level":"warning","message":{"text":"ThreadCoverageStore.read (cognitive 18): ThreadCoverageStore.read has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 8, 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/daemon/src/domain/gateway/slack/state-store.ts"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad2653518e143660f89d6b878477f4013e5463c0240a1dc97f163f93948d797"}},{"ruleId":"D2","level":"warning","message":{"text":"inbound.ingestDecision (cognitive 18): inbound.ingestDecision has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 8 (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/daemon/src/domain/gateway/slack/inbound.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc4c12616fcbf274177daf0276a3d710e523de82e23894d18eb3c0ee0365f96"}},{"ruleId":"D2","level":"warning","message":{"text":"slack-api.postChatMessage (cognitive 18): slack-api.postChatMessage has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 4, ternaries 3 (4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/gateway/slack/slack-api.ts"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a4ab077232b90e9fd6b713330b81413f72919a86bdbccbae798bee0c41d3ca"}},{"ruleId":"D2","level":"warning","message":{"text":"return-route.resolveEscalationReturnRoute (cognitive 18): return-route.resolveEscalationReturnRoute has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 3 (4 pts), error handling 1 (nesting depth added 5). Of this number, 16 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":"packages/daemon/src/domain/return-route.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"e997a2dcde4ec4733c0400dc20ce487971201aba07fa27ccc0965da96f1c0241"}},{"ruleId":"D2","level":"warning","message":{"text":"markdown-address.parseMarkdownSections (cognitive 18): markdown-address.parseMarkdownSections has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (7 pts), ternaries 2 (5 pts), loops 3 (4 pts), boolean chains 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/daemon/src/domain/markdown-address.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"10349f72aa028baa35aff9bcc63ddbf22bf16d1f5a0ddee08033c809cf5cc8da"}},{"ruleId":"D2","level":"warning","message":{"text":"compose.composeMissionReview (cognitive 18): compose.composeMissionReview has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (6 pts), boolean chains 4, loops 3 (4 pts), ternaries 3, match/switch 1 (nesting depth added 4). Of this number, 13 points are the body\u0027s own statements and 5 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":"packages/daemon/src/domain/review/compose.ts"},"region":{"startLine":1297}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5e8124d8711277856cfdb5f88832f49752da1b0e1cf4aee5a5f8b19c8c779a"}},{"ruleId":"D2","level":"warning","message":{"text":"SliceIndexer.findProofPacket (cognitive 18): SliceIndexer.findProofPacket has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 3, error handling 2 (3 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 5). 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/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":1539}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe10e5f6ddcbbcb2483990d880fb99ec6c17b5806fd7adf49d0151cbff98f3d4"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-limit-banner.detectCodexLimitBanner (cognitive 18): codex-limit-banner.detectCodexLimitBanner has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (4 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":"packages/daemon/src/domain/provider/codex-limit-banner.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f0ba2a0d8995ff1b63fbf42fbc2ca702b30369ed5eee774706f548f087e69a"}},{"ruleId":"D2","level":"warning","message":{"text":"HookBridge.poll (cognitive 18): HookBridge.poll has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 2, boolean chains 1, ternaries 1 (nesting depth added 4). Of this number, 14 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/daemon/src/domain/hook-bridge.ts"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c25f47ae46ce50efa25570d3bc0488e84a8d4a33341c5af3f53c8badccd0940"}},{"ruleId":"D2","level":"warning","message":{"text":"EnvironmentLifecycle.checkCompletions (cognitive 18): EnvironmentLifecycle.checkCompletions has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 2 (5 pts), error handling 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":"packages/daemon/src/domain/environment-lifecycle.ts"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"43525f31fed47d18b4e6f377e7ddb2838f5cd92163ae5525b58ab76a9dd9f513"}},{"ruleId":"D2","level":"warning","message":{"text":"TmuxAdapter.killSession (cognitive 18): TmuxAdapter.killSession has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 7). Most of this is not in the body itself: 4 of the 18 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 2172, 2184). 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/daemon/src/adapters/tmux.ts"},"region":{"startLine":2169}}}],"partialFingerprints":{"codehealthFindingId/v1":"35896c8516c56b24f3ab693255e1f86ae56dbee5ac71b22e3430d66ff0916ca2"}},{"ruleId":"D2","level":"warning","message":{"text":"terminal-policy.parseTerminalPolicy (cognitive 18): terminal-policy.parseTerminalPolicy has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 6, 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":"packages/daemon/src/domain/terminal-policy.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c6ca248478993d261be79b196803493c7bd3fc4e6020b0952817b0a1dbfb023"}},{"ruleId":"D2","level":"warning","message":{"text":"native-resume-probe.insideClaudeTrustDialog (cognitive 18): native-resume-probe.insideClaudeTrustDialog has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 7, loops 2 (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/daemon/src/domain/native-resume-probe.ts"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"32bf6d41783923dbfcfb7729c76f217eaed6f52e77f8746b21495aaabd3124ee"}},{"ruleId":"D2","level":"warning","message":{"text":"fetch-with-timeout.fetchWithTimeout (cognitive 18): fetch-with-timeout.fetchWithTimeout has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 3, 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":"packages/cli/src/fetch-with-timeout.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"edbf43e4ed9a2705cb3bafcf3c20d73d8c324644c45eb98b290509e3d97201df"}},{"ruleId":"D2","level":"warning","message":{"text":"daemon-lifecycle.findSiblingHome (cognitive 18): daemon-lifecycle.findSiblingHome has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), error handling 2 (3 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":"packages/cli/src/daemon-lifecycle.ts"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c6c81d52a3e88fc59cf6c671649a99e79bd953407ae8047e5125e2a826615f"}},{"ruleId":"D2","level":"warning","message":{"text":"archive.archiveCommand (cognitive 18): archive.archiveCommand has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 1, ternaries 1 (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 36). 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/commands/archive.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b5f9118a04d0c83a52cdf52fd0092d2858b8ce5f5610d4265e60396235fc659"}},{"ruleId":"D2","level":"warning","message":{"text":"bundle-source.selectGitHubBundleSource (cognitive 18): bundle-source.selectGitHubBundleSource has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (4 pts), boolean chains 2, 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":"packages/cli/src/lib/bundle-source.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33dff9ffea2736008d4ac121909e3a545d7856dcee7e2049d82076e65ac29a7"}},{"ruleId":"D2","level":"warning","message":{"text":"bundle.bundleInstallError (cognitive 18): bundle.bundleInstallError has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 4 (7 pts), loops 3, 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":"packages/cli/src/commands/bundle.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"021dea2e86a25b61f6c0643bf5b837bc9f6b818c4771621fc5a1c58504418fb5"}},{"ruleId":"D2","level":"warning","message":{"text":"doctor.listenerOwnerCheck (cognitive 18): doctor.listenerOwnerCheck has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 6 (9 pts), boolean chains 4, if/else 4, 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/commands/doctor.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"874c3837a89acc82092536007c49cf0053ef397dd82eac1b6e7925f2694e2d48"}},{"ruleId":"D2","level":"warning","message":{"text":"edge.report (cognitive 18): edge.report has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 2 (5 pts), match/switch 1 (2 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":"packages/cli/src/commands/edge.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"953918d8cfdde4d998437d0932b55052f5cad1121f284fb0229a5ecc2fc7a553"}},{"ruleId":"D2","level":"warning","message":{"text":"edge.edgeCommand (cognitive 18): edge.edgeCommand has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 7, ternaries 2, error handling 1 (nesting depth added 1). None of this is in the body itself: all 18 points belong to 3 function items inside it that branch (run, a function literal at line 147, a function literal at line 164). 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/commands/edge.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c9387fc143e1d6c086b8ab3f6e7aa2f9fd7738e4172192b0d2cf1efcb15aa4"}},{"ruleId":"D2","level":"warning","message":{"text":"preflight.preflightCommand (cognitive 18): preflight.preflightCommand has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 1 (nesting depth added 8). None of this is in the body itself: all 18 points belong to one function literal inside it that branches (line 19). 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/commands/preflight.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd58756208250a661cf04b3f43428741938ec808fe3757021de3799d8f960107"}},{"ruleId":"D2","level":"warning","message":{"text":"queue.withClient (cognitive 18): queue.withClient has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 3 (7 pts), if/else 4 (6 pts), boolean chains 4, 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/cli/src/commands/queue.ts"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"967454c4968837d34bebea5165b4070e3ad324fa0da251f7dcf369aac1a6220a"}},{"ruleId":"D2","level":"warning","message":{"text":"queue.emitHandoffScopeAdvisories (cognitive 18): queue.emitHandoffScopeAdvisories has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (14 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, 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/commands/queue.ts"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd16acaa3c73a4dc1b61dfb19a623973456a0001783006bb4169ea5c48b3c9c9"}},{"ruleId":"D2","level":"warning","message":{"text":"restore-check.printCompact (cognitive 18): restore-check.printCompact has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 4 (8 pts), 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":"packages/cli/src/commands/restore-check.ts"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85540a81b1e71bc2c302ff9d5a4f51dc52a2334c5f5a8903da4420ce26b95eb"}},{"ruleId":"D2","level":"warning","message":{"text":"skill.skillCommand::describeDelivery (cognitive 18): skill.skillCommand::describeDelivery has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 5 (16 pts), boolean chains 1, match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: 2 other methods here (skill.skillCommand::seatLoadout, skill.skillCommand::printSeat) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 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/commands/skill.ts"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"249ae85192cfd476856d7fc44b91e4081177eade820164753cc6239633438668"}},{"ruleId":"D2","level":"warning","message":{"text":"workspace.renderHumanDoctorReport (cognitive 18): workspace.renderHumanDoctorReport has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (5 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/commands/workspace.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d002a014a36ef30b43a036542e84c0a9a86379b1fd716be95019a8ff9c4823d"}},{"ruleId":"D2","level":"warning","message":{"text":"restore-from-jsonl.findLatestJsonl (cognitive 18): restore-from-jsonl.findLatestJsonl has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), error handling 1 (3 pts), loops 2 (3 pts), ternaries 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":"packages/daemon/assets/plugins/openrig-core/skills/claude-compaction-restore/scripts/restore-from-jsonl.mjs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"964bd14b5eb174fe46bfbd24c8a02bc60c5e0eb39428dc00511a720a1c1df114"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-network-default.converse (cognitive 18): codex-network-default.converse has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (nesting depth added 6). None of this is in the body itself: all 18 points belong to 3 function literals inside it that branch (lines 183, 169, 176). 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/daemon/src/domain/codex-network-default.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa716ecbacb3216d0193116eba057fa21804bc726f3df6935cce6d9a4a15f4ed"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeCodeAdapter.provisionContextCollector (cognitive 18): ClaudeCodeAdapter.provisionContextCollector has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 5, error handling 1 (3 pts), ternaries 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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":1268}}}],"partialFingerprints":{"codehealthFindingId/v1":"490d72a555d77d4d01e3bfa1bddb2ecca2d105d829416f1409736ab63a991d02"}},{"ruleId":"D2","level":"warning","message":{"text":"cmux-transport.normalizeWorkspaceRow (cognitive 18): cmux-transport.normalizeWorkspaceRow has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 6 (13 pts), boolean chains 3, if/else 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/daemon/src/adapters/cmux-transport.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ff3eb15e4fe17dd91c012b0ab39fb0723b4a24f79c39dca7f4a04f64aea5af"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-owned-plugin-trust.codexPluginContentHash::visit (cognitive 18): codex-owned-plugin-trust.codexPluginContentHash::visit has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (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":"packages/daemon/src/domain/codex-owned-plugin-trust.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1589bdfb3f00e19bbc9833f06d70fe03cb224ca97a5068254c21baf2144ac7d"}},{"ruleId":"D2","level":"warning","message":{"text":"pi-openrouter-charge.openRouterGenerationFetcher.\u003Creturned closure\u003E (cognitive 18): pi-openrouter-charge.openRouterGenerationFetcher.\u003Creturned closure\u003E has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 2, error handling 2, loops 1 (2 pts), 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/daemon/src/adapters/pi-openrouter-charge.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67800ef169b71e95c50988c75521b45cf2b6a63a31b9fa0ff54fd281a4626a4"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerCore.handlePiLine (cognitive 18): RunnerCore.handlePiLine has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 2 (5 pts), boolean chains 1, 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c724ba0ba3961fcc33fd12900b02b5c37d68da258831f13cffe16576f5f8f1"}},{"ruleId":"D2","level":"warning","message":{"text":"pi-runner.resolveActivityEndpoint (cognitive 18): pi-runner.resolveActivityEndpoint has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, if/else 4 (6 pts), error handling 1 (2 pts), ternaries 1 (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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":2004}}}],"partialFingerprints":{"codehealthFindingId/v1":"c042a1e1636cd9700400d4038c90409c8988d05d9bbc982443860d4e60f84e4b"}},{"ruleId":"D2","level":"warning","message":{"text":"stub-runner.resolveStubActivityEndpoint (cognitive 18): stub-runner.resolveStubActivityEndpoint has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, if/else 4 (6 pts), error handling 1 (2 pts), ternaries 1 (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/daemon/src/adapters/stub-runner.ts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7b1e9dedbdc7a7351e207acd81b615aec7ecbe1288043027d83131b944c6ea"}},{"ruleId":"D2","level":"warning","message":{"text":"bundle-types.validatePluginsBlock (cognitive 18): bundle-types.validatePluginsBlock has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 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":"packages/daemon/src/domain/bundle-types.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8bbad9914dbdb987e34fb285610223a8dc9528d498f683707b2b19977218908"}},{"ruleId":"D2","level":"warning","message":{"text":"bundle-types.serializeLegacyBundleManifest (cognitive 18): bundle-types.serializeLegacyBundleManifest has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, boolean chains 6, ternaries 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, 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/daemon/src/domain/bundle-types.ts"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d280e71e6fb686f1c29ccb3bda46e3dffd5c101c191b8fd4b1af4f699ffe222"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentImageLibraryService.scan (cognitive 18): AgentImageLibraryService.scan has cognitive complexity 18 (threshold 15). Drivers by points: if/else 2 (6 pts), error handling 2 (5 pts), ternaries 1 (4 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/agent-images/agent-image-library-service.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a18cbaee0ba81705a18475f5ef5b4cabf6efd91b630db402b6fca9b54bd2cec"}},{"ruleId":"D2","level":"warning","message":{"text":"agent-starter-resolver.scanForCredentials (cognitive 18): agent-starter-resolver.scanForCredentials 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":"packages/daemon/src/domain/agent-starter-resolver.ts"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"3560f1e2176c94d535195ec12e39b037ac56f7a414fe1244acca3be7cd7c5ce9"}},{"ruleId":"D2","level":"warning","message":{"text":"PodRigInstantiator.launchValidatedSpec (cognitive 18): PodRigInstantiator.launchValidatedSpec has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 5 (9 pts), if/else 3 (6 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":"packages/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"100bf6a2690dd5f23f95ef904e17059f90eac27611ac638f2de67f72974c597d"}},{"ruleId":"D2","level":"warning","message":{"text":"PodRigInstantiator.persistedMember (cognitive 18): PodRigInstantiator.persistedMember has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 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":"packages/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":2283}}}],"partialFingerprints":{"codehealthFindingId/v1":"285b6ed301560e51f5f52ad88acf322c6729a1d014692b8c5da59868e64f7e09"}},{"ruleId":"D2","level":"warning","message":{"text":"PodRigInstantiator.launchExistingTerminalMember (cognitive 18): PodRigInstantiator.launchExistingTerminalMember has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 7 (9 pts), if/else 6, error handling 2, 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":"packages/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":2975}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c43d1a345e0aedfbda2d268699cb879f7dfac5579b32b6619b7e6b8cc72112a"}},{"ruleId":"D2","level":"warning","message":{"text":"LegacyBundleSourceResolver.resolve (cognitive 18): LegacyBundleSourceResolver.resolve has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 2 (4 pts), ternaries 1 (3 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/daemon/src/domain/bundle-source-resolver.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"600268db7eec15d058134c789701f0369966ff3da918d6660bea4c9d0ec36891"}},{"ruleId":"D2","level":"warning","message":{"text":"profile-composer.composeProfile (cognitive 18): profile-composer.composeProfile has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (4 pts), ternaries 2, 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/daemon/src/domain/context-packs/profile-composer.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"582cca298980cdb57d4a8eabb0af4a6f5b3553adeeee8b16e9eeac8f51229dd6"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaimService.bind (cognitive 18): ClaimService.bind has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), error handling 4, boolean chains 3, ternaries 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/daemon/src/domain/claim-service.ts"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a94f1b3bb358d46043e1ef429276be80517137488d2200cacd999010cb96d0"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaimService.createAndBindToPod (cognitive 18): ClaimService.createAndBindToPod has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (11 pts), error handling 4, boolean chains 2, ternaries 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/daemon/src/domain/claim-service.ts"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf2650e7e705bfb48cd66eb47d40833d6b03bdda718b56a416a9c5cb3a8c90c"}},{"ruleId":"D2","level":"warning","message":{"text":"current-work.deriveRole (cognitive 18): current-work.deriveRole has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 6, ternaries 3 (6 pts), if/else 4, error handling 2 (nesting depth added 3). Of this number, 17 points are the body\u0027s own statements and 1 belongs 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":"packages/daemon/src/domain/current-work.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"939541077747ae8f2390bf9c935d5fddaf830f6e33a18ddd1ad41d872fd6a177"}},{"ruleId":"D2","level":"warning","message":{"text":"workflow-projector.compileGate (cognitive 18): workflow-projector.compileGate has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 1 (3 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":"packages/daemon/src/domain/workflow-projector.ts"},"region":{"startLine":1896}}}],"partialFingerprints":{"codehealthFindingId/v1":"d777a58509971b074ce2c1e85fe998152d5f26ad4e198112564742b8da04497e"}},{"ruleId":"D2","level":"warning","message":{"text":"execution-view.readReviewRegistry (cognitive 18): execution-view.readReviewRegistry has cognitive complexity 18 (threshold 15). Drivers by points: if/else 2 (8 pts), loops 3 (6 pts), error handling 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/execution-view.ts"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"af8cf36b1f73fa4ff1d82f80e30529b9e2612b80cd7df3dce7f386963035efd9"}},{"ruleId":"D2","level":"warning","message":{"text":"relay-inbound.parseInboundEnvelope (cognitive 18): relay-inbound.parseInboundEnvelope has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 7, error handling 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/daemon/src/domain/gateway/relay-inbound.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ca3ca8548d625b4828ee6a68d95ab2ebb36b2affbfae255b4c85122dbe21a3"}},{"ruleId":"D2","level":"warning","message":{"text":"UsageWindows.runRead (cognitive 18): UsageWindows.runRead has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), error handling 2 (5 pts), 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":"packages/daemon/src/domain/provider/usage-windows.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5da0889b591e8a9dfdd094fcea6a90e2a50a83c9a19c8943e1c313bef727274"}},{"ruleId":"D2","level":"warning","message":{"text":"fleet-scopes.aggregateFleetScopes (cognitive 18): fleet-scopes.aggregateFleetScopes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 3 (5 pts), boolean chains 3, loops 2 (nesting depth added 5). Most of this is not in the body itself: 6 of the 18 points are its own statements and the rest belongs to 2 function items inside it that branch (worker, a function literal at line 279). 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/daemon/src/domain/hosts/fleet-scopes.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"71104fce7b6745cb8dffa45be31eef84b5e5ea93dd69b13489329412782f56df"}},{"ruleId":"D2","level":"warning","message":{"text":"NetworkInstallationStore.setParticipants (cognitive 18): NetworkInstallationStore.setParticipants has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 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":"packages/daemon/src/domain/network/network-installations.ts"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b465e21812a115d2c4660c231b9cd4b5dcd44c07dfe0f8780e66d9262a8d53"}},{"ruleId":"D2","level":"warning","message":{"text":"watchdog-policy-engine.parseWatchdogSpec (cognitive 18): watchdog-policy-engine.parseWatchdogSpec has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 5, ternaries 3 (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/daemon/src/domain/watchdog-policy-engine.ts"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be25ddd287ab31efc8ee45d8b5e7ddaa10c9cf4d7e9ba85d25fa5bd5c3b1d00"}},{"ruleId":"D2","level":"warning","message":{"text":"PluginDiscoveryService.assertNoDuplicateVendoredHooks (cognitive 18): PluginDiscoveryService.assertNoDuplicateVendoredHooks has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (6 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/daemon/src/domain/plugin-discovery-service.ts"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe29eb3e1121e56f16470733b1727e5c1713d3cc942ec975ac68a5741ec9d61"}},{"ruleId":"D2","level":"warning","message":{"text":"PluginVendorService.ensureSkillDirGlobally (cognitive 18): PluginVendorService.ensureSkillDirGlobally has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 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":"packages/daemon/src/domain/plugin-vendor-service.ts"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e84a7bbbbc01bb02ae4fdbef7f6418f42daebc46b5a2a89aff9353272d27e2"}},{"ruleId":"D2","level":"warning","message":{"text":"mode-scheduled-end.recipientFor (cognitive 18): mode-scheduled-end.recipientFor has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (12 pts), ternaries 3 (4 pts), boolean chains 1, error handling 1 (nesting depth added 3). Of this number, 17 points are the body\u0027s own statements and 1 belongs 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/policies/mode-scheduled-end.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d0f4eaa9b475075849e15ba12028c1086bd74917ed15d91d0abd024c5c6d54"}},{"ruleId":"D2","level":"warning","message":{"text":"seat-cwd-preparation.planCwdPreparation (cognitive 18): seat-cwd-preparation.planCwdPreparation has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3, boolean chains 2, 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/daemon/src/domain/seat-cwd-preparation.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"09041698ca97e10b27c905ad295eaceb07a26d8e5c082d33a74dae2630b69f2b"}},{"ruleId":"D2","level":"warning","message":{"text":"CodexInPlaceRestart.readToolTurn (cognitive 18): CodexInPlaceRestart.readToolTurn has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, error handling 1 (2 pts), ternaries 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":"packages/daemon/src/domain/seat-restart-in-place.ts"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab6ef32e0efa3e4f51cdb57e0f772d2dd869ede65c0acd389e67b7ee3aeb604d"}},{"ruleId":"D2","level":"warning","message":{"text":"usage-across-hosts.selectUsageHosts (cognitive 18): usage-across-hosts.selectUsageHosts has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 5, ternaries 2 (3 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/daemon/src/domain/provider/usage-across-hosts.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"604c47a9d43fc430d6bc74f8a50f8685dbdbb26ee133eba9bb50eb9962fed15f"}},{"ruleId":"D2","level":"warning","message":{"text":"queue-retention.pruneStreamItems (cognitive 18): queue-retention.pruneStreamItems has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 6, boolean chains 3, loops 1 (nesting depth added 1). Of this number, 11 points are the body\u0027s own statements and 7 belong to 3 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/daemon/src/domain/queue-retention.ts"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f4afb1a8cc8749fcb6cb2c40cf3f8875eaae1a235b5c3e7ce0314a4ae4dbfe9"}},{"ruleId":"D2","level":"warning","message":{"text":"fleet-compose.readHostComposedRig (cognitive 18): fleet-compose.readHostComposedRig has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 3 (7 pts), boolean chains 1, 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":"packages/daemon/src/domain/review/fleet-compose.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"411b04cd83ec711827746c55b9cbce75af9979fb6bb21b377abf9e3a820c5122"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime-switch-materials.planRuntimeSwitchMaterials.prepare (cognitive 18): runtime-switch-materials.planRuntimeSwitchMaterials.prepare has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, loops 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/daemon/src/domain/runtime-switch-materials.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40c99b207e3c0e8f94233724e4f2e791ac26b6af541ebfa4e85b8c0be434396"}},{"ruleId":"D2","level":"warning","message":{"text":"herdr-viewer.findAttributedViewerPanes (cognitive 18): herdr-viewer.findAttributedViewerPanes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 4, 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/daemon/src/domain/terminal/herdr-viewer.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"588023c000a5820f30de6a18b84478e602eeca8e37f020442c772f92b8601461"}},{"ruleId":"D2","level":"warning","message":{"text":"scope-task-terminal-view.readScopeIndex (cognitive 18): scope-task-terminal-view.readScopeIndex has cognitive complexity 18 (threshold 15). Drivers by points: if/else 17 (39 pts), error handling 5 (10 pts), boolean chains 8, ternaries 6 (8 pts), loops 5 (6 pts) (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. This shape REPEATS in the file: one other method here (scope-task-terminal-view.readScopeIndex::add) 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/daemon/src/domain/terminal/scope-task-terminal-view.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ae171e18107e66f254ed0ed40bdea5380209a8a5666359c51089884fea5e0b"}},{"ruleId":"D2","level":"warning","message":{"text":"activity.evidenceFromHookActivity (cognitive 18): activity.evidenceFromHookActivity has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 7 (10 pts), boolean chains 4, if/else 3, 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":"packages/daemon/src/routes/activity.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"475fd28356293d9e878c1ba33d057c8256eb565fc88fe2497e2c4340593f171b"}},{"ruleId":"D2","level":"warning","message":{"text":"startup.observeSeat (cognitive 18): startup.observeSeat has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 3 (5 pts), boolean chains 4, 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/daemon/src/routes/startup.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"32cc338e111fd4bc054edeb4426843e532bada576df284f9e70176f5ac6d23c5"}},{"ruleId":"D2","level":"warning","message":{"text":"workflow-model.actionLines (cognitive 18): workflow-model.actionLines has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (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":"packages/tui/src/execution/workflow-model.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c58619539693a6e9a5f155f52fe5c404ba93301ca9fd9499da6e27800513a7b"}},{"ruleId":"D2","level":"warning","message":{"text":"execution-model.executionSliceStripLines (cognitive 18): execution-model.executionSliceStripLines has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 9 (11 pts), boolean chains 5, if/else 2 (nesting depth added 2). 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: 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/tui/src/execution/execution-model.ts"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac0842d3786c505d4decb75e6bde6d5a241290ad36bf0fc464bf1834af4ddfa"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime-marks.clawdFaithfulRows (cognitive 18): runtime-marks.clawdFaithfulRows has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 2 (7 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). Of this number, 11 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/tui/src/topology/runtime-marks.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"566b92f41f5a31e3e6eecfe775e9945907f9bc752d327bcd9d98cf6c6487508a"}},{"ruleId":"D2","level":"warning","message":{"text":"state.findAgentBySession (cognitive 18): state.findAgentBySession has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 1 (5 pts), boolean chains 2, ternaries 1 (nesting depth added 10). 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":"packages/tui/src/state.ts"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a5dadc8c921dfc5704487e9bda47e3b92fac8a88e728f20c8310ab6772f0d4"}},{"ruleId":"D2","level":"warning","message":{"text":"cost-model.detailLines (cognitive 18): cost-model.detailLines has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 3 (7 pts), boolean chains 3 (nesting depth added 6). Of this number, 15 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/tui/src/cost/cost-model.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32dd08e7cd3c272266d848a62f0c48f626ea39769c094a21dbeec97973c6fc8"}},{"ruleId":"D2","level":"warning","message":{"text":"render.effortSavedText (cognitive 18): render.effortSavedText has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 4 (9 pts), if/else 6 (8 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":"packages/tui/src/render.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad79b4afddb2a2aab97b2637f8b387e93b9cd7eefc7f3a978a893c592288463"}},{"ruleId":"D2","level":"warning","message":{"text":"live.createLiveRefresh.readPage (cognitive 18): live.createLiveRefresh.readPage has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 5, loops 1 (2 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/tui/src/live.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e9a53c22d911ff870b66168f1d5c135c1cd0adfe093ecbbd1d134061dcf62c"}},{"ruleId":"D2","level":"warning","message":{"text":"main.run (cognitive 18): main.run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 132 (253 pts), boolean chains 69, ternaries 24 (46 pts), error handling 5 (8 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 148). To reduce it, split the body into named stages: move each independent 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: 3 other methods here (main.run::draw, main.run::executeAct, main.run::handleInput) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 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/tui/src/main.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"d197a622c1c384890ff7e234e91b5d6296fea6cad97a8ab6081d7252fa442bee"}},{"ruleId":"D2","level":"warning","message":{"text":"hybrid-layout.layoutHybridRig (cognitive 18): hybrid-layout.layoutHybridRig has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 6 (7 pts), boolean chains 2 (nesting depth added 5). 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, split the body into named stages: move each independent step or branch into 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/ui/src/lib/hybrid-layout.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f7d2f6a5c5d769aba8e2b7091395616cf544469ae9a3c985a58fd280bff561"}},{"ruleId":"D2","level":"warning","message":{"text":"HostMultiRigGraph.HostMultiRigGraph (cognitive 18): HostMultiRigGraph.HostMultiRigGraph has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 4, boolean chains 1 (nesting depth added 3). 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 items inside it that branch (onNodeClick, a function literal at line 134, a function literal at line 272, \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/ui/src/components/topology/HostMultiRigGraph.tsx"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c8c496f267ba7e3585c4cd383cd464782de3d256c9140126c16388e94e5772"}},{"ruleId":"D2","level":"warning","message":{"text":"ScopePages.HostScopePage (cognitive 18): ScopePages.HostScopePage has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 9 (10 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":"packages/ui/src/components/topology/ScopePages.tsx"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbbb9ee180916714d84439655247c30a0da19ec1c784eb88f8a4493af4dcc811"}},{"ruleId":"D2","level":"warning","message":{"text":"ScopePages.RigOverviewTab (cognitive 18): ScopePages.RigOverviewTab has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 6 (13 pts), boolean chains 3, if/else 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/ui/src/components/topology/ScopePages.tsx"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"9381a667f67bdf8b8bbb293cbe0663147383a169dee43bce492ca6a64248a172"}},{"ruleId":"D2","level":"warning","message":{"text":"useScopeMarkdown.useScopeMarkdown (cognitive 18): useScopeMarkdown.useScopeMarkdown has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8, ternaries 5 (6 pts), 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":"packages/ui/src/hooks/useScopeMarkdown.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f88784571c0fc04406bc129b889b3333cdd8b5751d3493dd2f1b04f90e7ccb"}},{"ruleId":"D2","level":"warning","message":{"text":"ScopePages.WorkspaceScopePage (cognitive 18): ScopePages.WorkspaceScopePage has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 11 (12 pts), boolean chains 5, if/else 1 (nesting depth added 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, 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/ui/src/components/project/ScopePages.tsx"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d7680aed3868b279f859c59a8f25f20f97d8bebcf01eba2bd3e30fb5692b1d"}},{"ruleId":"D2","level":"warning","message":{"text":"FleetPage.FleetPage (cognitive 18): FleetPage.FleetPage has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 11 (15 pts), if/else 2, boolean chains 1 (nesting depth added 4). Of this number, 10 points are the body\u0027s own statements and 8 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":"packages/ui/src/components/review/FleetPage.tsx"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea8aef5013393071c088075c6f0cf115f3fa93a1625394fae6e141b48174e610"}},{"ruleId":"D2","level":"warning","message":{"text":"follow (cognitive 18): follow has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 6, other 2, loops 1, ternaries 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/daemon/assets/herdr-app/mods/rig-strip/main.js"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f17f46aa9f75b29fc5a15c15cf058b836e8f04d8e08430deff26abbed3d3be4"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentActivityStore.getRunnerObservation (cognitive 17): AgentActivityStore.getRunnerObservation has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, boolean chains 5, ternaries 2, error handling 1. Of this number, 16 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/daemon/src/domain/agent-activity-store.ts"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e52d0c9d20752cea7cb478ec19e25fc70e2e9428061f4480b2a1d915c8eefd7"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentActivityStore.findCompactSessionStart (cognitive 17): AgentActivityStore.findCompactSessionStart has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 4, error handling 1 (2 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 4). Of this number, 12 points are the body\u0027s own statements and 5 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/daemon/src/domain/agent-activity-store.ts"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b6b1002a99da7907d154dfe58432eb9d37472621e33550fc1c590de36378095"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsStore.resolveOneUnpaired (cognitive 17): SettingsStore.resolveOneUnpaired has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 2 (6 pts), error handling 2 (4 pts), if/else 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":"packages/daemon/src/domain/user-settings/settings-store.ts"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"4efa35242d0febc6852f673fe05ffe00e5c5755b3bf1fe199bcb0a8aa8f9128d"}},{"ruleId":"D2","level":"warning","message":{"text":"startup-validation.validateStartupBlock (cognitive 17): startup-validation.validateStartupBlock has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 2 (6 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/startup-validation.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"90dac061156bff9a2c6005cb47103be634b5af2e8498fc18645239ebbe762e80"}},{"ruleId":"D2","level":"warning","message":{"text":"seat-skill-storage.rehydrateSeatSkills (cognitive 17): seat-skill-storage.rehydrateSeatSkills has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), error handling 3 (7 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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"788316f1f110a106f8940dabe90942af716f3d17e5988be42a5ca308216e0dfd"}},{"ruleId":"D2","level":"warning","message":{"text":"seat-skill-storage.recordedSeatSkillFiles (cognitive 17): seat-skill-storage.recordedSeatSkillFiles has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 3 (4 pts), boolean chains 3, 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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4120182771749e97a1eb73e43171a22a2fb977f3c5deffc4a8b5fbd91ffa997"}},{"ruleId":"D2","level":"warning","message":{"text":"rigspec-schema.validateCrossPodEdge (cognitive 17): rigspec-schema.validateCrossPodEdge has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (12 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":"packages/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"e213b6562a034a09ef817c76179f06942df913f679571eb890abe6f6892feff6"}},{"ruleId":"D2","level":"warning","message":{"text":"human-registry.projectHumans (cognitive 17): human-registry.projectHumans has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), error handling 1 (3 pts), ternaries 2 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 8). Of this number, 13 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/daemon/src/domain/gateway/human-registry.ts"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc99f49865b5de4a8cf2366ebaa8da704852df3f9cd0acf306ed21e06f79801"}},{"ruleId":"D2","level":"warning","message":{"text":"parked-owner-consumer.changedSince (cognitive 17): parked-owner-consumer.changedSince has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 2 (3 pts), ternaries 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":"packages/daemon/src/domain/policies/parked-owner-consumer.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97d2777b35eb430d87aee5bc5bad46a140880c66b88e37b9a178478fa94303b"}},{"ruleId":"D2","level":"warning","message":{"text":"markdown-address.validateMarkdownAddressability (cognitive 17): markdown-address.validateMarkdownAddressability has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 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":"packages/daemon/src/domain/markdown-address.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f76335e4855e2561808e1256ff08b576cba7693213a15b8fe755176aaf906a"}},{"ruleId":"D2","level":"warning","message":{"text":"QueueWakeRepository.getStatus (cognitive 17): QueueWakeRepository.getStatus has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 7, if/else 5 (6 pts), ternaries 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":"packages/daemon/src/domain/queue-wake-repository.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d2928a578d856e6d35dc6579a59e1a48c173f345e980d4ccee220a0b7a42b5"}},{"ruleId":"D2","level":"warning","message":{"text":"QueueRepository.classifyOwnerNotification (cognitive 17): QueueRepository.classifyOwnerNotification has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 5, ternaries 2 (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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":1435}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c1f709bab1d11dbdb23036342d659f01502a6c9a8aed8b3e2dd92a8cd753ff3"}},{"ruleId":"D2","level":"warning","message":{"text":"QueueRepository.deliverWakeIntent::claim (cognitive 17): QueueRepository.deliverWakeIntent::claim has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 4, 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. This shape REPEATS in the file: one other method here (QueueRepository.deliverWakeIntent) 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":1709}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9f38628e8760464e3f0c1973d02fae9d4fbbf3cf21415c404c8b7c942a09ae"}},{"ruleId":"D2","level":"warning","message":{"text":"QueueRepository.listRows (cognitive 17): QueueRepository.listRows has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7, ternaries 6 (7 pts), boolean chains 3 (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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":5110}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb52e06652554aa232190339d756c353b2752361c186884d8c46b808de200b0"}},{"ruleId":"D2","level":"warning","message":{"text":"StartupOrchestrator.fail (cognitive 17): StartupOrchestrator.fail has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 10 (12 pts), if/else 3, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/startup-orchestrator.ts"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0625173f61e7b95cc7aa25d50bf110e22f01be3958ebc7c575e2cc22fefe050"}},{"ruleId":"D2","level":"warning","message":{"text":"session-transport.styledLines (cognitive 17): session-transport.styledLines has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (6 pts), boolean chains 2 (nesting depth added 7). None of this is in the body itself: all 17 points belong to one function literal inside it that branches (line 706). 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ca2a47a17e2484b434e7727a3a1592c0aa055add70cea120302f120b05aa7b"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeCompactionEnforcer.observedCompaction (cognitive 17): ClaudeCompactionEnforcer.observedCompaction has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 4 (9 pts), if/else 7, 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec3b275aa5849e9d33e2356a8019a9e946d8dc6601da06e6e1ca786bab5ef3c"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeCompactionEnforcer.recordRestoreFailure (cognitive 17): ClaudeCompactionEnforcer.recordRestoreFailure has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 11, boolean chains 5, if/else 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53527ae764d36face88f7f5fcabf6fa98780117fa9126df5b767790f7b1bca9"}},{"ruleId":"D2","level":"warning","message":{"text":"check-runner.launch (cognitive 17): check-runner.launch has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 11, if/else 4, error handling 1, ternaries 1. Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to 11 function literals inside it that branch (lines 225, 229, 232, \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":"docs/reference/runner-conformance/check-runner.mjs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"03dabee317ca55f543c4d701d822a0e31dd237856e757db2868df66f8e2d035c"}},{"ruleId":"D2","level":"warning","message":{"text":"fake-acp-agent.prompt (cognitive 17): fake-acp-agent.prompt has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), 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":"docs/reference/runner-conformance/fake-acp-agent.mjs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"98953ad5d3b54a9728340f1c434596c11b34f2a407448cb94bf91299570ea310"}},{"ruleId":"D2","level":"warning","message":{"text":"fake-acp-agent.handle (cognitive 17): fake-acp-agent.handle has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/reference/runner-conformance/fake-acp-agent.mjs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"4433f7f6d1f56d2c51cf83f0347cefa7738295937b83ed997b6389f3e933e9db"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigStore.resolveOneUnpaired (cognitive 17): ConfigStore.resolveOneUnpaired has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 2 (6 pts), error handling 2 (4 pts), if/else 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":"packages/cli/src/config-store.ts"},"region":{"startLine":1655}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d62710a88773b11366c7a1cbd6f273131c50c145a22d94b8bf2372edb3a2f0"}},{"ruleId":"D2","level":"warning","message":{"text":"DaemonClient.fetch (cognitive 17): DaemonClient.fetch has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 4 (6 pts), boolean chains 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/client.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"84309c7c1717f6ac2aae0612960aab7a19a5de9598dc8775df752526f718bbf6"}},{"ruleId":"D2","level":"warning","message":{"text":"ps.modelLines (cognitive 17): ps.modelLines has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 3 (5 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 8). 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/cli/src/commands/ps.ts"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa5a8080596ee9894054dcf090a72dded331b3c3088a783bb7a044de12e9f7e"}},{"ruleId":"D2","level":"warning","message":{"text":"agent.agentCommand (cognitive 17): agent.agentCommand has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, error handling 1, loops 1 (nesting depth added 3). None of this is in the body itself: all 17 points belong to one function literal inside it that branches (line 31). 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/commands/agent.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"579bcceb13792b80634f205ab82bf50260263faac89ebfe68238bcb921305c1c"}},{"ruleId":"D2","level":"warning","message":{"text":"host-bindings.loadHostBindings (cognitive 17): host-bindings.loadHostBindings has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 7, error handling 1, loops 1 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into 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/host-bindings.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4813de1ab2e716e019c5911c33a3f0d51969831e33c2d0c6beb8ab3bd66774b"}},{"ruleId":"D2","level":"warning","message":{"text":"cross-host-target.resolveCrossHostTarget (cognitive 17): cross-host-target.resolveCrossHostTarget has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 5, ternaries 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":"packages/cli/src/cross-host-target.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"b99523bcdd3fb4a1da4d8210b7f80de5b5abeeb55d88bbf90cc92428f5a0e704"}},{"ruleId":"D2","level":"warning","message":{"text":"compact-plan.printHuman (cognitive 17): compact-plan.printHuman has cognitive complexity 17 (threshold 15). Drivers by points: loops 3 (6 pts), if/else 5, ternaries 2 (5 pts), boolean chains 1 (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":"packages/cli/src/commands/compact-plan.ts"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c5cabc320059a893c27a5b57b8e05cd27c37916f4b7c1b9847a61f358609982"}},{"ruleId":"D2","level":"warning","message":{"text":"heartbeat.printHumanHeartbeat (cognitive 17): heartbeat.printHumanHeartbeat has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 4 (10 pts), loops 2 (4 pts), if/else 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":"packages/cli/src/commands/heartbeat.ts"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05a4ab24f086efa220e8f9dad0923a01c81818d8ef4fa32b3b86b13d370f318"}},{"ruleId":"D2","level":"warning","message":{"text":"queue.queueReadTarget (cognitive 17): queue.queueReadTarget has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 3 (6 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":"packages/cli/src/commands/queue.ts"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"793b6b536a81b615589bdfdf265d41e54b20269469c0d08a9c9a2058f7d49f54"}},{"ruleId":"D2","level":"warning","message":{"text":"restore-check.printHuman (cognitive 17): restore-check.printHuman has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 5 (6 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/cli/src/commands/restore-check.ts"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7fb621a421583f378cef0fcb4829f2066e3ae48e3c88f9fcd5c5d9a8b8dfed0"}},{"ruleId":"D2","level":"warning","message":{"text":"scope.buildSliceMoveCommand (cognitive 17): scope.buildSliceMoveCommand has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 4, boolean chains 3, error handling 2 (nesting depth added 3). None of this is in the body itself: all 17 points belong to 2 function literals inside it that branch (lines 834, 852). 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/commands/scope.ts"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"b79239164e41f50933104e0ee1e14f6e0f9ae87f26d5237ea7f2181b21d97d83"}},{"ruleId":"D2","level":"warning","message":{"text":"start.lastStopState (cognitive 17): start.lastStopState has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 4, loops 1, ternaries 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/commands/start.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a9fea02db3beebcd81387c3fcb3644da1fd3f27024c0848eac0991ba83c5d5"}},{"ruleId":"D2","level":"warning","message":{"text":"workspace.workspaceCommand (cognitive 17): workspace.workspaceCommand has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 3, error handling 1 (nesting depth added 1). None of this is in the body itself: all 17 points belong to 3 function literals inside it that branch (lines 170, 122, 99). 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/commands/workspace.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"316ecd97f2e57945e95ce014ad15af655e448229ce4b8761cf77fcf25e7081e0"}},{"ruleId":"D2","level":"warning","message":{"text":"restore-from-jsonl.discoverDocs (cognitive 17): restore-from-jsonl.discoverDocs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (4 pts), ternaries 1 (3 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/daemon/assets/plugins/openrig-core/skills/claude-compaction-restore/scripts/restore-from-jsonl.mjs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"23369bcece56aa2bba36d7c15e76d4dbcbb51ae5bc3bd2e09041a9a0bcc467e8"}},{"ruleId":"D2","level":"warning","message":{"text":"CodexRuntimeAdapter.captureFreshThreadId (cognitive 17): CodexRuntimeAdapter.captureFreshThreadId has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (4 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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":1786}}}],"partialFingerprints":{"codehealthFindingId/v1":"30086a3eff81719a7ec504d36d58bb4ca873aa1a9ea72e4c219d803dca817cd3"}},{"ruleId":"D2","level":"warning","message":{"text":"PiResumeAdapter.verifyResume (cognitive 17): PiResumeAdapter.verifyResume has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 pts), ternaries 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":"packages/daemon/src/adapters/pi-resume.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba2c2451acbb6eb96d6a81d0c721555c2020d5ffdb17804c4576a34b413ac98"}},{"ruleId":"D2","level":"warning","message":{"text":"LegacyRigSpecCodec.serialize (cognitive 17): LegacyRigSpecCodec.serialize has cognitive complexity 17 (threshold 15). Drivers by points: if/else 16, boolean chains 1. None of this is in the body itself: all 17 points belong to one function literal inside it that branches (line 250). 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/daemon/src/domain/rigspec-codec.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e504b29f1e4cbb2e5c695f03933c5f88828c896d23868defdbc4a55ae5c565"}},{"ruleId":"D2","level":"warning","message":{"text":"bundle-agent-images-router.routeAgentImages (cognitive 17): bundle-agent-images-router.routeAgentImages has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 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":"packages/daemon/src/domain/bundle-agent-images-router.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1d0ef66475be628ba8f95e65af9d15dedda9abca87c50a7bcbb30d9190f7dd"}},{"ruleId":"D2","level":"warning","message":{"text":"project-read.workSource (cognitive 17): project-read.workSource has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 1 (3 pts), boolean chains 2, 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/daemon/src/domain/workspace/project-read.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5b460694b509528f78a8224380f17c740144c4c24f13e15b12dc04c9b1289b"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkflowInstanceStore.updateFrontier (cognitive 17): WorkflowInstanceStore.updateFrontier has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 6 (7 pts), if/else 6, 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":"packages/daemon/src/domain/workflow-instance-store.ts"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"58cc427dedb5291ecfc77350a5eb3c30168d61f41a083a8b839fb3a22df386fc"}},{"ruleId":"D2","level":"warning","message":{"text":"restore-plan-preview.tokenStateFor (cognitive 17): restore-plan-preview.tokenStateFor has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 7, if/else 6 (7 pts), ternaries 3 (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/daemon/src/domain/restore-plan-preview.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"8467786e72e852f15b76bb2c239b521940d54ec0c1a3dc43f03335a7d80478a8"}},{"ruleId":"D2","level":"warning","message":{"text":"shared-conversation.compareConversations (cognitive 17): shared-conversation.compareConversations has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 3, 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/daemon/src/domain/shared-conversation.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"22fbbf41aab24ade9cff24f6cc1908dd471abcd40e482c0a590af1a409208165"}},{"ruleId":"D2","level":"warning","message":{"text":"RestoreOrchestrator.postLaunchRestore::effortForRestore (cognitive 17): RestoreOrchestrator.postLaunchRestore::effortForRestore has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 6 (13 pts), if/else 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. This shape REPEATS in the file: one other method here (RestoreOrchestrator.postLaunchRestore) 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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":1967}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42668e2e393a3c8e23ee00ec19a66d7cdec3aaba9948f8c8f686a8a4b03da6c"}},{"ruleId":"D2","level":"warning","message":{"text":"attention-aggregator.readHostAttention (cognitive 17): attention-aggregator.readHostAttention has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 4 (9 pts), if/else 5 (6 pts), boolean chains 1, 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":"packages/daemon/src/domain/feed/attention-aggregator.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1723daf9877dc42a58892eadb000461da81e6d54562206aa03459885aa69d0"}},{"ruleId":"D2","level":"warning","message":{"text":"transport.connectGateway (cognitive 17): transport.connectGateway has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 1 (4 pts), loops 1 (nesting depth added 8). None of this is in the body itself: all 17 points belong to one function literal inside it that branches (line 62). 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/daemon/src/domain/gateway/transport.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b367527cb7b1abbd149c295f87dce1139ef19be2349b8559f34f8e66292ef7e"}},{"ruleId":"D2","level":"warning","message":{"text":"HumanModeService.endAvailability (cognitive 17): HumanModeService.endAvailability has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 5, ternaries 2 (4 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":"packages/daemon/src/domain/gateway/human-operating-modes.ts"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69a3de6753bc22f0f8afe1e713e974dd3202483fedf4b9effbc2270efa226e9"}},{"ruleId":"D2","level":"warning","message":{"text":"slack-subsystem.buildSlackGatewayWire.personRootChannel (cognitive 17): slack-subsystem.buildSlackGatewayWire.personRootChannel has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 5 (7 pts), if/else 3 (6 pts), boolean chains 3, 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/daemon/src/domain/gateway/slack/slack-subsystem.ts"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"3705b627ea38ebae5f44f1e2ee20db9c9aff67fc9424506fc51137ef6ad5e740"}},{"ruleId":"D2","level":"warning","message":{"text":"health-detectors.selectContextEpisodeEvidence (cognitive 17): health-detectors.selectContextEpisodeEvidence has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (6 pts), boolean chains 4, loops 4, ternaries 2 (3 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":"packages/daemon/src/domain/health-detectors.ts"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f357ce84cff2f2baade70bd25536718b741aec8a7d9ea0f9f6d8b08e49f468d"}},{"ruleId":"D2","level":"warning","message":{"text":"kernel-boot.bootKernelIfNeeded (cognitive 17): kernel-boot.bootKernelIfNeeded has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 3 (5 pts), boolean chains 4 (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/daemon/src/domain/kernel-boot.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"bab6ed77b72a0b0a6f47945843896cb3defface9f06edef8709aefc81ac5ef19"}},{"ruleId":"D2","level":"warning","message":{"text":"session-jsonl.readLinesBackwards (cognitive 17): session-jsonl.readLinesBackwards has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (5 pts), ternaries 1 (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/daemon/src/domain/session-jsonl.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"430dd0722485117ebd45399a6874a90b9bf829eff8a451d0be1e7c4ba8ee794c"}},{"ruleId":"D2","level":"warning","message":{"text":"CodexInPlaceRestart.stopUnderShell (cognitive 17): CodexInPlaceRestart.stopUnderShell has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 5, ternaries 2 (3 pts), loops 1 (nesting depth added 3). Most of this is not in the body itself: 5 of the 17 points are its own statements and the rest belongs to 3 function items inside it that branch (gone, wait, a function literal at line 674). 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/daemon/src/domain/seat-restart-in-place.ts"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b248b9a18d70552bdb7b44835fe22fd13bb39536f95c9964859625ec88eb7ac"}},{"ruleId":"D2","level":"warning","message":{"text":"SeatLifecycleService.continueStartupUnchecked (cognitive 17): SeatLifecycleService.continueStartupUnchecked has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8, boolean chains 6, ternaries 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":"packages/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":1389}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c0c500c20cf7e105b128eaffa7f4a7ae07aa4c0851a2ee504f85ab63ec3705"}},{"ruleId":"D2","level":"warning","message":{"text":"ProviderAccountReadingsStore.prune (cognitive 17): ProviderAccountReadingsStore.prune has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (6 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/daemon/src/domain/provider/provider-account-readings.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"41226a22221d8b7b17fbd786a7a514b4c0f18ea7245d9a7b5ddca6627aa3ef52"}},{"ruleId":"D2","level":"warning","message":{"text":"freeze.mediaBlock (cognitive 17): freeze.mediaBlock has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 4 (9 pts), if/else 3 (5 pts), loops 2, boolean chains 1 (nesting depth added 7). 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, split the body into named stages: move each independent step or branch into 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/daemon/src/domain/review/freeze.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c2029b8701db38989c73e248ee2207590623a55ee63b4c27f774af26981f8f4"}},{"ruleId":"D2","level":"warning","message":{"text":"RigSpecExporter.memberStartupSource (cognitive 17): RigSpecExporter.memberStartupSource has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 9, if/else 6, ternaries 2. 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, 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/daemon/src/domain/rigspec-exporter.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c09ec0296c09d76679f606a9825be4a09c17f033af9e9d468a3662852bf742"}},{"ruleId":"D2","level":"warning","message":{"text":"skill-audit.isSelfReferential (cognitive 17): skill-audit.isSelfReferential has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 7, if/else 7, error handling 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/daemon/src/domain/skill-audit.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08f37c5d2cf18fa51b35a1679f5db221386e95cb3aa3d35554f92906aba5a55"}},{"ruleId":"D2","level":"warning","message":{"text":"HerdrAppProvider.openPending (cognitive 17): HerdrAppProvider.openPending has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, 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/daemon/src/domain/terminal/herdr-app-provider.ts"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dfb0a87d2f3f1517e975d0a9647e2ece41d3e172c5843838f3f88e6b3cf41ed"}},{"ruleId":"D2","level":"warning","message":{"text":"TerminalService.resolveComposed (cognitive 17): TerminalService.resolveComposed has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 3 (4 pts), boolean chains 3, 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/daemon/src/domain/terminal/terminal-service.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"270a723af6fc5a793eb81ddf08872cec99f27916e89f833419c8cb327d1ceafe"}},{"ruleId":"D2","level":"warning","message":{"text":"activity.bindToGrant (cognitive 17): activity.bindToGrant has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 10, if/else 6, ternaries 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/daemon/src/routes/activity.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"3696bfe4276ad95f3015087abe8012360740b47f38b6e11a7ac4b65d557a8d3d"}},{"ruleId":"D2","level":"warning","message":{"text":"activity.piUsageRequest (cognitive 17): activity.piUsageRequest has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, error handling 1, ternaries 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/daemon/src/routes/activity.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aacd4ba3d2b96a7ba49515819d3be7ad053f6123deab3495fc43ec81da41f23"}},{"ruleId":"D2","level":"warning","message":{"text":"bundles.extractInstallTimeMetadata (cognitive 17): bundles.extractInstallTimeMetadata has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 2, error handling 1 (2 pts), ternaries 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":"packages/daemon/src/routes/bundles.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"fab2a5b0e61ab77a1a1ca63f3d23c1b1a5e8bd955503d2170ae2991881ddaea4"}},{"ruleId":"D2","level":"warning","message":{"text":"down.downRoutes.post(\u0022/\u0022) (cognitive 17): down.downRoutes.post(\u0022/\u0022) has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, ternaries 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/daemon/src/routes/down.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"3209672e7f37043de3aef8c3aa698484e8e32de9cbeac30a9de01e5072388d6e"}},{"ruleId":"D2","level":"warning","message":{"text":"seat.seatRoutes.post(\u0022/handover/:seatRef\u0022) (cognitive 17): seat.seatRoutes.post(\u0022/handover/:seatRef\u0022) has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8, ternaries 4 (5 pts), 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":"packages/daemon/src/routes/seat.ts"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"6647bd18436d378df7d48a303e35e03ae968bfe147c467408b60e8607d4d9f58"}},{"ruleId":"D2","level":"warning","message":{"text":"config-model.configContentLines (cognitive 17): config-model.configContentLines has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 5 (9 pts), if/else 8 (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: 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/tui/src/config/config-model.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d7ea84622945cce804b0f7535f39dd24bbc1e79d921a9cf60c2a5fc2dfc7c31"}},{"ruleId":"D2","level":"warning","message":{"text":"detail.wrapDetailLines (cognitive 17): detail.wrapDetailLines has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (5 pts), ternaries 3 (5 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 4). None of this is in the body itself: all 17 points belong to 2 function literals inside it that branch (lines 43, 39). 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/tui/src/detail.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"77bbc6b2ee5affaaf5260255d962a26e7d38144e037730898ee8ec58f420b6b1"}},{"ruleId":"D2","level":"warning","message":{"text":"project-mission-state.reconcileMissionStatus (cognitive 17): project-mission-state.reconcileMissionStatus has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 3 (6 pts), boolean chains 4 (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/ui/src/lib/project-mission-state.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"8990fd40ef019248cf66b0a19e0fde48dd05905d383ebeba72d1df22c1055159"}},{"ruleId":"D2","level":"warning","message":{"text":"SubscriptionToggleList.SubscriptionToggleList (cognitive 17): SubscriptionToggleList.SubscriptionToggleList has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 9 (13 pts), boolean chains 4 (nesting depth added 4). Most of this is not in the body itself: 2 of the 17 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 83, 153, 114). 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/ui/src/components/for-you/SubscriptionToggleList.tsx"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79d14799cbb1fbcd4dc48ec6c031f446ec6b72a0db9b58201c1dc8041131d0e"}},{"ruleId":"D2","level":"warning","message":{"text":"LaunchRecoveryModal.LaunchRecoveryModal (cognitive 17): LaunchRecoveryModal.LaunchRecoveryModal has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 9 (13 pts), boolean chains 2, if/else 2 (nesting depth added 4). Of this number, 13 points are the body\u0027s own statements and 4 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/ui/src/components/LaunchRecoveryModal.tsx"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b12df33eb826863b110f4335fa243b6bff13ac07b56ba03fa41ed7155f49738"}},{"ruleId":"D2","level":"warning","message":{"text":"migrate-telemetry-state-0.5.9.treeSnapshot (cognitive 17): migrate-telemetry-state-0.5.9.treeSnapshot has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 2, ternaries 1 (2 pts), loops 1 (nesting depth added 5). Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to one function item inside it that branches (visit). 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":"skills/_canonical/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"f298409e10cee7d0b20b934d91d862eb86791d43dbc517126a763f2e1c796c8a"}},{"ruleId":"D2","level":"warning","message":{"text":"migrate-telemetry-state-0.5.9.verify (cognitive 17): migrate-telemetry-state-0.5.9.verify has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, loops 2, ternaries 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":"skills/_canonical/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7378888992c48f019f8fb49b8586bfa72d85a05c5cbdc461aa33c261a5f11ed"}},{"ruleId":"D2","level":"warning","message":{"text":"refresh-managed-plugin.classify (cognitive 17): refresh-managed-plugin.classify has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, boolean chains 8. 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/_canonical/core/openrig-upgrade/scripts/refresh-managed-plugin.mjs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"f810de3430770cc53a0b899c0eb10b882f43782bdc896d03a39ec3e98b00a72f"}},{"ruleId":"D2","level":"warning","message":{"text":"connection-contract.readWakeOutcome (cognitive 16): connection-contract.readWakeOutcome has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, boolean chains 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/daemon/src/domain/connection-contract.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"eade79aeedf554a57d820e3cf04100cd0d33c7db1579280a566e4f7078913d7c"}},{"ruleId":"D2","level":"warning","message":{"text":"claude-credential-precedence.projectRootForLocalSettings (cognitive 16): claude-credential-precedence.projectRootForLocalSettings has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), ternaries 2 (6 pts), error handling 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":"packages/daemon/src/domain/claude-credential-precedence.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"5caaa95c318af011d744f896584770d68539a389b28a6fdd64dc963c90e0bead"}},{"ruleId":"D2","level":"warning","message":{"text":"CodexThreadIdResolver.resolveInternal (cognitive 16): CodexThreadIdResolver.resolveInternal has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 2 (4 pts), boolean chains 3 (nesting depth added 4). Of this number, 15 points are the body\u0027s own statements and 1 belongs 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/daemon/src/domain/codex-thread-id.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd9c3c944f741f2f26d334be700ff105b6104c16133fdbeda96708661041e2df"}},{"ruleId":"D2","level":"warning","message":{"text":"native-process-arguments.readNativeProcessLaunch (cognitive 16): native-process-arguments.readNativeProcessLaunch has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (6 pts), ternaries 2 (4 pts), boolean chains 3, loops 1 (2 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":"packages/daemon/src/domain/native-process-arguments.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd1744f9dca4b7dc990367b3548b1d49ae24390ea8584365322397f242d5f444"}},{"ruleId":"D2","level":"warning","message":{"text":"native-process-lineage.claudeHookFromLaunchedProcess (cognitive 16): native-process-lineage.claudeHookFromLaunchedProcess has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 1 (3 pts), boolean chains 2, error handling 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":"packages/daemon/src/domain/native-process-lineage.ts"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"9636deae78af76414fb1a5a44195ff2f0721589a19757317fc142fcbad9649d3"}},{"ruleId":"D2","level":"warning","message":{"text":"OutboxHandler.record (cognitive 16): OutboxHandler.record has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 6 (11 pts), if/else 3, 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/daemon/src/domain/outbox-handler.ts"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"b158aa6b031ce4c1b9e2528eaf8000961daff4ecda20e84da56d07a669f2422c"}},{"ruleId":"D2","level":"warning","message":{"text":"session-name.validateSessionComponents (cognitive 16): session-name.validateSessionComponents has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (16 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/daemon/src/domain/session-name.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fabf1cb1f5f76b3304fb99986a42b669bc962f5d9f76fa75f08825610578019"}},{"ruleId":"D2","level":"warning","message":{"text":"SeatDeliveryGuard.operation (cognitive 16): SeatDeliveryGuard.operation has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 3 (6 pts), boolean chains 5, if/else 4 (5 pts) (nesting depth added 4). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 297). 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/daemon/src/domain/seat-delivery-guard.ts"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"2efa825435e2c0082227af243729acfad07aa89bccbfff88858d10742ed9ba40"}},{"ruleId":"D2","level":"warning","message":{"text":"rig-repository.isStoredContinuityPolicy (cognitive 16): rig-repository.isStoredContinuityPolicy 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":"packages/daemon/src/domain/rig-repository.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d7112c14e11cd3ccdd27e8c773d3888a9fba5ee43e416b639902360ceba5b1"}},{"ruleId":"D2","level":"warning","message":{"text":"agent-manifest.validateLifecycle (cognitive 16): agent-manifest.validateLifecycle has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 3 (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/daemon/src/domain/agent-manifest.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5eedaaaf4674fa6c907fa1d0c7c7a06c25e9253825debd7a5bea2f31e9d92b"}},{"ruleId":"D2","level":"warning","message":{"text":"skill-discovery.findNamedSkillsForRuntime (cognitive 16): skill-discovery.findNamedSkillsForRuntime has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), error handling 1 (3 pts), loops 2 (3 pts), boolean chains 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/daemon/src/domain/skill-discovery.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"664b900bb8d3185b3f80145d65ebb14d3089bd8afee5210f845390ec763e213d"}},{"ruleId":"D2","level":"warning","message":{"text":"profile-resolver.resolveProfileUses (cognitive 16): profile-resolver.resolveProfileUses has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 2 (3 pts), boolean chains 2, 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/daemon/src/domain/profile-resolver.ts"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e976eee5c608c5da6ec2da173c3dc095548a3e501c6eea82411345b20f17802"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeManagedLaunch.seatEnvKeys (cognitive 16): ClaudeManagedLaunch.seatEnvKeys has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (5 pts), loops 3 (5 pts), boolean chains 3, error handling 2 (3 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":"packages/daemon/src/domain/claude-managed-launch.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"761bf992b3cb9d55fb6878e5aff6b91882cb357aafaa0a1e3ac22c6a9966eaf2"}},{"ruleId":"D2","level":"warning","message":{"text":"startup-proof.orientedFromRows (cognitive 16): startup-proof.orientedFromRows has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 3, error handling 2 (3 pts), ternaries 1 (2 pts), loops 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/daemon/src/domain/startup-proof.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e5f443c0246bba87c3570596e7d30c4f7e3755afd2d9c4df7c3c7de51654db"}},{"ruleId":"D2","level":"warning","message":{"text":"scope-view-projection.fmList (cognitive 16): scope-view-projection.fmList has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), ternaries 1 (2 pts), boolean chains 1, error handling 1, 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/daemon/src/domain/scope/scope-view-projection.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa05b3d6b1c576010615293a527542a2eb042e17f143aeec25c410c220cca45"}},{"ruleId":"D2","level":"warning","message":{"text":"scope-view-projection.projectSliceScope (cognitive 16): scope-view-projection.projectSliceScope has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 2, loops 1 (2 pts), 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":"packages/daemon/src/domain/scope/scope-view-projection.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b656fc2a54aab71f4c7a24ebf79292cbccbe52d8d622e61210a4b786a694cf5"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-limit-banner.recordCodexLimitBanner (cognitive 16): codex-limit-banner.recordCodexLimitBanner has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 2, ternaries 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":"packages/daemon/src/domain/provider/codex-limit-banner.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"d81b8dec14a115867915989c7f700d8f6b87e8674d911880224451f5f6208953"}},{"ruleId":"D2","level":"warning","message":{"text":"execution-candidate-reader.readRowsCooperatively (cognitive 16): execution-candidate-reader.readRowsCooperatively has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), loops 2 (5 pts), error handling 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/daemon/src/domain/execution-candidate-reader.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"af6fdc4607f8a5099de9a83e491220741cec6faebaef5e32d2ac424baaa445bb"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnerPermissions.submit (cognitive 16): RunnerPermissions.submit has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), ternaries 6 (7 pts), boolean chains 2 (nesting depth added 2). Of this number, 14 points are the body\u0027s own statements and 2 belong to 2 function items 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":"packages/daemon/src/domain/runner-permissions.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcba9fe4acd0d6572dba72d3eac01108de98718e3bbcc90d635008bc6430f7db"}},{"ruleId":"D2","level":"warning","message":{"text":"QueueRepository.decisionRevision (cognitive 16): QueueRepository.decisionRevision has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 7 (9 pts), boolean chains 4, if/else 1 (2 pts), loops 1 (nesting depth added 3). 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":"packages/daemon/src/domain/queue-repository.ts"},"region":{"startLine":4759}}}],"partialFingerprints":{"codehealthFindingId/v1":"c235ef850c3c3c0d7d37396bfc3c57edd68f467ee444a6acc7956d2c049fd534"}},{"ruleId":"D2","level":"warning","message":{"text":"session-transport.boxHoldsText (cognitive 16): session-transport.boxHoldsText has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 3 (4 pts), loops 1 (nesting depth added 6). 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 into named stages: move each independent step or branch into 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":1613}}}],"partialFingerprints":{"codehealthFindingId/v1":"e14e2e8353dc94c5ab52c05eb1108b8a40e24afbf99227c2b21e2f89302934ae"}},{"ruleId":"D2","level":"warning","message":{"text":"TmuxAdapter.scopeStartOutcome (cognitive 16): TmuxAdapter.scopeStartOutcome has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 4 (5 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":"packages/daemon/src/adapters/tmux.ts"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeac6a928aa1c41ef720d6b4cbfacc462af1aed732dfad9aab900a0ed91279c7"}},{"ruleId":"D2","level":"warning","message":{"text":"native-resume-probe.claudeCurrentRows (cognitive 16): native-resume-probe.claudeCurrentRows has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, if/else 2 (4 pts), ternaries 3 (4 pts), loops 1 (nesting depth added 3). Of this number, 12 points are the body\u0027s own statements and 4 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":"packages/daemon/src/domain/native-resume-probe.ts"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab53d7d3a2172b5157a1ed732cdf3657ddc535d31d6603ba1b039a14973bd339"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonRpcPeer.receive (cognitive 16): JsonRpcPeer.receive has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, 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/acp/json-rpc-stdio.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"06062d9fa1e0f086d5de5b2b870b45c96def091987d031d963301a125ff9bf5f"}},{"ruleId":"D2","level":"warning","message":{"text":"ps.compactNodeProjection (cognitive 16): ps.compactNodeProjection has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 7 (8 pts), if/else 6, boolean chains 2 (nesting depth added 1). None of this is in the body itself: all 16 points belong to one function literal inside it that branches (line 750). 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/commands/ps.ts"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d0bd83ac6c37be588fe17d2618fa2b9699108ae7467092b25d284700afd5e4"}},{"ruleId":"D2","level":"warning","message":{"text":"send.classifyDeliveryEffect (cognitive 16): send.classifyDeliveryEffect has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 5, if/else 5, ternaries 3 (5 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/cli/src/commands/send.ts"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd590c9ba637ff7bcbfbe745bff29c36580b3cb7a82171bb7453253282851c11"}},{"ruleId":"D2","level":"warning","message":{"text":"capture.runHttpHostCapture (cognitive 16): capture.runHttpHostCapture has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), ternaries 3 (4 pts), boolean chains 3 (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/cli/src/commands/capture.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f26ef72b240de41d55fdef894a899da1bcedc39d931c471bb43161e177fd177"}},{"ruleId":"D2","level":"warning","message":{"text":"provider-auth.checkCodexAuth (cognitive 16): provider-auth.checkCodexAuth has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 1 (4 pts), error handling 1 (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/provider-auth.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ce88dd9f5158c818bd1032a109da9fe0368d561144e8cee38a5f84a19d0d9f"}},{"ruleId":"D2","level":"warning","message":{"text":"policy.applyToSeat (cognitive 16): policy.applyToSeat has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), ternaries 3 (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/cli/src/commands/policy.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a2d124c9e230f13ba8fed3c45503ed2583e4dde913798a521dd3fc7418c9bb"}},{"ruleId":"D2","level":"warning","message":{"text":"DecisionRun.questions (cognitive 16): DecisionRun.questions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), error handling 1 (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":"packages/cli/src/decisions/decisions.ts"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd8eac2a7e4459fe707d5a1e98261a1889ef38cb0f502e77c94b6cc3d883f663"}},{"ruleId":"D2","level":"warning","message":{"text":"provider.providerCommand::identityLabel (cognitive 16): provider.providerCommand::identityLabel has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 5 (15 pts), boolean chains 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. This shape REPEATS in the file: 5 other methods here (provider.providerCommand::renderStatusHuman, provider.providerCommand::renderSeatAccounts, provider.providerCommand::renderUsageRow, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 6 times rather than 6 independent problems. Splitting this body alone leaves the other 5 exactly as they are. Where these are variations on one operation, the change that clears all 6 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/commands/provider.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa124b679464dfc3fe2643c9e125a5f32b5973094bb54506bc650b38f13d885a"}},{"ruleId":"D2","level":"warning","message":{"text":"seat.printClaudeAutoMode (cognitive 16): seat.printClaudeAutoMode has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 7 (12 pts), loops 2, boolean chains 1, 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/cli/src/commands/seat.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0fd9320b461e0074e5dfa574e6dec3d51d288ad6ea8ea411eec25b47be66ae4"}},{"ruleId":"D2","level":"warning","message":{"text":"seat.printRestartReport (cognitive 16): seat.printRestartReport has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, ternaries 2 (3 pts), 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":"packages/cli/src/commands/seat.ts"},"region":{"startLine":2063}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9f79b206d9d66287cdd914a48fee954cf9c9fdccc263ab6c719974a15b765b"}},{"ruleId":"D2","level":"warning","message":{"text":"start.multiSelectPicker (cognitive 16): start.multiSelectPicker has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, ternaries 2 (4 pts), boolean chains 3, loops 1 (nesting depth added 2). None of this is in the body itself: all 16 points belong to 3 function literals inside it that branch (lines 144, 115, 111). 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/commands/start.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"03bd88b3181f1673ab2e706441963dceb9142d258234df86b7599a59490b4129"}},{"ruleId":"D2","level":"warning","message":{"text":"affected-skills.expandChangedSurface (cognitive 16): affected-skills.expandChangedSurface has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (6 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/release-surface/affected-skills.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d4196452bd632079505b42033c46b5ad310ee4d0e7fa4fe42e083d1a68b3015"}},{"ruleId":"D2","level":"warning","message":{"text":"activity-relay.claudeLimitResetAt (cognitive 16): activity-relay.claudeLimitResetAt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 7 (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/daemon/assets/plugins/openrig-core/hooks/scripts/activity-relay.cjs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"7542a3774825c0ef879bd84e702abce350f6880f379be0f7f88fd7bdb6a05d1f"}},{"ruleId":"D2","level":"warning","message":{"text":"refocus.readConfiguredContent (cognitive 16): refocus.readConfiguredContent has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), error handling 3 (4 pts), boolean chains 3 (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":"packages/daemon/assets/plugins/openrig-core/hooks/scripts/refocus.cjs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"f197f2606c5cb8320ab2256807e18a3b59bc9cd8687b9a640df250523deb4d95"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeCodeAdapter.provisionClaudeState (cognitive 16): ClaudeCodeAdapter.provisionClaudeState has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 2, loops 1 (2 pts), 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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":1187}}}],"partialFingerprints":{"codehealthFindingId/v1":"078da763062933f7332ad0a6bc4009f228140397e3377ce6e6e21877ff64cdee"}},{"ruleId":"D2","level":"warning","message":{"text":"claude-code-adapter.readClaudeSelfReportEvidence (cognitive 16): claude-code-adapter.readClaudeSelfReportEvidence has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), error handling 2 (3 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":"packages/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":1504}}}],"partialFingerprints":{"codehealthFindingId/v1":"f788a319dca7d20ff4d185f0f54fd2bfb65152d9c31ed2323498b15767e5361d"}},{"ruleId":"D2","level":"warning","message":{"text":"codex-profile-preflight.verifyCodexProfileLoads (cognitive 16): codex-profile-preflight.verifyCodexProfileLoads has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 5 (13 pts), boolean chains 2, error handling 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/daemon/src/domain/codex-profile-preflight.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f1342105cdce9c1255107fec464cf4e295aa5f43b3fa15df55e48403749b2d"}},{"ruleId":"D2","level":"warning","message":{"text":"StubRuntimeAdapter.checkReady (cognitive 16): StubRuntimeAdapter.checkReady has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 pts), 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/daemon/src/adapters/stub-runtime-adapter.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"31aad90b3dd52991cdaabac3d99ee720a438a77a0a80e2d0f856e16e4f9f6ea8"}},{"ruleId":"D2","level":"warning","message":{"text":"StubRuntimeAdapter.projectEntry (cognitive 16): StubRuntimeAdapter.projectEntry has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), error handling 1 (3 pts), loops 1 (3 pts), 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":"packages/daemon/src/adapters/stub-runtime-adapter.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df7cf398de45972629ba64efa6f606a9f33cd04f593bd3283f860dc531620f1"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentImageLibraryService.readImageEntry (cognitive 16): AgentImageLibraryService.readImageEntry has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (6 pts), error handling 3 (4 pts), boolean chains 3, ternaries 3 (nesting depth added 2). 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, 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/daemon/src/domain/agent-images/agent-image-library-service.ts"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7ace8c11febbce5f0535a823f1bc48acaa495481a0a089a3fcb7159cfd3375"}},{"ruleId":"D2","level":"warning","message":{"text":"rigspec-preflight.permissionPolicyDiscoveryWarnings (cognitive 16): rigspec-preflight.permissionPolicyDiscoveryWarnings has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 2 (3 pts), ternaries 1 (3 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/daemon/src/domain/rigspec-preflight.ts"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"4434087b210fac92dea0df4d1bef2f06cd4f0a2a34b641b5e3a0abcee7155bdf"}},{"ruleId":"D2","level":"warning","message":{"text":"bundle-behaviour-inspect.inspectBundleBehaviour::walk (cognitive 16): bundle-behaviour-inspect.inspectBundleBehaviour::walk has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), error handling 1 (2 pts), ternaries 1 (2 pts), boolean chains 1, 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/daemon/src/domain/bundle-behaviour-inspect.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e8e48d4a093aedacccc1a4ac19d24aaf596134f1ee6b91eb0910772f5ad8e7"}},{"ruleId":"D2","level":"warning","message":{"text":"workflow-reconciliation.reviseGraph (cognitive 16): workflow-reconciliation.reviseGraph has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 4, ternaries 2 (nesting depth added 1). 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 226). 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/daemon/src/domain/workflow-reconciliation.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ed68be666907c6152447cb3d0202bca361ee934d10f27315e21f5369d510f4"}},{"ruleId":"D2","level":"warning","message":{"text":"MissionControlWriteContract.act (cognitive 16): MissionControlWriteContract.act has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 5 (6 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/mission-control/mission-control-write-contract.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f78fc7021de9ef615627830ee2ca695d34068c7a990934d2cbd29beccc8ce9e"}},{"ruleId":"D2","level":"warning","message":{"text":"KernelBootTracker.getStatus (cognitive 16): KernelBootTracker.getStatus has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (6 pts), boolean chains 5, ternaries 4 (5 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/kernel-boot-tracker.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"218fc55ddd9db3dfb686275201e53a85f417531352e2d7255a4d794963ad4346"}},{"ruleId":"D2","level":"warning","message":{"text":"MissionControlAuditBrowse.query (cognitive 16): MissionControlAuditBrowse.query has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, ternaries 3, boolean chains 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/daemon/src/domain/mission-control/audit-browse.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"913cbe8e994bb23158459851639730ac48fe2fa727b22eb6a9ef62b7e7df4389"}},{"ruleId":"D2","level":"warning","message":{"text":"MissionControlFleetCliCapability.rollupFleet (cognitive 16): MissionControlFleetCliCapability.rollupFleet has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 2 (5 pts), if/else 2 (4 pts), loops 2 (3 pts), boolean chains 2, 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/daemon/src/domain/mission-control/mission-control-fleet-cli-capability.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c94c82d413a312255906ea708baed5fc479b8d5bea1d95b8f650399a1c0a71"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin-discovery-service.readProfilesUsingPlugin (cognitive 16): plugin-discovery-service.readProfilesUsingPlugin has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 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":"packages/daemon/src/domain/plugin-discovery-service.ts"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"6810bd63fc76e8f386a6204aac3d2f965462eea86f04dad0c8486ad5286ed9a1"}},{"ruleId":"D2","level":"warning","message":{"text":"require-sender-identity.parseIdentityPrincipal (cognitive 16): require-sender-identity.parseIdentityPrincipal has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 5, ternaries 2, error handling 1. Of this number, 15 points are the body\u0027s own statements and 1 belongs 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/daemon/src/routes/require-sender-identity.ts"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"674fad79722beae3f1f8b3fb83ff8fa50c7b57edc0bf7f73adb5c3975a3ccaf2"}},{"ruleId":"D2","level":"warning","message":{"text":"ReviewGatherer.gatherWorkflowExceptions (cognitive 16): ReviewGatherer.gatherWorkflowExceptions has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 3 (6 pts), boolean chains 4, error handling 2 (3 pts), if/else 1 (2 pts), loops 1 (nesting depth added 5). 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":"packages/daemon/src/domain/review/gather.ts"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ce97b8740dc518b76b8804ac866534d48700a82bdf44e19fa0b3fb074f5b0c9"}},{"ruleId":"D2","level":"warning","message":{"text":"ReviewGatherer.agentsForSlices (cognitive 16): ReviewGatherer.agentsForSlices has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 5, if/else 3 (5 pts), loops 2 (3 pts), ternaries 3 (nesting depth added 3). Of this number, 12 points are the body\u0027s own statements and 4 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":"packages/daemon/src/domain/review/gather.ts"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade1796c28b61097375fdfd37dbd9df1a84415480e2d3a74e6d7d1c4b939bed9"}},{"ruleId":"D2","level":"warning","message":{"text":"ReviewGatherer.rigRoster (cognitive 16): ReviewGatherer.rigRoster has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 2 (3 pts), error handling 1 (2 pts), boolean chains 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/daemon/src/domain/review/gather.ts"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3a26ba931b9fe6aef85efaa133d0a14ce0dfc4ab030ea3e4400c62596ac7f2"}},{"ruleId":"D2","level":"warning","message":{"text":"RigExpansionService.expand (cognitive 16): RigExpansionService.expand has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 6 (13 pts), if/else 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/daemon/src/domain/rig-expansion-service.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"792b56daec9d577a634e8d4f106c5bda9a72dfd115a8ec4a67059df744f08399"}},{"ruleId":"D2","level":"warning","message":{"text":"CmuxProviderAdapter.openView (cognitive 16): CmuxProviderAdapter.openView has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (7 pts), if/else 4 (5 pts), boolean chains 2, 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/daemon/src/domain/terminal/cmux-provider-adapter.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"daa8993d0c29ee143126a42f741a2fbc1a1f206e5799b5a42396faa93ca40dbd"}},{"ruleId":"D2","level":"warning","message":{"text":"herdr-live-workspace.findLiveHerdrWorkspace (cognitive 16): herdr-live-workspace.findLiveHerdrWorkspace has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, ternaries 5 (6 pts), if/else 1 (2 pts), loops 1 (nesting depth added 2). Most of this is not in the body itself: 5 of the 16 points are its own statements and the rest belongs to 5 function items inside it that branch (a function literal at line 120, a function literal at line 125, a function literal at line 123, \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/daemon/src/domain/terminal/herdr-live-workspace.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08e4f23444452e30b5ec1254cc7e6d2c9487f5696876cd7f8126309f28f8d9c"}},{"ruleId":"D2","level":"warning","message":{"text":"HerdrAppProvider.endVerified (cognitive 16): HerdrAppProvider.endVerified has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, 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/daemon/src/domain/terminal/herdr-app-provider.ts"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db2f5bec63826aaa97ef8be74b6e4202a3ba262d162a56f3af75c87bcc65a5f"}},{"ruleId":"D2","level":"warning","message":{"text":"rex-adapter.exitedTiles (cognitive 16): rex-adapter.exitedTiles has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 4, error handling 2, loops 1, ternaries 1 (nesting depth added 1). Most of this is not in the body itself: 3 of the 16 points are its own statements and the rest belongs to 3 function items inside it that branch (check, a function literal at line 50, unconfirmed). 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/daemon/src/domain/terminal/rex-adapter.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7a6d873f0fd72d187408045ce12a1335cc740f05ed55f8f945200657166e3c"}},{"ruleId":"D2","level":"warning","message":{"text":"TerminalService.listViews (cognitive 16): TerminalService.listViews has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 2 (6 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/daemon/src/domain/terminal/terminal-service.ts"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"710d9ed91abce79d0a42b7e5b3de884bb111525f84242ff5e1427a426d5d2e24"}},{"ruleId":"D2","level":"warning","message":{"text":"UpCommandRouter.validateYamlAsRigSpec (cognitive 16): UpCommandRouter.validateYamlAsRigSpec has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 5, error handling 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":"packages/daemon/src/domain/up-command-router.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb08b8ccb24050330fe6fa6e22d0465042e44166e997c845350a5b3ce7139c32"}},{"ruleId":"D2","level":"warning","message":{"text":"workspace-doctor.checkSdlcConventionSections (cognitive 16): workspace-doctor.checkSdlcConventionSections has cognitive complexity 16 (threshold 15). Drivers by points: error handling 3 (6 pts), if/else 2 (4 pts), loops 2 (3 pts), ternaries 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/daemon/src/domain/workspace/workspace-doctor.ts"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c116057e41d1f69b398f2a24f0379a3d34ed8ea49ce2363eb3467af7255cc8"}},{"ruleId":"D2","level":"warning","message":{"text":"activity.activityRoutes.get(\u0022/parked\u0022) (cognitive 16): activity.activityRoutes.get(\u0022/parked\u0022) has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 6, ternaries 1 (nesting depth added 1). Of this number, 14 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":"packages/daemon/src/routes/activity.ts"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb46847fb4f0c70408f83fad529f3058d5588d6db1238f125482399e8d45889a"}},{"ruleId":"D2","level":"warning","message":{"text":"restore-check.createRestoreCheckService (cognitive 16): restore-check.createRestoreCheckService has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 4 (7 pts), error handling 3 (4 pts), if/else 3 (4 pts), boolean chains 1 (nesting depth added 5). None of this is in the body itself: all 16 points belong to 4 function literals inside it that branch (lines 206, 162, 202, \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/daemon/src/routes/restore-check.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"0613daace197bf4a29a4c92d83ab18c4665f493748dc92978a607d6fe6bdbc1c"}},{"ruleId":"D2","level":"warning","message":{"text":"sessions.sessionAdminRoutes.post(\u0022/:sessionName/repair-missing-pane\u0022) (cognitive 16): sessions.sessionAdminRoutes.post(\u0022/:sessionName/repair-missing-pane\u0022) has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 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/daemon/src/routes/sessions.ts"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dfd668db826a1fe23451f67f2fac4088279804db31305e256ea40081c241da0"}},{"ruleId":"D2","level":"warning","message":{"text":"snapshots.restoreRoutes.post(\u0022/:snapshotId\u0022) (cognitive 16): snapshots.restoreRoutes.post(\u0022/:snapshotId\u0022) has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), ternaries 3 (6 pts), boolean chains 3 (nesting depth added 4). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 156, 188, 146). 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/daemon/src/routes/snapshots.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"122feca9c6c5a47a1c8e7f2566c51ece5237975c11c3b3842f284883616950ed"}},{"ruleId":"D2","level":"warning","message":{"text":"discovery.discoveryRoutes.post(\u0022/:id/bind\u0022) (cognitive 16): discovery.discoveryRoutes.post(\u0022/:id/bind\u0022) has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 4, boolean chains 3, match/switch 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/daemon/src/routes/discovery.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"957d54922b29a3633b68b808df49a7d57768d7248323e5894f41e5ca0861ce83"}},{"ruleId":"D2","level":"warning","message":{"text":"browser-boundary.browserBoundary (cognitive 16): browser-boundary.browserBoundary has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 4 (nesting depth added 1). 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 items inside it that branch (acceptedTarget, logRefusal, explicitlyAllowedOrigin, \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/daemon/src/middleware/browser-boundary.ts"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"327d355e23bd293c164c6514d7adf896085f0fbe3e9542744c29d216e5ae4496"}},{"ruleId":"D2","level":"warning","message":{"text":"workflow-model.shellWords (cognitive 16): workflow-model.shellWords has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 5, 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":"packages/tui/src/execution/workflow-model.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d3042665a3e7d53642cde13872c333134abd66437d772db3ac888ba2cc8e4e8"}},{"ruleId":"D2","level":"warning","message":{"text":"PageRead.fetch (cognitive 16): PageRead.fetch has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 3, ternaries 2 (3 pts), error handling 1 (nesting depth added 3). None of this is in the body itself: all 16 points belong to one function literal inside it that branches (line 16). 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/tui/src/page-read.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"14a26890a58b394dd2435d34f54d7144b637cd4db34cbb754890bd036f24eded"}},{"ruleId":"D2","level":"warning","message":{"text":"usage-model.identityLabel (cognitive 16): usage-model.identityLabel has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 5 (15 pts), boolean chains 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":"packages/tui/src/usage/usage-model.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d5e9728cd96d7e4203449bc708f65908442e7dca033a825c0e5d11af009c6ec"}},{"ruleId":"D2","level":"warning","message":{"text":"state.locationKey (cognitive 16): state.locationKey has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, boolean chains 7, match/switch 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/tui/src/state.ts"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"55facdc65ed46ebdf11d708e302092d0226035b5e84c851161705143d95321bc"}},{"ruleId":"D2","level":"warning","message":{"text":"state.agentsRunningSpecTargets (cognitive 16): state.agentsRunningSpecTargets has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 1 (5 pts), boolean chains 1 (nesting depth added 10). 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":"packages/tui/src/state.ts"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4568fdcf1b51fa260879ed2fef16571c2a45cf342ba8606d6272066224d5994"}},{"ruleId":"D2","level":"warning","message":{"text":"restore-lifecycle.driveRestoreLifecycle (cognitive 16): restore-lifecycle.driveRestoreLifecycle has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), error handling 2 (5 pts), ternaries 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":"packages/tui/src/crash-cart/restore-lifecycle.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"e397fec4f2352d2fce1e239c3c549b210e06e887a305a3521dc6b28ff2cc80b0"}},{"ruleId":"D2","level":"warning","message":{"text":"StartupController.refresh (cognitive 16): StartupController.refresh has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 6, ternaries 1 (2 pts), error handling 1 (nesting depth added 2). None of this is in the body itself: all 16 points belong to 2 function literals inside it that branch (lines 68, 77). 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/tui/src/startup.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"97de45ec9f946b1cb9b45b563e0f39af88c85f20e4dd396df032bc70917bd629"}},{"ruleId":"D2","level":"warning","message":{"text":"navigator.contentOf (cognitive 16): navigator.contentOf has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 5 (10 pts), if/else 5, boolean chains 1 (nesting depth added 5). Of this number, 12 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/tui/src/navigator.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f74b04f033d982cf44538979542b4b388566fd6445997c3a3a4743629bd89b"}},{"ruleId":"D2","level":"warning","message":{"text":"render.effortObservedText (cognitive 16): render.effortObservedText has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 5 (11 pts), boolean chains 3, if/else 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/tui/src/render.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"0794056d1a475d0166c7ab7201f2c3c7cef05f7b858900756a8cf67318e80e31"}},{"ruleId":"D2","level":"warning","message":{"text":"render.queueFacts (cognitive 16): render.queueFacts has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 4 (6 pts), if/else 3 (5 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":"packages/tui/src/render.ts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f69eba520707603966b6760ee44bb3547dcf48ea7faa34c5b7d3b6bf712830"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeMark.ToolMark (cognitive 16): RuntimeMark.ToolMark has cognitive complexity 16 (threshold 15). Drivers by points: if/else 16. 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/ui/src/components/graphics/RuntimeMark.tsx"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"8effeb4592c945d3eee28c5f8725d0a9e3762557969efed1f9c15a4a6b005731"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectMetaPrimitives.queueStateToken (cognitive 16): ProjectMetaPrimitives.queueStateToken has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 7. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/project/ProjectMetaPrimitives.tsx"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"0731308aa4e4472bde8415a78ed89dd594a0e59c60529fcb8a7220acb6d03f07"}},{"ruleId":"D2","level":"warning","message":{"text":"feed-classifier.classifyEvent (cognitive 16): feed-classifier.classifyEvent has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 3 (7 pts), if/else 5, boolean chains 4 (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/ui/src/lib/feed-classifier.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdcd31a7d22b3086ae76db0ba1ac721dc80814d23a2276a85799326dcb2f7d15"}},{"ruleId":"D2","level":"warning","message":{"text":"TerminalLauncher.buildLauncherViews (cognitive 16): TerminalLauncher.buildLauncherViews has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (5 pts), loops 5, ternaries 2 (4 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/topology/TerminalLauncher.tsx"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee8632577b562591fcfb0cee7124c14de946c878dfa692812042fb6b066d053"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkflowInstancePage.ExceptionBanner (cognitive 16): WorkflowInstancePage.ExceptionBanner has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 8 (10 pts), boolean chains 5, if/else 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/ui/src/components/workflow/WorkflowInstancePage.tsx"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"34fa357121f04aa47fa1d88006e40915377495ecd90968537f6c6bbd840b219c"}},{"ruleId":"D2","level":"warning","message":{"text":"guest.launch (cognitive 16): guest.launch has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 4, boolean chains 1, ternaries 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/daemon/assets/openshell/guest.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ec20414f689fb8e2df1f94f07b833f6ea7df2a459f1a9ef609fd006fb6c972"}},{"ruleId":"D2","level":"warning","message":{"text":"splitHeredocs (cognitive 16): splitHeredocs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (6 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 7). Of this number, 11 points are the body\u0027s own statements and 5 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":"packages/daemon/assets/claude-team-permissions.cjs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"c77658a2faacc21a0b376a969c258336c5c72ee3a5b48a3126dc01f94f634d4c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: startup.createDaemon: FunctionTooLong \u2014 createDaemon runs 1663 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1563 over it, 16.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":"packages/daemon/src/startup.ts"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a596f727594b0d3861759b3ee23102d8d7c884a9a54efdce91527d1b943d6d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: queue.queueRoutes: FunctionTooLong \u2014 queueRoutes runs 1175 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1075 over it, 11.75\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/daemon/src/routes/queue.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"885910a992781f4acf4f2ce6bf8aff1e2686f15cf766a6cc7ebdaafcb34e527d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: seat.seatCommand: FunctionTooLong \u2014 seatCommand runs 1104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1004 over it, 11.04\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/commands/seat.ts"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"601c2d2db0b6c10bb953eac340a8b340a3983bcebe4d5efb584a09dcace2896f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: slack-subsystem.buildSlackGatewayWire: FunctionTooLong \u2014 buildSlackGatewayWire runs 850 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 750 over it, 8.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":"packages/daemon/src/domain/gateway/slack/slack-subsystem.ts"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe83c822c697a79ec22cf3162a25a8d1644084c365928caf254c575bf8d70bf"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: QueueRepository: ClassTooLong \u2014 3236 significant lines (blank, comment-only and punctuation-only lines excluded), 166 methods. The bar is 400 significant lines; this is 2836 over it, 8.09\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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b5be135ca916064026bda4c1d495504723ba1280112398422e9bf2b1741f8c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: domain/queue-repository.ts: FileTooLong \u2014 3908 significant lines (blank, comment-only and punctuation-only lines excluded), about 83% of them inside a single declaration: QueueRepository (1131-6418). The bar is 500 significant lines; this is 3408 over it, 7.82\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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37dbb7fd0e5599c0ddd6a115375533e92f97f7a15a820eb16c1cf3d91f843199"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: workflow.workflowCommand: FunctionTooLong \u2014 workflowCommand runs 769 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 669 over it, 7.69\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/commands/workflow.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f88f34f9f2fbb9b782718f4febe81942c378ed0e71c6afcbe8ea9a95f73991"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: domain/session-transport.ts: FileTooLong \u2014 3524 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3024 over it, 7.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/session-transport.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df07cb33e8a4ad6179bdd5023e9e599b44796df4ebf0f0a302b99884d2d2b2fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: provider.providerCommand: FunctionTooLong \u2014 providerCommand runs 623 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 523 over it, 6.23\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/commands/provider.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"5328994e9024dc4cc21e099f3ac7367895945f1b6a06166937a6f9489b4b65fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: context.contextCommand: FunctionTooLong \u2014 contextCommand runs 607 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 507 over it, 6.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/cli/src/commands/context.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"c374dd106532810fe4e81f164d573bc22aba312cc8020d1a3846ecde12d62b41"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: QueueRepository: TooManyMethods \u2014 166 methods. The bar is 30 methods; this is 136 over it, 5.53\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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"fabbd8db48bb759bb86b9a5c9e4d50397f798da733e41a23f12b21c1f9a75ad9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: main.run: FunctionTooLong \u2014 run runs 540 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 440 over it, 5.40\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/tui/src/main.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef412333861458408b422e89142cbf86d550bd8ac55c6c207366954dd9aa60b4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gateway.gatewayCommand: FunctionTooLong \u2014 gatewayCommand runs 530 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 430 over it, 5.30\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/commands/gateway.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1fbfc2104724feeaa05cdb0c95b78618fa63b3086462c8d87d4274e4fe5b8c7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: execution-view.buildExecutionView: FunctionTooLong \u2014 buildExecutionView runs 524 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 424 over it, 5.24\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/daemon/src/domain/execution-view.ts"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"1263cfab362073de6ab2d6da1b93f7b05ba1cb50c098c883852bb551982b72a5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StartupOrchestrator.startNodeWithWarnings: MethodTooLong \u2014 startNodeWithWarnings runs 472 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 372 over it, 4.72\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/daemon/src/domain/startup-orchestrator.ts"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"78bd3223140d06672836e6c7f6b098d0c0b09ec9c39761f6fd938066cf5b7cb1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RestoreOrchestrator: ClassTooLong \u2014 1843 significant lines (blank, comment-only and punctuation-only lines excluded), 39 methods. The bar is 400 significant lines; this is 1443 over it, 4.61\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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"3577292c27564d1f7804631eb57548ee719fdf31bbf367272ad2a9297503b539"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PodRigInstantiator: ClassTooLong \u2014 1838 significant lines (blank, comment-only and punctuation-only lines excluded), 44 methods. The bar is 400 significant lines; this is 1438 over it, 4.60\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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f2dda642b292635923738002013243c617e2d46057c6304b3a21266134a1612"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: relay-inbound.createRelayInboundHandler: FunctionTooLong \u2014 createRelayInboundHandler runs 454 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 354 over it, 4.54\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/daemon/src/domain/gateway/relay-inbound.ts"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"702dc1963cf00ee45bbef46af1cb81793d0a8fc6ccd2df00b68a1ce780228085"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: domain/rigspec-instantiator.ts: FileTooLong \u2014 2185 significant lines (blank, comment-only and punctuation-only lines excluded), about 84% of them inside a single declaration: PodRigInstantiator (523-3349). The bar is 500 significant lines; this is 1685 over it, 4.37\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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"579df942af44af962dcf417bd2f335f0d3c0407795f8f42828ac583e78ec112b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: context-packs.contextPacksRoutes: FunctionTooLong \u2014 contextPacksRoutes runs 437 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 337 over it, 4.37\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/daemon/src/routes/context-packs.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69fdf6dee02d8d5ed7d35fad2f56c38e8d984236ba9b54f7e8b45227565bf0d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: domain/restore-orchestrator.ts: FileTooLong \u2014 2065 significant lines (blank, comment-only and punctuation-only lines excluded), about 89% of them inside a single declaration: RestoreOrchestrator (301-3189). The bar is 500 significant lines; this is 1565 over it, 4.13\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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3cf7ec9379bbb269f8d85d1d1522287b53964340a66b3ee5f275876b928da9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/startup.ts: FileTooLong \u2014 2050 significant lines (blank, comment-only and punctuation-only lines excluded), about 81% of them inside a single declaration: createDaemon (344-3002). The bar is 500 significant lines; this is 1550 over it, 4.10\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/daemon/src/startup.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f16baac52b2bb898a39a0edf97fb51562045702181cdfa131caecdfbebaedd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WorkflowProjector.projectStep: MethodTooLong \u2014 projectStep runs 410 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 310 over it, 4.10\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/daemon/src/domain/workflow-projector.ts"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f78399994ca8d8c86848ff3c2c7c3de2b1d08b61b8a26ecb96a105d15d89b1a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SeatLifecycleService: ClassTooLong \u2014 1615 significant lines (blank, comment-only and punctuation-only lines excluded), 54 methods. The bar is 400 significant lines; this is 1215 over it, 4.04\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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"81abbf97f1d43a65bd6d7f345ebd0e528d71bd06f6ef6f4637f922c9fbab94bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: render.contentLines: FunctionTooLong \u2014 contentLines runs 403 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 303 over it, 4.03\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/tui/src/render.ts"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"3140d744aead1e3cf693409fde5022d736bb6d3591bf35ba02b140d5e403d611"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: hydrate.hydrateSnapshot: FunctionTooLong \u2014 hydrateSnapshot runs 399 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 299 over it, 3.99\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/tui/src/hydrate.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"6469bf8f0119e83f76eb2044d7555418461a16beef7b9e9f25df0c07a1c83dbd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: host.hostCommand: FunctionTooLong \u2014 hostCommand runs 393 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 293 over it, 3.93\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/commands/host.ts"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9cefa96e569174a6a63d6efaa79d300b7d2f99bb80fd62c23d283297fd6c621"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/queue.ts: FileTooLong \u2014 1963 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1463 over it, 3.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":"packages/cli/src/commands/queue.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e057b78a3275aa5242a61ec44922b692f72c802376cbb94260689397e98ddb6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: domain/seat-lifecycle-service.ts: FileTooLong \u2014 1912 significant lines (blank, comment-only and punctuation-only lines excluded), about 84% of them inside a single declaration: SeatLifecycleService (362-2552). The bar is 500 significant lines; this is 1412 over it, 3.82\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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a5fd0e4fa21a56f3df221c348cc8c9046625f7efbe9023ab2f577ea52935e06"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: adapters/codex-runtime-adapter.ts: FileTooLong \u2014 1877 significant lines (blank, comment-only and punctuation-only lines excluded), about 66% of them inside a single declaration: CodexRuntimeAdapter (152-2125). The bar is 500 significant lines; this is 1377 over it, 3.75\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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f150a96c9254f092b6eb7e333f2a29d26d93598ee32ee979ef1ec8460ec1b254"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TmuxAdapter: TooManyMethods \u2014 112 methods. The bar is 30 methods; this is 82 over it, 3.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":"packages/daemon/src/adapters/tmux.ts"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"a627f1ea5fda8c3502763012f023d90ef4b1c12dd9d9644b9ef7b3d9c1796f99"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/mcp-server.ts: FileTooLong \u2014 1830 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1330 over it, 3.66\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/mcp-server.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56644c81880bb558f62d9d898e9c47ef81a16c71707e508a06bfb1765f22a51"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: adapters/tmux.ts: FileTooLong \u2014 1818 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1318 over it, 3.64\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/adapters/tmux.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b740d31e2cb7b1d41f5676747b503061abe39936a73de4e9d7c1667a724e0c7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: slack.slackCommand: FunctionTooLong \u2014 slackCommand runs 362 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 262 over it, 3.62\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/commands/slack.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"22166dc22011663c8789aa207af997228e2dddd113120e96f01833f10ea1a401"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: server.createApp: FunctionTooLong \u2014 createApp runs 360 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 260 over it, 3.60\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/daemon/src/server.ts"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"d099e513a1c5acd665a1cc9c6cb32b1d488578856b95d828243a001b245eff59"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/scope.ts: FileTooLong \u2014 1797 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1297 over it, 3.59\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/commands/scope.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"503e5db8f47f65ae7a58bc31514820c864b6c27a6d53d496663862fce4f9a3f5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SeatHandoverService.handover: MethodTooLong \u2014 handover runs 350 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 250 over it, 3.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":"packages/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d07e190ef1765b4630c993f434716c2c1ae24aaeaca3b66ed4b45546fbd5c71"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: adapters/pi-runner.ts: FileTooLong \u2014 1743 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1243 over it, 3.49\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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aac34eb631a40ea092d1583275269fe77eaeedb5c541a0b9108887a3602c4087"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gateway.gatewayRoutes: FunctionTooLong \u2014 gatewayRoutes runs 347 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 247 over it, 3.47\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/daemon/src/routes/gateway.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"6653ef6b6123cf7aa4b45faaa697b6c45225847aa5f5f0c29fb3c1f8612e2b71"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: workflow.workflowRoutes: FunctionTooLong \u2014 workflowRoutes runs 347 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 247 over it, 3.47\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/daemon/src/routes/workflow.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c141520b5122ff8bcb1e6818a11a6069e0acb5b7e2563febc0c1497017d0de"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/seat.ts: FileTooLong \u2014 1723 significant lines (blank, comment-only and punctuation-only lines excluded), about 64% of them inside a single declaration: seatCommand (540-1829). The bar is 500 significant lines; this is 1223 over it, 3.45\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/cli/src/commands/seat.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"511a8ebd47b7ab22c79cd4356acff20c035d01ac89606fb116b0f646030c4cb5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: queue-erasure.eraseQueue: FunctionTooLong \u2014 eraseQueue runs 337 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 237 over it, 3.37\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/daemon/src/domain/queue-erasure.ts"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df2327bf941a9e7b5c5fb0d138948812a10965f4a06fbc3592b7b736bf003f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: PackageInstallFlow.PackageInstallFlow: FunctionTooLong \u2014 PackageInstallFlow runs 332 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 232 over it, 3.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/ui/src/components/PackageInstallFlow.tsx"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd3dd0cb408604b6c3a09e996d447fab645afc040a99bcfd8c87464f008922c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: QueueRepository.updateInTransactionalContext: MethodTooLong \u2014 updateInTransactionalContext runs 328 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 228 over it, 3.28\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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":3628}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1054808739ed1c362cdb1f9fc9bd933047bfe1944aceefc1e303ec33501e00e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: start.startCommand: FunctionTooLong \u2014 startCommand runs 326 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 226 over it, 3.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":"packages/cli/src/commands/start.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ab56f52bcd3d212e3f33884137b7618f060c9350c5f05f50501072035a4684"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: queue-wake-ladder.advancePromptRefusals: FunctionTooLong \u2014 advancePromptRefusals runs 325 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 225 over it, 3.25\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/daemon/src/domain/queue-wake-ladder.ts"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9f39197b96e9755f3be82eb489d866fb32fbf4c3d8131da7d590610e0786c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: RigGraph.RigGraph: FunctionTooLong \u2014 RigGraph runs 323 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 223 over it, 3.23\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/ui/src/components/RigGraph.tsx"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"b405cdbf2939fb1d0cfe12f7536adf765124ff0e0b56e48e831eb4610f117f34"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: VellumBackgroundLab.IsoSvg: FunctionTooLong \u2014 IsoSvg 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":"packages/ui/src/components/lab/VellumBackgroundLab.tsx"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"f38d1584f89713834080df96c6e6dba3dffa1610524e080035a971ee51b22ccf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rig-mode.rigModeCommand: FunctionTooLong \u2014 rigModeCommand runs 316 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 216 over it, 3.16\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/commands/rig-mode.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"955535457cc4b40f94e6bea3ec8987d969ce9ab1e4f7a6f3ca8005807c2344f0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mission-control.missionControlRoutes: FunctionTooLong \u2014 missionControlRoutes runs 312 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 212 over it, 3.12\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/daemon/src/routes/mission-control.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8daa0a946a1c53d77cc11aa8c707a4b6e2a2eb2d9f580f0e779722c8bdd8103"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SeatHandoverService: ClassTooLong \u2014 1246 significant lines (blank, comment-only and punctuation-only lines excluded), 33 methods. The bar is 400 significant lines; this is 846 over it, 3.12\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/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"92625fa2c9495737650febb23523cdd98347390e8a8ac2db9c11ad4dff0e8318"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: proof.proofCommand: FunctionTooLong \u2014 proofCommand runs 311 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 211 over it, 3.11\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/commands/proof.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2f72ff466fb73a1f24525193ce9343dad325d3d9a739d1002956f34de52080"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/render.ts: FileTooLong \u2014 1553 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1053 over it, 3.11\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/tui/src/render.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01559af9407d12a0c8e2a7ff6ee653ae5f2b6ff24885f15ca4f80a7072da5588"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CodexRuntimeAdapter: ClassTooLong \u2014 1235 significant lines (blank, comment-only and punctuation-only lines excluded), 68 methods. The bar is 400 significant lines; this is 835 over it, 3.09\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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"82dc3ae2f36985e9011801861e112d5fec7d5292379b603e5f5ba1fedd45b6dc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PodRigInstantiator.launchExistingAgentMember: MethodTooLong \u2014 launchExistingAgentMember runs 308 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 208 over it, 3.08\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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":2477}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34bdfa98c327c4af45dc0c03286d3f89468489b51bee13f37345ec7fd77097c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: FeedCard.FeedCard: FunctionTooLong \u2014 FeedCard runs 306 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 206 over it, 3.06\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/ui/src/components/for-you/FeedCard.tsx"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"aec74b581320c53fc3899ae08a9324ddee53cda26e56505cc9300fc46ec6767e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: domain/claude-compaction-enforcer.ts: FileTooLong \u2014 1514 significant lines (blank, comment-only and punctuation-only lines excluded), about 73% of them inside a single declaration: ClaudeCompactionEnforcer (717-2404). The bar is 500 significant lines; this is 1014 over it, 3.03\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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ff0201ba744ddc3536fbb76ee6e26c1c7f913da77cd38061bcb2ac87df76cd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ProjectTreeView.ProjectTreeView: FunctionTooLong \u2014 ProjectTreeView runs 302 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 202 over it, 3.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":"packages/ui/src/components/project/ProjectTreeView.tsx"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"998219c0e60f6a2e3f6b330ace62cc7702328306aec5d5efd87db9ee44c853c9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PodRigInstantiator.instantiateOnce: MethodTooLong \u2014 instantiateOnce runs 298 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 198 over it, 2.98\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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":1478}}}],"partialFingerprints":{"codehealthFindingId/v1":"5877d11820d8fdb70e8a6f1c7b777e25ef793673f375c94726c790a2b958a369"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: domain/seat-handover-service.ts: FileTooLong \u2014 1489 significant lines (blank, comment-only and punctuation-only lines excluded), about 84% of them inside a single declaration: SeatHandoverService (329-2167). The bar is 500 significant lines; this is 989 over it, 2.98\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/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2329a510831f3ae343d5b80235db94ced80ed844450a7acf3d3e7f2cba32330"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WorkflowRuntime: ClassTooLong \u2014 1186 significant lines (blank, comment-only and punctuation-only lines excluded), 28 methods. The bar is 400 significant lines; this is 786 over it, 2.97\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/daemon/src/domain/workflow-runtime.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"b39af07eee1c50414cd860d99b6263a97626a82dd5889a191267ed73eb98939a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: transport.transportRoutes: FunctionTooLong \u2014 transportRoutes runs 296 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 196 over it, 2.96\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/daemon/src/routes/transport.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d01675a728ada7e770fbe417b06b894cc18332dd95a13300bf5b6570be1295e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: projects.projectsRoutes: FunctionTooLong \u2014 projectsRoutes runs 292 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 192 over it, 2.92\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/daemon/src/routes/projects.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"457f262c360c94ff6c1d93076430cf4e6323bb95a92e0ec467d24dabeb4e3b28"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WorkflowRuntime.instantiate: MethodTooLong \u2014 instantiate runs 287 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 187 over it, 2.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":"packages/daemon/src/domain/workflow-runtime.ts"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d295ee0cdd3c299e45bcf73e5c5d8905ead26387ba43d3203b641ed8d62dcdc"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RestoreCheckService: ClassTooLong \u2014 1118 significant lines (blank, comment-only and punctuation-only lines excluded), 35 methods. The bar is 400 significant lines; this is 718 over it, 2.80\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/daemon/src/domain/restore-check-service.ts"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c7aeb11a6dc9f8833bc81a7a3dc9a7c148efa650ec20bdedc1e24b829201fad"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: send.sendCommand: FunctionTooLong \u2014 sendCommand runs 279 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 179 over it, 2.79\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/commands/send.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c2efb72f17b43a5fbebd038ae609ead03ec4499bd1110b6b6265bd479d087a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ClaudeCompactionEnforcer: ClassTooLong \u2014 1104 significant lines (blank, comment-only and punctuation-only lines excluded), 54 methods. The bar is 400 significant lines; this is 704 over it, 2.76\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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"83fcbbabc7f5e14617131e0e81b8b5d0ef14d360139ece9925a919f73618dc14"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: project.projectCommand: FunctionTooLong \u2014 projectCommand runs 273 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 173 over it, 2.73\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/commands/project.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d4a84518c9fd101490e95c7abbaeda9b7ed5b9fb83ffe83ac91c497d596bb1b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: TerminalLauncher.TerminalLauncher: FunctionTooLong \u2014 TerminalLauncher runs 273 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 173 over it, 2.73\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/ui/src/components/topology/TerminalLauncher.tsx"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"c53103fd0b192a86e40f246a6feb84e84fcd7d276e8062c86acbc38696b4eab4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: walk.walkCommand: FunctionTooLong \u2014 walkCommand runs 272 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 172 over it, 2.72\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/commands/walk.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f60127c68bda2d99dcffc42339ff27f9ee055713e6a088582347e34d9638c2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: launch.launchCommand: FunctionTooLong \u2014 launchCommand runs 271 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 171 over it, 2.71\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/commands/launch.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2e5f4061e3d2bced0fa09edffcd7e9223be82dea2f893ed0237c52c937b9a21"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WorkflowValidator.validate: MethodTooLong \u2014 validate runs 271 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 171 over it, 2.71\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/daemon/src/domain/workflow-validator.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"37eebcd88826179ee8c1a0759325ab8ea4af4d04e3aba72c253e45ef6a864c2f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: activity.postHook: FunctionTooLong \u2014 postHook runs 270 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 170 over it, 2.70\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/daemon/src/routes/activity.ts"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"1565e0e09e0ee8a424be141426307274f2916dbd06af3efb7ac063802a0a4554"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: domain/queue-wake-ladder.ts: FileTooLong \u2014 1343 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 843 over it, 2.69\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/daemon/src/domain/queue-wake-ladder.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"942ae67c0d9d184a6a93a05abd5439454e4c63bae42d87435dbb92e9b4900b5b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/ps.ts: FileTooLong \u2014 1340 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 840 over it, 2.68\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/commands/ps.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f1f104491c8e6e9a0dd1b8f211b2c2a51ed624a4a4baab00751ddf377112b2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: watchdog.watchdogCommand: FunctionTooLong \u2014 watchdogCommand runs 268 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 168 over it, 2.68\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/commands/watchdog.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c1daf26dacd8d91aac3e0e84a51b9a15dcd5334f7d43ffc3c920cbf0f10300b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: domain/workflow-projector.ts: FileTooLong \u2014 1338 significant lines (blank, comment-only and punctuation-only lines excluded), about 61% of them inside a single declaration: WorkflowProjector (259-1499). The bar is 500 significant lines; this is 838 over it, 2.68\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/daemon/src/domain/workflow-projector.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a7ae859b564f4384542c1f002b72b80feeb8f1e16d882315fabc800128af74e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: domain/workflow-runtime.ts: FileTooLong \u2014 1327 significant lines (blank, comment-only and punctuation-only lines excluded), about 89% of them inside a single declaration: WorkflowRuntime (160-1990). The bar is 500 significant lines; this is 827 over it, 2.65\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/daemon/src/domain/workflow-runtime.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56021f08fef2f1e35b4642762b507dbb023119f2c3ebdb93710963ac1a44534"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bundle.bundleCommand: FunctionTooLong \u2014 bundleCommand runs 265 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 165 over it, 2.65\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/commands/bundle.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"1393d58dd8d83503a0f7b3fa00238f7223febff4b2dd66a678fee3ffc7404c31"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: chatroom.chatroomCommand: FunctionTooLong \u2014 chatroomCommand runs 264 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 164 over it, 2.64\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/commands/chatroom.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff9340dc65b71db0ae9b357d8444cc7f1767fa7afc5ce38c685e66082211731"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: domain/restore-check-service.ts: FileTooLong \u2014 1316 significant lines (blank, comment-only and punctuation-only lines excluded), about 85% of them inside a single declaration: RestoreCheckService (286-1898). The bar is 500 significant lines; this is 816 over it, 2.63\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/daemon/src/domain/restore-check-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab4b5fc9694f32165b7d1dc164154960c522830a38c3f93cf8f77f1b8762e609"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: provider.providerRoutes: FunctionTooLong \u2014 providerRoutes runs 262 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 162 over it, 2.62\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/daemon/src/routes/provider.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0dc02f68b4d263ad86aaecd0d54b6a4a9ef93c936e15b1881e254153e0adb04"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WorkflowRuntime.route: MethodTooLong \u2014 route runs 260 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 160 over it, 2.60\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/daemon/src/domain/workflow-runtime.ts"},"region":{"startLine":1520}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cace5d2480555fd6e0182aa1ef89d08c85b2481a5fae0fe8d51d6117be5add4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ps.psCommand: FunctionTooLong \u2014 psCommand runs 259 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 159 over it, 2.59\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/commands/ps.ts"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"96433f2ecb4a6915241c8be093217532b0861dd340ee18fe52ab5d80450031ff"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SeatLifecycleService.launchFresh: MethodTooLong \u2014 launchFresh runs 259 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 159 over it, 2.59\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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":1638}}}],"partialFingerprints":{"codehealthFindingId/v1":"91300b0dd38078b23d3f1694602a12764b9a03ddab00724e37727a562847de7c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: queue-wake-ladder.runWakeLadderTick: FunctionTooLong \u2014 runWakeLadderTick runs 257 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 157 over it, 2.57\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/daemon/src/domain/queue-wake-ladder.ts"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ac273161fb87077f8e82a5fb0e47f6651586d1fa9ac71ad8091d60231adba2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: domain/queue-stuck-sweep.ts: FileTooLong \u2014 1276 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 776 over it, 2.55\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/daemon/src/domain/queue-stuck-sweep.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"813547a416c2352b851d4295826d743fedc07fc1b4ef3cba473d79204f19efec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: routes/queue.ts: FileTooLong \u2014 1275 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: queueRoutes (156-1942). The bar is 500 significant lines; this is 775 over it, 2.55\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/daemon/src/routes/queue.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd6869a4e77c8def8cf0358cf9eaec80caf2958022726dfd1a3c9abd2fca77a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: domain/node-inventory.ts: FileTooLong \u2014 1262 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 762 over it, 2.52\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/daemon/src/domain/node-inventory.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da2825baa3e63e3362061d7e0c18ce5a0442a7eb6071ed7d5f613c879edb6ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: agent-images.agentImagesRoutes: FunctionTooLong \u2014 agentImagesRoutes runs 251 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 151 over it, 2.51\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/daemon/src/routes/agent-images.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"34015f5defcbf6c29c4e1cf58412cad1887e258d13c86da4d361fcf900c8cd40"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: BootstrapWizard.BootstrapWizard: FunctionTooLong \u2014 BootstrapWizard runs 251 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 151 over it, 2.51\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/ui/src/components/BootstrapWizard.tsx"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"a95187c477e2fc86431ef25ff80c072ba005cbdb44e1739a9dce88d9b23b086c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: HostMultiRigGraph.HostMultiRigGraph: FunctionTooLong \u2014 HostMultiRigGraph runs 250 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 150 over it, 2.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":"packages/ui/src/components/topology/HostMultiRigGraph.tsx"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"3208f947aac74bb110a08419b14271fabf73156947127db480be42a698eb835c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: agent-image.agentImageCommand: FunctionTooLong \u2014 agentImageCommand runs 249 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 149 over it, 2.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":"packages/cli/src/commands/agent-image.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"add8933e978bfe564579585ca49b3580e723fae4b173eaf4ca4931b62e9cc69c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WatchdogPolicyEngine.evaluate: MethodTooLong \u2014 evaluate runs 242 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 142 over it, 2.42\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/daemon/src/domain/watchdog-policy-engine.ts"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50d074e6084820c16b20d6d1db031de55ffdd7e2d1eacb81cf04fe4d8bb964b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: restore-packet.restorePacketCommand: FunctionTooLong \u2014 restorePacketCommand runs 234 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 134 over it, 2.34\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/commands/restore-packet.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb00beafd064ce222aa4f65a1b6d598762a58e32f88fd16bed9b6235933ec7b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ImportFlow.ImportFlow: FunctionTooLong \u2014 ImportFlow runs 234 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 134 over it, 2.34\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/ui/src/components/ImportFlow.tsx"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dfaa0d23f37cca87e2bd0099c0934d44c6861904cdf95fa7ad2c16e93754492"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: AppShell.AppShellInner: FunctionTooLong \u2014 AppShellInner runs 229 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 129 over it, 2.29\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/ui/src/components/AppShell.tsx"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e01f0999ef3d75bde9e211e7aa6896423a90e3bb14cdf6639aedb4cd4cadc11"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CodexRuntimeAdapter: TooManyMethods \u2014 68 methods. The bar is 30 methods; this is 38 over it, 2.27\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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdaf3ff1f7f7a2c2447af3ce8c3bdf1a40da13f51b9ff35413d25ffbd760b552"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: agent-server.serveAcpAgent: FunctionTooLong \u2014 serveAcpAgent runs 225 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 125 over it, 2.25\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/acp/agent-server.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e233ab0e4ee8f378ba914f22d4130d21cd51e32f0c02cd4d571377fcbaba117"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: Feed.Feed: FunctionTooLong \u2014 Feed runs 223 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 123 over it, 2.23\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/ui/src/components/for-you/Feed.tsx"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9732f0f70aff25ef28d5f50a453b73f8e369d06105b09a371a16850bdd5a1f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/migrate-telemetry-state-0.5.9.mjs: FileTooLong \u2014 1109 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 609 over it, 2.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":"skills/_canonical/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a988e29236c2ee2a59532fe8808f1682b7904496c331a0ae64207780a864e5a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: skill.skillCommand: FunctionTooLong \u2014 skillCommand runs 219 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 119 over it, 2.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/cli/src/commands/skill.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d92e1712fcf4aa9224900a97da1fc3d7aefe77ddf25805a9e320c9db033de6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: VerbActions.VerbActions: FunctionTooLong \u2014 VerbActions runs 216 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 116 over it, 2.16\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/ui/src/components/mission-control/components/VerbActions.tsx"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b520621e4f2caa8c3849fd2e14dda62bd14fd310da1989b6b7bcb78e023d92"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rig.rigCommand: FunctionTooLong \u2014 rigCommand runs 215 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 115 over it, 2.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":"packages/cli/src/commands/rig.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b2af291b4f8f751e28853f54406c2c2fe998d32264fdfd466187dcc279deb1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: domain/skill-catalog.ts: FileTooLong \u2014 1070 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 570 over it, 2.14\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/daemon/src/domain/skill-catalog.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8569899cbd486c24762aa3343a32364482e3f2888bc34ada9d193080418fdd8d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: relay-inbound.createRelayInboundHandler.handle: FunctionTooLong \u2014 createRelayInboundHandler.handle runs 214 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 114 over it, 2.14\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/daemon/src/domain/gateway/relay-inbound.ts"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c986e0284cf8feb24d057d50b47814847e520f0fa0f7f053049d67d99fb84f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: project/ScopePages.tsx: FileTooLong \u2014 1067 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 567 over it, 2.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":"packages/ui/src/components/project/ScopePages.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6bb9e6144766c61d01e0c306090683fefb2bf36d08abe12b0ff1c7e75ebde69"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: domain/execution-view.ts: FileTooLong \u2014 1060 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 560 over it, 2.12\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/daemon/src/domain/execution-view.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a2e77247ecef0b5211b4fbd0d2d7f18bdeb0ff8649165bc9333b5f1fa63e1ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: slack/slack-subsystem.ts: FileTooLong \u2014 1045 significant lines (blank, comment-only and punctuation-only lines excluded), about 81% of them inside a single declaration: buildSlackGatewayWire (303-1556). The bar is 500 significant lines; this is 545 over it, 2.09\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/daemon/src/domain/gateway/slack/slack-subsystem.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c71917e17959a997e7ea943f8b0e669bee4cdbf1aff6e85927674e25d9807b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: package.packageCommand: FunctionTooLong \u2014 packageCommand runs 208 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 108 over it, 2.08\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/commands/package.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a047b05664b87ccf59321f43fd2fabc5f9b2b5a352838ea8bfd4169c2f6227"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: domain/rigspec-schema.ts: FileTooLong \u2014 1039 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 539 over it, 2.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":"packages/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e575c2a9422b3bdc969e86fc400212fb4eb44fe82ae28b5aedb857c791727025"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RigRepository: TooManyMethods \u2014 62 methods. The bar is 30 methods; this is 32 over it, 2.07\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/daemon/src/domain/rig-repository.ts"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd4b767cac876b032b80edc0d2d8c14f85e055e65c515614fcfc78081969a07"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WorkflowProjector.projectDependencyGraph: MethodTooLong \u2014 projectDependencyGraph runs 206 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 106 over it, 2.06\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/daemon/src/domain/workflow-projector.ts"},"region":{"startLine":1244}}}],"partialFingerprints":{"codehealthFindingId/v1":"39759671f898b3ec61f74299b6382a3ac1d299cda6898214baa074a124a1e5ef"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: slices/slice-indexer.ts: FileTooLong \u2014 1028 significant lines (blank, comment-only and punctuation-only lines excluded), about 79% of them inside a single declaration: SliceIndexer (367-1676). The bar is 500 significant lines; this is 528 over it, 2.06\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/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f59588fa27be63caa7cb4440dddef293ba034921671e47ff12657cb5965f18"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WorkflowProjector: ClassTooLong \u2014 822 significant lines (blank, comment-only and punctuation-only lines excluded), 11 methods. The bar is 400 significant lines; this is 422 over it, 2.06\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/daemon/src/domain/workflow-projector.ts"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bcc1fa7e91c7dd55371608f7c46f549a6b04a3ba872a49f04d3cf9f5355ab2a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: scope.buildSliceCloseCommand: FunctionTooLong \u2014 buildSliceCloseCommand runs 205 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 105 over it, 2.05\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/commands/scope.ts"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"75efc5a8fcc83526ace871c63354c5b92d216baf6b55351383e987dcb821d2a9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: state.reduce: FunctionTooLong \u2014 reduce runs 205 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 105 over it, 2.05\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/tui/src/state.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"88fa83fdf541cb169b91d93a8821cf2a0106927171721a0369f4ef62dcf3c525"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: domain/rig-repository.ts: FileTooLong \u2014 1016 significant lines (blank, comment-only and punctuation-only lines excluded), about 67% of them inside a single declaration: RigRepository (362-1332). The bar is 500 significant lines; this is 516 over it, 2.03\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/daemon/src/domain/rig-repository.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22625fe9442682750665e3df93aefd26704764018aa84b0a11adbc406c8197e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: import.importCommand: FunctionTooLong \u2014 importCommand runs 203 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 103 over it, 2.03\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/commands/import.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0564a5393207d97e01f4d242d2b17c868f3985a230750e5f8a3a99af5f6def"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: slack-delivery.deliverSinglePart: FunctionTooLong \u2014 deliverSinglePart runs 203 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 103 over it, 2.03\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/daemon/src/domain/gateway/slack/slack-delivery.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb45fdcd6668eaf9d1c8ef5c97f503de89c1f0ee93b454b363c211e3940ccd5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SliceIndexer: ClassTooLong \u2014 808 significant lines (blank, comment-only and punctuation-only lines excluded), 40 methods. The bar is 400 significant lines; this is 408 over it, 2.02\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/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e7fdb02b9171387bbbf3e9e7b8122401719b1f2143c8d86a672cf8da3cbfa7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ClaudeCompactionPolicyForm.PolicyFormBody: FunctionTooLong \u2014 PolicyFormBody runs 202 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 102 over it, 2.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":"packages/ui/src/components/system/ClaudeCompactionPolicyForm.tsx"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e7531db6a635be2fafee8335f27bb075246d1bd0c64ca0c87107068599d65e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: slack-delivery.deliverSinglePart.\u003Creturned closure\u003E: FunctionTooLong \u2014 deliverSinglePart.\u003Creturned closure\u003E runs 201 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 101 over it, 2.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":"packages/daemon/src/domain/gateway/slack/slack-delivery.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad351dafdf744c3fd1b4d9fb28e33f26163fd9480e1273213f6ff2057c0a9ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: migrate-telemetry-state-0.5.9.applyLibrary: FunctionTooLong \u2014 applyLibrary runs 201 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 101 over it, 2.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":"skills/_canonical/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e78384f85c80a555a649a74960d2f7c7dab206136d070392e67b035db6218ba"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/config-store.ts: FileTooLong \u2014 1002 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 502 over it, 2.00\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/config-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd3f9ced1396e0e8f1663c751bfd283c3aed66e3c3115ad52d1ac2cffa7c581"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ClaudeCodeAdapter: ClassTooLong \u2014 798 significant lines (blank, comment-only and punctuation-only lines excluded), 29 methods. The bar is 400 significant lines; this is 398 over it, 2.00\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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"de09b74a74fc8c7299d1773b31d43555d5f7fea0726e6bc79043a0d101d78b62"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: StartupOrchestrator: ClassTooLong \u2014 797 significant lines (blank, comment-only and punctuation-only lines excluded), 19 methods. The bar is 400 significant lines; this is 397 over it, 1.99\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/daemon/src/domain/startup-orchestrator.ts"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"887e6bbd76f02c5abfdbf7fdef60ce98a43f8d055cf218c973f66066790e8a21"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: domain/types.ts: FileTooLong \u2014 988 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 488 over it, 1.98\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/daemon/src/domain/types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda1ed0d3a4e7747c65ab898caf86554eac06d7bdabc922676c800e69f668b53"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: stream.streamCommand: FunctionTooLong \u2014 streamCommand runs 197 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 97 over it, 1.97\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/commands/stream.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a574581faaaa6372d50ff145a76684db1af7c0ae0fc0e899109be94762c921"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: watchdog.watchdogRoutes: FunctionTooLong \u2014 watchdogRoutes runs 197 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 97 over it, 1.97\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/daemon/src/routes/watchdog.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f63730753e72e7717dbb2485380f34bd4c6b7d48b467b6c9e2af036a94e1a0c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: FocusedTerminal.FocusedTerminal: FunctionTooLong \u2014 FocusedTerminal runs 197 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 97 over it, 1.97\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/ui/src/components/terminal/FocusedTerminal.tsx"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3cbf0cb1e8b3e5a4bda675a4b7c4cd86cc74573b4581f6a830c792b9ceadc78"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DaemonClient: TooManyMethods \u2014 59 methods. The bar is 30 methods; this is 29 over it, 1.97\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/tui/src/daemon-client.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e03c2e6be41f78c53bd2ee556dc9f38161cfff9b262549010fc03db156f96a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: domain/startup-orchestrator.ts: FileTooLong \u2014 979 significant lines (blank, comment-only and punctuation-only lines excluded), about 81% of them inside a single declaration: StartupOrchestrator (291-1500). The bar is 500 significant lines; this is 479 over it, 1.96\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/daemon/src/domain/startup-orchestrator.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"807adcd541a056827391d3cbe6d9a1afc48760d6dbff49a5b0b232f971d7f7f8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: daemon-lifecycle.startOwnedDaemon: FunctionTooLong \u2014 startOwnedDaemon runs 194 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 94 over it, 1.94\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/daemon-lifecycle.ts"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"c70c33d6bdaeac35e14584a10ffadbd36112db694ccbef6e0027cd78e93a10c3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SessionTransport: TooManyMethods \u2014 58 methods. The bar is 30 methods; this is 28 over it, 1.93\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/daemon/src/domain/session-transport.ts"},"region":{"startLine":2373}}}],"partialFingerprints":{"codehealthFindingId/v1":"70bc7c627d4a706ed9c88c63411639406800b0b84b5a341cf642d4dd4b430314"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/daemon-lifecycle.ts: FileTooLong \u2014 961 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 461 over it, 1.92\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/daemon-lifecycle.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbffb8d5e95df2a64055b06d39831d4a95e1393ac3992c6a1f255c6339406409"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: adapters/claude-code-adapter.ts: FileTooLong \u2014 958 significant lines (blank, comment-only and punctuation-only lines excluded), about 83% of them inside a single declaration: ClaudeCodeAdapter (110-1409). The bar is 500 significant lines; this is 458 over it, 1.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":"packages/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4328dd4c2617349a66451b48a7c0aaed9a0baebff6bf4204d5719cdb6301f3d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: scope-audit.classifyScopeItem: FunctionTooLong \u2014 classifyScopeItem runs 190 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 90 over it, 1.90\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/lib/scope/scope-audit.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1a6e39632e58451a7167f670d0e4a107df714baaa6b80978de930644c0ad55"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: scope-audit.classifyScopeItem: FunctionTooLong \u2014 classifyScopeItem runs 190 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 90 over it, 1.90\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/daemon/src/domain/scope/scope-audit.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d6094fbb7c370d000ad1a7d79a4bf9f3a4bed528c831e63c20ea2251496797"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: scope.buildAuditCommand: FunctionTooLong \u2014 buildAuditCommand runs 189 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 89 over it, 1.89\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/commands/scope.ts"},"region":{"startLine":1266}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c067fe70ebc49ec9260e02ac860f39bd30dfe4ced117ebe9cf04aaec43792d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SeatHandoverService.commit: MethodTooLong \u2014 commit runs 189 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 89 over it, 1.89\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/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":1864}}}],"partialFingerprints":{"codehealthFindingId/v1":"f507a027cf821262c06c9409144a11c867e6b1f2b75222d6d0ebcc9da3d03abb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: project-lifecycle-compiler.compileProjectLifecycle: FunctionTooLong \u2014 compileProjectLifecycle runs 188 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 88 over it, 1.88\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/daemon/src/domain/project-lifecycle-compiler.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0546650a16bb0716a2dd2a1542305528c8c21fb1823613c05fb4809d5a281ac"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InstallPlanner.plan: MethodTooLong \u2014 plan runs 182 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 82 over it, 1.82\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/daemon/src/domain/install-planner.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f4b6636f4d88515c596c1b15780f71fda50115f335324fabf6e91f588ab1418"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: domain/seat-restart-in-place.ts: FileTooLong \u2014 909 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 409 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":"packages/daemon/src/domain/seat-restart-in-place.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0dbc676d0da9d14617742d1d82dc6c1210cffff3ff0d4f7775850f1ab39ea3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: profile-resolver.resolveNodeConfig: FunctionTooLong \u2014 resolveNodeConfig runs 181 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 81 over it, 1.81\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/daemon/src/domain/profile-resolver.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"717c9c4e04a2d7ecec9a1f37007e08f056d6919ec4ba0ee996d2954045394d2c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ClaudeCompactionEnforcer: TooManyMethods \u2014 54 methods. The bar is 30 methods; this is 24 over it, 1.80\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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"24248488d6be136d32e165a78936b4731464ebecb5b851df61db043af74877ab"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SeatLifecycleService: TooManyMethods \u2014 54 methods. The bar is 30 methods; this is 24 over it, 1.80\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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d1ba3c846945fe2c198e0772a8642031aaca55bc51c3f8b171a8b66b8dba13"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: doctor.runDoctorChecks: FunctionTooLong \u2014 runDoctorChecks runs 179 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 79 over it, 1.79\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/commands/doctor.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb022b79de0627798d09b8d7546dafae23712c47400b6a05dfc573c141b7be32"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BootstrapOrchestrator.bootstrap: MethodTooLong \u2014 bootstrap runs 177 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 77 over it, 1.77\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/daemon/src/domain/bootstrap-orchestrator.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"d72802fa43270cf9833cacb3d5f93d1eb537bd0a2e7cafea34627ecae1b6b013"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: render.renderBody: FunctionTooLong \u2014 renderBody runs 175 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 75 over it, 1.75\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/tui/src/render.ts"},"region":{"startLine":1925}}}],"partialFingerprints":{"codehealthFindingId/v1":"58829fef998c63cc675ff51a4d217a7842f3e9a85c14ab41acb1dd20d1da8487"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RestoreOrchestrator.restore: MethodTooLong \u2014 restore runs 173 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 73 over it, 1.73\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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"c63e0342654516b9932105047c6cfdcd8c4f88c684f51e78f5c7475216f9b2e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: attention.attentionRoutes: FunctionTooLong \u2014 attentionRoutes runs 173 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 73 over it, 1.73\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/daemon/src/routes/attention.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"4692ae7d609d7f03d4ba02974c252d6b94e4b22c073609dfefbb1255e1f14c1d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/workflow.ts: FileTooLong \u2014 860 significant lines (blank, comment-only and punctuation-only lines excluded), about 89% of them inside a single declaration: workflowCommand (163-1107). The bar is 500 significant lines; this is 360 over it, 1.72\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/cli/src/commands/workflow.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e99a3ebf0dd317e4b2b6984cf46bccdd98d557ce6bef30ce36cac7a74cdc78"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: routes/activity.ts: FileTooLong \u2014 860 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 360 over it, 1.72\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/daemon/src/routes/activity.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f644a0bc1ef91ff8cabe3f8ed1b9e812e5af5f9c67098c15cb17abd6c2301568"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: user-settings/settings-store.ts: FileTooLong \u2014 858 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 358 over it, 1.72\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/daemon/src/domain/user-settings/settings-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8702cd3d367bf438f1fc4028f85317db762a266074efdaa8fd374ba702c7c387"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gateway/relay-inbound.ts: FileTooLong \u2014 856 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 356 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":"packages/daemon/src/domain/gateway/relay-inbound.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d242bd06481ad4153a0999375f3eec26c93855499e59a57a29043f2b3ca2258e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: review/compose.ts: FileTooLong \u2014 856 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 356 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":"packages/daemon/src/domain/review/compose.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f87257545413ce149a9732d7d6095519840d0f23a82bbeb4b1aca31e0c940fde"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: parked-owner-consumer.makeParkedOwnerConsumerPolicy: FunctionTooLong \u2014 makeParkedOwnerConsumerPolicy runs 171 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 71 over it, 1.71\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/daemon/src/domain/policies/parked-owner-consumer.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd553a457d4301db8ef92e20050b25733490d008ae6e91f9ad5ba4cd502ad8e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: AuditHistoryView.AuditHistoryView: FunctionTooLong \u2014 AuditHistoryView runs 170 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 70 over it, 1.70\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/ui/src/components/mission-control/views/AuditHistoryView.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b74415f046047a9725293d4c095aa5f98f45f5cfa60382428eb7a8a8d700706"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RigRepository: ClassTooLong \u2014 677 significant lines (blank, comment-only and punctuation-only lines excluded), 62 methods. The bar is 400 significant lines; this is 277 over it, 1.69\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/daemon/src/domain/rig-repository.ts"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8f58214765fa9f1916fa2b1bc83e2c5881ec0d7fab0ff18c76970ed2cdeed0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: parked-owner-consumer.makeParkedOwnerConsumerPolicy.evaluate: FunctionTooLong \u2014 makeParkedOwnerConsumerPolicy.evaluate runs 168 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 68 over it, 1.68\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/daemon/src/domain/policies/parked-owner-consumer.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5b84b112d0229c7a6a8a3adf8dcd82df4747c4c026ca6b3147b6675abfb831"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: policy.registerPermissionCommands: FunctionTooLong \u2014 registerPermissionCommands runs 167 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 67 over it, 1.67\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/commands/policy.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e261f7d19122de4ccf73d5f96e36fbac84ed92253b4677a8c210e169b107a9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RestoreOrchestrator.launchNodeTargets: MethodTooLong \u2014 launchNodeTargets runs 167 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 67 over it, 1.67\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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"64374e3161d7cab47af5bd14f72563ebfcfbc798b1a7585afbd0c853d49d8493"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: stream.streamRoutes: FunctionTooLong \u2014 streamRoutes runs 167 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 67 over it, 1.67\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/daemon/src/routes/stream.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2270c7a24cd21226968743876ff015b57328f71f68ec690dc078aceea1e5ee3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: grow.growCommand: FunctionTooLong \u2014 growCommand runs 166 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 66 over it, 1.66\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/commands/grow.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"05c82a626ef32e9de9c79c43661cad00d56663caf5acf3efec7ac64ea8d33c71"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ForkNowAction.ForkNowAction: FunctionTooLong \u2014 ForkNowAction runs 165 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 65 over it, 1.65\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/ui/src/components/agent-images/ForkNowAction.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6192941c8beae7287ad1f07a5d21462d8999788a7da9f1c9966408975e924cc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: HybridTopologyNodes.HybridAgentNodeInner: FunctionTooLong \u2014 HybridAgentNodeInner runs 164 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 64 over it, 1.64\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/ui/src/components/topology/HybridTopologyNodes.tsx"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e68c59279bb8aba377bd288e4fffcd6b5817368422f1579f598aec9a84af3f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: daemon.daemonCommand: FunctionTooLong \u2014 daemonCommand 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":"packages/cli/src/commands/daemon.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5dfc898bb86582a5a4b404915eee9fdaf83bd2dfb7608761174aa106e05a8a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: CompactStatusRow.CompactStatusRow: FunctionTooLong \u2014 CompactStatusRow 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":"packages/ui/src/components/mission-control/components/CompactStatusRow.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ffe991b473be059de6dbe80d7fa7f42947d208495af86bbe63fabd62365a8a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: domain/seat-skill-storage.ts: FileTooLong \u2014 813 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 313 over it, 1.63\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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3154c1ac4c973bed3ae28d14561dbb57cecda3a190afee82523db6d6b316f37"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: down.downCommand: FunctionTooLong \u2014 downCommand runs 162 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 62 over it, 1.62\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/commands/down.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"896d61b222c79138b5e3e1e577b4db1cec43239dff884b4c1f4395c978b18bf8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: files.filesRoutes: FunctionTooLong \u2014 filesRoutes runs 162 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 62 over it, 1.62\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/daemon/src/routes/files.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"701c27fffebd03611ad267a662027f6827299c5bacdd5891c7c2eaeef0085ec6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ask.askCommand: FunctionTooLong \u2014 askCommand 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":"packages/cli/src/commands/ask.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd535e84944910dac0f9ffa25df23240ae8e7aaa9a63e236094d27004dcf0a9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mcp.mcpCommand: FunctionTooLong \u2014 mcpCommand 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":"packages/cli/src/commands/mcp.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"120a9d7273e651c0462cfbbb5dcfe2e1f9ac303520269c3fc72502cb0d3c8414"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: routes/bundles.ts: FileTooLong \u2014 801 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 301 over it, 1.60\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/daemon/src/routes/bundles.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c91abd003191a7b3824e9e498426fb7e769092e0c3c7bbf8557296ba03a692d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ps.handleNodes: FunctionTooLong \u2014 handleNodes runs 160 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 60 over it, 1.60\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/commands/ps.ts"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba3732ce103498ca658804365733038ddc9d987194cc1f05c940ffc65d141613"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: plugin.pluginCommand: FunctionTooLong \u2014 pluginCommand runs 159 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 59 over it, 1.59\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/commands/plugin.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f447b61765284965a594ffad8e2405e1488e9fa15b865dd75530ba5e070c51b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: domain/queue-erasure.ts: FileTooLong \u2014 792 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 292 over it, 1.58\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/daemon/src/domain/queue-erasure.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a86d6a3ff59ab3ed5ae1a30089bb7e8eac7592ea78328d863aa9e912684cf50"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: terminal.terminalCommand: FunctionTooLong \u2014 terminalCommand runs 158 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 58 over it, 1.58\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/commands/terminal.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95da4beb0ec8d88b033aebb623765304e916e7c1e9e6f4560431c8969eebeba"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: QueueItemViewer.QueueItemViewer: FunctionTooLong \u2014 QueueItemViewer runs 157 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 57 over it, 1.57\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/ui/src/components/drawer-viewers/QueueItemViewer.tsx"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df11c1d04197cafbec7a2b1203ef5105d3216a13a828435a020aa1573f77a0d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SessionRegistry: TooManyMethods \u2014 47 methods. The bar is 30 methods; this is 17 over it, 1.57\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/daemon/src/domain/session-registry.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"354ed1904a393068ff540a73b0c63b6c51fa731ecc9a03027615edc352508c3a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/context.ts: FileTooLong \u2014 775 significant lines (blank, comment-only and punctuation-only lines excluded), about 78% of them inside a single declaration: contextCommand (241-1040). The bar is 500 significant lines; this is 275 over it, 1.55\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/cli/src/commands/context.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ae4eab43406e0cc62fababc57f38141cbf2500a456bd0dc5d5e1125a055b08"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: RigEnvPanel.RigEnvPanel: FunctionTooLong \u2014 RigEnvPanel 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":"packages/ui/src/components/RigEnvPanel.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d353a66475bb64d8bf01106af4382be06db46d52e41ae604832a41a206f76a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BootstrapOrchestrator: ClassTooLong \u2014 619 significant lines (blank, comment-only and punctuation-only lines excluded), 10 methods. The bar is 400 significant lines; this is 219 over it, 1.55\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/daemon/src/domain/bootstrap-orchestrator.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6420df347caa0dd00ccf5b70a289c799c7bb35cd8748fdd6346b78a049d36fb"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SeatActivityService: ClassTooLong \u2014 616 significant lines (blank, comment-only and punctuation-only lines excluded), 37 methods. The bar is 400 significant lines; this is 216 over it, 1.54\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/daemon/src/domain/seat-activity-service.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"51387e32a272a02667dbdf22bb3fb075f06388685fdf9ba02edffa8f1333e6a8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: QueueRepository.deliverWakeIntent: MethodTooLong \u2014 deliverWakeIntent runs 153 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 53 over it, 1.53\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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":1695}}}],"partialFingerprints":{"codehealthFindingId/v1":"3825c289f198d55f0532f90d81916ffa2a10f6643848a5f9243719a836ff22ec"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HerdrAdapter.openView: MethodTooLong \u2014 openView runs 152 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 52 over it, 1.52\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/daemon/src/domain/terminal/herdr-adapter.ts"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"1687a9fd10a45f927d4e468715dd2e3639275ee1b92f3edc1e7774608345f362"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: startup.applySelectedHistory: FunctionTooLong \u2014 applySelectedHistory runs 152 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 52 over it, 1.52\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/daemon/src/routes/startup.ts"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c3ca19803fb220a88a19ff98d68de804b22c0fed4f02b5c3762f345905a28f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/host.ts: FileTooLong \u2014 758 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 258 over it, 1.52\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/commands/host.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dce2cee2c455da4c1a5e6e0f18622b4b48175b7b584cddb9a368fedf44a04ce"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/send.ts: FileTooLong \u2014 756 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 256 over it, 1.51\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/commands/send.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5fdafa7d94c1fecf7d20f5bc029bee1be8a9640f346df3ceee4a69831d8107"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: HostConfigCard.HostConfigCard: FunctionTooLong \u2014 HostConfigCard runs 151 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 51 over it, 1.51\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/ui/src/components/dashboard/HostConfigCard.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"151dced9ae791d45e18bbbd3b8643fb7a4ec08fe7baf72746953a1702652a4ad"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RigLifecycleService: ClassTooLong \u2014 601 significant lines (blank, comment-only and punctuation-only lines excluded), 12 methods. The bar is 400 significant lines; this is 201 over it, 1.50\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/daemon/src/domain/rig-lifecycle-service.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"b103ef59442c6660c61c69ec2461cdb03cdf816800cacb13cd764f0cb31250dd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: seat-attention-reconciler.rebindAndVerifyPaneIdentity: FunctionTooLong \u2014 rebindAndVerifyPaneIdentity 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":"packages/daemon/src/domain/seat-attention-reconciler.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"e247dcc71e619d8106024cee9378ca4c52dde4719badd252d8478d7590d36991"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ReviewGatherer: ClassTooLong \u2014 598 significant lines (blank, comment-only and punctuation-only lines excluded), 31 methods. The bar is 400 significant lines; this is 198 over it, 1.50\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/daemon/src/domain/review/gather.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe63a3ad7cc9db48da133fcc9f25c15b5bf51dc4f28be62dde39c0ce8a8d570"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gateway/relay-outbound.ts: FileTooLong \u2014 747 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 247 over it, 1.49\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/daemon/src/domain/gateway/relay-outbound.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07235ea1eafe41068082b6ae48b88d12df36fdf9b9b80ac99b923b73bdc60885"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NodeLauncher.launchNode: MethodTooLong \u2014 launchNode 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":"packages/daemon/src/domain/node-launcher.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"920ab98748ddce6651e008693a43aa343dbb84bbf4aaa155c9625bd5c2ee7e36"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: up.upRoutes.post(\u0022/\u0022): FunctionTooLong \u2014 upRoutes.post(\u0022/\u0022) 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":"packages/daemon/src/routes/up.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed8c9b21274e82e183c44272a358d5650a44b3d0b96848c54cb050632208590e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: domain/rig-lifecycle-service.ts: FileTooLong \u2014 736 significant lines (blank, comment-only and punctuation-only lines excluded), about 82% of them inside a single declaration: RigLifecycleService (163-957). The bar is 500 significant lines; this is 236 over it, 1.47\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/daemon/src/domain/rig-lifecycle-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab017ffab46b9cddf176e4fe0a6c840ea781ccbd3a44bc6902eff91f37a33d59"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CodexInPlaceRestart.observe: MethodTooLong \u2014 observe runs 147 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\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/daemon/src/domain/seat-restart-in-place.ts"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"1229ac45e7089b8e181d30f26fd84734da8c558e89ac4518256a7b4be9307056"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: TopologyTableView.TopologyTableView: FunctionTooLong \u2014 TopologyTableView runs 147 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\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/ui/src/components/topology/TopologyTableView.tsx"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8e99b8b5194582c323d1a2503c1465bb75900b48c60683ee668f89292ee2b6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PodRigInstantiator: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 over it, 1.47\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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b423c68b8472576c5fd95158745e0257477090c04d51c2f08210b10a43b3bc7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: domain/seat-activity-service.ts: FileTooLong \u2014 731 significant lines (blank, comment-only and punctuation-only lines excluded), about 84% of them inside a single declaration: SeatActivityService (125-1055). The bar is 500 significant lines; this is 231 over it, 1.46\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/daemon/src/domain/seat-activity-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c1b59368be14cd62d58c9b0b4915ccf56d80b922a3aade4508fb60a7cc47e1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ConfigStore.resolve: MethodTooLong \u2014 resolve runs 146 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\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/config-store.ts"},"region":{"startLine":1376}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6434505d35effb01a95108f597d485dea9d4be1f483fcb4a82910afd6c28e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: scope-audit.scopeAuditRoutes: FunctionTooLong \u2014 scopeAuditRoutes runs 146 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\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/daemon/src/routes/scope-audit.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce883244f2ffeb0336152525a2fd8b1db9903ef2d26864546591016c7b47fdb8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gateway/human-registry.ts: FileTooLong \u2014 729 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 229 over it, 1.46\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/daemon/src/domain/gateway/human-registry.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1a04e2276f32e446f0dbeb8f8a02bcc9b253e8ef48884dd18dadd4bbe1c5f8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RigRepository.addNode: MethodTooLong \u2014 addNode runs 145 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\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/daemon/src/domain/rig-repository.ts"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"60f27fec8fa1dde6a53e8faaffe5a4020267e428cf2f74d6cb47e31acbce40d2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: transcript-rotation.startTranscriptRotation: FunctionTooLong \u2014 startTranscriptRotation runs 144 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\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/daemon/src/domain/transcript-rotation.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"a63fa686c4f863bb6367e2233b64e69e97c420c6e7b3c8b4f4f6416ab5debbe8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WorkflowRuntime.resume: MethodTooLong \u2014 resume runs 144 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\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/daemon/src/domain/workflow-runtime.ts"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"566058973a35d85d9935f41bb47a7f5a89630f33a02e5b569c2c5fe0763db3ef"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: skills.skillsRoutes: FunctionTooLong \u2014 skillsRoutes runs 144 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\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/daemon/src/routes/skills.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"61741cca7fb482ddcc0184323e96130c8bfa7dfba52a9cfe547f52706614aa73"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: domain/native-resume-probe.ts: FileTooLong \u2014 717 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 217 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":"packages/daemon/src/domain/native-resume-probe.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb6fcb83663dc000b3b3693cf623cf67afbe410368738640c89302dbea583dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/server.ts: FileTooLong \u2014 711 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 211 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/daemon/src/server.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8afb1f8e7910833725c9cbec7fea45989a293f5f6265208ec774a03defe6216f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CodexRuntimeAdapter.verifyResumeLaunch: MethodTooLong \u2014 verifyResumeLaunch runs 142 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":1890}}}],"partialFingerprints":{"codehealthFindingId/v1":"d564d110868f81cf93ea9adb780213ea6295525767fbc1278eb64260d0204bf4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WhoamiService.resolve: MethodTooLong \u2014 resolve runs 142 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\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/daemon/src/domain/whoami-service.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"d86eb72559edfbbf6a72ddcfef93be886213f7df9e117abdb904d6fee9de40dd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: slack/inbound.ts: 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/daemon/src/domain/gateway/slack/inbound.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d13947badba05fff9b8e605eb5e4e1790e57730d266590d4cbc504f68bce034"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/hydrate.ts: FileTooLong \u2014 708 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 208 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/tui/src/hydrate.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70ca1e0c502e7351153955319d963cb7cbf533cc607400447b1f8848a10eb68c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: adopt.adoptCommand: FunctionTooLong \u2014 adoptCommand runs 141 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\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/commands/adopt.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d39377f074d26001a49072517e762487431c7c8efb684905bbafa0e9942e78c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: scope.buildMissionCreateCommand: FunctionTooLong \u2014 buildMissionCreateCommand runs 140 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\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/commands/scope.ts"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"61743c5cdf9a387e508c85eb42909bffaf4cbf1a16af2ceefb117fa87feefa3a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: domain/bootstrap-orchestrator.ts: FileTooLong \u2014 699 significant lines (blank, comment-only and punctuation-only lines excluded), about 89% of them inside a single declaration: BootstrapOrchestrator (112-1015). The bar is 500 significant lines; this is 199 over it, 1.40\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/daemon/src/domain/bootstrap-orchestrator.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a147c87c8e51cd03041ed2e7d22ac7ebdf66df2e5e9b9a78b2b9d1037acb9f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: domain/seat-attention-reconciler.ts: FileTooLong \u2014 698 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 198 over it, 1.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/daemon/src/domain/seat-attention-reconciler.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"648a3753f13f6828961a3505be7cbdf9933483b9bd43e28abccf09816fcc95f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: acp.acpCommand: FunctionTooLong \u2014 acpCommand runs 139 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\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/commands/acp.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"a04a8bf78087648708c10ea6cc65b5a71e3333c49729dab5ed321d9eddca93cb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: health.healthCommand: FunctionTooLong \u2014 healthCommand runs 139 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\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/commands/health.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7775561690e1487607d4aa90504d26795aa3cffb3ded193965c666e2394b11"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: operator-delivery-engine.makeOperatorDeliveryEngine: FunctionTooLong \u2014 makeOperatorDeliveryEngine runs 139 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\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/daemon/src/domain/gateway/operator-delivery-engine.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8cbb06f2e2af9e3dadcf3759ce65d2c2303ecf933b6e8117d06bf26865f0082"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: domain/native-process-lineage.ts: FileTooLong \u2014 693 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 193 over it, 1.39\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/daemon/src/domain/native-process-lineage.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e2d8786af43b094e7ebb62f476d5136ba044187c4a0e9d3aeb1f0a147fec93"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: LaunchRecoveryModal.LaunchRecoveryModal: FunctionTooLong \u2014 LaunchRecoveryModal runs 138 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 38 over it, 1.38\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/ui/src/components/LaunchRecoveryModal.tsx"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbaf0ea6a90814041bfc2c6dc0f28f5b4d994ac10476af14923054cb19902a1b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: TerminalPreviewPopover.TerminalPreviewPopover: FunctionTooLong \u2014 TerminalPreviewPopover runs 138 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 38 over it, 1.38\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/ui/src/components/topology/TerminalPreviewPopover.tsx"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e199f5c59efa955bea00c84670bcd7938341dd0e57c55ce6d43988bae7379b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/setup.ts: FileTooLong \u2014 685 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 185 over it, 1.37\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/commands/setup.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"575c492ee5bbd245f4669a359588dd854c6e6940dc19f9369093ae14d3314504"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClaimService.reconcileSession: MethodTooLong \u2014 reconcileSession runs 137 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\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/daemon/src/domain/claim-service.ts"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"626cafef1a45d4ae0526860c69ee674142f90ee7c3561f534191ffafb2f0aa97"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: finite-telemetry.readTelemetryPage: FunctionTooLong \u2014 readTelemetryPage runs 137 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\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/daemon/src/domain/finite-telemetry.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfdbe5acdd02097c6e408a43a64ee3f4ba8aee08c93d609c0128b2e77875f3b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: SnapshotPanel.SnapshotPanel: FunctionTooLong \u2014 SnapshotPanel runs 137 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\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/ui/src/components/SnapshotPanel.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7cc17e15f33a3f4151fa7e1f4beb05f0886b34b7caae03fc0a2a5dd65342184"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: settings-browser.settingsBrowser: FunctionTooLong \u2014 settingsBrowser 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/daemon/src/domain/user-settings/settings-browser.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6030c625dc230dae6be5d0667eb474152741a9b8bdaee1b351bdc439e0938e8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ViewProjector.runBuiltIn: MethodTooLong \u2014 runBuiltIn 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/daemon/src/domain/view-projector.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd492577fb48e0151282b5c287eff6df53e7d39a15e8feed7aff754e08b973bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: demo-data.demoSnapshot: FunctionTooLong \u2014 demoSnapshot 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/tui/src/demo-data.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"044f75bca7f4b0957f6720f96d30ed31670a45e9049db5f418c11ab2fad7643c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: review/gather.ts: FileTooLong \u2014 679 significant lines (blank, comment-only and punctuation-only lines excluded), about 88% of them inside a single declaration: ReviewGatherer (126-995). The bar is 500 significant lines; this is 179 over it, 1.36\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/daemon/src/domain/review/gather.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9f735fcb865b33386231b06e33d3fad054629869750d5f217910310c56eab9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: domain/seat-runtime-switch-service.ts: FileTooLong \u2014 676 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 176 over it, 1.35\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/daemon/src/domain/seat-runtime-switch-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e68996c9f3320f75d4fa5f007f999361de856ee9acef4af6dbb55c39b6a8a08"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: compact.compactCommand: FunctionTooLong \u2014 compactCommand runs 135 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\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/commands/compact.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bdd1f3505b661c1666aecd5f769138dfdec7025004da5975f17bc5508b74721"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: LibraryReview.AgentImageReviewBody: FunctionTooLong \u2014 AgentImageReviewBody runs 135 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\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/ui/src/components/LibraryReview.tsx"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ce4ac74235ad630b8ed3dbdc9f159218007610d0fc997d77bb0dd3c1e9eb44"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: connector.runAcpAssignment: FunctionTooLong \u2014 runAcpAssignment runs 134 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\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/acp/connector.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"3476b4c6155f9e9427bb0dad885d6db0204a3a5be8d75fcf1717bd9a802b72de"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rigspec-schema.validateMember: FunctionTooLong \u2014 validateMember runs 134 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4d6cbb67787afe5831097c338c6b68f2406ff36f606b716b5047f63c9f1fee"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: hybrid-layout.layoutHybridRig: FunctionTooLong \u2014 layoutHybridRig runs 134 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\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/ui/src/lib/hybrid-layout.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a06dc81e5599faac23af937cd07aca275cda24911e68ff01423d2f6a430d067"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OutboxHandler: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\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/daemon/src/domain/outbox-handler.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af635500d09eba293b8d68e5d0ed6445a0747252cfca512360bb5aa965d1a1c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SliceIndexer: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\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/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"265e7a1638c01ee4b2a19291c0a9424868cb16e44a77d3c2074898b4ab190618"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: restore.restoreCommand: FunctionTooLong \u2014 restoreCommand runs 133 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\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/commands/restore.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f1292362c8a090d29a9e37e0880516f7faadc5f0a5b149a713fc04b3d78ecd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: manifest-parser.parseAtoms: FunctionTooLong \u2014 parseAtoms runs 133 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\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/daemon/src/domain/context-packs/manifest-parser.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f28b6ec2ce5969267584e8325243d291657b98497eecfd254106fc209409c4d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RigLifecycleService.removeNodeWithin: MethodTooLong \u2014 removeNodeWithin runs 133 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\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/daemon/src/domain/rig-lifecycle-service.ts"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"a321547a185498a095c13f25b71638cbd17b987c1446cb657b700897013dd952"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: execution/execution-model.ts: FileTooLong \u2014 664 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 164 over it, 1.33\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/tui/src/execution/execution-model.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a36becfbbb2dc6e16960af8f0a6bca10186bb66c5209c179d2cf9aacbb83b9a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/gateway.ts: FileTooLong \u2014 662 significant lines (blank, comment-only and punctuation-only lines excluded), about 80% of them inside a single declaration: gatewayCommand (166-803). The bar is 500 significant lines; this is 162 over it, 1.32\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/cli/src/commands/gateway.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20bb51c8dfed540365260f894e0b9b058424dab74297f952297e516047f9aafc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PassiveCeremonySource.read: MethodTooLong \u2014 read 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/daemon/src/domain/health-passive-ceremony.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"b38c7f006284a650ab967e06034b4a917f050c3acbb9b24b999f95c50149f0f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: domain/watchdog-policy-engine.ts: FileTooLong \u2014 657 significant lines (blank, comment-only and punctuation-only lines excluded), about 69% of them inside a single declaration: WatchdogPolicyEngine (280-900). The bar is 500 significant lines; this is 157 over it, 1.31\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/daemon/src/domain/watchdog-policy-engine.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d450ae7ab8ab4fb05283bbeb1cf8390805eeb90a22eebd43c9312ec6a45d97c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/provider.ts: FileTooLong \u2014 655 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: providerCommand (61-855). The bar is 500 significant lines; this is 155 over it, 1.31\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/cli/src/commands/provider.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"561e8d7e85f943bf0d04a412b8debb9a04ad7ad82825fef7a797b184923e417c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: restore-check.restoreCheckCommand: FunctionTooLong \u2014 restoreCheckCommand runs 131 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\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/commands/restore-check.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c67e8e256bb88c7e05337654d93f494340c3b8a4d4ad0ddb9bacac24476a22"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runner-conformance/check-runner.mjs: FileTooLong \u2014 651 significant lines (blank, comment-only and punctuation-only lines excluded), about 64% of them inside a single declaration: cases (275-805). The bar is 500 significant lines; this is 151 over it, 1.30\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":"docs/reference/runner-conformance/check-runner.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7546989a1567cae64a5f24a79b28e117bc3b4151d7f217aeef3ffbc0d8012d31"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RestoreOrchestrator: TooManyMethods \u2014 39 methods. The bar is 30 methods; this is 9 over it, 1.30\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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c724a7405e9c8fcf4e54c9f10c9c46a7fcd1f94084663ddff5d48cb07ae630"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: whoami.whoamiCommand: FunctionTooLong \u2014 whoamiCommand runs 130 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\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/commands/whoami.ts"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5eba44a1fb5fc9e9bb803f694486d6f47971de726eb324cd5252b42d6d4ac7f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: SubscriptionToggleList.SubscriptionToggleList: FunctionTooLong \u2014 SubscriptionToggleList runs 130 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\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/ui/src/components/for-you/SubscriptionToggleList.tsx"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"48acbc47e1b443f8cdc579e541285bad482d1b4123eee9ff246be6c986effd08"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: domain/session-registry.ts: FileTooLong \u2014 649 significant lines (blank, comment-only and punctuation-only lines excluded), about 72% of them inside a single declaration: SessionRegistry (207-968). The bar is 500 significant lines; this is 149 over it, 1.30\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/daemon/src/domain/session-registry.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c806b83c6edc897902a166eb268f7fb32a23ea6cf97c0b3e118bdd5a510cb14c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: for-you/FeedCardQuestionAsk.tsx: FileTooLong \u2014 647 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 147 over it, 1.29\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/ui/src/components/for-you/FeedCardQuestionAsk.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba6a56ef7551de733342ba0a86cd60e0fef66aaa641a5a79d525e3787e1f5b0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ClaimService: ClassTooLong \u2014 517 significant lines (blank, comment-only and punctuation-only lines excluded), 15 methods. The bar is 400 significant lines; this is 117 over it, 1.29\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/daemon/src/domain/claim-service.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94e5ff665fb3b30087ccaa842e8fab5b6e90919384697869e34d42848dbb33c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mcp-http.startMcpHttpServer: FunctionTooLong \u2014 startMcpHttpServer runs 129 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\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/mcp-http.ts"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a567b13a36c066f19478e42e2a88f006fa847e964f232b1954fbb1878ab3755"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: routes/sessions.ts: FileTooLong \u2014 640 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 140 over it, 1.28\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/daemon/src/routes/sessions.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e70fca7832cb7ccb4b47be38da87b4374b2835d698f025d5fe9dcc920c06d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: workflow-keepalive.makeWorkflowKeepalivePolicy: FunctionTooLong \u2014 makeWorkflowKeepalivePolicy runs 128 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\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/daemon/src/domain/policies/workflow-keepalive.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5182645df3536c7419be2f962d210d7853ed68a52579c39d9fe6a47259acfc5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: live.createLiveRefresh: FunctionTooLong \u2014 createLiveRefresh runs 128 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\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/tui/src/live.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"e609f57f8b424d4c5da1a306f4a33d46b25168d38dc1d764bde22bfe7814e7d6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: usage.usageCommand: FunctionTooLong \u2014 usageCommand 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/cli/src/commands/usage.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e5e33b9d8b048a7fde4a2dd6e399636d3d7884d9b96e9e6f15c735b936dc09"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ContextPackLibraryService.composeFromFiles: MethodTooLong \u2014 composeFromFiles 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/daemon/src/domain/context-packs/context-pack-library-service.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"38d5bd2affeafcf69020404c00123b0af367a1f80094e9e70412575bd4fc6856"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CodexInPlaceRestart: ClassTooLong \u2014 504 significant lines (blank, comment-only and punctuation-only lines excluded), 22 methods. The bar is 400 significant lines; this is 104 over it, 1.26\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/daemon/src/domain/seat-restart-in-place.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"18684a504d0a91b017e96a65f25f26b3bd6c53efb5f7c0eca271f24c429e4586"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mission-control/mission-control-write-contract.ts: FileTooLong \u2014 630 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 130 over it, 1.26\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/daemon/src/domain/mission-control/mission-control-write-contract.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"958b08b4c47f651b5b43fa15cb2f7e9e3b81900816f439b6e65abf96c4403cb9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: context-usage-threshold.makeContextUsageThresholdPolicy: FunctionTooLong \u2014 makeContextUsageThresholdPolicy 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":"packages/daemon/src/domain/policies/context-usage-threshold.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"599b28f9612bcb751f384beca5672354486354f41f1044a552b2f4491e731fb5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ScopeApproveService.approve: MethodTooLong \u2014 approve 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":"packages/daemon/src/domain/scope/scope-approve.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe33a4cef9a52606bc8b99ca22c591abd7085277fa293a63326e5df7d9780d6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: index.startServer: FunctionTooLong \u2014 startServer 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":"packages/daemon/src/index.ts"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f1abd4786bc983f87f3bc4c261d07a2e8e4602dd1c96591bd46f04ec9f302e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/up.ts: FileTooLong \u2014 628 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 128 over it, 1.26\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/commands/up.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b54d86506d8e7c3fe2f6bb3a4494c378f8518e84fe925e6b53b6d3b958c875d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: auth.authCommand: FunctionTooLong \u2014 authCommand runs 125 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\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/commands/auth.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"de26540481ddd5805cac740b8f4b19806b752e90bc9e87075667092c4b05a820"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rig-mode.rigModeRoutes: FunctionTooLong \u2014 rigModeRoutes runs 125 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\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/daemon/src/routes/rig-mode.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"d60d74f5c1dbaf2da457e281a981a9e90019d9d0a2a588f3d59b997b39e2e962"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: render.instanceContentLines: FunctionTooLong \u2014 instanceContentLines runs 125 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\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/tui/src/render.ts"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"d91aa7415d4d0d962ed691888a777afaeb1c046205de2b8e249e1f3c588f2a04"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: relay-outbound.createRelayOutboundTransport: FunctionTooLong \u2014 createRelayOutboundTransport runs 124 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\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/daemon/src/domain/gateway/relay-outbound.ts"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"563a46d31a0d47dcb877ec903e0b242a38046442faf7e4e81519ce48b61b0b5a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: workflow-keepalive.makeWorkflowKeepalivePolicy.evaluate: FunctionTooLong \u2014 makeWorkflowKeepalivePolicy.evaluate runs 124 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\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/daemon/src/domain/policies/workflow-keepalive.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a50568b570554cd4db0ebf72c301038fc53d9442d928cc17c62805378cb014e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RigTeardownOrchestrator.teardown: MethodTooLong \u2014 teardown runs 124 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\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/daemon/src/domain/rig-teardown.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5ebebc8a9c9bae127b84da65eb13171d94a22147d9342453196568d73487f2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SeatActivityService: TooManyMethods \u2014 37 methods. The bar is 30 methods; this is 7 over it, 1.23\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/daemon/src/domain/seat-activity-service.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"623cb38bb4a9b3e1863f4072c2804d21e37ff17282c02dc204dc0a900b1d426d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RigLifecycleService.releaseRig: MethodTooLong \u2014 releaseRig runs 123 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\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/daemon/src/domain/rig-lifecycle-service.ts"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e23727f21cb92bed4d701c422347a6197e46d6ab6ea2ff6ce0e0ccd216f6ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: relay-inbound.createRelayInboundHandler.ackOutbox: FunctionTooLong \u2014 createRelayInboundHandler.ackOutbox runs 122 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\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/daemon/src/domain/gateway/relay-inbound.ts"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f755483780be4dc85ccf2bde87241ce3a1c150e222d1e9690caab704e78fc9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: workflow-guidance.readWorkflowGuidance: FunctionTooLong \u2014 readWorkflowGuidance runs 122 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\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/daemon/src/domain/workflow-guidance.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"5197793f188762e7c5096d565668a479d10f7d55f7ebf60f55fc67776431e501"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: StoryGraph.StoryGraph: FunctionTooLong \u2014 StoryGraph runs 122 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\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/ui/src/components/project/StoryGraph.tsx"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"658f02648ee961ce0950636c781fb55ada80f81ecc94030e611796909d4508bd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: domain/queue-transition-log.ts: FileTooLong \u2014 606 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 106 over it, 1.21\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/daemon/src/domain/queue-transition-log.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"923105392dca24ad85928dfa3e8d43ab00f4ee56d996ceab5e1832f54ee00ef9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: domain/claim-service.ts: FileTooLong \u2014 605 significant lines (blank, comment-only and punctuation-only lines excluded), about 85% of them inside a single declaration: ClaimService (145-905). The bar is 500 significant lines; this is 105 over it, 1.21\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/daemon/src/domain/claim-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb05156988d1c82b58fd2ae91064413db2353cd6470df39afffa880045b04194"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: domain/watchdog-jobs-repository.ts: FileTooLong \u2014 605 significant lines (blank, comment-only and punctuation-only lines excluded), about 76% of them inside a single declaration: WatchdogJobsRepository (191-864). The bar is 500 significant lines; this is 105 over it, 1.21\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/daemon/src/domain/watchdog-jobs-repository.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8bff7c4460d9291b244f48e9647df7fd7d2c53629f104e19d51994a2eca6fd7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: agent-manifest.validateAgentSpec: FunctionTooLong \u2014 validateAgentSpec runs 121 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\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/daemon/src/domain/agent-manifest.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a9d00ab120f17ef2a484f8573ba218797ccfde4575fdc43befffb220903ae97"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: context-usage-threshold.makeContextUsageThresholdPolicy.evaluate: FunctionTooLong \u2014 makeContextUsageThresholdPolicy.evaluate runs 121 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\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/daemon/src/domain/policies/context-usage-threshold.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"f121b929daf9f78baedf72da504581c350f7954a17cad07442bf5691f20f6f34"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: QueueRepository.handoffWithin: MethodTooLong \u2014 handoffWithin runs 121 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":2791}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fac5198c36643b4185c123b0c24376c1f05513260f518154d0f6b7a1421ee78"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: LaunchCmuxButton.LaunchCmuxButton: FunctionTooLong \u2014 LaunchCmuxButton runs 121 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\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/ui/src/components/topology/LaunchCmuxButton.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"efdfa897343983425ddae07762ae353a2ed80cf9ca1f8c300b999c2d29a9e9b8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: routes/rigs.ts: FileTooLong \u2014 603 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 103 over it, 1.21\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/daemon/src/routes/rigs.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1232c53ef555cc1f12a65615201ac05d8f6132cc194f0d48d58d4bfc6cbeee47"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: domain/current-work.ts: FileTooLong \u2014 600 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 100 over it, 1.20\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/daemon/src/domain/current-work.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9886bc9d08050f875008cc9dbbf8f2de024d79014960f86a5c6cc17c171417c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: host.doctorLegs: FunctionTooLong \u2014 doctorLegs runs 120 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\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/commands/host.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"000b15b283d2cb4c889d7d932a69177702a7606c1af0197d5c4ffd62725a8352"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: slices.slicesRoutes: FunctionTooLong \u2014 slicesRoutes runs 120 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\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/daemon/src/routes/slices.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58e9a7c4ab036244cac55d55c94b2ef512a81ccf3b79eeb7b9d0ce8fab47aed"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AskService.ask: MethodTooLong \u2014 ask 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/daemon/src/domain/ask-service.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcbdba5928ae039dbba65016201e2bddf57619bb6b319bfd7389366cbe1c4814"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RigInstantiator.instantiate: MethodTooLong \u2014 instantiate 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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4749419790be014af0897e6035d0146b34f24da29bccfde64741266e194852d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SeatHandoverService.finalizeWithDiscovered: MethodTooLong \u2014 finalizeWithDiscovered 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/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d20c7db1f56627adda614e6c213b8cd55f857b23a6b8131af490fd40ae6cc45"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: compaction.compactionRoutes: FunctionTooLong \u2014 compactionRoutes 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/daemon/src/routes/compaction.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1bf04e2220461b870f5b83b3cdd5226eae512bdcb7b74c272d57e61768f270"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: QueueRepository.handoffAndComplete: MethodTooLong \u2014 handoffAndComplete runs 118 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 18 over it, 1.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":"packages/daemon/src/domain/queue-repository.ts"},"region":{"startLine":2979}}}],"partialFingerprints":{"codehealthFindingId/v1":"294fed59e574630d18a6492346884ca9851c08f27c9a58f2e29be680d1fa9849"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: chat.chatRoutes: FunctionTooLong \u2014 chatRoutes runs 118 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 18 over it, 1.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":"packages/daemon/src/routes/chat.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"73bf9f3a9e78ea97fd9e59e9af6637dd7596aae29525d1d53598f3c5f067e4ef"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/main.ts: FileTooLong \u2014 589 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: run (55-818). The bar is 500 significant lines; this is 89 over it, 1.18\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/tui/src/main.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2dc6daf5c350a21f42f226c0109f9ece17489c31cd055bc5811c5f92a695d1f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SessionRegistry: ClassTooLong \u2014 470 significant lines (blank, comment-only and punctuation-only lines excluded), 47 methods. The bar is 400 significant lines; this is 70 over it, 1.18\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/daemon/src/domain/session-registry.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"563db7d27fd743208e5464e8dca496f74d0d93342c330f36cd2d409b801b7138"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/state.ts: FileTooLong \u2014 586 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 86 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":"packages/tui/src/state.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"272e286278204031d0e95d4cf6f3bfcf18e6e12bc985e4cfe1f47b9341b4679e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: manifest-parser.parseAgentImageManifest: FunctionTooLong \u2014 parseAgentImageManifest 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":"packages/daemon/src/domain/agent-images/manifest-parser.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d86720623ec8a8850a4babc3c292736cdb373bdc3d831bf157fa7a26624b0d66"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: permission-account.planPermissionAccount: FunctionTooLong \u2014 planPermissionAccount 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":"packages/daemon/src/domain/permission-account.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"252df218fab106d2710129e2d817a6e2eb6637b0fbf5d30083c64843faf3527f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RestoreCheckService: 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/daemon/src/domain/restore-check-service.ts"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce24276c093cd701d3c3de69bad48ca8c198fa4598dbc12de435080fedad6a30"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SeatDeliveryGuard: 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/daemon/src/domain/seat-delivery-guard.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1349ceeee11b660daf36209594d1c5091218ab5d2a9c6620aa6eb1294932962"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: capture.captureCommand: FunctionTooLong \u2014 captureCommand runs 116 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\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/commands/capture.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"943bdffe931cb969ed86774edc2a1ef644a7adf76ddfcb1330ae0a03568d67b7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: OutboxHandler: ClassTooLong \u2014 462 significant lines (blank, comment-only and punctuation-only lines excluded), 40 methods. The bar is 400 significant lines; this is 62 over it, 1.16\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/daemon/src/domain/outbox-handler.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2dfc06b75d1b4821f46c3fe0f24b9d9e5e29cf17896d11e2cd37f29e6d73ede"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WatchdogJobsRepository: ClassTooLong \u2014 462 significant lines (blank, comment-only and punctuation-only lines excluded), 28 methods. The bar is 400 significant lines; this is 62 over it, 1.16\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/daemon/src/domain/watchdog-jobs-repository.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e448cefca066f3351a18eb572034d35b22f7fd84f1d130976e6bde2d585fd5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: scope.buildSliceCreateCommand: FunctionTooLong \u2014 buildSliceCreateCommand 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":"packages/cli/src/commands/scope.ts"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"9533059c553e661d17fa70a58b33c03cfd198cd9dc001c7abe9b13b84a1ee77f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: status.statusCommand: FunctionTooLong \u2014 statusCommand 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":"packages/cli/src/commands/status.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"d082558868d9606c91d19aab9afb9f809e08520d23df25bfb32645e53d706f5e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: node-inventory.buildInventoryItem: FunctionTooLong \u2014 buildInventoryItem 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":"packages/daemon/src/domain/node-inventory.ts"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aaf9adc8d93e05357c3c4fef996bd8788f0a7183dc10110410cbba5e8871afa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SnapshotCapture.captureSnapshot: MethodTooLong \u2014 captureSnapshot 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":"packages/daemon/src/domain/snapshot-capture.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e0ef3bdf7a1e059b9b8580f9ef98713848ac88bd962eb6174cc9639ef7a7b8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: components/LibraryReview.tsx: FileTooLong \u2014 574 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 74 over it, 1.15\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/ui/src/components/LibraryReview.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc0f42f76fc125a8c67779d1c14a71220744a5ac4f8b2775ee7f49439c171ebf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: scopes.scopesRoutes: FunctionTooLong \u2014 scopesRoutes runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\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/daemon/src/routes/scopes.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"4471fd8799937262b4778da45e349f61c5a7db60c24411c8343db736464e840f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: PackageDetail.PackageDetail: FunctionTooLong \u2014 PackageDetail runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\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/ui/src/components/PackageDetail.tsx"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"488b663c0a6efcd0f559bb3469e401347c296b6d2e970b2150b70d0506014332"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: for-you/FeedCard.tsx: FileTooLong \u2014 568 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 68 over it, 1.14\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/ui/src/components/for-you/FeedCard.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e390d6ec065c3572f469067d70120aac301a3c48b29e48c6568d03f301e423"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WatchdogPolicyEngine: ClassTooLong \u2014 452 significant lines (blank, comment-only and punctuation-only lines excluded), 11 methods. The bar is 400 significant lines; this is 52 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/daemon/src/domain/watchdog-policy-engine.ts"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d0644bddf7b9cf0775a06db8aece19287191fea5c83acdecb5bfb345013e8d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: seat.printHuman: FunctionTooLong \u2014 printHuman runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\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/commands/seat.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb82bd1026f2e48fda54e41187361fa41e6a5a6da58dff470e8856e69f35b56f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CodexRuntimeAdapter.ensureCodexCorePlugin: MethodTooLong \u2014 ensureCodexCorePlugin runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4126c35c49b0892ff7f6d288dd6500f17564a545961d0e4245f9f6681ba60b5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: components/LiveNodeDetails.tsx: FileTooLong \u2014 564 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 64 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":"packages/ui/src/components/LiveNodeDetails.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fdc697b7bcc6d38165eb3aff429d3f513aaaa2af85b01483815ad5eb2338904"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: SliceReviewTab.SliceReviewTab: FunctionTooLong \u2014 SliceReviewTab runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\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/ui/src/components/review/SliceReviewTab.tsx"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3de7e882cfbb6460feee6c0f35e419d55185bc1cb52e43f7f51c2b4fb3bb84"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bundle-check.checkBundleFolder: FunctionTooLong \u2014 checkBundleFolder runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\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/lib/bundle-check.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b8e9a498ec245ad4ae89b697dd1fcdd6503972aa697ae7dfdb33ad141a3eca7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: relay-config.evaluateRelayCandidate: FunctionTooLong \u2014 evaluateRelayCandidate runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\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/daemon/src/domain/gateway/relay-config.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"44314bdf0ac110aab82bafa4962950615994d04656b3e1f4299832317e8b9d22"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: graph-projection.projectRigToGraph: FunctionTooLong \u2014 projectRigToGraph runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\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/daemon/src/domain/graph-projection.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f2e7d584b47b41e115d7b52d82cb24936751e72831ced43be2a650d6aac2d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: compose.composeSliceReview: FunctionTooLong \u2014 composeSliceReview runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\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/daemon/src/domain/review/compose.ts"},"region":{"startLine":1114}}}],"partialFingerprints":{"codehealthFindingId/v1":"84edec1f6718d955e898d191cfc1fb4777ea2c2db688de73c6f899d65d63d587"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SeatHandoverService: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\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/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d92199666382f4b20180b177161e3696eb81ab20e1d9046a21cf1fa94e6d98a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClaudeCodeAdapter.verifyResumeLaunch: MethodTooLong \u2014 verifyResumeLaunch runs 110 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb196d4c90b6b8451be240d7c0828491c8370bf0ed379f2cd629bb38804fde7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rig-cmux.rigCmuxRoutes.post(\u0022/launch\u0022): FunctionTooLong \u2014 rigCmuxRoutes.post(\u0022/launch\u0022) runs 110 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\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/daemon/src/routes/rig-cmux.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef1937d791b926ec8d5022c33eb16ca503e91986763c9ae529215b082ae4ccae"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: domain/outbox-handler.ts: FileTooLong \u2014 549 significant lines (blank, comment-only and punctuation-only lines excluded), about 84% of them inside a single declaration: OutboxHandler (147-824). The bar is 500 significant lines; this is 49 over it, 1.10\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/daemon/src/domain/outbox-handler.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ab813082ae5e6785d0b884b465efc7dca77f5ac1d63a3289e4c9870a1360a5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: routes/seat.ts: 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":"packages/daemon/src/routes/seat.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be112e27fb12b7ef0403656aca5f88bd453d91e549278f9554c564f18f0f24d2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: slices/slice-detail-projector.ts: FileTooLong \u2014 546 significant lines (blank, comment-only and punctuation-only lines excluded), about 76% of them inside a single declaration: SliceDetailProjector (217-886). The bar is 500 significant lines; this is 46 over it, 1.09\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/daemon/src/domain/slices/slice-detail-projector.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d29bce78bca85051cfb49e6a723c938ad80c8afc21a5b08f1e4e48f164414e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: env.envCommand: FunctionTooLong \u2014 envCommand runs 109 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\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/commands/env.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"3219350e08050e100638291c6bb60fcc971d4bb7430a63ab91cf361540dca39a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: package-manifest.validateManifest: FunctionTooLong \u2014 validateManifest runs 109 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\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/daemon/src/domain/package-manifest.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e59d2a1f9da3a60236a5fed7545dcc5b1d19b206d84b774451e767c62fe7cb3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rig-mode-validator.validateRecord: FunctionTooLong \u2014 validateRecord runs 109 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\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/daemon/src/domain/rig-mode/rig-mode-validator.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d8875862278639b309319b8bd5ebbc573934322e9ccce1e0090e05430beefb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scope/scope-fs.ts: FileTooLong \u2014 544 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 44 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":"packages/cli/src/lib/scope/scope-fs.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ed871983d1c7c5913250011b4813249d1c99202629493d12f7519feafb3dc8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lab/VellumBackgroundLab.tsx: FileTooLong \u2014 540 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 40 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":"packages/ui/src/components/lab/VellumBackgroundLab.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f8eec83048ed687d0de714fee4771497e155dd2955cc5db37d8107a075fd4d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: open-asks.postOpenAsks: FunctionTooLong \u2014 postOpenAsks runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\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/daemon/src/domain/gateway/slack/open-asks.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"8506f8fb4a5e9e627e06f45e7cd3cc343b596ad71ab496f8f20d04fa68b04c72"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RestoreCheckService.check: MethodTooLong \u2014 check runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\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/daemon/src/domain/restore-check-service.ts"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1f2d6dca3c19e3fe85581a759fa032fe372ba19b6fe95cee0f9d62dc57e4262"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: LibraryReview.LibraryWorkflowReviewPage: FunctionTooLong \u2014 LibraryWorkflowReviewPage runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\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/ui/src/components/LibraryReview.tsx"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03223043e732bd64cd8741007cf37f10e09e36f9dff47bc8fdc8bbff57219c3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: add.addMemberCommand: FunctionTooLong \u2014 addMemberCommand 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/cli/src/commands/add.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b11e8756ce212bb8f657aae5bc27a285be5a099de4ae6b8e9cc07636a55798"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClaudeCompactionEnforcer.drainPendingStage: MethodTooLong \u2014 drainPendingStage 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"2069daf64f3e374d480070b818f85ea68a0d4f16442fcf189f9de1effe352997"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PodBundleAssembler.assemble: MethodTooLong \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/daemon/src/domain/pod-bundle-assembler.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"8379bc176192275a648174d170f2f02e0cc5b8cd6fc0ef9db15bc3ae5ca022e4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RigSpecExporter.exportPodAware: MethodTooLong \u2014 exportPodAware 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/daemon/src/domain/rigspec-exporter.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdfe808311a86746e3406e0806bd5c1da12e1fe16043426aeadcdf843ea312a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: SeatOverviewTable.SeatOverviewTable: FunctionTooLong \u2014 SeatOverviewTable 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/ui/src/components/SeatOverviewTable.tsx"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"190b828a15666516f5405463f5d983e1730022c25191de83166f361dd36e3858"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: execution-view.readLifecycleExecutions: FunctionTooLong \u2014 readLifecycleExecutions runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\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/daemon/src/domain/execution-view.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38a727197c9d24a5179bce90527139751d1b4f3d9936f176828fcefb73d77d9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: slack-delivery.subsystemSlackDeliver: FunctionTooLong \u2014 subsystemSlackDeliver runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\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/daemon/src/domain/gateway/slack/slack-delivery.ts"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2043cfc0ed31f2d96ab926c4e6f977be89e73354b5251f097777d60b8b4cbee"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WorkflowRuntime.resumeFailureOccurrence: MethodTooLong \u2014 resumeFailureOccurrence runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\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/daemon/src/domain/workflow-runtime.ts"},"region":{"startLine":1395}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c0112fc6411636b8e71b3461302fce15dc51883d683e040f4b778324cf22664"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: domain/agent-activity-store.ts: FileTooLong \u2014 527 significant lines (blank, comment-only and punctuation-only lines excluded), about 64% of them inside a single declaration: AgentActivityStore (89-584). 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":"packages/daemon/src/domain/agent-activity-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef4a0454b3d63ebd7786383d0a28f32092e87c33298acf9fdc8c2a52ea01ff3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: routes/hosts.ts: FileTooLong \u2014 526 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 26 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/routes/hosts.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"985ee85c4346558e3cb869e45b3969872e21ab1700d93dd8a8c75cc3165fd84f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bootstrap.bootstrapCommand: FunctionTooLong \u2014 bootstrapCommand runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\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/commands/bootstrap.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d34727e5baf44e58c85f2129210a37c6d5908d4247b919d9fc6ac68b6545c0e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: reconstruction-reader.readReconstruction: FunctionTooLong \u2014 readReconstruction runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\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/lib/reconstruction-reader.ts"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e857b5a10b1e8e06f05b410b834240fb393eece76c5f15229ff70b16f56cca"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClaudeResumeAdapter.resume: MethodTooLong \u2014 resume runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\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/daemon/src/adapters/claude-resume.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a63e1d92813027b3d0106cbcc7be0e04a59ceea8b844ce8c93a77f753c33de"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SeatLifecycleService.readStartupContext: MethodTooLong \u2014 readStartupContext runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":2187}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c7e08e47007470eb7c6c29dff018547f8f66844fc6f3cc8091475ebd98d571"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: render.agentDetailLines: FunctionTooLong \u2014 agentDetailLines runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\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/tui/src/render.ts"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"913f3c42c7129d3720ba641b19c772a0dede18b75df0ee5f853c300039449056"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: state.computeExplorerRows: FunctionTooLong \u2014 computeExplorerRows runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\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/tui/src/state.ts"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"685406fa6ff32415200df1281928646a916e54ea71246d6bdad0f5793d593eaa"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: HookBridge: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/hook-bridge.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3f836dd10d7f362a80ac6395826afdc54e342042b10f8b4a7933150cab88d43"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ReviewGatherer: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/review/gather.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e53100835f09d60019068016b77f8cfc9a813e11b7d803e706d313d09d2b30f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SliceDetailProjector: ClassTooLong \u2014 413 significant lines (blank, comment-only and punctuation-only lines excluded), 14 methods. The bar is 400 significant lines; this is 13 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/slices/slice-detail-projector.ts"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c9efe402005f440e27e5ed4902257c5a27334b615ea9db52268d475ab4923c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: routes/startup.ts: FileTooLong \u2014 516 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 16 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/routes/startup.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c5a40000a8cb4003780e37eba2a5a4b98394475ebc8c62e8b7e2b57b0c4c92"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: domain/bundle-types.ts: FileTooLong \u2014 515 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 15 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/bundle-types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a195452aa6752aa72bf0741e3ba89ae984dc3ef1fddb2b79107be2211771eec8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: operator-delivery-engine.makeOperatorDeliveryEngine.dispatchEscalation: FunctionTooLong \u2014 makeOperatorDeliveryEngine.dispatchEscalation runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\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/daemon/src/domain/gateway/operator-delivery-engine.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"158d82afce64ee95175f4971ad775f6a479c2ca53565a732b604edd601a8862e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RestoreOrchestrator.reconcileNodeRuntimeTruth: MethodTooLong \u2014 reconcileNodeRuntimeTruth runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":2979}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8407e9817e6a7807edcd05c27cfb91c9ecdf565004f7fd6963df102ec458958"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: review.reviewRoutes: FunctionTooLong \u2014 reviewRoutes runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\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/daemon/src/routes/review.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc79527e896df14bd22deb41013724608faf527eb1ff5423d68c4355554a415"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sessions.generationRecord: FunctionTooLong \u2014 generationRecord runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\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/daemon/src/routes/sessions.ts"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca86a6b6502cc11a577d4dac37660acd07c9f77091ab8b4ed81598216dc1273"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: manifest-parser.parseManifest: FunctionTooLong \u2014 parseManifest 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":"packages/daemon/src/domain/context-packs/manifest-parser.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"917754323b2289d661d9ee4f0e71cb719a4c4256004d5a7b5494bb0ad8fbd006"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SeatIdentityReconciler.computeVerdict: MethodTooLong \u2014 computeVerdict 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":"packages/daemon/src/domain/seat-identity-reconciler.ts"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"c49780a9642ff43b630144f24f468c4f7a9e8b2e5ddcfb2b4d79539a4543235b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: settings-store.getDefaultValue: FunctionTooLong \u2014 getDefaultValue 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":"packages/daemon/src/domain/user-settings/settings-store.ts"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e5c1976e714d73f4e63a45f60700f944173e3a5cbf0aa38a61dc7e7e00e9df9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: WorkflowInstancePage.WorkflowInstancePage: FunctionTooLong \u2014 WorkflowInstancePage 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":"packages/ui/src/components/workflow/WorkflowInstancePage.tsx"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"be221111194fd2a152659d0813f4c48445c3551419b209a873a60e4450798643"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: slack/slack-delivery.ts: FileTooLong \u2014 509 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 9 over it, 1.02\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/daemon/src/domain/gateway/slack/slack-delivery.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a3b84866bbec41931343610ca7e7345af9ab40ef4a773e4fffee64782facdf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: scope.buildApproveCommand: FunctionTooLong \u2014 buildApproveCommand 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":"packages/cli/src/commands/scope.ts"},"region":{"startLine":2190}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa462530c8007b68de08ea6360d0a13f50bcaabd7d8ae7361be888a3782f5ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: execution-view.readArrangement: FunctionTooLong \u2014 readArrangement 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":"packages/daemon/src/domain/execution-view.ts"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"919e5b7de1bbedc7591c1284e881e5a181a33e31e6e28e75f63136cda03bfc2c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OperatingPostureService.context: MethodTooLong \u2014 context 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":"packages/daemon/src/domain/rig-mode/operating-posture.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d7eb6803b2a60921cd4e0056cd879374323ea239a11b5b21a396d5fc0c1ab43"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: watchdog-delivery-receipts.withWatchdogReceipts: FunctionTooLong \u2014 withWatchdogReceipts 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":"packages/daemon/src/domain/watchdog-delivery-receipts.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"673714bab3cbd81c3d79d99532f81b1fa275cfe7926febd14beb5ebf97e9f501"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: workflow-reconciliation.compare: FunctionTooLong \u2014 compare 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":"packages/daemon/src/domain/workflow-reconciliation.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"7661f6d6db5495331e8ff070bdd7d70ce1ed104525750bfa676808e7c2e43380"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: FilesWorkspace.FileEditor: FunctionTooLong \u2014 FileEditor 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":"packages/ui/src/components/files/FilesWorkspace.tsx"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"37e2586f3effd50a799bca80806d37566bb3f24b73862e45b6feb33e80d0fc8a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/trace-to-root.py: FileTooLong \u2014 503 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3 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":"packages/daemon/assets/plugins/openrig-core/skills/refocusing/scripts/trace-to-root.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead74deb26c252f587d135284cf9597765bf81c561d239259c8f8c3c64d25485"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/types.ts: FileTooLong \u2014 501 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1 over it, 1.00\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/tui/src/types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe13e8bc428faee234823c65957aa27168f5f0feacee7250bbae268ac30ca888"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): packages/daemon/assets/plugins/openrig-core/skills/openrig-operating-model/scripts/compose.py:463-467 | packages/daemon/assets/plugins/openrig-core/skills/openrig-operating-model/scripts/compose.py:497-501 \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/daemon/assets/plugins/openrig-core/skills/openrig-operating-model/scripts/compose.py"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d95da26bc69dab51109da7c14629c71f49356d4815d18167f6ade769608e6e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: packages/daemon/src/domain/context-packs/profile-composer.ts: 19.0% line coverage (39/205)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/context-packs/profile-composer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f2d88176fdc3a4360a060508a5e40deafd334fe88bdf09f988ab7960c79bfcb"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: packages/daemon/src/domain/context-packs/profile-source-resolver.ts: 36.4% line coverage (60/165)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/context-packs/profile-source-resolver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1005552b45c336a1d71a2cd7322bf7b67809021bb67bf64a5bfac4776e23c853"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: packages/daemon/src/domain/context-packs/seat-recap-store.ts: 25.0% line coverage (59/236)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/context-packs/seat-recap-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de1f4de777de69e7d270847a61098b65f574e8f393be7e44b9029ac66e0ddf47"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: packages/daemon/src/domain/session-name.ts: 35.7% line coverage (81/227)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/session-name.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8fdbf9926e897cd8e52d7aaf7c6630efb8c1b59c85ec4cfefafe75d82bc8c28"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: packages/daemon/src/domain/user-settings/settings-store.ts: 44.2% line coverage (665/1503)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/user-settings/settings-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc543f3e80c741abb4a4e0975004190da1093bdc890657dd8f1fad171536f266"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: packages/daemon/src/routes/context-packs.ts: 26.3% line coverage (180/684)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/routes/context-packs.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ada2c0dec8d862130b22916412a02b52deda018d0b3050b9d3ed0bccc5351d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: packages/test-system/ci/prompt-state.mjs: 42.0% line coverage (95/226)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/test-system/ci/prompt-state.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f986876987d597067d7375ed12455bf2e3c166f9fc06daafa35795ad9c1ca86"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: seat scope at /topology/seat/$rigId/$logicalId \u2014 covered by source-assertion \u002B scope-page direct test: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/test/topology-view-mode.test.tsx"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9f47070efdbe067630c9579cc7856dd53ee6d8f156f1332c0933e28e167a85"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: records restoreMapPath = the per-seat post-compact-extra/\u003Cseat\u003E.md when it EXISTS: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/precompact-hook.test.ts"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf6d14f9fd30180e1dfac645de2cd4c7140f8beec7e679a02ea148315d70f19"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: records restoreMapPath = null when no per-seat extra exists (never an unresolvable pointer): Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/precompact-hook.test.ts"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"099901ffc83425303c19b1a8b56c67cc8e90c239a2f8f01e2c16bce8855403ca"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: up surfaces the real daemon auto-start failure instead of a generic hint: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/test/up.test.ts"},"region":{"startLine":1239}}}],"partialFingerprints":{"codehealthFindingId/v1":"815e0f41759ee80bfb3f992becf45c00c39de34cb3bb9943082c9b711e715951"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: a dropped connection reconnects (connection maintenance, not data polling) and pushes resume: 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/tui/test/live-events.test.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3e30de71b48d4b72e3c84df394489a192de41b71599f90514526ac54cbb7e9"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: content integrity verified after extraction: 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/daemon/test/bundle-archive.test.ts"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"b701b0d64950120a0e4a1ff6ce3fde670f3e4c5b2ceadc236271bd6d3c7f37fb"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: silently exits with no output path argument: 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/daemon/test/claude-context-collector.test.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5234fa897caf5898ef6a0ab65a488232ed6533b7c536aa7a1085e7b139e6af"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: releases the hold when the turn ends with a person\u0027s ask still pending, and withdraws the ask: 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/daemon/test/community-harness-dsh-example.test.ts"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf23952d90dbdd7199821610db82d28f95104798eaad725b8b13d9447e826c9"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: pollOnce with zero eligible sessions does nothing: 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/daemon/test/context-monitor.test.ts"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0ffa40d22eb67566e7793697ff17b1cb1be3b2e5b4eccbd87ac1419f0ecb39"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: start/stop manages interval lifecycle: 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/daemon/test/context-monitor.test.ts"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"336ccb2d53086cf7284a0f43ab4dc0078302e56ac6b9cbed998fdcc76be5a3da"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: shared/agent.yaml skills all resolve to packaged SKILL.md files on disk: 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/daemon/test/kernel-rig-spec-validate.test.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ebee35d9e9b2f3bc7f9c1cafad420cc693625b7c6463219a1784162214e6a5"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: ${label}: profile.uses.skills all resolve in shared resource pool: 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/daemon/test/kernel-rig-spec-validate.test.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"80cbebf0ca01e6b33e97960327e36529279fcd58dc8e6de94bc06e36f4ea202e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: consumes only its preload and leaves Node tools and nested unselected Pi untouched: 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/daemon/test/pi-account-lock.test.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"80562095a9d7cfcb55c2a4bb88ea77233826a3d95099d8ac57007ead6e3e8d08"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: no daemon src file constructs the plugins path via homedir() literal: 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/daemon/test/plugin-discovery-openrig-home-wiring.test.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ade8453bab7026f37a2fcb61fc7c150e7b2e1e500d04dff3620a2f73a594fb"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: routes natural capability discovery to the router before the command reference: 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/daemon/test/router-stub.test.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81f89c690f612594c87f93ae9a3ed8951a81de3247265bbadf529f313c9b44d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: all rig specs have acyclic launch-dependency edges: 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/daemon/test/spec-library-starters.test.ts"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"b152e319b5ccf8818afae5719048596683c44d8f0e548f6f55cf3f2c8b068912"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: AGENT_SPECS \u002B kernel agent.yaml carry no deprecated KEY paths: 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/daemon/test/spec-library-starters.test.ts"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b76a50dc3f56572711640ab43fed777c23a5463e7935b23a47e3a976aa2150"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: AGENT_SPECS \u002B kernel agent.yaml pass validateAgentSpec strict validator: 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/daemon/test/spec-library-starters.test.ts"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e6041071d4d8187635228e39a3ce218163c53a3fef7597916e54771fe45cb72"}},{"ruleId":"D10","level":"error","message":{"text":"No assertions (empty test): preallocates timestamp/64-bit-hex IDs recognized by the existing lint, sort and last-eight consumers: Test method has an empty body \u2014 it asserts nothing and exercises no code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/test/queue-id-compatibility.test.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"199e29f3d10cb7b81abddee7f177d7f7ffc12f42ae7d22d1966733a08805eb04"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: a slow read here holds up no other page: leaving it aborts it, and the next page reads and draws at once: This test starts work it did not wait for (\u0060live\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((r) =\u003E setTimeout(r, 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/tui/test/usage-hosts-journey.test.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5904871b105954d764a460ad991b8541cd1acb35cc1c16e7e3eb20ca5f1c6fa"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: refuses unknown, peer-suffix and malformed names with zero handler effects: This test starts work it did not wait for (\u0060g\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((r) =\u003E setTimeout(r, 10))\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/daemon/test/browser-boundary.test.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"411be511b02982c92ae50883c97d52004328170c9f676ab07ed8df759d96b397"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: accepts the exact discovered self MagicDNS name and its short form only: This test starts work it did not wait for (\u0060g\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((r) =\u003E setTimeout(r, 10))\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/daemon/test/browser-boundary.test.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b8a71ba39159eadc48b4678792f5cd83453ec249d22698c93e566b577b6920d"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: an unrecognized name triggers at most one bounded re-lookup per window, single-flight: This test starts work it did not wait for (\u0060g\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((r) =\u003E setTimeout(r, 10))\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/daemon/test/browser-boundary.test.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"396af158e26864c393b8d4c3fb74630b8bed74182e937f54963b3d4d33751cff"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: a web terminal that opens while a read takes the pin waits its turn, so neither holder is lost (one daemon): This test starts work it did not wait for (\u0060attaching\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((r) =\u003E setTimeout(r, 20))\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/daemon/test/capture-prompt-pane.test.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de32d21876e49a5022afc481eb5461189b87294d7dc33600acc3129ca97db26"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: acks only once its output has been written, and acks nothing when the write fails: This test starts work it did not wait for (\u0060pending\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((r) =\u003E setTimeout(r, 20))\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/daemon/test/claude-hook-bridge-script.test.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cafd4cc44dc0a8b8948c6a9099d141b7925536972f940673c83385449cf7013"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: does not block the daemon\u0027s event loop while Codex starts: This test starts work it did not wait for (\u0060pending\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((resolve) =\u003E setTimeout(resolve, 100))\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/daemon/test/codex-network-default-reader.test.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc26ad6af6e9b98e015e452d044de026b58daca6fbccd00400371fbea7b7277"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: leaves a free-text self-attached seat as it was, before and after a same-named preset appears: This test starts work it did not wait for (\u0060check\u0060, still running when the sleep starts) and then orders itself against it with \u0060sleep(4_000)\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/daemon/test/community-harness-runtime.integration.test.ts"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab97e15789b542d579bc0e1f6c17c8e22b8ed617ca2c31bee23de127680cfc82"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: H3: cancel mid-fleet through the route \u2192 later rigs not_attempted: This test starts work it did not wait for (\u0060app\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((r) =\u003E setTimeout(r, 0))\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/daemon/test/crash-cart-route.test.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb119950bb1108eb9db5a2863313ff46ea2aba002a7c44dbea0c9bb202837d06"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: holds a gated answer until the case releases the gate, having logged the request on arrival: This test starts work it did not wait for (\u0060pending\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((r) =\u003E setTimeout(r, 150))\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/daemon/test/delivery-stand-ins.test.ts"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e74eae5959e860c631c2e75b872cb156aa6cd6d0ab3199f865fafb1aa2f4c7"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: names a gate after the turn\u0027s marker, so releasing one turn leaves another held: This test starts work it did not wait for (\u0060first\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((r) =\u003E setTimeout(r, 150))\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/daemon/test/delivery-stand-ins.test.ts"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a76c67f9b50eae96767e7b47d7706ae2effe5b0668f7b6a30ae5e821505124"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: when its window ends with the gate closed, the cell says so and still takes no input: This test starts work it did not wait for (\u0060cell\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((r) =\u003E setTimeout(r, 2_000))\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/daemon/test/herdr-app-viewer-gate.test.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c735d623ed33c78856e6b3196d7a26ad9431eea3c38b2d3cc966e6fa3c56f8e"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: refuses a poll whose grant was revoked while it waited for the seat\u0027s lease, and claims nothing: This test starts work it did not wait for (\u0060lease\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((r) =\u003E setTimeout(r, 30))\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/daemon/test/hook-bridge-routes.test.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e769634d9c0df1d9f45bb48499664bca1278611e47dcafc7348f262abcaa503"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: refuses a poll whose occupant was replaced while it waited for the seat\u0027s lease, and claims nothing: This test starts work it did not wait for (\u0060lease\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((r) =\u003E setTimeout(r, 30))\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/daemon/test/hook-bridge-routes.test.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"665b1e5c4af98a4837ba493bf9a493f127b1fd658268480b464d395076aa830f"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: still delivers once to a poll whose authority didn\u0027t change while it waited: This test starts work it did not wait for (\u0060lease\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((r) =\u003E setTimeout(r, 30))\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/daemon/test/hook-bridge-routes.test.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"7744e63937332e6dcbfc22275ad45bf1833f7ef4a4adca79f229f97e0f3efcbc"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: a replace whose wait for the installation\u0027s turn uses up its deadline sends no code and changes nothing: This test starts work it did not wait for (\u0060slow\u0060, still running when the sleep starts) and then orders itself against it with \u0060sleep(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/daemon/test/network-installations.test.ts"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"81cd4e9b5614e5e8f03d0a52f6bdef2c6c5dc4ef28d24ca09db4848dfc7c1e68"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: GET /api/events (global) receives package.installed via SSE: This test starts work it did not wait for (\u0060ssePromise\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((r) =\u003E setTimeout(r, 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/daemon/test/packages-routes.test.ts"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99f68fa3eba3b5a556ae8e8416ad787e36e1caec1ad3a771be1333df24d58b4"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: reads off the event loop: a command line that waits holds no timer, and its row comes once it is read: This test starts work it did not wait for (\u0060pending\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((resolve) =\u003E setTimeout(resolve, 100))\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/daemon/test/process-table.test.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"68db701d254c41a58b27ab88431be1f69f684d02f135cc2b3083a2cf66d9f2d7"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: a switch that waited behind another on its home checks the seat again before it changes the login: This test starts work it did not wait for (\u0060a\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((resolve) =\u003E setTimeout(resolve, 0))\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/daemon/test/provider-switch-seat.test.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5f3662100a7970b0c35156dc6e151120cbb98d0ee3f9043ed0884244c5dbbf"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: a switch whose seat moved to another home while it waited touches neither home: This test starts work it did not wait for (\u0060a\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((resolve) =\u003E setTimeout(resolve, 0))\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/daemon/test/provider-switch-seat.test.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd8f95f4a08f2a6b2dc75e2acdf608b293c739eb2ecd7ee475badbaaaa3e60e0"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: two switches on one home run one at a time, so each restart loads the login its receipt names: This test starts work it did not wait for (\u0060first\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((resolve) =\u003E setTimeout(resolve, 20))\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/daemon/test/provider-switch-seat.test.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3b98cadefea36a013e84ec7e507fc98430408420f25dc04b753a6727c6dcad"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: a leg asked for while the same (host, provider) leg runs joins it: This test starts work it did not wait for (\u0060first\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((r) =\u003E setTimeout(r, 10))\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/daemon/test/provider-usage-across-hosts.test.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b2e23d5f78975029f1530dfb226f74ea2c56dc4a39901385a36520f3036e90"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: wakes a waiting read when the answer arrives: This test starts work it did not wait for (\u0060f\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/daemon/test/runner-permission-path.test.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7a79391cfa047a07ad1889f4e1920b066006aec34a2084cac6d746cede5d9b"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: refuses a waiting read whose grant\u0027s occupant is replaced during the wait: This test starts work it did not wait for (\u0060waiting\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/daemon/test/runner-permission-path.test.ts"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"932074b6a6530522f00bc64591e1b7947d00dc733d0cc50209e20453deb4abcd"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: a runner already waiting when the answer is handed to the agent reads the agent\u0027s decision at once, not at its read\u0027s end: This test starts work it did not wait for (\u0060f\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((resolve) =\u003E setTimeout(resolve, 20))\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/daemon/test/runner-permission-path.test.ts"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a7a4c8b10e4c2216ed760880c7dd339cde36fe9c1f538d3365d131b2127bf94"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: activation waits for paste\u002Bsubmit, reconciliation refuses promptly, retained custody survives: This test starts work it did not wait for (\u0060f\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise(r =\u003E setTimeout(r, 0))\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/daemon/test/seat-delivery-guard-correction.test.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9c52681e8280584f6fb85c7c5dd71076ae9e260b420d9a66feac0be39c9d19"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: a group formed at off, then urgent-only before the lease frees (%s): only the urgent one types; the routine one is held on its own: This test starts work it did not wait for (\u0060f\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((r) =\u003E setTimeout(r, 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/daemon/test/seat-interruption-delivery.test.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90b5d2c9dde52f0caecbeaed6e0cd0b327cd1df44db5c67375e3adef7dec278"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: routine, urgent and urgent grouped at off, urgent-only before the lease frees, typed outcomes unconfirmed: This test starts work it did not wait for (\u0060f\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((r) =\u003E setTimeout(r, 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/daemon/test/seat-interruption-delivery.test.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ad864568096129f33a41be4f43860c27e50e8d5c552608795a51d0873079d1"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: an urgent member sent unconfirmed isn\u0027t typed again when the level relaxes before its released members go: This test starts work it did not wait for (\u0060f\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((r) =\u003E setTimeout(r, 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/daemon/test/seat-interruption-delivery.test.ts"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"970dff352ca15fb6da4e4ded283f30475aeab6cd7082cb56bf2faa5bb3e3ab54"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: in-flight captures never exceed one sweep (N) across many ticks with held captures; resumes on release: This test starts work it did not wait for (\u0060s1\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((r) =\u003E setTimeout(r, 2))\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/daemon/test/seat-structural-activity-service.test.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e34279ac3a164e2350ec931b85d12d2427ebfe92d7a1d51a020217dbb062e2c"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: doesn\u0027t let a poll take the next message while the first one\u0027s typed fallback is unfinished, nor a newer send overtake (R2-F5): This test starts work it did not wait for (\u0060sweeping\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((r) =\u003E setTimeout(r, 30))\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/daemon/test/session-transport-hook-bridge.test.ts"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df5ec73a958aa2e08f2f33726edfa426624dceaa3ca778396c69123320d7756"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: doesn\u0027t hand back a wake whose rig\u0027s drain began after the sweep selected it, before the final handback (R7-1): This test starts work it did not wait for (\u0060holding\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((r) =\u003E setTimeout(r, 30))\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/daemon/test/session-transport-hook-bridge.test.ts"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"2728279433cb07464fbd3de55dca2ec430e024b70306d3cffb29a2c3734f43e8"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: doesn\u0027t queue a send whose caller cancelled it while it waited for the seat\u0027s lease (R7-4): This test starts work it did not wait for (\u0060holding\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((r) =\u003E setTimeout(r, 30))\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/daemon/test/session-transport-hook-bridge.test.ts"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ebd0b7227044dc65ca8e4aba32697aefa21a42771aeb1208b1a92b013db7160"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: abandons a socket that never opens and reconnects instead of staying connecting forever: This test starts work it did not wait for (\u0060handle\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((r) =\u003E setTimeout(r, 60))\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/daemon/test/slack-socket-inbound.test.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"2106ec71060fcfbd32f2d57654550d29744bdb71e9c120411f28dde675bfaf84"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: acks every envelope, lands human messages, and retries dead-letters ON CONNECT and PERIODICALLY while connected: This test starts work it did not wait for (\u0060handle\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((r) =\u003E setTimeout(r, 70))\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/daemon/test/slack-socket-inbound.test.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef0c4b80147a190560f0b088d1dc48200aef27e838582a2c07eed192ff2b3977"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: dispose gives the sizing back before the registry can create a new broker: This test starts work it did not wait for (\u0060disposed\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((r) =\u003E setTimeout(r, 20))\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/daemon/test/terminal-session-broker.test.ts"},"region":{"startLine":1163}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a445abc6a0ad1fb66bb52b7321d78450dfb1cf94610ac2930a9cc4472dbe9a"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: a broker disposed while it reads the sizing pins nothing: This test starts work it did not wait for (\u0060attached\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((r) =\u003E setTimeout(r, 20))\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/daemon/test/terminal-session-broker.test.ts"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a4571e1b3f4995c643cbb0c46cbbf3798c37e199ad0b01e0e2b02b7b6bd472e"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: a broker disposed while it records the pin finishes the pin, then gives it back before eviction: This test starts work it did not wait for (\u0060attached\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((r) =\u003E setTimeout(r, 20))\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/daemon/test/terminal-session-broker.test.ts"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9db642c8504f48a75747be3fe1640bf582418a00375289fac0eb7937aabd52"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: a managed %s runner retains its actual run and receiver map across an owned daemon OS crash: This test starts work it did not wait for (\u0060wait\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise(done =\u003E setTimeout(done, 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/daemon/test/tmux-server-isolation-daemon.test.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f70892d45b63bb1d9ea905507f6158fac822b04d9316d04815f669e78bfaeb"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: F1: same-file alias entries CONFLICT under concurrency \u2014 the resolved key is the lock domain: 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((r) =\u003E setTimeout(r, 5))\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/daemon/test/topology-launcher.test.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"050dc6661377112e7d3400e7a4f37f3c8402dda37bb9ac9b394b7fd1542ea192"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: activates after the existing operation, survives restart and keeps same-setting activation idempotent: This test starts work it did not wait for (\u0060f\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise(resolve =\u003E setTimeout(resolve, 0))\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/daemon/test/typing-guard-modes.test.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d5c0895f2921fd52a1eee03d967543c65c1bc4d03b332dc5dd3199f4d3d000"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: unrefs the production timeout handle and cancels that exact handle on close: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/tui/test/live-quiet-refresh.test.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"12976c33454bfd6474dc12b50857f39753eb9b9bab237b1a1a1170c1d4dead5d"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: an in-place provider continuation keeps custom settings, config dir and model: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/claude-resume.test.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"5399e10b3a667f9fe0c3124bb6125dd068363420988512dfa1fde36510446cb0"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: carries the retained executable and wrapper through restore preparation (managed: %s): This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 6 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/claude-resume.test.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ea99c206e44a030fd1b472e34b8624fa2c782a07540894c5d51142404ba4a9"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: the pod-aware managed continuation retains custom options and the current resume marker: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/claude-runtime-adapter.test.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"5875fc83ae327e931de3ef0e385e0b8cb520a886093abd53fc6970e1dab89df0"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: profile-bearing resume uses -p flag after preflight passes: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/codex-resume.test.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f9c6235e3ee39b691afc8e94fb90c9aaae82cc93c48d547fd79d8d86450526e"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: a restore on the plain floor adds the seat\u0027s own folder after the conversation id; a named profile adds none: This test sets up 5 test doubles (for example \u0060vi.fn\u0060) against 2 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/codex-resume.test.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"173578d884acdde47528fb63fc2c51a1ef3e4240d4fd2a4adb7ab7f30816959a"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: a restore on the plain floor adds the git dirs, then the seat folder, after the conversation id; a named profile adds none: This test sets up 6 test doubles (for example \u0060vi.fn\u0060) against 2 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/codex-resume.test.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef06f01f8ccc5252add0035803da31c103def6c6f698db6620adecc85d3694c"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: replaces the posture decision with its flags and adds no network or team grants: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 8 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/codex-resume.test.ts"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bdcf43ce34b0007a8dbe7aacef0acdcedf62eae89485d32b61c61659421161c"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: passes resolved wrapper argv to a capable runner while leaving its command unwrapped: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 5 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/community-harness-runtime.test.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c10d074eb266e0c0fd7cd588d1e49f8e6e7feda0b8118bc3620a8d94c45da65"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: clears an inherited wrapper for a runner with no node wrapper selected: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/community-harness-runtime.test.ts"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d37fe4d80b3346f9874ec3d162953428920ffa6a027e67b35c98b8cc7162f3"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: coalesces overlapping pollOnce calls so one compaction stage is emitted once: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 2 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/context-monitor.test.ts"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a53a14f4fbcb29d7a1bac2360dc474ed5f462f531996cbef3769e043189822"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: watches the nearest existing ancestor of a missing input, filtered to the next path segment: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/proof-source-boundary.test.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"32880e84b86f7e6dea575f3e8575ea342d324afe4d7f18c12983935fd5207a39"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: watches nothing else recursively when the evaluation reads nothing outside the missions root: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/proof-source-boundary.test.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa2f73627e11bc0ad23dd2e6d2c4851651cc1fbf29abd4ae3f0855cafabf293"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: attemptResume forwards effort to claude and codex resume adapters: This test sets up 5 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/restore-orchestrator.test.ts"},"region":{"startLine":1350}}}],"partialFingerprints":{"codehealthFindingId/v1":"96bdcaf60c487c4d392f99727810a386df01bca4ed7c5d2d1c55e38b2602e315"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: attemptResume passes a Codex seat\u0027s envelope to the legacy resume, in place of kernel and team defaults: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/restore-orchestrator.test.ts"},"region":{"startLine":1414}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d3d4df0e4258177e16b4fc82b9699483f64d394f679deb0e87d9efe1889cd3"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: attemptResume forwards the resolved effort to the Pi resume adapter: This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/restore-orchestrator.test.ts"},"region":{"startLine":1427}}}],"partialFingerprints":{"codehealthFindingId/v1":"d39533cf181269353ed6dd0c9e7277993e9fac6580c25cd5345fdfc16e496eeb"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: S11-4: null discovery makes one attempt on every configured tick, with no tick-count or time minimum: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/resume-capture-retry.test.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"1605508f597e2c3e8f689ebda804307d7fcedfbeda9c2e0cd6ec1310bd8690aa"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: shares snapshot observations across Claude seats while retaining two samples per proof: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 2 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/resume-metadata-refresher.test.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"a63248ad990afdb69d8b64a6274eaa53f131b7b20c29bc0dc1b29a8e4d453d8d"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: refreshes missing Codex resume token from the live child process: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/resume-metadata-refresher.test.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28ef50dc361362344f767f7c95eea77abaa5ac1f8e231f7d356a4ef3ab482ce"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: refreshes missing Codex resume token from a nested wrapper -\u003E vendor codex process tree: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/resume-metadata-refresher.test.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e795ce6514828b9adab482e2efe58b45da10166cf679b97675285ff9927fc6"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: refreshes missing Codex resume token from the child process home directory: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/resume-metadata-refresher.test.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"83a892230fbfeae8717e41d3efb5a75e5e2dba5d78ea858459129781092cd8de"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: refreshes missing Codex resume token from the current versioned logs database: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/resume-metadata-refresher.test.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"611c4927fb6c99b3e07736cf8e95b39ee6a98278a8b7f01c604e451f5b8e1927"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: skips sessions that already have a resume token: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/resume-metadata-refresher.test.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"5abddf92980b3ceb65126675ae495973c440e1d6012f4bd966c33fb83adcd058"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: EXCLUSION: the probe/refresh path never applies tmux option defaults: This test sets up 6 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/resume-metadata-refresher.test.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff485603a0d7f2c5d5ebfd5157e3c075b56b44fad2cbaae4333c42b5ac7c8ba3"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: marks a not-resumable Claude token STALE without clearing it (FR-6 \u00A72.1b): This test sets up 5 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/resume-metadata-refresher.test.ts"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bece811615ae07fe3d603d5c44d24adacc0328264a24255aa0aadc900764296"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: stamps a resumable Claude token verified via the validate path (FR-6 \u00A72.1b): This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/resume-metadata-refresher.test.ts"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"62fd264232d3648c5eca566be118f246c4e1ec940714dfa05a0068ae0afac71e"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: FR-4: null-fills a Claude token from the sidecar session_id (scrape): This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/resume-metadata-refresher.test.ts"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9f952a07c8d7abedd52c8ea0d47369ee85d6e8633ad33831dbe7afdf4e2951"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: FR-4: %s: This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 2 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/resume-metadata-refresher.test.ts"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d41595db421ac81a65bde8015f80d64304238140d699b89a83809964fae9b35"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: FR-4: a missing/parse-error sidecar leaves the Claude token null (no write, no throw): This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/resume-metadata-refresher.test.ts"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed73c6ed6925d1bca0908baac1ac60c3f252d6b8142369269e6b9e462f72b088"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: FR-4: an empty sidecar session_id is not written (honest null): This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/resume-metadata-refresher.test.ts"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"4742b6384c2ae121a25dc78a108e3185fdaf07e997caa0b6ff35b7d2cc41ead2"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: FR-4: a Claude session with a PRESENT token is validated, NOT sidecar-filled: This test sets up 5 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/resume-metadata-refresher.test.ts"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"be02fcb714e157d6ccf90e8f02314244457c6f6a95ee85d44eb5da9fb870f4cc"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: FR-4: no contextUsageStore wired \u2192 Claude null-fill is a silent no-op (back-compat): This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/resume-metadata-refresher.test.ts"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae8d2ec6326e5469cdc9e39a471349274d64480e018e3193781c72cc7f83230f"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: FR-4 rev1: fillNullOnly NEVER clears a present Claude token AND NEVER spawns a resume probe: This test sets up 5 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/resume-metadata-refresher.test.ts"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"198ab21c83920d2f13e871d8a4c2fed602f43ba046556caaacdd609b5260132f"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: FR-4 rev1: fillNullOnly still null-fills a Claude token from the sidecar (lightweight, no probe): This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/resume-metadata-refresher.test.ts"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"d72670e7d7ca4b07d442df73dd2bd5b337329baa771e5e8bb0e392448bca35a7"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: FR-4 rev1: fillNullOnly still null-fills a Codex token via captureCodexThreadId (lightweight pid-log read): This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/resume-metadata-refresher.test.ts"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c1d322281ac37ba0b202c054923c9952b63ae22b6d914558660d584e2e70b4"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: Codex present \u002B equal derive \u2192 re-stamps freshness via markResumeProbeResult(\u0027resumable\u0027), no clobber: This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/resume-metadata-refresher.test.ts"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"411b1cb8a96da88dabc5ed9d6be3b521131e0dcaa970bedffae1d47d5e4aa6da"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: Codex present \u002B DIFFERENT derive \u2192 no re-stamp, no clobber (left honest): This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/resume-metadata-refresher.test.ts"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7bc96620737ec42c16cc6fa4128cb00d7be9e6694cc3acfac3b14e5328f600c"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: Codex present \u002B ABSENT derive (no pane pid) \u2192 no-op: This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/resume-metadata-refresher.test.ts"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"41921deca4524abe4a27b137642e84c34493d4d6b60c3d9bbe2cca24f0c8df8e"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: Claude present \u002B equal sidecar derive \u2192 re-stamps freshness, NO probe, no clobber: This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/resume-metadata-refresher.test.ts"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"724e81a2c610743b4bae3366d19581ef440c1357fc45c65f2bff6494b45839fe"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: Claude present \u002B equal sidecar derive: %s: This test sets up 5 test doubles (for example \u0060vi.fn\u0060) against 2 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/resume-metadata-refresher.test.ts"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c14ad6b9a28e04b502601b44b80b0b99d2bb30dfd75bda1e480c789b63d9668"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: Claude present \u002B DIFFERENT sidecar derive \u2192 no re-stamp, no probe, no clobber: This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/resume-metadata-refresher.test.ts"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"298f16ce9ffe9db99f9281ab1d5d671da879845f08174faca14e73e8981b4c97"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: Claude present \u002B sidecar unreadable (parse-error/not ok) \u2192 no-op, no probe: This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/resume-metadata-refresher.test.ts"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"7380018f1a64132a33facf8f8b2644d040b6c0b821398ae03c0df46c36f16da8"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: the fallback resume probe looks in the seat\u0027s own Claude config dir, and a seat without one is probed as before: This test sets up 5 test doubles (for example \u0060vi.fn\u0060) against 2 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/resume-metadata-refresher.test.ts"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e92050b2ca376b6b34c52eeb8e46dc949d5b4c9bd0f352e7a59478ba00a7100"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: does not inspect or print a bundle header for %s: This test sets up 4 test doubles (for example \u0060vi.spyOn\u0060) against 2 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/test/bundle-behaviour-command.test.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0781e61f544ad653c8fbb4a26e0b2caca70562bb37ec6fed51decd3d8c78283"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: %s builds once and returns one JSON result: This test sets up 3 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 1 real object(s) of its own, and its only verification is 6 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/test/bundle-link-commands.test.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3fe90830c28314ce8980ef8c1d786a624125eff1d0998ff91f99082584e5f72"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: reports unknown install outcome, retains the path, and never retries: This test sets up 3 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 2 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/test/bundle-link-commands.test.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02788506f29a7a3671e284018999ebef31fd3541e07c81caaccde94d1e97c3a"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: send without --host does NOT call the cross-host executor (registry loader untouched, executor untouched): This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/test/cross-host-commands.test.ts"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"98879b38b718ffbb26cdab3b3f36870e830e2762ef8619df7bf87151616bfd83"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: continues startup when the recorded process is definitely dead: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/test/daemon-lifecycle.test.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c258a4a524723295e72db1abc56141426ad16e49329cfb00fbc1c83f65191c"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: stop: reads pid, sends SIGTERM, removes daemon.json: This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/test/daemon-lifecycle.test.ts"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"6272be480d3fb50299ceb76e311ebc66ce67f7292e81448090f586d74f62495b"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: stop: unhealthy rig daemon -\u003E sends SIGTERM: This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/test/daemon-lifecycle.test.ts"},"region":{"startLine":1288}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e9c31670373eb038144a655d73f838783858a3dae8a1c46cfea10dd5057f54"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: executeDestroy does not enumerate or kill tmux sessions for --state: This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/test/destroy.test.ts"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b626a604db355ef678d4b4960a9be96f14ed801f2ecc2ee6217fb9b6db1355"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: sends the explicit cleanup selection with generation %s: This test sets up 12 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/test/environment-effect.test.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb199eb6b61a6b90a6fa896bb03e5f19602de9a9c046b5f35067d2dd5a0ffa1"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: default TUI opening refuses before spawning its child: This test sets up 4 test doubles (for example \u0060vi.spyOn\u0060) against 1 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/test/local-owner-direct.test.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"349b056f6a99b9ff37fd5721cd0079e0a871be7049a18744734cf291a9ab5f13"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: ps cleanup opt-out=%s preserves ordinary housekeeping by default: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 2 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/test/ps.test.ts"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"821a07f9b6dcc9b292d6a1248d6d51d1e9b997f73c50b1a6a9104945c9d660a1"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: joins the existing terminal instead of launching another TUI: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/test/shared-tui.test.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8bec4522b7ed2c43c8bb1b297bc956b369d3a39d9b444748667b4ecc98cdbbb"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: packages/daemon/test/list-processes-async.test.ts::B12-T real async list_processes \u2014 codex-runtime-adapter runs the REAL ps path and sees this very process in the table: Passed 1\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"73db9d46ff278b89e07c90dbc46093c1c762a9ee373f3d73e5abb983781e1e79"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: packages/daemon/test/list-processes-async.test.ts::B12-T real async list_processes \u2014 resume-metadata-refresher runs the REAL ps path and sees this very process in the table: Passed 1\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"2a47641051f9a547fecf263701fd6c7d47deb2ab86e1e4d424a317f3ef491715"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: packages/daemon/test/staging-docker-invoker.test.ts::makeRealStagingDocker \u2014 the two-process tar-pipe contract, hermetically (sh stand-ins) DUAL-EXIT: tar fails while docker succeeds \u2192 the step FAILS and names the tar side (the shell-pipeline false-green class): Passed 1\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dc3d61c40fd322dcdb66b44f21859da1488a593e78d10bbca81fbf9fe896c3c5"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: packages/tui/test/socket-concurrency.test.ts::two standalone TUIs stay usable and expose the second control path without replacing the first: Passed 1\u00D7, failed 1\u00D7 across repeated runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/tui/test/socket-concurrency.test.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"8307ed6cd227e8f5aae56df987fb95785188e5aba01caaf9798ddcc25d5bb213"}},{"ruleId":"D12","level":"note","message":{"text":"Deprecated: whatwg-encoding: whatwg-encoding 3.1.1 is resolved in package-lock.json and is marked deprecated by its publisher: \u0022Use @exodus/bytes instead for a more spec-conformant and faster implementation\u0022. This repository does not declare it \u2014 a direct dependency pulls it in, so the move is to upgrade or replace that dependency."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package-lock.json"},"region":{"startLine":7023}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a276e49fe0eaf945a534f0b4adaaa8539f0daaf57cfcac46d9a750024342058"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/startup.ts: packages/daemon/src/startup.ts changed 239 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 269 in startup.createDaemon at line 344. 130 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/startup.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/daemon/src/startup.ts"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dfaf9af696d74498de7ef7ad6d66f885fdf272a0f9de80b53159ef2d55a6e3d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/session-transport.ts: packages/daemon/src/domain/session-transport.ts changed 145 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 267 in SessionTransport.sendUnguarded at line 3444. 117 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/session-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/daemon/src/domain/session-transport.ts"},"region":{"startLine":3444}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a57401215d642c0b1e32c8fabff76d9efa030dad123e0b26b285b7fee250777"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/routes/queue.ts: packages/daemon/src/routes/queue.ts changed 76 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 468 in queue.queueRoutes at line 156. 39 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/routes/queue.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/daemon/src/routes/queue.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1764ed63e8a3a6f9ceef546a9848364032e6b43f2e886b405d9fd68a5f796f6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/mcp-server.ts: packages/cli/src/mcp-server.ts changed 62 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 556 in mcp-server.createMcpServer at line 982. 28 of those changes were fix/bug commits, and the other 34 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/mcp-server.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/mcp-server.ts"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"071ff59dcc2f256f5ac02e2e949b101f0545bfed64d35a24f3cd777bfbc56a7f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/queue-stuck-sweep.ts: packages/daemon/src/domain/queue-stuck-sweep.ts changed 63 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 439 in queue-stuck-sweep.runStuckSweep at line 804. 49 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/queue-stuck-sweep.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/daemon/src/domain/queue-stuck-sweep.ts"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"a699998713d576e0ee2c17fd8b0a2dde6fdf006dabc965a6dd49c5ef12aaac81"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/queue-repository.ts: packages/daemon/src/domain/queue-repository.ts changed 186 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 148 in QueueRepository.updateInTransactionalContext at line 3628. 112 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/queue-repository.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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":3628}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f3b5946d3d9ec9515a11e42291d42162c54f5d043cdf27863e42a887377475"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/restore-orchestrator.ts: packages/daemon/src/domain/restore-orchestrator.ts changed 117 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 220 in RestoreOrchestrator.postLaunchRestore at line 1947. 77 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/restore-orchestrator.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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":1947}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac4c5117af350d7deede559bfb2c434667eaef0f2ab02fd4ecb858e161cbb31a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/seat.ts: packages/cli/src/commands/seat.ts changed 77 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 285 in seat.seatCommand at line 540. 31 of those changes were fix/bug commits, and the other 46 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/seat.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/commands/seat.ts"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb61ff8f13040cd38f8ced353474b33c2bfc3708af3ff5485d835fec838c859c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/startup-orchestrator.ts: packages/daemon/src/domain/startup-orchestrator.ts changed 78 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 268 in StartupOrchestrator.startNodeWithWarnings at line 347. 47 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/startup-orchestrator.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/daemon/src/domain/startup-orchestrator.ts"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaab46ed4340038715e61d28d2d261233458f1bd274244e3af531d55447b97ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/queue.ts: packages/cli/src/commands/queue.ts changed 73 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 265 in queue.queueCommand at line 1299. 41 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/queue.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/commands/queue.ts"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b048657aa2aee773e0ad68ed9b1fddcbb3a2f6319a4dd9800601b3afbef975"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/tui/src/main.ts: packages/tui/src/main.ts changed 53 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 273 in main.run at line 55. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/tui/src/main.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/tui/src/main.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b783160cda723c613aab1b61eb8df99a865ee9e8bc9de455ac4b0e3055afd70"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/tui/src/render.ts: packages/tui/src/render.ts changed 66 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 207 in render.contentLines at line 962. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/tui/src/render.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/tui/src/render.ts"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"5727ba79b1e31c7371d76a48e8b001f3df6cb30f8dbdaffa30549774e4a710db"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/tui/src/hydrate.ts: packages/tui/src/hydrate.ts changed 55 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 230 in hydrate.hydrateSnapshot 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/tui/src/hydrate.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/tui/src/hydrate.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c7888f124ada15c39e0de577b4e7235c3c4102df88f7d5777735c136c453f1f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/queue-wake-ladder.ts: packages/daemon/src/domain/queue-wake-ladder.ts changed 46 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 224 in queue-wake-ladder.advancePromptRefusals at line 1256. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/queue-wake-ladder.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/daemon/src/domain/queue-wake-ladder.ts"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e65d555f7f8fcf33f5bc5a07064c2e1b1415e0f4777897aabdba34d493ac625"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/up.ts: packages/cli/src/commands/up.ts changed 37 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 240 in up.upCommand at line 101. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/up.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/commands/up.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdfeca10643ec7b50c77e802a17fb38fb11203de0804417cc18ebb01a2cfe8ff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/seat-handover-service.ts: packages/daemon/src/domain/seat-handover-service.ts changed 67 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 128 in SeatHandoverService.handover at line 400. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/seat-handover-service.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/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab317bafe229f0ffa9c40f5d4bb236ed75805a23b39f80d032e450f158070d99"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/context.ts: packages/cli/src/commands/context.ts changed 44 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 194 in context.contextCommand at line 241. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/context.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/commands/context.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34edb297fdd0af7dd485c550ad431c311f9ca876ce4c28ad2502501ea0b9593"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/adapters/claude-code-adapter.ts: packages/daemon/src/adapters/claude-code-adapter.ts changed 77 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 108 in ClaudeCodeAdapter.launchHarness at line 325. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/adapters/claude-code-adapter.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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea519a7ab6f94680331faa089c6fe9fdad8b1dd53e39a9ed244548213f5dd5b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/routes/activity.ts: packages/daemon/src/routes/activity.ts changed 50 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 166 in activity.postHook at line 396. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/routes/activity.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/daemon/src/routes/activity.ts"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e5b627d483f0e944a78981a2c98abb83b7495b133cade847ba2e37f138f356"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/rigspec-instantiator.ts: packages/daemon/src/domain/rigspec-instantiator.ts changed 74 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 109 in PodRigInstantiator.launchExistingAgentMember at line 2477. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/rigspec-instantiator.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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":2477}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df1a97e4c4b353940caf1327cccf65eadb22f3750029dfdd13ddfc21705c5c6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/provider.ts: packages/cli/src/commands/provider.ts changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 296 in provider.providerCommand at line 61. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/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/cli/src/commands/provider.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"35062c51ce05e7c350bc7103930bbd14fc0e91e2b9f5b4d4e657376d534c6302"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/execution-view.ts: packages/daemon/src/domain/execution-view.ts changed 38 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 179 in execution-view.buildExecutionView at line 751. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/execution-view.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/daemon/src/domain/execution-view.ts"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7350de66a81de28e82de96a9d490dc54e548abb276d2388aff21544e67ccaf8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/gateway/slack/slack-subsystem.ts: packages/daemon/src/domain/gateway/slack/slack-subsystem.ts changed 65 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 102 in slack-subsystem.buildSlackGatewayWire 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/gateway/slack/slack-subsystem.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/daemon/src/domain/gateway/slack/slack-subsystem.ts"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"76487ea4ead9afd4f5b09aafe2f41c2c61f26fbc55d439c8c22bf9df43988c1b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/adapters/codex-runtime-adapter.ts: packages/daemon/src/adapters/codex-runtime-adapter.ts changed 80 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 69 in CodexRuntimeAdapter.ensureCodexCorePlugin at line 414. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/adapters/codex-runtime-adapter.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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"832886a536cbfa66448be37923b14ea42ac5bb40a1edae17c8fa7cfb2eaa0bea"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/adapters/pi-runner.ts: packages/daemon/src/adapters/pi-runner.ts changed 40 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 133 in RunnerCore.handleEvent at line 1594. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/adapters/pi-runner.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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":1594}}}],"partialFingerprints":{"codehealthFindingId/v1":"b334a89d5190050bae371413cfd5d3b47e934f43854c60988f056f8c0cc4058e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/tui/src/state.ts: packages/tui/src/state.ts changed 36 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 125 in state.reduce 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/tui/src/state.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/tui/src/state.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3da6e59c882565065a40366ca0757ea9c489b7cd16595253111d6c037759866"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/rig-repository.ts: packages/daemon/src/domain/rig-repository.ts changed 44 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 91 in rig-repository.isStoredRigSpec at line 151. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/rig-repository.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/daemon/src/domain/rig-repository.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a981f16a1e9ff6f88d41977de46718fb3c1d192c5cd95ed50b7099e091cd9c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/routes/hosts.ts: packages/daemon/src/routes/hosts.ts changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 195 in hosts.hostsRoutes at line 177. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/routes/hosts.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/daemon/src/routes/hosts.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb92819f31d1a60bdf3fe1dc0dd540952e87d6fd402bc4611b2a57ed4863a112"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/claude-compaction-enforcer.ts: packages/daemon/src/domain/claude-compaction-enforcer.ts changed 46 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 84 in ClaudeCompactionEnforcer.recoverAfterRestart at line 2113. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/claude-compaction-enforcer.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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":2113}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d088b1edf674f0d5afdb8a37b7630c2608bd574558bb839c8475dacd6d0038b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/gateway.ts: packages/cli/src/commands/gateway.ts changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 165 in gateway.gatewayCommand at line 166. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/gateway.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/commands/gateway.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea78703789e80e24987aad1dc2687bca48aec50293aae416faa34a608ecfd657"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/ps.ts: packages/cli/src/commands/ps.ts changed 38 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 99 in ps.psCommand at line 949. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/ps.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/commands/ps.ts"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d910bf366e8791bfa02ba73f0c5e926aa3bc427b05e1ed713b4578fd61bdb7f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/terminal-window.ts: packages/cli/src/terminal-window.ts changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 156 in terminal-window.openTerminalWindow at line 221. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/terminal-window.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/terminal-window.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb01c11e1cfbc2fd4cc739147b2011045b39b60fc8f0f14c412532fc0866ff1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/send.ts: packages/cli/src/commands/send.ts changed 42 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 83 in send.sendCommand at line 239. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/send.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/commands/send.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"e185a0b551626d637eaeb79e110920d3b6c0399f955711322ae9b1be65b9a2e3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/seat-lifecycle-service.ts: packages/daemon/src/domain/seat-lifecycle-service.ts changed 57 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in SeatLifecycleService.launchFresh at line 1638. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/seat-lifecycle-service.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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":1638}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf7c026575506e04a0331f5e0d52a06d6be911ea51ba5054d2e87d9a64d54378"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/adapters/tmux.ts: packages/daemon/src/adapters/tmux.ts changed 90 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in TmuxAdapter.createSessionUnchecked at line 1757. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/adapters/tmux.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/daemon/src/adapters/tmux.ts"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"551bd5e70904e1ce444705bdf31b4f98aeabf6e02af07dd948511f625bab8690"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/slack.ts: packages/cli/src/commands/slack.ts changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 114 in slack.slackCommand at line 188. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/slack.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/commands/slack.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"643348a44c3a5669fdc4649ae87c5506010d041294a2e8574e0c6a649a617c22"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/rigspec-schema.ts: packages/daemon/src/domain/rigspec-schema.ts changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 87 in rigspec-schema.validateMember at line 488. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/rigspec-schema.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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e2212e55e80a3464642ce7a9941d651261c3d95930495b44f3883436ea713e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/server.ts: packages/daemon/src/server.ts changed 53 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in server.createApp at line 493. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/server.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/daemon/src/server.ts"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da759c6743f892f887b27280e6b7df05a1d007f3c87ae1616565942419d65b0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/daemon-lifecycle.ts: packages/cli/src/daemon-lifecycle.ts changed 38 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 73 in daemon-lifecycle.startOwnedDaemon at line 708. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/daemon-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/cli/src/daemon-lifecycle.ts"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"17871b03383ada749aba454b7de4c48fc434963e9a9455e3db1d5892cb7fecd1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/routes/transport.ts: packages/daemon/src/routes/transport.ts changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 109 in transport.transportRoutes at line 30. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/routes/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/daemon/src/routes/transport.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"62098271018fcc2a1ef1309b3cd6a3a701ec6d1d8b85b0e807ad9c62d3ebf748"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/seat-attention-reconciler.ts: packages/daemon/src/domain/seat-attention-reconciler.ts changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 84 in seat-attention-reconciler.rebindAndVerifyPaneIdentity 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/seat-attention-reconciler.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/daemon/src/domain/seat-attention-reconciler.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"6727f282de03808eec5c0382e9e44f1f1473a5854cbfc28d1e763cd56308c906"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/gateway/slack/inbound.ts: packages/daemon/src/domain/gateway/slack/inbound.ts changed 36 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 72 in InboundRouter.attemptLand at line 318. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/gateway/slack/inbound.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/daemon/src/domain/gateway/slack/inbound.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"3236914708dfda4b3cf1aa1005e2cdad697415a6c2b8647c1f53fd07df878bd3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/gateway/slack/slack-delivery.ts: packages/daemon/src/domain/gateway/slack/slack-delivery.ts changed 37 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 70 in slack-delivery.deliverSinglePart.\u003Creturned closure\u003E at line 242. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/gateway/slack/slack-delivery.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/daemon/src/domain/gateway/slack/slack-delivery.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"041bfa2af81ad1dfd229c3919a42081a916d1b780b66e23847c4e2050edb7421"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/adapters/claude-resume.ts: packages/daemon/src/adapters/claude-resume.ts changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 75 in ClaudeResumeAdapter.resume 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/adapters/claude-resume.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/daemon/src/adapters/claude-resume.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a90ff23204e0f39c2b3bfd20f27d4fdc01cfb5a1307b9a58f74b98ed2121aa5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/routes/provider.ts: packages/daemon/src/routes/provider.ts changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 167 in provider.providerRoutes at line 143. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/routes/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/daemon/src/routes/provider.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d828027eec11b3504c570306362813bc2ed68eb427baa6a81a4d3f59cdbf63"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/workflow.ts: packages/cli/src/commands/workflow.ts changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 103 in workflow.workflowCommand at line 163. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/workflow.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/commands/workflow.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"145d3c17618b8f1cb1278142a872f084a3c52c3ca3ceb8cb86748ce1e354af99"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/workflow-projector.ts: packages/daemon/src/domain/workflow-projector.ts changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 102 in WorkflowProjector.projectStep at line 301. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/workflow-projector.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/daemon/src/domain/workflow-projector.ts"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d49a247b0c4d00bf5eaf646bb9a42b83c57e26aa82a1acc95b8722a64c3f93"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/node-inventory.ts: packages/daemon/src/domain/node-inventory.ts changed 49 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in node-inventory.buildRestoreOutcomeMap at line 524. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/node-inventory.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/daemon/src/domain/node-inventory.ts"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b5c77447ed6ad136ffe11040fe7a3a5e72eb74c9752215385ef988404ba13f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/routes/bundles.ts: packages/daemon/src/routes/bundles.ts changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 79 in bundles.bundleRoutes.post(\u0022/create\u0022) at line 728. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/routes/bundles.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/daemon/src/routes/bundles.ts"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"389beecb39bc2c2b1a952d67f69bd8be2faf46d07e1c382f1942e9085d6c8ff2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/setup.ts: packages/cli/src/commands/setup.ts changed 38 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in setup.runSetup at line 456. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/setup.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/commands/setup.ts"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bdfd02804a8efaebaad8152ad797be337d3460db5967e21a30cad897c0be760"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/workflow-runtime.ts: packages/daemon/src/domain/workflow-runtime.ts changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 74 in WorkflowRuntime.instantiate at line 388. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/workflow-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/daemon/src/domain/workflow-runtime.ts"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"207d9cfdd72c57c48fc6d03aa349911a050436b9acc3d25e5440ee10e0460894"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/watchdog-policy-engine.ts: packages/daemon/src/domain/watchdog-policy-engine.ts changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 67 in WatchdogPolicyEngine.evaluate 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/watchdog-policy-engine.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/daemon/src/domain/watchdog-policy-engine.ts"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f156d1eaede254f3524190271e1ce3e6b4b64f3ab55fc5c35fc9f86a078d637"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/host.ts: packages/cli/src/commands/host.ts changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 108 in host.hostCommand 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/host.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/commands/host.ts"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1801c79f579c7bd8302e25716a7cc91980c658a676b70d2a47ed7860ebc2a54"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/seat-runtime-switch-service.ts: packages/daemon/src/domain/seat-runtime-switch-service.ts changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 104 in SeatRuntimeSwitchService.setRuntime at line 200. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/seat-runtime-switch-service.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/daemon/src/domain/seat-runtime-switch-service.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"417ba2fadec71cccff131f17944c94831fe3758165f6f354bb210dba8e46018c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/routes/gateway.ts: packages/daemon/src/routes/gateway.ts changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 108 in gateway.gatewayRoutes at line 54. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/routes/gateway.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/daemon/src/routes/gateway.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7cc95e7f40ffa17dee7caeed01fb5d8ff64ce0977ef72d9fd3aff6a770ebe7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/start.ts: packages/cli/src/commands/start.ts changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 116 in start.startCommand at line 181. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/start.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/commands/start.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a65d67ffe29d160fc2dd737c87e82fb794988d020176bb87d43ec6a547b87e7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/bundle.ts: packages/cli/src/commands/bundle.ts changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 105 in bundle.bundleCommand 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/bundle.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/commands/bundle.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9420d8c70e28b5e36bedaf3d91e78540a6bcf687f5323f9f5c86c1ff8187b62"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/routes/workflow.ts: packages/daemon/src/routes/workflow.ts changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 142 in workflow.workflowRoutes at line 36. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/routes/workflow.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/daemon/src/routes/workflow.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d630da5855dd3262b302d190e69a7636fbdf79d1b2270494ab3aa5dec0cb7d9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/launch.ts: packages/cli/src/commands/launch.ts changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 132 in launch.launchCommand at line 70. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/launch.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/commands/launch.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad2d731a6e98641cfd79356d18a3287f02c59d8810422f394b2958573d1fd3b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/routes/attention.ts: packages/daemon/src/routes/attention.ts changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 164 in attention.attentionRoutes at line 19. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/routes/attention.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/daemon/src/routes/attention.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3d78c5708a1a792ad1a89e6091ab160c6160bcdcbc6d55e92b3ccc8e1bfe9a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/bundle-behaviour.ts: packages/daemon/src/domain/bundle-behaviour.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 218 in bundle-behaviour.describeBundleBehaviour at line 110. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/bundle-behaviour.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/daemon/src/domain/bundle-behaviour.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"843102dec1709fa6de66e562a0d93a935bde8c0530f196d78cc6917930b1a092"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/routes/startup.ts: packages/daemon/src/routes/startup.ts changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 138 in startup.applySelectedHistory at line 382. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/routes/startup.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/daemon/src/routes/startup.ts"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc465b9949bd1a430a79e1edc062512ccd906e535e65f69b02ccec9bc61c7a9e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/routes/context-packs.ts: packages/daemon/src/routes/context-packs.ts changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 128 in context-packs.contextPacksRoutes at line 62. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/routes/context-packs.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/daemon/src/routes/context-packs.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"74428ff52b7656ecd40c13ff53bd3ca4d38554eeadc6f908a45b701e5efc7ace"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/bootstrap-orchestrator.ts: packages/daemon/src/domain/bootstrap-orchestrator.ts changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 72 in BootstrapOrchestrator.executeStages at line 381. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/bootstrap-orchestrator.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/daemon/src/domain/bootstrap-orchestrator.ts"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"de33a87e2e037b933079d799f88cc2c99f22a4b52ee1db79510ee68810062be9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/native-resume-probe.ts: packages/daemon/src/domain/native-resume-probe.ts changed 38 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in native-resume-probe.assessNativeResumeProbe at line 356. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/native-resume-probe.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/daemon/src/domain/native-resume-probe.ts"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d466b0e25d529b4550b381791f2a6cce463eef557a284242eaf424551580bd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/claude-managed-launch.ts: packages/daemon/src/domain/claude-managed-launch.ts changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in ClaudeManagedLaunch.prepare at line 309. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/claude-managed-launch.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/daemon/src/domain/claude-managed-launch.ts"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e7024b78744ec7eca8867b1257d5fcf831548a2727d87ec4b9c3b1979a49ed"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/routes/sessions.ts: packages/daemon/src/routes/sessions.ts changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in sessions.generationRecord at line 816. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/routes/sessions.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/daemon/src/routes/sessions.ts"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"430f80995d32458e1d086793c451be88341859a12b8bd802639ac1de8bf769e2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/policies/parked-owner-consumer.ts: packages/daemon/src/domain/policies/parked-owner-consumer.ts changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 99 in parked-owner-consumer.makeParkedOwnerConsumerPolicy.evaluate at line 202. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/policies/parked-owner-consumer.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/daemon/src/domain/policies/parked-owner-consumer.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaf8c756dc4fa0c87e766de736ff367f66285dfa3277f3580d3b3de2265d981a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/node-launcher.ts: packages/daemon/src/domain/node-launcher.ts changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 63 in NodeLauncher.launchNode at line 159. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/node-launcher.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/daemon/src/domain/node-launcher.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"767920bf4cc2f413d771102b386ef810a89e7ad360717c59f87adb42511a48ec"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/skill-catalog.ts: packages/daemon/src/domain/skill-catalog.ts changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 94 in skill-catalog.reconcileSkillLoadout at line 861. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/skill-catalog.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/daemon/src/domain/skill-catalog.ts"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"3937cd5d22d7da2d4d06414d5467d9533d61fbdb3363ecdc6724e713b1121895"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/config.ts: packages/cli/src/commands/config.ts changed 55 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in config.configCommand at line 55. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/config.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/commands/config.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"34bab39b627873585d169ce790624f65c9015470354eaeb8ff7f28f18696516f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/agent-manifest.ts: packages/daemon/src/domain/agent-manifest.ts changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 103 in agent-manifest.validateAgentSpec at line 151. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/agent-manifest.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/daemon/src/domain/agent-manifest.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f91aec49daeb9f2aed20dc80a70971701a4bd1bcdc69dc8ee7c8e8de006946"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/adapters/codex-resume.ts: packages/daemon/src/adapters/codex-resume.ts changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in CodexResumeAdapter.resume at line 66. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/adapters/codex-resume.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/daemon/src/adapters/codex-resume.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"16642ed65b5310a3c99de970896963ac2e747d975a4d57826793418833d863a9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/scope.ts: packages/cli/src/commands/scope.ts changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in scope.buildSliceCloseCommand at line 567. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/scope.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/commands/scope.ts"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"e99b6cfbb34b2ba53eb20cd1f71c4589289616c90f1b2906e0a7851445eca8b5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/terminal.ts: packages/cli/src/commands/terminal.ts changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in terminal.terminalCommand at line 170. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/terminal.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/commands/terminal.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"5411186777191b71e6cf705097619f9edbd361f2c3b0416e68d9430446bcd122"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/adapters/pi-runtime-adapter.ts: packages/daemon/src/adapters/pi-runtime-adapter.ts changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 67 in PiRuntimeAdapter.launchHarness 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/adapters/pi-runtime-adapter.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/daemon/src/adapters/pi-runtime-adapter.ts"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eec61516cb7fd40b9550dd576147e6542380f2a26d212df1b44f2b769574374"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/seat-restart-in-place.ts: packages/daemon/src/domain/seat-restart-in-place.ts changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 63 in CodexInPlaceRestart.observe at line 419. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/seat-restart-in-place.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/daemon/src/domain/seat-restart-in-place.ts"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"18eff72e27f74edb0847e000d668645310fb20a16724ac38bd78d09323429505"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/native-process-lineage.ts: packages/daemon/src/domain/native-process-lineage.ts changed 44 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in native-process-lineage.claudeArgvIds at line 346. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/native-process-lineage.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/daemon/src/domain/native-process-lineage.ts"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ad92e8ddf6b354e50f968b592c2541ab344eadc39fa89a236f97bd8c7c3189"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/walk.ts: packages/cli/src/commands/walk.ts changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 87 in walk.walkCommand at line 54. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/walk.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/commands/walk.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e35cd5e4cdd8f2ce24b63d5a7917825d7c612eaa0168496fdb6420477fbd5b2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/workflow-spec-cache.ts: packages/daemon/src/domain/workflow-spec-cache.ts changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 117 in workflow-spec-cache.parseWorkflowSpec at line 198. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/workflow-spec-cache.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/daemon/src/domain/workflow-spec-cache.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e35430a744220a21e6b529ce7fb6b8a1e9f196f8a6df649a01503617b7d200"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/routes/rigs.ts: packages/daemon/src/routes/rigs.ts changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in rigs.rigsRoutes.post(\u0022/:id/attach-self\u0022) at line 492. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/routes/rigs.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/daemon/src/routes/rigs.ts"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"d39e62d4f327fafb00b6f95e7156b67d3deb296ece1d902d468176fec2bcf862"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/proof.ts: packages/cli/src/commands/proof.ts changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 103 in proof.proofCommand at line 138. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/proof.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/commands/proof.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f1775d876c9f37a57fa5d4124e99745a8c8a5ff7bbb8f8a94faf7d9fe0d135"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/down.ts: packages/cli/src/commands/down.ts changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in down.downCommand 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/down.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/commands/down.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf03189783677ec597fe83b484c65410ba634812f4513b652431e09ce40350c2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/routes/seat.ts: packages/daemon/src/routes/seat.ts changed 45 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in seat.seatRoutes.post(\u0022/set-runtime/:seatRef\u0022) at line 327. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/routes/seat.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/daemon/src/routes/seat.ts"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a34bf460fcc7e3e40f2007f37db1517f700b16df2bf0fce1af05171e0381016"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/rigspec-exporter.ts: packages/daemon/src/domain/rigspec-exporter.ts changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in RigSpecExporter.exportPodAware 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/rigspec-exporter.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/daemon/src/domain/rigspec-exporter.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae47dc5025a7fb89983482debdf8a2da97bb01c1325f48d64a517b6e4d93e24"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/rig-teardown.ts: packages/daemon/src/domain/rig-teardown.ts changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in RigTeardownOrchestrator.teardown at line 116. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/rig-teardown.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/daemon/src/domain/rig-teardown.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f6d3ec0abb48817217e537811c4681ad456a5eeff2d2c2eee254d697272767"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/tui/src/startup.ts: packages/tui/src/startup.ts changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 68 in StartupController.key 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/tui/src/startup.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/tui/src/startup.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfaec8ae0e3a4d69d5027cf7538992ac653e9825f2c0e2fc7837499edbfd5279"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/seat-activity-service.ts: packages/daemon/src/domain/seat-activity-service.ts changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in SeatActivityService.observeSeat at line 178. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/seat-activity-service.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/daemon/src/domain/seat-activity-service.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ecd2bc1d9cccb23f193ef8d0ff547449a53c26c7c2309a335fb4f712ce00d8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/config-store.ts: packages/cli/src/config-store.ts changed 63 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ConfigStore.reset at line 1743. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/config-store.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/config-store.ts"},"region":{"startLine":1743}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d182fa8e61e7f4e6e3020bcea64d1161afea1104a4c9eb95895f3348e2679c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/seat-launch-environment.ts: packages/daemon/src/domain/seat-launch-environment.ts changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 80 in SeatLaunchEnvironment.command 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/seat-launch-environment.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/daemon/src/domain/seat-launch-environment.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b4b9c181ab8ad512eda5fc9310ad2464c3708315e9c4634c139a751d7569aec"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/seat-identity-reconciler.ts: packages/daemon/src/domain/seat-identity-reconciler.ts changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in SeatIdentityReconciler.reconcileSweep at line 191. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/seat-identity-reconciler.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/daemon/src/domain/seat-identity-reconciler.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"d314b031ae073109aad4106565f06ede48c12187a2f1db0f11f5361743eb3597"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/terminal/herdr-follow-view.ts: packages/daemon/src/domain/terminal/herdr-follow-view.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 133 in HerdrFollowView.apply at line 47. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/terminal/herdr-follow-view.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/daemon/src/domain/terminal/herdr-follow-view.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba1870997daaa4078ad35645034e85d34cbf6e5481f1f6a25b7af5b1ade40938"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/daemon.ts: packages/cli/src/commands/daemon.ts changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in daemon.daemonCommand at line 174. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/daemon.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/commands/daemon.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"522c77dc3e8e0755a0283d3de4fdfc35cab7d5c2b0be633141214c3c1880906e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/mission-control/mission-control-write-contract.ts: packages/daemon/src/domain/mission-control/mission-control-write-contract.ts changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in MissionControlWriteContract.answerAsk at line 601. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/mission-control/mission-control-write-contract.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/daemon/src/domain/mission-control/mission-control-write-contract.ts"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"31448dacd112ac51afd001993df9e704fc7c2be47b6b7b9edab55f8af9af3231"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: docs/reference/community-harness-examples/dsh/openrig-dsh-runner.mjs: docs/reference/community-harness-examples/dsh/openrig-dsh-runner.mjs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 206 in openrig-dsh-runner.main 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- docs/reference/community-harness-examples/dsh/openrig-dsh-runner.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":"docs/reference/community-harness-examples/dsh/openrig-dsh-runner.mjs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe8bfca36fe15221f4f55add75e133771e159a18a7fb6ee178ba07d3e6a5b6c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/profile-resolver.ts: packages/daemon/src/domain/profile-resolver.ts changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in profile-resolver.resolveNodeConfig at line 152. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/profile-resolver.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/daemon/src/domain/profile-resolver.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5fdd10f147cd14474660a9fd4df7a8181440c4afc9ba03911e5477ecb367a5d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/terminal/herdr-adapter.ts: packages/daemon/src/domain/terminal/herdr-adapter.ts changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in HerdrAdapter.openView at line 488. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/terminal/herdr-adapter.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/daemon/src/domain/terminal/herdr-adapter.ts"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec4235cb512030ad98adfa9f98128e0cbcb28f8dd0dd3c338be65885fa578778"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/assets/plugins/openrig-core/hooks/scripts/refocus.cjs: packages/daemon/assets/plugins/openrig-core/hooks/scripts/refocus.cjs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in refocus.renderTrace at line 254. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/assets/plugins/openrig-core/hooks/scripts/refocus.cjs\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/daemon/assets/plugins/openrig-core/hooks/scripts/refocus.cjs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"c480610d28e273f09bae7567f24eacafad607e83435e18a07df474fc7405095f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/tui/src/execution/execution-model.ts: packages/tui/src/execution/execution-model.ts changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in execution-model.sliceDetail at line 650. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/tui/src/execution/execution-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/tui/src/execution/execution-model.ts"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e3e0cc56adda773a6d05d46ba62e4dade72651a7d852408fff04c7501d986e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/user-settings/settings-store.ts: packages/daemon/src/domain/user-settings/settings-store.ts changed 61 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in SettingsStore.reset at line 1528. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/user-settings/settings-store.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/daemon/src/domain/user-settings/settings-store.ts"},"region":{"startLine":1528}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef3946d199307483a93ca57aab57e2a77453f007160fb605396fbcc80231ae5a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/index.ts: packages/daemon/src/index.ts changed 40 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in index.startServer at line 284. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/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/daemon/src/index.ts"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"c902151d16fb916a08c8ccee820a395aae7095ddfed436b0160261ca69ca3153"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/gateway/slack/message.ts: packages/daemon/src/domain/gateway/slack/message.ts changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in message.buildOutboundMessage at line 573. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/gateway/slack/message.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/daemon/src/domain/gateway/slack/message.ts"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"24086cb2b6be671e034dfd7e9892ad9081cc1327d4857c008ec8e8c60815af1c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/successor-session-launcher.ts: packages/daemon/src/domain/successor-session-launcher.ts changed 36 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in SuccessorSessionLauncher.createSuccessor at line 207. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/successor-session-launcher.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/daemon/src/domain/successor-session-launcher.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"d55f09e599c99d9339ca5a255cadcad31818acd5d296c4446efa8c0cf9760dcd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/gateway/human-registry.ts: packages/daemon/src/domain/gateway/human-registry.ts changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in human-registry.validateHumanFragment 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/gateway/human-registry.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/daemon/src/domain/gateway/human-registry.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c88485f875ba3e0bbaf4fd5c8527d208dd31e8943b7b34de8654c2990aebeb2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/rigspec-codec.ts: packages/daemon/src/domain/rigspec-codec.ts changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in RigSpecCodec.serialize 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/rigspec-codec.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/daemon/src/domain/rigspec-codec.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca1a4a117d127ab55d446da580ad70a01d0d3b939de231d40158cf1f3740fa14"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/resume-metadata-refresher.ts: packages/daemon/src/domain/resume-metadata-refresher.ts changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in ResumeMetadataRefresher.refresh at line 150. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/resume-metadata-refresher.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/daemon/src/domain/resume-metadata-refresher.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5de6dc919223c53942946e631549c4ab40334b82e00b5d39c84e188b0b1db91"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/routes/up.ts: packages/daemon/src/routes/up.ts changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in up.upRoutes.post(\u0022/\u0022) at line 197. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/routes/up.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/daemon/src/routes/up.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa635aa6477155767d6727047592aa0b713f0f38d8214591c99f8da28a5ade6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/claim-service.ts: packages/daemon/src/domain/claim-service.ts changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in ClaimService.reconcileSession at line 489. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/claim-service.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/daemon/src/domain/claim-service.ts"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"c506b15bcadad0e6071d8896d71619b1056f677956cf1a9ce4c3d394e8422137"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/rigspec-preflight.ts: packages/daemon/src/domain/rigspec-preflight.ts changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in rigspec-preflight.preflightMembers at line 355. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/rigspec-preflight.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/daemon/src/domain/rigspec-preflight.ts"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c3a7904b5e2957512f4e15e376214751904d7680c1cccab04a85a06c114865"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/tui/src/input.ts: packages/tui/src/input.ts changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in input.parseText 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/tui/src/input.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/tui/src/input.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c4cee7f9bc1c9861a05cb8f11f162cbe121a34c6782a09f5439a7a6305e9a7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/lib/scope/scope-audit.ts: packages/cli/src/lib/scope/scope-audit.ts changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 71 in scope-audit.classifyScopeItem at line 308. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/lib/scope/scope-audit.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/lib/scope/scope-audit.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf42d7f8d8bf7f985f9d55136da59cac6bb25e48bd844a9e8cb18cbe0d7e1d36"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/scope/scope-audit.ts: packages/daemon/src/domain/scope/scope-audit.ts changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 71 in scope-audit.classifyScopeItem at line 308. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/scope/scope-audit.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/daemon/src/domain/scope/scope-audit.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"c986747ad3695c6dd55e35a57709eeb41db648605c38d9f4afc3a5fb92109729"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/skill.ts: packages/cli/src/commands/skill.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 97 in skill.skillCommand 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/skill.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/commands/skill.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b1f329ad8f1734528c182f6ade905caee94dca11161b39c542d953709bbaef"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/routes/compaction.ts: packages/daemon/src/routes/compaction.ts changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in compaction.compactionRoutes at line 24. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/routes/compaction.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/daemon/src/routes/compaction.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fcaece114b60e929b5646ac9019baabbbb7a7186bf2d05cb3f343ae61035199"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/lib/work-install.ts: packages/cli/src/lib/work-install.ts changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in work-install.resolveWorkPosition at line 319. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/lib/work-install.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/lib/work-install.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"123ee67cb4b99e474c37127f8e0e2951a663a9a9e7edf53a888d71c8717e8026"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/context-packs/manifest-parser.ts: packages/daemon/src/domain/context-packs/manifest-parser.ts changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 68 in manifest-parser.parseAtoms at line 218. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/context-packs/manifest-parser.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/daemon/src/domain/context-packs/manifest-parser.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"889976947c665023455f88fd8cc9ad05484dcd597ff46fdf7554b37a9192a60b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/seat-delivery-guard.ts: packages/daemon/src/domain/seat-delivery-guard.ts changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in SeatDeliveryGuard.beforeInput at line 479. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/seat-delivery-guard.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/daemon/src/domain/seat-delivery-guard.ts"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"d792f21fcf3bdffd353ae28976c9ed653bd1fd0f9d54a08696be3373c5fd9185"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/user-settings/settings-browser.ts: packages/daemon/src/domain/user-settings/settings-browser.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 81 in settings-browser.settingsBrowser at line 117. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/user-settings/settings-browser.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/daemon/src/domain/user-settings/settings-browser.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"9879e168d88967f7140dfedd561b76849e0d75126c352fc5987c1531848aedac"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/seat-structural-activity-service.ts: packages/daemon/src/domain/seat-structural-activity-service.ts changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in SeatStructuralActivityService.pollSeat at line 108. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/seat-structural-activity-service.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/daemon/src/domain/seat-structural-activity-service.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f02e9184a17a693d71cd039de7eb061c1a99f216a5d5ba7d2fee8075ea6faad"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/routes/rigspec.ts: packages/daemon/src/routes/rigspec.ts changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in rigspec.rigspecImportRoutes.post(\u0022/\u0022) at line 107. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/routes/rigspec.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/daemon/src/routes/rigspec.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3abf0682d4bff1eb2796f71a25b721c4f1b458f426b0bfaa0117ec6159ae7f3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/routes/agent-images.ts: packages/daemon/src/routes/agent-images.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 95 in agent-images.agentImagesRoutes 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/routes/agent-images.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/daemon/src/routes/agent-images.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb96309a0c117de651841cef1e2baeea306945f7a845009c4d165cc6ac1ab288"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/watchdog-jobs-repository.ts: packages/daemon/src/domain/watchdog-jobs-repository.ts changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in WatchdogJobsRepository.register at line 325. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/watchdog-jobs-repository.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/daemon/src/domain/watchdog-jobs-repository.ts"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"78997f1ecb2b0ec8242130e89643ec6f73a72224ba6ce971df09bdfe13205408"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/terminal/terminal-service.ts: packages/daemon/src/domain/terminal/terminal-service.ts changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in TerminalService.followView at line 222. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/terminal/terminal-service.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/daemon/src/domain/terminal/terminal-service.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b8cef0258aa51dd35a1ac8ff96e7ccb168682a996a648696017fe2b5196d21"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/community-harness-presets.ts: packages/daemon/src/domain/community-harness-presets.ts changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in community-harness-presets.parsePreset 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/community-harness-presets.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/daemon/src/domain/community-harness-presets.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be4a216b036de8d38fcee5d33c754ef981262c33a8ae45d18b9c303da30fdb1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/codex-thread-id.ts: packages/daemon/src/domain/codex-thread-id.ts changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in codex-thread-id.readCodexThreadIdFromLogs 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/codex-thread-id.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/daemon/src/domain/codex-thread-id.ts"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c63ec2527e04a5809da1338f154d47d7f2a321d4dd984fcb90925f58080560"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/adapters/community-harness-runtime-adapter.ts: packages/daemon/src/adapters/community-harness-runtime-adapter.ts changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in CommunityHarnessRuntimeAdapter.launchHarness 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/adapters/community-harness-runtime-adapter.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/daemon/src/adapters/community-harness-runtime-adapter.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48d93ecd6e4755f2fe4a0ad298969f37aca4db9d0ae2236ad4cbc6e22af288c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/chatroom.ts: packages/cli/src/commands/chatroom.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 70 in chatroom.chatroomCommand at line 57. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/chatroom.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/commands/chatroom.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba1178806902c8d0dc16af453a615cbdb20e141b8115e7107a575ed9f97115f5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/routes/projects.ts: packages/daemon/src/routes/projects.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 105 in projects.projectsRoutes 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/routes/projects.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/daemon/src/routes/projects.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"973111addea316599a38751788c88714ae89919c6871d93f5b084a29413d2ec8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/health.ts: packages/cli/src/commands/health.ts changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in health.healthCommand at line 319. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/health.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/commands/health.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"29008937833b704d7691963a4bb40c296a7bf85ff75d4f724090e575c34072a6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/terminal/herdr-viewer.ts: packages/daemon/src/domain/terminal/herdr-viewer.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 66 in HerdrViewer.ensureOnce at line 150. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/terminal/herdr-viewer.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/daemon/src/domain/terminal/herdr-viewer.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a956fe6fb9169655eee8e770aa26ac53dbff0ff3be9c8d18fa5cf18a7ae75a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/queue-erasure.ts: packages/daemon/src/domain/queue-erasure.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 147 in queue-erasure.eraseQueue at line 573. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/queue-erasure.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/daemon/src/domain/queue-erasure.ts"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec495d493644ae894447b9adca65a8742d92d46152f37f0b6b02335f02d152f2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/tui/src/terminals/terminal-model.ts: packages/tui/src/terminals/terminal-model.ts changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in terminal-model.terminalLines 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/tui/src/terminals/terminal-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/tui/src/terminals/terminal-model.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea5d9b825ca13fbff17b1de4a6ca63d1cb916e575c4858b14214cbc8cd0eda04"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/permission-account.ts: packages/daemon/src/domain/permission-account.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 83 in permission-account.planPermissionAccount at line 55. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/permission-account.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/daemon/src/domain/permission-account.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a7ba2f560adbfb91d374d0565cbb358ae02f11b3ce17bcd8c5612c7e2c4473"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/adapters/pi-resume.ts: packages/daemon/src/adapters/pi-resume.ts changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in PiResumeAdapter.resume at line 66. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/adapters/pi-resume.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/daemon/src/adapters/pi-resume.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb89a9a7bae05aafcab36062cdcd4b9082cc025c3b2b0dd57b6dbec1e241758"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/workflow-validator.ts: packages/daemon/src/domain/workflow-validator.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 94 in WorkflowValidator.validate at line 60. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/workflow-validator.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/daemon/src/domain/workflow-validator.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"5acfedb3d30dea5b05cefa7bf33c6fd79914f79b64a79a49d5c86f0b0d869136"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/tui/src/attention/attention-model.ts: packages/tui/src/attention/attention-model.ts changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in attention-model.attentionLines at line 62. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/tui/src/attention/attention-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/tui/src/attention/attention-model.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f8a7d06e4fac144b77d8a65c712e8c71c28c8639b532a654861bf51544e3c5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/health-passive-ceremony.ts: packages/daemon/src/domain/health-passive-ceremony.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 68 in PassiveCeremonySource.read at line 55. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/health-passive-ceremony.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/daemon/src/domain/health-passive-ceremony.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aaf5e14edc9e738b6dd9f6dec248e30f8c3cc37d50eb5248da30cbb4813d09c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/restore-check-service.ts: packages/daemon/src/domain/restore-check-service.ts changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in RestoreCheckService.checkStartupContext at line 1036. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/restore-check-service.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/daemon/src/domain/restore-check-service.ts"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"126b62109ee3c7c6000311ea6a8cd7a6fb40e173f163d4694bcc807e0cc973d9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/health-diagnosis.ts: packages/daemon/src/domain/health-diagnosis.ts changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in HealthDiagnosisService.evaluateOnce at line 106. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/health-diagnosis.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/daemon/src/domain/health-diagnosis.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"d016912a9ac5e5e2c3fb4205aa05103042636d25561a148b49499ac27eb10e92"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/mcp-http.ts: packages/cli/src/mcp-http.ts changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in mcp-http.grantServiceCaller 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/mcp-http.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/mcp-http.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"b65782fb3c564fc953650e61abb8c7383d957124675952329dbc92d7d508d350"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/draft-aware-delivery.ts: packages/daemon/src/domain/draft-aware-delivery.ts changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in DraftAwareDelivery.attempt at line 55. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/draft-aware-delivery.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/daemon/src/domain/draft-aware-delivery.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"5749a3a2c2792579c8ad1908daa5f6dc576bbae07cba79fd241069c9b955bbbb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/routes/mission-control.ts: packages/daemon/src/routes/mission-control.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 87 in mission-control.missionControlRoutes at line 72. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/routes/mission-control.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/daemon/src/routes/mission-control.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd2ad08fae33cc45f97b45754eeef8ab06258bf7a1cbf03d9464dc8a3f8e08f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/proof/judgments.ts: packages/daemon/src/domain/proof/judgments.ts changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in judgments.readSliceReadiness at line 187. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/proof/judgments.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/daemon/src/domain/proof/judgments.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cab85fd0572646f66b714199bb8ea578ab6658c568fdd28e95165f0a80d962c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/mcp.ts: packages/cli/src/commands/mcp.ts changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in mcp.mcpCommand at line 16. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/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/cli/src/commands/mcp.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c86f6a0a4b377f9ee8733d8d60803b410e78779c1a1268512be07f75032910"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/rig-lifecycle-service.ts: packages/daemon/src/domain/rig-lifecycle-service.ts changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in RigLifecycleService.removeNodeWithin at line 482. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/rig-lifecycle-service.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/daemon/src/domain/rig-lifecycle-service.ts"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f48acf289b0b02b6a6590f6d71147b00b4b60e4b8f4bfb1a34485cb211ccd5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/snapshot-capture.ts: packages/daemon/src/domain/snapshot-capture.ts changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in SnapshotCapture.captureSnapshot at line 63. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/snapshot-capture.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/daemon/src/domain/snapshot-capture.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"208914968ee466aa0f5585adab08fd3a2819d653b1372e7c2cc460d2dd24dab0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/rig-mode.ts: packages/cli/src/commands/rig-mode.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 72 in rig-mode.rigModeCommand at line 214. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/rig-mode.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/commands/rig-mode.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b750b76f090239d64c39e13c41344597b6a2d5aac4973fdfb7f54046fb23b2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/_canonical/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs: skills/_canonical/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in migrate-telemetry-state-0.5.9.applyLibrary at line 1055. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- skills/_canonical/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.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/_canonical/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4ea77403715577d135c8e440cbe26224d6e359c493fbc3eebf407216274a36"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/gateway/slack/socket-inbound.ts: packages/daemon/src/domain/gateway/slack/socket-inbound.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 70 in socket-inbound.startSocketInbound at line 127. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/gateway/slack/socket-inbound.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/daemon/src/domain/gateway/slack/socket-inbound.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f38b1e540067a0cd4bcf7326d24f4cd91814727a2e01e26776136b23d563b86"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/snapshot-repository.ts: packages/daemon/src/domain/snapshot-repository.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in snapshot-repository.isRestoreUsableSnapshotData at line 278. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/snapshot-repository.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/daemon/src/domain/snapshot-repository.ts"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be6185a9c2668b8cede1a76f94ddae470947f00871b8265f27effd96e5630f6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/model-divergence/current-generation-record.ts: packages/daemon/src/domain/model-divergence/current-generation-record.ts changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in current-generation-record.resolveIdentityVerifiedClaudeRecord at line 122. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/model-divergence/current-generation-record.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/daemon/src/domain/model-divergence/current-generation-record.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df3f94f9d78cd6ac01d26299176c1681ca42b4c9e71000bcd498cb66f712a7e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/acp/agent-server.ts: packages/cli/src/acp/agent-server.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 75 in agent-server.serveAcpAgent at line 238. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/acp/agent-server.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/acp/agent-server.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e32d99b0e4f463d6f995078a44a1df5fd68534ab5766bd0bae679d978842df2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/watchdog.ts: packages/cli/src/commands/watchdog.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in watchdog.watchdogCommand 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/watchdog.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/commands/watchdog.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc2bf7b6a7a8980eee0f1703abc498e6d24e195ec6c604af836d9b1b5b2e207"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/tui/src/stylize.ts: packages/tui/src/stylize.ts changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in stylize.stylizeLines at line 131. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/tui/src/stylize.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/tui/src/stylize.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa9781731f9e073419d68c083430124d567751b88cd6bba3d3f1fa5fccbfcbcc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/restore-plan-preview.ts: packages/daemon/src/domain/restore-plan-preview.ts changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in restore-plan-preview.buildRestorePlanPreview.nodes at line 340. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/restore-plan-preview.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/daemon/src/domain/restore-plan-preview.ts"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c30ee541c81d9e2891970b4d261e2220c16dca12791c28fb1ff4dac864d4b4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/slices/slice-indexer.ts: packages/daemon/src/domain/slices/slice-indexer.ts changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in SliceIndexer.ensureMembershipIndex at line 1361. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/slices/slice-indexer.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/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":1361}}}],"partialFingerprints":{"codehealthFindingId/v1":"91de65c524faead27a04c2f9f4e43e0268d962a36a22bd69f72c0cb6f86e8d16"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/context-monitor.ts: packages/daemon/src/domain/context-monitor.ts changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in ContextMonitor.normalizeStartupStatus at line 320. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/context-monitor.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/daemon/src/domain/context-monitor.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18cbae4b54880eb9f20c2c3c47a2d5713b4f1f844fa52668c6c30e5354e58f3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/restore-guidance.ts: packages/daemon/src/domain/restore-guidance.ts changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in restore-guidance.restoreMissingGuidance 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/restore-guidance.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/daemon/src/domain/restore-guidance.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"e80d3e2c88eb19c03c8cae6e3dd626171bdf056471c559d39daa70ee4d2386fc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/doctor.ts: packages/cli/src/commands/doctor.ts changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in doctor.runDoctorChecks at line 144. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/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/commands/doctor.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"56cd9b3d22f5fc474a0f6e08cf30fe6e998e8c37bc8e21bf62c406be1b645a0b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/adapters/tmux-control.ts: packages/daemon/src/adapters/tmux-control.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 83 in tmux-control.tmuxControlExec at line 430. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/adapters/tmux-control.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/daemon/src/adapters/tmux-control.ts"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"80942ffd0fa80afd69e43b986198f2f8ef836694c74e070881855e95e7cef540"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/agent-activity-store.ts: packages/daemon/src/domain/agent-activity-store.ts changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in AgentActivityStore.getLatestForNode at line 355. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/agent-activity-store.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/daemon/src/domain/agent-activity-store.ts"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"39e81d9a396c16a0acb89bb41b104cc901c07ec33bdede6c632e8af47478aaac"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/rosters.ts: packages/daemon/src/domain/rosters.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in rosters.parseRoster.members at line 125. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/rosters.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/daemon/src/domain/rosters.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"95cddcf8fb708258db376c2a16cd8a3325645415340cbc46bb0aadc87a5952d1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/export.ts: packages/cli/src/commands/export.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in export.exportCommand 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/export.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/commands/export.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"adaaec7f17a9eec95ed4e80df152d915deabf503ae89914391539cdf81e6fcb7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/routes/scopes.ts: packages/daemon/src/routes/scopes.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in scopes.scopesRoutes at line 53. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/routes/scopes.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/daemon/src/routes/scopes.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ab7cb493e975274a97be23e8fb3f772d341b87bdf127c04b11a60f1404ecfa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/status.ts: packages/cli/src/commands/status.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in status.statusCommand at line 37. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/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/commands/status.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcde581e55d3e1741962ddc68d9bb60fccb5e44cfbe863efec0e8d0fc697e5bb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/ps-projection.ts: packages/daemon/src/domain/ps-projection.ts changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in PsProjectionService.getEntries at line 177. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/ps-projection.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/daemon/src/domain/ps-projection.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a530996493946804d1a01bcfe883ee255ab4409781faa3a8ad73dd2643c7b75"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/project.ts: packages/cli/src/commands/project.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in project.projectCommand 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/project.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/commands/project.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa4137802e1c8c7d4333fe51b91115b352e4795108498468a217084a77099f1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/transcript-rotation.ts: packages/daemon/src/domain/transcript-rotation.ts changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in transcript-rotation.startTranscriptRotation at line 241. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/transcript-rotation.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/daemon/src/domain/transcript-rotation.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b2a91e128a2b3ec4c9db1f572578a2580b6ad516104d046746615d695621ec"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/routes/watchdog.ts: packages/daemon/src/routes/watchdog.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 64 in watchdog.watchdogRoutes at line 31. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/routes/watchdog.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/daemon/src/routes/watchdog.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2b581641f4362f20dc2ca8009104137fc74989b7da1fe1123764a5755f4401"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/gateway/slack/slack-api.ts: packages/daemon/src/domain/gateway/slack/slack-api.ts changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in slack-api.callWebApi at line 93. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/gateway/slack/slack-api.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/daemon/src/domain/gateway/slack/slack-api.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dbd0488f6e8a8dd73c0d5ac41e3561f68d3f93bae682463a36ac9c0d4feefd5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/seat-skill-storage.ts: packages/daemon/src/domain/seat-skill-storage.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in seat-skill-storage.cleanSeatSkills at line 963. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/seat-skill-storage.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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee3f4b9d0c7db86b055cce1a94b71236acc2853e819214a5ec354740b24c9b5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/rig.ts: packages/cli/src/commands/rig.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 75 in rig.rigCommand at line 37. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/rig.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/commands/rig.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0e3bae4bb9908dd09d3ddc2c20079999d64b9397b8ee9e32ee911ca6cd8a60"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/assets/plugins/openrig-core/skills/refocusing/scripts/trace-to-root.py: packages/daemon/assets/plugins/openrig-core/skills/refocusing/scripts/trace-to-root.py changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in trace-to-root.main at line 529. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/assets/plugins/openrig-core/skills/refocusing/scripts/trace-to-root.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/daemon/assets/plugins/openrig-core/skills/refocusing/scripts/trace-to-root.py"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee2fc32bd4227455a267754390d5cde80769092ed73c22caeaf8946b272c6a74"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/routes/terminal.ts: packages/daemon/src/routes/terminal.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in terminal.terminalRoutes at line 90. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/routes/terminal.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/daemon/src/routes/terminal.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff4b43f62036db205dabdab3d404f3375a8800af6070f0e9cb571b0a6a704b17"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/lib/scope/scope-fs.ts: packages/cli/src/lib/scope/scope-fs.ts changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in scope-fs.resolveMissionsRoot at line 313. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/lib/scope/scope-fs.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/lib/scope/scope-fs.ts"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84a5fc0e46b4f4f8812e044a77e2b2caa4bc0c9880a5a2e21df7f8fec8a7f00"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/queue-waiting.ts: packages/daemon/src/domain/queue-waiting.ts changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in queue-waiting.readWaitingView at line 153. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/queue-waiting.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/daemon/src/domain/queue-waiting.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb64f5a509f22152e6d33b201ccdd7f78cd05e3d030c6f80715559fcd069c7c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/spec-library-workflow-scanner.ts: packages/daemon/src/domain/spec-library-workflow-scanner.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in spec-library-workflow-scanner.scanWorkflowSpecFolder at line 428. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/spec-library-workflow-scanner.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/daemon/src/domain/spec-library-workflow-scanner.ts"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4080fcdc4745bb4569b965f7fd753da4bfdcc952ed85fcd0d6149ad73fbf865"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/routes/slices.ts: packages/daemon/src/routes/slices.ts changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in slices.slicesRoutes at line 35. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/routes/slices.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/daemon/src/routes/slices.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb7ccce479bf4a39579d995e6c133e8b76701631425c2b8f48807957b2fb942"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/queue-wake-repository.ts: packages/daemon/src/domain/queue-wake-repository.ts changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in QueueWakeRepository.getStatus at line 100. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/queue-wake-repository.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/daemon/src/domain/queue-wake-repository.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"d053e3c3905c59034d765c2afed0c514f812fc43b44e9049a2620441eaef3a8c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/whoami.ts: packages/cli/src/commands/whoami.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in whoami.whoamiCommand at line 281. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/whoami.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/commands/whoami.ts"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec8025d1c424e2aacd286d31b7453e3f02fb38c9f4dc286dd927fa29d6a99c0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/bundle-behaviour.ts: packages/cli/src/bundle-behaviour.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in bundle-behaviour.formatBundleBehaviour at line 6. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/bundle-behaviour.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/bundle-behaviour.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba7c004f7f1d443663277a6e163a2e5b599dc593eb4035ea966247e168f35dec"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/gateway/operator-delivery-engine.ts: packages/daemon/src/domain/gateway/operator-delivery-engine.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in operator-delivery-engine.makeOperatorDeliveryEngine.dispatchEscalation at line 155. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/gateway/operator-delivery-engine.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/daemon/src/domain/gateway/operator-delivery-engine.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"112e8868eb41f5843def9369592da302136f1917ab8ad7ef52485ac598ba5206"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/import.ts: packages/cli/src/commands/import.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 83 in import.importCommand at line 40. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/import.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/commands/import.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e47ab0dd9236ce369da86ab17d81f074ecb07468f0a962176eb8041d70087b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/restore-preconditions.ts: packages/daemon/src/domain/restore-preconditions.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in restore-preconditions.validatePreRestore at line 12. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/restore-preconditions.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/daemon/src/domain/restore-preconditions.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"48974974134cea5f7982baa4ea970f2b90cd3ce4cbaf88d359524c5fdc8771b8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/health-detectors.ts: packages/daemon/src/domain/health-detectors.ts changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in health-detectors.evaluatePassiveCeremony at line 420. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/health-detectors.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/daemon/src/domain/health-detectors.ts"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aa721c91fe5c9c9fe4df7a41433fd386f7eec5ff2e9c3622faa1a700ec69696"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/routes/stream.ts: packages/daemon/src/routes/stream.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in stream.streamRoutes at line 47. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/routes/stream.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/daemon/src/routes/stream.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b21da94ed8a993039f09f1f90605638620b7cff1cfcada589aacd9f07c75e92"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/project-lifecycle-compiler.ts: packages/daemon/src/domain/project-lifecycle-compiler.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 63 in project-lifecycle-compiler.compileProjectLifecycle 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/project-lifecycle-compiler.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/daemon/src/domain/project-lifecycle-compiler.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2fbc7036a76c76011d9d8a746f89f8ed2756af859ae4cc56008c1f4b1d6332c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/routes/files.ts: packages/daemon/src/routes/files.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in files.filesRoutes at line 52. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/routes/files.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/daemon/src/routes/files.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"012dd16e135efeb8a04248f66fdd4dd66c1e6edf7d78eaa4e61154fa8e998621"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/lib/bundle-check.ts: packages/cli/src/lib/bundle-check.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 76 in bundle-check.checkBundleFolder at line 32. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/lib/bundle-check.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/lib/bundle-check.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fad1fed441c71a36f241f207b66829d735b2fb2a3ea38f0f9bb1609191d504f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/routes/proof.ts: packages/daemon/src/routes/proof.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 75 in proof.proofRoutes at line 18. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/routes/proof.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/daemon/src/routes/proof.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f2c779541f1946616ca0b835df0d26fbcebb442c31d761028ba57d0f25763d7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/specs.ts: packages/cli/src/commands/specs.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in specs.specsCommand 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/specs.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/commands/specs.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"2971410e0dd1e784a013c0410109f14d86e27a39400b2f8d512b6f147a10f506"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/policy.ts: packages/cli/src/commands/policy.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in policy.registerPermissionCommands at line 182. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/policy.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/commands/policy.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a422a594d4289357562ad00b33c9a9f121c91130d20b8424076020b0e8a4d6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/policies/delivery-digest-flush.ts: packages/daemon/src/domain/policies/delivery-digest-flush.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in delivery-digest-flush.runDeliveryDigestFlush at line 52. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/policies/delivery-digest-flush.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/daemon/src/domain/policies/delivery-digest-flush.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa6bf81dc440d74c267f7a2660b40cd205114b6d1931cf5f6f8bcf659c5b314"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/ask.ts: packages/cli/src/commands/ask.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in ask.askCommand at line 127. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/ask.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/commands/ask.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"00be6208cfde33de334846c58093e947ca25cbb0f129e4c96607a84573a6439f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/assets/plugins/openrig-core/hooks/scripts/activity-relay.cjs: packages/daemon/assets/plugins/openrig-core/hooks/scripts/activity-relay.cjs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in activity-relay.buildOpenRigPayload at line 83. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/assets/plugins/openrig-core/hooks/scripts/activity-relay.cjs\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/daemon/assets/plugins/openrig-core/hooks/scripts/activity-relay.cjs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"f74c711eaac4b641a9ab74af8b066b1c7cdd0de402508eab1f8d888e9ea833a3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/native-permission-store.ts: packages/daemon/src/domain/native-permission-store.ts changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in NativePermissionStore.resolve at line 231. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/native-permission-store.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/daemon/src/domain/native-permission-store.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"435881bdda2db08c4c96f40aa3ab85efcce7be686fa2d4eb8d6032f03155c2e3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/startup-submission-evidence.ts: packages/daemon/src/domain/startup-submission-evidence.ts changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in startup-submission-evidence.composerRegion at line 35. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/startup-submission-evidence.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/daemon/src/domain/startup-submission-evidence.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cef9a14162328fc4a039c46deb6072f6953823bbb2a3b892d6c470b02f7eb87"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/slices/slice-detail-projector.ts: packages/daemon/src/domain/slices/slice-detail-projector.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in SliceDetailProjector.buildAcceptance at line 492. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/slices/slice-detail-projector.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/daemon/src/domain/slices/slice-detail-projector.ts"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"2645cc1afb50e9c82558e384c9e5664bfa28ca990b2b6cd602f077d12ea9cf7a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/adapters/pi-runner-protocol.ts: packages/daemon/src/adapters/pi-runner-protocol.ts changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in pi-runner-protocol.buildPiRunnerCommand at line 321. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/adapters/pi-runner-protocol.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/daemon/src/adapters/pi-runner-protocol.ts"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"880bc235e2584a748ac69be3b973f48672ee703b18af152833c77d18fef6889c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/tui/src/scopes/scopes-model.ts: packages/tui/src/scopes/scopes-model.ts changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in scopes-model.proofEvidence at line 207. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/tui/src/scopes/scopes-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/tui/src/scopes/scopes-model.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"755b95295adc5433391cabdd75dbf9f2576854a2384d467c295c1535e141b710"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/routes/restore-check.ts: packages/daemon/src/routes/restore-check.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in restore-check.getStartupContext at line 52. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/routes/restore-check.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/daemon/src/routes/restore-check.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"920cde602e13120702b985e1ed7000a4b0ddf46faf8ad9f55d5f2a279a8273f2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/host-registry.ts: packages/cli/src/host-registry.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in host-registry.validateHostRegistry at line 165. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/host-registry.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/host-registry.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b6edf6a5afb378fd51b875da338c79575559ba3d6d5f7542545b43b3646c048"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/gateway/connections-projection.ts: packages/daemon/src/domain/gateway/connections-projection.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in connections-projection.connectionsProjection at line 55. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/gateway/connections-projection.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/daemon/src/domain/gateway/connections-projection.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"742773c068a4c04d9a95407a223988f3c0c357cd31451e383a5b647dde8550e2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/stream.ts: packages/cli/src/commands/stream.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in stream.streamCommand 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/stream.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/commands/stream.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb3316c882120aa27622bb0d8319a60c858c51f287a42231f00f5e51cace5d2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/bundle-types.ts: packages/daemon/src/domain/bundle-types.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in bundle-types.validateLegacyBundleManifest at line 635. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/bundle-types.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/daemon/src/domain/bundle-types.ts"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"be391a766738e931c2835558191b5aa84b1ee57c127ac83118299225d48c0b47"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/routes/chat.ts: packages/daemon/src/routes/chat.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in chat.chatRoutes at line 16. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/routes/chat.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/daemon/src/routes/chat.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"2658541a543f88b2108795a9301afb038eb950429ef01fa7c6dca89e39199a09"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/rehydrate-eligibility.ts: packages/daemon/src/domain/rehydrate-eligibility.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in rehydrate-eligibility.assessSnapshotCurrentOccupants 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/rehydrate-eligibility.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/daemon/src/domain/rehydrate-eligibility.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"11422ef8f14ba8111ab4674c03224ce2168fa725f5b29e21d517abafa88cb725"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/workflow-render.ts: packages/cli/src/commands/workflow-render.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in workflow-render.renderInstanceShow at line 377. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/workflow-render.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/commands/workflow-render.ts"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d04072bf43f57d9ce65da1d672c9ef532225d95c6bf341cebc8e39b40e6b8e3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/usage-series.ts: packages/daemon/src/domain/usage-series.ts changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in usage-series.computeCostView at line 377. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/usage-series.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/daemon/src/domain/usage-series.ts"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89bdfed5da9bafc63c52ed8aadf52625ccec2c093c337c51a81b7d9576f484c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/pod-bundle-assembler.ts: packages/daemon/src/domain/pod-bundle-assembler.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in PodBundleAssembler.assemble at line 69. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/pod-bundle-assembler.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/daemon/src/domain/pod-bundle-assembler.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"6767a1c8445c13cdb097de1f49b933c9f28ef57744067d38951da20fc4d1c9f4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/current-work.ts: packages/daemon/src/domain/current-work.ts changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in current-work.deriveWorkCandidates at line 829. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/current-work.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/daemon/src/domain/current-work.ts"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba160604f147bad27792c86e5cbc91fb26358c576526d5047818e07ec50df5c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/queue-retention.ts: packages/daemon/src/domain/queue-retention.ts changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in queue-retention.pruneStreamItems at line 360. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/queue-retention.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/daemon/src/domain/queue-retention.ts"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"5587942334691851f5738f2a1bdb2d46a793fc2784642e01f7da1abf893af0dd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/rig-mode/operating-posture.ts: packages/daemon/src/domain/rig-mode/operating-posture.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in OperatingPostureService.context 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/rig-mode/operating-posture.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/daemon/src/domain/rig-mode/operating-posture.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"410b48e8126c582af275349815c874b9f68917add8ba1b511ea903268754470e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/compact.ts: packages/cli/src/commands/compact.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in compact.compactCommand 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/compact.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/commands/compact.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3bde5bc09b91b9c49e43500e900873bd75c7915b88491886099ec51bfa4b45"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/outbox-handler.ts: packages/daemon/src/domain/outbox-handler.ts changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in OutboxHandler.retain at line 460. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/outbox-handler.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/daemon/src/domain/outbox-handler.ts"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"984c9a9293803fd97b797c0208f05f5b21c92187f99f41325dbb64540d479b64"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/package-manifest.ts: packages/daemon/src/domain/package-manifest.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 80 in package-manifest.validateManifest at line 125. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/package-manifest.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/daemon/src/domain/package-manifest.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c12e0a4ddd51ee61c498a041b53ad22e2a892e928b86536870b9b54bbf97edc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/gateway/slack/state-store.ts: packages/daemon/src/domain/gateway/slack/state-store.ts changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in ChannelCoverageStore.read at line 318. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/gateway/slack/state-store.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/daemon/src/domain/gateway/slack/state-store.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b585046fd7f45cad4fceb6e712c187b41b8cd770e1f54ac1e2e643b27c6880"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/env.ts: packages/cli/src/commands/env.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in env.envCommand 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/env.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/commands/env.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"2577dedc82faeb518efc0556b2ce8790db7353a8008ee055cee3230671aef9fe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/routes/spec-library.ts: packages/daemon/src/routes/spec-library.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in spec-library.specLibraryRoutes at line 30. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/routes/spec-library.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/daemon/src/routes/spec-library.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"df8f193b1799667a53f1c1947e32a57ff0921b2f2f78962c6d0c8e9a8e3896d0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/routes/skills.ts: packages/daemon/src/routes/skills.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in skills.skillsRoutes 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/routes/skills.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/daemon/src/routes/skills.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cdabdfb169c36ba4ec218136afad10799b8b2384d99581ab0cdfb6bda11865e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/watchdog-delivery.ts: packages/daemon/src/domain/watchdog-delivery.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in watchdog-delivery.makeWatchdogDeliver at line 14. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/watchdog-delivery.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/daemon/src/domain/watchdog-delivery.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"051cd37473e23c95fd5b347d9d3062561939e97b72418146c8955a1da3232f50"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/roster.ts: packages/cli/src/commands/roster.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in roster.rosterCommand 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/roster.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/commands/roster.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb95521ce2240cf22f2cd2effb2090ec64a6e7771715e963cb3c72b4b513eb2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/capture.ts: packages/cli/src/commands/capture.ts changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in capture.runCrossHostCapture 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/capture.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/commands/capture.ts"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab84ff2ad3e141f5a87789344ee238df47ce6b44f296fdc083b7fec4389577bd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/routes/scope-audit.ts: packages/daemon/src/routes/scope-audit.ts changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in scope-audit.scopeAuditRoutes at line 165. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/routes/scope-audit.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/daemon/src/routes/scope-audit.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e5dde9116dfb3fdc5546433dbd05c94eee912082ce54ee77892dc6c2201cb89"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/usage.ts: packages/cli/src/commands/usage.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in usage.usageCommand 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/usage.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/commands/usage.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a39b037c03c01a4e03b306c3a18d339f7b04deaa2beeb06606711a4ab8c530"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/routes/terminal-ws.ts: packages/daemon/src/routes/terminal-ws.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in terminal-ws.registerTerminalWs 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/routes/terminal-ws.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/daemon/src/routes/terminal-ws.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"958204ede41aaed7438a5267e16e60156bd5bb863c8a4ee2919d33391df762bc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/ui/src/components/for-you/FeedCard.tsx: packages/ui/src/components/for-you/FeedCard.tsx changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 71 in FeedCard.FeedCard at line 355. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/ui/src/components/for-you/FeedCard.tsx\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/ui/src/components/for-you/FeedCard.tsx"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7bc1b2b7062e6c9e576cb774997ce2126025b77a1fbaed72b24758c30f3ff4c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/gateway/slack/open-asks.ts: packages/daemon/src/domain/gateway/slack/open-asks.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in open-asks.postOpenAsks at line 178. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/gateway/slack/open-asks.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/daemon/src/domain/gateway/slack/open-asks.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"f507c343256e129ae1db428e26507d132c6fe944aface9fa601e8b74464cfbe4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/terminal/view-composer.ts: packages/daemon/src/domain/terminal/view-composer.ts changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in view-composer.composeView 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/terminal/view-composer.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/daemon/src/domain/terminal/view-composer.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc4bbbbc8da41183d63df5f9a8132e0ce1fd41cd195bce599ec7c369ca980fe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/view-projector.ts: packages/daemon/src/domain/view-projector.ts changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ViewProjector.runBuiltIn at line 186. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/view-projector.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/daemon/src/domain/view-projector.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"424d58f38dcfc3337a56024c7c603276dc8d2ee2f73d32ec1114a6728c9aa4d4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/bundle-source-resolver.ts: packages/daemon/src/domain/bundle-source-resolver.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in bundle-source-resolver.materializePodBundle at line 214. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/bundle-source-resolver.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/daemon/src/domain/bundle-source-resolver.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c38ac975ff8a33469ef12f53f388864f75946dc97bd6cda5fe5bb56e45b006"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/grow.ts: packages/cli/src/commands/grow.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in grow.growCommand at line 45. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/grow.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/commands/grow.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"056d99aaf35b249e81e39377bf429193f512ea63300c38c867b7e51df2c48159"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/workspace/default-workspace-scaffold.ts: packages/daemon/src/domain/workspace/default-workspace-scaffold.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in default-workspace-scaffold.ensureDefaultWorkspace 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/workspace/default-workspace-scaffold.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/daemon/src/domain/workspace/default-workspace-scaffold.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e092901e44e13feb30504bbfa5505c13104bfa9af953c1354fadfcb44cb243"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/package.ts: packages/cli/src/commands/package.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in package.packageCommand at line 8. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/package.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/commands/package.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"8468bfee93642f65bc38e419b3c94e7a85ceabddad54d8a5934ca8ba1e5cb8f9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/front-door.ts: packages/cli/src/front-door.ts changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in front-door.openMissionControl at line 225. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/front-door.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/front-door.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"71165408f61fa0470106a17285f52674e42185952a6bc3a08f42e87345d4396f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/runner-permissions.ts: packages/daemon/src/domain/runner-permissions.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in RunnerPermissions.read at line 248. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/runner-permissions.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/daemon/src/domain/runner-permissions.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"136fa1f328e330551795abbb82cd00228357225c30f4425189863e944e9f985b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/mirror-skills.mjs: scripts/mirror-skills.mjs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in mirror-skills.checkGeneratedEdges 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- scripts/mirror-skills.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":"scripts/mirror-skills.mjs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb7d3c3ed27d53886b106a65095e958f55696655fad889a6b036438052f87f3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/model-divergence/effective-model-readers.ts: packages/daemon/src/domain/model-divergence/effective-model-readers.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in effective-model-readers.newestPiModel at line 292. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/model-divergence/effective-model-readers.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/daemon/src/domain/model-divergence/effective-model-readers.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90d9ffef6212e936e1f92d47e141d00575a2bad5e3978d613610d2fb226aff6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/tui/src/terminals/open-window.ts: packages/tui/src/terminals/open-window.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in open-window.openTerminalInWindow at line 127. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/tui/src/terminals/open-window.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/tui/src/terminals/open-window.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"62367e0dd120747237e45d84d23fa65a45dd0eca34f8ba21fac28dfb443784d1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/review/compose.ts: packages/daemon/src/domain/review/compose.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in compose.composeSliceReview at line 1114. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/review/compose.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/daemon/src/domain/review/compose.ts"},"region":{"startLine":1114}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a00dd64d4e7763acfe8e369cd935065eb5ed337c5e64007d01e983cc958b91b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/bootstrap.ts: packages/cli/src/commands/bootstrap.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in bootstrap.bootstrapCommand at line 27. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/bootstrap.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/commands/bootstrap.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9ca2ca5898b08a61a24e249fb60db74f30b0bd5349e328658bf34c45b9f0ad"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/acp.ts: packages/cli/src/commands/acp.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in acp.acpCommand at line 189. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/acp.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/commands/acp.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e1e8b69efec99753cf1f8376e61a532e8143a7e6a2c05cbc41c3ae4d910c3a9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/tui/src/connections/connections-model.ts: packages/tui/src/connections/connections-model.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in connections-model.connectionsLines at line 58. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/tui/src/connections/connections-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/tui/src/connections/connections-model.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a0068c4169a70b8f216fdde199245412da6b70cb486b611f68c4118c09fc2d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/review/gather.ts: packages/daemon/src/domain/review/gather.ts changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in ReviewGatherer.attentionForTag at line 517. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/review/gather.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/daemon/src/domain/review/gather.ts"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d56bb7cfd184bf758ddbe00c485de62f36e4e46251541055b94002ca21a8af"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/broadcast.ts: packages/cli/src/commands/broadcast.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in broadcast.broadcastCommand at line 27. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/broadcast.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/commands/broadcast.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"b68171ae3a5c3236af6fd954a60be2ca8fd72760ddc51da4d6def38043d8fb25"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/agent-image.ts: packages/cli/src/commands/agent-image.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in agent-image.agentImageCommand at line 98. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/agent-image.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/commands/agent-image.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ffc30259833554c0df20b39409ce96ac0de193e1696856b111e05aa5f4566e2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/hosts/hosts-registry-reader.ts: packages/daemon/src/domain/hosts/hosts-registry-reader.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in hosts-registry-reader.validateHostRegistry at line 100. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/hosts/hosts-registry-reader.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/daemon/src/domain/hosts/hosts-registry-reader.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"7408bd6ce325dc8b7adbfb95fc6100546bc5f8727368d966edd80b6c15de4040"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: docs/reference/runner-conformance/check-runner.mjs: docs/reference/runner-conformance/check-runner.mjs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in check-runner.launch at line 182. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- docs/reference/runner-conformance/check-runner.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":"docs/reference/runner-conformance/check-runner.mjs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e8a77b740a854851d6676e796209240bf8f1c70da9e7956d107f4501e6d00c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/tui/src/execution/workflow-model.ts: packages/tui/src/execution/workflow-model.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in workflow-model.workflowDetail at line 34. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/tui/src/execution/workflow-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/tui/src/execution/workflow-model.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"a19ea70a26fe38cc1c265510d19f76940f6cdc7e032116539088fe7181feb619"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/scope/scope-approve.ts: packages/daemon/src/domain/scope/scope-approve.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in ScopeApproveService.approve at line 198. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/scope/scope-approve.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/daemon/src/domain/scope/scope-approve.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58511c7db012ab1cd73e8aac45b81cb171b00ec30abc4baae5a95ea3dad315d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/restore.ts: packages/cli/src/commands/restore.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in restore.restoreCommand at line 10. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/restore.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/commands/restore.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9fe8d0103477a8edaa67a482e51d3e950018ef5811ed14773a072e262128d2b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/environment.ts: packages/cli/src/commands/environment.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in environment.environmentCommand 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/environment.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/commands/environment.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"7308aa6c13e587bd32f008f721433db61f7e0ab92508bd5f2e9eddaab829d534"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/environment-lifecycle.ts: packages/daemon/src/domain/environment-lifecycle.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in EnvironmentLifecycle.effect at line 89. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/environment-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/daemon/src/domain/environment-lifecycle.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08ee7167fb17718e50e4ae615655b7f5cdb6240a55d2fa5c71d7f974bc60c87"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/parked-query.ts: packages/daemon/src/domain/parked-query.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in parked-query.diagnoseSeatParked 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/parked-query.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/daemon/src/domain/parked-query.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b84cec7d0c14a3342186e2093b2612748b565397d95753f29b150d4c2152101"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/workflow-instance-store.ts: packages/daemon/src/domain/workflow-instance-store.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in WorkflowInstanceStore.create 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/workflow-instance-store.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/daemon/src/domain/workflow-instance-store.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee6d65b29e57e497ba4c8490bda59be8d823cec249dfbc5c7db1fe69f60fbb0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/workflow-reconciliation.ts: packages/daemon/src/domain/workflow-reconciliation.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in workflow-reconciliation.compare at line 66. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/workflow-reconciliation.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/daemon/src/domain/workflow-reconciliation.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"933990c06cd598da6d2b7b92f7cf829b9a27a4dbb10d183a7d3bf53b2e7ccf4b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/bundle-archive.ts: packages/daemon/src/domain/bundle-archive.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in bundle-archive.unpack 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/bundle-archive.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/daemon/src/domain/bundle-archive.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b0595212de8adffb895b3a2e91ad426fb3760176f694d4cf3d3fbd2b584e14"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/plugin.ts: packages/cli/src/commands/plugin.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in plugin.pluginCommand at line 129. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/plugin.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/commands/plugin.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"904eff3f663c58b18aa07d2351bafdcbb6465bd38e14fff09b3aa69d59135d38"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/routes/config.ts: packages/daemon/src/routes/config.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in config.configRoutes at line 37. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/routes/config.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/daemon/src/routes/config.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b20edfcce2013267de50f74066117ead76505fb46dfeb3f97fcbd01348ff3399"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/context-packs/context-pack-library-service.ts: packages/daemon/src/domain/context-packs/context-pack-library-service.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in ContextPackLibraryService.composeFromFiles at line 231. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/context-packs/context-pack-library-service.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/daemon/src/domain/context-packs/context-pack-library-service.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d58f8d1e2bdc09c018f7af75574f90a9c09168133293202b93812cc7330d3a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/continuity-policy-materializer.ts: packages/daemon/src/domain/continuity-policy-materializer.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in continuity-policy-materializer.armContinuityPolicy at line 254. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/continuity-policy-materializer.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/daemon/src/domain/continuity-policy-materializer.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce48b682c48ca04de28a616807cb2d81edf41559577430f551b509645d068a41"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/whoami-service.ts: packages/daemon/src/domain/whoami-service.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in WhoamiService.resolve at line 174. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/whoami-service.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/daemon/src/domain/whoami-service.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d2003ccc7b6bf497e911552e421d9cec5921b58614b76a7a12b28212d47592"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/policies/workflow-keepalive.ts: packages/daemon/src/domain/policies/workflow-keepalive.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in workflow-keepalive.makeWorkflowKeepalivePolicy.evaluate at line 94. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/policies/workflow-keepalive.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/daemon/src/domain/policies/workflow-keepalive.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c47f502100f9b616f66aaecc6569ff18a090195e1a09f4644e174cdd9659028"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/tui/src/live-events.ts: packages/tui/src/live-events.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in live-events.subscribeActivityEvents.connect at line 40. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/tui/src/live-events.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/tui/src/live-events.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac72c67be1fe67e37abb7861435cdbdf4711652955e7f7efe87668f942935be"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/health-context.ts: packages/daemon/src/domain/health-context.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in health-context.healthAuthority at line 90. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/health-context.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/daemon/src/domain/health-context.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"405bc9f8632496a04b11d6cede66e3013dc167782f5c02b79824fd75357b95bc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/daemon-db-path.ts: packages/daemon/src/daemon-db-path.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in daemon-db-path.daemonDatabaseWarnings 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/daemon-db-path.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/daemon/src/daemon-db-path.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aee8d920fed69edef26de373d918c270ec6def80dfbe11c95d1f8cb46354566"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/acp/connector.ts: packages/cli/src/acp/connector.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in connector.runAcpAssignment 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/acp/connector.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/acp/connector.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"38fa723d6fd35ea30d16e69bfe22623e481bcdf34a2670ae1d31837c5278662f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/model-divergence/current-model-reader.ts: packages/daemon/src/domain/model-divergence/current-model-reader.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in CurrentModelReader.prepare at line 218. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/model-divergence/current-model-reader.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/daemon/src/domain/model-divergence/current-model-reader.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37e12fe5108b42ecd2955ed90d891a8f3d6225b5faf1b4167939ac3da726b1e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/routes/require-sender-identity.ts: packages/daemon/src/routes/require-sender-identity.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in require-sender-identity.parseIdentityPrincipal at line 229. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/routes/require-sender-identity.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/daemon/src/routes/require-sender-identity.ts"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd0e994bc064cbd22620930478935c987297401381258a7d0a5617162a9bee0a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/gateway/slack/thread-routing.ts: packages/daemon/src/domain/gateway/slack/thread-routing.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in thread-routing.makeThreadRouteResolver.\u003Creturned closure\u003E at line 43. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/gateway/slack/thread-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/daemon/src/domain/gateway/slack/thread-routing.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"e58479426d8cac0935ffd4325909978a211cbb1802ebf531cff43203af15265e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/provider/provider-signals.ts: packages/daemon/src/domain/provider/provider-signals.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in provider-signals.deriveUsageLimitPools at line 270. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/provider/provider-signals.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/daemon/src/domain/provider/provider-signals.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"535e5ece906c2a8a2de6e2ee1b4e0dabb421143b54c7a1d432d9d594ee50d2bc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/provider/reactive-tap.ts: packages/daemon/src/domain/provider/reactive-tap.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in reactive-tap.collectReactiveEventSignals 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/provider/reactive-tap.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/daemon/src/domain/provider/reactive-tap.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda0560bc77aade16c2e0172788d6e242df56d27d95bcc40c6c5eee8c83e6941"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/routes/rig-mode.ts: packages/daemon/src/routes/rig-mode.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in rig-mode.rigModeRoutes 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/routes/rig-mode.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/daemon/src/routes/rig-mode.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5cef468aa227cd759370f38e314b0b85f4e08b6f6492d84ef800e55e4c4135e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/provider/claude-seat-switch.ts: packages/daemon/src/domain/provider/claude-seat-switch.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in claude-seat-switch.switchHeld at line 92. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/provider/claude-seat-switch.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/daemon/src/domain/provider/claude-seat-switch.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc165efae88ef466cad3214d5a4fa0f85724b41eb03084ff781c6740d97e5af"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/generated-file-hygiene.ts: packages/daemon/src/domain/generated-file-hygiene.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in generated-file-hygiene.excludeNewGeneratedFiles at line 16. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/generated-file-hygiene.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/daemon/src/domain/generated-file-hygiene.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad86193396851f4dec770b12e8c54d1a52789082e0e7ad5d3c8c1244b6a61c4e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/cross-host-target.ts: packages/cli/src/cross-host-target.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in cross-host-target.resolveCrossHostTarget at line 60. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/cross-host-target.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/cross-host-target.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f6313733972aaad1fbdd7439698821c1da699418789fd417415bacad6a759b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/codex-owned-plugin-trust.ts: packages/daemon/src/domain/codex-owned-plugin-trust.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in codex-owned-plugin-trust.planOwnedCodexContentApproval at line 87. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/codex-owned-plugin-trust.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/daemon/src/domain/codex-owned-plugin-trust.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"176152a80449cdcff0afd5cb8055ac57c07eb00b86b41a775b08ed3ee68e8be7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/seat-launch-additions.ts: packages/daemon/src/domain/seat-launch-additions.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in seat-launch-additions.prepareSeatLaunchAdditions at line 113. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/seat-launch-additions.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/daemon/src/domain/seat-launch-additions.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e61ef09b87ff9549acfb48f4bbea9a8332c1489908f9e11c9cdb59e929d11c3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/host-bindings.ts: packages/cli/src/host-bindings.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in host-bindings.loadHostBindings at line 46. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/host-bindings.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/host-bindings.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad4b067f5283ae7f8bb69db74523df2b8e44584f9008ad4cb1fde277cb927843"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/assets/openshell/guest.py: packages/daemon/assets/openshell/guest.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in guest.main at line 227. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/assets/openshell/guest.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/daemon/assets/openshell/guest.py"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb72d2878125c72b8224e67c19aec128fce92c964a09cfd6a759d0e3e182cca"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/generate-context-packs.mjs: scripts/generate-context-packs.mjs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in generate-context-packs.main 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- scripts/generate-context-packs.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":"scripts/generate-context-packs.mjs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed3ae20f94d8c76026ddb1cc4018091e06644a290919cfc21ff1b3dbe685161"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/fork.ts: packages/cli/src/commands/fork.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in fork.forkCommand.cmd at line 55. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/fork.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/commands/fork.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc79ea9e6c2ed025514f8ad2b54eab3f51eaf0ca72a5eda67604935af525fa5c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/resume-token-capture.ts: packages/daemon/src/domain/resume-token-capture.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in resume-token-capture.deriveResumeToken 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/resume-token-capture.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/daemon/src/domain/resume-token-capture.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b2cbe9cc4cc3c3803884440818db737c7682cd68aefc777aeaf1b2eb75a5bb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/projection-planner.ts: packages/daemon/src/domain/projection-planner.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in projection-planner.planProjection at line 95. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/projection-planner.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/daemon/src/domain/projection-planner.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb9e04ad9e91039ffa3a9952a76ab6dbe76abe4e8cec393423c08de1acc0596"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/context-packs/seat-recap-store.ts: packages/daemon/src/domain/context-packs/seat-recap-store.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in seat-recap-store.writeSeatRecap at line 51. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/context-packs/seat-recap-store.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/daemon/src/domain/context-packs/seat-recap-store.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"daa675c101c90293a42a8a2ef2250ca1f8f1b3b733f45e9cf3bdb6c2fa3a4ded"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/provider/usage-windows.ts: packages/daemon/src/domain/provider/usage-windows.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in UsageWindows.project at line 256. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/provider/usage-windows.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/daemon/src/domain/provider/usage-windows.ts"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dac62aae47f88b34dd01afef34aa448438fbd63db89921d7245b9a2a45b1712"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/tui/src/usage/usage-model.ts: packages/tui/src/usage/usage-model.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in usage-model.allowanceLines at line 66. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/tui/src/usage/usage-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/tui/src/usage/usage-model.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7492f5556de222e85f2d3f50785bb56235d98640e9b28e6fff7d578a36ad7e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/routes/telemetry.ts: packages/daemon/src/routes/telemetry.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in telemetry.telemetryRoutes at line 19. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/routes/telemetry.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/daemon/src/routes/telemetry.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d21c00f0525f92da2822b887df6bc436aab5e68a96e14ebfbeeae88d650e83f5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/tui/src/navigator.ts: packages/tui/src/navigator.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in navigator.navigatorLabelsInner at line 150. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/tui/src/navigator.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/tui/src/navigator.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed0436b037e779dc599b70d2aa010fb6f16254023d4cbed4fb7a514addd94b7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/policies/quiet-release.ts: packages/daemon/src/domain/policies/quiet-release.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in quiet-release.runQuietRelease at line 247. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/policies/quiet-release.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/daemon/src/domain/policies/quiet-release.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce209aca649cf68d0ab97e4ce57387342b18b3785e76198e9ccd76e9fb4fca8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/queue-pickup.ts: packages/daemon/src/domain/queue-pickup.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in queue-pickup.deriveClaimPickup 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/queue-pickup.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/daemon/src/domain/queue-pickup.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceba21c2986b6298e8ff68c99526cd7340dabc30d3697bde332c5ba9e08124cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/tui/src/detail.ts: packages/tui/src/detail.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in detail.wrapDetailLines at line 35. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/tui/src/detail.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/tui/src/detail.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1799cd162b35e3c9d3b8e7c5a6d18171dca75802490889cccc3b64acb99daa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/routes/events.ts: packages/daemon/src/routes/events.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in events.eventsRoute.get(\u0022/\u0022) at line 19. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/routes/events.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/daemon/src/routes/events.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"6efe2e476d1e6d2afe397bb1ca97d22dfe72d8eb77451dbb9e97e8d76e0244ff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/workflow-boot-sweep.ts: packages/daemon/src/domain/workflow-boot-sweep.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in workflow-boot-sweep.runWorkflowBootSweep at line 61. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/workflow-boot-sweep.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/daemon/src/domain/workflow-boot-sweep.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"73286f83bdce57e8fb4d15e666ac66447968d9d698e00f701ea608a9f9f63d95"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/provider/claude-usage-windows.ts: packages/daemon/src/domain/provider/claude-usage-windows.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in ClaudeUsageWindows.project at line 255. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/provider/claude-usage-windows.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/daemon/src/domain/provider/claude-usage-windows.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb630a5b9b67f26490f4fc13f45319c7a11d8e7bfc7938bb9fa79e33bb36cd8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/environment-startup.ts: packages/daemon/src/domain/environment-startup.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in EnvironmentStartup.launch at line 151. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/environment-startup.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/daemon/src/domain/environment-startup.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"634c8464881876b4609b68720d10796e5044b16d939204f98952eaf6366352cb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/gateway/human-readiness.ts: packages/daemon/src/domain/gateway/human-readiness.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in human-readiness.resolveHumanDeliveryReadiness at line 43. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/gateway/human-readiness.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/daemon/src/domain/gateway/human-readiness.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"c40be86140d6c9472c16d54bb8f67039f6701b9615645ce805a92dcb2b791630"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/policies/context-usage-threshold.ts: packages/daemon/src/domain/policies/context-usage-threshold.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in context-usage-threshold.makeContextUsageThresholdPolicy.evaluate at line 30. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/policies/context-usage-threshold.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/daemon/src/domain/policies/context-usage-threshold.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08d927d2952691e05763d13eb61127f8236411652d7eb53e3a2f5b6c10568d9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/compact-plan.ts: packages/cli/src/commands/compact-plan.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in compact-plan.compactPlanCommand 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/compact-plan.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/commands/compact-plan.ts"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5a104a35c25b716c3bf17c61d8ffe2a32d04d6eae597cd059677ca12699c6f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/runtime-switch-materials.ts: packages/daemon/src/domain/runtime-switch-materials.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in runtime-switch-materials.planRuntimeSwitchMaterials 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/runtime-switch-materials.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/daemon/src/domain/runtime-switch-materials.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b111705a5b7c5199e8ad8752f62c2c87f75eae101939a663807e50eeb484f06"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/context-packs/profile-source-resolver.ts: packages/daemon/src/domain/context-packs/profile-source-resolver.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in profile-source-resolver.makeProfileReadFile.\u003Creturned closure\u003E at line 130. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/context-packs/profile-source-resolver.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/daemon/src/domain/context-packs/profile-source-resolver.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9cadec52e398946c4993c6b8d0813e515e48b21b99f92c4186c58f12b8c879"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/routes/views.ts: packages/daemon/src/routes/views.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in views.viewsRoutes at line 19. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/routes/views.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/daemon/src/routes/views.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e24078a4e61350fad0e818773d8167caaec9e6565b4b0ed573ed37d325e5c0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/terminal/scope-task-terminal-view.ts: packages/daemon/src/domain/terminal/scope-task-terminal-view.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in scope-task-terminal-view.readScopeIndex at line 23. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/terminal/scope-task-terminal-view.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/daemon/src/domain/terminal/scope-task-terminal-view.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ed34df540c328fbbd4556f5e0cda72c07fc722138b66271b2f12d666f20b7d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/add.ts: packages/cli/src/commands/add.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in add.addMemberCommand at line 31. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/add.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/commands/add.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a225f687435746787e67e2ff7e68f7fb9193b1df6e8c4d690c65702e5dfa40"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/gateway/delivery-rules-engine.ts: packages/daemon/src/domain/gateway/delivery-rules-engine.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in delivery-rules-engine.decideDelivery at line 126. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/gateway/delivery-rules-engine.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/daemon/src/domain/gateway/delivery-rules-engine.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"a612bc865646a7bc00f923454647a99651faa4c6a61e4632cc5b5a5de89c7820"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/composer-prompts.ts: packages/daemon/src/domain/composer-prompts.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in composer-prompts.composerContainsOwnedText at line 160. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/composer-prompts.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/daemon/src/domain/composer-prompts.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"21353f4241a51d1f88a9408bd52a3379489ce0b43344666bf003685233f67014"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/ui/src/components/AppShell.tsx: packages/ui/src/components/AppShell.tsx changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in AppShell.AppShellInner at line 373. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/ui/src/components/AppShell.tsx\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/ui/src/components/AppShell.tsx"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"271244d3f355d01e08f32dbee46dd173e566963fdfade0bdaac7cee7981ad051"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/check-internal-leak-guard.mjs: scripts/check-internal-leak-guard.mjs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in check-internal-leak-guard.parseArguments at line 40. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- scripts/check-internal-leak-guard.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":"scripts/check-internal-leak-guard.mjs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"654b2fe1921a4613a5237df0621bd6479de98ef14cac3a3721cd6de41c936226"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/routes/env.ts: packages/daemon/src/routes/env.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in env.envRoutes at line 14. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/routes/env.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/daemon/src/routes/env.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"839f97212df771eb08317d3d7e60f0be76a486c49804d0e2e2dd5df13f1222f7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/stream-outcome.ts: packages/cli/src/commands/stream-outcome.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in stream-outcome.routed at line 51. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/stream-outcome.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/commands/stream-outcome.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e54073ab0c83fbbc19d1a6683bba6c5cd0f06fe37f3850ae978c2c1cbd7471"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/routes/transcripts.ts: packages/daemon/src/routes/transcripts.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in transcripts.transcriptRoutes at line 155. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/routes/transcripts.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/daemon/src/routes/transcripts.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a1ff2c71db9b1270af84639495c4261a163f7e3ba0a5146e264714d4a989aa2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/topology-defaults-installer.ts: packages/daemon/src/domain/topology-defaults-installer.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in topology-defaults-installer.installTopologyDefaults at line 52. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/topology-defaults-installer.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/daemon/src/domain/topology-defaults-installer.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"96041ccb3f49c2744f4fe6943914513af343ff75d3b152e4a4980493a5d8a345"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/gateway/human-operating-modes.ts: packages/daemon/src/domain/gateway/human-operating-modes.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in HumanModeService.apply at line 185. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/gateway/human-operating-modes.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/daemon/src/domain/gateway/human-operating-modes.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68c1a7a5d0fcc688e8e7233f1535a81e583271cc3f3fe5d7362d630e52d8466"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/network.ts: packages/cli/src/commands/network.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in network.networkCommand at line 67. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/network.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/commands/network.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"285f5c7a4be42cf03e18e0655ae8481874a68d2f027c78a3c7f6c4e3d9492979"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/rig-edge-ops.ts: packages/daemon/src/domain/rig-edge-ops.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in rig-edge-ops.addRigEdge at line 110. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/rig-edge-ops.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/daemon/src/domain/rig-edge-ops.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7b37f4450aa999b8043965c1975dc95435e9a89225420e3cc01ee0a8b69411d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/routes/scope-approve.ts: packages/daemon/src/routes/scope-approve.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in scope-approve.scopeApproveRoutes at line 12. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/routes/scope-approve.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/daemon/src/routes/scope-approve.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa7a3f2c362c895ff0260b1c01a645d097c3fe75a856046eda746bd03936ad2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/shrink.ts: packages/cli/src/commands/shrink.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in shrink.shrinkCommand 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/shrink.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/commands/shrink.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"8366fe5438852b8b302a75c54e43768932413bb738a5bc898cb33c4a4d918594"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/project-worker.ts: packages/cli/src/commands/project-worker.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in project-worker.runProjectWake 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/project-worker.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/commands/project-worker.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2a4700da4df3c32158d7a85ce8c2103982de90cd8c228439013008ae405051"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/seat-attention.ts: packages/cli/src/seat-attention.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in seat-attention.checkSeatAttention at line 30. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/seat-attention.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/seat-attention.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"4328ccd51ce7ef9f7769e524813d9544327e79eee39e6612ed5efa05260b54b0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/bundle-content-routing.ts: packages/daemon/src/domain/bundle-content-routing.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in bundle-content-routing.routeBundleContents 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/bundle-content-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/daemon/src/domain/bundle-content-routing.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e36fe00b72177e10a0804fc8dba2751963cd819e9719499da93a72ca32e8932"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/auth.ts: packages/cli/src/commands/auth.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in auth.authCommand at line 49. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/auth.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/commands/auth.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a3a079f842b8432f497a9444066c5ddb1702c2d1664f0efbf161ba110cc20b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/session-fingerprinter.ts: packages/daemon/src/domain/session-fingerprinter.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in SessionFingerprinter.fingerprint 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/session-fingerprinter.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/daemon/src/domain/session-fingerprinter.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"3660c3132fcee22c34b26ed2754adae4f39a459e47abe4536b7d4db2ac2ab5aa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/routes/review.ts: packages/daemon/src/routes/review.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in review.reviewRoutes 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/routes/review.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/daemon/src/routes/review.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"74484c84b2f28fa100acbb1d953ea49736b875624b586707d591b5a0f9543946"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/agent-images/agent-image-library-service.ts: packages/daemon/src/domain/agent-images/agent-image-library-service.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in AgentImageLibraryService.install at line 308. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/agent-images/agent-image-library-service.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/daemon/src/domain/agent-images/agent-image-library-service.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"d233606d1195e1c7fb8684a3fa54d62253065392b00857659f2b36c752030efd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/health-checkpoints.ts: packages/daemon/src/domain/health-checkpoints.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in HealthCheckpointSource.read at line 125. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/health-checkpoints.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/daemon/src/domain/health-checkpoints.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9749655f869ab04806c0d7fa351c2cbb8b2f9abe4004699659d2e4a226fd14e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/hosted-wake.ts: packages/daemon/src/domain/hosted-wake.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in hosted-wake.ringHostedWake at line 46. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/hosted-wake.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/daemon/src/domain/hosted-wake.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4859303f30295905d20bba5525fdd72f1071ff56026c1c8c850c935df96123"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/expand.ts: packages/cli/src/commands/expand.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in expand.expandCommand 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/expand.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/commands/expand.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae8250a32c7ea3cefd636eaebcff893aef9cd208b3b6f38111362781af0939cf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/adapters/openshell-podman-observer.ts: packages/daemon/src/adapters/openshell-podman-observer.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in OpenShellPodmanObserver.capture at line 38. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/adapters/openshell-podman-observer.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/daemon/src/adapters/openshell-podman-observer.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5fac607fe7a8d8dd620c5899c7c634ed8534f0eff17e5614e4a549a2adc547f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/test-system/delivery/stand-ins/core.mjs: packages/test-system/delivery/stand-ins/core.mjs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in core.startStandIn.handle at line 178. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/test-system/delivery/stand-ins/core.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/test-system/delivery/stand-ins/core.mjs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eea7f0e946607974e8dec3ce629201d170d024b3b37ef2bdae72c2b0a62374a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/workflow-errors.ts: packages/cli/src/commands/workflow-errors.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in workflow-errors.describeDaemonRejection at line 32. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/workflow-errors.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/commands/workflow-errors.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"b20ad15fca89e661b857e1239435993606d58656957cb6d692fbf71fd43c50ee"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/kernel-boot-tracker.ts: packages/daemon/src/domain/kernel-boot-tracker.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in KernelBootTracker.getStatus 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/kernel-boot-tracker.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/daemon/src/domain/kernel-boot-tracker.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d86ef42298bc1d7b5bb2f1f3888dbb469587c9cbf149f25dee884661791186"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/remove.ts: packages/cli/src/commands/remove.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in remove.removeCommand at line 8. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/remove.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/commands/remove.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a9f3abc52bba1eec7079a096f1a8bbad84e1dd50f742033408277720983f64"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/ui/src/components/SeatOverviewTable.tsx: packages/ui/src/components/SeatOverviewTable.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in SeatOverviewTable.SeatOverviewTable 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/ui/src/components/SeatOverviewTable.tsx\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/ui/src/components/SeatOverviewTable.tsx"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa180eddf29a3eeec958b3fea9dc67b140107ec6512e19bc55745c66a170e74e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/terminal/terminal-following.ts: packages/daemon/src/domain/terminal/terminal-following.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in TerminalFollowing.constructor at line 22. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/terminal/terminal-following.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/daemon/src/domain/terminal/terminal-following.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"c37c2a3932aefc02660eca9638c73789b6c818842d177b38aaaaa62e25574ac7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/desired-claude-activity-hooks.ts: packages/daemon/src/domain/desired-claude-activity-hooks.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in desired-claude-activity-hooks.agentResolvedAgainstRecordedRoots at line 26. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/desired-claude-activity-hooks.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/daemon/src/domain/desired-claude-activity-hooks.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c13117b336f85586012a24410982250d9cbe5a85a43060fbb9bb4a662047292"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/reconcile-session.ts: packages/cli/src/commands/reconcile-session.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in reconcile-session.reconcileSessionCommand at line 36. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/reconcile-session.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/commands/reconcile-session.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3b33494ddfbfad7252b33270b1e488d38dceeedc778114bf881d70cc397d2a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/fresh-occupant-relation.ts: packages/daemon/src/domain/fresh-occupant-relation.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in fresh-occupant-relation.readReadyFreshLaunchFences 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/fresh-occupant-relation.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/daemon/src/domain/fresh-occupant-relation.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e11d6d62f94e3ff2fbf7290dc84000fefea40ac5c1e1e349e33fc9b69464d3f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/lib/bundle-source.ts: packages/cli/src/lib/bundle-source.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in bundle-source.importGitHubBundle at line 272. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/lib/bundle-source.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/lib/bundle-source.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"5933455fed3f89fb79b385268c60f56000317c7eb4ea84559d4d7d4b8ca9765d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/pi-usage-facts.ts: packages/daemon/src/domain/pi-usage-facts.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in pi-usage-facts.extractPiUsageFacts at line 119. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/pi-usage-facts.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/daemon/src/domain/pi-usage-facts.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7fd1c368c28a5c9c306fb82feee919db6c9df6809da1c0d6131b1cda45b5986"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/hosts/remote-daemon-http.ts: packages/daemon/src/domain/hosts/remote-daemon-http.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in remote-daemon-http.remoteJsonRequest at line 116. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/hosts/remote-daemon-http.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/daemon/src/domain/hosts/remote-daemon-http.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"053f58b6321bbf3c1be953cdc3949304afe14c8a82f264776d693fa49102cbad"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/bundle-context-packs-router.ts: packages/daemon/src/domain/bundle-context-packs-router.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in bundle-context-packs-router.routeContextPacks at line 119. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/bundle-context-packs-router.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/daemon/src/domain/bundle-context-packs-router.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"76cf6a3d67e4230ab3a19ac88c5ef47a708e5a20d56ee76878def8cc3cee8634"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/progress/progress-indexer.ts: packages/daemon/src/domain/progress/progress-indexer.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in ProgressIndexer.parseProgressFile at line 174. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/progress/progress-indexer.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/daemon/src/domain/progress/progress-indexer.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"f960ea979e8351ac30cc55989f299f998a3f04b47310935b6a56e94d1b3cece4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/workspace/project-catalog.ts: packages/daemon/src/domain/workspace/project-catalog.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in project-catalog.inferCatalogProject at line 74. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/workspace/project-catalog.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/daemon/src/domain/workspace/project-catalog.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"3416ca27e2fd32ffb70da2b9d7e82049c8a418512109c5cfc11b924f60faee64"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/community-harness-launch-result.ts: packages/daemon/src/domain/community-harness-launch-result.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in community-harness-launch-result.readLaunchResult 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/community-harness-launch-result.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/daemon/src/domain/community-harness-launch-result.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d69d072ac5990021cad82fcca66c7777750516a939e6acce5784309146cb9ae"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/test-system/ci/prompt-state.mjs: packages/test-system/ci/prompt-state.mjs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in prompt-state.runPromptState at line 95. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/test-system/ci/prompt-state.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/test-system/ci/prompt-state.mjs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b5695ffe8a089f5834003e3c01044aa09928a4611f1a1955c4ec34251b2523"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/lib/scope/progress-edit.ts: packages/cli/src/lib/scope/progress-edit.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in progress-edit.addProgressRow at line 104. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/lib/scope/progress-edit.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/lib/scope/progress-edit.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc350df398226c201fdeb478a80b92d58332e2aa1d4b2c8c0421fff321b1c525"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/claude-credential-precedence.ts: packages/daemon/src/domain/claude-credential-precedence.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in claude-credential-precedence.settingsFileConflicts at line 52. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/claude-credential-precedence.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/daemon/src/domain/claude-credential-precedence.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c7fd4194ca71e5374e3b02896cbcf9db033eec3504e6d4538bd65d6a6510752"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/provider/host-usage-rollup.ts: packages/daemon/src/domain/provider/host-usage-rollup.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in host-usage-rollup.rollupClaude 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/provider/host-usage-rollup.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/daemon/src/domain/provider/host-usage-rollup.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"65fa21b841c5279abbac377b3fee78c95f6ba7a3336fc4b946977f17925c8ff6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/commands/requirements.ts: packages/cli/src/commands/requirements.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in requirements.requirementsCommand at line 8. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/requirements.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/commands/requirements.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c4461b1180f288b890c1dcc3950be6ccca19d0bdb6d915377da4ea89ec19ecf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/up-command-router.ts: packages/daemon/src/domain/up-command-router.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in UpCommandRouter.autoDetect 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/up-command-router.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/daemon/src/domain/up-command-router.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ad1c1080701b54c8b632ce0d720cb6b04b9774e678cde22100dcffdd254401"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/instance-initialization.ts: packages/daemon/src/domain/instance-initialization.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in instance-initialization.ensureOpenRigInstance at line 41. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/instance-initialization.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/daemon/src/domain/instance-initialization.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff44acb7089cd2b37c3f741599d0aec6d1542df277680a2180bde75f365d3b5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/lib/scope/capability-delta.ts: packages/cli/src/lib/scope/capability-delta.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in capability-delta.capabilityDeltaExpiryFindings at line 26. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/lib/scope/capability-delta.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/lib/scope/capability-delta.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f42daa507b37a60c2ab914177ddadea6937b3e05d72ea7111b9a1ae6474114c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/cli/src/lib/scope/logical-checkbox.ts: packages/cli/src/lib/scope/logical-checkbox.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in logical-checkbox.parseLogicalCheckboxes at line 45. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/lib/scope/logical-checkbox.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/lib/scope/logical-checkbox.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62c7ce41eff2022518c8eba66fa05ac1349ef302a1de093bdd9a056f59496b2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/daemon/src/domain/scope/logical-checkbox.ts: packages/daemon/src/domain/scope/logical-checkbox.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in logical-checkbox.parseLogicalCheckboxes at line 45. 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/scope/logical-checkbox.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/daemon/src/domain/scope/logical-checkbox.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"2faf8ee11e7656d2ce8b59d4764467f2089057c5739a5f59a28cac1c7d9d4698"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/daemon/src/domain/model-divergence/model-divergence-monitor.ts: packages/daemon/src/domain/model-divergence/model-divergence-monitor.ts changed 17 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 9 (its worst body is ModelDivergenceMonitor.checkSeat 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(model-divergence): a Bedrock inference-profile pin matches its model (#1931)\u201D; \u201Cfix(model-divergence): a Claude pin matches its dated snapshot (#1927)\u201D; \u201Cfix(daemon): avoid false divergence for Claude model pins (#1482)\u201D; \u201Cfix(daemon): Pi model-pin check reads a :\u003Cthinking level\u003E suffix as Pi does (#1403)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/model-divergence/model-divergence-monitor.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/daemon/src/domain/model-divergence/model-divergence-monitor.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"482dd5d9b11f567fc78a5efee66094581644813c159577a53a84d5bffb32edc4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/cli/src/client.ts: packages/cli/src/client.ts changed 23 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 14 (its worst body is DaemonClient.fetch 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(cli): resolve a recovered terminal\u0027s queue seat, and report what a queue update persisted (#3209)\u201D; \u201Cfix(hosts): pairing answers reach an agent, and typed words never deny (#2900)\u201D; \u201Cfix(cli): treat a trailing slash in OPENRIG_URL as the same daemon (#2220)\u201D; \u201Cfix(cli): --wait-for-idle longer than 300s uses one request (#2020)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/client.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/client.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"efafc41fa7d2f78c35130af7b2d7a8c453507fe20e41e7542207fb935e56649c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/daemon/src/domain/managed-blocks.ts: packages/daemon/src/domain/managed-blocks.ts 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 15 (its worst body is managed-blocks.mergeManagedBlockText at line 88), 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(daemon): a guidance file keeps one copy of each managed block (#3020)\u201D; \u201Cfix(daemon): refresh stale managed guidance blocks, never overwrite a person\u0027s edit (#2461)\u201D; \u201Cfix(daemon): re-merging a managed block no longer adds a blank line on every launch (#2376)\u201D; \u201Cfix(daemon): rig down gives back a guidance file\u0027s exact bytes (#1867)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/managed-blocks.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/daemon/src/domain/managed-blocks.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f0165ec00540b111cc3705ab12eff814b6e869fe6581d7217c9fe16ca2d820"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/daemon/src/domain/transcript-store.ts: packages/daemon/src/domain/transcript-store.ts 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 11 (its worst body is TranscriptStore.grepSync at line 405), 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(daemon): avoid rescanning long transcript lines during grep (#2397)\u201D; \u201Cfix(daemon): preserve complete lines in transcript tails (#1227)\u201D; \u201Cfix(transcripts): compare redraws with the next cleaned line (#1104)\u201D; \u201Cfix(transcripts): read coherent captures during atomic publication (#843)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/transcript-store.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/daemon/src/domain/transcript-store.ts"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d953248f07039ae8b39f4a0ca6f48088ec133fb3990f5d5d9079c704a6a87c0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/daemon/src/lib/pane-envelope.ts: packages/daemon/src/lib/pane-envelope.ts 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 14 (its worst body is pane-envelope.wrapPaneEnvelope at line 114), 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: a reply hint never points at human@host, and three delivery doc lines (#3132)\u201D; \u201Cfix(cli): no rig send reply hint for a sender that has no session (#2898)\u201D; \u201Cfix(delivery): route replies to forwarded people through the queue (#2504)\u201D; \u201Cfix(delivery): give human aliases a usable queue reply hint (#2493)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/lib/pane-envelope.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/daemon/src/lib/pane-envelope.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b276e0b7f6a512e0a7591a20ad30fb8a26c51db54ca9acdd429565612a9c3e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/daemon/src/domain/kernel-boot.ts: packages/daemon/src/domain/kernel-boot.ts 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 15 (its worst body is kernel-boot.classifyManagedKernel at line 198), 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(daemon): retain the kernel variant from bootstrap history (#2471)\u201D; \u201Cfix(kernel): start a new kernel in the workspace\u0027s own kernel folder (#2402)\u201D; \u201Cfix(daemon,cli): say why a stale kernel stays down, and count a detached session before notifying (#2152)\u201D; \u201Cfix(daemon): restore only a kernel this daemon start found down (#2146)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/kernel-boot.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/daemon/src/domain/kernel-boot.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16c45ef40a969100ece91ec70f9418b37874c4eedd6fe5c788e66ed1e464c2f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/tui/src/health/health-model.ts: packages/tui/src/health/health-model.ts changed 12 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 15 (its worst body is health-model.healthDetailLines at line 287), 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(tui): show a health source\u0027s evaluation cap as coverage, not as degraded health (#2885)\u201D; \u201Cfix(tui): keep emoji whole when health and config rows are cut to width (#2252)\u201D; \u201Cfix(health): preserve available findings when one source fails (#626)\u201D; \u201Cfix(daemon): evaluate the busiest ceremony families past the family limit (#357)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/tui/src/health/health-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/tui/src/health/health-model.ts"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"a538691778e279d0d377349577bbfb51ff6bf66edf9c2faae93af2823849a417"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/daemon/src/domain/crash-cart-conductor.ts: packages/daemon/src/domain/crash-cart-conductor.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 14 (its worst body is crash-cart-conductor.adoptLivePanesRig at line 161), 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: report exited agents in preserved launch panes (#1070)\u201D; \u201Cfix: make missing-snapshot recovery guidance actionable\u201D; \u201Cfix restore recovery truth and narrow launch\u201D; \u201Cfix(B1): r1 LOW \u2014 drop the stale adopt-failure node when the launcher proves the seat alreadyRunning [NOT guard-accepted]\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/crash-cart-conductor.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/daemon/src/domain/crash-cart-conductor.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"299928c07de451bc76230edfd06d77cd6cb0e7f94727a119456613b959b1e214"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/daemon/src/terminal/TerminalSessionBroker.ts: packages/daemon/src/terminal/TerminalSessionBroker.ts changed 10 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 TerminalBrokerRegistry.attach at line 683), 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(terminal): avoid closing reattach with 1011 during broker teardown (#2671)\u201D; \u201Cfix(terminal): preserve styling in snapshots and scroll-back (#2654)\u201D; \u201Cfix(terminal): a window gets its own sizing back after the web terminal and capture\u0027s resize hint (#2065)\u201D; \u201Cfix(daemon): drop queued terminal input after teardown (#1636)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/terminal/TerminalSessionBroker.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/daemon/src/terminal/TerminalSessionBroker.ts"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e7ccc0a89d99b44e3bf214ea56d1633b2a19e6b5d94460d5ac9541e17c389f6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/daemon/src/domain/active-occupant.ts: packages/daemon/src/domain/active-occupant.ts 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 8 (its worst body is active-occupant.resolveActiveOccupantRow at line 39), 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(daemon): keep a seat whose saved conversation is missing paused, and say what starting it fresh takes (#2255)\u201D; \u201Cfix: restore reasons name the one-seat command; clearer y-answer outcomes (#1804)\u201D; \u201Cfix: keep proved current stops on existing rig up (#1644)\u201D; \u201Cfix(daemon): don\u0027t silently fresh-prime a stopped seat that has a resume token (#1141)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/active-occupant.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/daemon/src/domain/active-occupant.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f751a870fe322c2b04cad8b53b0b4689aef09fe07093a0de3a2c983c2933dc"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/cli/src/cli-error.ts: packages/cli/src/cli-error.ts changed 7 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 13 (its worst body is cli-error.renderDaemonTransportError at line 100), 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): resolve a recovered terminal\u0027s queue seat, and report what a queue update persisted (#3209)\u201D; \u201Cfix(cli): send the real request to a busy daemon; refuse only one confirmed down (#1650)\u201D; \u201Cfix(cli): respect the option terminator in error output (#1106)\u201D; \u201Cfix(cli): report an invalid --wake-after duration instead of exiting silently (#945)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/cli-error.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/cli-error.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"d354a23d404ec8a3acc2aeadee6636d1b2bbe0731f00f67c301db6be36418157"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/daemon/src/domain/workflow-exception-escalation.ts: packages/daemon/src/domain/workflow-exception-escalation.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 12 (its worst body is workflow-exception-escalation.makeEnsureStuckExceptionItem.\u003Creturned closure\u003E at line 75), 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(queue): keep work for missing destinations and explain status (#3142)\u201D; \u201Cfix(daemon): one standing notice per (parent, child seat) for unclaimed rows routed to a delegation parent (#2988) (#3049)\u201D; \u201Cfix(workflows): a running workflow keeps its spec when another file reuses its id and version (#2696)\u201D; \u201Cfix(slack): reuse failed human notices as queue recovery (#1709)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/workflow-exception-escalation.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/daemon/src/domain/workflow-exception-escalation.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4078b2950b4373e2bcbb867a43e2147b5cd264c651fedffb7d28026e307c15"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/daemon/src/adapters/tmux-server.ts: packages/daemon/src/adapters/tmux-server.ts changed 8 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 tmux-server.tmuxServerArgs 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(daemon): name inherited custom tmux socket in attachments (#3165)\u201D; \u201Cfix(daemon): quote the session name in tmuxAttachCommand (#2971)\u201D; \u201Cfix(daemon): rig down stops only a terminal it can show is the seat\u0027s (#2962)\u201D; \u201Cfix(tmux): say when tmux control mode is off, and how to move a team onto it (#2707)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/adapters/tmux-server.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/daemon/src/adapters/tmux-server.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cda0be87e6e96112eccd3399bb722f6638c6412543319679a620bdf45d5c119"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/daemon/src/domain/terminal/tile-attach.ts: packages/daemon/src/domain/terminal/tile-attach.ts changed 8 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 3 (its worst body is tile-attach.earlierTileAttachment 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(daemon): typing into a writable tile reaches the seat on tmux before 3.5 (#2821)\u201D; \u201Cfix(daemon): a paste during a tile\u0027s attach stays one paste (#2795)\u201D; \u201Cfix(terminal): let tiles show whole lines, and attach only while someone types (#2757)\u201D; \u201Cfix(terminal): keep Herdr views from earlier releases after upgrading (#2634)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/terminal/tile-attach.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/daemon/src/domain/terminal/tile-attach.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecda71144175535cd10cae5b3048bcf7eb6f34ef817f70e340d2791c8f219481"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/cli/src/commands/crash-cart.ts: packages/cli/src/commands/crash-cart.ts changed 8 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 crash-cart.readDaemonJsonWithDb at line 37), 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): treat a trailing slash in OPENRIG_URL as the same daemon (#2220)\u201D; \u201Cfix: treat an empty OPENRIG_HOME as unset in the TUI socket, terminal token and crash-cart (#1470)\u201D; \u201Cfix(cli): bracket IPv6 hosts in daemon endpoint URLs (#461)\u201D; \u201Cfix(B1): ROUND 5 \u2014 the whole-unit composition GUARD found: reachability, honesty, scope [NOT guard-accepted]\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/crash-cart.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/commands/crash-cart.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a66d61a06a93d5b7d15109b1fae045251fb85c0d015e281fd059be862f02066"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/daemon/scripts/run-evals.mjs: packages/daemon/scripts/run-evals.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 2 (its worst body is run-evals.opt at line 44), 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-a b3 round 7): wire the current-generation reader into the shipped runner \u002B entry discriminator\u201D; \u201Cfix(test-a b3 round 5): transcript-boundary capture \u2014 remove the forbidden marker send\u201D; \u201Cfix(evals): OPR.0.5.3.7 re-review r2 \u2014 runnable eval entry \u002B no temp-package leak\u201D; \u201Cfix(evals\u002Brouter): OPR.0.5.3.7 re-review \u2014 hermetic production-ref resolution \u002B truthful instructions\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/scripts/run-evals.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/daemon/scripts/run-evals.mjs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"9873df33b649f9119053598ef1016cd24ab8e08e130d072f1b7f4c960313d097"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/daemon/src/domain/reconciler.ts: packages/daemon/src/domain/reconciler.ts 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 reconciler.recordedProcessStillRunning at line 133), 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(daemon): a fresh launch after rig unclaim ended the server\u0027s last session reopens the server (#3009)\u201D; \u201Cfix(daemon,cli): say why a stale kernel stays down, and count a detached session before notifying (#2152)\u201D; \u201Cfix(daemon): restore only a kernel this daemon start found down (#2146)\u201D; \u201Cfix(daemon): don\u0027t detach seats that still run on a tmux server the daemon can\u0027t see (#1906)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/reconciler.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/daemon/src/domain/reconciler.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc502dbc45ce1cb0ccd30ad220b6f8ab2483d2e696033943c09fb044e703b24"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/daemon/src/domain/queue-recovery.ts: packages/daemon/src/domain/queue-recovery.ts 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 9 (its worst body is queue-recovery.settleRecovery at line 103), 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(queue): index bounded listings over retained history (#3090)\u201D; \u201Cfix(daemon): one standing notice per (parent, child seat) for unclaimed rows routed to a delegation parent (#2988) (#3049)\u201D; \u201Cfix: honor accepted queue closure re-estimates without reclaiming work (#2460)\u201D; \u201Cfix(slack): reuse failed human notices as queue recovery (#1709)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/queue-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/daemon/src/domain/queue-recovery.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb12973563362b34f98957e771cf920ce037022aac02597f5075bd72b7add8d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/daemon/src/domain/event-bus.ts: packages/daemon/src/domain/event-bus.ts 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 13 (its worst body is EventBus.discardOnThrow at line 120), 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(daemon): a runner answer\u0027s failed handoff rolls back whole before the answer is kept (#2966)\u201D; \u201Cfix(daemon,tui): follow-ups to runner permission answers (#2934) (#2950)\u201D; \u201Cfix(events): page the notification drain (#2610)\u201D; \u201Cfix(events): serialize subscriber-generated fanout (#527)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/event-bus.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/daemon/src/domain/event-bus.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d09e7fff8cdd89ae1d1357533368d2aea15070dc593f5e85a5f0fbc2aeaee16"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/tui/src/live.ts: packages/tui/src/live.ts 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 15 (its worst body is live.createLiveRefresh.readPage at line 138), 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(tui): preserve stream connection state across pages (#2014)\u201D; \u201Cfix(tui): read less often while the activity stream is connected (#1602)\u201D; \u201Cfix(tui): stop background refresh when the daemon\u0027s build differs (#1600)\u201D; \u201Cfix(tui): bound quiet topology freshness\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/tui/src/live.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/tui/src/live.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc63a252d49c19b0839eae183ef0c24e268ea61558c164ed4cabfe44cf555b5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/daemon/src/domain/gateway/destination-resolver.ts: packages/daemon/src/domain/gateway/destination-resolver.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 8 (its worst body is destination-resolver.classifyDestination at line 67), 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(queue): a hosted member\u0027s work reads as waiting, and hub notes leave out local ids (#3222)\u201D; \u201Cfix(mcp): say how to see your own team, and how a member without a trigger picks up work (#3104)\u201D; \u201Cfix: tell a hosted member how it gets work, what it may read and how to close (#2187)\u201D; \u201Cfix(OPR.0.5.6.14): scope delivery truth to current episode\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/gateway/destination-resolver.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/daemon/src/domain/gateway/destination-resolver.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc34720abde40a983c5cedfcfe0238aaa7f775de432e641ffd1e1e474a7562ee"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/daemon/src/adapters/stub-runtime-adapter.ts: packages/daemon/src/adapters/stub-runtime-adapter.ts 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 14 (its worst body is StubRuntimeAdapter.deliverStartup at line 121), 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(daemon): refresh stale managed guidance blocks, never overwrite a person\u0027s edit (#2461)\u201D; \u201Cfix(daemon): a seat\u0027s own role as an auto-hinted startup file goes to that seat, never into the shared file (#1854)\u201D; \u201Cfix(daemon): a seat\u0027s legacy role guidance never merges into shared guidance (#1840)\u201D; \u201Cfix(daemon): submit with named Enter key instead of C-m (#496) (#540)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/adapters/stub-runtime-adapter.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/daemon/src/adapters/stub-runtime-adapter.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c19ef23473638b58b6607a5924b6d2ccc9906a6c3603e987c1ed1716c3a0b8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/daemon/src/adapters/compose-services-adapter.ts: packages/daemon/src/adapters/compose-services-adapter.ts 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 ComposeServicesAdapter.checkTcp at line 240), 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(bundles): a service bundle install without Docker Compose v2 stops before the target or team, and a plan says so (#2025)\u201D; \u201Cfix(daemon): probe TCP wait targets without an external nc (#1574)\u201D; \u201Cfix(daemon): read an empty compose ps JSON array as no services (#1452)\u201D; \u201Cfix(compose): retain an explicit zero log tail (#673)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/adapters/compose-services-adapter.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/daemon/src/adapters/compose-services-adapter.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c3c14a284d73006323cc7b8e45e75577d083357bd765ff4074ccfae5bcc6c2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/daemon/src/domain/chat-repository.ts: packages/daemon/src/domain/chat-repository.ts 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 10 (its worst body is ChatRepository.history at line 80), 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(daemon): match chat search keywords literally, not as LIKE wildcards (#1455)\u201D; \u201Cfix(daemon): return 400, not 500, for a non-numeric ?limit= (#586)\u201D; \u201Cfix(chat): return the newest messages when chat history is limited (#1057)\u201D; \u201Cfix(chat): refuse a chat history since value SQLite cannot parse (#930)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/chat-repository.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/daemon/src/domain/chat-repository.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"c104f57ebef59f1edc63e15051fa22890ece6b027f3807059a395d8685516b32"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/cli/src/lib/file-transfer.ts: packages/cli/src/lib/file-transfer.ts 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 13 (its worst body is file-transfer.parseFilePathArg at line 64), 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): report byte counts from Apple openrsync (#1232)\u201D; \u201Cfix(cli): recognize dotted registered hosts in file operands (#368)\u201D; \u201Cfix(cli): preserve local rsync directory content operands (#231)\u201D; \u201Cfix(cli): decode SSH and rsync output across UTF-8 chunks (#230)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/lib/file-transfer.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/lib/file-transfer.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c9b9260c5b202b6f55cc2a73c9062f56aa3e1ec8872b8da7d1383de16730819"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/daemon/src/domain/policies/idle-gate-qitem.ts: packages/daemon/src/domain/policies/idle-gate-qitem.ts 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 8 (its worst body is idle-gate-qitem.makeIdleGateQitemPolicy.evaluate at line 57), 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(watchdog): preserve needs-input precedence\u201D; \u201Cfix(watchdog): consume arbitrated activity oracle\u201D; \u201Cfix(watchdog): a substantive blocker transition is material at unchanged state\u201D; \u201Cfix(watchdog): bank the idle-gate condition receipt only on positive delivery\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/policies/idle-gate-qitem.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/daemon/src/domain/policies/idle-gate-qitem.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"08fdd666f05b1f1e9af335064dea39442fec5c3f15bfd21f7391d316405b46e7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/tui/src/crash-cart/render-crash-cart.ts: packages/tui/src/crash-cart/render-crash-cart.ts 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 10 (its worst body is render-crash-cart.renderRestoreLifecycleView at line 168), 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(B1): ROUND 10 gap 1 \u2014 render the \u23CE confirm banner IN the cockpit (was invisible) [NOT guard-accepted]\u201D; \u201Cfix(B1): ROUND 5 \u2014 the whole-unit composition GUARD found: reachability, honesty, scope [NOT guard-accepted]\u201D; \u201Cfix(B1): ROUND 4 \u2014 close the advertise-without-wire CLASS across the restore surface [NOT guard-accepted]\u201D; \u201Cfix(B1): ROUND 3 \u2014 detach-to-reattachable lifecycle \u002B keyboard-walkable triage [NOT guard-accepted]\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/tui/src/crash-cart/render-crash-cart.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/tui/src/crash-cart/render-crash-cart.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a7d6f72b2fbeca05159a61a610b2ae08e8f2f00ddc661f5d4b225668c7c7d1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/daemon/src/domain/queue-owner.ts: packages/daemon/src/domain/queue-owner.ts 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 queue-owner.readReceivingAgentSetting 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(queue): a dead seat\u0027s recovery reaches the operator agent before the person approvals use (#2021)\u201D; \u201Cfix(queue): a dead seat\u0027s stuck-sweep finding goes to someone who can act (#2011)\u201D; \u201Cfix(daemon): a relaunched rig\u0027s Slack channel reaches its lead when an archived generation shares its name (#1850)\u201D; \u201Cfix: give self-attached tmux members a routable team address (#1587)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/queue-owner.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/daemon/src/domain/queue-owner.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ae8c1f0ac8aeba35ba9903a7529206cc9e1bcdb7504d34603873f703394cc2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: scripts/portability-report.mjs: scripts/portability-report.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 10 (its worst body is portability-report.addedLines at line 57), 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: normalize diff prefixes in portability reports (#2148)\u201D; \u201Cfix(tooling): decode Git quoted paths in portability reports (#1230)\u201D; \u201Cfix(ci): run portability reports through symlinked paths (#1109)\u201D; \u201Cfix(ci): keep header-shaped added text in its diff hunk (#1108)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- scripts/portability-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":"scripts/portability-report.mjs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"b14d4ff699a047b2193469dab8bd98bf8cfd6b155f5bb394fda4377d722e36cb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/tui/src/socket-server.ts: packages/tui/src/socket-server.ts 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 15 (its worst body is socket-server.abandonedRecoveryReservation 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: treat an empty OPENRIG_HOME as unset in the TUI socket, terminal token and crash-cart (#1470)\u201D; \u201Cfix(tui): resolve rig, host, pod and agent addresses from any page (#984)\u201D; \u201Cfix: Preserve UTF-8 commands split across control socket chunks (#203)\u201D; \u201Cfix: Preserve running TUI control sockets during a second launch (#205)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/tui/src/socket-server.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/tui/src/socket-server.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff9b4c7e7392530bc32d151a7abd75bfcf11a03c3019520d79df6281ec924d74"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/daemon/src/domain/plugin-vendor-service.ts: packages/daemon/src/domain/plugin-vendor-service.ts 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 13 (its worst body is PluginVendorService.ensureVendored 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(daemon): vendor a bundled plugin\u0027s files byte for byte (#3025)\u201D; \u201Cfix(daemon): the managed-refresh log line says a copy was kept, not that something broke (#1857)\u201D; \u201Cfix(daemon): preserve managed files before startup refresh (#1821)\u201D; \u201Cfix: make startup boundaries hermetic\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/plugin-vendor-service.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/daemon/src/domain/plugin-vendor-service.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"68349ed30730692838d70d2911f451e25d63e432f01d9849490743f57078a61e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/daemon/src/domain/periodic-snapshot-scheduler.ts: packages/daemon/src/domain/periodic-snapshot-scheduler.ts 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 13 (its worst body is PeriodicSnapshotScheduler.tick at line 80), 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(daemon): rig ps reports periodic snapshots only for rigs the scheduler snapshots (#2168)\u201D; \u201Cfix(snapshots): preserve pre-down recovery during periodic refresh (#1147)\u201D; \u201Cfix(snapshots): preserve long periodic snapshot intervals (#548)\u201D; \u201Cfix(daemon): OPR.0.5.3.10 \u2014 one process census per cycle; zero pid-home subprocess on the default path [NOT guard-accepted]\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/periodic-snapshot-scheduler.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/daemon/src/domain/periodic-snapshot-scheduler.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1781a4afa159ec1ad4159b17835f19e67b38d3ac094dd7428d68f8360689de"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/daemon/src/routes/crash-cart.ts: packages/daemon/src/routes/crash-cart.ts 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 7 (its worst body is crash-cart.buildAdoptDeps.probeLiveSessions at line 73), 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 restore recovery truth and narrow launch\u201D; \u201Cfix(B1): GAP 2 \u2014 surviving-panes ADOPT branch per stamped Amendment 2 [NOT guard-accepted]\u201D; \u201Cfix(B1): ROUND 2 \u2014 the operator OWNS the restore lifecycle (cancel/progress/triage) [NOT guard-accepted]\u201D; \u201Cfix(B1): async rollup-stream rework \u2014 wire the conductor to the production path [NOT guard-accepted]\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/routes/crash-cart.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/daemon/src/routes/crash-cart.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"31eb0bc84cbf17eec787fe9e436ea682f3762487c0d30a48747766a809b9605e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/daemon/src/domain/mission-control/notification-adapter-ntfy.ts: packages/daemon/src/domain/mission-control/notification-adapter-ntfy.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 NtfyNotificationAdapter.send at line 57), 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(daemon): release unread notification response bodies (#2172)\u201D; \u201Cfix(daemon): send non-ASCII ntfy titles as RFC 2047 encoded words (#1317)\u201D; \u201Cfix(security): prevent SSRF in notifications, drive-by CSRF on API, and pairing queue flooding (#149)\u201D; \u201Cfix(daemon): keep truncated ntfy titles ASCII (#217)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/mission-control/notification-adapter-ntfy.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/daemon/src/domain/mission-control/notification-adapter-ntfy.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"93aa108be9a89cf52e4a9717243186c058cad6ddc4fd02a921e6ea1a44e9bfd2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/cli/src/rig-handle.ts: packages/cli/src/rig-handle.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 11 (its worst body is rig-handle.resolveRigHandle at line 54), 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): serve a Cloud caller seat that was created but never launched (#2125)\u201D; \u201Cfix(cli): accept a rig name in rig archive, rig unarchive and rig release (#1688)\u201D; \u201Cfix(cli): report a shared rig name as rig_ambiguous JSON in rig restore status --json (#1686)\u201D; \u201Cfix(cli): accept a rig name in rig snapshot, snapshot list, export and restore --rig (#1681)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/rig-handle.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/rig-handle.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3cbde99b5b794b27197ac93ac1b172bc69207049151ec2ea3f3aadef85823bf"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/daemon/src/domain/crash-cart-probes.ts: packages/daemon/src/domain/crash-cart-probes.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 11 (its worst body is crash-cart-probes.collectTerminalAttempts 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(B1): ROUND 9 \u2014 unanimity over FULLY-RESOLVED terminals only (walk cap/cycle = unknown) [NOT guard-accepted]\u201D; \u201Cfix(B1): ROUND 8 \u2014 refused as a POSITIVE-form predicate (terminal-attempt unanimity) [NOT guard-accepted]\u201D; \u201Cfix(B1): ROUND 7 \u2014 refused requires UNAMBIGUOUS refusal; mixed aggregate stays unverified [NOT guard-accepted]\u201D; \u201Cfix(B1): ROUND 6 \u2014 the crash-cart probe now recognizes the REAL Node refusal shape [NOT guard-accepted]\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/crash-cart-probes.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/daemon/src/domain/crash-cart-probes.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e7b9a34296002bca8726390d9e5fe4032eb4441edad6cda824e0333c6fcc5b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/tui/src/demo-data.ts: packages/tui/src/demo-data.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 1 (its worst body is demo-data.demoSnapshot at line 6), 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(tui): neutral names in the demo stream events (#2724)\u201D; \u201Cfix(tui): distinguish observed rig presence on topology landing\u201D; \u201Cfix(s12): genericize derived host examples\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/tui/src/demo-data.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/tui/src/demo-data.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e9a0c7e1cfece0ef9d4c80bbee62ceeb1aad88aa8d8651c064df1b51334c0bc"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/cli/src/commands/transcript.ts: packages/cli/src/commands/transcript.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 12 (its worst body is transcript.transcriptCommand at line 17), 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): send normalized line counts for transcript --tail and capture --lines (#2164)\u201D; \u201Cfix(cli): skip the thin-transcript note when a small --tail returns every line asked for (#1682)\u201D; \u201Cfix(cli): preserve blank lines in transcript rendering (#639)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/transcript.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/commands/transcript.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a535226535803a2787a1837e740d37b07c3009cdd68ed08408ba8588bcead4a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/daemon/src/domain/watchdog-scheduler.ts: packages/daemon/src/domain/watchdog-scheduler.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 7 (its worst body is WatchdogScheduler.tick at line 130), 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(daemon): due parked-row reminders for one seat go as one message per scheduler pass (#1507)\u201D; \u201Cfix(daemon,tui): show a parked row\u0027s wake when it will fire, never as 1970 (#946)\u201D; \u201Cfix(daemon): first periodic-reminder interval measured from registration (#860)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/watchdog-scheduler.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/daemon/src/domain/watchdog-scheduler.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"8064232ccc83d446f36d37b6f20c7d06f7046efd31ea046d4827f6df83c10c9a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/daemon/src/domain/cwd-resolution.ts: packages/daemon/src/domain/cwd-resolution.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 4 (its worst body is cwd-resolution.resolveAuthoredCwd 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(restore): honor --cwd on an existing-rig restore, name a missing saved folder, leave an existing project root unscaffolded (#3347)\u201D; \u201Cfix(launch): rig up warns when it defaults to / (from #226 by @Marius-prog) (#1150)\u201D; \u201Cfix(paths): recognize contained dot-prefix directories (#524)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/cwd-resolution.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/daemon/src/domain/cwd-resolution.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb88780cfc0fefa52ff2c7eff9b3da30bb047d4d081a03e37dc9401b7b091125"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/daemon/src/domain/occupant-invalidator.ts: packages/daemon/src/domain/occupant-invalidator.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 7 (its worst body is DefaultOccupantInvalidator.invalidateRetiringOccupant at line 67), 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(daemon): keep workflow keepalives through a seat swap (#1782)\u201D; \u201Cfix(daemon): keep reminders a retiring occupant registered for other seats (#1777) (#1777)\u201D; \u201Cfix(daemon): keep a blocked row\u0027s park timer through a seat handover (#242)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/occupant-invalidator.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/daemon/src/domain/occupant-invalidator.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9494673433072aa2379a2fec4752479a2c7c1b7a887703d1db811905dbf173"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/daemon/src/adapters/openshell-driver.ts: packages/daemon/src/adapters/openshell-driver.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 9 (its worst body is OpenShellDriver.constructor at line 16), 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(daemon): recreate an OpenShell worker after a restart replaces its engine socket (#3291)\u201D; \u201Cfix: deliver maintained environment startup to the guest worker (#2418)\u201D; \u201Cfix: repair OpenShell workspace projection and unstarted cleanup (#2378)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/adapters/openshell-driver.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/daemon/src/adapters/openshell-driver.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"409ab72396ded238035d81729e6bad925fc01938aa68bace08fa3c5a6dc3cf1c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/daemon/src/daemon-shutdown.ts: packages/daemon/src/daemon-shutdown.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 15 (its worst body is daemon-shutdown.createDaemonShutdown.\u003Creturned closure\u003E at line 121), 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 longer for the current daemon child to become ready (#3118)\u201D; \u201Cfix(daemon): retain shutdown timing in existing diagnostics (#1794)\u201D; \u201Cfix(daemon): bound active HTTP streams during shutdown (#324)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/daemon-shutdown.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/daemon/src/daemon-shutdown.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"8733b65b811ce985e0fe926805e7ff07f921b03ae9f0cf3c1e8fc902c064f8ef"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/cli/src/daemon-reachability.ts: packages/cli/src/daemon-reachability.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 8 (its worst body is daemon-reachability.daemonMayAnswer at line 66), 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): don\u0027t report a daemon as stopped when this shell can\u0027t see its pid (#2860) (#2913)\u201D; \u201Cfix(cli): refuse daemon start when a probe is blocked (#2502)\u201D; \u201Cfix(cli): send the real request to a busy daemon; refuse only one confirmed down (#1650)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/daemon-reachability.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/daemon-reachability.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"961fe01efc7b1f7e34844f9246e273e6890a9353d5e70c1b2c3c7aebca651edd"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/tui/src/pulse/pulse-model.ts: packages/tui/src/pulse/pulse-model.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 8 (its worst body is pulse-model.nowRows at line 292), 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(tui): pick JUST FINISHED by finish time so an old item closed last shows (#2392)\u201D; \u201Cfix(tui): show JUST FINISHED clocks in the configured time zone (#2393)\u201D; \u201Cfix(tui): disclose capped queue samples through topology and Pulse (#1175)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/tui/src/pulse/pulse-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/tui/src/pulse/pulse-model.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc8a5e352529f2b5f75a91e329b8ab4ae1f198066ed94e13c4475d8ef5f9963b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/daemon/assets/claude-statusline-context.cjs: packages/daemon/assets/claude-statusline-context.cjs 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 claude-statusline-context.normalizeRateLimits at line 95), 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(daemon): avoid Claude status line temp collisions (#1865)\u201D; \u201CFix Claude rate limit reset times (#108)\u201D; \u201Cfix: bind effective model to current occupant identity\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/assets/claude-statusline-context.cjs\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/daemon/assets/claude-statusline-context.cjs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc0401bbd4d1096b76b2997f0276d0f7e669875c931804baf56225e78423810"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/daemon/src/domain/workspace/project-read.ts: packages/daemon/src/domain/workspace/project-read.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 11 (its worst body is project-read.workSource 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(proof): compare canonical project roots (#1814)\u201D; \u201Cfix(proof): resolve project-qualified scopes through the workspace catalog (finishes #136, by @korallis) (#1149)\u201D; \u201Cfix: keep Projects source errors local to affected 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/workspace/project-read.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/daemon/src/domain/workspace/project-read.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"4101e97be8dd806c750af4f1a04bb17e85425be30bbae77c763d5c6eb8533d79"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/cli/src/lib/topology-trace.ts: packages/cli/src/lib/topology-trace.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 7 (its worst body is topology-trace.assertSafeSegment at line 55), 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(s06): close shipped context review concerns [NOT reviewer-accepted]\u201D; \u201Cfix(s06): r2 dual-gate blockers \u2014 door wiring, total best-effort, traversal rejection \u002B THE DOOR TEST [NOT guard-accepted]\u201D; \u201Cfix(s06): legacy topology root resolves where legacy code actually wrote [NOT guard-accepted]\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/lib/topology-trace.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/lib/topology-trace.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d2b451f52cd4ff55a1a6c4228507ccbc8031efe1b9b592939b81a8d4cdb172"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/cli/src/cross-host-executor.ts: packages/cli/src/cross-host-executor.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 cross-host-executor.runCrossHostCommand at line 63), 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,daemon): separate ssh\u0027s options from the target with -- (#2973)\u201D; \u201Cfix(cli): decode SSH and rsync output across UTF-8 chunks (#230)\u201D; \u201Cfix(cli): replace unavailable permission diagnostic links with inline guidance\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/cross-host-executor.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/cross-host-executor.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddfde47e2a7fd0c15ebd1d35508dd1e6e537fd99ab2b582339cf6034bec0453a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/cli/src/fetch-with-timeout.ts: packages/cli/src/fetch-with-timeout.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 13 (its worst body is fetch-with-timeout.fetchWithTimeout 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(cli): --wait-for-idle longer than 300s uses one request (#2020)\u201D; \u201Cfix(cli): avoid retaining caller abort listeners (#1097)\u201D; \u201Cfix: Keep CLI request deadlines active through response bodies (#201)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/fetch-with-timeout.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/fetch-with-timeout.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e1ade5a191c62185663135a243a037ae1a4076b07a9db0fd16864112ae52f5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/cli/src/commands/snapshot.ts: packages/cli/src/commands/snapshot.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 15 (its worst body is snapshot.snapshotCommand 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): size rig snapshot list columns to their values (#1707)\u201D; \u201Cfix(cli): accept a rig name in rig snapshot, snapshot list, export and restore --rig (#1681)\u201D; \u201Cfix restore recovery truth and narrow launch\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/cli/src/commands/snapshot.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/commands/snapshot.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"89fc53c1c679823c85d4402c1609e53daa4d410f98a379edad58bfa33e38999b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/daemon/src/domain/workflow-role-context.ts: packages/daemon/src/domain/workflow-role-context.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 3 (its worst body is workflow-role-context.tryResolveRoleByCapability at line 85), 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(daemon): look up the active rig, not an archived one with the same name (#1101)\u201D; \u201Cfix(workflow): propagate capability evidence read failures\u201D; \u201Cfix(workflow): resolve human fallback and retire recovered overdue alerts\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/workflow-role-context.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/daemon/src/domain/workflow-role-context.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ecb43336160917417dc1cbe4a8e074679dba60bcddccd18bebd44bb01f09fd6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/tui/src/local-reading.ts: packages/tui/src/local-reading.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 15 (its worst body is LocalReadingController.key 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(tui): keep helpers working after the start directory is deleted (#1485)\u201D; \u201Cfix(tui): page through local directory selections (#1113)\u201D; \u201Cfix(tui): keep refreshed local reader selection in bounds (#434)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/tui/src/local-reading.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/tui/src/local-reading.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a6353d82ebaee6eee8b0913467ca3cddb95551280a2133a379e6aadc212c2c8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/daemon/src/domain/spec-validation-advisory.ts: packages/daemon/src/domain/spec-validation-advisory.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 4 (its worst body is spec-validation-advisory.aliasModelPinAdvisory at line 33), 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(daemon): avoid false divergence for Claude model pins (#1482)\u201D; \u201Cfix(daemon): r2 BLOCKING-1 \u2014 CANONICAL_MODEL_PINS is null-prototype; arbitrary string pins can never read inherited Object members [NOT guard-accepted]\u201D; \u201Cfix(daemon): f7dfca0c \u2014 end the alias-pin false-positive class: modelsMatch canonicalizes the pin through the ONE shipped map [NOT guard-accepted]\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/src/domain/spec-validation-advisory.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/daemon/src/domain/spec-validation-advisory.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb8dec0f6027f892275f8f359065fd8c56c49af6c3c2f3529368bc5dbe94bc91"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/daemon/assets/plugins/openrig-core/skills/loading-addressable-markdown/scripts/resolve-markdown.mjs: packages/daemon/assets/plugins/openrig-core/skills/loading-addressable-markdown/scripts/resolve-markdown.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 resolve-markdown.scanHeaders at line 46), 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(skills): retain fenced examples in shipped markdown resolver (#388)\u201D; \u201Cfix(skills): preserve loader import mode\u201D; \u201Cfix(skills): resolve loader entrypoint symlinks\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/daemon/assets/plugins/openrig-core/skills/loading-addressable-markdown/scripts/resolve-markdown.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/daemon/assets/plugins/openrig-core/skills/loading-addressable-markdown/scripts/resolve-markdown.mjs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf72046702520205558bd28bd9d82b60d12bcad6bdd5ce53a284651b19ad781"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/tui/src/refresh.ts: packages/tui/src/refresh.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 2 (its worst body is refresh.singleFlight at line 11), 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(S19 waveO-fix1): trailing coalescer keeps rejection propagation; old overlap pin updated to the R2-ruled contract (the join-the-flight semantics WAS the B3 defect; cited in-pin) [NOT guard-accepted]\u201D; \u201Cfix(S19 waveO-fix1): GREEN \u2014 three production seams closed [NOT guard-accepted]\u201D; \u201Cfix(S16): refresh fleet only on operator activity\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 01:09:45 -08:00\u0027 --until=\u00272026-11-17 01:09:45 -08:00\u0027 --full-history --no-merges -- packages/tui/src/refresh.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/tui/src/refresh.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba5223d9e898729b33efc537f11f57714e6fb5eb01801a548908e1bcddf3d48"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 190 significant file(s) lose their only recent owner: packages/ui/src/components/project/ScopePages.tsx, packages/daemon/src/domain/bundle-types.ts, packages/daemon/src/domain/provider/usage-across-hosts.ts, packages/ui/src/components/LiveNodeDetails.tsx, packages/ui/src/components/LibraryReview.tsx, packages/ui/src/components/feed/cards/storytelling-cards.tsx, packages/ui/src/components/AppShell.tsx, packages/cli/src/commands/bundle.ts (\u002B182 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8839fd076c83803b031424e092cac3eb2d824f2a2dfbfdd7c2327b601bd33d93"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 65 significant file(s) lose their only recent owner: packages/daemon/src/domain/context-packs/manifest-parser.ts, packages/daemon/src/domain/crash-cart-conductor.ts, packages/ui/src/components/review/MissionReviewTab.tsx, packages/ui/src/components/review/SliceReviewTab.tsx, packages/daemon/src/domain/health-projection.ts, packages/daemon/src/domain/review/fleet-compose.ts, packages/daemon/src/domain/continuity-policy-materializer.ts, packages/tui/src/stylize.ts (\u002B57 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8d66d26099c0e0b2984a86e8b1bd2f8bcb9d1738ca75c44a82b9178951bd249c"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #3: If anonymized user #3 becomes unavailable, 3 significant file(s) lose their only recent owner: packages/cli/src/lib/file-transfer.ts, packages/cli/src/commands/workflow-follow.ts, packages/cli/src/lib/scope/slice-claims.ts. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8f12d189b1198599cc32eae34c835f14d791e65e87517667f76b0f4459b35db5"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 1 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (259 single-owned of 1129 analysed files in total, 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; 1129 of the 1603 production source files in this repository met that bar). They are anonymized user #4 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: packages/daemon/src/domain/home-isolation.ts."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: AS-T12 \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":"packages/daemon/test/bootstrap-orchestrator.test.ts"},"region":{"startLine":1427}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0360d55251f487ff30c94f9577291acd3698e67fa3d03b4b441baefd5629bb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: AS-T12 \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":"packages/daemon/test/bootstrap-orchestrator.test.ts"},"region":{"startLine":1430}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f16391a1cee0ef99b8dbd58ca0c090e119010c459eb9e48570779da7ba0757"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: AS-T12 \u2014 migrate to pod-aware bundle types \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":"packages/daemon/test/bundle-archive.test.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bcd44e4211bc111ec6a8ce6798eb039456f10bae5843a373ca15e05d0c489d2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: AS-T12 \u2014 migrate to pod-aware bundle types \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":"packages/daemon/test/bundle-archive.test.ts"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"adeeec1d995eb9eaeacf22d500d6b327eebf65f27076aa67e4d8d3bc1db0572d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: AS-T12 \u2014 migrate to pod-aware bundle types \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":"packages/daemon/test/bundle-assembler.test.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"a529db9739829f0a01929f930c935b693e1892f0841555370881762845efcf96"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: AS-T12 \u2014 migrate to pod-aware bundle types \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":"packages/daemon/test/bundle-integrity.test.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3cbb5cae08e328ddc10e21df44c35e764d123cc889f1c0e5804cae7d6520f93"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: AS-T12 \u2014 migrate to pod-aware bundle types \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":"packages/daemon/test/bundle-source-resolver.test.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eaee1ee4227b24cdc7f780af2a7eab0f54c9a17e3fb47c994c5f6793728c398"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: AS-T12 \u2014 migrate to pod-aware bundle types \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":"packages/daemon/test/bundle-types.test.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"008e236661acfaa916409c4d91adcc0e334d84ba5ceeacbceab8c54bfb7e5441"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: AS-T12 \u2014 migrate to pod-aware bundle types \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":"packages/daemon/src/domain/bundle-archive.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"26924cb9f420de68d752ef0b8becef0853d97c3d996e5315c52be8ee53f07e81"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: AS-T12 \u2014 migrate to pod-aware bundle types \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":"packages/daemon/src/domain/bundle-assembler.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"295507a0ccc0870776941a3df63234ef849aa7519f9cd89e9f80dfdfeec386ef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: AS-T12 \u2014 migrate to pod-aware bundle types \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":"packages/daemon/src/domain/bundle-integrity.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2afd1ca40ce5c139135762ae664addd9ff5afcaae0dc16d68b23d85d15ab67"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: AS-T12 \u2014 migrate to pod-aware bundle types \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":"packages/daemon/src/domain/bundle-source-resolver.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6288f5501cfeb585bd28420bb4991227f602ee8e9acccbd9ea830be79fde465"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: AS-T12 \u2014 migrate to pod-aware bundle assembler \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":"packages/daemon/test/bundle-assembler.test.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5497b1aefe77162f708588296258c95af607f51082b3def0072598c4021138b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: AS-T12 \u2014 migrate to pod-aware bundle assembler \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":"packages/daemon/test/bundle-source-resolver.test.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"caac4cb9a9c2ecaf4579e3898adf8c4375ff70dc7a7dc52f6cd385afa0626820"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: AS-T12 \u2014 migrate to pod-aware bundle assembler \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":"packages/daemon/src/domain/bundle-assembler.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c576a771c5a5e58a4787749be822c60a839c7e6ed74e1eab3185c367c0ef65e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: AS-T12 \u2014 migrate to pod-aware bundle source resolver \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":"packages/daemon/test/bundle-source-resolver.test.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d1555a394ce3d8fb3f0c9494ba2ca3d2c7898d6a08cf4b49a988ed7c7fb2d6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: AS-T12 \u2014 migrate to pod-aware bundle source resolver \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":"packages/daemon/src/startup.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"7018704e6be1da12b7e4887004b3187ec85cad8dfb4cfb4b2dcc5b4211465653"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: AS-T12 \u2014 migrate to pod-aware bundle source resolver \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":"packages/daemon/src/domain/bootstrap-orchestrator.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6f9a7a683223f541483c3deca5f73cb7b2bc56bdb672e732f965ae8379b852"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: AS-T12 \u2014 migrate to pod-aware bundle source resolver \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":"packages/daemon/src/domain/bundle-source-resolver.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd762295443e180e94cf03a459c9b669dd6d8ffda84f36952f51fab4cffe322"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(P6-B \u2190 dev-driver (A) canon-restore): re-add \u0060expect(architectSkill).toContain(\u0022rig spec \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":"packages/daemon/test/openrig-core-plugin.test.ts"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"255f391eb279bcaa8a96b6e47378ea4cd17dbde8de9e0787762a2a44e6f91397"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: AS-T08b \u2014 migrate to pod-aware RigSpec \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":"packages/daemon/test/rigspec-instantiator.test.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7a7d6f0459213a12a1e619722670be88ec3abae3552b2dff32c9cf3c15885e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: AS-T08b \u2014 migrate to pod-aware RigSpec \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":"packages/daemon/test/rigspec-preflight.test.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba9b719059c414e2b028d8bcaf5a9ac2d74a2469edc6dec618917a69b3de206"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: AS-T08b \u2014 migrate to pod-aware RigSpec \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":"packages/daemon/test/rigspec-routes.test.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da39b867277017ecd4ebcc9ade61d2ad0e6cc96eb38946eeb189c588874bfd9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: AS-T08b \u2014 migrate to pod-aware RigSpec \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":"packages/daemon/src/domain/bootstrap-orchestrator.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c035cfeaab41e8e0bed01a0606a0ff5038c5d04f5f9bfe68b1ebadcfb88a89"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: AS-T08b \u2014 migrate to pod-aware RigSpec \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":"packages/daemon/src/domain/bootstrap-orchestrator.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd8db131219bff7786e63540217a5b9bc6630f8c8d32a27297f467456377d53a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: AS-T08b \u2014 migrate to pod-aware RigSpec \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":"packages/daemon/src/domain/bootstrap-orchestrator.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"12dfa2b58284f0bd671f4a3cc452feb6c87c68769fc28d501638d423a36a466c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: AS-T08b \u2014 migrate to pod-aware RigSpec \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":"packages/daemon/src/domain/bundle-assembler.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c30b70ea5e5d36a482d8d8906ae96610f39accc6e119a6b841acd61217de02"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: AS-T08b \u2014 migrate to pod-aware RigSpec \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":"packages/daemon/src/domain/bundle-assembler.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"940d415a1e23d339664ce818a4fedaa0541df452e5218ffdc5a7197841788bbe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: AS-T08b \u2014 migrate to pod-aware RigSpec \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":"packages/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae3fec3c93ee0e55efeb4cffd53e901ec9894cbcd600d7a40d68ce31266674f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: AS-T08b \u2014 migrate to pod-aware RigSpec \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":"packages/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e792ffb79114daf4ccde74d4102365e2ea0a506f376a2a2c77b11124e44be35"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: AS-T08b \u2014 migrate to pod-aware RigSpec \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":"packages/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"1178ee08bb9e5802afc716a8e287a2a5887a163ced0f98fe9c78a0c28e6d9bc9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: AS-T08b \u2014 migrate to pod-aware RigSpec \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":"packages/daemon/src/domain/rigspec-preflight.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8549132b63b3488c269106428f24c1f8e50ba8d24c69856158a56f21a3653d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove when AS-T12 migrates all consumers \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":"packages/daemon/src/domain/bundle-types.ts"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"10fd34961142c8fe2a365d7d8f35e23b1c242d2e3199d2ad157f9772a038008a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(0.3.2): graduate MAX_COLS \u002B MAX_PER_WORKSPACE to settings keys \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":"packages/daemon/src/domain/cmux-layout-service.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8f8d0b9fdb3cb3b04a7ea812239e3b131e8c330df666e4ff34d46b9f72c67c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: AS-T12 \u2014 rename to LegacyRigSpecPreflight when routes are migrated \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":"packages/daemon/src/domain/rigspec-preflight.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ecd698eb126ab2b34dd9badfbf255bc6e34a1f4faafb95cd93ebf7c01f2f76"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove when AS-T08b/AS-T12 migrate all consumers \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":"packages/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":1393}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0bd4b684e5c9c8f53417f88b5a0464d7e2f4224a289597af4810ea1ae72d99c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove when AS-T08b/AS-T12 migrate all consumers to pod-aware RigSpec \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":"packages/daemon/src/domain/types.ts"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"681fc77d57f14d35793d3340b70896e3f55d4a27c2d4d99f914c80568e08ad33"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. The recognised ADR directories in this tree were read \u2014 \u0060packages/cli/src/decisions\u0060 \u2014 and none of their files is a decision record (a README, index or template page does not count). What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060packages/ui/package.json\u0060 makes this repository a deployable product (line 11)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/package.json"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"931bce85feaeb4b6ce52fcf398a81b9db2dc25fa64b5cc25c3db4540aa6d81c7"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060queryAgentPIDs\u0060 spells \u0060PI\u0060 where 37 names in the project spell it \u0060Pi\u0060: 37 of 39 names in project openrig spell the token \u0060Pi\u0060 (37 of 39; unit: names in project openrig containing \u0060Pi\u0060). Peers: PiCommunityRuntimeAdapter.fromPiAdapter (packages/daemon/src/adapters/pi-community-runtime-adapter.ts:26); pi-readiness.parsePiModelsJson (packages/daemon/src/adapters/pi-readiness.ts:55); pi-runner-protocol.parsePiRunnerState (packages/daemon/src/adapters/pi-runner-protocol.ts:123); pi-runner-protocol.buildPiChildEnv (packages/daemon/src/adapters/pi-runner-protocol.ts:232); pi-runner-protocol.buildPiRunnerCommand (packages/daemon/src/adapters/pi-runner-protocol.ts:321). Rename to \u0060queryAgentPiDs\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/adapters/cmux.ts"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b73e75fae359d8be2e8f63d9ae416946e274a181ceeac8199048ce8e202c737"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060getUploadURLExternal\u0060 spells \u0060URL\u0060 where 89 names in the project spell it \u0060Url\u0060: 89 of 90 names in project openrig spell the token \u0060Url\u0060 (89 of 90; unit: names in project openrig containing \u0060Url\u0060). Peers: bin-wrapper.resolveBinEntry(moduleUrl) (packages/cli/src/bin-wrapper.ts:18); bin-wrapper.isDirectRun(moduleUrl) (packages/cli/src/bin-wrapper.ts:24); client.formatDaemonHostForUrl (packages/cli/src/client.ts:147); client.localDaemonUrl (packages/cli/src/client.ts:176); DaemonClient.baseUrl (packages/cli/src/client.ts:192). Rename to \u0060getUploadUrlExternal\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/gateway/slack/slack-api.ts"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"c269a398a2d6ee8f5fff3153332f91fbccc4014ca672def7f1b14f43616358ff"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060cachedAgentPIDs\u0060 spells \u0060PI\u0060 where 37 names in the project spell it \u0060Pi\u0060: 37 of 39 names in project openrig spell the token \u0060Pi\u0060 (37 of 39; unit: names in project openrig containing \u0060Pi\u0060). Peers: PiCommunityRuntimeAdapter.fromPiAdapter (packages/daemon/src/adapters/pi-community-runtime-adapter.ts:26); pi-readiness.parsePiModelsJson (packages/daemon/src/adapters/pi-readiness.ts:55); pi-runner-protocol.parsePiRunnerState (packages/daemon/src/adapters/pi-runner-protocol.ts:123); pi-runner-protocol.buildPiChildEnv (packages/daemon/src/adapters/pi-runner-protocol.ts:232); pi-runner-protocol.buildPiRunnerCommand (packages/daemon/src/adapters/pi-runner-protocol.ts:321). Rename to \u0060cachedAgentPiDs\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/session-fingerprinter.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a152a37cadb05996e09321fbeb044f258f8490b52b385b88a3fed9b8573aad6"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060sourceToolUseID\u0060 spells \u0060ID\u0060 where 2627 names in the project spell it \u0060Id\u0060: 2627 of 2628 names in project openrig spell the token \u0060Id\u0060 (2627 of 2628; unit: names in project openrig containing \u0060Id\u0060). Peers: DemoRigSummary.rigId (demo/scripts/common.ts:11); DemoNodeEntry.rigId (demo/scripts/common.ts:18); DemoNodeEntry.logicalId (demo/scripts/common.ts:20); common.getCurrentRigSummary(rigNameOrId) (demo/scripts/common.ts:83); common.listRigNodes(rigNameOrId) (demo/scripts/common.ts:92). Rename to \u0060sourceToolUseId\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/helpers/eval-rig-session.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdedd83dd58cb3521f9bbfe0b969b48f9a8baaf1c86da30e79007a81c883d677"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060toJSON\u0060 spells \u0060JSON\u0060 where 17 names in the project spell it \u0060Json\u0060: 17 of 18 names in project openrig spell the token \u0060Json\u0060 (17 of 18; unit: names in project openrig containing \u0060Json\u0060). Peers: claude-statusline-context.writeJsonAtomic (packages/daemon/assets/claude-statusline-context.cjs:117); activity-relay.parseJson (packages/daemon/assets/plugins/openrig-core/hooks/scripts/activity-relay.cjs:33); compaction-restore-bridge.parseJson (packages/daemon/assets/plugins/openrig-core/hooks/scripts/compaction-restore-bridge.cjs:31); restore-from-jsonl.readJsonLines (packages/daemon/assets/plugins/openrig-core/skills/claude-compaction-restore/scripts/restore-from-jsonl.mjs:48); gen-control-plane-json.generateControlPlaneJson (packages/daemon/scripts/gen-control-plane-json.mjs:25). Rename to \u0060toJson\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/test-system/delivery/harness/oracle.mjs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"90fdcc6559e42a85bf5cc9ecaa85c4afbd1625b565069282dea161dfc3b1fcbc"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022rig bundle install \u003Cpath\u003E\u0022 repeats the code it sits on: 4 of its 4 words (rig, bundle, install, path) are already in \u0060cmd.command(\u0022install \u003Cpath\u003E\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/cli/src/commands/bundle.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5cbb62c92e00144622395ea43e554500a2a746c263b42f715e89b0b21e6068"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022chatroom send \u003Crig\u003E \u0022message\u0022 [--sender \u003Cname\u003E]\u0022 repeats the code it sits on: 5 of its 6 words (send, rig, message, sender, name) are already in \u0060cmd\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/src/commands/chatroom.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"794351fa05e6c9950fed3724bd0eda27be65cb5aa5f4d8f3246fb2353183c582"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Replace existing managed block\u0022 repeats the code it sits on: 4 of its 4 words (replace, existing, managed, block) are already in \u0060const replaced = existing.replace(\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/src/commands/setup.ts"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b2f42869fe48ba4648c1232ea004d4e90d0055583cc5d2350b810a84dbc2d48"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022rig snapshot list \u003Crig\u003E\u0022 repeats the code it sits on: 3 of its 3 words (rig, snapshot, list) are already in \u0060cmd\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/src/commands/snapshot.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6aca117fca20e1d91ea54e66ecc519262c53a1959878cb75da53564fff5d58"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022POST /api/agents/validate\u0022 repeats the code it sits on: 4 of its 4 words (post, api, agents, validate) are already in \u0060if (req.method === \u0022POST\u0022 \u0026\u0026 url.pathname === \u0022/api/agents/validate\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/cli/test/agent.test.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db6dc1a5766d5f24c486125981b6499ec7fae2eb4ef99321f65e7fa6453cbed"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022T2c: deleted \u002B snapshot error -\u003E exit 2\u0022 repeats the code it sits on: 4 of its 4 words (deleted, snapshot, error, exit) are already in \u0060it(\u0022down deleted with snapshot errors exits 2\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/test/down.test.ts"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"637abb5ed6f5efd76ddcfdf31c4bbf501b3706d91bf7c950dd7a527b5088b9fe"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: 5 comments in this file only repeat the code they sit on (lines 119, 135, 142, 162, 180), for example \u0022POST /api/rigs/import/validate\u0022. 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/test/export-import.test.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"a08686449fd58135948e483839f05418c482ea9824911786a66eff6405f163e5"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022An internal caller sees every member\u0027s presence, as before.\u0022 repeats the code it sits on: 4 of its 5 words (internal, caller, member, presence) are already in \u0060expect((await internal.team()).hostedMembers.find((m: { session: string }) =\u003E m.session === CALLER)).toHaveProperty(\u0022pre \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/test/mcp-person-facing-names.test.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e50346e33ee86b4f57a3b790fb4c7df31389ec3f602a0c042de892ac7d8fcae"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: 5 comments in this file only repeat the code they sit on (lines 110, 1000, 1388, 1412, 1446), for example \u0022rig_add: posts the member fragment to the pod-members route.\u0022. 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/test/mcp-server.test.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba5ce36d7a3f8102fc7cad43fece04e85bf2e0cd4865af0afa1ab675836f684"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022dev1.design is the attention node\u0022 repeats the code it sits on: 4 of its 4 words (dev, design, attention, node) are already in \u0060const attentionNode = nodes.find((n: { canonicalSessionName: string }) =\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/test/ps-compact.test.ts"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"147bcec7c79a6bd09270f8136dbd0255ed7444c9b5fd1c47d61444d92965417e"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022POST /api/rigs/import/preflight\u0022 repeats the code it sits on: 5 of its 5 words (post, api, rigs, import, preflight) are already in \u0060if (req.method === \u0022POST\u0022 \u0026\u0026 url.pathname === \u0022/api/rigs/import/preflight\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/cli/test/rig.test.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea67c354c594b203ccd60875136bc9107ccb096dc9a4916d41551fe37d88776e"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022GHOST vs MISSING-ID DISTINCT\u0022 repeats the code it sits on: 4 of its 5 words (ghost, missing, id, distinct) are already in \u0060it(\u0022ghost and missing-id are distinct finding kinds\u0022, () =\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/test/scope-audit.test.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb7fc134df718274c8859516884c6159e16e021b5ff3006819a56a9d4a31dd0"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Close cited-manifest in place (deferred human output)\u0022 repeats the code it sits on: 6 of its 7 words (close, cited, manifest, place, deferred, human) are already in \u0060const closeManifestHuman = await runScope(\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/test/scope-slice-close-in-place.test.ts"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ab67e00991c03ae9e5978ed4369cecc0798d3efb0365811d223bd2f666151f"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check transcripts enabled\u0022 repeats the code it sits on: 3 of its 3 words (check, transcripts, enabled) are already in \u0060if (!this.deps.transcriptsEnabled)\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/daemon/src/domain/ask-service.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c80c56c7a6358f1e5facf5851e893124aa319c04adce77697f5f83371d28141"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Same-db-handle checks\u0022 repeats the code it sits on: 3 of its 3 words (db, handle, checks) are already in \u0060if (deps.bootstrapRepo.db !== deps.db) throw new Error(\u0022BootstrapOrchestrator: bootstrapRepo must share the same db hand \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/daemon/src/domain/bootstrap-orchestrator.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ade6d056814fa9e640477c77b866bf3205a4b0f6f060cbdc3182a41159e3c6a"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Write bundle.yaml\u0022 repeats the code it sits on: 3 of its 3 words (write, bundle, yaml) are already in \u0060this.fs.writeFile(\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/daemon/src/domain/bundle-assembler.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"26163f49e2fee29ef06b436a61e38c66e950a77a1295d4841f896b9307d04632"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Map all original refs to this resolved package\u0022 repeats the code it sits on: 5 of its 5 words (map, original, refs, resolved, package) are already in \u0060packageRefMap[entry.originalSource] = result.resolved;\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/daemon/src/domain/bundle-source-resolver.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"b207ef3fcc6e3b30f4c65c669d20b88903a15cb913447a6f25031b8422641eef"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Journal the rollback action\u0022 repeats the code it sits on: 3 of its 3 words (journal, rollback, action) are already in \u0060this.installRepo.createJournalEntry({\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/daemon/src/domain/install-engine.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"557426f28191758af970b6ac0501bb861c82b63bb2118b8533d07f1339737ab5"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Mandatory trigger: human-gate qitem arrival.\u0022 repeats the code it sits on: 5 of its 6 words (trigger, human, gate, qitem, arrival) are already in \u0060await this.dispatch({\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/daemon/src/domain/mission-control/notification-dispatcher.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ad159b3a7ae4de12e309d8d0d4869b4fc3d03a63f889212f0d19791800804f"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Session name from binding or logical id\u0022 repeats the code it sits on: 5 of its 5 words (session, name, binding, logical, id) are already in \u0060const sessionName = binding?.tmuxSession ?? binding?.externalSessionName ?? logicalId;\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/daemon/src/domain/node-cmux-service.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ab627b80918ff690d72fc97ce2c6875cfd215a72ab5c1ce14ba257047e11735"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Infrastructure startup command\u0022 repeats the code it sits on: 3 of its 3 words (infrastructure, startup, command) are already in \u0060let infrastructureStartupCommand: string | null = null;\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/daemon/src/domain/node-inventory.ts"},"region":{"startLine":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"1974dd0bcafd2060b69149d3da5d7be8d6bd50f442e60aa4602058a83e88e286"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Resolve to absolute path\u0022 repeats the code it sits on: 3 of its 3 words (resolve, absolute, path) are already in \u0060const absoluteRef = path.isAbsolute(sourceRef)\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/daemon/src/domain/package-resolver.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de5defd3165ba7611fcfe09793b419d7b784bdc5537bbc10c2fb1f8f1d46521"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022What the envelope replaces for this seat: a policy\u0027s posture and an ambient YOLO setting.\u0022 repeats the code it sits on: 7 of its 8 words (envelope, replaces, policy, posture, ambient, yolo, setting) are already in \u0060const replacedPosture = envelope ? [bindingPosture !== \u0022floor\u0022 ? \u0060the policy\u0027s ${bindingPosture} posture\u0060 : null,\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/daemon/src/domain/permission-account.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"b064676f8264112e39e94b48b23879cae7c73bfc19e54118769bd54ad24d83e6"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Member startup files\u0022 repeats the code it sits on: 3 of its 3 words (member, startup, files) are already in \u0060this.collectStartupFiles(member.startup, opts.rigRoot, opts.outputDir, collectedFiles);\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/daemon/src/domain/pod-bundle-assembler.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"f026d33ff316dd7ffa2e502b1f0a507c5e138bde391a1699fedbc7ef3e455323"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Resolve agent_ref\u0022 repeats the code it sits on: 3 of its 3 words (resolve, agent, ref) are already in \u0060const result = resolveAgentRef(member.agentRef, opts.rigRoot, this.fs);\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/daemon/src/domain/pod-bundle-assembler.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00da0d34b937a827b1d534343c145e4e4a69001c37c309d335034cc6c2831aa"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Replace the original ref with the vendored local: ref\u0022 repeats the code it sits on: 4 of its 5 words (replace, original, ref, local) are already in \u0060rewritten = rewritten.replace(mapping.originalRef, localRef);\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/daemon/src/domain/pod-bundle-assembler.ts"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"330ff7f60ab503926b29c84d2875b314814b234f50517625ca546f215444aae4"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check for import/import ambiguity in selected resources\u0022 repeats the code it sits on: 4 of its 5 words (check, ambiguity, selected, resources) are already in \u0060const ambiguityErrors = checkAmbiguity(config.selectedResources, collisions);\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/daemon/src/domain/projection-planner.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96291d419592de52780b870e06bdcd6e0c22fff6345bb12b27d4270dc795514"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Emit stopped event\u0022 repeats the code it sits on: 3 of its 3 words (emit, stopped, event) are already in \u0060this.deps.eventBus.emit({ type: \u0022rig.stopped\u0022, rigId });\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/daemon/src/domain/rig-teardown.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"93f041282259c11c27a71f59e7fa86d21254879f132d9f2b58f9339eb0647fbd"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Helper: get restorePolicy for a node\u0022 repeats the code it sits on: 4 of its 5 words (get, restore, policy, node) are already in \u0060const getRestorePolicy = (nodeId: string): string | undefined =\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/daemon/src/domain/rigspec-exporter.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c36cf86b28920b497206fbd15a672f521c8c74104fbca38eb31c750a16d2025"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Resolve agent ref\u0022 repeats the code it sits on: 3 of its 3 words (resolve, agent, ref) are already in \u0060const resolveResult = resolveAgentRef(member.agentRef, rigRoot, this.deps.fsOps);\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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":1693}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f2c557a88b982a31340f4b22034d35dce432ae65ae621b3db5bbbc2b89c3bc8"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Resolve agent_ref\u0022 repeats the code it sits on: 3 of its 3 words (resolve, agent, ref) are already in \u0060const resolveResult = resolveAgentRef(member.agentRef, preflightCtx.rigRoot, preflightCtx.fsOps);\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/daemon/src/domain/rigspec-preflight.ts"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cac6b1d9a530b72ee9c9a683c8e5f616e46b7e7b34f7ed8a44ef8f39082beb7"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022-- RigSpec review --\u0022 repeats the code it sits on: 3 of its 3 words (rig, spec, review) are already in \u0060export interface RigSpecServicesReview\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/daemon/src/domain/spec-review-service.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad64eced21f1c6f1c1cfdba45d37a6f38e829632d7524714538786be7f7d7624"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022-- AgentSpec review --\u0022 repeats the code it sits on: 3 of its 3 words (agent, spec, review) are already in \u0060export interface AgentSpecReview\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/daemon/src/domain/spec-review-service.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e8ab43fab73bc062b7f4910ba52f6e75e00a3d0fa8863337e5daf2c2e1499b"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Build node ID \u2192 logicalId \u002B sessionName map\u0022 repeats the code it sits on: 6 of its 7 words (node, id, logical, session, name, map) are already in \u0060const nodeMap = new Map\u003Cstring, { logicalId: string; sessionName: string | null }\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/daemon/src/domain/whoami-service.ts"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"177e920f48ea2f69c26132558c6bc3d48abdbe50622c8be808e853551913fb59"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022GET /api/adapters/tmux/sessions\u0022 repeats the code it sits on: 4 of its 5 words (get, adapters, tmux, sessions) are already in \u0060adaptersRoutes.get(\u0022/tmux/sessions\u0022, async (c) =\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/daemon/src/routes/adapters.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d83b419ee974de15f420f7a6c588815b24c8ba2053bc911279a710f5d21794b"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022POST /library/sync\u0022 repeats the code it sits on: 3 of its 3 words (post, library, sync) are already in \u0060router.post(\u0022/library/sync\u0022, (c) =\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/daemon/src/routes/context-packs.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2bea2755d1ac083f105b7c457f5aade30821e9ec80599914fc156ce9e97e67"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022POST /api/packages/:installId/rollback\u0022 repeats the code it sits on: 5 of its 6 words (post, packages, install, id, rollback) are already in \u0060packagesRoutes.post(\u0022/:installId/rollback\u0022, async (c) =\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/daemon/src/routes/packages.ts"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"455463b36335e4e83717af92d797718e3a4b4a1c083084adc9b98c034fae210f"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022GET /api/packages/:packageId/installs\u0022 repeats the code it sits on: 5 of its 6 words (get, packages, package, id, installs) are already in \u0060packagesRoutes.get(\u0022/:packageId/installs\u0022, (c) =\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/daemon/src/routes/packages.ts"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"c746fd903f09b0acc59de98a308b18d0cecbc2d6c07ba35e7fd765cc6699467b"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022POST /:qitemId/claim\u0022 repeats the code it sits on: 4 of its 4 words (post, qitem, id, claim) are already in \u0060app.post(\u0022/:qitemId/claim\u0022, async (c) =\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/daemon/src/routes/queue.ts"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f65a3e22c1a3252b60e4a14a58bcfe4ca373bc80dff1d09a69f0ba49ca44c3"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022POST /:qitemId/unclaim\u0022 repeats the code it sits on: 4 of its 4 words (post, qitem, id, unclaim) are already in \u0060app.post(\u0022/:qitemId/unclaim\u0022, async (c) =\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/daemon/src/routes/queue.ts"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a2e1d160ab2e9d8ca2453b4e8d89543f9f220b82d582424551d37f879601f0"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022POST /:qitemId/fallback\u0022 repeats the code it sits on: 4 of its 4 words (post, qitem, id, fallback) are already in \u0060app.post(\u0022/:qitemId/fallback\u0022, async (c) =\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/daemon/src/routes/queue.ts"},"region":{"startLine":1338}}}],"partialFingerprints":{"codehealthFindingId/v1":"c51d4be8cdda65c3247afc0b9bc6720a8ad608d605c67fc18f83fc7fd11742e9"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022POST /api/sessions/:sessionRef/unclaim\u0022 repeats the code it sits on: 5 of its 6 words (post, sessions, session, ref, unclaim) are already in \u0060sessionAdminRoutes.post(\u0022/:sessionRef/unclaim\u0022, terminalAuthGuard(), async (c) =\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/daemon/src/routes/sessions.ts"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bfc08dc84802511708d3471e337d12dca5c168fc6bdb729e11e14b2f1df4206"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022GET /:streamItemId \u2014 fetch one\u0022 repeats the code it sits on: 4 of its 5 words (get, stream, item, id) are already in \u0060app.get(\u0022/:streamItemId\u0022, (c) =\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/daemon/src/routes/stream.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"4782734c83709860fe4872539d0fa22333cc467ae4e4715c73dbbdb1001f4eaa"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022POST /:streamItemId/archive\u0022 repeats the code it sits on: 5 of its 5 words (post, stream, item, id, archive) are already in \u0060app.post(\u0022/:streamItemId/archive\u0022, (c) =\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/daemon/src/routes/stream.ts"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"d981cf6281b7f60d01c85651d362415e6da6a56019ef34ee884c8755f23a7437"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Insert continuity state\u0022 repeats the code it sits on: 3 of its 3 words (insert, continuity, state) are already in \u0060ctx.db.prepare(\u0022INSERT INTO continuity_state (pod_id, node_id, status) VALUES (?, ?, \u0027healthy\u0027)\u0022).run(pod.id, node.id);\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/daemon/test/agentspec-restore.integration.test.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"e778f2f121494e81b2dd4931e9690162ceb62106611b420bb0a24f67fb73b2fc"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check package_installs has bootstrap_id set\u0022 repeats the code it sits on: 5 of its 6 words (package, installs, bootstrap, id, set) are already in \u0060const installs = db.prepare(\u0022SELECT * FROM package_installs WHERE bootstrap_id = ?\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/daemon/test/bootstrap-orchestrator.test.ts"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b95c00b2fb0c05b6e1571328855b390c13f18145a62c1752639c1067461a89b"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Mock podInstantiator\u0022 repeats the code it sits on: 3 of its 3 words (mock, pod, instantiator) are already in \u0060const mockPodInstantiator = {\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/daemon/test/bootstrap-orchestrator.test.ts"},"region":{"startLine":1671}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1c3fbedca2327e509f308ca3d924aaf428fd6ad7bf74735c36eba5ff895e4a6"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Create .sha256 digest\u0022 repeats the code it sits on: 4 of its 4 words (create, sha, 256, digest) are already in \u0060const archiveDigest = createHash(\u0022sha256\u0022).update(fs.readFileSync(archivePath)).digest(\u0022hex\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/daemon/test/bundle-source-resolver.test.ts"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4aa43b1b3c338a94b4e89cff2df65563b7f186b597ef90411006d5c21197799"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Resolve via PodBundleSourceResolver.resolve()\u0022 repeats the code it sits on: 4 of its 5 words (pod, bundle, source, resolver) are already in \u0060const resolver = new PodBundleSourceResolver();\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/daemon/test/bundle-source-resolver.test.ts"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"6778a21e670254820852616d4459ffeac9a4f018678a8a25120f2dd9376f8678"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022The retiree\u0027s recorded R is the parent\u0027s too: a successor on it is no distinct fork, whatever the argv names.\u0022 repeats the code it sits on: 9 of its 10 words (retiree, recorded, parent, successor, no, distinct, fork, argv, names) are already in \u0060it.each([\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/daemon/test/claude-handover-recover.test.ts"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb4701dcb23727be59a0d07d3d7eab319a5e3254602e9620eede68e40e0c84b"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022sendText called before sendKeys\u0022 repeats the code it sits on: 4 of its 4 words (send, text, called, keys) are already in \u0060expect(sendText.mock.invocationCallOrder[0]).toBeLessThan(sendKeys.mock.invocationCallOrder[0]!);\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/daemon/test/claude-resume.test.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"430bd93eb4817ee9cd51a6953ba2568d9e560f6cfb67bed748499ae4a6269786"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Yolo member retains full_bypass\u0022 repeats the code it sits on: 4 of its 5 words (yolo, member, full, bypass) are already in \u0060expect(store.resolve(yoloNode.id, \u0022claude-code\u0022)).toEqual({\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/daemon/test/declarative-permission-modes.test.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d688d14337f72e8428382806650c028bd99b69ceab6da3ab80323234b41605"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check target paths\u0022 repeats the code it sits on: 3 of its 3 words (check, target, paths) are already in \u0060expect(skillEntries.find((e) =\u003E e.exportName === \u0022review/SKILL.md\u0022)!.targetPath).toContain(\u0022.claude/skills/review/SKILL. \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/daemon/test/install-planner.test.ts"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ffa2939b6d0f988ec8abba9cd9ce6ddf6ed7bb4ac5c67b060e80467d0f73a0a"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Persist a restore.completed event with this node failed\u0022 repeats the code it sits on: 5 of its 6 words (restore, completed, event, node, failed) are already in \u0060seedEvent(db, \u0022rig-1\u0022, \u0022node-1\u0022, \u0022restore.completed\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/daemon/test/node-inventory.test.ts"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ba08654dfe8b08a1c08dd35001841b457ba3f2d557ae06ef11faddb1e7d276"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022skill defaultScope defaults to project_shared\u0022 repeats the code it sits on: 6 of its 6 words (skill, default, scope, defaults, project, shared) are already in \u0060expect(manifest.exports.skills![0]!.defaultScope).toBe(\u0022project_shared\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/daemon/test/package-manifest.test.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"54aa108c67f7cddffbe74fe5ee8f6b831cc2127a2f12c842c11a83d037b0eb3b"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022skill supportedScopes defaults to [\u0027project_shared\u0027]\u0022 repeats the code it sits on: 5 of its 6 words (skill, supported, scopes, project, shared) are already in \u0060expect(manifest.exports.skills![0]!.supportedScopes).toEqual([\u0022project_shared\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/daemon/test/package-manifest.test.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"001982d600fe02b1171bb750b243e53d65d91adda4f934601e9a12e8f50e1c52"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022getPodsForRig\u0022 repeats the code it sits on: 3 of its 3 words (get, pods, rig) are already in \u0060const pods = podRepo.getPodsForRig(rig.id);\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/daemon/test/pod-repository.test.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"de0079d126f837dd78c0026d12ed108b76fdb1177b7140eccce4898c51a19aad"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022when set, the Nth post and every one after it fail before posting\u0022 repeats the code it sits on: 4 of its 5 words (set, post, fail, posting) are already in \u0060let failFromPost = 0;\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/daemon/test/quiet-hold-release.test.ts"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"570ccbae9d91839c53a84f18b5a67721a1dc835ca8c2e0d0d58df67027d40f57"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022OPR.0.3.4.5 \u2014 regression guards.\u0022 repeats the code it sits on: 3 of its 3 words (opr, regression, guards) are already in \u0060describe(\u0022OPR.0.3.4.5 regression guards\u0022, () =\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/daemon/test/restore-orchestrator.test.ts"},"region":{"startLine":6374}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0112e4f2ce8daf4184b4d9d61e8c96642bf8c7a1c54a8a67270c878b6c1d5e"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022includeArchived returns both\u0022 repeats the code it sits on: 3 of its 3 words (include, archived, returns) are already in \u0060expect(rigRepo.listRigs({ includeArchived: true }).map((r) =\u003E r.id).sort()).toEqual([active, archived].sort());\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/daemon/test/rig-archive.test.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f1000d9c68b4420f119118f987f5e7f567ff4d21f4a88fcf685837d0522f9d"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022archivedOnly returns only archived\u0022 repeats the code it sits on: 3 of its 3 words (archived, only, returns) are already in \u0060expect(rigRepo.listRigs({ archivedOnly: true }).map((r) =\u003E r.id)).toEqual([archived]);\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/daemon/test/rig-archive.test.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12beb33d9c06ae5ab59990ea47c3ffbb3a1a67f8098ac2934772e163a643a8e"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Expand with cross-pod edge\u0022 repeats the code it sits on: 4 of its 4 words (expand, cross, pod, edge) are already in \u0060const result = await service.expand({\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/daemon/test/rig-expansion-service.test.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eba36848c3af53c147f56686a294ba5d8ac9a13e0eb4acf2c101d6545cae596"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022L2 findLatestUsableSnapshot\u0022 repeats the code it sits on: 4 of its 4 words (find, latest, usable, snapshot) are already in \u0060describe(\u0022RigRepository.findLatestUsableSnapshot (L2)\u0022, () =\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/daemon/test/rig-repository.test.ts"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"d26c5d2971d3f41a48210475d8ea54a89898f383f1561b169afb0317bf4e7bc2"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022body prose intact\u0022 repeats the code it sits on: 3 of its 3 words (body, prose, intact) are already in \u0060expect(fs.readFileSync(readmePath, \u0022utf8\u0022)).toContain(\u0022body prose stays intact\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/daemon/test/scope-reapprove.test.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a5a97f3058757ea9da2eddc9360f83cc5fb29bd3bac7743232c9bedd3f9672"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Capture-confirmed branch: rendered-unconfirmed \u002B capture confirms exact probe text \u2192 clears\u0022 repeats the code it sits on: 9 of its 10 words (capture, confirmed, rendered, unconfirmed, confirms, exact, probe, text, clears) are already in \u0060it(\u0022clears on rendered-unconfirmed when capture confirms exact probe text\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/daemon/test/seat-attention-reconciler.test.ts"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"80982f904b317fa192ca6c47b96f27796cb22adac9005bfe62075145a218742e"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Failure event without requestedResumeToken and requestedResumeType\u0022 repeats the code it sits on: 6 of its 7 words (failure, event, requested, resume, token, type) are already in \u0060seedStartupFailureEvent(rig.id, node.id, session.id, {\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/daemon/test/session-transport.test.ts"},"region":{"startLine":4643}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ebd1a0ca9febd25897d85b14708e0db5f6cc442802c1c6763890ec16e0addd"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022The asker parks its own ask on the person it asked.\u0022 repeats the code it sits on: 4 of its 5 words (asker, parks, ask, asked) are already in \u0060f.repo.update({ qitemId: f.ask.qitemId, actorSession: ASKER, state: \u0022blocked\u0022, blockedOn: ANA, transitionNote: \u0022parked o \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/daemon/test/slack-self-parked-ask.test.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c9c05a2df51b2d7e10eb1e7a5d59bc633820edb53152126cc886a4878883f2"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022L3b: findLatestRestoreUsable\u0022 repeats the code it sits on: 4 of its 4 words (find, latest, restore, usable) are already in \u0060describe(\u0022findLatestRestoreUsable (L3b)\u0022, () =\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/daemon/test/snapshot-repository.test.ts"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"23562ea88a622cceb75f83edd3f340174fa772534dd6b0f45259722dea19f2da"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Write a new file\u0022 repeats the code it sits on: 3 of its 3 words (write, new, file) are already in \u0060writeFileSync(join(tmpDir, \u0022new-rig.yaml\u0022), VALID_RIG_YAML.replace(\u0022lib-rig\u0022, \u0022new-rig\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/daemon/test/spec-library-routes.test.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d79ad2729aef930a31d756af1e50f004c1369e1b910a7366f4f026edc12c3e6"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022build\u2192remediate and verify\u2192remediate, both on the \u0060failed\u0060 exit\u0022 repeats the code it sits on: 4 of its 5 words (build, remediate, verify, failed) are already in \u0060expect(branchEdges).toEqual(\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/daemon/test/spec-library-workflow-scanner.test.ts"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df1acbb7d096af1ffa18f8b189e17e1984ff929bd958dde11b73120844a1df6"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022While notification is held, emit a live item\u0022 repeats the code it sits on: 6 of its 6 words (while, notification, held, emit, live, item) are already in \u0060const liveItem = streamStore.emit({ sourceSession: \u0022test@s\u0022, body: \u0022Live item emitted while notification held\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/daemon/test/stream-intake.test.ts"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e33ce94a7946c91f9eb46cf5d6ba0401f937096a0dfce4805d5631c0502e43"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Emit critical item\u0022 repeats the code it sits on: 3 of its 3 words (emit, critical, item) are already in \u0060const item2 = streamStore.emit({ sourceSession: \u0022test@s\u0022, body: \u0022Urgent item note\u0022, hintUrgency: \u0022critical\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/daemon/test/stream-intake.test.ts"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bae703d1f3443aa832fbef67cb4dbf81dbb83622952aeab36cb70c93bb0f940"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022the cause is the trigger\u0027s transient\u0022 repeats the code it sits on: 3 of its 3 words (cause, trigger, transient) are already in \u0060expect(seen[cause]).toMatchObject({ transient: true, seq: trigger.seq });\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/daemon/test/view-changed-transient.test.ts"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"3582f9ba65e29be8625e963b25616c70fbfd35dc12ad61d0a0086da76531c2a6"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Each row has a transition_id (from queue_transitions).\u0022 repeats the code it sits on: 4 of its 5 words (row, transition, id, transitions) are already in \u0060expect(result.rows[0]).toHaveProperty(\u0022transition_id\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/daemon/test/view-projector.test.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"66068698a2cd6fe02d5124efb59946de6a6a1425321441c2691affc3adae5db4"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022The driver step fails \u2192 instance failed.\u0022 repeats the code it sits on: 4 of its 5 words (driver, fails, instance, failed) are already in \u0060await runtime.projector.project({\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/daemon/test/workflow-role-resolution.test.ts"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"f837ea4e15aea33fbceaf89a0516a86ae5be6e8012075a33c69d8fee83cc7aa3"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Plan/result state\u0022 repeats the code it sits on: 3 of its 3 words (plan, result, state) are already in \u0060const [planResult, setPlanResult] = useState\u003CPlanResult | null\u003E(null);\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/ui/src/components/PackageInstallFlow.tsx"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4d916fe08451543de0f7f625d98df9e09f4e7280fcd256699120f471bd05ad"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Mock EventSource\u0022 repeats the code it sits on: 3 of its 3 words (mock, event, source) are already in \u0060let mockEventSource: { addEventListener: ReturnType\u003Ctypeof vi.fn\u003E; close: ReturnType\u003Ctypeof vi.fn\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/ui/test/global-events.test.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"04105a2b3ef8b938dc348fb769f1ce7d073fabb8481fb3dccd5a3d07a48e57a9"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022api/files/roots\u0022 repeats the code it sits on: 3 of its 3 words (api, files, roots) are already in \u0060if (url.includes(\u0022/api/files/roots\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/ui/test/p5-mission-discovery.test.tsx"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0a37513bd4f3271522ec5ae60d341dfe4ff5b9ba5ca74744b5bf27c3432ff3"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060packages/daemon\u0060 (236808 LoC, 3069 module-visible types across 46 directories) overshoots its size bounds. 5 of 6 build unit(s) (npm) overshoot their size bounds, lowering Project Cohesion to 0.0/10. 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":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/package.json"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f881ec67dbf325524615117bb3088f246c563c7f40f600858fce6b8be448ce"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060packages/cli\u0060 (61147 LoC, 537 module-visible types across 11 directories) overshoots its size bounds. 5 of 6 build unit(s) (npm) overshoot their size bounds, lowering Project Cohesion to 0.0/10. 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":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/package.json"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31cb3d6067889e48a9f3f5829a7289b02ce33f99f5a581f9aaddf3d2ac00637"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060packages/ui\u0060 (47636 LoC, 703 module-visible types across 32 directories) overshoots its size bounds. 5 of 6 build unit(s) (npm) overshoot their size bounds, lowering Project Cohesion to 0.0/10. 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":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/package.json"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b7addaa7815d187b2adeaafc2d0d178d3b1ea8b2641428a0c4d70ffe84e80c"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060packages/tui\u0060 (14643 LoC, 234 module-visible types across 16 directories) overshoots its size bounds. 5 of 6 build unit(s) (npm) overshoot their size bounds, lowering Project Cohesion to 0.0/10. 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":[{"physicalLocation":{"artifactLocation":{"uri":"packages/tui/package.json"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b611253db875f406448a6062d1901a06537ff04aa9e83aff07bc7c0608a0b0"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060(repository root)\u0060 (11756 LoC, 71 module-visible types across 11 directories) overshoots its size bounds. 5 of 6 build unit(s) (npm) overshoot their size bounds, lowering Project Cohesion to 0.0/10. 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":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa2d5244dbb9040f0ef9a41721fc246c38399605a5b233c47266a2093207fec1"}},{"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":"b60baf7d48ab0f0a9bb571b00862eafc75476d4f0e744d72b91f373e33adf947"},"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":"dc60ce01d3aff30effbdb463a864b6c7d42883dc71c985096aba947194df5c30"},"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":"3cc667e018d59bb9ea150d9842a6c37ce66bfa62205e47137031de4031c468a4"},"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":"97167f8356917288f456cb46910527e5a14dc3f4df758d2b740647b014624ecc"},"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":"03493803166246d0b220296efde56477acfd31c88625869207ccc33cacb892da"},"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":"879ed544bc0133b3867720f0483b214180350e0ef66996bfdf08b69ef0e214ef"},"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":"cd660f89193412d711c0f00b8377bb20b4b5cae5a4aa7c182e3c0733d42549aa"},"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":"a0b1a91a13614c77daefc6ab075ab11c3348a8d96da8f3dbbcda50f848143fcf"},"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":"6de467cfc4e1c5982cfa74cc71c0147d4006e5695924961d3d314989b98506eb"},"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":"893c4775b7a9b9fc9b5024101cde008b99c991f7e26d181937bb282b2175deb3"},"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":"de2973994733572409a9066e832e74cd361217c643967c8fcaedc49dcae57bb7"},"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":"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":"07c2898cde54080f441e8cd29ca524db533d1a2f2125460be173f35be029b8c7"},"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":"e651cdbfcf724646e6e5ae556eb476d35c357903853a7c07d252a5fe337aeccd"},"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":"65e398f4b4fef711e3b5d953171a14ee44181873a5f7d0714c2603295ddfc6bc"},"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":"d7fb7415a86f8db0ebcf493aa9770fa73083ed07272ff5fded5c37fd13ad7db3"},"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":"804541dcad9628f55c85cee7d781fa496ca617283ca9c1fcacaa5c0f126b3b09"},"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":"a286cb5bd5919dad36ff40f5bbd97140564cb95ffc8121a6fc1909e5581b65c4"},"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":"b4bfc492e29f1065d6a78fdda34cc7d308fdbcdde9a67cb3b7bcf4002b99e60b"},"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":"ac5763ffdd871a091458b2a2a75cf020f2ae8db3692906af4811e03d9508b8de"},"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":"a438eca89fffe829b0141a996e27b0854ee300c05f47c5ec747522b7c168c2ad"},"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":"e5f01bc5eb323671c279c9069de09078226bae0ed65df886ca25079d35445018"},"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":"aea14ab0a6e2bb8ced032c9499f30c773ce68560e79d4a3b41f845665beb9b56"},"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":"c6ec3d640d7df0dc7ab48da98ef0d905731785410cbd6cb27b33fa2874075e78"},"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":"67a511801fda8d82666afc2de4ed314834228d62ac94c17298b2433d6bae2cce"},"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":"7d4debd006eb6c6905903801df1988667c3d648fc1522d28db6d2ed862098a75"},"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":"7645e0a02345f34f32db4f32047721616ec582f17420e46ac1dcabd73a49a8e0"},"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":"ff34a8e5f092b7bb6a2a7ceabfafd77f36acfc1167ad4a078c6ab12cb0e224ce"},"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":"34fd417964b126f2dedf066effad309ad91c1c37b90078d9cd395abd8b1658d4"},"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":"44dd4a5f9f567cc2a395d1330cecf8efeac1c3da9f802727f08d57831135b58d"},"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":"8f28d2fa90e8ea732bb4e8de1bd93f32210052fda2e47defce0d588520c5d27d"},"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":"278979fe30f3733429e992d0b92afe444fa7d65d496f7143900e4a8f280f3311"},"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":"f338b8877dc03e89343562ace2fc9ebd2302b30ea7369254d4c0778aeba08ff6"},"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":"e03b1a795f9081689a12d55034bf4a7125635458ac677b004409a7eaf8f03f98"},"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":"890e9ff0518977cb063175fb9126e19b7a8cb3799996236af037b0a940180918"},"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":"ee24e7cf6dff70112781d3d41aa3e5fcad88f7ee3680941ca172fa270e3f860d"},"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":"e2ae21c48a21f355d2e4e071dffbb72f03eced0b310798811b4b0fd62bf8eee6"},"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":"354287398c1941da198bb02dcff6a0b406f2f7682d20da261800a0e95284da29"},"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":"93a57b733b7e59e51c57f841a33ddb7fb36a1c08deaf6c8075c4e449bcbbc3cc"},"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":"85a59edf6c0fb78dccc45e34cf966e38f7172d1431defc4cd4a054c32f10afc8"},"taxa":[{"id":"CWE-125","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":"ff42e28f76e5dc36ac2ae8dd995ae639e2c646cbfc0641771c9c20362022b06a"},"taxa":[{"id":"CWE-125","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":"4401d17f5a26a3d34c384b8bc523fc62578545f81d91f14c2aa4c0608afbd54c"},"taxa":[{"id":"CWE-125","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":"0c4c04130ab3b79c1285a3df0a932a1af5456c72bec8a89360141a7261224323"},"taxa":[{"id":"CWE-125","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":"4e469b543ecb87f0aa0ba0dc544b475964cffca6f43a9ab9b4bae710c6afb2c4"},"taxa":[{"id":"CWE-125","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":"68a93d53c88c02b3f5163efb48a08504503cae3e19ddaafeb11e8a0797c5b07a"},"taxa":[{"id":"CWE-125","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":"988cf691636ae27b93348f32cd2e193170b686a1f4192a807e5b4ec3b500492e"},"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":"d5c1699742ac3c60271cb1f9f04634bc155ee6b8bde7317da282b9b4cbac9afd"},"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":"5519fb8c5dccd1f41ed11b6fe5563999e6ac490d711f3ae0a2f04e221cd82e0e"},"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":"057fc3648f15940faa98c546f6ad4458646ed668de816dacf8b8aa33f8f4913e"},"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":"a7262069c4e2e7ffb56674c12050b52908b5d703d7c15fadfe52266a444727dc"},"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":"b052da1b1fd5f6e4f527ef19ab336f40c383baa67423af5728d5a539833c0502"},"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":"558c63362c9642acfe217946f04531f9da40d8b3b51c08667ee4336f2341c686"},"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":"daeb6c7f258d15b88c79a4b89a08c62b3de7db4eef8978fe05d7e4ef37295c1c"},"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":"cb6dab06308b959efcb4074f5debcc786cf313127357f4752031bfba5afc2d0e"},"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":"7a5a3bc5aa9befe947bd7eaae3b97dc2c344775de185a318d1253c3899951350"},"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":"ad6a74e757f4669afb7193ce9936fc50e17778b3d9bad26f4715a393410eab89"},"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":"c5ca69eea1c26d6de1130d5c4d2d5ba930f01fb3eb7b52b7c73c60c4c01512b1"},"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":"44a2543b0bf6b621b2dbbfd6b72fc73be905927313e7b0035bf65cc4b6d2aef7"},"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":"4e7e8e72d91a4e942ee3b3403c88f1e80a239fb44ff7eddae5a479b3c17a9f1f"},"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":"ef9ef48834c14388b0852fb621c4fc93df3e65377c52a1f3ba69fe85fb343b24"},"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":"86826892b5b2edd48cd28d6b8767ef418885e2edca9b1713e1ab337a91b1246f"},"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":"62d6e1613ce408de1f1649ebdcebbcaa86198016e909c57f2313f2fe8fbc4399"},"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":"8b13b48ed686694dd09de9bbd291366cfffbcd97e3cc6e0a0801952c0c54bc6f"},"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":"24fcbaf07bb12e738eb9bc5cd67dea27a358f5f7928d94a04ba6dde430fd09d3"},"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":"49c98bb3d5bf5255db7772ee5b52309d5c498e1ea8f07ffdfd0d06c40e0bb17c"},"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":"2bc341f790fca658c702ea2d1f2ec97271faaea1e4dfdd1cae250fbe8136c9fb"},"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":"6270624b58c6d34a1617bd023d9839859cbb7388bf31a361e9dea2e624e2f478"},"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":"bd029c5271a4a7990ae799d65d37baea712a27c572235222977de98125a41d96"},"taxa":[{"id":"CWE-209","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":"0d677f83aa14f3463aabb0c817494a60e064b35d6c52b27e5877ac145f98816e"},"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":"1e3b131c96e7cd8159a7960eeb7d2bba652600ed11f7d13d0d5236ba62f929da"},"taxa":[{"id":"CWE-209","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":"876933daec19c1dc3eca70fbde8c442cc3d5af18252ba462a1b531ed9ecec5ab"},"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":"d069aa377ca9c1cd275c5d38480230e8909102c8933a0500d57c7924fd0535b3"},"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":"2e3ac341f5545f2c6ec8d02a463a4e49c253ecf5cbc3defbb2e4973635a3fd7c"},"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":"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":"56f679a63a7a207f4c15b77c563b50f3d118bf0fa7f355a5844ae1f3076a42e1"},"properties":{"dependency":{"package":"seroval","version":"1.5.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"critical","fixedVersion":"1.5.3","relation":"transitive","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":"1b422d7d2acf4ec86c8855b185b5bb8a76f746739db2b625b71467e001072cde"},"properties":{"dependency":{"package":"tar","version":"7.5.13","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"critical","fixedVersion":"7.5.19","relation":"direct","declaredRange":"^7.5.13","reachability":{"kind":"production","file":"packages/daemon/src/domain/bundle-archive.ts","line":13}}}},{"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":"384a0892f51a77ce6e1097a5154e203805ee2ad75d30693634ca5b796c0008c6"},"properties":{"dependency":{"package":"browserslist","version":"4.28.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"4.28.7","relation":"transitive","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":"2567ea2f56ae79977dadd3bf380bcb8e0d5204997d0db598b3e49e1891ff5525"},"properties":{"dependency":{"package":"fast-uri","version":"3.1.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]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"3.1.3","relation":"transitive","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":"a59d8b1453f784b335dd86e14fce5925604dbea6330bfc74d7748c50a4a540ea"},"properties":{"dependency":{"package":"hono","version":"4.12.8","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]","[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]","[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]","[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]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"4.12.25","relation":"direct","declaredRange":"^4.7.0","reachability":{"kind":"production","file":"packages/daemon/scripts/probe-health-calibration.mjs","line":12}}}},{"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":"a2e781aeeb54d3ae845ae518d9f9b4fabc9ce4afb31ec2d5eceab2c30473e850"},"properties":{"dependency":{"package":"nanoid","version":"3.3.11","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"3.3.16","relation":"transitive","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":"3e02f053898a35c81dd3976f70f76fbfb4f273ee92432eacacd848db60698976"},"properties":{"dependency":{"package":"picomatch","version":"4.0.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"4.0.4","relation":"transitive","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":"a1e03b14734319d875bd0dac1f97ef300c97b23c9a470ff6af28213112e543c4"},"properties":{"dependency":{"package":"postcss","version":"8.5.8","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"8.5.12","relation":"direct","declaredRange":"^8.5.8","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":"a143e49def50f6267786be10dea52190e0d09245364207bf6c8be5fcae3b49ff"},"properties":{"dependency":{"package":"source-map-js","version":"1.2.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"1.2.2","relation":"transitive","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":"b694dace86fb7d15873b2ddd65002632093db12bc6146d23cde087273cc549f5"},"properties":{"dependency":{"package":"vite","version":"6.4.1","advisory":"[GHSA redacted]","aliases":["[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]"],"severity":"high","fixedVersion":"6.4.4","relation":"direct","declaredRange":"^6.0.0","reachability":{"kind":"production","file":"packages/ui/vite.twin.config.ts","line":7}}}},{"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":"5ccda73bd0143d5fffd3dfb7039e432d604944b26bd87c7e38e3f0435928ff6c"},"properties":{"dependency":{"package":"ws","version":"8.20.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"8.21.0","relation":"transitive","reachability":{"kind":"test-or-tooling","file":"packages/daemon/test/browser-boundary-listener.test.ts","line":10}}}},{"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":"87acedc051cb89a8ce4b5f36de7264e8d1c5c5fd3ed662cda178e80e0c31f9d8"},"properties":{"dependency":{"package":"zod","version":"4.3.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"high","fixedVersion":"4.6.6","relation":"direct","declaredRange":"^4.3.6","reachability":{"kind":"production","file":"packages/cli/src/commands/import.ts","line":4}}}},{"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":"398c201d1d5c575cbc8e91dfa73ba9fb901e97985774812cb5d46a5cd46ef9e6"},"properties":{"dependency":{"package":"@hono/node-server","version":"1.19.11","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"medium","fixedVersion":"1.19.13","relation":"direct","declaredRange":"^1.13.0","reachability":{"kind":"production","file":"packages/daemon/scripts/probe-health-calibration.mjs","line":13}}}},{"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":"43427bab5dea8e4a9974d0d31081f6cee7984ed96dc960bd2c33af06bc12237b"},"properties":{"dependency":{"package":"baseline-browser-mapping","version":"2.10.10","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"2.11.0","relation":"transitive","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":"c4d9031c1ae994de0fc0586545ba87ce80b5d47785a3ede4de6ae529b86b830c"},"properties":{"dependency":{"package":"postcss-selector-parser","version":"6.1.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"medium","fixedVersion":"6.1.5","relation":"transitive","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":"d1a4b1960e029a108d3935b6d1d28c8e87e48a9fef0e276c8c7e74afde168e3e"},"properties":{"dependency":{"package":"smol-toml","version":"1.8.0","advisory":"[GHSA redacted]","severity":"medium","fixedVersion":"1.9.0","relation":"direct","declaredRange":"^1.8.0","reachability":{"kind":"production","file":"packages/cli/src/provider-auth.ts","line":2}}}},{"ruleId":"D30","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":"2d7c8846e5c2786ac6f200262a5ae377f0a0f36f03fcc336f877638db9b57f15"},"properties":{"dependency":{"package":"@babel/core","version":"7.29.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"low","fixedVersion":"7.29.6","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"3681e0b0dced2dca00be692922bda4012adb5a0234c1d22c53a13969ab5dd823"},"properties":{"dependency":{"package":"esbuild","version":"0.27.4","advisory":"[GHSA redacted]","severity":"low","fixedVersion":"0.28.1","relation":"transitive","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":"30df4b1fbac9f96d8be08abd6794ed7507ddde8f6ea7711df83da4de8c5cc8d1"}},{"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":"b7beff71a30b83b7347611b8f81e21d2bf8de6645812b2501d257871de0ecc8c"}},{"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":"39a3f07e3c29fe4a2ebddaccc1e3d89e364f7f4caa21144724174d018ba7f893"}},{"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":"8f86916140b7796a63486b7555b5baab3277db38bdf002f9ff8924ec788500f5"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: seat.ts \u2194 seat-status-service.ts: \u0060packages/cli/src/commands/seat.ts\u0060 (context cli) and \u0060packages/daemon/src/domain/seat-status-service.ts\u0060 (context daemon) sit in DIFFERENT parts of the tree yet change together 71% of the time (10 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u0060a5bda7fd\u0060 feat(daemon): seat status shows guidance written after the agent load\u2026; \u00606e85d4ad\u0060 feat(daemon): seat status shows what a seat\u0027s refocus hook has record\u2026; \u00604168fb46\u0060 Show sanitized permission request observations in seat status (#2562) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/commands/seat.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a931210d79e1d5802c6ab7b71cc01a780c5d5378eef3290329d21cb4e54bee0"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: config.ts \u2194 config-model.ts: \u0060packages/cli/src/commands/config.ts\u0060 (context cli) and \u0060packages/tui/src/config/config-model.ts\u0060 (context tui) sit in DIFFERENT parts of the tree yet change together 62% of the time (15 of the 24 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 15 shared commits counted here, the most recent 3 are \u006072ccfd03\u0060 feat(tui): read a remote rig\u0027s seats in the topology view behind ui.t\u2026; \u00609e004f2a\u0060 feat(daemon): erase queue content for closed-work retention and accou\u2026; \u00605e5b328e\u0060 perf(daemon): prune the history-only event types from events (retenti\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/commands/config.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b717a4365cbcff401831de161e0887fd1d47f0a06a769a57a8928fa09cfcea47"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: provider.ts \u2194 provider.ts: \u0060packages/cli/src/commands/provider.ts\u0060 (context cli) and \u0060packages/daemon/src/routes/provider.ts\u0060 (context daemon) sit in DIFFERENT parts of the tree yet change together 58% of the time (7 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u006092ef6321\u0060 fix(daemon): a provider switch keeps the running effort instead of re\u2026; \u00601de69844\u0060 feat(provider): rig provider switch --seat moves one Codex seat to a \u2026; \u006044222396\u0060 feat(provider): subscription move reports the Fleet app and the manag\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/commands/provider.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c138073637e6e8a9954798470ec5cf8042d5de686b2f44021a56bf7c77770f8"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: host.ts \u2194 hosts.ts: \u0060packages/cli/src/commands/host.ts\u0060 (context cli) and \u0060packages/daemon/src/routes/hosts.ts\u0060 (context daemon) sit in DIFFERENT parts of the tree yet change together 58% of the time (11 of the 19 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are \u0060fc2ec997\u0060 fix(pairing): show the requesting machine\u0027s self-description quoted e\u2026; \u0060f3a3b171\u0060 fix(ssh): avoid passive TCP probes in host status (#2979); \u0060adb5555f\u0060 fix(cli,daemon): separate ssh\u0027s options from the target with -- (#2973) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/commands/host.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe20a70be14304ef50e4a479257c2d4b07c5eb99b2be1a482c62471e1569e8e"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: health-detectors.ts \u2194 health-model.ts: \u0060packages/daemon/src/domain/health-detectors.ts\u0060 (context daemon) and \u0060packages/tui/src/health/health-model.ts\u0060 (context tui) sit in DIFFERENT parts of the tree yet change together 55% of the time (6 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060f027fdeb\u0060 fix(health): preserve available findings when one source fails (#626); \u006071e66bfa\u0060 fix(daemon): evaluate the busiest ceremony families past the family l\u2026; \u00600fcdc5bc\u0060 Add scoped human-led and delegated operating posture \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/health-detectors.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e993a6854029c98cd4077a396c00e04d301400f67916b1a7a12beea06258d82a"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: startup.ts \u2194 health-model.ts: \u0060packages/daemon/src/startup.ts\u0060 (context daemon) and \u0060packages/tui/src/health/health-model.ts\u0060 (context tui) sit in DIFFERENT parts of the tree yet change together 55% of the time (6 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060f027fdeb\u0060 fix(health): preserve available findings when one source fails (#626); \u006071e66bfa\u0060 fix(daemon): evaluate the busiest ceremony families past the family l\u2026; \u00600fcdc5bc\u0060 Add scoped human-led and delegated operating posture \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/startup.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4bfd9b01689f62388d0720d14635c17b4d082b8829970c894a793a7a0f56172"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: up.ts \u2194 up.ts: \u0060packages/cli/src/commands/up.ts\u0060 (context cli) and \u0060packages/daemon/src/routes/up.ts\u0060 (context daemon) sit in DIFFERENT parts of the tree yet change together 52% of the time (17 of the 33 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 17 shared commits counted here, the most recent 3 are \u00607c262e67\u0060 fix(daemon): show each seat\u0027s restore permission in the plan previews\u2026; \u0060f81d38f2\u0060 feat(cli): rig up \u003Cspec\u003E --name \u003Crig\u003E launches a spec under a chosen \u2026; \u00602456a572\u0060 fix: make bundle reinstalls actionable and preserve stopped-team edit\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/commands/up.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9caa391279c2b5b4938d5437bf15942766fb44fd2ecdc3e057e66c5ff1b283b9"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: hydrate.ts \u2194 sections.ts: \u0060packages/tui/src/hydrate.ts\u0060 and \u0060packages/tui/src/sections.ts\u0060 change together 100% of the time (12 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 12 shared commits counted here, the most recent 3 are \u0060778355b6\u0060 feat(tui): fleet Projects view across registered hosts (implements #3\u2026; \u0060d8fb6ea9\u0060 feat(tui): System \u2192 Cost, each seat\u0027s reported cost beside its tokens\u2026; \u00606448f6bf\u0060 feat(tui): System \u2192 Usage \u00B7 all hosts, the registered hosts\u0027 usage wi\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/tui/src/hydrate.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c9f9a86ed5ccdb94767048d095b0d4b681ec4eaf9b96bd654c0d8f981930f0"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: daemon-client.ts \u2194 sections.ts: \u0060packages/tui/src/daemon-client.ts\u0060 and \u0060packages/tui/src/sections.ts\u0060 change together 92% of the time (11 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are \u0060778355b6\u0060 feat(tui): fleet Projects view across registered hosts (implements #3\u2026; \u0060d8fb6ea9\u0060 feat(tui): System \u2192 Cost, each seat\u0027s reported cost beside its tokens\u2026; \u00606448f6bf\u0060 feat(tui): System \u2192 Usage \u00B7 all hosts, the registered hosts\u0027 usage wi\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/tui/src/daemon-client.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"536b9f0b30603386e3559eb3bc6a478e4da97d505c5eeded3530ef590d04e012"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: registry.ts \u2192 daemon-client.ts, hydrate.ts, sections.ts: \u0060packages/tui/src/commands/registry.ts\u0060 changes together with 3 other files \u2014 \u0060packages/tui/src/daemon-client.ts\u0060, \u0060packages/tui/src/hydrate.ts\u0060, \u0060packages/tui/src/sections.ts\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/tui/src/commands/registry.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade566ac8d067180eb371b9d7dcbc21a90d20518f938a730b9e3c3222ad40fb0"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: community-harness-presets.ts \u2194 startup-orchestrator.ts: \u0060packages/daemon/src/domain/community-harness-presets.ts\u0060 and \u0060packages/daemon/src/domain/startup-orchestrator.ts\u0060 change together 82% of the time (9 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u0060d5832cd9\u0060 feat(harness): community harnesses can declare protocol: pi-rpc (fini\u2026; \u00600ccd0132\u0060 feat: add observed OpenShell lifecycle and exact native restore (#2300); \u00609924040b\u0060 feat(daemon): a community harness can take the seat\u0027s declared model \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/community-harness-presets.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1abe6322aff7b1288c3019b86434d6813f0910017abff5efc08953bd4174ef46"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: ProjectTreeView.tsx \u2194 ScopePages.tsx: \u0060packages/ui/src/components/project/ProjectTreeView.tsx\u0060 and \u0060packages/ui/src/components/project/ScopePages.tsx\u0060 change together 82% of the time (9 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u006098ae3754\u0060 VM-005 (release-0.4.7): mission-status reconciliation \u2014 one status, e\u2026; \u0060cd6d592a\u0060 fix(ui): refine library and project density; \u00601c4b8921\u0060 feat(ui): single-row density for project slice list items (slice 19) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/project/ProjectTreeView.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff2bf408f334928591b8a7ac6175e234915ecb7cb7da59c9ced60cdd10ab51b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: navigator.ts \u2194 stylize.ts: \u0060packages/tui/src/navigator.ts\u0060 and \u0060packages/tui/src/stylize.ts\u0060 change together 77% of the time (10 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u0060fa0c05b9\u0060 fix(tui): size table cells in terminal columns, not string length (#3\u2026; \u0060f3a3b171\u0060 fix(ssh): avoid passive TCP probes in host status (#2979); \u0060b22c9794\u0060 fix(tui): distinguish observed rig presence on topology landing \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/tui/src/navigator.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49dae453e53bf6cd8ae7a8dd9350d877006053f6480742dd9bd30821e03f50e"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: demo-data.ts \u2194 hydrate.ts: \u0060packages/tui/src/demo-data.ts\u0060 and \u0060packages/tui/src/hydrate.ts\u0060 change together 75% of the time (9 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u0060b22c9794\u0060 fix(tui): distinguish observed rig presence on topology landing; \u00600e43967a\u0060 feat(tui): PULSE lane selection \u002B drill-in \u002B compact-seat form [pulse\u2026; \u0060dbc0e057\u0060 feat(tui): PULSE lanes LIVE \u2014 NOW / JUST FINISHED / UP NEXT \u002B live fo\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/tui/src/demo-data.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08e4fb9ef4e93e2331cd124c4e756a75dc143820040dca3cdb247b60109ac94"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: claude-code-adapter.ts \u2194 claude-resume.ts: \u0060packages/daemon/src/adapters/claude-code-adapter.ts\u0060 and \u0060packages/daemon/src/adapters/claude-resume.ts\u0060 change together 67% of the time (24 of the 36 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 24 shared commits counted here, the most recent 3 are \u0060eb67b30d\u0060 Slice 13: Claude wake-ups through a launch-owned hook bridge (opt-in)\u2026; \u00609c99d12b\u0060 fix(daemon): apply a Claude seat\u0027s token when its pane doesn\u0027t read a\u2026; \u00603d1f2f9b\u0060 fix(daemon): preserve Claude launch during token switches (#2853) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06da94fced99147bb0f87e26496f6f6590992bfcc824c9e9b8b26fc74ffe29fd"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: all-migrations.ts \u2194 queue-retention.ts: \u0060packages/daemon/src/db/all-migrations.ts\u0060 and \u0060packages/daemon/src/domain/queue-retention.ts\u0060 change together 62% of the time (8 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u00609e004f2a\u0060 feat(daemon): erase queue content for closed-work retention and accou\u2026; \u00605e5b328e\u0060 perf(daemon): prune the history-only event types from events (retenti\u2026; \u00604c34d13c\u0060 feat(daemon): record which MCP grant\u0027s caller acted (principal:v1) (#\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/db/all-migrations.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c195c3c50f17a6b4525dba5fd79f5981c2ea3d68151e80d462feb5837fcd637b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: codex-resume.ts \u2194 codex-runtime-adapter.ts: \u0060packages/daemon/src/adapters/codex-resume.ts\u0060 and \u0060packages/daemon/src/adapters/codex-runtime-adapter.ts\u0060 change together 61% of the time (19 of the 31 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 19 shared commits counted here, the most recent 3 are \u0060a1dd3333\u0060 feat(daemon): support per-seat Codex filesystem policies (#3085) (#3108); \u006009781df0\u0060 fix(codex): keep OpenRig\u0027s command folder on managed seats\u0027 tool PATH\u2026; \u0060db90c6da\u0060 feat: resume explicitly reviewed history by node ID (#2109) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/adapters/codex-resume.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bedfcb829ccb48a70d37796c3772e00a16abbaaf4f31236e4deacda98af7a59"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: RigNode.tsx \u2194 HybridTopologyNodes.tsx: \u0060packages/ui/src/components/RigNode.tsx\u0060 and \u0060packages/ui/src/components/topology/HybridTopologyNodes.tsx\u0060 change together 60% of the time (9 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u0060d0d8fad6\u0060 fix(activity): keep current usage limits visible (#1185); \u006002c3df37\u0060 fix(ui): distinguish pane_heuristic from hook-grade activity source (\u2026; \u0060af705c6a\u0060 fix(ui,daemon): surface activity source at dot consumers \u002B fix stale \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/RigNode.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2787098a44af227835dd2dc0d9f27afa73460975f99ed069929fa3ccde86f7c4"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: codex-runtime-adapter.ts \u2194 pi-runtime-adapter.ts: \u0060packages/daemon/src/adapters/codex-runtime-adapter.ts\u0060 and \u0060packages/daemon/src/adapters/pi-runtime-adapter.ts\u0060 change together 59% of the time (13 of the 22 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 13 shared commits counted here, the most recent 3 are \u00605f31cb57\u0060 fix(daemon): refresh stale managed guidance blocks, never overwrite a\u2026; \u0060267bde02\u0060 fix(daemon): a seat\u0027s own role as an auto-hinted startup file goes to\u2026; \u0060e33d722a\u0060 fix(daemon): a seat\u0027s legacy role guidance never merges into shared g\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9df9e724fa7ca1d88a8228bee3ecd7ce996b4bdfb504bbacdc40e3482e64b16"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: claude-code-adapter.ts \u2194 pi-runtime-adapter.ts: \u0060packages/daemon/src/adapters/claude-code-adapter.ts\u0060 and \u0060packages/daemon/src/adapters/pi-runtime-adapter.ts\u0060 change together 59% of the time (13 of the 22 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 13 shared commits counted here, the most recent 3 are \u00605f31cb57\u0060 fix(daemon): refresh stale managed guidance blocks, never overwrite a\u2026; \u0060267bde02\u0060 fix(daemon): a seat\u0027s own role as an auto-hinted startup file goes to\u2026; \u0060e33d722a\u0060 fix(daemon): a seat\u0027s legacy role guidance never merges into shared g\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41f47fcd84151cc3a7bb3aa1304d412d1e36c300c395483a887c8bef557232e"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: input.ts \u2194 render.ts: \u0060packages/tui/src/input.ts\u0060 and \u0060packages/tui/src/render.ts\u0060 change together 56% of the time (9 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u006012059e75\u0060 Preserve filtered Specs caller on Back; \u0060986a24a6\u0060 Make workflow progress and spec consumers navigable in the TUI; \u00607ce65399\u0060 feat(tui): surface canonical fleet health \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/tui/src/input.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9067d3897c532abaac79ea49208205491cce5c4a016438ac6625c248c3713cc0"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: community-harness-presets.ts \u2194 runtime-adapter.ts: \u0060packages/daemon/src/domain/community-harness-presets.ts\u0060 and \u0060packages/daemon/src/domain/runtime-adapter.ts\u0060 change together 55% of the time (6 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u00600ccd0132\u0060 feat: add observed OpenShell lifecycle and exact native restore (#2300); \u00609924040b\u0060 feat(daemon): a community harness can take the seat\u0027s declared model \u2026; \u0060802d44a2\u0060 feat(daemon): pass community first input at launch (#1987) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/community-harness-presets.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f37f5e9c2f8e4a728cdf53555f370e56a3bc078d3b8766d47b5d5ce9f3dcd31"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: demo-data.ts \u2194 state.ts: \u0060packages/tui/src/demo-data.ts\u0060 and \u0060packages/tui/src/state.ts\u0060 change together 50% of the time (6 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060dbc0e057\u0060 feat(tui): PULSE lanes LIVE \u2014 NOW / JUST FINISHED / UP NEXT \u002B live fo\u2026; \u0060ef57bc2c\u0060 feat(tui): PULSE \u25CC PARKED WITH BATON \u2014 LIVE premature-park join [puls\u2026; \u00602ee2bfec\u0060 feat(tui): PULSE Exceptions strip LIVE \u2014 NEEDS YOU \u002B BLOCKED ON AGENT\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/tui/src/demo-data.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77841603565f62a8839c4a2864ecd5c1362b624f23e6bf830a308375f466c713"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: community-harness-runtime-adapter.ts \u2194 types.ts: \u0060packages/daemon/src/adapters/community-harness-runtime-adapter.ts\u0060 and \u0060packages/daemon/src/domain/types.ts\u0060 change together 50% of the time (6 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060d5832cd9\u0060 feat(harness): community harnesses can declare protocol: pi-rpc (fini\u2026; \u00600ccd0132\u0060 feat: add observed OpenShell lifecycle and exact native restore (#2300); \u00609924040b\u0060 feat(daemon): a community harness can take the seat\u0027s declared model \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/adapters/community-harness-runtime-adapter.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d344541f4357b887e6b45f58a3b7cadffdca78dd47bd95896fee0d5aa6c01f"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: storytelling-cards.tsx \u2194 Feed.tsx: \u0060packages/ui/src/components/feed/cards/storytelling-cards.tsx\u0060 and \u0060packages/ui/src/components/for-you/Feed.tsx\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u006014234dcf\u0060 feat(for-you): wire ApprovalCard to real data; remove ConceptCard fro\u2026; \u0060f609d060\u0060 fix(daemon,ui): durable status-backed storytelling filter \u002B commit Ch\u2026; \u0060ac3df45f\u0060 feat(daemon,ui): getting-started complete-and-hide (slice 18 Checkpoi\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/feed/cards/storytelling-cards.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b12d286d7269ae4e2bc084cc6c3fe6f97cb0c4cc95091593d8ced315f06e2d"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cvideo\u003E without a captions track: Video with no captions \u003Ctrack\u003E offers no captions. This player\u0027s source is set at runtime, so there is no caption file to author here: give the player a way to carry captions \u2014 accept a track/captions URL alongside the media and render a \u003Ctrack kind=\u0022captions\u0022\u003E when one is supplied \u2014 and capture that asset wherever the media enters the product (upload, import or generation)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/review/EvidenceOpener.tsx"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b96416bc4a66c0c9c8d22408bcd5e18922f45f117cd976a2fefab8310839ee"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cvideo\u003E without a captions track: Video with no captions \u003Ctrack\u003E offers no captions. This player\u0027s source is set at runtime, so there is no caption file to author here: give the player a way to carry captions \u2014 accept a track/captions URL alongside the media and render a \u003Ctrack kind=\u0022captions\u0022\u003E when one is supplied \u2014 and capture that asset wherever the media enters the product (upload, import or generation)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/review/SliceReviewTab.tsx"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e308a9867133bb92992bfd63578f423a95377f2b73d1e7c479b59a431e4325"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cvideo\u003E without a captions track: Video with no captions \u003Ctrack\u003E offers no captions. This player\u0027s source is set at runtime, so there is no caption file to author here: give the player a way to carry captions \u2014 accept a track/captions URL alongside the media and render a \u003Ctrack kind=\u0022captions\u0022\u003E when one is supplied \u2014 and capture that asset wherever the media enters the product (upload, import or generation)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/slices/tabs/TestsVerificationTab.tsx"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b1b1860a447f3ed3609b77cb9f9bbd605e82664101d6554c87eebda13b2966"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CTextarea\u003E field component without a label: This UI-library field component is named only by a placeholder \u2014 a placeholder is not a label (it vanishes as soon as the user types, and many assistive technologies ignore it). Give it a real name whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/AgentSpecValidateFlow.tsx"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac25891c2360c1c2dcbc12cb9fdf161c6a3fb45f5c9aec9cffa297d40c03683b"}},{"ruleId":"AC2","level":"error","message":{"text":"Custom control with no accessible name on \u003Cdiv\u003E: This \u003Cdiv\u003E carries a click handler, which makes it a control, but it has no text, aria-label or labelled child (the icon-only case), so assistive tech has no name to announce for it. Note that switching it to \u003Cbutton type=\u0022button\u0022\u003E \u2014 the right fix for its keyboard operability \u2014 does not give it a name either: an icon-only button still needs one. Add visible text or an aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/AppShell.tsx"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb8ef740b3cfb916c465606d40a6d30a4aafdc757ec0b5770c1ef1c6f25638b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/BootstrapWizard.tsx"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a64251fc4f22f6ff61748767222a14d301623f2adc8d06ecc9b088ebcee76f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/BundleInspector.tsx"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"22718701d6f115d0ad51bf722dbac7c94d96c341c4805eefc2c44439c8fc554a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/BundleInspector.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f0474389658522b57d5583de1f7be74f2e4f409148147c0716db5122844064"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/BundleInstallFlow.tsx"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"139dcd8917dd7998d5f8095747587973f7cfa1e383b529e5a232973594383d0e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/BundleInstallFlow.tsx"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"8911bc09b36812ef1a38a60d7390e65fcd5010f220eb3635546e65cc121cc2b7"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/BundleInstallFlow.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"eda96bef3af28e4b6c85efe29c74639e7aa62885499ae1d429d72838ab74f956"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/BundleInstallFlow.tsx"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"3574d041c2b8b5cfbacb5c65b875ef4a34643c08b6ebceb34dfd86fe1db41cfc"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/DiscoveryOverlay.tsx"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"0579fe08d7a10a7e4343f7948989af20b0b59222fa7c0ce59465d58fa4cefa0a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/DiscoveryOverlay.tsx"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"016eceea9a5c9f364574fa6d90f41e54f2b46c54b95bd3fe9837ed7439aa54a2"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/DiscoveryOverlay.tsx"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6413ffcaf06243bb4c177e7a6f730e6db8a5c5348cc7639f27e34c6de5ed0b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/DiscoveryOverlay.tsx"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"99cfd169c58d3af168000e6aebc338c1c3c26781401eba1ea1e4344d52fdb906"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CTextarea\u003E field component without a label: This UI-library field component is named only by a placeholder \u2014 a placeholder is not a label (it vanishes as soon as the user types, and many assistive technologies ignore it). Give it a real name whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/ImportFlow.tsx"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b901aed0a1df4c6028d84e05ed4c94304ca3b4dd425aac0f09cb2536a9d92f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/ImportFlow.tsx"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c90f7b235e0f51daa8b9fafd02385763bca6cd41f15dc89beacfd5e83c14f58"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/PackageInstallFlow.tsx"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad2645f403f7994fd203ec5346c7a3676e2211fe634d819b441cf4c12ba385b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/PackageInstallFlow.tsx"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"61dde5bad499ffd9f721a72ff41cd2dbbb30cb0e15db3b3e28459c215c1b5c2f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/PackageInstallFlow.tsx"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"2972b4fdbc89b33eb37eb1ac6fe85664879ce3b7a808d639839eb186f3e7c590"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/PackageInstallFlow.tsx"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"93f90fe4d6208d0a0d06829bfd56b9e56358ec39aee1cb387001a77cc6b4a566"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/PackageInstallFlow.tsx"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d787bc7b56d521b88500fa22f2272d241c07b96315bc39ef4ddb0df3c24a46f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/PackageInstallFlow.tsx"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c038358308bfb8009f9cecbd86ff72fe07cfe4082176f137fb48d6841697ad"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/PackageInstallFlow.tsx"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"365daec5b9061a4bad915cd20c31f55a325fd028b58a762d6adb95005e1d133e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/PackageInstallFlow.tsx"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"d598cd27ecb764448b89b15196918836a884a5e12865eb745574f631c88283e5"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/PackageInstallFlow.tsx"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e265ad39e6804b24e743848aa62145fffcb618d2897d65538ee6f67512caf87"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/PackageInstallFlow.tsx"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"64cdc47e65e2f6090443bc3da5a4c7b51df7ebdcbb3e8a0f058dcb92dee7e397"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/RigChatPanel.tsx"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"a371f2cd67de5a3bd30c826f4802e3f5ce6af310ff452cbdb537ee23f8933f6e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/dashboard/HostConfigCard.tsx"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a1532bc9e93fca38ac85200a68a5d4dd8f67c63af62bbfb2eb99d96b2a4ad0"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/dashboard/HostConfigCard.tsx"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b84be6738276d2dd6bd3809c6ff54f26309a51f60aad2d5026dcdb2076ef2e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/files/FilesWorkspace.tsx"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee202f87444c1fe6932534e139c8a1b275b7f9d45939b4af956ab30b97a0438c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/mission-control/components/VerbActions.tsx"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"823c2cd0f02f7c17c08c51d9f1b54ac7af0dc975de95fcf3faac4684f97ffc23"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/mission-control/components/VerbActions.tsx"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac22b189b81ea28cb37fd0dd9a4a16352915cbc3fd80abe3be44a9d49e1a05e6"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/mission-control/components/VerbActions.tsx"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"75393d571c9cfb958bf5f83d411431dd3342d38727607474a5b2f22bca638aa8"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/mission-control/views/AuditHistoryView.tsx"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"baed1f1c766557c7aa5bcc20e0d8c4d8099ec8f6c8481b856608cecc9eb02cf7"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/mission-control/views/AuditHistoryView.tsx"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb8795f12f6b88a25210d2c676cb14a2e4857a173240fd7f932003950e818ff5"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/mission-control/views/AuditHistoryView.tsx"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b44b8356d864ad72c0b6455c787500b14b65e0bf0915882114d39e77d5e980"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/review/TranscriptDrillPanel.tsx"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"2feebf669fe13802c2db5d313ec49a86f9571ea99f63d8c759f49ff21b01e9ca"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/slices/tabs/DecisionsTab.tsx"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"216615dba5cf6e869841833b9f4461e09551f7c42e091bc5cc9fd9ce8a346c2b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/slices/tabs/DecisionsTab.tsx"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b4c052405a2b16eb994604e77b9989560321ad79d9ad424be93f5200c6329f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/slices/tabs/DecisionsTab.tsx"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31a4e474231d8a6971280c8b22bb9b10ad01a6516137f1eef90fd7df19fe25b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/system/SettingsTab.tsx"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"772e716c6ae35afa20a8d814b5974669143b4ffdcd49ec4d8e614cf38c532156"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0} \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/AppShell.tsx"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"227150df1d9f07a6610d8d4c3697623b5d7fd40d0c9d30707c8373b9a9d5990d"}},{"ruleId":"AC4","level":"warning","message":{"text":"Modal dialog does not manage focus: This \u003Cdiv role=\u0022dialog\u0022\u003E is a modal dialog, but nothing moves focus into it when it opens and nothing keeps focus inside it while it is open, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native \u003Cdialog\u003E opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/project/Lightbox.tsx"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb11f9b2f91a1c0fd3555ed9658cfe3e45ea641e51c2c15173c8d54c930c43a"}},{"ruleId":"AC4","level":"warning","message":{"text":"Modal dialog does not manage focus: This \u003Cdiv role=\u0022dialog\u0022\u003E is a modal dialog, but nothing moves focus into it when it opens and nothing keeps focus inside it while it is open, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native \u003Cdialog\u003E opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/project/ProofImageViewer.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"45cf847a3949e03192e2fc30646a7752d46d6775931ab2212511e1f64c374be7"}},{"ruleId":"AC4","level":"error","message":{"text":"Clickable element isn\u0027t keyboard-operable: The repo\u0027s own CSS styles .sg-cnode with \u0060cursor: pointer\u0060, so this \u003Cspan\u003E is a control \u2014 but it has no role, no tabIndex={0} and no key handler, so it can only be reached with a mouse. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0} \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/project/StoryGraph.tsx"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"216096acc42be918220cda28498b52a156e4f407cb8c4769bc2adefaf478b8e6"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cimg\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0} \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/review/SliceReviewTab.tsx"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a20f45986cadafd035f760e45ed7f4c4e4123eb76a8cf9b7758e7dc3d22e00"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cth\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0} \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/topology/TopologyTableView.tsx"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86ad5a77a5ddfa5bf89e58b03b5bd9821ce0dd82dc9f27511c53d9a26e766cb"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Ctr\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0} \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/topology/TopologyTableView.tsx"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"c001cfa6463c021b0aaed51174bac0a4fb23862ae7623c3d634b5d4cbcd800ca"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/BundleInspector.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d78bbd56f0adaeee3a994ada8b534635ee95f4893dca0cfab4a31e80dafa730"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/BundleInstallFlow.tsx"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"6805174e92e6fd2d358361ec4a8e168cddab0350e10bff981e4291dd6f488544"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/BundleInstallFlow.tsx"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eaf423cec866fe932020c2a1e1249f8d233238e283422630bc3e6561afd7b01"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cselect\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/DiscoveryOverlay.tsx"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"08923bedf534e8e6ea0dfb9a09c49ed7f564cdcbc28a89628dcf73ac97d68d0b"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/DiscoveryOverlay.tsx"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"6208bd54a3d69d1250b0f2bea7153ca501db11dc64ddf807ad6ab9ee19058bfc"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/DiscoveryPanel.tsx"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c05bf8f571243591ec72677a942e76d568691fbc107e25a652640ce910fbb6"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/PackageInstallFlow.tsx"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed15d0fa20e8a765c4c30fcaeea5ee01d90d04360f61218be84baed4143b762"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cselect\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/PackageInstallFlow.tsx"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1e9c05e900dea8d8f18ce3e025e274ca8c1d1a2e8f107a7185b6aab7e42988"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/PackageInstallFlow.tsx"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd4fce761776623979630b708338c5b58f352b5a11f0881a2329f2fdb10a0ce"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cselect\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/PackageInstallFlow.tsx"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab05371f7770f449589f6da45c3ea92f4504727d6a03ee8ede18fe1aad3b2fd6"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Ctextarea\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/files/FilesWorkspace.tsx"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f74b802c60ca6b91ec0428d2f7b1f7b5719b6d5647342bd853cd922a11fa05"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.3:1): \u0060.sg-cnode.sg-self\u0060 sets color: #b9822f on background-color: #fff \u2014 3.3:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/project/StoryGraph.css"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"637a885dfde68d72e4620c384f7003ab8a7bb5304e6d217f7a69f7254226e744"}},{"ruleId":"C1","level":"warning","message":{"text":"No data-protection/encryption: No encryption usage (node:crypto createCipheriv, Web Crypto subtle.encrypt, crypto-js AES, tweetnacl/libsodium secretbox, a column-encryption layer such as typeorm-encrypted, prisma-field-encryption or mongoose-field-encryption, or MongoDB client-side field-level encryption) was found, and this repository persists personal data in the model cited here \u2014 sensitive data at rest may be unprotected. If TDE/KMS/vault is delegated to infrastructure, ignore."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/provider/provider-account-readings.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"44063b757c861be8a40f55d8f5a8b2e9ae230b1871ee36df0885c18e40faa4a3"}},{"ruleId":"C2","level":"warning","message":{"text":"Anyone can act as another user by changing what their browser sends: Here who is asking is taken from the \u0027piSessionId\u0027 request header (const piSessionId = stringOrNull(body.piSessionId)) and nothing checks it: no signature, no server-side session, no verified token. Cookies, headers and form or address values come from the visitor\u0027s browser and they can change them, so anyone can put another person\u0027s id there and be treated as that person \u2014 no password needed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/routes/activity.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2993c23be34b505c7272b784ef48c1d5406951ad5f9afe96b37fecd3a2f25aa"}},{"ruleId":"C2","level":"warning","message":{"text":"Anyone can act as another user by changing what their browser sends: Here who is asking is taken from the \u0027actor\u0027 form field (const identity = requireSenderIdentity(c, {verb:\u0022record a delegated decision\u0022, bodyClai\u2026) and nothing checks it: no signature, no server-side session, no verified token. Cookies, headers and form or address values come from the visitor\u0027s browser and they can change them, so anyone can put another person\u0027s id there and be treated as that person \u2014 no password needed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/routes/queue.ts"},"region":{"startLine":1307}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e594b203042c08d8a23475c2c82efd6ca531ca48daf30b93dc06acc1f017fda"}},{"ruleId":"C2","level":"warning","message":{"text":"Anyone can act as another user by changing what their browser sends: Here who is asking is taken from the \u0027X-Target-Rig-Id\u0027 request header (const targetRigId = c.req.header(\u0022X-Target-Rig-Id\u0022)) and nothing checks it: no signature, no server-side session, no verified token. Cookies, headers and form or address values come from the visitor\u0027s browser and they can change them, so anyone can put another person\u0027s id there and be treated as that person \u2014 no password needed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/routes/rigspec.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"68900c7e3a8c464c91012d5524008576899a2acef8d697d504e474d132da095e"}},{"ruleId":"C2","level":"warning","message":{"text":"Anyone can act as another user by changing what their browser sends: Here who is asking is taken from the \u0027permission\u0027 query parameter (const permissionDiagnostics = c.req.query(\u0022diagnostics\u0022)===\u0022permission\u0022) and nothing checks it: no signature, no server-side session, no verified token. Cookies, headers and form or address values come from the visitor\u0027s browser and they can change them, so anyone can put another person\u0027s id there and be treated as that person \u2014 no password needed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/routes/whoami.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"190876ebba7da8d37542f7d4820ad002331057b128909cbb24d6c91d2c475365"}},{"ruleId":"C3","level":"note","message":{"text":"Partial audit-trail evidence: An audit mechanism is present, but the trail is not yet complete \u2014 missing: an ORM write hook every change flows through (a TypeORM/MikroORM subscriber, a Sequelize or Mongoose hook, Prisma middleware or a query extension, or an event-store append), per-model coverage (@Audited, or a change-history plugin such as mongoose-history or sequelize-paper-trail applied to each model)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"274a04e524f3228d241c99316455563739cb06cfd10a01e446d00b8a14956083"}},{"ruleId":"C4","level":"note","message":{"text":"Partial data-retention evidence: A retention mechanism is present, but the data-lifecycle is not yet complete \u2014 missing: a scheduled purge / cleanup job (a cron task that deletes rows past their retention \u2014 purgeExpired\u2026 / deleteOld\u2026)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e6c843eccaff7ffcfe5241125b74768c2364055ab6678b12b10d47f44086afa4"}},{"ruleId":"C5","level":"note","message":{"text":"Erasure leaves personal data in a data store: An erasure path exists (erasureLedgerPath at packages/daemon/src/index.ts:158), but this repository writes personal data to a store (\u0027email\u0027 on a SQL INSERT in \u0027provider_account_readings_next\u0027) and the removals here (truncate text at packages/ui/src/components/ActivityFeed.tsx:70, \u2026) reach other stores. When a subject\u0027s data is erased, the records in that store survive it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/db/migrations/134_claude_token_readings.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac34c0f5b30ed1897cff009fa02a53c7aafa4490510848ceaa2e130062118d6"}},{"ruleId":"C5","level":"note","message":{"text":"Partial data-subject-rights support: Corroborated rights: erasure \u2713 \u00B7 export \u2717 \u00B7 consent \u2717. Each tick means this scan found code in the repository implementing that right \u2014 a deletion/anonymisation path for erasure, a data-export or portability path for export, and consent state recorded alongside the personal data it authorises. A \u2717 therefore means no such code was recognised HERE, not that the right is unsupported: a capability provided by a platform, a manual runbook, or code spelled in a way this scan does not match is not visible to it. Confirm before treating a cross as a gap; where it is one, the right has to be fulfilled manually."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4f30fc8e725e23f01c9d247a7d5d9dbfb00ef6c5536867cbc625b447fb7951f2"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: active-lens-store: \u0060packages/daemon/src/domain/active-lens-store.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/active-lens-store.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc7b060b99a6f8775d66854fab2dc3d13f2a953b9f5e61057109f94a5db1679"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: activity-endpoint: \u0060packages/daemon/src/domain/activity-endpoint.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/activity-endpoint.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda92af372e2fa3abb2ffeb509e6856278581dbba7cec0e4a33bdf21eeac0827"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: activity-grants: \u0060packages/daemon/src/domain/activity-grants.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/activity-grants.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"017d69b19835738cf77226be4325c51d9d960702287a53f5708745d024ea1fc6"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: agent-activity-store: \u0060packages/daemon/src/domain/agent-activity-store.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/agent-activity-store.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad6e9734dfa011afb2e6a60f2589abdd978093060b8dc8f3d4f4929c2398c3cc"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: agent-image-library-service: \u0060packages/daemon/src/domain/agent-images/agent-image-library-service.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/agent-images/agent-image-library-service.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"68877be6d2577dcdafbe84e8aeb4725a7cc415cf15d982fd827251b6cbdd03bf"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: agent-image-library-service: \u0060packages/daemon/src/domain/agent-images/agent-image-library-service.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (dynamic import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/agent-images/agent-image-library-service.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"d888c0ffe7162554949d15e36e3f655c3b5b335ba6bfa9469c9708acfe673a36"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: evidence-guard: \u0060packages/daemon/src/domain/agent-images/evidence-guard.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/agent-images/evidence-guard.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a521a5d4a29230adf1a21f849aab55002d7b444eb615f1904249473286735c4"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: evidence-guard: \u0060packages/daemon/src/domain/agent-images/evidence-guard.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (dynamic import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/agent-images/evidence-guard.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b5f6b33cab5fbe9aee32637a67b8dff42140003989cac03b1249d0c1d9dbf3"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: resume-token-discovery: \u0060packages/daemon/src/domain/agent-images/resume-token-discovery.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/agent-images/resume-token-discovery.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"c13a4b85d807c7a82b87f55552184bf294bef06f99c3a2329f9d0c84eb1f885e"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: snapshot-capturer: \u0060packages/daemon/src/domain/agent-images/snapshot-capturer.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/agent-images/snapshot-capturer.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4a1d45766bb810607a4efcdca3bf1e37572085b5c71d2da9184faf1e9d4266"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: agent-starter-resolver: \u0060packages/daemon/src/domain/agent-starter-resolver.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/agent-starter-resolver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e860a8affe5519f95150501568771447e9ed99b9d00f6e2c8f0b747634095dd"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: applied-launch-observation-store: \u0060packages/daemon/src/domain/applied-launch-observation-store.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/applied-launch-observation-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1764c5ddc1062134c541e2b95c3e2844a1492698068a35e99faf81641edf601f"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: bootstrap-orchestrator: \u0060packages/daemon/src/domain/bootstrap-orchestrator.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/bootstrap-orchestrator.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6e1c7ec4d56f624c877192de5dc0491d6cb0b6393d535cafc67d18b0825a55"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: bootstrap-orchestrator: \u0060packages/daemon/src/domain/bootstrap-orchestrator.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/bootstrap-orchestrator.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad170d1f1c7db72255f362980352d86d7ca6a70cf337f4373c0691a8f46dd2a"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: bootstrap-repository: \u0060packages/daemon/src/domain/bootstrap-repository.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/bootstrap-repository.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"093c21dd74f3eaacd2ac6a90ced0c674363e2033d4638fbfef00952e67731729"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: builtin-policy-reference: \u0060packages/daemon/src/domain/builtin-policy-reference.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/builtin-policy-reference.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9c6e40361f5efe016929498cca8821aa0ed9b502195d53b599f4b61617fe2b"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: builtin-startup-files: \u0060packages/daemon/src/domain/builtin-startup-files.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/builtin-startup-files.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"8832ffedbde84f98a8c71812a7147ac23693566c51b19c7e50834b60ec66537f"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: builtin-startup-files: \u0060packages/daemon/src/domain/builtin-startup-files.ts\u0060 (domain layer) depends on \u0060../openrig-compat.js\u0060 (import of \u0060packages/daemon/src/openrig-compat.ts\u0060) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/builtin-startup-files.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d6df541463843380ff121c19f38ecd5ae421bbc070e067b7d114c4856086529"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: bundle-archive: \u0060packages/daemon/src/domain/bundle-archive.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/bundle-archive.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3641a2833598bfe0f433fc191fde30db6781eb9985d0a1c5a6656c58f2f516"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: bundle-behaviour-inspect: \u0060packages/daemon/src/domain/bundle-behaviour-inspect.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/bundle-behaviour-inspect.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"370a9a2281506972af42381cc1d946c91f48dfe082a5aa8cc5da7b009eead04b"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: bundle-carried-context-pack: \u0060packages/daemon/src/domain/bundle-carried-context-pack.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/bundle-carried-context-pack.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d561ef6535cb9fff2a0c458e374ea1c77c6a6dbe771fdcb2d9aade2f5bbe6a59"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: bundle-carried-project: \u0060packages/daemon/src/domain/bundle-carried-project.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/bundle-carried-project.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7293b3b0cbca4814b394d53c4031cde5033e2e7327596c16a123a225ea2fa88"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: bundle-content-routing: \u0060packages/daemon/src/domain/bundle-content-routing.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/bundle-content-routing.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d44e682f792c320c0ede85e5829f343d62b43f0d52eb2bee55b8c8cfc2276b4"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: bundle-content-routing: \u0060packages/daemon/src/domain/bundle-content-routing.ts\u0060 (domain layer) depends on \u0060../openrig-compat.js\u0060 (import of \u0060packages/daemon/src/openrig-compat.ts\u0060) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/bundle-content-routing.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b3404639b1cb19cfa2000b3b39f375df3097b4b7b0c828a9bf788a5a15d33e"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: bundle-install-context: \u0060packages/daemon/src/domain/bundle-install-context.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/bundle-install-context.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08abe21794f02a004ca4f3adc882f5ef03b78a39078cea0173a72dccc8078518"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: bundle-install-context: \u0060packages/daemon/src/domain/bundle-install-context.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/bundle-install-context.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4cd781c900586caca9bdd454f17e8fbf67531862809165a118fbc90f1503232"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: bundle-source-resolver: \u0060packages/daemon/src/domain/bundle-source-resolver.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/bundle-source-resolver.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7757de1ca31c0d55d7db44766fa061c27fce237f7d219d492ede072ad78c259"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: bundle-source-resolver: \u0060packages/daemon/src/domain/bundle-source-resolver.ts\u0060 (domain layer) depends on \u0060../openrig-compat.js\u0060 (import of \u0060packages/daemon/src/openrig-compat.ts\u0060) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/bundle-source-resolver.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ce0d33478acdb70eb2db0952cf63059bef175cb9602dd48012b6c616ed1da7"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: chat-repository: \u0060packages/daemon/src/domain/chat-repository.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/chat-repository.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e912048b4b4bed345655069c815173c7e98a56aec804c97cca35a727eecc68b1"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: checkpoint-store: \u0060packages/daemon/src/domain/checkpoint-store.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/checkpoint-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84eae933896da0b7c860de70124cc0530f6dbb5da47e5999252e0d9020c050c8"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: claim-service: \u0060packages/daemon/src/domain/claim-service.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/claim-service.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"e25c4c0d1aea5c34d83d5b0a4edd9e8cf0d3da845c013208547269f6b9302701"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: classification-attempts: \u0060packages/daemon/src/domain/classification-attempts.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/classification-attempts.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee14f14a7d5cfd52d79b86ab6f011cd83f49a03cf250003df130e7fcc0103a0c"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: classification-sources: \u0060packages/daemon/src/domain/classification-sources.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/classification-sources.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab04558d90aca0602445504b2dada9c107a4d6b7c6f1eda9b7373a45ab5260da"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: classification-sources: \u0060packages/daemon/src/domain/classification-sources.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/classification-sources.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad4f79ed70444582971b43259d743cd07598161b602c9efccc620ae342d33ddd"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: classifier-lease-manager: \u0060packages/daemon/src/domain/classifier-lease-manager.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/classifier-lease-manager.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b008b5172b968342c3f0e09e4d102364631c75648d606c371c60a5ef4a3a98"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: claude-activity-hooks: \u0060packages/daemon/src/domain/claude-activity-hooks.ts\u0060 (domain layer) depends on \u0060../openrig-compat.js\u0060 (import of \u0060packages/daemon/src/openrig-compat.ts\u0060) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/claude-activity-hooks.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"a105837c33e323138a362980bfe5a4bfb4cfa64de9e021cd7751f22f51b4c654"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: claude-auto-mode: \u0060packages/daemon/src/domain/claude-auto-mode.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/claude-auto-mode.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de4e56167c3c88f7b97206369d427a845ce23ab49a14c45d2d8f476e54a01881"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: claude-compaction-enforcer: \u0060packages/daemon/src/domain/claude-compaction-enforcer.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd64a3296a0935ad80fd8990a39ae8e5d8d1b88055ce959c4dde77ded118f3f"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: claude-core-plugin-env: \u0060packages/daemon/src/domain/claude-core-plugin-env.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/claude-core-plugin-env.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5997ad2dd51db8768390ee2340213051e0d2f4e24c4f4e2d36d608fa7603079"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: claude-core-plugin-env: \u0060packages/daemon/src/domain/claude-core-plugin-env.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/claude-core-plugin-env.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff9ddcd1bc1444a32c0eeee0b07a93537dc5481b991e70581d35bfce28f3da2b"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: claude-core-plugin-env: \u0060packages/daemon/src/domain/claude-core-plugin-env.ts\u0060 (domain layer) depends on \u0060../openrig-compat.js\u0060 (import of \u0060packages/daemon/src/openrig-compat.ts\u0060) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/claude-core-plugin-env.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a307fb67df4c95a7cec7a463e8a666023b5d577a2877576bda5194a17926077"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: claude-credential-precedence: \u0060packages/daemon/src/domain/claude-credential-precedence.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/claude-credential-precedence.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"67561f0716a8b11a4132726b8126031e3bbb414e3a6d8eef4b426ed02cd44d0e"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: claude-git-trust-root: \u0060packages/daemon/src/domain/claude-git-trust-root.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/claude-git-trust-root.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f734faf7829f161eddb121ce2d56c14935c488d7041c7339c8276791e1fe990"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: claude-managed-launch: \u0060packages/daemon/src/domain/claude-managed-launch.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/claude-managed-launch.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"567fd878b8308faf5aef86eab9dabde80004d08e77e0e48230f20c291af0b15b"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: claude-managed-launch: \u0060packages/daemon/src/domain/claude-managed-launch.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/claude-managed-launch.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"e279a867907d271ffe724e3b92a3bdfb6a03db9068e5702a6442b77d9ddf607b"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: claude-mcp: \u0060packages/daemon/src/domain/claude-mcp.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/claude-mcp.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f20f0ff85b0ec5707df9c3ccc7a5b6e92eb12fd9dd0270210d6a482cbb33dd"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: claude-owned-settings: \u0060packages/daemon/src/domain/claude-owned-settings.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/claude-owned-settings.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fbf9766eb280b8b13f3d07900af578370bc600c76ff8564178d0f1c58860f18"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: claude-permission-rules: \u0060packages/daemon/src/domain/claude-permission-rules.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/claude-permission-rules.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b0e62227091f7dc2ccfbc7381219b5fe0902c47086f438df30ed5fd86c4d1a3"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: claude-seat-token: \u0060packages/daemon/src/domain/claude-seat-token.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/claude-seat-token.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"b551c7f23740368c6106fd2b77d9c79896f292919d93750682c8fca4f053aa99"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: claude-seat-token: \u0060packages/daemon/src/domain/claude-seat-token.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/claude-seat-token.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b3f814e714131cd8cc2838b5f3123648aa61117ef0a6d8c9103947d248338d"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: codex-auth: \u0060packages/daemon/src/domain/codex-auth.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/codex-auth.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ef5c348bad5b3ac0091ed439cf766849748ac792fecfd3eecef191eb0c9624"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: codex-daemon-support: \u0060packages/daemon/src/domain/codex-daemon-support.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (dynamic import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/codex-daemon-support.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ca590d27baf799071de80ac5cbac3ce7cee0b3c22e10195529d1f8c36f5650"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: codex-git-add-dirs: \u0060packages/daemon/src/domain/codex-git-add-dirs.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/codex-git-add-dirs.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc4f334671fbcd643c15f1bafff124d37d05ada6ba1cc154edddd5f6a621022"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: codex-member-permissions: \u0060packages/daemon/src/domain/codex-member-permissions.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/codex-member-permissions.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c13d897f4c718aa24b3a5674b6d625a17e82cded28a39b3fe0596c400ed6d28"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: codex-member-permissions: \u0060packages/daemon/src/domain/codex-member-permissions.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/codex-member-permissions.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9727c95772106d57d15e0e6fe9d4150d087fdb6b94368a833115f33400bae12"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: codex-member-permissions: \u0060packages/daemon/src/domain/codex-member-permissions.ts\u0060 (domain layer) depends on \u0060node:fs/promises\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/codex-member-permissions.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"8994aa6e7a745e7b413c69fc0eaa936879d9d0f325a4fc80fff241fd642094a4"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: codex-owned-plugin-trust: \u0060packages/daemon/src/domain/codex-owned-plugin-trust.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/codex-owned-plugin-trust.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a197412571a49a6c46a4d37497c67b83e1eec24db23a57d774a6286a6c128866"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: codex-rebuild-permissions: \u0060packages/daemon/src/domain/codex-rebuild-permissions.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/codex-rebuild-permissions.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f358958f2beb54c32c42b74a3b37b307d535c6c5d90866c4f75e8d086195ae"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: codex-team-workspace: \u0060packages/daemon/src/domain/codex-team-workspace.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/codex-team-workspace.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e705c5c83486db88fae23af4c0a1fedac11196ec3e04cdfc29df2622b88a3e6"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: codex-thread-id: \u0060packages/daemon/src/domain/codex-thread-id.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/codex-thread-id.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"29cecadcd9bb909c9569bdadf5ce849d09f033316785dfc979f16627eaea5625"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: codex-thread-id: \u0060packages/daemon/src/domain/codex-thread-id.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/codex-thread-id.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"0085ab6020a625611ebc10b851cf0d9a410368a15d368bd7e91e6fd3439887bf"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: community-harness-first-input: \u0060packages/daemon/src/domain/community-harness-first-input.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/community-harness-first-input.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd3e5cfcc316fd4f27cb0800b7f4dfa989eea8db7a64424fe2573a63159e640"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: community-harness-first-input: \u0060packages/daemon/src/domain/community-harness-first-input.ts\u0060 (domain layer) depends on \u0060../openrig-compat.js\u0060 (import of \u0060packages/daemon/src/openrig-compat.ts\u0060) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/community-harness-first-input.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e4348c41fa0ad912bbf1cc76e2902f26e58571f51373714fc7cd44d09e0f8c"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: community-harness-launch-result: \u0060packages/daemon/src/domain/community-harness-launch-result.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/community-harness-launch-result.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d19e827fb33a7a3c6bf9c67a6350ae077a5bbe858ec2c923be1e9f37ace6f9"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: community-harness-launch-result: \u0060packages/daemon/src/domain/community-harness-launch-result.ts\u0060 (domain layer) depends on \u0060../openrig-compat.js\u0060 (import of \u0060packages/daemon/src/openrig-compat.ts\u0060) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/community-harness-launch-result.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4de7329d71a95c9e2d5604d0297f40af236407153bfc6165d3d9b229dc40a01"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: community-harness-presets: \u0060packages/daemon/src/domain/community-harness-presets.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/community-harness-presets.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5ee754fe6914462a2e9d23c919866c0156e6c5afc97068092fcdee4e3a2fda"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: community-harness-presets: \u0060packages/daemon/src/domain/community-harness-presets.ts\u0060 (domain layer) depends on \u0060../openrig-compat.js\u0060 (import of \u0060packages/daemon/src/openrig-compat.ts\u0060) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/community-harness-presets.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"221f9bad8fd39e5f39715a7c4ae27fa71c6ee86cc64d2ac3c653202f137261ad"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: compaction-restore-notice: \u0060packages/daemon/src/domain/compaction-restore-notice.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/compaction-restore-notice.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"65803341e3c635b0e328f34eb3e153e79358b2e6478bd14aaf5cee97bb14cbbf"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: context-monitor: \u0060packages/daemon/src/domain/context-monitor.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/context-monitor.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7fe2d2c093e159753c5e510f74b754a9884a63044844577aec4639e27150f11"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: bundle-assembler: \u0060packages/daemon/src/domain/context-packs/bundle-assembler.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/context-packs/bundle-assembler.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d6516ac7c9ef06314f0c93fe182f378f5668251fe7650b4f25c9cb4d568a1b"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: context-pack-library-service: \u0060packages/daemon/src/domain/context-packs/context-pack-library-service.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/context-packs/context-pack-library-service.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f963e26f86b138130a7a26f34bed0b1020baa7843f99e3df0ca13ca78a095eb"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: context-pack-library-service: \u0060packages/daemon/src/domain/context-packs/context-pack-library-service.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (dynamic import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/context-packs/context-pack-library-service.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e788253f00cb7b7ea5517d77caa9d4063ce7c043baf11ad282a432a0740194"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: profile-source-resolver: \u0060packages/daemon/src/domain/context-packs/profile-source-resolver.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/context-packs/profile-source-resolver.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1bbb32341c9424225760f40ce33608fb32ca7fe7f26815d65434d9727f1b403"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: seat-recap-store: \u0060packages/daemon/src/domain/context-packs/seat-recap-store.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/context-packs/seat-recap-store.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da0ca75693a36b0a7045c25a387e0f095f14364b6933b4498c94beed843be83"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: context-usage-store: \u0060packages/daemon/src/domain/context-usage-store.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/context-usage-store.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f4c82c741ec8a8901326bd0b4b4ce1652fce6b5984ac1f3b87dd9bb50be08a7"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: context-usage-store: \u0060packages/daemon/src/domain/context-usage-store.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/context-usage-store.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1d39bb42d56220b2250a552ad4cdceb24023873782b3d89d819f0ad75a06a4"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: continuity-policy-materializer: \u0060packages/daemon/src/domain/continuity-policy-materializer.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/continuity-policy-materializer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22cf9bbe860eb070b780a5fc5a40edc3664dcea68f27338bf532a3a0b93a5d0"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: crash-cart-discovery: \u0060packages/daemon/src/domain/crash-cart-discovery.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/crash-cart-discovery.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c2c0b75ca0499efbb386ca391a0467ee082df2158b21c12bed9e006177102f"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: crash-cart-probes: \u0060packages/daemon/src/domain/crash-cart-probes.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/crash-cart-probes.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd4748f3d398accc55b66752f746ba60ec0d9e7884c2c0eaaa42130e1ac701f"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: current-restore-snapshot: \u0060packages/daemon/src/domain/current-restore-snapshot.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/current-restore-snapshot.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a7cc2a7c0d3a9068558c83f32ac684b6d60238113736190da81067e3d547aaf"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: current-work: \u0060packages/daemon/src/domain/current-work.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/current-work.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"6effad596eaec500022d4fe23589af408a71a76739591dd3485166bddcfcded5"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: current-work: \u0060packages/daemon/src/domain/current-work.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/current-work.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"a895d2e2630bc62e3fedff65889e73763ae3bda53b23a1cee31185d88fe3eefc"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: cwd-resolution: \u0060packages/daemon/src/domain/cwd-resolution.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/cwd-resolution.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c56247983461db6e8796bfe1c18d1d8925808c75ec95fb82bc77b3419565deb"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: daemon-lifecycle-store: \u0060packages/daemon/src/domain/daemon-lifecycle-store.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/daemon-lifecycle-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da17dec15034eec6fc41b3686719582496ae21a4b884327888b5240c5ef6b3e6"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: daemon-version: \u0060packages/daemon/src/domain/daemon-version.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/daemon-version.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f337731c1cfcb767cb1957215deda140b2c64c40c63ff067f1890e118ce320"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: default-receiver: \u0060packages/daemon/src/domain/default-receiver.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/default-receiver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac74c7140bdfe0ade3520f75a73d9a84854fc6d446dee7891890bd82eff21299"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: desired-claude-activity-hooks: \u0060packages/daemon/src/domain/desired-claude-activity-hooks.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/desired-claude-activity-hooks.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e59e4a52c16b5309175bbf4e8d3a417b27072a49161dcfce5bc2b2cf8e7e67c"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: destination-successor: \u0060packages/daemon/src/domain/destination-successor.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/destination-successor.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7745538831e31aac1a8b80d65e508ce81ce91a7e6159a8c4e1494aaae6834952"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: discovery-repository: \u0060packages/daemon/src/domain/discovery-repository.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/discovery-repository.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8460586dee13822cd83dd683d2d6037e3a6383d6c0f19da8830508943c515979"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: draft-aware-delivery: \u0060packages/daemon/src/domain/draft-aware-delivery.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/draft-aware-delivery.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c486dc1d4dfcafa4fff4e36c03ea54a4f98392072b752b61654d2c5925cc9e"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: environment-artifacts: \u0060packages/daemon/src/domain/environment-artifacts.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/environment-artifacts.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"466dd4852643218c76a99a64c1dc4be8a5a59efa46d5a2956764cc5ffd5cae1a"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: environment-lifecycle: \u0060packages/daemon/src/domain/environment-lifecycle.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/environment-lifecycle.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"732b7871eb3e0714897c34c4aea4a2bc2d83ed242e5c2df813cb92ab9bc5bbc3"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: environment-platform: \u0060packages/daemon/src/domain/environment-platform.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/environment-platform.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb7fabf17c2d2b74beb2563ad1a496fd571cb675c8ca9e83d91d09ba768bc7d"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: environment-platform: \u0060packages/daemon/src/domain/environment-platform.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/environment-platform.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4b307ab96e1aaf28c32c4cb06abe828ace500bdc4e6b6b947696b960a016ab"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: environment-startup: \u0060packages/daemon/src/domain/environment-startup.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/environment-startup.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25107922123650b9a35b0bb6bdff05c85e4a63bef8162d19041836f460bf1079"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: escalation-owner: \u0060packages/daemon/src/domain/escalation-owner.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/escalation-owner.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb031f97e3dd46da969448eeba5351c9f5f220535d8e9c2ec9b304ac542250c7"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: event-bus: \u0060packages/daemon/src/domain/event-bus.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/event-bus.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"227716dd2c33063940b030955dbf3cdb6f6769ee115bf933dc2d0cb692bc116b"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: execution-candidate-reader: \u0060packages/daemon/src/domain/execution-candidate-reader.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/execution-candidate-reader.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e47012fe938ebca86f441e5d5685f6fb939a39b7aa340b8bde15c6bd07bb00c"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: execution-view: \u0060packages/daemon/src/domain/execution-view.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/execution-view.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"042c637190a5cb561eff5519526af2ebfc5265a009b145f2c3597c4b833daf21"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: execution-view: \u0060packages/daemon/src/domain/execution-view.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/execution-view.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f5df57b491272af7ddff1e907fd01f4999dad84490d509468c05d3a3cb28ed"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: existing-rig-restore: \u0060packages/daemon/src/domain/existing-rig-restore.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/existing-rig-restore.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"392af4f7fb5197b0d16ac283f0b904964715d769e8d98435fdc63199911c4c82"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: expected-conversation: \u0060packages/daemon/src/domain/expected-conversation.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/expected-conversation.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7b5559310f5e0a54e3bc931ade0598321a19d0ba84f6206bf2afefd0d92b2c"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: external-install-executor: \u0060packages/daemon/src/domain/external-install-executor.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/external-install-executor.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f0808c4cc1cbabbc8fd59becfd3465c1d72781858c43645436fa26979707946"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: file-read: \u0060packages/daemon/src/domain/files/file-read.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/files/file-read.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26be513cff42a50dae8a64efb5ed71127b4208ea46c70cbb8382c865a1809dd"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: file-write-service: \u0060packages/daemon/src/domain/files/file-write-service.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/files/file-write-service.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d48d86c8eda9aab926970f39aef66237203af5af6fa9509bbe9d0fa05d0048"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: path-safety: \u0060packages/daemon/src/domain/files/path-safety.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/files/path-safety.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c2329ca35aa02aff9acc3aa5be919804630e7e926ac8fbc73020db34776f2d"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: finite-telemetry: \u0060packages/daemon/src/domain/finite-telemetry.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/finite-telemetry.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"804c7b6f44c4a205436c0cfcf73b777b17a020ea01fa8946dcd59337f2b240be"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: footprint-choice: \u0060packages/daemon/src/domain/footprint-choice.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/footprint-choice.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e26a31999f8b47b1a66fe3bbd3989d4463af9271bf3c7d070cddea4b095b7b"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: fresh-occupant-relation: \u0060packages/daemon/src/domain/fresh-occupant-relation.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/fresh-occupant-relation.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25020ccf9164348c21fbc5669ea856d6424fd1090cd32eab63b4897423b81d55"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: channel-operations: \u0060packages/daemon/src/domain/gateway/channel-operations.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/gateway/channel-operations.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e9cabc9cfef94c549e387e1f814a5bcb1959a992f02108bbe19a62c1d3c311"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: channel-operations: \u0060packages/daemon/src/domain/gateway/channel-operations.ts\u0060 (domain layer) depends on \u0060../../openrig-compat.js\u0060 (import of \u0060packages/daemon/src/openrig-compat.ts\u0060) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/gateway/channel-operations.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"03edb37900f2a37cf1d1d69153bc98de8a1a757c866f51081afad6b6b90afe63"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: connections-projection: \u0060packages/daemon/src/domain/gateway/connections-projection.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/gateway/connections-projection.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf8deb2323c2583e24a636347329637628efde127800d1e71d2652e37d88f13"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: dispatch-buffer: \u0060packages/daemon/src/domain/gateway/dispatch-buffer.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/gateway/dispatch-buffer.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"96387c5a51635abd3ca48eb7ad463d4fe40b044c8aa2efe950f85cbda6a07c9f"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: dispatch-buffer: \u0060packages/daemon/src/domain/gateway/dispatch-buffer.ts\u0060 (domain layer) depends on \u0060../../openrig-compat.js\u0060 (import of \u0060packages/daemon/src/openrig-compat.ts\u0060) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/gateway/dispatch-buffer.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ecff7ae92d53e6702cf61094754843b81cb8abe12a4de34453ad2724578c29c"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: human-operating-modes: \u0060packages/daemon/src/domain/gateway/human-operating-modes.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/gateway/human-operating-modes.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cef82726e6e3da92cb33cee9ee96a0c7cfc1024371f2f745246e5bc9033df47"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: human-quiet-windows: \u0060packages/daemon/src/domain/gateway/human-quiet-windows.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/gateway/human-quiet-windows.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"48818287ac4660b47ebc8f36f4f2d4b07d1db2493a0e6dd1b779d630b8ef6005"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: human-registry: \u0060packages/daemon/src/domain/gateway/human-registry.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/gateway/human-registry.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aab16ea74c451409f9868aaf3ce363dec22dc2edb5b05afb7e046982882980d"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: human-registry: \u0060packages/daemon/src/domain/gateway/human-registry.ts\u0060 (domain layer) depends on \u0060../../openrig-compat.js\u0060 (import of \u0060packages/daemon/src/openrig-compat.ts\u0060) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/gateway/human-registry.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54b85acf9c0f997a890fd57613e9bcd6f555a53314db947caf742eba9deab1"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: participants: \u0060packages/daemon/src/domain/gateway/participants.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/gateway/participants.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a356f73422479e2965992124de3b5f7e3a196876bb1d7e58deedb53b35cac7"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: participants: \u0060packages/daemon/src/domain/gateway/participants.ts\u0060 (domain layer) depends on \u0060../../openrig-compat.js\u0060 (import of \u0060packages/daemon/src/openrig-compat.ts\u0060) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/gateway/participants.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2836afb05bb4154d8f3ec958aebdff9ee58dd05166416d7df1e070d9dfeb51"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: relay-config: \u0060packages/daemon/src/domain/gateway/relay-config.ts\u0060 (domain layer) depends on \u0060../../openrig-compat.js\u0060 (import of \u0060packages/daemon/src/openrig-compat.ts\u0060) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/gateway/relay-config.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccba8a36210b33d21a2f821b70fe401db027a95f85d8ca1fe0ae9ebcdc75dd09"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: relay-config: \u0060packages/daemon/src/domain/gateway/relay-config.ts\u0060 (domain layer) depends on \u0060../../middleware/auth-bearer-token.js\u0060 (import of \u0060packages/daemon/src/middleware/auth-bearer-token.ts\u0060) \u2014 a HTTP module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/gateway/relay-config.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"1219dcc8b46ea5f1574e4eb787175f8b1a35a5e6ee4c475107bba11dc234cffd"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: config: \u0060packages/daemon/src/domain/gateway/slack/config.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/gateway/slack/config.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d1083604585e0c8f6aa93c88bda870b66dba4630229277153e72a393b0f9fb2"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: config: \u0060packages/daemon/src/domain/gateway/slack/config.ts\u0060 (domain layer) depends on \u0060../../../openrig-compat.js\u0060 (import of \u0060packages/daemon/src/openrig-compat.ts\u0060) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/gateway/slack/config.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e2de959b6e0444d1816967b2da767f8a8eb5fffb974d7c559cb4e5d1c4729af"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: secrets: \u0060packages/daemon/src/domain/gateway/slack/secrets.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/gateway/slack/secrets.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b7b58a84f03cf581c442625338f0a3067dffd8a1f984ab1d2c5d8ef5cc490d"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: slack-api: \u0060packages/daemon/src/domain/gateway/slack/slack-api.ts\u0060 (domain layer) depends on \u0060fetch\u0060 (global fetch) \u2014 a HTTP module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/gateway/slack/slack-api.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"db99c9b525c4fa54a6aaf4677910dca3ec7924e5b38f0e23133bc6920a3703d2"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: slack-delivery: \u0060packages/daemon/src/domain/gateway/slack/slack-delivery.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/gateway/slack/slack-delivery.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fbe0a7d7c3c5ee51c0e35c830d358e3b9902c195e6f9dce93561731d96e5ff6"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: slack-subsystem: \u0060packages/daemon/src/domain/gateway/slack/slack-subsystem.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/gateway/slack/slack-subsystem.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f9c2274cb840f68f0511010bd9d517a339997a82986fd6158ff77cfa9ee3ad"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: state-store: \u0060packages/daemon/src/domain/gateway/slack/state-store.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/gateway/slack/state-store.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b66166ce02a9dbb4f459248433510d1d7a9e5c7542a73b9966e2c82d9a880e"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: thread-seat-map: \u0060packages/daemon/src/domain/gateway/slack/thread-seat-map.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/gateway/slack/thread-seat-map.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"b14afeee0b78eae50684de665947caac8738e8d2813377266876bbe0805ed876"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: generated-file-hygiene: \u0060packages/daemon/src/domain/generated-file-hygiene.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/generated-file-hygiene.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a5a10ddc86fe3d3c8dd35202cb03d8957b821bbb2255fa3d6506887fd161ad"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: guidance-projection: \u0060packages/daemon/src/domain/guidance-projection.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/guidance-projection.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94632bfbd8409746b5a21c2bf8faf0083d9a220fa4bfbcaeb9ee31207b138667"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: guidance-projection: \u0060packages/daemon/src/domain/guidance-projection.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/guidance-projection.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f5237584cb5dc76a6cf869ecff24d35beae6ae6ae36fde2e312dbf6ebe00fd6"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: harness-not-started-notice: \u0060packages/daemon/src/domain/harness-not-started-notice.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/harness-not-started-notice.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"867aa0a838db408e23048a197741edcf88af614ee774da80e724c4b3fd62c2e6"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: health-checkpoints: \u0060packages/daemon/src/domain/health-checkpoints.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/health-checkpoints.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d83d72376768b35f10a21b6dea619b9e5dc8eb266f4e019480bfcfc3cf2d84c1"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: health-context: \u0060packages/daemon/src/domain/health-context.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/health-context.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36cd04810cc8d2d1c687397bfff8a485f8d38e9c666c37e2201ddaccee46b9f2"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: health-detectors: \u0060packages/daemon/src/domain/health-detectors.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/health-detectors.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba03810f26d7af82e7654c4e470df6e03034ab2e8d5bed42a230ca1f65aa9c6"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: health-passive-ceremony: \u0060packages/daemon/src/domain/health-passive-ceremony.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/health-passive-ceremony.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f3b529e9608ac83205b468c60efc2811286465a5372f68285901cc224e8c9f"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: health-policy: \u0060packages/daemon/src/domain/health-policy.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/health-policy.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4693b7e8204acf56ef24a9c6293199597b0cd009411644dcecf508f2041894"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: history-query: \u0060packages/daemon/src/domain/history-query.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/history-query.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89f78decc22a9b4165e1b9b9cf5544f14f41e13d2d30486ce7c8dbd528ee1cbb"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: home-isolation: \u0060packages/daemon/src/domain/home-isolation.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/home-isolation.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da945bdf3997fd1ebc36c913ae2e7bdaffe9a3f7e74fd54fe6c531eac8b1459"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: hook-bridge: \u0060packages/daemon/src/domain/hook-bridge.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/hook-bridge.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"1caaf963e5a9654079dfeed79750f02ecdcb98b5ab5d043e25fa535f87ee89bc"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: hook-bridge: \u0060packages/daemon/src/domain/hook-bridge.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/hook-bridge.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"621ee494965fd62ec45fb9286199f56a5cc0634b7f9c13e3e5eb0ac87b187c1f"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: hosts-registry-reader: \u0060packages/daemon/src/domain/hosts/hosts-registry-reader.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/hosts/hosts-registry-reader.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b5b216533857f85279ee9926928bee04a12a73f6f20b1661d5748c9f14f95f7"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: hosts-registry-reader: \u0060packages/daemon/src/domain/hosts/hosts-registry-reader.ts\u0060 (domain layer) depends on \u0060../../openrig-compat.js\u0060 (import of \u0060packages/daemon/src/openrig-compat.ts\u0060) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/hosts/hosts-registry-reader.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1fac9bd6cd27fdca1fad4eb4b5c745b4304a54bc1e9097e6a7590852955f08e"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: hosts-registry-writer: \u0060packages/daemon/src/domain/hosts/hosts-registry-writer.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/hosts/hosts-registry-writer.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e0ec03f0d4b06402ad57abe8a4421ed529198232c14568df4549d9e82d8870"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: learned-host-bindings: \u0060packages/daemon/src/domain/hosts/learned-host-bindings.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/hosts/learned-host-bindings.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a10a8d1a52d52a66ac9d67c4623438bb91f9444287b4af6f41e3b402bbdff2f"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: learned-host-bindings: \u0060packages/daemon/src/domain/hosts/learned-host-bindings.ts\u0060 (domain layer) depends on \u0060../../openrig-compat.js\u0060 (import of \u0060packages/daemon/src/openrig-compat.ts\u0060) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/hosts/learned-host-bindings.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"8384ad3273957321dc098cecebd70e8427cf14e3c4b4f09844e148ae3553313e"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: read-through: \u0060packages/daemon/src/domain/hosts/read-through.ts\u0060 (domain layer) depends on \u0060hono\u0060 (import) \u2014 a HTTP module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/hosts/read-through.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"7349762769768519c93bcf9aecff5794a8e6354ba3564d9286e4e6d9715d37ff"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: remote-daemon-http: \u0060packages/daemon/src/domain/hosts/remote-daemon-http.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/hosts/remote-daemon-http.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cfbbd7204b1547a5a00b493c9fb7e3ecfabc0f4777183ce4dd3a54a6407922b"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: inbox-handler: \u0060packages/daemon/src/domain/inbox-handler.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/inbox-handler.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"135db324042def8861143e51e7458ae32baf5079a6abb3fe2a2126aaa5e5cb74"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: install-repository: \u0060packages/daemon/src/domain/install-repository.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/install-repository.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"211096c04732c13fe3370a317c3595ed2a55b1c2e5d18c27fae91d46d70dbd54"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: kernel-boot: \u0060packages/daemon/src/domain/kernel-boot.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/kernel-boot.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"781fae3d782bd483d76e433688649e2b542e6b3c3d548a4a7fcdea21ef4da89d"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: kernel-hook-review: \u0060packages/daemon/src/domain/kernel-hook-review.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/kernel-hook-review.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f977e66d38f79a7d95470b11e35c19d7862c78a1341a88f4b3888b0dc2edb101"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: launch-wrapper: \u0060packages/daemon/src/domain/launch-wrapper.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/launch-wrapper.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c65d6eb720567b3ac6f37cce1182d5092df47b870bdccd1b9b4c75b66a063e31"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: lifecycle-manifest: \u0060packages/daemon/src/domain/lifecycle-manifest.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/lifecycle-manifest.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd6bf45c5f6f2db07cb1fa36688e4e2c34590f1ebd9003ecdba8d58e042ee5e"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: lifecycle-obligations: \u0060packages/daemon/src/domain/lifecycle-obligations.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/lifecycle-obligations.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19470b9d2c86773115cbe857793ac04fb5e7b9c76852cdd881d5b64362fb93a"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: managed-block-records: \u0060packages/daemon/src/domain/managed-block-records.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/managed-block-records.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ce4a133d9dfc3ee8f07f95fc4be4dfcda7fb6f50db2c24924ec668c91ea5a7"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: managed-block-records: \u0060packages/daemon/src/domain/managed-block-records.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/managed-block-records.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e4c10b9b50cd3b6f68e3b18cafeab31835840ec4288c7a9f36f2fd7e3d6ba3d"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: managed-restore-read-access: \u0060packages/daemon/src/domain/managed-restore-read-access.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/managed-restore-read-access.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a48d464685f7ac3351f87599f14ccd77842a1909dcd9e73b33acddfa36e52f"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: member-connection: \u0060packages/daemon/src/domain/member-connection.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/member-connection.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f594ae7bfef9a9adc93dfe362bad22fa185dfc31e2d6f303914ecd9788c49cd9"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: audit-browse: \u0060packages/daemon/src/domain/mission-control/audit-browse.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/mission-control/audit-browse.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e62d1a042131c340741d63db84d07a095dec7d036d47e9823e483b61218a8d2"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: mission-control-action-log: \u0060packages/daemon/src/domain/mission-control/mission-control-action-log.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/mission-control/mission-control-action-log.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"393cef29b9ebb000f262e61969d6b9a48660b64d6543c397ceb8daa35f593970"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: mission-control-fleet-cli-capability: \u0060packages/daemon/src/domain/mission-control/mission-control-fleet-cli-capability.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/mission-control/mission-control-fleet-cli-capability.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab64a4f204fdf331476736a11af899b734b3d0711cdee01b2277bc179035cf7"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: mission-control-read-layer: \u0060packages/daemon/src/domain/mission-control/mission-control-read-layer.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/mission-control/mission-control-read-layer.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"773d476029d74370e8abf05b28b37c8f7b3fae7953fdccbdafad8b4dee1e1f06"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: mission-control-write-contract: \u0060packages/daemon/src/domain/mission-control/mission-control-write-contract.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/mission-control/mission-control-write-contract.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee72b00df8e567d86c17e475867ab5c30aa27230a247c27516c4154d50092ad"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: notification-dispatcher: \u0060packages/daemon/src/domain/mission-control/notification-dispatcher.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/mission-control/notification-dispatcher.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"c248b76e7efb9e76c34f76e4ede39e62b99ea3b26430bccbbacd7f95392b719c"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: current-model-reader: \u0060packages/daemon/src/domain/model-divergence/current-model-reader.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/model-divergence/current-model-reader.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"3334115d852406a26180467f66c972c38211c10315aea7e3eba4dd98a7d93642"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: effective-model-readers: \u0060packages/daemon/src/domain/model-divergence/effective-model-readers.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/model-divergence/effective-model-readers.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f56b50c43f2e65fa2de6636393c1a5895f8f6e1b846614d7b64c96e8e44bab"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: model-divergence-monitor: \u0060packages/daemon/src/domain/model-divergence/model-divergence-monitor.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/model-divergence/model-divergence-monitor.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c17fcf07c5fc336584bfe0f33e4652d40e9ecfc73376bb0a636987db111ff0"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: native-permission-store: \u0060packages/daemon/src/domain/native-permission-store.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/native-permission-store.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"7463986e8b1ad48a21dfb89b331e478fa6497ff0baa1622ddb9f2a1ca052bb50"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: native-process-arguments: \u0060packages/daemon/src/domain/native-process-arguments.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/native-process-arguments.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9674a95f2ece034d0485575c1c852d07210e09e04e2c585f0449fe82947572"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: native-process-executable: \u0060packages/daemon/src/domain/native-process-executable.ts\u0060 (domain layer) depends on \u0060node:fs/promises\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/native-process-executable.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"81bd6c63d8c571a0a45d3fa2efb760c4c0b92ad788d7be8d3372901b1436d4c2"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: network-bindings: \u0060packages/daemon/src/domain/network/network-bindings.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/network/network-bindings.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"589bd46e2be0d3e60499e2832ea9e7327aa7f697ad4bdcda4bb4b93d27749c59"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: network-bindings: \u0060packages/daemon/src/domain/network/network-bindings.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/network/network-bindings.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"5017ddbcf11906cb9f19a9a681b0de35948ade0102e91188e791ca0f3c0590ab"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: network-connector: \u0060packages/daemon/src/domain/network/network-connector.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/network/network-connector.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04fed447cf6eaa9760956acf9b780ba26acf9f93c8c099affb97c580d4763aa"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: network-installations: \u0060packages/daemon/src/domain/network/network-installations.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/network/network-installations.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5eeeaabd43a106d5350d43696f12864cee3a08cec581e9e3feba24955ffb02"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: network-installations: \u0060packages/daemon/src/domain/network/network-installations.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/network/network-installations.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f48f27f676b2a9644bf171507579f56b010896aa04744061f3569fac750556"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: network-installations: \u0060packages/daemon/src/domain/network/network-installations.ts\u0060 (domain layer) depends on \u0060fetch\u0060 (global fetch) \u2014 a HTTP module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/network/network-installations.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"5139c6bf4dceb0cea2bcdbb1304d9c4a55eaa069b6f545bc2f12f89de7edd514"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: node-inventory: \u0060packages/daemon/src/domain/node-inventory.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/node-inventory.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"456a3f7f2a33ad00a2388ecd0ceb9bac08408548be44aa14561c44a78e9472a6"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: node-inventory: \u0060packages/daemon/src/domain/node-inventory.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/node-inventory.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"d55ea806f831a5d200130861b183476e65cbd51a7c03187ae2c103a918a62a37"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: node-launcher: \u0060packages/daemon/src/domain/node-launcher.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/node-launcher.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fbf4f1f10f3ae427ecd0abd79d5a19e72b6292474cc74e42508d54200ff2026"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: operation-correlation: \u0060packages/daemon/src/domain/operation-correlation.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/operation-correlation.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5bd0299c6f9c1ea647331dd89c925e294eeac661f541959d443ac31d79f21c"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: outbox-handler: \u0060packages/daemon/src/domain/outbox-handler.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/outbox-handler.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"5162874812b8ccf7c0daf6baa6ab464990cfaea8c8e3a9e0e03f3a67a347aa49"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: package-install-service: \u0060packages/daemon/src/domain/package-install-service.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (dynamic import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/package-install-service.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd0948e613e9488710dec6c148007c134b60ab5df43331447ccbb4cc583052cd"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: package-repository: \u0060packages/daemon/src/domain/package-repository.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/package-repository.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5eb668f03d0794ee59d500e3c4bc4fe6b1aa403e205fc12fe4ab637529f1a31"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: periodic-snapshot-scheduler: \u0060packages/daemon/src/domain/periodic-snapshot-scheduler.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/periodic-snapshot-scheduler.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"263cbb29f44c82465ac2d65d2d7979266d73c2b9e4c3a07e49b956e0db70a20e"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: permission-account: \u0060packages/daemon/src/domain/permission-account.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/permission-account.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab0b70cd65d63c18c00e881304061cdf2561598eceda5dc2c1c1dafd5b0316b"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: permission-drift-observer: \u0060packages/daemon/src/domain/permission-drift-observer.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/permission-drift-observer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bdc57ca65dcefb00595a06cf7a3fdc8baa40e06819b1338571964a723ee2b50"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: permission-drift-observer: \u0060packages/daemon/src/domain/permission-drift-observer.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/permission-drift-observer.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"94fe781c7b69d75a8248b81bb9e6f654f606e1af0c2fdcad6d6f69b7f20262a5"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: persisted-restore-posture: \u0060packages/daemon/src/domain/permission-policy/persisted-restore-posture.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/permission-policy/persisted-restore-posture.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03662d458632c5916397f2edf28c32dd0ce52173676ab23df75e2e2aea1f950"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: pi-account-state: \u0060packages/daemon/src/domain/pi-account-state.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/pi-account-state.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"39b27388b2f32c473bb8528f2c62cb0ed697e7ceaf12609503da21f17cc65fcc"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: pi-compaction-request-store: \u0060packages/daemon/src/domain/pi-compaction-request-store.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/pi-compaction-request-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba1935fcc066fac4ff3926bbd0f6117c75fdda639c4717607483dbd920cde48"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: pi-usage-entries-store: \u0060packages/daemon/src/domain/pi-usage-entries-store.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/pi-usage-entries-store.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"2730aba4b6f44ddf343cf050f3d471f28a2c75bc2f882232a8792047e8bf1527"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: plugin-discovery-service: \u0060packages/daemon/src/domain/plugin-discovery-service.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/plugin-discovery-service.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca60f6ff505a9430c4af1902e65218f74780f022fdecaad3932e73d227380f7"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: plugin-vendor-service: \u0060packages/daemon/src/domain/plugin-vendor-service.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/plugin-vendor-service.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"37744b898cd6cb7aa6fd2e2e83bc3f015214263a9ea55330973ca4d1df3c6e85"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: pod-repository: \u0060packages/daemon/src/domain/pod-repository.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/pod-repository.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6676f20acd389de82a4890bc5eafc46c4923cec44daa387149f8559c46de191c"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: artifact-pool-helpers: \u0060packages/daemon/src/domain/policies/artifact-pool-helpers.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/policies/artifact-pool-helpers.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df051bd69d1c982c578fc28cb345168231c46db607aade36ac28ca7d4d11b98"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: artifact-pool-helpers: \u0060packages/daemon/src/domain/policies/artifact-pool-helpers.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (dynamic import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/policies/artifact-pool-helpers.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"288cb31b27e078a08ddc6f12028b8ec0bd047eadc9c902c46ec6813ce54f1313"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: context-usage-threshold: \u0060packages/daemon/src/domain/policies/context-usage-threshold.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/policies/context-usage-threshold.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e617417b9466abffa3efe2572b66e547ccc5b7f6503e9ae25322f4007c19d0c"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: idle-gate-qitem: \u0060packages/daemon/src/domain/policies/idle-gate-qitem.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/policies/idle-gate-qitem.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"6364faea7b804cc2414293fb6fbcdc8c7cdb13f19da23e745f2b57b2921a4419"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: mode-scheduled-end: \u0060packages/daemon/src/domain/policies/mode-scheduled-end.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/policies/mode-scheduled-end.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"15cbad5d8e93076a533d5783aec2ba38cbfae274a8b219db3fdb993316771355"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: workflow-keepalive: \u0060packages/daemon/src/domain/policies/workflow-keepalive.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/policies/workflow-keepalive.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"8454076a52259fd72f47cbc8e103df0165f9b49dabe9f444ed1af10d3b036a76"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: profile-resolver: \u0060packages/daemon/src/domain/profile-resolver.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/profile-resolver.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77c98ede621c4b1224155288942335e771a1c65867bb8303205f9b0cbfda640"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: progress-indexer: \u0060packages/daemon/src/domain/progress/progress-indexer.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/progress/progress-indexer.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"4deeb708dca372078a6d7e5516ea73395af6679b50ee3a53002b3999f249ca3e"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: project-classifier: \u0060packages/daemon/src/domain/project-classifier.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/project-classifier.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56bc50255caf92163228e4f9ac31f6fee85fae106793cd0fb35010d3c5adb3d"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: project-classifier: \u0060packages/daemon/src/domain/project-classifier.ts\u0060 (domain layer) depends on \u0060../routes/require-sender-identity.js\u0060 (import of \u0060packages/daemon/src/routes/require-sender-identity.ts\u0060) \u2014 a HTTP module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/project-classifier.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af93cfb82703b411d730ea8f1fe87e6d15d54467aa7c435569ff845fc1fbdb2"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: project-lifecycle-compiler: \u0060packages/daemon/src/domain/project-lifecycle-compiler.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/project-lifecycle-compiler.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3d68a2ec70ca3e859dd2bdbca8e0aead3dedbb1dd83ba263c0531bac80467e"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: projection-manifest-store: \u0060packages/daemon/src/domain/projection-manifest-store.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/projection-manifest-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa85fc3423dae179616e779ad03edef169afd0019d7beb58489364e93e2a50ba"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: projection-planner: \u0060packages/daemon/src/domain/projection-planner.ts\u0060 (domain layer) depends on \u0060../openrig-compat.js\u0060 (import of \u0060packages/daemon/src/openrig-compat.ts\u0060) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/projection-planner.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d2b74e61c3d69227856e9ecfddc07751de8735f9bd801c1220ef91ccbced54"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: judgments: \u0060packages/daemon/src/domain/proof/judgments.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/proof/judgments.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60fdb892b17a44da6de6807544aa25c5f789a8c3d0712c803dad75e60eb0a9df"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: source-watch: \u0060packages/daemon/src/domain/proof/source-watch.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/proof/source-watch.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3645b5c33579dbdcada1e48b0fe41e2c2f9812580a97ef26c26d1d25620288ba"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: claude-auth-status-reader: \u0060packages/daemon/src/domain/provider/claude-auth-status-reader.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/provider/claude-auth-status-reader.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"191adc6f3c409e24f80de138237bc052abfc431095360b76024f2e07a929c625"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: claude-token-usage: \u0060packages/daemon/src/domain/provider/claude-token-usage.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/provider/claude-token-usage.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"f567dff1e780ccd742f11ca8e7bc720a02dcbc6e39c547cb4a5ff78d85347a58"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: claude-usage-reader: \u0060packages/daemon/src/domain/provider/claude-usage-reader.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/provider/claude-usage-reader.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df3b4788b94e91c1aad055bc78874e42f023e4f67a2fc7db30b0ed5a32a99ee"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: claude-usage-windows: \u0060packages/daemon/src/domain/provider/claude-usage-windows.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/provider/claude-usage-windows.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3034c0a0d7af498480ec852d691b99598cd13665b4d065447ced90fd5ab599d"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: codex-auth-reader: \u0060packages/daemon/src/domain/provider/codex-auth-reader.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/provider/codex-auth-reader.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e79851296cb42a9ff34b926b4248e858bc392743d341e7c58efa8b18b0484d"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: provider-account-readings: \u0060packages/daemon/src/domain/provider/provider-account-readings.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/provider/provider-account-readings.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"c148a241abcc0fa4cff030e4069a4186d551d12f1dfea53f032476d6b62dad8c"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: provider-service-impl: \u0060packages/daemon/src/domain/provider/provider-service-impl.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/provider/provider-service-impl.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"46acb8ea334bf5ff5f340109a7d1f835d8871609ff3d3658e67b7279530bb2de"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: provider-service-impl: \u0060packages/daemon/src/domain/provider/provider-service-impl.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/provider/provider-service-impl.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"732a23e5e0619b0a7322b125f8fb6f1c4a0f83dfb697d48a5588cbdb86db58c8"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: ps-projection: \u0060packages/daemon/src/domain/ps-projection.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/ps-projection.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c3f989a9f1f5667b24a62b9af5a665d7865740a4a745001c9350737534a333"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: queue-erasure: \u0060packages/daemon/src/domain/queue-erasure.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/queue-erasure.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcce60669d2120f7f384108e5b75058118f6ea41d22eb86b381ecaf693e108d9"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: queue-erasure: \u0060packages/daemon/src/domain/queue-erasure.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/queue-erasure.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"63012d47ebcdff88a1b1b1df96ccc9224e5cb2d2660c87ff32bd5708ae58ab05"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: queue-owner: \u0060packages/daemon/src/domain/queue-owner.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/queue-owner.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"475de0afc1da24fb438ecce50dcf3abf14de8f989199a52a4e3840d4f368880f"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: queue-recovery: \u0060packages/daemon/src/domain/queue-recovery.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/queue-recovery.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca71355bcd10b401596a81662eb4b46ea2d4b4b93775e7fc7a2d97f52dde3e3"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: queue-repository: \u0060packages/daemon/src/domain/queue-repository.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/queue-repository.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"f54f8a8617620e99f3605c93ad233a0f4c2330487e40b56a5ad31834282efd2a"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: queue-repository: \u0060packages/daemon/src/domain/queue-repository.ts\u0060 (domain layer) depends on \u0060../openrig-compat.js\u0060 (import of \u0060packages/daemon/src/openrig-compat.ts\u0060) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/queue-repository.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"3077c348e5261331589ef3b77133f863468c25ed68cc71d10597a77ac29fd796"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: queue-retention: \u0060packages/daemon/src/domain/queue-retention.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/queue-retention.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e4f62c1d40f431c9ef8620db088f97d3778b35c82852028e19633890eac3e0"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: queue-stuck-sweep: \u0060packages/daemon/src/domain/queue-stuck-sweep.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/queue-stuck-sweep.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fdd6a1ea55f0fff7aaab76760d7f3e5684425a34b1fbf9799993a76e174f18b"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: queue-transition-log: \u0060packages/daemon/src/domain/queue-transition-log.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/queue-transition-log.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b345714a7b300940d2e202c1131b29b92126a48dcc1f85bcaf2ba83d81c371"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: queue-wait-backoff: \u0060packages/daemon/src/domain/queue-wait-backoff.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/queue-wait-backoff.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c426c5c9b804f0064646fc392e1614b3632d50e819d0cf06e48c03a967c4609"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: queue-waiting: \u0060packages/daemon/src/domain/queue-waiting.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/queue-waiting.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"9970b76d6673b4be89a372ac6c46666015bf7074848f67b66ea67737279ca12e"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: queue-wake-ladder: \u0060packages/daemon/src/domain/queue-wake-ladder.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/queue-wake-ladder.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"c93cc80b581f4295b773a3cc6d4d47f1d24d1410124877cd3f03f424b3ed3360"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: queue-wake-repository: \u0060packages/daemon/src/domain/queue-wake-repository.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/queue-wake-repository.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ea1a88791301214b193b4782bb383327b1433394955e083805fb92dc43e916"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: quiet-hold-custody: \u0060packages/daemon/src/domain/quiet-hold-custody.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/quiet-hold-custody.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca74b3286645a888a9e6d248747675d812ff35565e5587784042fd5deb781811"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: rebuild-priming-chain: \u0060packages/daemon/src/domain/rebuild-priming-chain.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/rebuild-priming-chain.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e2ca08b6261281ac6e959d7eacebdd25875ea6339c5fd7f08e414176da818a"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: reconciler: \u0060packages/daemon/src/domain/reconciler.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/reconciler.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"680fa91d68cb9c76cefe55bced0847a31365632029fad7915f413572eac11ca7"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: refocus-record: \u0060packages/daemon/src/domain/refocus-record.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/refocus-record.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"073d398e50bc9b1e44f6ad38282b55db03337698799edac2ca5e19136dcdc2fd"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: rehydrate-eligibility: \u0060packages/daemon/src/domain/rehydrate-eligibility.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/rehydrate-eligibility.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb5e104a193af94c7fb8c9099b50e9d4d8fea01be7a3b51ae96ef6e9b9faf1f1"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: request-phase-observer: \u0060packages/daemon/src/domain/request-phase-observer.ts\u0060 (domain layer) depends on \u0060node:http\u0060 (import) \u2014 a HTTP module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/request-phase-observer.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71e8244a27e8abcf836480ed7255c12e66b0df9a6e86ab7cd06bdd793c0acb2"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: request-phase-observer: \u0060packages/daemon/src/domain/request-phase-observer.ts\u0060 (domain layer) depends on \u0060hono\u0060 (import) \u2014 a HTTP module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/request-phase-observer.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"170e77924978baa488549c031bc7de1eef13040b2f29a44ea55835e17c330d49"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: restore-attempt-receipt: \u0060packages/daemon/src/domain/restore-attempt-receipt.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/restore-attempt-receipt.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9689c84b44b27fb9f651de38c49462e2551eb6a5d84e472f5f6eaaab983e65ac"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: restore-check-service: \u0060packages/daemon/src/domain/restore-check-service.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/restore-check-service.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ebebb63c798c80b58537fec2f4c1645ee5ccbde42d49ae28c5900d8b8fa30bf"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: restore-check-service: \u0060packages/daemon/src/domain/restore-check-service.ts\u0060 (domain layer) depends on \u0060../openrig-compat.js\u0060 (import of \u0060packages/daemon/src/openrig-compat.ts\u0060) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/restore-check-service.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00d407d6a5b37a06e5f139fa630688137e4e9afb344ab0e69811711288f08e9"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: restore-guidance: \u0060packages/daemon/src/domain/restore-guidance.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/restore-guidance.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"660fcd178cddae0c1d0dc5d6f4f813ce3c52e4e66ab0708a31f9bf49eb0d8823"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: restore-guidance: \u0060packages/daemon/src/domain/restore-guidance.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/restore-guidance.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2387134f41eadfdcd50be237b3d3def9acfdc19888fe1a49ac8b5046d36ac50"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: restore-orchestrator: \u0060packages/daemon/src/domain/restore-orchestrator.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01e2c4ca2f42e5155cc04e6e109e62be4227047cb8e718ae16c37089d33b932"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: restore-orchestrator: \u0060packages/daemon/src/domain/restore-orchestrator.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f9eb46d07e1bb2f5d7c92caef8389f37c7d75b7dc7ff129ea09aa011480082"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: restore-plan-preview: \u0060packages/daemon/src/domain/restore-plan-preview.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/restore-plan-preview.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eadcb31a98cabe2427d7176264bed096b90d79e00e64c14914cd74af702aeb8"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: resume-metadata-refresher: \u0060packages/daemon/src/domain/resume-metadata-refresher.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/resume-metadata-refresher.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd1196963c259f35f3cb27f38e63d3f44ee360a3c564c68404297d1ea316f9c"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: return-route: \u0060packages/daemon/src/domain/return-route.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/return-route.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9c9eec2aa5b4371f1c74c6028104e85a758a1a401c1a0e48acb7aa12285635"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: freeze: \u0060packages/daemon/src/domain/review/freeze.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/review/freeze.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46bc6ffdc0b3080677bafef0eda50729376c533ae752812e5189a2320a8a4fe"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: gather: \u0060packages/daemon/src/domain/review/gather.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/review/gather.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"1adb0b9b015655fd48a921442c902f4e0305ee690b073b7bbbb6e94fc6c5d568"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: gather: \u0060packages/daemon/src/domain/review/gather.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/review/gather.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceee8fe474a332f3850681e31ba1c277ccef6065c6199a30fa4d5b81699d1825"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: proof-io: \u0060packages/daemon/src/domain/review/proof-io.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/review/proof-io.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"6facfd71f573706059254dd678ac0951cfb5104dac33142a845bb85f17cea80d"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: rig-delivery-drain: \u0060packages/daemon/src/domain/rig-delivery-drain.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/rig-delivery-drain.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6244fa430c8813aaf4503a99606a010cef267f7dcac98513acdfa35631afe59"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: rig-expansion-service: \u0060packages/daemon/src/domain/rig-expansion-service.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/rig-expansion-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a15dc1f368849944fe7f77b34124b353c5df6e8ac218a4037899471fefaddea"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: rig-lifecycle-service: \u0060packages/daemon/src/domain/rig-lifecycle-service.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/rig-lifecycle-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d60ed861430d775cea7a4279916c76354e117a64f8e393c70200c94ae347ed45"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: operating-posture: \u0060packages/daemon/src/domain/rig-mode/operating-posture.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/rig-mode/operating-posture.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4a4fad08d44ceb035912e22e43a232551b6676c2c40ef49c4ca185667b07e9"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: operating-posture: \u0060packages/daemon/src/domain/rig-mode/operating-posture.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/rig-mode/operating-posture.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ae99418cf1db7b71fbd5a4b85c1d297b59a47f8b84094e16b474acfbfa62d0"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: rig-mode-store: \u0060packages/daemon/src/domain/rig-mode/rig-mode-store.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/rig-mode/rig-mode-store.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"c785fb9aae0945d7f7a549360b6a44d7f93065edcdb2fe1c229fcddce6bd8b2b"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: rig-repository: \u0060packages/daemon/src/domain/rig-repository.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/rig-repository.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"1037ae2d3d42b620d3ad284f763cf296a280b23bda3a6fa28edbbb982917ed90"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: rig-teardown: \u0060packages/daemon/src/domain/rig-teardown.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/rig-teardown.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6890c7aa843e8da7bbbf83d139f41ec70c475c6f88d087d6e31ff02860988d4d"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: rig-teardown: \u0060packages/daemon/src/domain/rig-teardown.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/rig-teardown.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d3275771131de8ebadf19b2a1d53530a921d00151190a99eeda5bef4a26649"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: rigs-being-built: \u0060packages/daemon/src/domain/rigs-being-built.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/rigs-being-built.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"598cacdd46c1f0a1c7bfbc7e50999edb2416a4e1de6e691cc9df2076789a20c7"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: rigspec-exporter: \u0060packages/daemon/src/domain/rigspec-exporter.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (dynamic import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/rigspec-exporter.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"424c244df274b096880083da65b87bf12805f5955a6ccf50fa85a15d9b74f212"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: rigspec-instantiator: \u0060packages/daemon/src/domain/rigspec-instantiator.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"626ce88e8e1b08c0387f0260c6123051cda1e6aebaf9ff9824e447ec395f3f9a"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: rigspec-preflight: \u0060packages/daemon/src/domain/rigspec-preflight.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/rigspec-preflight.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc277a365a02ccfcc4ad92be28a422761be5775b8c3687a59c7b560f9391845"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: rigspec-preflight: \u0060packages/daemon/src/domain/rigspec-preflight.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/rigspec-preflight.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2ffecaff4b522fc0f95e27958e2ed5ed3e659ccec5314b0018c4113beda9e9"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: rosters: \u0060packages/daemon/src/domain/rosters.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/rosters.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"095a81fb678c5d619b9a44de81419863c73995cd728881d9fa29252c8b1d2547"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: route-timing-recorder: \u0060packages/daemon/src/domain/route-timing-recorder.ts\u0060 (domain layer) depends on \u0060hono\u0060 (import) \u2014 a HTTP module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/route-timing-recorder.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b73f208b3e0ba0502817b6bd207fa2f704eee8028ce6b8825f82fe3f41a44b"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: runner-grant-launch: \u0060packages/daemon/src/domain/runner-grant-launch.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/runner-grant-launch.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6092cc960fb403abae6dfc9a98f19c749fc1f1018619f2b79d4deede2ab0ae63"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: runner-permissions: \u0060packages/daemon/src/domain/runner-permissions.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/runner-permissions.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f103bd1d39e7bc0305da29cabb04e508ea9d8700d4a1c810ecb7dc8aea5931"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: running-name-guard: \u0060packages/daemon/src/domain/running-name-guard.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/running-name-guard.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b591a527201f9cac177a4b4e15b66341038bbe2bcd2755f07671f5d748a1c4c"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: runtime-switch-materials: \u0060packages/daemon/src/domain/runtime-switch-materials.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/runtime-switch-materials.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"124707df349b670732574fa2688bdc206786b88ecd324bc3d2e4513705a60317"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: runtime-switch-materials: \u0060packages/daemon/src/domain/runtime-switch-materials.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/runtime-switch-materials.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c85dbc3971bc3953f53c6a047b2fbfc1e2e5913629865b79e385914a63fb26d"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: runtime-verifier: \u0060packages/daemon/src/domain/runtime-verifier.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/runtime-verifier.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a06d28403b5803038c410ae433570cb2f086f0a417db69e19f71b2fab13c586"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: node-file: \u0060packages/daemon/src/domain/scope/node-file.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/scope/node-file.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab8b97ab4924bfd3394526c5e50296f36b7b794fa797406ded234a9c21a9d761"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: scope-approve: \u0060packages/daemon/src/domain/scope/scope-approve.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/scope/scope-approve.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b44a39ff88a45c548d6936882d69e380b469dbaa200194a13ae554c7f53af8d"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: seat-activity-service: \u0060packages/daemon/src/domain/seat-activity-service.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-activity-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"339f21fa2f33d848136b9f939f8acf1f07800021d98a8b5c0da455c35b812151"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: seat-attention-reconciler: \u0060packages/daemon/src/domain/seat-attention-reconciler.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-attention-reconciler.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f216a5c52af1b519a5e0885300af3952135e36423ae70958ce57e85bf290a25"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: seat-cwd-preparation: \u0060packages/daemon/src/domain/seat-cwd-preparation.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-cwd-preparation.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e41deb1e3f2798efc09974d09933fb641be8ba36ffbcd0765e9c78513bcb25"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: seat-delivery-guard: \u0060packages/daemon/src/domain/seat-delivery-guard.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-delivery-guard.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"f621c4d0568f60188a62e5d0f7dd09b621e8307075609d48a594aec24b77858f"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: seat-effort: \u0060packages/daemon/src/domain/seat-effort.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-effort.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"160f688d3c104d4c26c0e987f0132a31182c97bc166ba75f66b497f29180356b"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: seat-effort: \u0060packages/daemon/src/domain/seat-effort.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-effort.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"658f3b5a5f3ab7e08835f888aee84370caa33c673cb808d3636eeb29357cdc91"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: seat-handover-attempts: \u0060packages/daemon/src/domain/seat-handover-attempts.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-handover-attempts.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b37b732656a92f6296c008d84fbfd77b28a735f1d8d250913fdb909d688d6792"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: seat-handover-service: \u0060packages/daemon/src/domain/seat-handover-service.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8cf58cffcbd29d906d6038d8ca2e0dd3c67b6ce1a3bb51f22bff36c14803130"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: seat-handover-service: \u0060packages/daemon/src/domain/seat-handover-service.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d32c7cf6dceb61502251386be06762624a96fdece5f91fe45842713fa9d4c20"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: seat-identity-reconciler: \u0060packages/daemon/src/domain/seat-identity-reconciler.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-identity-reconciler.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"798b54b45e677117b54264179876c00f1a19e062b83469217f44bd65e47e7806"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: seat-identity-store: \u0060packages/daemon/src/domain/seat-identity-store.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-identity-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96434041e48c42e2a721fdd2af5585f29530298451d34a4021ad8253da5c7171"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: seat-launch-additions: \u0060packages/daemon/src/domain/seat-launch-additions.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-launch-additions.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c497913b8c64ed0dff28869b3b2c60029b2ef0a94b5e8ce004a5b213e253f8a"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: seat-launch-environment: \u0060packages/daemon/src/domain/seat-launch-environment.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-launch-environment.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"665372b190a5bf3424254e575130f07a3b8f5511778787055157211bb40fab7f"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: seat-lifecycle-service: \u0060packages/daemon/src/domain/seat-lifecycle-service.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a8b6b4f81c6b48a88e92fc09a004bcb52825ca3cd625cbef06bd7dccac5268"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: seat-lifecycle-service: \u0060packages/daemon/src/domain/seat-lifecycle-service.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff179c92c6ec3dc6195d8a69699cd5231a012799e41d24f6dcd9e3caf298bfe"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: seat-restart-in-place: \u0060packages/daemon/src/domain/seat-restart-in-place.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-restart-in-place.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8f5ba3d10d9e35134f744b1d7d2a2e1a596ce8c51377a197b9bb9889c43253"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: seat-restart-in-place: \u0060packages/daemon/src/domain/seat-restart-in-place.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-restart-in-place.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"337f2fb04bf4818170a89259f8a7c55fc544376ca6da72c803facf3ee6999934"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: seat-restart-in-place: \u0060packages/daemon/src/domain/seat-restart-in-place.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-restart-in-place.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f11dce383c967650471af5a0340e17ed4280cebc4bfc6bd1d301940c07aa70"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: seat-runtime-home-record: \u0060packages/daemon/src/domain/seat-runtime-home-record.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-runtime-home-record.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"c00b773e796b011e689c4d5a6277e7f45639271fea202a113c81718febf56b05"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: seat-runtime-home-record: \u0060packages/daemon/src/domain/seat-runtime-home-record.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-runtime-home-record.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe13b829de9ee87541a454274696546280507764b3f96f6c215a6c63043b8a26"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: seat-runtime-home: \u0060packages/daemon/src/domain/seat-runtime-home.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-runtime-home.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c3f6793dd484d56b93e73dc856b091b092158076a57c45b6725f9959e5bb67"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: seat-runtime-switch-service: \u0060packages/daemon/src/domain/seat-runtime-switch-service.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-runtime-switch-service.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe34cbf91d6830273f7f2e47ed82dadd27e9d9ae361a6d11a47cf296e99df4db"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: seat-runtime-switch-service: \u0060packages/daemon/src/domain/seat-runtime-switch-service.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-runtime-switch-service.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bda72af4af5eca147b94890af238b4e79021ba19b6c3ddab00a88b473d56341"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: seat-runtime-switch-service: \u0060packages/daemon/src/domain/seat-runtime-switch-service.ts\u0060 (domain layer) depends on \u0060../openrig-compat.js\u0060 (import of \u0060packages/daemon/src/openrig-compat.ts\u0060) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-runtime-switch-service.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa29f0de76a4b85ec395dddf407be331c27cc4043cd7ed74681bbc0f593fe4d4"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: seat-skill-apply: \u0060packages/daemon/src/domain/seat-skill-apply.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-skill-apply.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92f3f931e45bebae682c60138a7a29e4ef9924ba661662a7551aac279fdb3751"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: seat-skill-apply: \u0060packages/daemon/src/domain/seat-skill-apply.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-skill-apply.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"11956da640e6d2a79dd93e9fe64a7eee819d52d9362e5557f5d636648960745c"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: seat-skill-storage: \u0060packages/daemon/src/domain/seat-skill-storage.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"bddb7f573b7be75c747ac3bbbafc591caeffffb1ea11f0b5d9b5821078a3a22f"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: seat-skill-storage: \u0060packages/daemon/src/domain/seat-skill-storage.ts\u0060 (domain layer) depends on \u0060../openrig-compat.js\u0060 (import of \u0060packages/daemon/src/openrig-compat.ts\u0060) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d93e4ab8be5f549b0af54c8f991457d07f982351dd6f1eafbcf296bc2176ef"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: seat-structural-activity-service: \u0060packages/daemon/src/domain/seat-structural-activity-service.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-structural-activity-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba93954b0b43fba8a2430a731895f2cfd1e6c6b1ed1aed30967470bbda313dac"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: self-attach-service: \u0060packages/daemon/src/domain/self-attach-service.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/self-attach-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7010291acd6f19d7f6e7b7714b45747e4f085bd36d6e89b406e793ba99523baf"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: self-attach-service: \u0060packages/daemon/src/domain/self-attach-service.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/self-attach-service.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ee7e9a7baa1ef9bed3f4db7a19dd7240269e62f2e310e01dfc245951de3b20"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: session-jsonl: \u0060packages/daemon/src/domain/session-jsonl.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/session-jsonl.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d482f28ac3d3a6f4a63ad5ec8a3ccd15e8b4579296b5c9f6dd2f564724da2406"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: session-owner: \u0060packages/daemon/src/domain/session-owner.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/session-owner.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6bb94d94c96c46bdd22fbfb709ccfd36dc34f6b314de2fa59b842c6f95973f7"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: session-registry: \u0060packages/daemon/src/domain/session-registry.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/session-registry.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"275287db35d265801f3c6051fd720e058417f55814d4d322b89e88385f6cafa8"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: session-source-rebuild-resolver: \u0060packages/daemon/src/domain/session-source-rebuild-resolver.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/session-source-rebuild-resolver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ca4de49850e21b33453bc5bab16566b054e4d76eaf5b1fcea78862010e6b5d"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: session-transport: \u0060packages/daemon/src/domain/session-transport.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/session-transport.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4dbcce7108e0694c0381ba6c40fbb9c00b5625ab5a0604435ad96cb7f9b88a"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: shadow-capture: \u0060packages/daemon/src/domain/shadow-capture.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/shadow-capture.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5f7a08e3e42f55fa21ac05c13baec239d7ec4f84d75cdf8946995a89517861"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: shadow-capture: \u0060packages/daemon/src/domain/shadow-capture.ts\u0060 (domain layer) depends on \u0060node:fs/promises\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/shadow-capture.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"4795b138ab3d091fe01ba17133e52325fb8ed736c530d08f9541d624c82fa3fd"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: skill-audit: \u0060packages/daemon/src/domain/skill-audit.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/skill-audit.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"836b78936addfe9b21cde4d7ee81fc8760c7416eadd5d49e26fabded19be4d11"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: skill-catalog: \u0060packages/daemon/src/domain/skill-catalog.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/skill-catalog.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"c21b60612f02f8a9aa8181bb628f6bfd1b71f197645a866098f7da09d4d69ff0"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: skill-discovery: \u0060packages/daemon/src/domain/skill-discovery.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/skill-discovery.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea07b6e514f44d2c2e0777a4a8c29089bd9bf837b68468270e7615a2642f6cd6"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: skill-discovery: \u0060packages/daemon/src/domain/skill-discovery.ts\u0060 (domain layer) depends on \u0060node:fs/promises\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/skill-discovery.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"351de63a0b7e09110182b231707df12112e345195b2c8ea877c3093ba72d51c8"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: skill-library-discovery: \u0060packages/daemon/src/domain/skill-library-discovery.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/skill-library-discovery.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e1f93587092fb38a363ab4957af4127e7d7f9f5094c1d65c087251f9675402"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: skill-mirror-drift: \u0060packages/daemon/src/domain/skill-mirror-drift.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/skill-mirror-drift.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"905e02b59eb90be2202ec667bf68c6e0576afb8f59a07ac58219bd0f2d03a131"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: slice-detail-projector: \u0060packages/daemon/src/domain/slices/slice-detail-projector.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/slices/slice-detail-projector.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fdac755d81d4198c8b773412f4069643e2e2ee3f9bb4c8825b0e8382f8eaf5e"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: slice-detail-projector: \u0060packages/daemon/src/domain/slices/slice-detail-projector.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/slices/slice-detail-projector.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2110070d91540fa122346268c3b9a1cff859cfe91463ec7204734a9ae472ba"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: slice-indexer: \u0060packages/daemon/src/domain/slices/slice-indexer.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08ab4ad5db591e09fbe9842eba453f126597da304ae6e2e9216181dc3cc59e3"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: slice-indexer: \u0060packages/daemon/src/domain/slices/slice-indexer.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"13471e77615710d3cd68dd682bd7e59faa879428e5b8a10a1db0729e83c42fde"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: slow-op-recorder: \u0060packages/daemon/src/domain/slow-op-recorder.ts\u0060 (domain layer) depends on \u0060hono\u0060 (import) \u2014 a HTTP module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/slow-op-recorder.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e737a47dd4f509247a99101c1c4ee4224b7ab98ad87d48f05bd8b12b541bfb"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: snapshot-capture: \u0060packages/daemon/src/domain/snapshot-capture.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/snapshot-capture.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59cec66c832b2e899202b751b22d096fa858b9bdf800b4d512623fdc7a27b1b"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: snapshot-repository: \u0060packages/daemon/src/domain/snapshot-repository.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/snapshot-repository.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb8fcd27f791094ce9cd7c61afb70636315514c58b4e7b9eaeef69a5204960c"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: spec-library-service: \u0060packages/daemon/src/domain/spec-library-service.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/spec-library-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb90548100889910c43d02b770ea90d15d28e8af67d247fbca4fbbd962d44a6a"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: spec-library-service: \u0060packages/daemon/src/domain/spec-library-service.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (dynamic import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/spec-library-service.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ef09f424ac266a758d76e09cf3f55997713fc6183ef4522105c4c3ab6b17b5"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: spec-library-workflow-scanner: \u0060packages/daemon/src/domain/spec-library-workflow-scanner.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/spec-library-workflow-scanner.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad2c1ae3a54727ca5face86b67e11b70dd5400ba073f085bdb58ee61f26003c"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: spec-library-workflow-scanner: \u0060packages/daemon/src/domain/spec-library-workflow-scanner.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/spec-library-workflow-scanner.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf84e97669c41bb79e7acc2b5d9f65b41a0ee2e5c9b570dcd4c84800161940c7"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: startup-orchestrator: \u0060packages/daemon/src/domain/startup-orchestrator.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/startup-orchestrator.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a37f84169565dfdb4b15b4547bfb6a5009586e88abe608fa6ea879ae6e329d4"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: startup-proof: \u0060packages/daemon/src/domain/startup-proof.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/startup-proof.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ab0cbf7e5a548003911be1e99ea9078b314fe771cfe1acd152226372a48375"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: health-summary: \u0060packages/daemon/src/domain/steering/health-summary.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/steering/health-summary.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd37272bb708048768166d39cfaae5c01b6229588cccebfa0bb90e5f4f0a9ac0"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: steering-composer: \u0060packages/daemon/src/domain/steering/steering-composer.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/steering/steering-composer.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"9625b2fd70d739c7209c6150414d0d9fc49ffc091bdc02a3edb8a2ed42f50bac"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: stream-dispositions: \u0060packages/daemon/src/domain/stream-dispositions.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/stream-dispositions.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6c778a45b18834cadf47305bf69e27d8e7ac35ab7e0f040bed870f1a374a24"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: stream-intake: \u0060packages/daemon/src/domain/stream-intake.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/stream-intake.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45dc04f7bea2968b373bb10aa1421da022d6dfd428f2e2b5b185b81295a29d05"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: stream-reader-actions: \u0060packages/daemon/src/domain/stream-reader-actions.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/stream-reader-actions.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad0c6fcf32634d12f183bc3e0fbf63c01dca1a4f61e5f74da0d19049f50ea98"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: stream-store: \u0060packages/daemon/src/domain/stream-store.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/stream-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a315fe57854184a8d94ff37f2ceaed3982debcf104516d4698a5e133b3392888"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: stream-subscriptions: \u0060packages/daemon/src/domain/stream-subscriptions.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/stream-subscriptions.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"332733a091c129496f7139fb83357c401791082ef9f1fb4b34895d2f64a6c2b8"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: system-world: \u0060packages/daemon/src/domain/system-world.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/system-world.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98a606835da5d67833b9028904af7d197a4ae0ff9291a1e08c37c259c1fd337"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: terminal-policy: \u0060packages/daemon/src/domain/terminal-policy.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/terminal-policy.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21006343c0003a39f9128f06fdf759a7d9ddf3fc539eb3571dd80009a001d79e"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: terminal-seat: \u0060packages/daemon/src/domain/terminal-seat.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/terminal-seat.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa5ad0535bad713d759ea3c69ff473fee73ead071482d53e1258f803977dbf4"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: herdr-app-install: \u0060packages/daemon/src/domain/terminal/herdr-app-install.ts\u0060 (domain layer) depends on \u0060node:fs/promises\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/terminal/herdr-app-install.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8ce2e66b9db12ea6145d44700133f725f2f3bdfc281ac9e8e7df491360832c"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: herdr-app-provider: \u0060packages/daemon/src/domain/terminal/herdr-app-provider.ts\u0060 (domain layer) depends on \u0060node:fs/promises\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/terminal/herdr-app-provider.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"3510a697547d32c61eae149ad37583e3e6eb4a369730b0b97470a19da4f3b675"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: herdr-app-state: \u0060packages/daemon/src/domain/terminal/herdr-app-state.ts\u0060 (domain layer) depends on \u0060node:fs/promises\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/terminal/herdr-app-state.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93cc65d6459bce7b607bae6ac7a1c9cef5582220732570442f915a8080ec07d"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: herdr-follow-view: \u0060packages/daemon/src/domain/terminal/herdr-follow-view.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/terminal/herdr-follow-view.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"18c194b59411cccf4b25d203239009b3c40a6aab41710dfe73d49544e86242fb"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: herdr-follow-view: \u0060packages/daemon/src/domain/terminal/herdr-follow-view.ts\u0060 (domain layer) depends on \u0060../../openrig-compat.js\u0060 (import of \u0060packages/daemon/src/openrig-compat.ts\u0060) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/terminal/herdr-follow-view.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b233e4d89d276c42381a52fd5ef3b76c8a158988834acbfcc97ae8142a36d73"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: herdr-viewer: \u0060packages/daemon/src/domain/terminal/herdr-viewer.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/terminal/herdr-viewer.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a736dafebfc2bf5dcbde29e596a634dce15f0c54c8efe825940e7899858e5e"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: herdr-viewer: \u0060packages/daemon/src/domain/terminal/herdr-viewer.ts\u0060 (domain layer) depends on \u0060../../openrig-compat.js\u0060 (import of \u0060packages/daemon/src/openrig-compat.ts\u0060) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/terminal/herdr-viewer.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ea69065e6773681a42f64a9e2f89fafccb4bf05f9647d4858e55d3c2602195"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: login-shell: \u0060packages/daemon/src/domain/terminal/login-shell.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/terminal/login-shell.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d813194e8a7c39bbcdecc9aa92abe0a8dc7d1f1792992d75dee5d550a7cecf"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: rex-agent-status: \u0060packages/daemon/src/domain/terminal/rex-agent-status.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/terminal/rex-agent-status.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e3042888d96d203e5c7faa96c5a4234998144974bce2139e057bad00d1e6fd"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: rex-agent-status: \u0060packages/daemon/src/domain/terminal/rex-agent-status.ts\u0060 (domain layer) depends on \u0060node:fs/promises\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/terminal/rex-agent-status.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd48676f9532d00ec75234976d8a8108102a9d508a3d78002b0cf53770a70c2"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: rex-transport: \u0060packages/daemon/src/domain/terminal/rex-transport.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/terminal/rex-transport.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a32cf89a0359e80a487eb1e24cf61675f0318413db3187d3da3e9c25ddbdbb6"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: scope-task-terminal-view: \u0060packages/daemon/src/domain/terminal/scope-task-terminal-view.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/terminal/scope-task-terminal-view.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4acc6287cf76389820cfd230720c27734a35fee90df3773016337d3db9e45e57"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: scope-task-terminal-view: \u0060packages/daemon/src/domain/terminal/scope-task-terminal-view.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/terminal/scope-task-terminal-view.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"6497d0e1d5c5b85f6171b40640d2a9df01a7fa46218606639bf6313c3bf89f19"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: task-terminal-view: \u0060packages/daemon/src/domain/terminal/task-terminal-view.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/terminal/task-terminal-view.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"087be396d808f6af940b26223ef217d6efa8d3a627975c1a8e285021718e6de4"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: terminal-following: \u0060packages/daemon/src/domain/terminal/terminal-following.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/terminal/terminal-following.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cab0800bb3fe8f03e71540505c4dbd60f8d6bd8d9748ca9cd3a53f4cc3fb1dc"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: terminal-service: \u0060packages/daemon/src/domain/terminal/terminal-service.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/terminal/terminal-service.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"366db91ad8f8721b7a208263ff2cb34a3c66c224798ac71a4ec52364d46f73fe"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: terminal-service: \u0060packages/daemon/src/domain/terminal/terminal-service.ts\u0060 (domain layer) depends on \u0060../../openrig-compat.js\u0060 (import of \u0060packages/daemon/src/openrig-compat.ts\u0060) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/terminal/terminal-service.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b9fd0142775a56712187ef79a29e55972f5adbaa16fb7232002a06009d2596"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: terminal-views-store: \u0060packages/daemon/src/domain/terminal/terminal-views-store.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/terminal/terminal-views-store.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa1914dde4d37a742520e0bb5eef37797d286c4b16145cae75f66e8a43fb042f"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: terminal-views-store: \u0060packages/daemon/src/domain/terminal/terminal-views-store.ts\u0060 (domain layer) depends on \u0060../../openrig-compat.js\u0060 (import of \u0060packages/daemon/src/openrig-compat.ts\u0060) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/terminal/terminal-views-store.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fac84b2210391812fef4b427fe399339e1aaa7af744c0d81e16a87abe230ec8"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: tmux-server-selection: \u0060packages/daemon/src/domain/tmux-server-selection.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/tmux-server-selection.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00113b3c927bad235a14f0beba5cd514500f24202d3c4b40c9cd9614ab4f91cd"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: topology-defaults-installer: \u0060packages/daemon/src/domain/topology-defaults-installer.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/topology-defaults-installer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2451a5d7af24a26260afecd2aba4925378b4ed2b7330d026076edbd547c8d931"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: topology-manifest: \u0060packages/daemon/src/domain/topology/topology-manifest.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/topology/topology-manifest.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf8bf8e8fb36453b726f0365d15d4ed653ffb520538ecb23db0f0f648425641"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: transcript-capture: \u0060packages/daemon/src/domain/transcript-capture.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/transcript-capture.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb6b9c1ed5c4ce49aacbc48d0348d98aff83d488817a2345b8704381f9520562"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: transcript-rotation: \u0060packages/daemon/src/domain/transcript-rotation.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/transcript-rotation.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"b32e53d39b31be13ab40cea3fd6c2b8c5dea54e7db689f9f10ccea875329e1d2"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: transcript-store: \u0060packages/daemon/src/domain/transcript-store.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/transcript-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ff6bc3f95dc8f0572565395d6731d4aabb00a9c113a42f325873b30bb9009a"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: transcript-store: \u0060packages/daemon/src/domain/transcript-store.ts\u0060 (domain layer) depends on \u0060../openrig-compat.js\u0060 (import of \u0060packages/daemon/src/openrig-compat.ts\u0060) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/transcript-store.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e351e12f5b7efa323ff7a61b515778005a7e4d0b730ec5df1cd9a689e9dd9f"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: usage-samples-store: \u0060packages/daemon/src/domain/usage-samples-store.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/usage-samples-store.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca91d9e67443a33190605e08c886456abd6118056c1b0fa5f6d9f478d5cb7ddb"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: usage-series: \u0060packages/daemon/src/domain/usage-series.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/usage-series.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"91fd35cb2beb0377d98ef3a26502be7032a67660e045a21506087d65fde06040"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: settings-browser: \u0060packages/daemon/src/domain/user-settings/settings-browser.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/user-settings/settings-browser.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae6b722bff402fe709f327fdc7df716cad083118a4a2a83bd64f004b0f8aa40"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: settings-browser: \u0060packages/daemon/src/domain/user-settings/settings-browser.ts\u0060 (domain layer) depends on \u0060../../openrig-compat.js\u0060 (import of \u0060packages/daemon/src/openrig-compat.ts\u0060) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/user-settings/settings-browser.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a0fa93a55c92f5532a2d15f30dc262723887db7461e484fecf67f7fc185df2"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: settings-store: \u0060packages/daemon/src/domain/user-settings/settings-store.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/user-settings/settings-store.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b362740d7e0faae7beb4647fbdbc4bd6c53399ab42ea54f4e7ad7ea08aad14"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: view-projector: \u0060packages/daemon/src/domain/view-projector.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/view-projector.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"563e985baa70cba297a0dcb7aba85bd45456f5f3fdb58f8e000c43e92299ad66"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: watchdog-auto-registration: \u0060packages/daemon/src/domain/watchdog-auto-registration.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/watchdog-auto-registration.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"771903a74fce19c9e24b58e605dd88c94f76cf3f425e8e467f935e61fb35cd41"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: watchdog-history-log: \u0060packages/daemon/src/domain/watchdog-history-log.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/watchdog-history-log.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc5223e482981758685f7bd5f47103a6882cd9ef06343e845f1c424ae53bf29b"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: watchdog-jobs-repository: \u0060packages/daemon/src/domain/watchdog-jobs-repository.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/watchdog-jobs-repository.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69af577b43908d65c9b75c5315df044dcdad136ff694033755ef10de5008c525"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: whoami-service: \u0060packages/daemon/src/domain/whoami-service.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/whoami-service.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c874d547112e5b42d7c4232fd4bfca78dda1556efb4ebb2df004970e857a07"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: workflow-exception-escalation: \u0060packages/daemon/src/domain/workflow-exception-escalation.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/workflow-exception-escalation.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"006a0cd754af4a3d665a969c18510c59afce6bf31eba4fc3d4bffb29da1c49bd"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: workflow-exception-readiness: \u0060packages/daemon/src/domain/workflow-exception-readiness.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/workflow-exception-readiness.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e65940b70b6a41a50752b2adcf9fa62c21322447a02e608705d4f5210103dcf"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: workflow-frontier-guard: \u0060packages/daemon/src/domain/workflow-frontier-guard.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/workflow-frontier-guard.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe5b5f0414e49e3da36cbb41f8183cbbbdd4901a09152b6667bb4fd7ba562d6"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: workflow-guidance: \u0060packages/daemon/src/domain/workflow-guidance.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/workflow-guidance.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f11a247d921d91ce1f89be69feb77c9e5ab008eec826a4810588d032457cbc0"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: workflow-instance-store: \u0060packages/daemon/src/domain/workflow-instance-store.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/workflow-instance-store.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c23842b5bb0c058ef060464d0924c3c5c966ba89e60dd3602a80866dd536b2"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: workflow-planning-context: \u0060packages/daemon/src/domain/workflow-planning-context.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/workflow-planning-context.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24339d5de7a62e5323da1e725100d115bd010dbbc4fe9016de774c526ff75ca3"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: workflow-projector: \u0060packages/daemon/src/domain/workflow-projector.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/workflow-projector.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad41ab301f42068dfccfb4ee30935f3845d4a2a03747f7874827b811e2f8968"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: workflow-reconciliation: \u0060packages/daemon/src/domain/workflow-reconciliation.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/workflow-reconciliation.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f538f5801bc3f940728517cabb80d22551c3ce1a19c90460ea65a8ca86a2a911"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: workflow-reconciliation: \u0060packages/daemon/src/domain/workflow-reconciliation.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/workflow-reconciliation.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c6782fd8f6476b26e7a48c182fa51e01f9b6c3889fcce1803dac8f676da368"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: workflow-role-context: \u0060packages/daemon/src/domain/workflow-role-context.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/workflow-role-context.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6533dc2f2cbf3484aaf4b50b681e86387cfd38b8601cd22852523724935a82b"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: workflow-runtime: \u0060packages/daemon/src/domain/workflow-runtime.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/workflow-runtime.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"62372f5b601ac4863c30171af2377455da1dfbe30360e12e00680563e73baa2c"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: workflow-scope: \u0060packages/daemon/src/domain/workflow-scope.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/workflow-scope.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8811279928f3d2be780bfd8885d7c7acd143607cf3aea998bf28320c9261f1b"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: workflow-spec-cache: \u0060packages/daemon/src/domain/workflow-spec-cache.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/workflow-spec-cache.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d5c458a31dd2328b844fd0b2a8311b5498bc77b75615031ff285bd6d98bd382"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: workflow-spec-cache: \u0060packages/daemon/src/domain/workflow-spec-cache.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/workflow-spec-cache.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea501d5043665c20731937f251192a73ec2689ae2ddfdce3c31340c2d63d196"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: workflow-spec-unregister: \u0060packages/daemon/src/domain/workflow-spec-unregister.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/workflow-spec-unregister.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"902b022cddddb942d8e104e8a39b5817ff37d9e0abba3015215d210ec4ad1006"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: workflow-step-trail-log: \u0060packages/daemon/src/domain/workflow-step-trail-log.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/workflow-step-trail-log.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"de685c1695a8598ed994564e301f116e0d880e8f1030cc32bdc81536492c16f9"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: slice-workflow-binding: \u0060packages/daemon/src/domain/workflow/slice-workflow-binding.ts\u0060 (domain layer) depends on \u0060better-sqlite3\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/workflow/slice-workflow-binding.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"0778b82141ae7d7660ebe37a90b992dccd774ed1912425851f0c4463e0f28ba0"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: starter-spec-loader: \u0060packages/daemon/src/domain/workflow/starter-spec-loader.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/workflow/starter-spec-loader.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d5063964e1062f25b52bb81cd69ab5a667f26ecde8f4fce062769a32aa1437"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: default-workspace-scaffold: \u0060packages/daemon/src/domain/workspace/default-workspace-scaffold.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/workspace/default-workspace-scaffold.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"9556a8d1055d8d92eec7922f02760e4f5a0569dbfeaa68a9a7a0b4e3192a2f43"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: frontmatter-validator: \u0060packages/daemon/src/domain/workspace/frontmatter-validator.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/workspace/frontmatter-validator.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b37889110b1f32de74154e5837e158021b172f5f1420ca5ffaeca792c83d834"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: project-catalog: \u0060packages/daemon/src/domain/workspace/project-catalog.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/workspace/project-catalog.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bdf18f077d96c935082c1c5d1929240942f2fde1c8cb323ce0cfc2a6fd327e8"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: project-read: \u0060packages/daemon/src/domain/workspace/project-read.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/workspace/project-read.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b60f1164795318c8f8b665ff8262597d287b869625134b1c867a544013d2546b"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: project-registration: \u0060packages/daemon/src/domain/workspace/project-registration.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/workspace/project-registration.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcefc13e1f9067f1406b268999cba101605a90bf6cd87eba78e784c25a7aeab6"}},{"ruleId":"DM6","level":"error","message":{"text":"Domain depends on infrastructure: workspace-doctor: \u0060packages/daemon/src/domain/workspace/workspace-doctor.ts\u0060 (domain layer) depends on \u0060node:fs\u0060 (import) \u2014 a persistence module; the domain should own a port and let an infrastructure adapter implement it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/workspace/workspace-doctor.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f90d136390c9b4985870a364781dfb46104381bffdd949a5a3b1c28a13fdc9"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [data, status] decided in 8 places: packages.cli.src.client.DaemonResponse\u0027s [data, status] are judged in packages.cli.src.commands.ask, packages.cli.src.commands.gateway, packages.cli.src.commands.queue, packages.cli.src.commands.shrink, packages.cli.src.commands.slack, packages.cli.src.commands.stream-outcome, packages.cli.src.commands.terminal, packages.cli.src.lib.bundle-source \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0d5a55070f07e1fe8564c6dbef7ef3901f61d0d0cc5b08ec868570a71027f212"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [kind, sourceType] decided in 2 places: packages.cli.src.commands.specs.LibraryEntry\u0027s [kind, sourceType] are judged in packages.cli.src.commands.specs, packages.cli.src.commands.up \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9c9e09a932fbb97e08740e88f30beabadea85e79d59a9af058288d1d8fd19270"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [healthy, state] decided in 2 places: packages.cli.src.daemon-lifecycle.DaemonStatus\u0027s [healthy, state] are judged in packages.cli.src.commands.whoami, packages.cli.src.lib.bundle-source \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e2073c29fae5dfad7f21293124896414fc9594a8f9a58206fc07abb36deb6adc"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [port, state] decided in 3 places: packages.cli.src.daemon-lifecycle.DaemonStatus\u0027s [port, state] are judged in packages.cli.src.commands.queue, packages.cli.src.commands.send, packages.cli.src.system-preflight.SystemPreflight \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e42bd5e5cf86add51bd605e2b05ac9d06397164d3de246839d9d1811673bd3f7"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [outcome, owner] decided in 2 places: packages.daemon.src.domain.escalation-owner.EscalationOwner\u0027s [outcome, owner] are judged in packages.daemon.src.domain.queue-stuck-sweep, packages.daemon.src.domain.queue-wake-ladder \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"69041066c96e443a60ae657ecab9af603531b30094f8ff814b4d7f54c51a968b"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [dir, id] decided in 2 places: packages.daemon.src.domain.execution-view.SliceFacts\u0027s [dir, id] are judged in packages.daemon.src.domain.execution-view, packages.tui.src.execution.execution-model \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"09c7834893365983cbfbd7e5d6393978ffabb72a8cef31bad69d1940e0136264"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [nodeId, runtime] decided in 2 places: packages.daemon.src.domain.expected-conversation.ExpectedConversation\u0027s [nodeId, runtime] are judged in packages.daemon.src.domain.expected-conversation, packages.daemon.src.routes.startup \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f6030390d97f023ff8febef13fdeaa3430edfea25d5b11bb150197f445f2892f"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [kind, role] decided in 3 places: packages.daemon.src.domain.gateway.human-registry.HumanConnectorBinding\u0027s [kind, role] are judged in packages.daemon.src.domain.gateway.slack.open-asks, packages.daemon.src.domain.gateway.slack.slack-subsystem, packages.daemon.src.routes.gateway \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8a4b82ebd8f954e208cf3bbd0acfc4fc25eed5536b3fedf0862757020ba01b17"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [subtype, thread_ts, ts] decided in 2 places: packages.daemon.src.domain.gateway.slack.inbound.SlackEvent\u0027s [subtype, thread_ts, ts] are judged in packages.daemon.src.domain.gateway.slack.channel-recovery.ChannelRecovery, packages.daemon.src.domain.gateway.slack.inbound \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"15fd79b91d17c094899beb701f6dc350309dde8e462b67efdcb45fdacd9c46c4"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [thread_ts, ts] decided in 2 places: packages.daemon.src.domain.gateway.slack.inbound.SlackEvent\u0027s [thread_ts, ts] are judged in packages.daemon.src.domain.gateway.slack.channel-recovery.ChannelRecovery, packages.daemon.src.domain.gateway.slack.inbound.InboundRouter \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d8401df5c9d951d47de91a7dc8a6e23a508794c44cd0b7c659ef1b025570260a"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [blockedOn, state] decided in 2 places: packages.daemon.src.domain.gateway.slack.queue-access.QueueItem\u0027s [blockedOn, state] are judged in packages.daemon.src.domain.queue-repository.QueueRepository, packages.daemon.src.domain.workflow-projector.WorkflowProjector \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3a5fe65b4a9c21a0044fba579602bcb53c70dbc47a17fae5b216d74d183e6845"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [closureReason, state] decided in 4 places: packages.daemon.src.domain.gateway.slack.queue-access.QueueItem\u0027s [closureReason, state] are judged in packages.daemon.src.domain.network.network-connector, packages.daemon.src.domain.runner-permissions.RunnerPermissions, packages.daemon.src.routes.hosts, packages.daemon.src.routes.queue \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0d35fbc9b4fce9181f88a8713745a2ee30ee85f944d0005d0887ee32e159dd0c"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [destinationSession, sourceSession] decided in 2 places: packages.daemon.src.domain.gateway.slack.queue-access.QueueItem\u0027s [destinationSession, sourceSession] are judged in packages.daemon.src.domain.environment-artifacts.EnvironmentArtifacts, packages.daemon.src.domain.queue-repository.QueueRepository \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7559e6789df65249be29e9dd27e49500b6621a2ec5f01d5b314604a2dd159c0d"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [deadline, entries] decided in 2 places: packages.daemon.src.domain.gateway.slack.recovery-budget.RecoveryBudget\u0027s [deadline, entries] are judged in packages.daemon.src.domain.gateway.slack.channel-recovery.ChannelRecovery, packages.daemon.src.domain.gateway.slack.thread-recovery.ThreadRecovery \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"cf95bba0c8f5bcd410505b849a28860e535c9b860d39f279b50169cf1fb1c319"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [pid, startedAt] decided in 2 places: packages.daemon.src.domain.native-process-lineage.ClaudeLaunchedProcess\u0027s [pid, startedAt] are judged in packages.daemon.src.domain.native-process-lineage, packages.daemon.src.domain.session-registry \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"805bddde91610059f383f51cdc1dab09131f279d1556387897b0ba22656b54fc"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [pgid, pid, tpgid] decided in 2 places: packages.daemon.src.domain.native-process-lineage.NativeProcessRow\u0027s [pgid, pid, tpgid] are judged in packages.daemon.src.domain.native-process-lineage, packages.daemon.src.domain.seat-handover-service.SeatHandoverService \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4d99206999238fb980e2e234414f62f17f7c616f5ed69239f8fdfd6297a78e53"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [pgid, tpgid] decided in 3 places: packages.daemon.src.domain.native-process-lineage.NativeProcessRow\u0027s [pgid, tpgid] are judged in packages.daemon.src.domain.native-process-lineage, packages.daemon.src.domain.seat-handover-service.SeatHandoverService, packages.daemon.src.domain.seat-identity-reconciler.SeatIdentityReconciler \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b103efa5924baf7ede3f9335d9ddfc78a94d2057815c7fee30b3c7716313512d"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [pid, ppid] decided in 2 places: packages.daemon.src.domain.native-process-lineage.NativeProcessRow\u0027s [pid, ppid] are judged in packages.daemon.src.domain.seat-identity-reconciler.SeatIdentityReconciler, packages.daemon.src.domain.seat-restart-in-place.CodexInPlaceRestart \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"393f1d87f4742b019046731d671f4c6f3c3db007dc084c77e82b8326f44e33bb"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [pid, startedAt] decided in 2 places: packages.daemon.src.domain.native-process-lineage.NativeProcessRow\u0027s [pid, startedAt] are judged in packages.daemon.src.domain.native-process-lineage, packages.daemon.src.domain.restore-orchestrator.RestoreOrchestrator \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b9144118efee45f5a6f05b8bdea624e7c437a5ee8b797fbf6c736571ba23133a"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [code, status] decided in 3 places: packages.daemon.src.domain.native-resume-probe.NativeResumeProbeResult\u0027s [code, status] are judged in packages.daemon.src.adapters.claude-code-adapter.ClaudeCodeAdapter, packages.daemon.src.adapters.claude-resume.ClaudeResumeAdapter, packages.daemon.src.adapters.codex-runtime-adapter.CodexRuntimeAdapter \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ba493fed149eac4eb7923b46db8aa02a8b5b9945a0ea273fc7c25e934a209c59"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [state, value] decided in 2 places: packages.daemon.src.domain.permission-drift.AppliedLaunchObservation\u0027s [state, value] are judged in packages.daemon.src.adapters.codex-resume.CodexResumeAdapter, packages.daemon.src.adapters.codex-runtime-adapter.CodexRuntimeAdapter \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4105001871e4ebfdbae7f0e69c4a6a792b01f5214a735c0bfecb2be4f3d8aa6c"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [category, classification] decided in 2 places: packages.daemon.src.domain.projection-planner.ProjectionEntry\u0027s [category, classification] are judged in packages.daemon.src.domain.rigspec-instantiator.PodRigInstantiator, packages.daemon.src.domain.runtime-switch-materials \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c411deb426a2dbdd031b7d976ee6f4f49a593a77a808ea7d27ca85fc19e19d32"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [category, mergeStrategy] decided in 6 places: packages.daemon.src.domain.projection-planner.ProjectionEntry\u0027s [category, mergeStrategy] are judged in packages.daemon.src.adapters.claude-code-adapter.ClaudeCodeAdapter, packages.daemon.src.adapters.codex-runtime-adapter.CodexRuntimeAdapter, packages.daemon.src.adapters.pi-runtime-adapter.PiRuntimeAdapter, packages.daemon.src.adapters.stub-runtime-adapter.StubRuntimeAdapter, packages.daemon.src.domain.rigspec-instantiator.PodRigInstantiator, packages.daemon.src.domain.runtime-switch-materials \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"464b1cbe66c1f031d080f0b1680cc1c1cfcb482f8154908b915e7f9296176855"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [outcome, reason] decided in 2 places: packages.daemon.src.domain.provider.provider-types.UsageRefreshOutcome\u0027s [outcome, reason] are judged in packages.daemon.src.domain.provider.claude-usage-windows.ClaudeUsageWindows, packages.daemon.src.domain.provider.usage-windows.UsageWindows \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"45afa8781a513a0f7624a04bfca56cf4551b258a13c55d248259739bd7e2678e"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [ownerNotificationKind, ownerNotificationLevel] decided in 2 places: packages.daemon.src.domain.queue-transition-log.QueueTransition\u0027s [ownerNotificationKind, ownerNotificationLevel] are judged in packages.daemon.src.domain.queue-repository, packages.daemon.src.domain.queue-repository.QueueRepository \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d833dc39b28ff659531d9304583201d3917419a92e609ac79527062aa5e23858"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [proofDirExists, proofDirHasEntries, proofFileExists] decided in 2 places: packages.daemon.src.domain.scope.scope-audit.ScopeAuditInput\u0027s [proofDirExists, proofDirHasEntries, proofFileExists] are judged in packages.cli.src.lib.scope.scope-audit, packages.daemon.src.domain.scope.scope-audit \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8a89afc0b9635ecbc98fdccb3db44456d14f7ca17d6c1641f1400a78a610f30a"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [nodeId, occupant, pane, session] decided in 2 places: packages.daemon.src.domain.seat-delivery-guard.GuardTarget\u0027s [nodeId, occupant, pane, session] are judged in packages.daemon.src.domain.queue-repository.QueueRepository, packages.daemon.src.domain.seat-delivery-guard.SeatDeliveryGuard \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e745e8456679bcd8909dc08f26dc0ae75dc114b85331e73a68833d31574065e0"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [reason, state] decided in 3 places: packages.daemon.src.domain.seat-structural-activity-service.StructuralObservation\u0027s [reason, state] are judged in packages.daemon.src.domain.node-inventory, packages.daemon.src.domain.seat-activity-service, packages.daemon.src.domain.seat-structural-activity-service.SeatStructuralActivityService \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9a2ba9fa0f54584fd9d4d0193b6459ca04a64c4dfed5468d8593cde32898da04"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [inputPhase, sent] decided in 7 places: packages.daemon.src.domain.session-transport.SendResult\u0027s [inputPhase, sent] are judged in packages.daemon.src.domain.claim-service, packages.daemon.src.domain.draft-aware-delivery.DraftAwareDelivery, packages.daemon.src.domain.pi-compaction-service.PiCompactionService, packages.daemon.src.domain.session-transport, packages.daemon.src.domain.session-transport.SessionTransport, packages.daemon.src.domain.watchdog-delivery, packages.daemon.src.routes.transport \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7dbca663f35f48b6e91bae51f506e9958352a16b20f3652e2e96f51c4fe5e7f8"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [reason, sent] decided in 2 places: packages.daemon.src.domain.session-transport.SendResult\u0027s [reason, sent] are judged in packages.daemon.src.domain.session-transport.SessionTransport, packages.daemon.src.routes.transport \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e6f652595dd3dc1cec91a2c1537d36e31d282e56ef7845fcf4c8fa65841b2f8e"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [pane_id, terminal_id, workspace_id] decided in 3 places: packages.daemon.src.domain.terminal.herdr-viewer.ViewerPane\u0027s [pane_id, terminal_id, workspace_id] are judged in packages.daemon.src.domain.terminal.herdr-follow-view.HerdrFollowView, packages.daemon.src.domain.terminal.herdr-viewer, packages.daemon.src.domain.terminal.herdr-viewer.HerdrViewer \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a3fb08aec36bdf451d920d7f405ccc1104733e0ba17419a8b844bac08a45ff37"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [paneCommand, readOnly] decided in 2 places: packages.daemon.src.domain.terminal.terminal-provider.ComposedPane\u0027s [paneCommand, readOnly] are judged in packages.daemon.src.domain.terminal.herdr-follow-view.HerdrFollowView, packages.daemon.src.domain.terminal.herdr-viewer.HerdrViewer \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3a811f69d621894a5678dc9928fc264fe43573c5b4ce32abaab2d1b12a00178b"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [evidenceSource, rawEvent, reason, stale] decided in 2 places: packages.daemon.src.domain.types.AgentActivity\u0027s [evidenceSource, rawEvent, reason, stale] are judged in packages.daemon.src.domain.agent-activity-store, packages.daemon.src.domain.queue-wake-ladder \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"2b6c2f31c10dd2898e2d7d72667d7cc3f5e25818a224fdefb2cb8e464626f194"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [reason, state] decided in 2 places: packages.daemon.src.domain.types.AgentActivity\u0027s [reason, state] are judged in packages.daemon.src.domain.node-inventory, packages.daemon.src.domain.session-transport.SessionTransport \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3e03d044410c04226cdc29d5f7d0062889612ca59b59996309b13f0f5fb0d014"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [id, tmuxSession] decided in 2 places: packages.daemon.src.domain.types.Binding\u0027s [id, tmuxSession] are judged in packages.daemon.src.routes.startup, packages.daemon.src.server \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0f622bc25caad2445d7288ce5d8030763def74ab758b74df00386f9c9dcb4e10"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [tmuxPane, tmuxSession] decided in 7 places: packages.daemon.src.domain.types.Binding\u0027s [tmuxPane, tmuxSession] are judged in packages.daemon.src.domain.codex-rebuild-permissions, packages.daemon.src.domain.expected-conversation, packages.daemon.src.domain.model-divergence.current-model-reader.CurrentModelReader, packages.daemon.src.domain.node-launcher.NodeLauncher, packages.daemon.src.domain.seat-runtime-switch-service.SeatRuntimeSwitchService, packages.daemon.src.domain.startup-orchestrator.StartupOrchestrator, packages.daemon.src.routes.sessions \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a124d3a70ab2ead20fee6f11a97e58494ac36bb8a17402b3f64533ce603e032a"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [id, logicalId] decided in 5 places: packages.daemon.src.domain.types.Node\u0027s [id, logicalId] are judged in packages.daemon.src.domain.node-launcher.NodeLauncher, packages.daemon.src.domain.restore-orchestrator.RestoreOrchestrator, packages.daemon.src.domain.shared-history-selection, packages.daemon.src.routes.sessions, packages.daemon.src.routes.startup \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"042dc3e1d9d65802d1d3e7a4d850a4369d7f484f9e124ce771f06a1cf51ec5e5"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [canonicalSessionName, logicalId] decided in 2 places: packages.daemon.src.domain.types.NodeInventoryEntry\u0027s [canonicalSessionName, logicalId] are judged in packages.daemon.src.domain.seat-lifecycle-service.SeatLifecycleService, packages.daemon.src.domain.seat-status-service.SeatStatusService \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ffe82d3934e0682ff012a3e1967c59d38eb6b0027baa25c0096849e5dbc880b2"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [evidence, sessionName, verdict] decided in 2 places: packages.daemon.src.domain.types.SeatIdentityVerdict\u0027s [evidence, sessionName, verdict] are judged in packages.daemon.src.domain.expected-conversation, packages.daemon.src.routes.sessions \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"11d07e9a3b4dd80d2d45eef0715bc3ad332bc9bd9485880cb58aacf0303b705f"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [createdAt, id] decided in 2 places: packages.daemon.src.domain.types.Session\u0027s [createdAt, id] are judged in packages.daemon.src.domain.kernel-boot, packages.daemon.src.domain.kernel-boot-tracker.KernelBootTracker \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"11c5fad3881f56a4bb53aaaddbd02d9559c93d990712d2f3bddc0e6f5bf42c73"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [id, nodeId] decided in 3 places: packages.daemon.src.domain.types.Session\u0027s [id, nodeId] are judged in packages.daemon.src.domain.rehydrate-eligibility, packages.daemon.src.domain.restore-orchestrator.RestoreOrchestrator, packages.daemon.src.routes.startup \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"81f87bb038accda147141de28f5c1925719e3f44a0e3462fcf448cc4491abfd5"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [nodeId, status] decided in 2 places: packages.daemon.src.domain.types.Session\u0027s [nodeId, status] are judged in packages.daemon.src.domain.restore-orchestrator.RestoreOrchestrator, packages.daemon.src.domain.seat-runtime-switch-service.SeatRuntimeSwitchService \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"426655629894a7b0541d0b36366875433f2b15b86eee90471b1c0a2d18a50e98"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [resumeToken, resumeType] decided in 2 places: packages.daemon.src.domain.types.Session\u0027s [resumeToken, resumeType] are judged in packages.daemon.src.domain.existing-rig-restore, packages.daemon.src.routes.startup \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a23173d08996d3aac2e110b94e94e22d10283f5df458d192327e2510f31106ea"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [intervalSeconds, specYaml] decided in 2 places: packages.daemon.src.domain.watchdog-jobs-repository.WatchdogJob\u0027s [intervalSeconds, specYaml] are judged in packages.daemon.src.domain.watchdog-job-update, packages.daemon.src.domain.watchdog-jobs-repository.WatchdogJobsRepository \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"27c14fc44f2c187829790be8756d144db16c2ba6208fc8cdc57550d00cf899e7"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [lastEvaluationAt, state] decided in 2 places: packages.daemon.src.domain.watchdog-jobs-repository.WatchdogJob\u0027s [lastEvaluationAt, state] are judged in packages.daemon.src.domain.watchdog-jobs-repository.WatchdogJobsRepository, packages.daemon.src.domain.watchdog-policy-engine.WatchdogPolicyEngine \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"adbe1f22eac6ada2bfa097eb80db254f9e3dd2a84ba6b75c2a13843743ae6f50"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [dirName, id] decided in 3 places: packages.tui.src.scopes.scopes-model.SliceScopeSnap\u0027s [dirName, id] are judged in packages.tui.src.execution.execution-model, packages.tui.src.main, packages.tui.src.render \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"2865ef2ff02a9f03b84e2264b3e2a5d6b9e4707f3444eb2adfd264a6b24fb147"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [id, root] decided in 3 places: packages.tui.src.types.ProjectSelection\u0027s [id, root] are judged in packages.tui.src.hydrate, packages.tui.src.render, packages.tui.src.state \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6763feac8d39cc1b449e873072b6c8c1cb93e9342ee967965f1d173fb7343667"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [kind, name] decided in 2 places: packages.tui.src.types.SpecEntry\u0027s [kind, name] are judged in packages.tui.src.commands.registry, packages.tui.src.state \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"acc044c9ea27338868c4b1e3fe9f5a88059c75b10d5cb7718c6c6ddd27c093b6"}},{"ruleId":"DM9","level":"note","message":{"text":"Rule about [drill, section] decided in 3 places: packages.tui.src.types.ViewState\u0027s [drill, section] are judged in packages.tui.src.input, packages.tui.src.render, packages.tui.src.state \u2014 the same decision, restated. Every copy is a chance to drift, and copies drift silently because each one looks correct on its own. Move the judgement onto the type that owns the members and let the call sites ask it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bfcff0d710d45a2e44f455d06514b009333d2e58e6a8b1c6403a883c2ec8c935"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060reopen\u0060 is declared \u0060async\u0060 but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop \u0060async\u0060 or do the real async work."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/reference/runner-conformance/fake-acp-agent.mjs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"691cf2b9e61f1b411bd2ded723cfd651eb40aeb23cced6e1ed26e56ff6f2ad27"}},{"ruleId":"IC1","level":"warning","message":{"text":"Both branches are identical \u2014 the condition decides nothing: Both arms of this conditional expression are the same, so no input can make the condition matter. Implement the distinction that was intended, or drop the condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/commands/policy.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"7359b178a98db51a6ad0df2b9b28372c097c6477639da02097a982b49592e947"}},{"ruleId":"IC1","level":"warning","message":{"text":"Guard cannot change the result \u2014 returns what the code already falls through to: The guard above \u0060return true;\u0060 also returns \u0060true\u0060, so no input can make it matter. Implement the distinction that was intended, or delete the guard."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/commands/ps.ts"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"b83fbb188de7048ffc253ff67fd49b88f4e8324e2b07c59718383afba9631638"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060preflight\u0060 is declared \u0060async\u0060 but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop \u0060async\u0060 or do the real async work."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/environment-startup.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf8a0fc9bc7efebfeb3b985d465c7c1dbac3896cc8cadec43f4223814ec452e"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060ensureVendored\u0060 is declared \u0060async\u0060 but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop \u0060async\u0060 or do the real async work."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/plugin-vendor-service.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf82583a6852435604fdb9824b6763634b8f5a9539394ca3b8e392567bd5bcc"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060refreshEscalationRowIfExists\u0060 is declared \u0060async\u0060 but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop \u0060async\u0060 or do the real async work."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/queue-wake-ladder.ts"},"region":{"startLine":1827}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e910f48139abb6688958b39c5b6148340d3a0c64a8930448beabdd04fa0d8e"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060launchBinding\u0060 is declared \u0060async\u0060 but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop \u0060async\u0060 or do the real async work."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":2194}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e0e418fb4b60ddeb441aceffda53f435c94422c61969b3b34fc653df470f81"}},{"ruleId":"IC1","level":"warning","message":{"text":"Fake-async \u2014 async method never awaits: \u0060cleanup\u0060 is declared \u0060async\u0060 but never awaits anything, so it runs synchronously while pretending to be asynchronous. Drop \u0060async\u0060 or do the real async work."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/successor-session-launcher.ts"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf83a58a630994e785b883301af87fb4bb970dbb2fb23e88756d8fee00c8e91"}},{"ruleId":"IC1","level":"warning","message":{"text":"Both branches are identical \u2014 the condition decides nothing: Both arms of this conditional expression are the same, so no input can make the condition matter. Implement the distinction that was intended, or drop the condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/routes/terminal-ws.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"a933f2e8d5c2db6698ca826a765919533cda8a05ea3b2524cda21916b106edb9"}},{"ruleId":"IC1","level":"warning","message":{"text":"Guard cannot change the result \u2014 returns what the code already falls through to: The guard above \u0060return \u0022dim\u0022;\u0060 also returns \u0060\u0022dim\u0022\u0060, so no input can make it matter. Implement the distinction that was intended, or delete the guard."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/tui/src/execution/execution-model.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"3582930fa63ed8883aacfc9fa82d988a06afcf653c3203d48b4ab10d79a55dca"}},{"ruleId":"IC1","level":"warning","message":{"text":"Guard cannot change the result \u2014 returns what the code already falls through to: The guard above \u0060return \u0022text\u0022;\u0060 also returns \u0060\u0022text\u0022\u0060, so no input can make it matter. Implement the distinction that was intended, or delete the guard."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/drawer-viewers/FileViewer.tsx"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"622e4b6335943d111c6c119c4a5f37486afcc7bde0bd1db40d6d301f09a49458"}},{"ruleId":"IC1","level":"warning","message":{"text":"Both branches are identical \u2014 the condition decides nothing: Both arms of this conditional expression are the same, so no input can make the condition matter. Implement the distinction that was intended, or drop the condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/topology/HybridTopologyNodes.tsx"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e53c2f4e72fba1d20f6b094245dc47bac8c69f946993f9bc0190aa46a86927"}},{"ruleId":"IC1","level":"warning","message":{"text":"Guard cannot change the result \u2014 returns what the code already falls through to: The guard above \u0060return \u0022action-required\u0022;\u0060 also returns \u0060\u0022action-required\u0022\u0060, so no input can make it matter. Implement the distinction that was intended, or delete the guard."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/lib/attention-feed.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"54da9e9721b3f31671fe3b9a07a307aff8879161058789eea761b6750bab706b"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060dispatchEvent\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/twin/eventsource-stub.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"216f6e7796626971d07a2e07a22e098fe0b9021b960e9b8715a5cd3b2e53e86d"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/test/mcp-daemon-endpoint-native.test.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9bb40ebe95a87ade31aceaea611001eab0728baf422f6f2dde7ee0fb8e95232"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/test/up.test.ts"},"region":{"startLine":1239}}}],"partialFingerprints":{"codehealthFindingId/v1":"81bcccacb474c02504b332d46cf956c4f93068e7ee0f80b7139679d9694a417a"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/precompact-hook.test.ts"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"643b0aff6cb84b8a356b194e5cf693bce5084eabb001f6c0efbb5f43112a7cbb"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/precompact-hook.test.ts"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a99c8e089060fafcfc36a1a067e8b1c64217775ec8dec9df8cf38dddbfa306e"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/test/topology-view-mode.test.tsx"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"5acee3634dc9317542b79ecc7856fc1caea19cebad4195fb37932d7b84f60ebc"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: README.md names Node.js 20, but the repository declares engines \u0060^22 || ^24\u0060, engines \u0060\u003E=22\u0060, engines \u0060\u003E=22\u0060, engines \u0060^22 || ^24\u0060. 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":"README.md"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85864071a30ab325207b0475304e4f6aa1b79c8e2996b50e4173a6d35a328ea"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/reference/getting-started.md names Node.js 20, but the repository declares engines \u0060^22 || ^24\u0060, engines \u0060\u003E=22\u0060, engines \u0060\u003E=22\u0060, engines \u0060^22 || ^24\u0060. 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/reference/getting-started.md"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"d97283a9d921e91d388bc7366007d07b69c31a97b5e3ed85d52a73b3862f65a3"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 1/6 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060.\u0060, \u0060.\u0060, \u0060packages/acp\u0060, \u0060packages/cli\u0060, \u0060packages/tui\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/openrig-compat.ts\u0060 reports through \u0060console.*\u0060 at line 23 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":"packages/daemon/src/openrig-compat.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9cb7eeb089af5f2d66fbe945ab5cc0737a149b8c7abfecf191763b07ed076c1"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/startup.ts\u0060 reports through \u0060console.*\u0060 at line 353 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":"packages/daemon/src/startup.ts"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f9756c2c617dce9c57dc67593a767f2c3762b44434df355f72925010a9d686"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/startup.ts\u0060 reports through \u0060console.*\u0060 at line 364 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":"packages/daemon/src/startup.ts"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c8bab2c915bd03a3dce8772f5f0d94da07baef5299b9212fc574ca74e6c1756"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/startup.ts\u0060 reports through \u0060console.*\u0060 at line 436 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":"packages/daemon/src/startup.ts"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7ec4061c0f8d17aebd3943b077dd89fb26b33f6b32adbabd5154f26b5be8ab"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/startup.ts\u0060 reports through \u0060console.*\u0060 at line 440 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":"packages/daemon/src/startup.ts"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ad5449669706fdc7e42787cebb71be400cc70711d887e12031e0c54fffb00f"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/startup.ts\u0060 reports through \u0060console.*\u0060 at line 580 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":"packages/daemon/src/startup.ts"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"da84bdc18182714285e32d2edf1672dc8e4678119403c81bd21f53f1c6f94b1b"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/startup.ts\u0060 reports through \u0060console.*\u0060 at line 586 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":"packages/daemon/src/startup.ts"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c028148378a04af85f85a891f037f7a449fa302eaca850b45dfc3fed62e1b3"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/startup.ts\u0060 reports through \u0060console.*\u0060 at line 588 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":"packages/daemon/src/startup.ts"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"8706e32b36ad35f5ec2e6763e06e2272a348b66755ccf3b10711cf0f0fde0fc6"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/startup.ts\u0060 reports through \u0060console.*\u0060 at line 617 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":"packages/daemon/src/startup.ts"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d7092b2def366679373f31d3db8a2e476c127bcd95023f14278a6b33eaa651"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/startup.ts\u0060 reports through \u0060console.*\u0060 at line 640 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":"packages/daemon/src/startup.ts"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa99f0c255144653ed3bbc9a1d2b40ff253e0d0c6a6b084121bbcdaa2fa30c7f"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/startup.ts\u0060 reports through \u0060console.*\u0060 at line 719 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":"packages/daemon/src/startup.ts"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"831794214213ed178c648042d7aabb1b28ee796f81b1cb95fcfa32d78b41ba45"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/startup.ts\u0060 reports through \u0060console.*\u0060 at line 722 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":"packages/daemon/src/startup.ts"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"efff33d8a1efe3327907554cb6e66762baa2a1d11c0758e3a2cfa17eb6af7c82"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/startup.ts\u0060 reports through \u0060console.*\u0060 at line 979 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":"packages/daemon/src/startup.ts"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6fcc7751995e56c3ce9f47d78aacd3cde70b9c370f6ab7cc0f3c59eaa8a9247"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/startup.ts\u0060 reports through \u0060console.*\u0060 at line 988 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":"packages/daemon/src/startup.ts"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84c93b8e4ab0faa3491a5759b6739d3157458d0ef935604bb5bbbc1f73661c3"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/startup.ts\u0060 reports through \u0060console.*\u0060 at line 995 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":"packages/daemon/src/startup.ts"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"1965d9c95ded399515f32d6bce10d53dda4f6cee6b873b6d23736fee93bc52de"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/startup.ts\u0060 reports through \u0060console.*\u0060 at line 1001 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":"packages/daemon/src/startup.ts"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2c271baedc5b782dd3739db781e00cbb0283cabfaf5679320cd288e53214cd"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/startup.ts\u0060 reports through \u0060console.*\u0060 at line 1015 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":"packages/daemon/src/startup.ts"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0f5c797dd04d44d5b8c3a39134c8e0cab755a9e16ddf6f313e9134ea7e7370"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/startup.ts\u0060 reports through \u0060console.*\u0060 at line 1089 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":"packages/daemon/src/startup.ts"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc3749b5dfeb2e04156fca5b6450ae6640d4f19bc0c66a5318d141052c99d83"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/startup.ts\u0060 reports through \u0060console.*\u0060 at line 1143 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":"packages/daemon/src/startup.ts"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6d6fe82b784705be314bf10db9ac590e71f341793b7a8f12d74aa2be5fd05e"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/startup.ts\u0060 reports through \u0060console.*\u0060 at line 1171 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":"packages/daemon/src/startup.ts"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4a4dba7e1a79c8a8dfd4eb8e6a8516d7d8b8c2341762d166b2453f10e122d9"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/startup.ts\u0060 reports through \u0060console.*\u0060 at line 1181 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":"packages/daemon/src/startup.ts"},"region":{"startLine":1181}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ac2d2fa6d0ff31a6bffecc2aea843b6f3ac76c4ddeafafcecf13f47eb2e5eb"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/startup.ts\u0060 reports through \u0060console.*\u0060 at line 1195 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":"packages/daemon/src/startup.ts"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd22c2b1225a82f3cea86cc56e761ae35c13783c5d640de44fe50881840b307c"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/startup.ts\u0060 reports through \u0060console.*\u0060 at line 1198 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":"packages/daemon/src/startup.ts"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d9c626cacf70e3065bfeb23a4d6a0f0c5ec9cf73680a0f1f671da08c64ec0d6"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/startup.ts\u0060 reports through \u0060console.*\u0060 at line 1207 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":"packages/daemon/src/startup.ts"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"e772e7842db6b8e4240a59d4e23025ccd2e050c41b230e1016f5b75f3442afae"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/startup.ts\u0060 reports through \u0060console.*\u0060 at line 1411 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":"packages/daemon/src/startup.ts"},"region":{"startLine":1411}}}],"partialFingerprints":{"codehealthFindingId/v1":"4907e469a7603e1e68899b0ec7de6510db0844b36df25ad13d5dba7e2b79a331"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/startup.ts\u0060 reports through \u0060console.*\u0060 at line 1416 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":"packages/daemon/src/startup.ts"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d3c2d7ad215a9893ab61c639b89c953bfd70ff605ec89379f727e1ad799f95"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/startup.ts\u0060 reports through \u0060console.*\u0060 at line 1588 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":"packages/daemon/src/startup.ts"},"region":{"startLine":1588}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc73a2f7eeafff3dc5e8babc10311052b48e9f7b9be442be74a323ddebea46c"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/startup.ts\u0060 reports through \u0060console.*\u0060 at line 1593 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":"packages/daemon/src/startup.ts"},"region":{"startLine":1593}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68d022e1918e0c30ed82dcfb3b6d266a324ca8d4fbe5204202af55cbb0be5f8"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/startup.ts\u0060 reports through \u0060console.*\u0060 at line 1973 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":"packages/daemon/src/startup.ts"},"region":{"startLine":1973}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd21af1b2bb9919a67324e72d5d772c4a82d1571efb13f643c56eec01e2113c"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/startup.ts\u0060 reports through \u0060console.*\u0060 at line 2030 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":"packages/daemon/src/startup.ts"},"region":{"startLine":2030}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43f779ded7afd5da0904052080c7af18e1d8f4fb114a10b4729b42553af007d"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/startup.ts\u0060 reports through \u0060console.*\u0060 at line 2671 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":"packages/daemon/src/startup.ts"},"region":{"startLine":2671}}}],"partialFingerprints":{"codehealthFindingId/v1":"58025432ed5e7ec2a9a0fc515ad7bd2e789680f8c4c70347c4ec47b963d33a50"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/startup.ts\u0060 reports through \u0060console.*\u0060 at line 2806 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":"packages/daemon/src/startup.ts"},"region":{"startLine":2806}}}],"partialFingerprints":{"codehealthFindingId/v1":"29700584ad824ad13019e49c3df4fb6ffa53943c1c686fbc89b57a95e805cbd4"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/startup.ts\u0060 reports through \u0060console.*\u0060 at line 2812 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":"packages/daemon/src/startup.ts"},"region":{"startLine":2812}}}],"partialFingerprints":{"codehealthFindingId/v1":"aebaa5fd1b512d36a80550e38b0b090c42e8470f6f54eda8da6c1d7757483d19"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/startup.ts\u0060 reports through \u0060console.*\u0060 at line 2912 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":"packages/daemon/src/startup.ts"},"region":{"startLine":2912}}}],"partialFingerprints":{"codehealthFindingId/v1":"44925e4927cb590418619525b33854957a77b64ec1f71545b2c06bd801ba6a0c"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/startup.ts\u0060 reports through \u0060console.*\u0060 at line 2922 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":"packages/daemon/src/startup.ts"},"region":{"startLine":2922}}}],"partialFingerprints":{"codehealthFindingId/v1":"8384a7a66a8bd9df0ecb211df55b0de9ff8d6a9c3ac27fdd483635bedcdc1043"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/startup.ts\u0060 reports through \u0060console.*\u0060 at line 2978 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":"packages/daemon/src/startup.ts"},"region":{"startLine":2978}}}],"partialFingerprints":{"codehealthFindingId/v1":"5720cc080ee8457b0726eb45664c6833cc4b4f484dbbc2de0e481aab3b651e36"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/startup.ts\u0060 reports through \u0060console.*\u0060 at line 2980 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":"packages/daemon/src/startup.ts"},"region":{"startLine":2980}}}],"partialFingerprints":{"codehealthFindingId/v1":"78647208e16f071d892266c02d908ad2e0195e2f2f87372dcde69c48d659d2cc"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/tmux-server-start.ts\u0060 reports through \u0060console.*\u0060 at line 35 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":"packages/daemon/src/tmux-server-start.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb87847245c957c497d3037d6690478cc6d3cf675d2ec1bdbd946a960fbea84"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/routes/bundles.ts\u0060 reports through \u0060console.*\u0060 at line 795 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":"packages/daemon/src/routes/bundles.ts"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0cf1e3d27aaa918bc9c5f07b24fe0c2f76946cc769a569304138965d4bf0b50"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/routes/queue.ts\u0060 reports through \u0060console.*\u0060 at line 961 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":"packages/daemon/src/routes/queue.ts"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"2575bd2c4dd40fe0d6a31f35a9b85c5df5dae2530e026e23fa66370b2d53e263"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/routes/rig-delivery-drain.ts\u0060 reports through \u0060console.*\u0060 at line 42 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":"packages/daemon/src/routes/rig-delivery-drain.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ab44e3115891b125a96b3d7897057ba307af44102775f95db61b64ce1d4602"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/routes/transport.ts\u0060 reports through \u0060console.*\u0060 at line 278 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":"packages/daemon/src/routes/transport.ts"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15187e3713217bc1e5a0ab9e49182eb53b8740dde39103ea3d620f73eef1728"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/routes/transport.ts\u0060 reports through \u0060console.*\u0060 at line 459 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":"packages/daemon/src/routes/transport.ts"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"09167c24523f7fd51f12bd275b33ce0c062ac49cfe3cdd8ac303b23cea41ce3b"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/middleware/browser-boundary.ts\u0060 reports through \u0060console.*\u0060 at line 207 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":"packages/daemon/src/middleware/browser-boundary.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"867641538e1ba5a2527d9b3d6384383a2079e0c4a72ccd2beed9d2c29cce6c78"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/middleware/json-body-error.ts\u0060 reports through \u0060console.*\u0060 at line 55 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":"packages/daemon/src/middleware/json-body-error.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d2762ab7ae5f102dfee1aea8b39299052cd42244a721f8ea0f50ba29cf3422"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/claim-service.ts\u0060 reports through \u0060console.*\u0060 at line 260 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":"packages/daemon/src/domain/claim-service.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"d669b46efd57fb83dadaa4ce4b55b455619bf360f87a9947fcf3b24a65550323"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/codex-network-default.ts\u0060 reports through \u0060console.*\u0060 at line 104 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":"packages/daemon/src/domain/codex-network-default.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d0068afe0676eb753bf56db25647a50f360a35bfc2c997c34ca9922589938b"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/codex-team-workspace.ts\u0060 reports through \u0060console.*\u0060 at line 41 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":"packages/daemon/src/domain/codex-team-workspace.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"727785713338f22eaa8c59fe55ad140c0984c086bc4467d13c716e7a6022904e"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/codex-team-workspace.ts\u0060 reports through \u0060console.*\u0060 at line 67 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":"packages/daemon/src/domain/codex-team-workspace.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"7968b876ceb481335dde1d85032dc8d5e893fd66a9e454fe696f8b347afa0583"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/codex-team-workspace.ts\u0060 reports through \u0060console.*\u0060 at line 80 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":"packages/daemon/src/domain/codex-team-workspace.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"821ac3d9931563833494e2aa2fa3644ce3281406b334a70623ce3b0be40fb132"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/event-bus.ts\u0060 reports through \u0060console.*\u0060 at line 253 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":"packages/daemon/src/domain/event-bus.ts"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5a09c28ee45233be3a408062bd28470a34a6df8c392f3cf4c583106969bac0"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/event-bus.ts\u0060 reports through \u0060console.*\u0060 at line 285 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":"packages/daemon/src/domain/event-bus.ts"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"148e42d4b50a58776ffb547d87696ab86b6039958f282406a5cd4688f16592f2"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/generated-file-hygiene.ts\u0060 reports through \u0060console.*\u0060 at line 21 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":"packages/daemon/src/domain/generated-file-hygiene.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c4a7fe9384267a31e1a9737d16e98d4dfcc58a46b9d861e806762f69a5ef8f5"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/generated-file-hygiene.ts\u0060 reports through \u0060console.*\u0060 at line 75 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":"packages/daemon/src/domain/generated-file-hygiene.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"d60136debc6edba815b7786c6f8eeb5aae70039ce152f84b4e5635c9bd5281b6"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/hook-bridge.ts\u0060 reports through \u0060console.*\u0060 at line 271 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":"packages/daemon/src/domain/hook-bridge.ts"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2195955deda10974cac3f02d31c62c10c449abec34079f06f991f9a70e3b447"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/hook-bridge.ts\u0060 reports through \u0060console.*\u0060 at line 283 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":"packages/daemon/src/domain/hook-bridge.ts"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"d40e7beccc437b74394e12160c045167eef0d3d300a7961f24839ef99827e3f7"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/kernel-boot.ts\u0060 reports through \u0060console.*\u0060 at line 389 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":"packages/daemon/src/domain/kernel-boot.ts"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fdeb1059aa8e382db82833f89e732c3ec769d20f16c54105201b77314cfba0a"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/kernel-boot.ts\u0060 reports through \u0060console.*\u0060 at line 390 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":"packages/daemon/src/domain/kernel-boot.ts"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"359eac14b5cff8de58983970163357edd3fd60d93a6b0512f4bb6129368eb30d"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/kernel-boot.ts\u0060 reports through \u0060console.*\u0060 at line 391 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":"packages/daemon/src/domain/kernel-boot.ts"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"eafe24569a7e315dc555396dfaa71bdd20aa53bd240d8a021a2bc1f3f4c151b3"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/queue-repository.ts\u0060 reports through \u0060console.*\u0060 at line 1619 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":"packages/daemon/src/domain/queue-repository.ts"},"region":{"startLine":1619}}}],"partialFingerprints":{"codehealthFindingId/v1":"8952dd024336350f8d6ba70583cf44c750a1e4999ae2a9410246047c15974ba3"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/queue-repository.ts\u0060 reports through \u0060console.*\u0060 at line 1903 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":"packages/daemon/src/domain/queue-repository.ts"},"region":{"startLine":1903}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4dc5d56675032a481bd981477be666824b96cb52a5107290b5c52bbc46fc642"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/queue-repository.ts\u0060 reports through \u0060console.*\u0060 at line 4540 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":"packages/daemon/src/domain/queue-repository.ts"},"region":{"startLine":4540}}}],"partialFingerprints":{"codehealthFindingId/v1":"b03dc4d596d31dbf35df39943636f5f87c3beb2f7f5c6b806e4c497df73a267c"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/queue-repository.ts\u0060 reports through \u0060console.*\u0060 at line 4553 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":"packages/daemon/src/domain/queue-repository.ts"},"region":{"startLine":4553}}}],"partialFingerprints":{"codehealthFindingId/v1":"4858ba1bf06a545aac875c42dd203459edb00c6d2d552920f758beb73c834cfc"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/queue-repository.ts\u0060 reports through \u0060console.*\u0060 at line 4604 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":"packages/daemon/src/domain/queue-repository.ts"},"region":{"startLine":4604}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6b24eb28881ee7212a95c3a200b5c1d69898aa4bb621ef91a742741cceb0a44"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/queue-repository.ts\u0060 reports through \u0060console.*\u0060 at line 4732 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":"packages/daemon/src/domain/queue-repository.ts"},"region":{"startLine":4732}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f006d95cd54ac03401bdd4049a6581a4db0d249cae3342e0ab1b171260e497b"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/queue-repository.ts\u0060 reports through \u0060console.*\u0060 at line 5625 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":"packages/daemon/src/domain/queue-repository.ts"},"region":{"startLine":5625}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf409be87ff83feb66b13f9bc90d0aaadc1cd88374cc88f907393a5444f0d886"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/queue-retention.ts\u0060 reports through \u0060console.*\u0060 at line 601 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":"packages/daemon/src/domain/queue-retention.ts"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"93339c8ee61c2e65df8a5bde3450b13b600b48036e44b4a6764fe361d5fe2d02"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/queue-stuck-sweep.ts\u0060 reports through \u0060console.*\u0060 at line 805 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":"packages/daemon/src/domain/queue-stuck-sweep.ts"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d84babcaad2772ea52db4e363b368ae4110998313b0d0a76d8699b36f2ed70"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/queue-wake-ladder.ts\u0060 reports through \u0060console.*\u0060 at line 672 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":"packages/daemon/src/domain/queue-wake-ladder.ts"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1bb4ea17266f5f573b68047e9e680f4b4fe794145a7a08b3218c94b48c9c33"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/rig-delivery-drain.ts\u0060 reports through \u0060console.*\u0060 at line 49 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":"packages/daemon/src/domain/rig-delivery-drain.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d09fb5c97e15460c07c0e812994ecb87a749236dc29abb8a3996b593bb5a429"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/rigspec-instantiator.ts\u0060 reports through \u0060console.*\u0060 at line 2854 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":"packages/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":2854}}}],"partialFingerprints":{"codehealthFindingId/v1":"54bdff35664438175d5b1d4fe0288426696c55d28b2f487c5d0313543cb8fe9b"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/rigspec-instantiator.ts\u0060 reports through \u0060console.*\u0060 at line 2934 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":"packages/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":2934}}}],"partialFingerprints":{"codehealthFindingId/v1":"a104d5d5419a2a96d733ea1a010a1ce684b245bddc7e6816e04950eacbd98a10"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/runner-permissions.ts\u0060 reports through \u0060console.*\u0060 at line 324 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":"packages/daemon/src/domain/runner-permissions.ts"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d8416549b6f2b019deb2e9fff94e2b6cf7ebc96ddb3aebb5e9fa01c4d9a275"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/seat-activity-service.ts\u0060 reports through \u0060console.*\u0060 at line 51 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":"packages/daemon/src/domain/seat-activity-service.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"9115caf9e107d69666d5228d86d6e5230f71a69126aa90a9c8fb2c4f2af65108"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/seat-handover-service.ts\u0060 reports through \u0060console.*\u0060 at line 2067 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":"packages/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":2067}}}],"partialFingerprints":{"codehealthFindingId/v1":"08bbebf44805b4d8b5a54e68bd52f6bac1a1c9735e00e1492e576daf99446b6d"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/seat-identity-reconciler.ts\u0060 reports through \u0060console.*\u0060 at line 652 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":"packages/daemon/src/domain/seat-identity-reconciler.ts"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"9452de6a68cfbe53b6b99da0d9fcbdff1af536310483ed9d6a0262c5d13bedb3"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/seat-launch-environment.ts\u0060 reports through \u0060console.*\u0060 at line 28 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":"packages/daemon/src/domain/seat-launch-environment.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cab4edb0400958e1d1954087ea2d89c845f7de0a7ceadf2e0fcedd25c13e711"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/seat-launch-environment.ts\u0060 reports through \u0060console.*\u0060 at line 246 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":"packages/daemon/src/domain/seat-launch-environment.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6209c7587d6d59c8a183d8f22916863350bcf9fdc07b5bb11ae4a986b9d1bdc"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/seat-restart-in-place.ts\u0060 reports through \u0060console.*\u0060 at line 291 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":"packages/daemon/src/domain/seat-restart-in-place.ts"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da930bac12e5c6f24af799b1e4114c47bbc03b91076b13fdcf2dd8482374b89"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/session-registry.ts\u0060 reports through \u0060console.*\u0060 at line 377 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":"packages/daemon/src/domain/session-registry.ts"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d172cc9e1f8e552807100631c834aea3eaddf3a77fbe394e1447c781a53b6c8"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/session-registry.ts\u0060 reports through \u0060console.*\u0060 at line 400 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":"packages/daemon/src/domain/session-registry.ts"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"72eb585a90d6e91630e8c14a332958387e4f11854d8489092e1668ae2287ca7f"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/session-registry.ts\u0060 reports through \u0060console.*\u0060 at line 413 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":"packages/daemon/src/domain/session-registry.ts"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1eb26af522a219c0c5dd6f0ae911f73609996b2ae96348a788b468c6383dff3"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/session-transport.ts\u0060 reports through \u0060console.*\u0060 at line 2841 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":"packages/daemon/src/domain/session-transport.ts"},"region":{"startLine":2841}}}],"partialFingerprints":{"codehealthFindingId/v1":"9674a4d422192ad2e6a24c7e1df98bbff5f1bfc1c0ea68bb3ffab1ae63ca4b40"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/session-transport.ts\u0060 reports through \u0060console.*\u0060 at line 2849 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":"packages/daemon/src/domain/session-transport.ts"},"region":{"startLine":2849}}}],"partialFingerprints":{"codehealthFindingId/v1":"e421510de0dd1fb154f7b1e0d430704a9b8358493685217294d187cf1afc44d1"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/session-transport.ts\u0060 reports through \u0060console.*\u0060 at line 3200 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":"packages/daemon/src/domain/session-transport.ts"},"region":{"startLine":3200}}}],"partialFingerprints":{"codehealthFindingId/v1":"b50c4166c7fd8a6f812fb672d73be094f71970af09be9044ebe5d130389d788b"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/slow-op-recorder.ts\u0060 reports through \u0060console.*\u0060 at line 82 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":"packages/daemon/src/domain/slow-op-recorder.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd446540c89eed37ece6c913f287819fa3d7ce1357fa8904e7a3315d93998877"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/snapshot-capture.ts\u0060 reports through \u0060console.*\u0060 at line 180 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":"packages/daemon/src/domain/snapshot-capture.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7eaddf25ec57b3b9c3700648d979d0b6ccc9ab49f6b7e04049d047e3c03b692"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/spec-library-workflow-scanner.ts\u0060 reports through \u0060console.*\u0060 at line 539 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":"packages/daemon/src/domain/spec-library-workflow-scanner.ts"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"95cb8fe7311193a555704a70bbb1a3eb63428f3da23cf1e6ab798bac39b51df8"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/stream-intake.ts\u0060 reports through \u0060console.*\u0060 at line 60 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":"packages/daemon/src/domain/stream-intake.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2cd1ce80dda5aeeba0205dde537038c5fbcdf613b293f2a5d70536317b0718"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/stream-intake.ts\u0060 reports through \u0060console.*\u0060 at line 81 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":"packages/daemon/src/domain/stream-intake.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f390f3a7f615e8476685365e3adec3b0e5a6b7b9db77df8a87672666b7f7cee"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/stream-intake.ts\u0060 reports through \u0060console.*\u0060 at line 87 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":"packages/daemon/src/domain/stream-intake.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"a472b33cf3703251896dfb93ad201c335cedc893efaba4ddb3d2e5f177f4104d"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/stream-intake.ts\u0060 reports through \u0060console.*\u0060 at line 145 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":"packages/daemon/src/domain/stream-intake.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"613a36bb21ea592f5148e2c30b92c68ca66044ab0ad9eb14486d57d07248b96f"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/stream-intake.ts\u0060 reports through \u0060console.*\u0060 at line 160 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":"packages/daemon/src/domain/stream-intake.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7cd51a748708308262f2b7a8e53dce9d3f45ff8a1391509b0a60700a853d9a"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/stream-intake.ts\u0060 reports through \u0060console.*\u0060 at line 183 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":"packages/daemon/src/domain/stream-intake.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eeee4df22bb13b24f7262179b9fdec492cd1eff96a46bf54ab606c2b1a4c68c"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/stream-intake.ts\u0060 reports through \u0060console.*\u0060 at line 201 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":"packages/daemon/src/domain/stream-intake.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf3642d0625c7f92fd01d8c92552e98d61bf3777f8a6f7d502f0ef32fd5c5d59"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/stream-intake.ts\u0060 reports through \u0060console.*\u0060 at line 232 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":"packages/daemon/src/domain/stream-intake.ts"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d4cd31b5c8d11421461f9ed8fb74bbb472d6dfd59c970f1f468b4d57792b36d"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/stream-intake.ts\u0060 reports through \u0060console.*\u0060 at line 261 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":"packages/daemon/src/domain/stream-intake.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde60e9d9ff8db0c3ffdf3e15bc335cfc98056d95d09ac0095b8490636aabec5"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/stream-intake.ts\u0060 reports through \u0060console.*\u0060 at line 296 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":"packages/daemon/src/domain/stream-intake.ts"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a72cbe3ea0ee4d14beb0d75a2672c06cfa5c7e2cfe09bb69326002d3e18eeef"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/stream-intake.ts\u0060 reports through \u0060console.*\u0060 at line 302 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":"packages/daemon/src/domain/stream-intake.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ed761c8e9a5a2a877cc8aff3f713680750587cffd781114e14d1a9578fddf2"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/stream-intake.ts\u0060 reports through \u0060console.*\u0060 at line 311 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":"packages/daemon/src/domain/stream-intake.ts"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"f99ac181d012a7cdf4c1b126b7688281aef4f8d76620d1a5c285e167ae0f305a"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/stream-intake.ts\u0060 reports through \u0060console.*\u0060 at line 363 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":"packages/daemon/src/domain/stream-intake.ts"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"88262f8c1795107f4ec663bb1a9dd4147708580ca23dd5783a1f437d0245ec5a"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/stream-intake.ts\u0060 reports through \u0060console.*\u0060 at line 423 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":"packages/daemon/src/domain/stream-intake.ts"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e99412d59f5770090c083accfbad44e041a9ab44a50033513ecdfdf944886e"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/watchdog-auto-registration.ts\u0060 reports through \u0060console.*\u0060 at line 66 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":"packages/daemon/src/domain/watchdog-auto-registration.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"92037f9254f8a32f5f0f87a8fd52a392b71f4ce6a2611f8ad518379d06de3ebf"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/watchdog-scheduler.ts\u0060 reports through \u0060console.*\u0060 at line 72 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":"packages/daemon/src/domain/watchdog-scheduler.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e2204406a3e1fe2559e3faa5f4f25c7c48d19d9c6158553bb0b2cc79eab3fa2"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/workflow-spec-cache.ts\u0060 reports through \u0060console.*\u0060 at line 758 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":"packages/daemon/src/domain/workflow-spec-cache.ts"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff51a0a9f09ad13f1366ab0cc761cf82f518a0253254609b9e2d5375d31601b2"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/workflow-spec-cache.ts\u0060 reports through \u0060console.*\u0060 at line 1140 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":"packages/daemon/src/domain/workflow-spec-cache.ts"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd8222d82322f27f17469e3d58b107c700fe305f0e68eaab0eeeb9e4895c9a3"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/provider/provider-service-impl.ts\u0060 reports through \u0060console.*\u0060 at line 132 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":"packages/daemon/src/domain/provider/provider-service-impl.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"67bc63c2e26e325613eb50f630f24016892fe9df91b011e711428c560e65f584"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/domain/model-divergence/model-divergence-monitor.ts\u0060 reports through \u0060console.*\u0060 at line 142 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":"packages/daemon/src/domain/model-divergence/model-divergence-monitor.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"a54bc49967180c24a32ee663e620bb15b193b1e8cef9b7007f0167d1f4e14f51"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/adapters/claude-code-adapter.ts\u0060 reports through \u0060console.*\u0060 at line 241 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":"packages/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a040c939e6f4797949b02e22cedae0661c92a8f03fb03feff7340a4e4e61d75"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/adapters/claude-code-adapter.ts\u0060 reports through \u0060console.*\u0060 at line 260 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":"packages/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c2b8cf63848fc6ee0737c6ad7fff662e7d5bbcdd6cb32bea2e92fa975b112d"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/adapters/claude-code-adapter.ts\u0060 reports through \u0060console.*\u0060 at line 266 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":"packages/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"1163147229b97cd931f3d01202bc5d1d42a29e98706ebda740a81508b56a3568"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/adapters/claude-code-adapter.ts\u0060 reports through \u0060console.*\u0060 at line 1126 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":"packages/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"edafc0c747539156e08ad382c0fc688645f4725c09b4dfad797cc3381d407d36"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/adapters/codex-runtime-adapter.ts\u0060 reports through \u0060console.*\u0060 at line 387 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":"packages/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"092ad681830e84c2dce933e19a5ab2887646095b5aa88ac5dc84193fec5166ee"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/adapters/codex-runtime-adapter.ts\u0060 reports through \u0060console.*\u0060 at line 403 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":"packages/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a4eb1a42b42d936748fecba7585214fad84d261467c42187fe13abf834dd5b"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/adapters/codex-runtime-adapter.ts\u0060 reports through \u0060console.*\u0060 at line 416 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":"packages/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"9807ede83a1ddf0317422627e1dcd0075340c0da590cf2687c18e67aa22d572d"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/adapters/codex-runtime-adapter.ts\u0060 reports through \u0060console.*\u0060 at line 581 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":"packages/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"910fc0697c728ec521e6276127460b7ff8462f793b95c55601d1d49304fd334b"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/adapters/codex-runtime-adapter.ts\u0060 reports through \u0060console.*\u0060 at line 635 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":"packages/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"8484b9782dec23291998a4bca7d25d51296d11b9fe916001cdee60cc1cfe4f32"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/adapters/codex-runtime-adapter.ts\u0060 reports through \u0060console.*\u0060 at line 650 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":"packages/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea57a3b12c6e675c09a7cc6a7bf8c8589343f9085080eda3bf055a209575251"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/adapters/codex-runtime-adapter.ts\u0060 reports through \u0060console.*\u0060 at line 683 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":"packages/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"478a7d843beb266c7bc59b071a7cfed45ce53bc0cd3db71512a5054c9e838fc5"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/adapters/codex-runtime-adapter.ts\u0060 reports through \u0060console.*\u0060 at line 693 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":"packages/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"0261336962afcb8c9d75681d8627ee1910dd596077c3e5a3452e1129f859902d"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/adapters/codex-runtime-adapter.ts\u0060 reports through \u0060console.*\u0060 at line 720 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":"packages/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ff02ce70e9d5f7803c59fdb100da74c00bba867aa622d1ec33c7a61dc78ab5"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/adapters/codex-runtime-adapter.ts\u0060 reports through \u0060console.*\u0060 at line 774 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":"packages/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8076b7c9b52ac554ac02ea4475b750508c861bd8d2d78956216f518f54036e"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/adapters/codex-runtime-adapter.ts\u0060 reports through \u0060console.*\u0060 at line 804 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":"packages/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"a23bd0dbef7564f0db34534c726c743384aee13eb37cc5c9fa6c3ce699453cad"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/adapters/codex-runtime-adapter.ts\u0060 reports through \u0060console.*\u0060 at line 859 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":"packages/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc215be0cbb29c2ddc8d995651b4edbeea5529bc268bf91c145621779eb041f6"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/adapters/codex-runtime-adapter.ts\u0060 reports through \u0060console.*\u0060 at line 1137 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":"packages/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e21df2505d520cff7a526775144576f0bf14be5cfd7d259416767d0c4d3f67"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/adapters/codex-runtime-adapter.ts\u0060 reports through \u0060console.*\u0060 at line 1714 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":"packages/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":1714}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66d94ac51e25b61faa91bff6519b2f4031f91bbf5a01d264efb87cb83eb2c75"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/adapters/pi-resume.ts\u0060 reports through \u0060console.*\u0060 at line 142 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":"packages/daemon/src/adapters/pi-resume.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b09f02341ece012b4c29db61fa63111e174ba598b7340153605b54f21506bf6"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/adapters/pi-runtime-adapter.ts\u0060 reports through \u0060console.*\u0060 at line 641 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":"packages/daemon/src/adapters/pi-runtime-adapter.ts"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"572d0e97a6ea27da287e35c7e39e351ae2c2249f3a088a3307f01fcadbb2eb1b"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/adapters/tmux-control.ts\u0060 reports through \u0060console.*\u0060 at line 438 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":"packages/daemon/src/adapters/tmux-control.ts"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba58f4dd649bd89e084973eef6ba7768e140c41b317aac87c54c900de5eca3b"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/adapters/tmux-exec.ts\u0060 reports through \u0060console.*\u0060 at line 34 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":"packages/daemon/src/adapters/tmux-exec.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db6a257380090aabe49319460d58aaeee904586c16e32f551404fbcef4f2c20"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/adapters/tmux.ts\u0060 reports through \u0060console.*\u0060 at line 621 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":"packages/daemon/src/adapters/tmux.ts"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"903437d2928e0b132ca71b04e489c90c3461043b1ae7abc0be48a5ba0c7eeffd"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/adapters/tmux.ts\u0060 reports through \u0060console.*\u0060 at line 1140 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":"packages/daemon/src/adapters/tmux.ts"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"3579e933829a22644a2063f6daabc21a593e4e5b4b8316f2dce4616359b7ba7f"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/adapters/tmux.ts\u0060 reports through \u0060console.*\u0060 at line 1196 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":"packages/daemon/src/adapters/tmux.ts"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc263453f58225a44dbc352f97c38c78eb1939dcfae0232689309a445be6ed8"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/adapters/tmux.ts\u0060 reports through \u0060console.*\u0060 at line 1478 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":"packages/daemon/src/adapters/tmux.ts"},"region":{"startLine":1478}}}],"partialFingerprints":{"codehealthFindingId/v1":"92425bbc65d6c124490416886300cc9e600f45c975f032c13bae50184d3d5928"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/adapters/tmux.ts\u0060 reports through \u0060console.*\u0060 at line 1500 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":"packages/daemon/src/adapters/tmux.ts"},"region":{"startLine":1500}}}],"partialFingerprints":{"codehealthFindingId/v1":"16490337034b2ff19ec732cbfbbd936de723429c402b325951828a0a9646ee3f"}},{"ruleId":"P2","level":"note","message":{"text":"Console output used as the logging channel: \u0060packages/daemon/src/adapters/tmux.ts\u0060 reports through \u0060console.*\u0060 at line 1525 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":"packages/daemon/src/adapters/tmux.ts"},"region":{"startLine":1525}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd6f727e170d56bc7ec3433091e68d67383409d37318edf1a5b678253bb4cf7"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add CodeQL\u0027s javascript-typescript pack, \u0060semgrep --config=p/typescript\u0060, or eslint-plugin-security as a CI step. What was searched, so you can tell an absence from a miss: the 2 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/portability-report.yml"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"Dependabot does not watch npm: \u0060.github/dependabot.yml\u0060 schedules updates, but no \u0060package-ecosystem\u0060 entry covers \u0060npm\u0060, which this tree depends on \u2014 so those dependencies get no update pull requests and no advisory pressure, however complete the dep-scan credit looks. Add the missing entry to the \u0060updates:\u0060 list."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/dependabot.yml"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"da14c5e8fb421b8614b797a2517de829b3c94f3b85263a50e3283dfd26519afe"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060fetch(\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":"packages/cli/src/commands/chatroom.ts"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0ebd3d2f1475d941245251b353b952020fee131225a1254cb0fa82633fcfdf"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060fetch(\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":"packages/cli/src/commands/crash-cart.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"64520784dc27a6a6d23d18bfd30e3f6588c8fd58abf80c749f6441aee77d95c9"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060fetch(\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":"packages/cli/src/commands/destroy.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6b4a394f37981fa00300f12fe9211e4ebf9e06b61f16c00f7fbce40dc7c681"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060fetchImpl(\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":"packages/cli/src/commands/startup-proof.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"93516de8eb80855c098dbb7c29a58a5c97e67a6a3b0de02c10e53a4e8c25889b"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060fetch(\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":"packages/daemon/scripts/probe-health-diagnosis.mjs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af07b8e28f5ada6b2f30370577e043edd4970a322bf7578e46597605ab742e5"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060this.fetchImpl(\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":"packages/daemon/src/domain/mission-control/notification-adapter-ntfy.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee32180b41c8d2bb741ef1f2abe9ef192f946323edc4f37254c16df037017a51"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060this.fetchImpl(\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":"packages/daemon/src/domain/mission-control/notification-adapter-webhook.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1db04f635709bdbb2e730230fa7989fd7935419cbf965b6dd5d39ea46efa9ff"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdtempSync\u0060 in \u0060launch\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":"docs/reference/runner-conformance/check-runner.mjs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"7caa3750408d7736d81f01e4b4276e56414a2f5409fd98b7dc121129713cb1b2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060launch\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":"docs/reference/runner-conformance/check-runner.mjs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d89a3bea57ca1b77194fa536a923efbab0112ecbfbc48f62298245a9b1f620"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060launch\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":"docs/reference/runner-conformance/check-runner.mjs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a3ef8ddf35f54723d7b44d24a1fb3d41a2b7a5e9851a4bd556b265dad16fcc8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060launch\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":"docs/reference/runner-conformance/check-runner.mjs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"baff0d04f87e789700a487d8b05d8f34a488f9e4b270868ebba362fb289e6989"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060launch\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":"docs/reference/runner-conformance/check-runner.mjs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"263abbfdf8b52b4a4ee333e6ec9361b9ca2c3012bb8f33a3a920eaa512a9e6c8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060launch\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":"docs/reference/runner-conformance/check-runner.mjs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"426b34bb0c007bf4abb01a4f5bdcc2b97aaef5f5cd4038bff2fb352d462c75fd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060chmodSync\u0060 in \u0060launch\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":"docs/reference/runner-conformance/check-runner.mjs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"975c4bcb279e81287ca2f44fdda2077403a15cc6651ac615e7fbf8a67469f7af"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060launch\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":"docs/reference/runner-conformance/check-runner.mjs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"29cee472b7e922f7968420af04befba17605492608fe1eced67402c4fbd96db1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060launch\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":"docs/reference/runner-conformance/check-runner.mjs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cac5c8787cc5167a8277ee2d3fd18623187240efd72226e933a1beecbb82961"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060chmodSync\u0060 in \u0060launch\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":"docs/reference/runner-conformance/check-runner.mjs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fef449b04f3da01bd2c9b65b005362be6ba3505dc4b9e4eac91dad53bb1bd50"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060log\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":"docs/reference/runner-conformance/check-runner.mjs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"591881bb620eb01ff811bbd507393e54d4fb4f6c9b273d9ab9d6423100172381"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060log\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":"docs/reference/runner-conformance/check-runner.mjs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"8746adca18f3b47a5a07f4558914eaa5ab66e43f8823ce9e0fd368aff3acfe62"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060record\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":"docs/reference/runner-conformance/check-runner.mjs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6ee3f3f74fe08e9db0adcf03f8a8dacc1ea7a4861e32683e9d174fecf501a0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060record\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":"docs/reference/runner-conformance/check-runner.mjs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a83205e2ce0bc7e9667528d7100f00e10df3338a1ed00df2d6fb6cbd0f006d9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060paste\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":"docs/reference/runner-conformance/check-runner.mjs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a4bf9e8ddf6ab3bdc175da62e136e2136da0a6e9f6beb13971e22c565fe6e35"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060runAcpAssignment\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/acp/connector.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"e964bdfdf0d5a3499fae5ca5ab949dace87482b75e536645b9c9fa41891efeb2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060appendFileSync\u0060 in \u0060log\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/acp/connector.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"89bee2a719b53b9e32ce5fbd32d54afc29d0812460de9d25105eb1755c6c273d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060realpathSync\u0060 in \u0060run\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/bin-wrapper.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"b72cdbebd3a01cbf56770ccfc30c00024f1dd544181b3b1e6774c3790933eee7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060callback to action\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/commands/acp.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55054e3956fa1e89d75c2cf76f3223cf7e99e131f11c2b0a8426584d1166b8c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060writeRun\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/commands/acp.ts"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"f909141f798bdd60523095aa15201477fa6f9bf9a255bcca64bb7711c5ec24d5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060spawnSync\u0060 in \u0060callback to action\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/commands/acp.ts"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d939c4cfe77bcc3b31308ee06051c37ca56ea94d0dab4734b2dffb37fb91a0a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060callback to action\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/commands/add.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5f365a498d1a386dc8bce5cccf82a7155c8fab7fe9185c6f8325ae92cf4ce42"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060callback to action\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/commands/bundle.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"1938eee981fc7eaf246ec15ba1ce1eaed2184d04cc1e4e0b847d3fa3e694f888"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060spawnSync\u0060 in \u0060callback to action\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/commands/chatroom.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"198e8e7cb4d5821d0a7030312c3ff399d333704b60a36d40b742cb60c0c4358b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060installPackFromUrl\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/commands/context.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"b770ea1123a147ac660a98f0d140082e5e0e9ca91d0bdae1e2c3611d0cd2dd55"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdtempSync\u0060 in \u0060installPackFromUrl\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/commands/context.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3028c76130d2891605785246fe76d76bdf0ea02a7bd68abf4a4ee459ad559b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060installPackFromUrl\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/commands/context.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d56c6e806c223fb1d606515d8d70b401c7ecbcebf22a6e762c12ab3e1de622"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060installPackFromUrl\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/commands/context.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7685a39520b4d8d2cbe235a522ad7ea438d4a2d67c8c46ab78666bbdfc5fddb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060installPackFromUrl\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/commands/context.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e71b36a50825db1ecfed709611b9dd7ecda8db5dab0738c4c64d8a761b18e74"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060installPackFromUrl\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/commands/context.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f7dc9898f3949f372582299d2e916ccffcbead76a0d35b9d68b8e1693fc130c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060installPackFromUrl\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/commands/context.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da095004ab79984721eccb2ea150dec75cc968f9b58195ae25a5b4173484117"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060renameSync\u0060 in \u0060installPackFromUrl\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/commands/context.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e92972ca623763a71f4c02dc41e81e6600ea6ea615265b827457e2ee75117d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060installPackFromUrl\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/commands/context.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca5e5f9217ca96a861f6839e4d71b54ebae4e7449c2d5e3a6b77c61509234de"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060callback to action\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/commands/context.ts"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"285e86798170e0c0226c066c9c682a50849e334b5935e20ce64d9b3489a4cbf3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to action\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/commands/context.ts"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4dc1e6440e4973c388e31ad79a88d224de0af6cdd82350b04e0fd6e1769d89"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060lstatSync\u0060 in \u0060callback to action\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/commands/context.ts"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"a14338ae0b9da0c730bab8c39415bad97340988740be7eba138d460a20bfed91"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to action\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/commands/context.ts"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1568db112569853daaa748fada2f652535bee9d08f008dfda4d8a81ea92a4f8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060callback to action\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/commands/context.ts"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"232863fe00fa417430d88dcbd2d75a75b55d890356df63165e6e5b3cfbc17b7f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060callback to action\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/commands/context.ts"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7e63a756f0bfa0f009445ae22574203d82f8d24901831499a7a98ead8af5b0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060lstatSync\u0060 in \u0060callback to action\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/commands/context.ts"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd678cf5335dde7335b28e1406776e651aee1e4efa4e0f23b8f114a8c359a938"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdtempSync\u0060 in \u0060callback to action\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/commands/context.ts"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84ab490eb26bdb23678765fd6135728754ff59d0f73d10d64d094b8a0f49dba"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060cpSync\u0060 in \u0060callback to action\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/commands/context.ts"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d1a13cb371da3ad27eda6a5a15aadd5feec43833fca154ef40985f03de95460"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060callback to action\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/commands/context.ts"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace8ae99b0719cbbfddb81cfa80ded1f56d21a64678920e348e67352ce75cbc9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060renameSync\u0060 in \u0060callback to action\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/commands/context.ts"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9cda58501388102e7f967f46ee351424f66164ebc385fcf4eaacc851498531"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060callback to action\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/commands/context.ts"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"30382040503da6878ed017b3a5103a3edb8ca461da03ea9c5d2271b3d53c57a3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdtempSync\u0060 in \u0060makeScratchDir\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/commands/crash-cart.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b60f21e5ab4cee7ef4517d2d9caa9ae066e012d0654086df00f1a6920537c27"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060removeScratchDir\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/commands/crash-cart.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"d068b2176c6b49367daa62725cd2a2b404661cc39e16d25cb7222cfded760354"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060readFile\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/commands/doctor.ts"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea516efca0ce9d1ca9339ce5c78ae1d237c19dee0d91d9e3b166682bafbd2b7f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060mkdirp\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/commands/doctor.ts"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d98013ac7554d2f0edab7846de0cebd40ef4e01b2fd5b6c45479bcca659a1f4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060accessSync\u0060 in \u0060checkWritable\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/commands/doctor.ts"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"97fa3c95a1c8788069b24956e7d6bc281a8cb181bbdc4268bd7bcceecc364c0f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060execSync\u0060 in \u0060exec\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/commands/doctor.ts"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"212ba46fca0917cb2ecb1505c868979151111f8769c7df15efec4c3fbc2e940c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060prepareWork\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/commands/environment.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"73bd8a654b9a780dd6ba027c35b6456944b6578c3059ee2339ec7f250e662598"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060callback to action\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/commands/environment.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e8baf428f01d9fd1a687d25bcf50ab67df12ee1ba4689b7d1751d42d5bf09b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060callback to action\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/commands/environment.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"53fda93020d925ab73a167bc5828de6c0963294d03f4257a9e51bb072430beb3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060realpathSync\u0060 in \u0060callback to action\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/commands/environment.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea88c85e7d58e62c2f264c3723f8ef06565ab2770035832c1603f03f048167e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060callback to action\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/commands/environment.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a1a32e9ed261582e83cb8adc3e7270a68c389318ff5438d71748704512b5fd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060callback to action\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/commands/environment.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"e13c7d8860436bb3734ceca211d3a1b25fbb1a410e27bea69c50123878f908bf"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060callback to action\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/commands/environment.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"414df77dae9d6020b82a1b53a0650261c633910d9d24a06e6e3a3e650b2ea8af"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060callback to action\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/commands/exec.ts"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"016e3a8183f7aa7c0be486edd32c581cb38ab85ca2c171aeee3ba8907e55851b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060callback to action\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/commands/exec.ts"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"1845cb73acd3906055ebebf34789f08d155b346c9dcdb1cbeb7102dbeaf14b9e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060openSync\u0060 in \u0060callback to action\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/commands/exec.ts"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a8483666119cdb4bfbb9994c07f98c6dcf7cb83b4497b48b48feb8c389e6e0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060closeSync\u0060 in \u0060callback to action\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/commands/exec.ts"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e311e6ea33848d81d39e409663238fe4bead5edb56fc5cb8a6e37c240b0c79"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060callback to action\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/commands/expand.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"beef2c57f8c9327422863fd6fa6c7e5d7ba52cbb7468a8fa6085be73aabeba0f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\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/commands/export.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"8622b28fd4f139515113d03005339ac779ce9901cd87721214378b417685f78c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to action\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/commands/host.ts"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8eaac5d42abdb25ddd5833572b9d19b20c82b175df52ddf8fbb9d95a4a5be1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to action\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/commands/host.ts"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc269818784fe6096b257c49d56e107d9887818fb4448130d387b564693551e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to action\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/commands/host.ts"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff5952f6c0c9f4b04401304c646217c6c98e94854fe21802d16f3719a9c8aef"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060callback to action\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/commands/host.ts"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b19adf6bc294c86ef4224977674232a17ec85b1348948708375fc496f00023f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060callback to action\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/commands/host.ts"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84e6b871ee58093982eb6c49e6fe319ce6b193b9c3a8f3b8bbd2d19cd62f698"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060callback to action\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/commands/host.ts"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"a907178878539daf0ed7ee42c1ac0bc0f74458dd23a51dc0e1e4487178207ee3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to action\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/commands/host.ts"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3cd1b8bb7935bd948aeae4d7f291924dda536262733fe4072bb6b7047c45b85"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060callback to action\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/commands/launch.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c2dc81501430f5bf74bb9e074ada7f5f00b0a5ff388bb6af4b9987a9d031ec"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060execSync\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/commands/preflight.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc766f6515a8d8d14bf72bc245010b6d87f892322634e777302a58848c7031d1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.openSync\u0060 in \u0060callback to action\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/commands/project.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"194a768423a70d198b02b37c260061e047ce463d2d2a61d049f35a9f807e74d9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060callback to action\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/commands/project.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"319e8702c81bcc735275d8127b56e77efe73b8d76b5959aaac25fc46f725b87f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.closeSync\u0060 in \u0060callback to action\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/commands/project.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ceaf8143b0bdd6262f55c08c27b8136447bc40382d1112a373d54463f3712a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to action\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/commands/proof.ts"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"471b82d041d1111a8d41f3c34555904701dbbc49299077e4703727d8d4399564"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to action\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/commands/proof.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"be5cb97a2cd09decf5e427d3bae9b1e4b42cd6cd3ad8e3421c912e58eecc2a83"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to action\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/commands/proof.ts"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fca8b94d07d88d628ef6b3703f7f62cbd3967d8655cd1981e13472ca918d1c3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060readDoc\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/commands/proof.ts"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"77b6dfc90f8056d96c34762ca6f83d906ce94ceec091563401b2fcca617fa5f4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060readDoc\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/commands/proof.ts"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6deb9317925be3ee862817aaa79671674f4db7021506ad07a051ed2148467c2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to action\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/commands/proof.ts"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e506052485b2751afda641871995ffa94fbfd8c01d1cecb68870e6dc095de9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readdirSync\u0060 in \u0060callback to action\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/commands/proof.ts"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"14acd9994b49f86039a0a3a1e12429186545f91367585aa65b2a81200ac9955c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060callback to action\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/commands/proof.ts"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af2782ebeb69ad22cad08849eff78ccb805eb83aa878f89f591bdea48de8ab3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060callback to action\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/commands/proof.ts"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"39b3d6d27316aed271e4a38796ee7445739a3e3e25ee3f97add47ea1d97e0494"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to action\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/commands/provider.ts"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e298f96821de846523fd023596ef18dd77e4e9c30d352b090cc7bd4e5e80407"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060resolveQueueBody\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/commands/queue.ts"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"061c040bae0da2aeabf564392132787c04068b9b02b2b0bed875c039a5adb0b6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060resolveQueueBody\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/commands/queue.ts"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a26e728175d496954d57033578b53b945937675d8c1f35622321ca262c2384"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060resolveQueueBody\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/commands/queue.ts"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"69212fb68d58b2a51741661fb52d1c546095328e99f9da0d913490226e43d817"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060list\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/commands/queue.ts"},"region":{"startLine":2537}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2480aabc6dfa9cf1bc8f3326c1ee43724a7ebb9450df4fc16f5577a5e7b3d8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060callback to action\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/commands/restore-packet.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f67400fa1b5f7575db3eadf6887703412667d4c338911fb7acd699b2012ea36"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to action\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/commands/restore-packet.ts"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"81fcb6675faf7135b3fd3265efc939b020e83dc76cbb8477f6957e56f0c5615c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060callback to action\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/commands/restore-packet.ts"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"1845e055eb6f4acc47ae7ba6d4bfd09aa6e2a8664a6a267aa693c717e9834810"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to action\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/commands/restore-packet.ts"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b8433bbe9ebfec58f75bdda9a953fe5cd345d6c44c59bb26ad2f522468e266"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060callback to action\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/commands/restore-packet.ts"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a8d082ec92b0c2a6768f2537327ae26e064a1bc672507586b08fad7ca953dab"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to action\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/commands/restore-packet.ts"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d15e101b3d3c6b8ae55f18c0fe91a175de45a53cd687a9223a260567f0e515"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060statSync\u0060 in \u0060callback to action\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/commands/restore-packet.ts"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a7cb0a38dc4b3e9e10b3a077d6dc4f8f1ae35516f01c7175095174e9e243f0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to action\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/commands/restore-packet.ts"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"941d8d2ec69a13767418a6d111ff27786f93ce293c8e962c984812d812637b57"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to action\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/commands/restore-packet.ts"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd42ece21e754f61d7b8bc0a467593dd69f6723537352eec1dea2bc00f2ef45a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060callback to action\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/commands/restore-packet.ts"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf84305a3e82b19fc02c11c19d8b0b6cb9c0168126bfd915e6e93c6421b61a43"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to action\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/commands/restore-packet.ts"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a59b22fc33b35dfa0a57579638d67c7864c429b05b5d9fe98b1f1b5870cb8c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"db91f8e534998e641b8beef06ff5629092f3598680e1e2a82d2eb9f2f3ebac11"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readdirSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"430347f986b0644aea07c6fc0e6e0f3701d92f5c8df5c5ee5909dc034ade0576"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"616da393d48ba725d23b9c0ca4973b6206671d9d2cf3754f980ee5a9c6899d4a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b9f09070a7b37cdf7a7238db8b13df60056ea69ab491c8b621fbe60fd6d80e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da81076e130a54467d96c494a6c54ba46f55525268e80a8ccc6697b86f81838"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"7914e32d35cb2c9983009b128534d9ae09763329f00d451df72f35b6f9e05ea0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7df48899c354fffdf8a00312d79b02f3c420317b80713d2156cdbd8ca436d8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c53348a0b71edeb291c516a49346b0e000bed82e42ed544ebc5c8af14eaca85"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"f910c21152c0ce92f981524e5e35f372c1e6c8d25507ce3a6556a7eb95a0d55d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1fc6a8c2e40fcac647eec5aeb44c6234c31942afd8d773b17f1dd1ecc190cb4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.renameSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7471a5dc01036f0c29fb8054731c7fadf3fe08341e986e98960bd600f1c0e9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"49536d1273ed3f3321cd54f13061bf7b36a704a3b8b11306ac640512f7966804"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd5ff19e258cd32af852f939774ce2c612f498782e74daed0f55079a22df179"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1736052ed12521a3b5f6cfdc4cfad330831dc2e7890668a8b15020598265cbb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c99f448c90e076a2b8c040ffcb852193b2a1ca8046aae0617f994026113767e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc92b1447bffd152651f84c83d50115d5c1bae97314f929e13fdf23b193b0a9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"8282aded974aa954227f319be62932f77baa5568a8240aeb153df581db8592a1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48ade8d18a1e1c73362b8a832a0ab1ed0b2ee2e8552b64f4f0ba876b97b3ce2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"c090d22e60a8942c7e7791684bab192543f7047c85963d4adc5a14b8281a442e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe59499e8424b0b409837bc984078309225340f650980f2911c0bf4aca13758"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c41bdc83a1c60cd547187446d4ea97dc3d73aa4863c3cac58dcdf89b8b1e595"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"f843f4ad4a2e3930b80b542d043cbba3fcc9f7f9158e1b68037e2de0b2be76f5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a983c94c18dbf6b224d5fc7a09fecf99b574ae58cfb2f484e1d54f89d13926"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e7f82ddecf843c75d52277cb08228d10f6a85c9215165ca5a49f66af1dfe1b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"80dd62b1bd773c50bf7a6075aa027b0745484f13963eea9bf3fee06012c58873"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc75f308c49d09b979a674431f5fbbc87feb7751907a751914049fe82f65ce5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5e7dc3c65437ebbdb8accf1fe1ddd83e40dc113e9006732491ccf246a895dc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f80c55642c8d5b9f3e6874e4f2e064c8edae7244b13b8d8ac219dd53a9a5d64"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"f49540631a9b87258a743e6347107f3d63143fd67c04e1021af86288d7af574e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d37ab43ced632402ca3ce57573cf8acf1c6336f09f5dc38a6ee9d22e771e7d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"531ac7f721a1e51c78231590b4cc22eb537d9fa7a85fd09298451f38261d573c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b55306c8266d1cb08d0d16782e54cdb532881ca3d3f3d4a08e859089d2fece"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":1163}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d6ded51eec247cf3b945357b080e5e78ecae56e4975787afdcb2b469be6b1e6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"335c372dd81e0ef3aa446ed494d3d4a655b654c8b6b472522c60824977130917"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fdc2216bb737f74a5acdf28b30214df52b97e2b2a1561553c607a5db48ad589"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":1280}}}],"partialFingerprints":{"codehealthFindingId/v1":"636b59ad956b4f94de67e5c8f72e110e75c3d1d85a02ed599db6610974acaed9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":1289}}}],"partialFingerprints":{"codehealthFindingId/v1":"b737ce2c002dc75cfb562118120a0ef1943f39bbb264c17f9af83706deba4186"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":1290}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7702ddcb767e46edd95c5ee3409fe5e41077b62a689ec29f0a9d73f4f1a38b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":1320}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc7d5cdd2ebd043fa66ae3d55c407bf3befd32164ed69372031b0915a7086f5c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":1347}}}],"partialFingerprints":{"codehealthFindingId/v1":"7116913383a347ba4d325d94e85f76ef74dbc9f0a0f367a1cbd2d3bae7f20ebb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readdirSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0897c8a1c0fb2ca7099a9bfb2ca4ced170152bb80b656f5664ead249fed7c04"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":1350}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed003c138b88631d2e1cc8c3a1aa64cc03e6e76063cc8a159b37de6c2eca4333"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":1356}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6ffb07b94e82dd2555c8d035408af8944befe76f6d19773a254349701ce925"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":1357}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b0fb85ece787f6f320c5ab5a01991da9cbdc7361785c3c1e06032e82428dd9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":1387}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e68562d82e3d03a6bcd47c6f7d5d720cb6e579a700432457a7cb6e5cb19c1c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":1395}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c76e169eff88b81429645444b0995c67a5ba852f30c75faea53da209f511ae3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":1399}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c88e4fb4bbccb09bb621e686efcef9e1f1f238b45ce8228dff17465dee2c31"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"752e416f104a194383382841496face499e6c997372c1b98f4af68a3c002087d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":1407}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e7aa63341b8a584de7bbb699f72737d457f76dbd66986e94711f73ba32c047"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":1411}}}],"partialFingerprints":{"codehealthFindingId/v1":"3935e77a0af6f9aa61293235ba05e33cd16c82beb1edeb5845c7f1be2dfca4d4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":1412}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc30768cfb2e413216f1db3381bd57ec14398c1dfd88f91152f6a4e8c164ba4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":2081}}}],"partialFingerprints":{"codehealthFindingId/v1":"77702a0eddd914437e31213ccb865395ac73f243bb48ba9e9da6f07d5380b542"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readdirSync\u0060 in \u0060callback to action\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/commands/scope.ts"},"region":{"startLine":2082}}}],"partialFingerprints":{"codehealthFindingId/v1":"278d087f955861571a53fb66f83b8aad46b36a99990f03ccfbfc3fca5673098e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060callback to action\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/commands/seat.ts"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"239312d6010f5c134d1f0f5c1153f061260d586213385dcc86e5790333c16397"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060callback to action\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/commands/seat.ts"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"83fdd27fb5227ef0469add6ce8c9533e24aa551c91a9f2dd7ca603639122e8dc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060callback to action\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/commands/seat.ts"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"b857bde7608de667f28227f1e3b07f5b3880bb4f41668fb39c224bf86e22322e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060callback to action\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/commands/specs.ts"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5a8640d01b4dcc2d8e5a03f1d066b56fb1d11129d69e4e5494c3ed8f752494"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060execSync\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/commands/start.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df78ddc19d9dd438d57d378bc3aa43f447b91a97804ab3c0776a38101a349cd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to candidates.find\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/commands/tui.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc68a4a340041ab9c0a2a906bcbf4ad61a7a0d831e0f967e6c0ccb4ce5fb5dc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\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/commands/walk.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"b94fbcccb797395bdfaefc8febc58e3adb01c304f81671e5c0be45b6110ac6cf"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060callback to action\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/commands/watchdog.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc762d2172ad8a72db6b8b98779773b3fc5bc2ea89623470a129ad7a1c6b4c79"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060callback to action\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/commands/watchdog.ts"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a52e33e933b0942e846fdf6c288e8cccce9f5a9e9e4372490bda99fb541423b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060execSync\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/daemon-auto-start.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a638e14d1fead97f76fe650096f7f1b4947c2d8f1ca5f74b59cd9bab48670fd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.realpathSync\u0060 in \u0060checkBundleFolder\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/lib/bundle-check.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"015a2a2d010ef8446662bc71c7ea206cf87eaf80d713665ec1dfc7ff25032389"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060checkBundleFolder\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/lib/bundle-check.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed527bf981f5c81ec8affa1b5db50ffa9ea345e4b2c2a6865b2bf4e1f754adf"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.realpathSync\u0060 in \u0060fileRead\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/lib/bundle-check.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a1fb8ba87cf291c7feaa22d103b80229dfe5245ff7b5d00bfc382eb9c58bea"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060fileRead\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/lib/bundle-check.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"025e80f675fb70dae1dfa8dcf8281907842577eb6c6f7df262a443a4c21a3f6f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.accessSync\u0060 in \u0060fileRead\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/lib/bundle-check.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab29a59197a415ae7cf80ed47eace7309599f721fa994aec1b47cebff2954de4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060agent\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/lib/bundle-check.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6aecb01ec6d7a64efce3086fe9f0ce18eec7877b0476e835fb33e75dee2500"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readdirSync\u0060 in \u0060walk\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/lib/bundle-check.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2daf77d36ba93e84c6f1445f15bf63dea0701632cf8eb19d0cdcdcf676ec703"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060bundleGit\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/lib/bundle-source.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"686065410e1c5eb48981e720587231664c52537072aa7e1ab1fae802b27c4eb0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060prepareGitHubBundle\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/lib/bundle-source.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b71a9474c83e8a731d63596fd2260fb93f322b4e513daa3ff8a84408375db6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdtempSync\u0060 in \u0060prepareGitHubBundle\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/lib/bundle-source.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"b087a5dbd9ec29a7e0906263a8b28d09ac4380a6996657dfe792e1437b43b31f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060prepareGitHubBundle\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/lib/bundle-source.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"602efff3d522a215b98a20575ce312ec5e4e8f2404a822c853d5b4e2c3434b9e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060realpathSync\u0060 in \u0060prepareGitHubBundle\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/lib/bundle-source.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"1159183e10e2058457f58edff4d8e0582bca05afa39743300cfcf4668a286ab2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060realpathSync\u0060 in \u0060prepareGitHubBundle\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/lib/bundle-source.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9164888f48c5ec9af6a4df8540d2802dae42a3e398f291e33b1b4c72b1428e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060statSync\u0060 in \u0060prepareGitHubBundle\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/lib/bundle-source.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b12ff93953701f1a2453ea26ceaee3f506720f64eeab4e6aaae1149f2698b43"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060realpathSync\u0060 in \u0060prepareGitHubBundle\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/lib/bundle-source.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"537816c3b602df299d8bdc1d7ab1e6d5d88d9dd454a3001399a6b9b5b1169500"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060prepareGitHubBundle\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/lib/bundle-source.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa6a8b684509b29d38a023a9edff0c5595ed59d2b7d37c99e0a6c17775b37b8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060prepareGitHubBundle\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/lib/bundle-source.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cfb36941642cd15dcfca2c30628cb3f905b8e4689eb2b5211f0f217db2aa4b7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060realpathSync\u0060 in \u0060importGitHubBundle\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/lib/bundle-source.ts"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"4206c5a4539331def28088984d432b4a15361ec6e1897d192e4a7dafa5c965a1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060importGitHubBundle\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/lib/bundle-source.ts"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35229af5c249a991040f24fa52184f904835a97a19260a4497a743b9574f4fb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060importGitHubBundle\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/lib/bundle-source.ts"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d505258c4c3178ac30ab4572082fca1ec3894775d055d63e8fd31b3fdc620b1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060importGitHubBundle\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/lib/bundle-source.ts"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe904d2a355b5626556c6f983ed4835a01acd7a53aa41f8ab832c70fe454e40"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060importGitHubBundle\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/lib/bundle-source.ts"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"909ff3163dc07c5a53da9b9474192b272a1d510317c27724ed6e6c67d84d5aa3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060importGitHubBundle\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/lib/bundle-source.ts"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"c974218efbdd453e833ca67750c96f62cf495a8d93ff3e7199c86be5d5147e95"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060statSync\u0060 in \u0060hostedMembersOf\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/mcp-server.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf76959466548eadb301eb9a3def677032813829dcabbb5f733a9398ee6798f3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060writePacket\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/restore-packet/packet-writer.ts"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7dea2da55f59c50c4155ad16062bc04861e1b3c78278693f55c11f042eb0d72"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdtempSync\u0060 in \u0060writePacket\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/restore-packet/packet-writer.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"12ce3a66c718b5075657e22ffa8bacee24a7e482302d923c6fe1340521ffc9d5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060writePacket\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/restore-packet/packet-writer.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bef441302b221d9b59daedc0f6a2245b41db38ca34c840afcfe59683ecb2ef2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060writePacket\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/restore-packet/packet-writer.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac2213692b810d35fb0198f4ef5b77fc9e740745aa06de01024945770049dd7a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060writePacket\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/restore-packet/packet-writer.ts"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"a008752f9ec464155a942f4a83f9b1244a68332f132786cad9acb3a5d29d0368"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060writePacket\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/restore-packet/packet-writer.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b42fa5b811c6e00a19e1672ed19e4c462b009ecc37d098340eb8a9eaffe45f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060writePacket\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/restore-packet/packet-writer.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d57d43bb0406c8842d3b339f43c91a225ae4e0552b1dcb23c95d29b6ec696f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060writePacket\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/restore-packet/packet-writer.ts"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"64066b022bffa3c7be919429d2582b9bf0a6359ae2382071f51e04efdc18e339"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060renameSync\u0060 in \u0060writePacket\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/restore-packet/packet-writer.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a3472870d5e3628c7dda87dff92c3350d902eacecfe74bb2f7143caed3b06d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060writePacket\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/restore-packet/packet-writer.ts"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e6993083f59013d7f94cf8c85319f15a1e841ea6f1695c5110d334c074d714"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060execSync\u0060 in \u0060quietPreflightExec\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/system-preflight.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"02493d51224b281d600ba3548cab405ff5c7e77de15f38f0180900f9ccb66324"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060retain\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/daemon/scripts/probe-passive-ceremony.mjs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"e963d6c25a55770b4ddfc35955b2943394a617b47592ff84053fde9920140fe0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060retain\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/daemon/scripts/probe-passive-ceremony.mjs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d07e78ac502f438d45d46a94e2f97a71c80f037bc14392641e350ea7ad9aba"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readdirSync\u0060 in \u0060collect\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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"00be65ae073a1f56682ee9830d3eb1eaa7b5f5d0e77e711d66f0ae6a0bbef19d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to ownFiles.every\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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a49f725a2cb30bf0c332f7042ab9f0558cae0401f2971b47c91c708f94da83"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060grantOwnHooks\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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a72a5ab3182b1080e0b01c9a9c5939f617a537c407e883a5c964f2614a099b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdtempSync\u0060 in \u0060create\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/daemon/src/adapters/openshell-driver.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"e40b2fecd8bd5de27e7533e0a2039be7542d99b56d843d832b57ea009238ad9b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060create\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/daemon/src/adapters/openshell-driver.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b8f1cd28a44b1110463426bb5cfe10acbf817c5589ce7ff1232809748e35c1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060create\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/daemon/src/adapters/openshell-driver.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc0c10d7126a87db42ca90b81afa3d57e91153e3e64570a3069ee7fb95c8a916"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060download\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/daemon/src/adapters/openshell-driver.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"aafc11a4fdc2f4540999a78164aaaf53a9f0a82ac9c4bfefada95cfe4990a23d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\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":"packages/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":2264}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec909f4afc978cc27e4240347dfbb0efb3ed25637dd80adda87648b2848ae4ad"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\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":"packages/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":2265}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfbab646096c9cf92a6a4661063aa4e5adf9f2a257861fe798a4b1e464a48472"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060readFile\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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":2281}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8af40bf8764620d385520ca54bcb499cc6035b05deb27deeb1bc18b861c594"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060writeFile\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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":2282}}}],"partialFingerprints":{"codehealthFindingId/v1":"c77ae4559b9bf363df275334cc0f388a7a72e67d01127e32e2cbc02a5e9ca34a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060exists\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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":2283}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d8925eb0e714653ab87d91e5044ceaf4f9a933068895441a19291e239493298"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\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":"packages/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":2305}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd9cad334efb0aa63845bd0121284e0aa2fdbe6ee4df9c296e56d7ccea0bdfd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060readFile\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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":2324}}}],"partialFingerprints":{"codehealthFindingId/v1":"37278a2b81216eea177c8c94980e98b8881787f923b577c4c5c67d1997c82a7c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060readFile\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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":2325}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35291d3f2a2d29def608c61aece2310cc669e04c86c077f57ac18a3d8c5f1c5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\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":"packages/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":2346}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b4d964a2aa7b9a523a1e5d66324d9d8efe01bc2c2752dac6f7da3de38b6103f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\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":"packages/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":2348}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c0360a212b3f3fa8d7e3689462700ea76e08316bac598887d6eac200c3bf6d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060readMetadata\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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":2359}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a76a0d66d13da1526108e28ec81f89628abdf2a2d435c72a426ced4292be95"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060readMetadata\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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":2360}}}],"partialFingerprints":{"codehealthFindingId/v1":"294f2754f43829bd942544a5756ae08ab42e35d3968e9434410655c568216c44"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060statId\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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":2365}}}],"partialFingerprints":{"codehealthFindingId/v1":"69038f114e84cabc7af15f444bd9bb5553122b76449d90ade8835533119bcf13"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readdirSync\u0060 in \u0060listDir\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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":2369}}}],"partialFingerprints":{"codehealthFindingId/v1":"540233b1f9b1b1dcabc496a0aa1f796fa16fc10f20a7125233b7a5fbb9803e7d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060writeSidecar\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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":2456}}}],"partialFingerprints":{"codehealthFindingId/v1":"9963a420d86d15d31bf5ae3ff280bdce7ee6636759402624c0cee0394b85d114"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060sessionFileExists\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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":2461}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b892ad8dc49f3b38e4fa3e62f84f66692f2dae6cadea0cc40861a82f0e727b3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.openSync\u0060 in \u0060readFirstLine\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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":2484}}}],"partialFingerprints":{"codehealthFindingId/v1":"f045a6f12836392eb13490fbcd865ece558d7706a6240ffeb9b9097280814ad2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readSync\u0060 in \u0060readFirstLine\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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":2487}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86b6fa810d035092866d98f1a57693c9793ca17b845254cf4f987ffc1741f8b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.closeSync\u0060 in \u0060readFirstLine\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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":2491}}}],"partialFingerprints":{"codehealthFindingId/v1":"d95745441af0842b27395d7242691be8e8af628f3d4471a2669301564582d937"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060spawnSync\u0060 in \u0060callback to piLaunchCapabilityError\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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":2537}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2eb97a606257924b003cf8b98f3a88d66001be974a9f287bff87e8af1114983"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060nodeFs.readFileSync\u0060 in \u0060readFile\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/daemon/src/adapters/stub-runner.ts"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0ea17bc6a3722fd375928d2c7f08138133d35bce816c380fa03dd54f2db39b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060nodeFs.existsSync\u0060 in \u0060exists\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/daemon/src/adapters/stub-runner.ts"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"b400e3d29b65cb54ea50fa4a99295805ae2781f1e72fd34d8c8b5109d137b206"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060nodeFs.mkdirSync\u0060 in \u0060runStubRunner\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/daemon/src/adapters/stub-runner.ts"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0594dfb497b8543818943054257aff81676caa40a64a6c4cd65689e07f908b2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060nodeFs.writeFileSync\u0060 in \u0060runStubRunner\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/daemon/src/adapters/stub-runner.ts"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae51d92034d1552cd43f849e292a076910b24ed1ba1728ca295cab5bfbb216d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060callback to pids.map\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/daemon/src/daemon-db-path.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e051e4accdf8de27dbe8514d5dd77c95902bc41654d868d487cc0b745d48a8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060statSync\u0060 in \u0060callback to pids.map\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/daemon/src/daemon-db-path.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd76b7c35efbd3926d20cbfc39c6bd5ade0c702e36f869efd9858a67d584425c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdtempSync\u0060 in \u0060bootstrap\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/daemon/src/domain/bootstrap-orchestrator.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd56bca9041e0847bfa9de3462ef5fa1a35524b27298380fd0fa5861bd24344"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060bootstrap\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/daemon/src/domain/bootstrap-orchestrator.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd97d98692d18082431cc59777291ddd12e4f54edf153960057c7fec1d4f6f77"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060bootstrap\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/daemon/src/domain/bootstrap-orchestrator.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff00b89f338fcc1772c427045af9d27cf3c0273529c3ce72b39de512a0fe2ca"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060bootstrap\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/daemon/src/domain/bootstrap-orchestrator.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78cffbef0ee69d2304821f29bece85c2fb3d92512b260556b1fb6219cfe74e3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060pack\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/daemon/src/domain/bundle-archive.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"127e44fafceba2f70c7294af3ab6738ec04eeb4d8a670a4467874867b5fcc0d8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060pack\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/daemon/src/domain/bundle-archive.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcfac14ae49375fad06bf810b0d61c6b882b9eb6d5b8233b268767ac75e46737"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060pack\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/daemon/src/domain/bundle-archive.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"632929eaa1a9d09268b82397ab5196cd0fec257f32f371058909498652d10fb7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060unpack\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/daemon/src/domain/bundle-archive.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e65a1e032d0f589764ca1597f22096a260c8dd3e9fff3e66b0e5fe60a77f1f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060unpack\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/daemon/src/domain/bundle-archive.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28ebcbf1a2cb195ec632d076c94f582f3135cfece1f21d015346e7bcb4a8f6c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060unpack\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/daemon/src/domain/bundle-archive.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"044a9f65bfbb141eebf894581813b8b69d8cc180b8b51358130f323fec685ae4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060readFile\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/daemon/src/domain/bundle-archive.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb34661d80c5e1226e3b073f38f60a1117d589da33d2c5ba7bf6e082afc114d1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060readFileBuffer\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/daemon/src/domain/bundle-archive.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"950382bdd0a2663403ae0d8a1f44014e90c54eb38ec5dd5ece6d780db03a3e99"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060writeFile\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/daemon/src/domain/bundle-archive.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7cc478efa26cb04719484b86f28156b2eecc94d0813c211bc0a84997a86db15"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060exists\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/daemon/src/domain/bundle-archive.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"da0d4861ee27597aa4f93374bdde5cac249121fb30235aacc607dec4122f3f37"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\u0060 in \u0060unpack\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/daemon/src/domain/bundle-archive.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a46478d4b971fe4664ecf0b414fcf82f9403a1ca1f00f9794fe979e2e96e8e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.chmodSync\u0060 in \u0060unpack\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/daemon/src/domain/bundle-archive.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"35da0e17dfa21305f5ad7d20a168d0b03c9a1b8ed796306bae45e5c5aa102c0d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdtempSync\u0060 in \u0060routeBundleContents\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/daemon/src/domain/bundle-content-routing.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"627da31e6a153136c2516d1402e2126e2ca2b7d8954e5aa64ad9f4ec4ce7464b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060routeBundleContents\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/daemon/src/domain/bundle-content-routing.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6dc2a390c8053112ef1b2885434fb7a7cdf5ab2fd58f1a826ec78e464e2fdcf"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060routeBundleContents\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/daemon/src/domain/bundle-content-routing.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ab2745f6506fe1bf6853ff22acf538ae361e169a562032c2710b638fe5d7172"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060attempt(\u0022project\u0022)\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/daemon/src/domain/bundle-content-routing.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"20150d1b2b7a6060125467ee5ddc1ec5bb847a8dface4f62687149ec74af533f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060routeBundleContents\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/daemon/src/domain/bundle-content-routing.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"330c0e6e60a7dd44aa5e5ba53e9a66c92d0089810aecddb87e5b94589362168c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdtempSync\u0060 in \u0060resolve\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/daemon/src/domain/bundle-source-resolver.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"c218e0b1f517fc661ee2d924a6af953f8083e08345793006fdcb5406cb8657ea"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060resolve\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/daemon/src/domain/bundle-source-resolver.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"f552483d2c33ca6c168af7c781d22861f632456357007f9b1ef251f76b194579"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060resolve\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/daemon/src/domain/bundle-source-resolver.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"5298aef0964a95eba584ce11908e53633c360294a1658cab392c539825251c27"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060resolve\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/daemon/src/domain/bundle-source-resolver.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd43cf6271eaf8fa3b3e1c052f908c4ffd07346603403169253d312de2218e78"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdtempSync\u0060 in \u0060resolve\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/daemon/src/domain/bundle-source-resolver.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc97127d07354a0135958d02702c33b17bb1126a0189dd9838b55ca8ca12c24"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060resolve\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/daemon/src/domain/bundle-source-resolver.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1eef6e82a4963939da982ecd8ac63e8b03085b52469e45f0941c82e7acb7a74"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060resolve\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/daemon/src/domain/bundle-source-resolver.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c03172a2d344d15d9d147132af383db9f5281869bf7c27ea1891bef9f08e7bd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060resolve\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/daemon/src/domain/bundle-source-resolver.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"19bcf53597b8b74d5d5703472acc629860b61cbb87f0e958873bf7697c94e732"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060execFile(\u0022codex\u0022)\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/daemon/src/domain/codex-daemon-support.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4746e118011fc6c49317214ac2bfe9aabfe39cc2114fa11a9f8b8641d9fe5a6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060CodexGitAddDirResolver\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/daemon/src/domain/codex-git-add-dirs.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae5d2c67ccdffa129324f8d005fc9e2b5e9f9c3c6fac7706c57df579f049803"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060callback to dirs.filter\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/daemon/src/domain/codex-git-add-dirs.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ed987e626ee05f76985774882bc0b2cffc5ec51eb706dd213507798dbb75cd5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060export\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/daemon/src/domain/environment-artifacts.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a27ccf90eaf89ded4d977b62ef4735af32f7374ea7758a5a85d0b50a031f0d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060lstatSync\u0060 in \u0060export\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/daemon/src/domain/environment-artifacts.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a53f71dfebcd546e83f0240e2ecea1497f5baa392010e7c5e615ca42ad4cca7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060export\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/daemon/src/domain/environment-artifacts.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"821379e281b53a76dea5648cca94457be79a06f39f48b680669ad67459920ae2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060export\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/daemon/src/domain/environment-artifacts.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff9909534cf2a6649dba7d70960e94adbdea5c37abb900560f1257ca59631401"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060lstatSync\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/daemon/src/domain/environment-artifacts.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d6cc2c04e6f1ce2f44018c04b84e6ae7b0dacec30f5144701f6fe6679bad18"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdtempSync\u0060 in \u0060export\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/daemon/src/domain/environment-artifacts.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d1c3f67ff571ec7beb08662994e987bee0e57b706c0ac22c19fc93287dd8ecb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060openSync\u0060 in \u0060export\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/daemon/src/domain/environment-artifacts.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e3b6ac57dcba6a5c3fc64b6170559998184a56c779ad682333305ac756ad0de"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fsyncSync\u0060 in \u0060export\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/daemon/src/domain/environment-artifacts.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce934fdc4f222ce88e34ca98c3d656485f34f6850b14575ebcfce32874fe46cc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060closeSync\u0060 in \u0060export\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/daemon/src/domain/environment-artifacts.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"582ecbf6b9978446a1eb984120beee7bf97d81fe4779b7d4ed7609d2047896b6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060linkSync\u0060 in \u0060export\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/daemon/src/domain/environment-artifacts.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe733fe6fd5d28fbb84fa081fdb468f7df8dc602eabd9f7a7c701cf0aad27be5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060export\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/daemon/src/domain/environment-artifacts.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d24ab38c5aecb7a6edd4443263703afdf458208c1e9d8c69725065cc86e33a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060openSync\u0060 in \u0060export\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/daemon/src/domain/environment-artifacts.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"549110581b040cc4008ccf0003c53cce74f6c7d6278e9d60901bbeeb39dfa954"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fsyncSync\u0060 in \u0060export\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/daemon/src/domain/environment-artifacts.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"7230396639b5ee7fe0c47e36aa9fd39ad75046f7f6fddd3b08cd8ededf38283c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060closeSync\u0060 in \u0060export\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/daemon/src/domain/environment-artifacts.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ee4acccbcb9fc23a503b3e78147f3d30cc0e86956076ffcd6ee8d57eeeefd5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdtempSync\u0060 in \u0060checkpoint\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/daemon/src/domain/environment-lifecycle.ts"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c60bf20b3e59cd056064af11355533db73a9d88accfedd0c0f09320bf9296c6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060checkpoint\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/daemon/src/domain/environment-lifecycle.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b87c7b6cc36e66090bd1d89302dff7a1c0de054e795a8aa9727e3c812bffd7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060linkSync\u0060 in \u0060checkpoint\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/daemon/src/domain/environment-lifecycle.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfddafebdac7b3455a633f06d4038e254414341115d4f7b01073794b7c07ef7a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060checkpoint\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/daemon/src/domain/environment-lifecycle.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e28bfb16e43cb46167bf2bb282cdd1c7d0e4e22af1b6ca0f1e8854aba4fc09a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060lstatSync\u0060 in \u0060project\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/daemon/src/domain/environment-platform.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"9482f6d87fda9fb64f7dc7a2d91b1290457d639d884556718520000318ebbd1b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060realpathSync\u0060 in \u0060project\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/daemon/src/domain/environment-startup.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a98ca1fccd7586c9b0486e0d5ad2d7560d65da2493d6cd31158263d37b230e4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060project\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/daemon/src/domain/environment-startup.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"135c24aaa7f4997e4d85e5c6f0377058380806e9a3c788a85e5706294a5dd4b6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060project\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/daemon/src/domain/environment-startup.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f3339efd4aecc7aae30721f72a21473418704b8fc872422d46301157c89192"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060realpathSync\u0060 in \u0060deliverStartup\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/daemon/src/domain/environment-startup.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcda9dd6f90bc502227f7446a9ccc42ee4a297b678e2a80c6c575a5f93f8388f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060deliverStartup\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/daemon/src/domain/environment-startup.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e91f9750a75e8bb35bd70820712e3abfd87d4bb67ca9162f7bdf7a3160ce845"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060deliverStartup\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/daemon/src/domain/environment-startup.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"284dbdc9289d92d6525167957383c6ab042713cd61f0c1bfb61409823f0c7d07"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060deliverStartup\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/daemon/src/domain/environment-startup.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"c214fa2a5802b443dbf35e9955440187701155eb65f748db80d61ccfcb06bd53"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060putPrivate\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/daemon/src/domain/environment-startup.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc87da7c5c9733a14cbdeb14afd83ab61d394ab787937d33d728f0989d0fbcf0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060launch\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/daemon/src/domain/environment-startup.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee59aab45b0b204ab6cf8817f35a0a501300b7fbc430a43d639d90e6d0c17828"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readdirSync\u0060 in \u0060readReviewRegistry\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/daemon/src/domain/execution-view.ts"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c76a1e74b223c22c3d498e28d66ffcdd6d4f27d181b87b96641bab1cd0fb53"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readdirSync\u0060 in \u0060readReviewRegistry\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/daemon/src/domain/execution-view.ts"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"0350e7e36f21c8887fec693d6e4332432dc54fcf5226124444b7778f6f2e3527"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060statSync\u0060 in \u0060callback to resolveIdentityVerifiedClaudeRecord\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/daemon/src/domain/expected-conversation.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"803a15ac510cf867b7c7b334c4c4b982bc28764a9fbba286eaf7854d876b62de"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060statSync\u0060 in \u0060searchSession\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/daemon/src/domain/history-query.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08dff99b99eba7c5315b9585d88a13d9b63e941357d4539c36299b9e401d0de"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060search\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/daemon/src/domain/history-query.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbcefa623067553fd8f33995d2db0c0942f7b5f61cd02b106d2fc5aadd44f5a2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060searchSeat\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/daemon/src/domain/history-query.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e2ca4017c8e40d153f3c8bb523a98a709b01debd88fee43a35fa0d7ac39ab9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060statSync\u0060 in \u0060searchSeat\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/daemon/src/domain/history-query.ts"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e66fa2b7e07ba5e4b86f7bf1ea19c8a57547511bca36e85d6cab13b034a25c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060searchSeat\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/daemon/src/domain/history-query.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe36f2b03b1b306b67039f7a12d8bf39d6445132196aa80e2f956390a7521b2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060bootKernelIfNeeded\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/daemon/src/domain/kernel-boot.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"b976602cf11381606a8f6c281ec4844b52b3831fceec4d81529b44a04ba373ef"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060readConfig\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/daemon/src/domain/kernel-boot.ts"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f3085a4f81d6add975de33df936756d037a8db3bde65f6142b6bc67e4ba9a3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060statSync\u0060 in \u0060callback to resolveIdentityVerifiedClaudeRecord\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/daemon/src/domain/model-divergence/current-model-reader.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"23325dcef109dc70853dd036858d0b1f678798c5190a55860ed199f1d2deb746"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060realpathSync\u0060 in \u0060callback to readCurrentPiOccupantModel\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/daemon/src/domain/model-divergence/current-model-reader.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c6c06a9ceb8c7fed68beba627d726bf1519bd33fedc641023d5afb31501ef8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060statSync\u0060 in \u0060scanArtifactPools\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/daemon/src/domain/policies/artifact-pool-helpers.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1be6c2ed1091dbf0bdf0ca64489e09183be61e7ec54c31448964c3d46033358"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readdirSync\u0060 in \u0060readProjectReadinessAsync\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/daemon/src/domain/proof/judgments.ts"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc8c4ca72edfc9b6c71519db565479da1168afbf51dca02a59064439b4562146"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060callback to filter\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/daemon/src/domain/proof/judgments.ts"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"7914b2d7a127d9b7d43fe0e2fdd0910914a908f6eb157252b32b37781ed56419"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\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/daemon/src/domain/provider/claude-token-usage.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c3683988817f12bf20321b48025c65fe35323277e047f1c77045c087347207"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.openSync\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/daemon/src/domain/provider/claude-token-usage.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ffa2b0654921fb587a32fb627fd1dbe9055808bfba0da187f136ebb58e8b5e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.fstatSync\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/daemon/src/domain/provider/claude-token-usage.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbdbd3cba5135745d87e76116439b1a6d06a9f8af34ad68cd7ee63ebc2ed520c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\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/daemon/src/domain/provider/claude-token-usage.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"d888acd1d32bc11c2cbece8be021454ea8c03299ca2f511dfe68b98406d23381"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.closeSync\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/daemon/src/domain/provider/claude-token-usage.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"d035174513f55594f92e0d107f04e7933277c819bbe596ee427f515d456791a2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdtempSync\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/daemon/src/domain/provider/claude-token-usage.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d38a37e60854752e039b39cd1205a47374db5c0c0b0b795fdd67ac04c298a3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\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/daemon/src/domain/provider/claude-token-usage.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f1eba03f85d897e302833b26eae8c8189c79923902a3c6180c7b9f1eaaaaef"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060appendFileSync\u0060 in \u0060ledger\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/daemon/src/domain/queue-erasure.ts"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"864368e518ad89447527a58d3e6db8aca567a8d824ebf1a7d0a93947d2961e71"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060appendFileSync\u0060 in \u0060mark\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/daemon/src/domain/queue-erasure.ts"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"4734a85ae7001ba4a3d187a55c6deabed61d06ef7755897be60b2e125b62ac1c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060appendFileSync\u0060 in \u0060eraseQueue\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/daemon/src/domain/queue-erasure.ts"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7e9a83e44859737cbc6d138bfe5a3007bb7fd03f9829082f2f2f51c8f14940"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060accessSync\u0060 in \u0060claudeContinuationExecutable\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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":1662}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c45ad01ccf14f4b1b817103dee3c78817450e1a92cb1f8e0c4a1db61483ed3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060statSync\u0060 in \u0060claudeContinuationExecutable\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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":1663}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff6081331c83e6bafe2c7d6740bc63afad8666079ddd1e1bf0ac72c82cbebe43"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060realpathSync\u0060 in \u0060claudeContinuationExecutable\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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":1664}}}],"partialFingerprints":{"codehealthFindingId/v1":"0940f993f524356954f2e8b497cc1041daedeff45bb0b1d99ed73e07925174a7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":2138}}}],"partialFingerprints":{"codehealthFindingId/v1":"269ec971caa01e4dc841d0e47e685bf65db516054b325fcc0dce20d22c883682"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060readFile\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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":2166}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d07abee3e1e7f48419649f9aa26645a324caf7ec370c62a9f8d7f26853c3ec"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060reads\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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":2168}}}],"partialFingerprints":{"codehealthFindingId/v1":"493d717bdd3e47f2dd45586c2ccb24444ef863c8d59c923dd53a8a6a84fafc48"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060readFile\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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":2180}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d3d8953fcdb0de1653e80e69d5cfd6e0da67502107973afd4dd87d5fd39bfc8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060writeFile\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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":2181}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a70a0640d405e8e322a8dab8c96da7ccdaf865ec9b79da2ad323c561a4bfac"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060mkdirp\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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":2182}}}],"partialFingerprints":{"codehealthFindingId/v1":"646945e3094d89a1bda405829ae0ed5b7620f15b2168c3c168c35b09f9a0e13d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.openSync\u0060 in \u0060captureClaudeSessionId\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/daemon/src/domain/resume-metadata-refresher.ts"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf5addc942ebbd14d8514f0b5ab36d02bfa008ad5a99eb072176dec59eca1fa"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.fstatSync\u0060 in \u0060captureClaudeSessionId\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/daemon/src/domain/resume-metadata-refresher.ts"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a142830d9cc3a6c3c61beeba81d8b7224ff74e16cb76ea931a993c3fcbf156"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060captureClaudeSessionId\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/daemon/src/domain/resume-metadata-refresher.ts"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3bff2dca03bc5bed472ddf3b6e5772372f349509c3d464960ea52259160ca8e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.closeSync\u0060 in \u0060captureClaudeSessionId\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/daemon/src/domain/resume-metadata-refresher.ts"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"926a3e0c14063a99b35dbe33e84d9a073648c0fb7574385c9e8a6253edbd5f10"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060check\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/daemon/src/domain/rigspec-preflight.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"78846ffd89399b0f13a2cafd713716641ca73fd67a1eeacec5e43cc8d3803fba"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060statSync\u0060 in \u0060check\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/daemon/src/domain/rigspec-preflight.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad8d2ae9fce7094f40069198721a07f6843f03c5c8b3639369fbe49da632d33"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060setCwd\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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"75572bf80d3aa36ee52b7270caddbe61c97d248a810c381bbca2f7b0ff4691ff"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.realpathSync\u0060 in \u0060setCwd\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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"f513acde99bb474c4db13d8e9df5563b3d70c439b159d9a32f003a29dbd98c2a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060setCwd\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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d76fbcd45ad9d4fe868cea027b2699df553379197b61f138219ef661e8453ed"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060setCwd\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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a258851fcbbc5d56e7d9a86688449c410f6027ff6f3c4e055a9f3410618da6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060readProcess\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/daemon/src/domain/seat-restart-in-place.ts"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e38eca13e66e51d4c48cd3eee361fbe98a499fded3ebaf295ab80b87c5b1f7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readlinkSync\u0060 in \u0060read\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/daemon/src/domain/seat-restart-in-place.ts"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"15368a5a026a557af5647af61ac672a2eac62b99a134909f4f588ad0d1aebe4b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060readProcess\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/daemon/src/domain/seat-restart-in-place.ts"},"region":{"startLine":1236}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6dd19306c0bd944374d90ebc6f2e71c5c59d5059f1164cfa8b06b41baf504e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060setRuntime\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/daemon/src/domain/seat-runtime-switch-service.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"38bf1365539aee5491f5475552119ee4759585765f62aa108de079ad59d1457f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.accessSync\u0060 in \u0060setRuntime\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/daemon/src/domain/seat-runtime-switch-service.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace338c5ac6116d07319df98a15c381d208499b2c84b41efe9f8f8236f0e672e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060setRuntime\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/daemon/src/domain/seat-runtime-switch-service.ts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e90f77ffa1311abd0ec7b799008af7ff97992d64d291271ce9fce837773889"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.accessSync\u0060 in \u0060setRuntime\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/daemon/src/domain/seat-runtime-switch-service.ts"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c365cf3aed477718f00220946d108e20b9c144b6324f0ee9fcff2c594724fd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060prepare\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/daemon/src/domain/seat-runtime-switch-service.ts"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"351bc10bf6b46e6c4a0a11d628505e4b95465b7d88888318f2e689467068e78a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.cpSync\u0060 in \u0060prepare\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/daemon/src/domain/seat-runtime-switch-service.ts"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd9b91be707019043e4212442ca45c65ba3fd742111fd083a4b3bf2c639f3438"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060prepare\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/daemon/src/domain/seat-runtime-switch-service.ts"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe55ede4f19feb853d775b565930b0a8c7f54ddd57c4cd97ee7394ef869ffcb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060prepare\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/daemon/src/domain/seat-runtime-switch-service.ts"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4129b4b19d0583d030261fa56f9c7d72ae010efa3e88695e42eaa541f91300a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.copyFileSync\u0060 in \u0060prepare\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/daemon/src/domain/seat-runtime-switch-service.ts"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db15b0d7250b2fbae20f7cccf5b1971150d129ee063237b99fdb61a17c157e7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060applySeatSkills\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/daemon/src/domain/seat-skill-apply.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2abb841bd4497716f05bb771d8dff0c8392c0ca1eabc107cac98553a55e01bc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060applySeatSkills\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/daemon/src/domain/seat-skill-apply.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf43a0760ab5fabe05b54cd0585332ec8b047ef314f81394916843bb9df4476"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060checkMirrorDriftSafe\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/daemon/src/domain/skill-mirror-drift.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"af367914ebb6d735f2824a7d2c85a0ec6fbebb27b12b858a007a90b1df966d36"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060checkMirrorDriftSafe\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/daemon/src/domain/skill-mirror-drift.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"481ec11be300f9199d16c1dcc38c8caf7daca5dc30e247717597b611f29d6216"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060checkMirrorDriftSafe\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/daemon/src/domain/skill-mirror-drift.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b40a2fd9b725b1e7e33dba33bf0afae73d167f79a1fc184ec1fb6ecfc41c2f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060save\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/daemon/src/domain/terminal/herdr-follow-view.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba5f43f4a0b5d938efa1931856a8748393e8f17822a4cb36a7438094e50fc8b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060save\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/daemon/src/domain/terminal/herdr-follow-view.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"36000b6b4b3e08a5af4855e23496e24cce3be53de36855ca561628a171695dfd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060renameSync\u0060 in \u0060save\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/daemon/src/domain/terminal/herdr-follow-view.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd9733f44c930b414119af74bf277f1ac3243b14b910e6cbb2c654c10b17fbe"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060save\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/daemon/src/domain/terminal/herdr-follow-view.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"56139febad873ea06aa3095a40e4c34d56d4ea84a8bf1b0eef111b867a667c59"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060save\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/daemon/src/domain/terminal/herdr-follow-view.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade46f3955fb3fcecddfb11ca747f5bb850cbd05f7227a26db59b435b88f4e36"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060apply\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/daemon/src/domain/terminal/herdr-follow-view.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"e600eb548feed35cc2bc3d51453f9cc63f4da634e9c6f4ba4577cb6cbfbc5e80"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060apply\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/daemon/src/domain/terminal/herdr-follow-view.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"b56f01edc6fe52f8a3bf599861a7711ac6f63cedab28b7d701dc1ffd0b5f9e16"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060ensureOnce\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/daemon/src/domain/terminal/herdr-viewer.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"360b714f6594abb93209934b2fb7edba3f76d37329aaa604f581b34b2b5a8199"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060ensureOnce\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/daemon/src/domain/terminal/herdr-viewer.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c3a8245b6c7f50b48888b333444bfbb8f0bd96bfc15b7ebd69b82fd20c9582"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060save\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/daemon/src/domain/terminal/herdr-viewer.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"b743835865ae9eb5be74c49bba9ad50ebeacfaeb28333be0844ef4f2a0ec4e62"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060renameSync\u0060 in \u0060save\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/daemon/src/domain/terminal/herdr-viewer.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c8ea544dc6e572439266d7fbf1155d1145fcd2117645dea99b78b88f174b5e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060ensureOnce\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/daemon/src/domain/terminal/herdr-viewer.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb010f2c0646b3cde6819bb21f409faed6a137ff492d804d314b7405c9daaf2e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmdirSync\u0060 in \u0060ensureOnce\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/daemon/src/domain/terminal/herdr-viewer.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"447d5983a0fa7ffa06bb29960f47aa5c1e3ba0cc2b1385655e52704a2355d7ed"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060callback to pending.then\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/daemon/src/domain/terminal/herdr-viewer.ts"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"09caaf5d8c6f6b30ab2681c88f9e14216c836cdc9339251d6d05b95d933ff60e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060callback to pending.then\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/daemon/src/domain/terminal/herdr-viewer.ts"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a425723315a329a8f9cd841c105bd5a104ad6a466fc38242fe1cee418d92c8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060renameSync\u0060 in \u0060callback to pending.then\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/daemon/src/domain/terminal/herdr-viewer.ts"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"62070c1fd6e6a7d386f168e50bff7da0b57822d24c034838d136db934951e1ef"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060resolveLocalTmux\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/daemon/src/domain/terminal/terminal-service.ts"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"301c803c2759d44a08246a476d0244e05f183e22d368b0e22eaa9d5e9f49a10b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060selectTmuxServer\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/daemon/src/domain/tmux-server-selection.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"295339dac386ecc4d1f32481193a2c8606e72585e8cbff580e51c6b304c81a46"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060selectTmuxServer\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/daemon/src/domain/tmux-server-selection.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"d481ec11a86003b63c262ebb23cab658d94df15525cd27ecb765d9e84daeb597"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060selectTmuxServer\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/daemon/src/domain/tmux-server-selection.ts"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f39ec92056805d6ebb6ebf9a8d97c085a1f5dc54cd6506be5a7f0e982dfa6c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060tick\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/daemon/src/domain/transcript-rotation.ts"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"60717e942c3c1241ea9154f6bca32f5903a25a4cc0ab04041962e36718436923"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060tick\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/daemon/src/domain/transcript-rotation.ts"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"f182408780ee3ef6f2edf7622d23077963af0b0d454abffa5547e2fccad8396c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060tick\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/daemon/src/domain/transcript-rotation.ts"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"9501083b317126c6e2966c0942768886f5139c2c3fef0b16c81f0aaec54b819c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060tick\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/daemon/src/domain/transcript-rotation.ts"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee232343ca09c5659bf4ceaa92d00e00be7da92b4339dd937271fc036560167c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.renameSync\u0060 in \u0060tick\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/daemon/src/domain/transcript-rotation.ts"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"983a666abd2100a6d0e67016eb7d38009ca6c1a25843b39b665f58a2d01e3ea7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060Atomics.wait\u0060 in \u0060callback to eventBus.withNotifyEnvelope\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/daemon/src/domain/workflow-projector.ts"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"c00f30a8628603bb15a730086ffa1f5e3b0eea31ac5d5e95a729c4ac4abc8d99"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060postHook\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/daemon/src/routes/activity.ts"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9775f5181034c290cb133c8c185b81cc91b2c20c917eb7dea773730856614b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060router.post(\u0022/prune\u0022)\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/daemon/src/routes/agent-images.ts"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"15982bfd3c9bb2223c2f4c27991f9d638076b670e2a5b5d74cce760d720e9824"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060router.delete(\u0022/library/:id\u0022)\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/daemon/src/routes/agent-images.ts"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"79d1a6d2325a661e03b0eb0309b54387561aa3d2912ad46e361e7ea4ef1bc335"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.realpathSync\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/daemon/src/routes/attention.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"94140c2fb2e35ad7afa17255c48b3e33f89d95c37bf7a6b462d4075de24a70d9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.realpathSync\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/daemon/src/routes/attention.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0206c3b6f0223344b4cb2dc060b7c164728863052996755b3a68f30b6689a2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readdirSync\u0060 in \u0060app.get(\u0022/\u0022)\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/daemon/src/routes/attention.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"68eec521dc9500ab5bcc6ac9d2bf9140cafada2e34e457523935c600e1ec08ce"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdtempSync\u0060 in \u0060extractInstallTimeMetadata\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/daemon/src/routes/bundles.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6e74fa215caf9f85bbec3899ac83c7baae366866391a3393dcbc13ad5f649c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060extractInstallTimeMetadata\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/daemon/src/routes/bundles.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"76734a41a7c50da009eb997a46fef351c29fa2c7850102703b473a83780325ec"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060extractInstallTimeMetadata\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/daemon/src/routes/bundles.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f7d302e3689faa2058717f4f303f079cc9f56c7592c2eabd75f15d889f26a0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060extractInstallTimeMetadata\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/daemon/src/routes/bundles.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a8a54344d05037b62333f6e172c24f172d524de485f526c5c6b4e9b17e1c26e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060extractInstallTimeMetadata\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/daemon/src/routes/bundles.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef8748f1ab8c0a82c487f9e0aca9561c531ae4e824854522cf841ee9eeae0efe"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060extractInstallTimeMetadata\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/daemon/src/routes/bundles.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e10cd036b7fc1d7a11ea33544786ff43920798ebd41b04dc89c8b2b8e7cdeb6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060bundleRoutes.post(\u0022/create\u0022)\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/daemon/src/routes/bundles.ts"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d288afdbd8dc5885289e9988bfaf0e6dabb764c966c4a32b024159078da6484"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdtempSync\u0060 in \u0060bundleRoutes.post(\u0022/create\u0022)\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/daemon/src/routes/bundles.ts"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"534c8bd79adb4d135e393364b303e43d0de431154609b045e6aee64131bdc5de"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060bundleRoutes.post(\u0022/create\u0022)\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/daemon/src/routes/bundles.ts"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d37c5aa1d6e259885e4b6e2314aa0a0c4618eb468b00fbdce7dba3618f5879"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060bundleRoutes.post(\u0022/create\u0022)\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/daemon/src/routes/bundles.ts"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"b486d098ea6b8290fdd21dc15999f1d80a8a2169d7bb600e5eb9b0f4a72129a0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdtempSync\u0060 in \u0060bundleRoutes.post(\u0022/create\u0022)\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/daemon/src/routes/bundles.ts"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e18ce84952ca228908df637c8a34a4330e62040d6d57854ee2f6ef090124b3e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060bundleRoutes.post(\u0022/create\u0022)\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/daemon/src/routes/bundles.ts"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"c785c487eef46cf9be2b1225fe9459976be575e431805ce040a3f0ee15c08bea"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060bundleRoutes.post(\u0022/create\u0022)\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/daemon/src/routes/bundles.ts"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bce296c035a65609c404f3ea0f8a22ef0361d4801e79eddc5686b727997a4fe"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060bundleRoutes.post(\u0022/create\u0022)\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/daemon/src/routes/bundles.ts"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"80788ec5a0a21a76c69616b5e2a33787575e4df5ee9ecf790ae5b71ff756d550"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdtempSync\u0060 in \u0060bundleRoutes.post(\u0022/inspect\u0022)\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/daemon/src/routes/bundles.ts"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"106ca933521cda8c070e473f029866318d2f11f7e964f81e2d119965463d156f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060bundleRoutes.post(\u0022/inspect\u0022)\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/daemon/src/routes/bundles.ts"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bea53a68a27820c7abf20754a88e3480ee08bf8a3945b23eea39ce2d2db9769"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060bundleRoutes.post(\u0022/inspect\u0022)\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/daemon/src/routes/bundles.ts"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"f25380265677d7ccbc448b8a25436433a329fd91d20f21faf753d6fc2cc4e3bf"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060bundleRoutes.post(\u0022/inspect\u0022)\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/daemon/src/routes/bundles.ts"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59883fd3ffd42b423395f21ee71cb4439828288a873137f4f16e413f1d0c29e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060router.get(\u0022/library/by-ref/pieces\u0022)\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/daemon/src/routes/context-packs.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c29954fecd065815f14281439c381e6cdc93b1632d2344aeea84a4f6f3f7e36"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060router.get(\u0022/library/resolve-address\u0022)\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/daemon/src/routes/context-packs.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc5fb6d3aaf886560c4c21bc59b32a4680630a80d68dcf49f33156254bbadce0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060router.get(\u0022/library/by-ref/profile\u0022)\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/daemon/src/routes/context-packs.ts"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"7085965800a16d80d0f4963e06f4e7be34b9893cecb46a23621d00056bb2bf0d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060router.get(\u0022/library/by-ref/profile\u0022)\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/daemon/src/routes/context-packs.ts"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"f993543f11d26e1cef23b146b25135fba6746a40cac6a5581e62557d225827fa"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060router.get(\u0022/library/by-ref/profile\u0022)\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/daemon/src/routes/context-packs.ts"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ac430c33088d43cd66eb31e069bf365683b91f34d4d7267cbeec0235832c0a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060exists\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/daemon/src/routes/crash-cart.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af70826ed22c50812bf0c0e1e0d1c223a4f36f959f90a60ed19485a03efa649"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readdirSync\u0060 in \u0060app.get(\u0022/list\u0022)\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/daemon/src/routes/files.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"2351fa73e75a18c1876aa407f1501eb1f9edc5a03cb64c0670e10ac3365436f8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060callback to entries.map\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/daemon/src/routes/files.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5296f67971cf4c80ed991305ad6c0c14c25f6123be799bdf58995d7a2aa9eb2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060app.get(\u0022/asset\u0022)\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/daemon/src/routes/files.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"89dc25bed582a4f875940eb3be84a6774dc7506e3c8746337a13faa0ded74e8b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.openSync\u0060 in \u0060app.get(\u0022/asset\u0022)\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/daemon/src/routes/files.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a019020210b8dca6fe58a50064e94e99d487d221666f5a6d55bdb9594a98e0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readSync\u0060 in \u0060app.get(\u0022/asset\u0022)\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/daemon/src/routes/files.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"380c8d005ffdcd1741af80a34d18aecfa7f98807c2db6156407a2b9a3db74f9c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.closeSync\u0060 in \u0060app.get(\u0022/asset\u0022)\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/daemon/src/routes/files.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c466059bbe7b8b22fe08d338e8f333aa155edf3526099a6f5430c4b1b5c459"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060app.get(\u0022/asset\u0022)\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/daemon/src/routes/files.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22a3d710e718d850ae847fcf76badcdda730c68af9c4a8f7467827c819372e3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060router.get(\u0022/\u0022)\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/daemon/src/routes/hosts.ts"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c393cda4e6800f9dbd2eabc5368612837d15ccf26d5b791e37e585bb3de89a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060router.post(\u0022/pair\u0022)\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/daemon/src/routes/hosts.ts"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e863555bbbceaaead38f2a3a79a46e390687ea01656bb032f4ff081b0a5682"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060router.post(\u0022/pair\u0022)\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/daemon/src/routes/hosts.ts"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"797a48ab1c8274eb72fba97b2de6766791d97b38caf06288faae551e412728ad"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060router.get(\u0022/pair/:pairId\u0022)\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/daemon/src/routes/hosts.ts"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"a342f94dbcc5bdf88e0047cb75aafa16e89fda545dfc14a81dc0ffcb60839a89"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060router.get(\u0022/pair/:pairId\u0022)\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/daemon/src/routes/hosts.ts"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"d05cc74a1a5e144a8bea94f5634bca6580e0baf25f8d931f162a65996b62284e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060router.get(\u0022/pair/:pairId\u0022)\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/daemon/src/routes/hosts.ts"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c3ca924420cd4dc20fdb209b13ac214ce43dbf34100415cceb9f6117e10177"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readdirSync\u0060 in \u0060router.get(\u0022/:id/files/list\u0022)\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/daemon/src/routes/plugins.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"3956a226de3c5af207910bf490c73b90f1958cfdae9c8753c99f8bdc60e24855"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060callback to entries.map\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/daemon/src/routes/plugins.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b6e2862cb708c94bf356d329c2e6ea82c8adbb12c3d31d629257f058f7feb4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060router.get(\u0022/:id/files/read\u0022)\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/daemon/src/routes/plugins.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd9ba64316ebddc0e2959e32c07b8def90bbb0f295efd28df19d0d56a6ba827"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060router.get(\u0022/:id/files/read\u0022)\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/daemon/src/routes/plugins.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"90fe917104d44ba7815ae60d56ae5bacc428efd5df716297fe8c7dcab09be45c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060exists\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/daemon/src/routes/provider.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1fbbd3e747441410e1e69095981adfbaef2acb6c2a3bdfd993464f0c3acf613"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\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/daemon/src/routes/review.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6932e75f33ad2b4aa43e4530a8886cf837301f7740d94e9afc7a7fc1285817d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060app.post(\u0022/freeze\u0022)\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/daemon/src/routes/review.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c99c1ec1697cd54b45503fc9363370911710dd6b19e889fc2945f4ffe4fe22c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060exists\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/daemon/src/routes/rigs.ts"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b2c6f7a3a9347cd44894d94ad9fe01059847dd4bd08f62bdd78dd509d1adf3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060readFile\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/daemon/src/routes/rigspec.ts"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5a95d42395e8db67b8871b1c9c1e12d74f295df6faed4375a8aef4f9e993f8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060exists\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/daemon/src/routes/rigspec.ts"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e50961f6aa1f0a4b284f31a28a84376b9d21326c77692bc123d9af20b4efbda"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060app.get(\u0022/\u0022)\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/daemon/src/routes/scope-audit.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"562e9325ae1c1fcb958b7ac6bd0f8309720118d15ac21bb00597642f7357d186"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to indexer.withMembershipBatch\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/daemon/src/routes/scope-audit.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"85236ffb60e57a2e15b125af58ab7f54551eabc6d256dcd2ec1b2bcb74291eea"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to indexer.withMembershipBatch\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/daemon/src/routes/scope-audit.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc5c1355bb3610efd2d43afabffdbbdf776614c9e2b0e17419a9a43af1a8ef5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to indexer.withMembershipBatch\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/daemon/src/routes/scope-audit.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b4ce00ec0e7e0eeb24277a8e2a5d35a694f5961cf2bf1f720ffe6ce89a7284"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to indexer.withMembershipBatch\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/daemon/src/routes/scope-audit.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b08530ba26d4bafb973ccb8b33851444dd922ff91d79e95dfb6024d2eabe00f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readdirSync\u0060 in \u0060callback to indexer.withMembershipBatch\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/daemon/src/routes/scope-audit.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5acb0cfb704879637e9f0a8d71347c06f37183bfd7067ca031c4314b947455"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060callback to indexer.withMembershipBatch\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/daemon/src/routes/scope-audit.ts"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a6cfc9781ae5694f204fdd95c8b1afc999d89f5e1063b432c434532cb260eda"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to indexer.withMembershipBatch\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/daemon/src/routes/scope-audit.ts"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b1a4c5fb94747146921b3893093013633eca381d1ecd1cec30786eb56671ff1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to indexer.withMembershipBatch\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/daemon/src/routes/scope-audit.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"677535521049e2ff59adb213ac09c1bbc151792414757e2fa3626a01c77789e0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to indexer.withMembershipBatch\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/daemon/src/routes/scope-audit.ts"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"a97349932d0b487e51ab2397d1f0d2a314917424ffff88528aae1a9576d07a5c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to indexer.withMembershipBatch\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/daemon/src/routes/scope-audit.ts"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"a39ba44b88cf8bb3032b455c0c3195c6627b5029b662347177c7ad5dd9071dd0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to indexer.withMembershipBatch\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/daemon/src/routes/scope-audit.ts"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"170501784eb6279746d4ad9e4fb5a1a31bf793f698620ebfb7093d39221616f6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to indexer.withMembershipBatch\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/daemon/src/routes/scope-audit.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01d283d8eb4b92a0ff234138a946f6bcede17cba59881a9339f1418839e12cc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to indexer.withMembershipBatch\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/daemon/src/routes/scope-audit.ts"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d9b2df0ce466e936d33b949703314faca0fac5d03bfee51433034bf9b666ee"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to indexer.withMembershipBatch\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/daemon/src/routes/scope-audit.ts"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1a66c9317f6488efada0587cea54a1c35222c89b66c1739d05ebef2f0ec2374"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to indexer.withMembershipBatch\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/daemon/src/routes/scope-audit.ts"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"36bbe4dd67ad26e0e0db01f42204437517031a7e6fe547eeabbf219f8be27efd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readdirSync\u0060 in \u0060listLocalScopes\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/daemon/src/routes/scopes.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3bd5f90f8cf46851edd50d1149f820101be4548c2d8de5875e5b0cdf3ba0df3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060listLocalScopes\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/daemon/src/routes/scopes.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a83181a1bdb93b57b9378f595a7a140dd7698c75d09906b268726015491f2a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060exists\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/daemon/src/routes/sessions.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd3399b7df06b60fbfa27240516a7365b248bd760547ec4e27c83a9ac029552"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.openSync\u0060 in \u0060generationRecord\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/daemon/src/routes/sessions.ts"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc523e5fd07567eb4aa8476ea1bc96144003f273f34c1a9a6616a9bcdcd347e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.fstatSync\u0060 in \u0060generationRecord\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/daemon/src/routes/sessions.ts"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e6f0fc8813973c2ef48b8f0db20cd824b5eba1419c69c5a114d08ae099e3f35"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readSync\u0060 in \u0060generationRecord\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/daemon/src/routes/sessions.ts"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbaee5ea70af9e9c492f6033a74aff94599b7a07d722ebec1ad6c686a2136c2a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readSync\u0060 in \u0060generationRecord\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/daemon/src/routes/sessions.ts"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"60262a1260d0e56193dfbd3df4473ea82d8d623daa48512d48b015c187f274c1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.closeSync\u0060 in \u0060generationRecord\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/daemon/src/routes/sessions.ts"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"10bdfaf57c2702351f419e8a2ea239fb237fc96c53109579e19cda1fce80ca2b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readdirSync\u0060 in \u0060router.get(\u0022/:id/files/list\u0022)\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/daemon/src/routes/skills.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a074caf680a2b5ba8854a86ccda09d19372d6f189a5c27efb489b40307b8fc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060callback to entries.map\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/daemon/src/routes/skills.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"737849341a3abe592d4ef2811e0b2a16d66de90d3c5422dc978acc2e6ecd7abb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060router.get(\u0022/:id/files/read\u0022)\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/daemon/src/routes/skills.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"8965e7688cc2c14cad45e9aeb3ea408edf3712034617091724cdbc1101d19503"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060router.get(\u0022/:id/files/read\u0022)\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/daemon/src/routes/skills.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7fba770c313ca01f406166acbe6e85cab7916f71b01cb0bcf14df931a6f8fc6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060exists\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/daemon/src/routes/snapshots.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca75a5390eb6fdaf8c2f2c7bcef823b9ea60da52a53cd2dd6cef0334a0185a1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060realpathSync\u0060 in \u0060callback to entries.map\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/daemon/src/routes/spec-library.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"498a38f4ec083f66dfc9f3e380419a3a0d5fbfa96ccd51b4d36e753644112b53"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060router.get(\u0022/:id/review\u0022)\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/daemon/src/routes/spec-library.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d8b9b85668726744b257eae9fe491956e620da0806b7be460f291b854b63cc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060callback to exclusive\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/daemon/src/routes/startup.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef32fa9cf193b2eb833da06560be1616a5c57e2f42ed23875435987c15cf9001"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060callback to exclusive\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/daemon/src/routes/startup.ts"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c3fa70cc7ed4749e20ada801f08f5815a2c8127cea33f6aebd23512989783a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060exists\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/daemon/src/routes/up.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5fba58a611230fcb8121d963a924a707fc079fc30e5e3e6cb6ae87dbf9cd25a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060statSync\u0060 in \u0060app.post(\u0022/register\u0022)\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/daemon/src/routes/watchdog.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"e265bf95de6cdc4ea1f031cde90c5bb1f6c914d0b2a49aa4f7bd619ddccde1af"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060rosterUnavailable\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/daemon/src/startup.ts"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"e980ef7eac54e74feea8b176a65b565cbfd0091e5dd0df865bfc8a8c677fce75"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060readFile\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/daemon/src/startup.ts"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea5e841001785db396c3429a34f362d3a43b6659511e16b440bfc4c0d39914b8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060writeFile\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/daemon/src/startup.ts"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"39fc52fc950464643031f05894e3f4612f3119bb0f3ff67d8742a9c8388d13ed"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060exists\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/daemon/src/startup.ts"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e8da7d41590964ab461cdf30fc340cdecd708221d5b6cb0c9d130107d2a5e2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060mkdirp\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/daemon/src/startup.ts"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"84fd92372315f7ecc5f462bfff677c42bcb0efcc11567e84b3ec5f288e0e461d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060readFile\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/daemon/src/startup.ts"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"df8de3917395128ea1920cbc21b137beefbef262c48cde513e03dee1555ca335"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060writeFile\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/daemon/src/startup.ts"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"58fb889bbc262b582e81530c693487b8fa4eb856c9b3f1fb2aed573c5e0f2941"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060exists\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/daemon/src/startup.ts"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdd0e69ca40f58f8396ec7e4888120f8c6fb263ffeab57a7a5599eff36f4780a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060mkdirp\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/daemon/src/startup.ts"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"11040822555e61a73326cc794cc3863f04dc0c51ba46a9b098ba77d192eaad53"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060exists\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/daemon/src/startup.ts"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"fab24e92000e149f005f08ba5c7939df9e0417649d5e871f936c2f74b6132ff4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060readFile\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/daemon/src/startup.ts"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80132f0d63bcaa181ee260f381aa9b1b68bb8277ce4bbbc137516e2aea4ffd8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060readFile\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/daemon/src/startup.ts"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11ee5f9477db56a89235a884534d64ea20c7fcc52ef819eaf23e61596cdc363"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060writeFile\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/daemon/src/startup.ts"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"791adf5ad2226eb0816a5fe1f137b6eca5732b77c8d82182019258e3b323b3ae"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060exists\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/daemon/src/startup.ts"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee84936ef54ebd454ed87ee9d763e2010ef32824607e77ab827d1d401f384e7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060mkdirp\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/daemon/src/startup.ts"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"9719e860082b69973391380ef06d381ef36df7541efad542f87266d07c7a8819"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.copyFileSync\u0060 in \u0060copyFile\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/daemon/src/startup.ts"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"983f3faf46ccfda564baba6f955411c336f78a1cf7fd8e395d5e509031987513"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.unlinkSync\u0060 in \u0060deleteFile\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/daemon/src/startup.ts"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"d136acf81f289822edf45d43e94c3222c8c51c63680c5cec5812b34c6793c602"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060readFile\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/daemon/src/startup.ts"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c69c68c080611d047c325e44e4abf14e2485b4f431e3d7c013010321f9083d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060exists\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/daemon/src/startup.ts"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"652dcc423d8db50436d63d1f6a3be31ff530f6c466ab256efe8f5eda292faf02"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060readFile\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/daemon/src/startup.ts"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b60c3a8bf9358576ee493f0dfc4ff58650ee4752d029380911cf8b6dff19f9f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060exists\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/daemon/src/startup.ts"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff3347be6baeaf1ae705a5f6e405178c4e8d6efae49dc48a090351dd4eacf8d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readdirSync\u0060 in \u0060walk\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/daemon/src/startup.ts"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"166cbeec2d2560e3333f8fec11282100c9274844b5e24dc78002dbef86e147f9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060readFile\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/daemon/src/startup.ts"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bac7b0910202d7838a9c199b3126824233cb7c2874850fb9d50914d933e30a1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060readFile\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/daemon/src/startup.ts"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"3152e2ef82642a458477885bbe59717d0b38a490e90ff55dee8cde6826660910"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060writeFile\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/daemon/src/startup.ts"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"615bc1e96a8171dfc40692cb6d396ff0d86367e6120a8c012c84bf2b7cdd64a3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060exists\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/daemon/src/startup.ts"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"24cf9a6c1c3ef18e618f6931abb9471284405d5e0479562f8ebed2c06c132f3d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060mkdirp\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/daemon/src/startup.ts"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1b79df6280f80988488221555429a0edb27efbf7a65a7313d1bb416dada1a8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readdirSync\u0060 in \u0060w\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/daemon/src/startup.ts"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9ed726cf5ae5a4bc3d1a307f144c0bd5e2ab257375813b0ab067f9732a46db"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readdirSync\u0060 in \u0060readdir\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/daemon/src/startup.ts"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19940b8064a9af88b5f9353365d216747b9c33b4f022c3bd9ebeeb1f9934319"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060statMode\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/daemon/src/startup.ts"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e7051324cccb4733e35ad13d90eb51eda679121b5c939b30be606d286346ac"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.chmodSync\u0060 in \u0060chmod\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/daemon/src/startup.ts"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"273587f60081ad867bd0adc92596c84bc559e3df514ddf647d66ef5a4e37839b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060readFile\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/daemon/src/startup.ts"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed62874d278bf51e92a2c3900ee1ab336a1a24df7800d35e0a80f4857e196a90"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060writeFile\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/daemon/src/startup.ts"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6248b33bf55d8a6f46c5ad916b1037373c54cb674a12a8949e2e6b69552c2f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060exists\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/daemon/src/startup.ts"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed7be752cd95bae40b829bd841dfdc0ef28f5598211ebda67a9e5dcaf2b88a9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060mkdirp\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/daemon/src/startup.ts"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1da72d1054ac9a507efb24d5a6d414fac292f4d34d0aef8f29f56cb2dd76563"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readdirSync\u0060 in \u0060w\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/daemon/src/startup.ts"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"467d5310157bd6cf5d1d7ea99b989c901b343e9a49afb5d9a938cb294b3f225f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060statMode\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/daemon/src/startup.ts"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea3bae13127f10aab26a2d2eb7d86c5b470876137983c231167541478f969ef"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.chmodSync\u0060 in \u0060chmod\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/daemon/src/startup.ts"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"b343de6f958eb8dea275df4b46fdf98a07927f78d149675bfdbd6def22b84938"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060readFile\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/daemon/src/startup.ts"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"803b0377528818286191f4ccadcaae158f1c62720276dd6180fea5710d8a70d5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060writeFile\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/daemon/src/startup.ts"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"02847c4c26d676b0dca3000029779fc1c82442a58c8382d1c7f66bb0aac5344a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060exists\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/daemon/src/startup.ts"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d0ce7f1256a0ce8f0d3b5505d65086ffb5638b3b44103c36e033b558461c942"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060mkdirp\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/daemon/src/startup.ts"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"34eec35da01b603f1ae946f19f5aa0c381a2cccfea522b968756db6914de50cd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readdirSync\u0060 in \u0060w\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/daemon/src/startup.ts"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"5957c38d82901567cb4e0b6eb8a647dcea0a5abcd58674e6138ec4f9a3c20ed3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060statMode\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/daemon/src/startup.ts"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"682163ca0956b35ce93404533d4a1e5d50c1997b26f778459f00a381724981f1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.chmodSync\u0060 in \u0060chmod\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/daemon/src/startup.ts"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a4a0d5b088b71e030e87da1664d777873514b6edc21331f194b4bd2412b944"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060readFile\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/daemon/src/startup.ts"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"133694c1ab30b99772256b59504040d00e81447ab3b0caf024682e52b1c10649"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060writeFile\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/daemon/src/startup.ts"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e93cf61a67b0ac94d540e923e329db902a55f599b785549b0b6c254199b58e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060exists\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/daemon/src/startup.ts"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f675a861fc2f6551698996a7224763e753f7cd2d6011de28435bffc085ef80d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060mkdirp\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/daemon/src/startup.ts"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"30aa4cd51b33017fa485c3bc5efd957b1f802ecc88ae7da85d45a5eac6bc49bb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readdirSync\u0060 in \u0060w\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/daemon/src/startup.ts"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b333486774187eabcbf14eb6140bc852a13a1bb90f0aaab9b366bdb8c16c01"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060readFile\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/daemon/src/startup.ts"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf3cc926072343f200c7f40457798cd1d83dfd05cf1577c5764c4bb8cce8eef2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060writeFile\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/daemon/src/startup.ts"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca31be9b5049fd9be404efd3c48682aeaf14b2a7e11345f33d982575918ceea"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060exists\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/daemon/src/startup.ts"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba98d7d1327a197038a81b4775eab39bd09e3045f0d4def39ebc1d4a4d95192c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060mkdirp\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/daemon/src/startup.ts"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85da54387685bf678f5ac75e0dec010fe4819c9efae812ac5ea0159366d2885"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readdirSync\u0060 in \u0060w\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/daemon/src/startup.ts"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0a1041ab6edb7359651b27d6a6afe62e56aa879d48fd66a2278c52960b2ed4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\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/daemon/src/startup.ts"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb63fcd780267011b6d6ee8754345623a81490590e779a45d6e97aafb329acb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\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/daemon/src/startup.ts"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"63712225ba40e17e9f18f2a0914734a020d911f4f4bcf960b5e8d6d3aae1e989"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060agentImageRootBuilder\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/daemon/src/startup.ts"},"region":{"startLine":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"f699240a08d1126b713e5a1f2f34814bd1e1d711165f7bce4854ae0eb8a96e17"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060agentImageRootBuilder\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/daemon/src/startup.ts"},"region":{"startLine":1260}}}],"partialFingerprints":{"codehealthFindingId/v1":"201a9f56562f7534222691738916e5f77745929321cd12413c9de86337398aab"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060readFile\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/daemon/src/startup.ts"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"deffc19edabd51ba781b67425c84cdccece7c44ef5a915946b0e1136d06d2326"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060exists\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/daemon/src/startup.ts"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"7172577004f1d430a09d913366431938cc2809e7a325d47d1d9f88efe270fc09"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to restoreExistingRigUnattended\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/daemon/src/startup.ts"},"region":{"startLine":1406}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7cfa44ccb4e25f3e05115bdeb869974d57334500907bf7d598f4283b90fa42e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060fsExists\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/daemon/src/startup.ts"},"region":{"startLine":1423}}}],"partialFingerprints":{"codehealthFindingId/v1":"35405a650f102364769b86e9bb3bead0c4cb37d60b1c1e78aa57d3304d2e380d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060fsExists\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/daemon/src/startup.ts"},"region":{"startLine":1426}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19a6def01620a0d4c308f10eb4b42e1efffe94f5a109bb2fa4c0f0b9e44090a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readdirSync\u0060 in \u0060fsReaddir\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/daemon/src/startup.ts"},"region":{"startLine":1427}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfbea2aaf847081b475279d32658f17828824ee95fa802e10876824cd78e0817"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060exists\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/daemon/src/startup.ts"},"region":{"startLine":1680}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc4e3c528e88e445e80cf4a637aac1bf67bb61b9308e7d1240e5ca8c6b9b2f2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060readFile\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/daemon/src/startup.ts"},"region":{"startLine":1681}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c79d305ad3b6226c97a8cc74be1ac6a7139e4929c206e8aa21d65154fbd09f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.openSync\u0060 in \u0060readHead\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/daemon/src/startup.ts"},"region":{"startLine":1682}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e427aec9e8d5f3211e53c161921f90f4c4ece5457cd9d4221a184c4e984c6d4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readSync\u0060 in \u0060readHead\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/daemon/src/startup.ts"},"region":{"startLine":1682}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b26ad40b4b3d1a8ebb41fb85fa33524b7250f515a557fbb7ab07a8d4f421c25"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.closeSync\u0060 in \u0060readHead\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/daemon/src/startup.ts"},"region":{"startLine":1682}}}],"partialFingerprints":{"codehealthFindingId/v1":"2585fc0fb6831c426183ca0d8b52c29d6ed4c8b988ae77d64a6a86601f35f1b4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\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/daemon/src/startup.ts"},"region":{"startLine":1832}}}],"partialFingerprints":{"codehealthFindingId/v1":"855a4986fa4fe57e56cb66b70f632611d41f6acbb73a34e4bd9ac339d7cf57ce"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\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/daemon/src/startup.ts"},"region":{"startLine":1838}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c291fef0c070c108e590c8b5471f0adc0c08b5d4b48fac65593237a3ee3851d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\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/daemon/src/startup.ts"},"region":{"startLine":1842}}}],"partialFingerprints":{"codehealthFindingId/v1":"2087f57f6dc5e4b283b993373e43ce317e8e00b1ccaa9e54d22ed023b8d6e987"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060createDaemon\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/daemon/src/startup.ts"},"region":{"startLine":1901}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d7791505f0bbd815c19a02b0b411518918a9b06102b16f391de2daf454938a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060createDaemon\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/daemon/src/startup.ts"},"region":{"startLine":1903}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ee631d2416655f342521ddc8c91d8859c3e16e617ee3a8708e6b44ab3593ce"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readdirSync\u0060 in \u0060createDaemon\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/daemon/src/startup.ts"},"region":{"startLine":1904}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9e2754ecd204af7d6046f317f0fac84b178aad2f0dd46811d62a3ac298a832"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.copyFileSync\u0060 in \u0060createDaemon\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/daemon/src/startup.ts"},"region":{"startLine":1906}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd21fb79a1ab651bb72046893f31c1ab68fded98dc84fbce18b906d6bc3fdca"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060ownWork\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/daemon/src/startup.ts"},"region":{"startLine":3040}}}],"partialFingerprints":{"codehealthFindingId/v1":"0363e7ede1691718e0cb1261a51622f77118524c1c78e3692f43097bb12f11d2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060openPipe\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/daemon/src/terminal/TerminalSessionBroker.ts"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffca1f352e330f2474600ddd65dfbb72e3ebd76b423465635e8164a64bfa887a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060createReservedControlSocket\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/tui/src/socket-server.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"621c2d6c62672cd8db4ceaf833a6b9f166b1ac9ca5362bf26926f1ed1a38e22d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\u0060 in \u0060createReservedControlSocket\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/tui/src/socket-server.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba52dcfba8bbd9c92cd5e1d0a3cd80cc4202530734ebf61bc3833553f8ca373f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.lstatSync\u0060 in \u0060createReservedControlSocket\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/tui/src/socket-server.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c8bb36fa00998090f969f641f455b014cbea802dfcdcaca4c75f0a0c0cb3930"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.unlinkSync\u0060 in \u0060createReservedControlSocket\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/tui/src/socket-server.ts"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d40f206bfe44c43b95ebab8582002939332d121e4ee7ec2b31d6222b827645"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060acquireGateLane\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":"scripts/gate-lane-lock.mjs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ad335fde31c510aaeb24a83be1a626ab001f06ceda3fe0155bc2ea8a389ab7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060acquireGateLane\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":"scripts/gate-lane-lock.mjs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"0341a018fe1bf5df6591544edaf7531e6d60f0c128ac5d85d6c7ff51f9b91d4b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060acquireGateLane\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":"scripts/gate-lane-lock.mjs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d3b3b94f151e874dbbaeac3e14a46fe55cdb41cf6c25cfbc5ebf932520e4dd5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060acquireGateLane\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":"scripts/gate-lane-lock.mjs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ae772924adab58a86c9565e94c0b1d0f6908ff6cb2944c5cb1af37b115863e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060unlinkSync\u0060 in \u0060callback to Promise\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":"scripts/gate-lane-lock.mjs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"8569b30801da981e61031c77993ae907b7fe2f8f7a485050049fbd6cc4132822"}},{"ruleId":"R10","level":"warning","message":{"text":"Forked directory tree (54 identical files, ~9686 lines \u00D7 2 trees): packages/daemon/specs/agents/shared/skills/ and skills/_canonical/ are near-verbatim copies of each other: 54 files are byte-identical under the same relative paths (~9686 lines; the trees hold 54 and 54 files). That is one structural fact, not 54 local ones: every edit made to one tree and not the other drifts silently, which is the failure whole-tree forks guarantee. Pick one tree as the single source and produce the other from it (generated, copied at build or release time, or re-exported) \u2014 or, if the copy is a stale snapshot nothing produces any more, delete it. Check first whether the copy is a deliberately published deliverable (a template consumers copy verbatim, a released sample frozen at a version); where it is, keep it produced from the source tree rather than edited in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/_canonical/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"992bad9ab524e2d0394b8693b3daa055e0e747ba052f47f213bb16c4eced0f6e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 4 sibling directories (153 clone groups): 153 duplicated blocks under packages/ have copies in at least two of the sibling directories cli, daemon, tui, ui \u2014 96 of them are reported below, and 57 are 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 153 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 153 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 153 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/lib/scope/scope-audit.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88618a84540f3fe5c309662f185e2813c92debb5a3d68e5461b19bab63cb9b54"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 4 sibling directories (34 clone groups): 34 duplicated blocks under packages/daemon/src/ have copies in at least two of the sibling directories adapters, domain, routes, terminal \u2014 26 of them are reported below, and 8 are 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 34 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 34 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 34 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/daemon/src/domain/hosts/read-through.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bcca36a2854604f1ee111f1448cae9716aca6c67de0350db40565897c62d8d0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 13 sibling directories (14 clone groups): 14 duplicated blocks under packages/ui/src/components/ have copies in at least two of the sibling directories agent-images, dashboard, drawer-viewers, files, for-you, lab (\u002B7 more sibling(s) not listed) \u2014 6 of them are reported below, and 8 are 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 14 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 14 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 14 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/ui/src/components/for-you/FeedCard.tsx"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"4adfbf3493abf176ca854a64610b2547b17f906de394a7ffb8e309e7e8774853"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 3 sibling directories (13 clone groups): 13 duplicated blocks under packages/ui/src/ have copies in at least two of the sibling directories components, hooks, lib \u2014 7 of them are reported below, and 6 are 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 13 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 13 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 13 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/ui/src/components/project/ScopePages.tsx"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"04525a08179fd9539dca632a0ba4ff1d1c41a42823628b72b62d18f1df478a49"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 14 sibling directories (11 clone groups): 11 duplicated blocks under packages/daemon/src/domain/ have copies in at least two of the sibling directories agent-images, context-packs, feed, files, gateway, hosts (\u002B8 more sibling(s) not listed) \u2014 6 of them are reported below, and 5 are 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":"packages/daemon/src/domain/agent-images/manifest-parser.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0334bc6693663052543f75e50bbc97fac909fbfea36e3bf002a397fe3be1c62"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 3 sibling directories (9 clone groups): 9 of the duplicated blocks reported below have copies in at least two of the sibling directories packages, scripts, skills under the repository root. That concentration is one structural fact, not 9 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 9 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/daemon/scripts/gen-control-plane-json.mjs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b654e38da6bdfa434ae0855a47c1b79eeb1b0ae5ce5ac16f3220a7079fe5b55"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 9 sibling directories (6 clone groups): 6 duplicated blocks under packages/tui/src/ have copies in at least two of the sibling directories attention, cost, crash-cart, execution, health, pulse (\u002B3 more sibling(s) not listed) \u2014 5 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 6 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 6 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 6 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/tui/src/cost/cost-model.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9e37b2d4d66f6f965a520e6bdc29b098d9950c5cf5e0bd8c2bdae7168f6905"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 3 sibling directories (5 clone groups): 5 duplicated blocks under packages/daemon/ have copies in at least two of the sibling directories assets, scripts, src \u2014 3 of them are reported below, and 2 are 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 5 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 5 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 5 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/daemon/assets/plugins/openrig-core/skills/loading-addressable-markdown/scripts/resolve-markdown.mjs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"8afde3b1604d7bb8df0d06d346a372e6b0b77da753415ecbee2abd4d0848e308"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (365 identical lines \u00D7 2 files): packages/cli/src/lib/scope/scope-audit.ts:1 \u00B7 packages/daemon/src/domain/scope/scope-audit.ts:1 \u2014 these 2 files are line-for-line copies of one another \u2014 365 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/lib/scope/scope-audit.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"917161643273b673f12317d074905897ac8d7c8459faf58fbee5e7c477dfe671"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (187 lines \u00D7 2 locations): packages/cli/src/host-registry.ts:66 \u00B7 packages/daemon/src/domain/hosts/hosts-registry-reader.ts:21 \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/host-registry.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"f893f3074cbb344bc6e10740d98c3a78ea12e0b2883f2083a968da07d382a1ad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (142 matched lines \u00D7 2 locations): packages/daemon/src/domain/review/types.ts:62 \u00B7 packages/ui/src/hooks/useReview.ts:18 \u2014 the two spans are one implementation copied and then locally edited \u2014 649 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/daemon/src/domain/review/types.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dfd5d3723c31ab24e50c5a3638b3815e4908092cdade2ecef2cdc085f4b2bed"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (115 matched lines \u00D7 2 locations): packages/daemon/src/domain/agent-images/manifest-parser.ts:17 \u00B7 packages/daemon/src/domain/context-packs/manifest-parser.ts:33 \u2014 the two spans are one implementation copied and then locally edited \u2014 620 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/daemon/src/domain/agent-images/manifest-parser.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f6a5e13ad9a2e0cb70466d597889996ab1def1196209364d9bede193086728"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (113 lines \u00D7 2 locations): packages/cli/src/host-registry.ts:335 \u00B7 packages/daemon/src/domain/hosts/hosts-registry-writer.ts:34 \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/host-registry.ts"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f69cfaef7a3cc020acd53cc4fc5dd6844e86782c349b2049823a6b7ce30ee26"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (102 matched lines \u00D7 2 locations): packages/cli/src/commands/ps.ts:1764 \u00B7 packages/cli/src/commands/whoami.ts:527 \u2014 the two spans are one implementation copied and then locally edited \u2014 902 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/commands/ps.ts"},"region":{"startLine":1764}}}],"partialFingerprints":{"codehealthFindingId/v1":"3268c2539137b3980f54c9dcca3c624def157f1b81ef61cf4e56cb21f2e4daf4"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (96 identical lines \u00D7 2 files): packages/cli/src/lib/permission-policy/policy-ref.ts:17 \u00B7 packages/daemon/src/domain/permission-policy/policy-ref.ts:17 \u2014 these 2 files are line-for-line copies of one another \u2014 96 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/lib/permission-policy/policy-ref.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b8e5cc33bd1a2b88d1a7c88165bd55e7b28bf769d5308a3212dd8384c5ed8f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (95 matched lines \u00D7 2 locations): packages/daemon/src/routes/plugins.ts:71 \u00B7 packages/daemon/src/routes/skills.ts:44 \u2014 the two spans are one implementation copied and then locally edited \u2014 873 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/daemon/src/routes/plugins.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b08007572e77d1deb9bec7e16679642258210d39e3f03a12470ada8b93255ed"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (92 lines \u00D7 2 locations): packages/cli/src/commands/queue.ts:1919 \u00B7 packages/cli/src/commands/queue.ts:2026 \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/commands/queue.ts"},"region":{"startLine":1919}}}],"partialFingerprints":{"codehealthFindingId/v1":"817d021b4d65b2b762d016c53637df2273d235b282e49c32f3329e19a4bfb955"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (88 lines \u00D7 2 locations): packages/cli/src/lib/scope/types.ts:9 \u00B7 packages/daemon/src/domain/scope/types.ts:9 \u2014 the 2 copies are spread across 2 files, and each CITED SPAN is a SPECIALISATION DECLARATION \u2014 a type whose \u0060extends\u0060 clause names a base and whose body hands that base its own values through \u0060super(\u2026)\u0060. The shared module this dimension usually asks you to extract already exists: it is that base, every one of these sites already reaches it, and the \u0060super(\u2026)\u0060 call this row matched on is where each site passes its differences in. So do not read this as an extract-a-helper row \u2014 there is no missing helper, and what is left at each site is the declaration of one distinct specialisation, which cannot be deleted without deleting the thing it declares. Read what actually differs between the spans, because two different answers follow. Where the sites differ only in the values they hand the base \u2014 a type argument, a service, an alias, a cache \u2014 the repetition is a TEMPLATE, and the only moves that collapse it are to generate these declarations from the set they enumerate or to replace the repeated construction with one factory each site calls with its own values; where that set is the point, each site pinning one distinct thing, the repetition IS the enumeration and there is nothing to remove. Where instead a span carries logic OUTSIDE the delegation that is the same at every site, that logic is the part to move, and its home is the base type rather than a new module. Reported because the copies still drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/lib/scope/types.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9fee7eb9d632873b381471490b5072f6cd28bfb6438613acbda754c566f3d5"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (81 identical lines \u00D7 2 files): packages/cli/src/lib/scope/dot-id.ts:18 \u00B7 packages/daemon/src/domain/scope/dot-id.ts:18 \u2014 these 2 files are line-for-line copies of one another \u2014 81 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/lib/scope/dot-id.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"68135dcfe4e85d79ddda09d0776feb1e02114359383ae8786cbba482e6d6402d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (80 matched lines \u00D7 2 locations): packages/daemon/assets/plugins/openrig-core/skills/loading-addressable-markdown/scripts/resolve-markdown.mjs:34 \u00B7 packages/daemon/src/domain/markdown-address.ts:64 \u2014 the two spans are one implementation copied and then locally edited \u2014 662 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/daemon/assets/plugins/openrig-core/skills/loading-addressable-markdown/scripts/resolve-markdown.mjs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"8087f06c78879202436bd355e8fda2454437f419356740adf8d4134a2c71c5ea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (73 lines \u00D7 2 locations): packages/daemon/src/domain/queue-repository.ts:2853 \u00B7 packages/daemon/src/domain/queue-repository.ts:3039 \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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":2853}}}],"partialFingerprints":{"codehealthFindingId/v1":"1709acc7d16e992cfbcfa798128f3a241365d1fd8d177fe6af242114cef56574"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (72 matched lines \u00D7 2 locations): packages/daemon/src/routes/chat.ts:13 \u00B7 packages/daemon/src/routes/stream.ts:38 \u2014 the two spans are one implementation copied and then locally edited \u2014 578 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/daemon/src/routes/chat.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"805170dab2edf695f0af5a65f0deec0f556545ad1ab47961ecda6818aec8965f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (70 matched lines \u00D7 2 locations): packages/daemon/src/domain/feed/attention-aggregator.ts:43 \u00B7 packages/daemon/src/domain/review/fleet-compose.ts:227 \u2014 the two spans are one implementation copied and then locally edited \u2014 615 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/daemon/src/domain/feed/attention-aggregator.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b045488ce6e01bdc4886f52e0e6209823eaa8b62be06247058189ef4a559365"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (69 matched lines \u00D7 2 locations): packages/daemon/src/routes/bundles.ts:1136 \u00B7 packages/daemon/src/routes/up.ts:199 \u2014 the two spans are one implementation copied and then locally edited \u2014 677 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/daemon/src/routes/bundles.ts"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdcef4bd0cef5e102cc0afb7d958df9c792c1056d722af35e5e048d56ab2bae3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (68 matched lines \u00D7 2 locations): packages/daemon/src/domain/mission-control/audit-browse.ts:42 \u00B7 packages/daemon/src/domain/mission-control/mission-control-action-log.ts:63 \u2014 the two spans are one implementation copied and then locally edited \u2014 407 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/daemon/src/domain/mission-control/audit-browse.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d86f2fa8b64cd8c4250e96fa05d81fb78e65d199d9b0e5ac803f50362518267"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (64 lines \u00D7 2 locations): packages/cli/src/commands/scope.ts:1367 \u00B7 packages/daemon/src/routes/scope-audit.ts:267 \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/commands/scope.ts"},"region":{"startLine":1367}}}],"partialFingerprints":{"codehealthFindingId/v1":"572f5213956fcc5b3af959a7db4e52bec6081415a09f70f0b656cc4de823331e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (63 matched lines \u00D7 2 locations): packages/ui/src/hooks/useDismissedCardIds.ts:17 \u00B7 packages/ui/src/hooks/useDismissedSeqs.ts:11 \u2014 the two spans are one implementation copied and then locally edited \u2014 447 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/ui/src/hooks/useDismissedCardIds.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c27822748140103a61a9e1a0283cf6b4e48f22d6422d2400670d3fc261f01f"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (62 identical lines \u00D7 2 files): packages/cli/src/lib/permission-policy/policy-spec.ts:9 \u00B7 packages/daemon/src/domain/permission-policy/policy-spec.ts:9 \u2014 these 2 files are line-for-line copies of one another \u2014 62 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/lib/permission-policy/policy-spec.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ece4662b942c5f5ac012ad01575c5cc01309bc561a52d18ea51698dd483b51"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (57 matched lines \u00D7 2 locations): packages/cli/src/openrig-compat.ts:40 \u00B7 packages/daemon/src/openrig-compat.ts:8 \u2014 the two spans are one implementation copied and then locally edited \u2014 357 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/openrig-compat.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"eda1633b3f0cc5f905e51f72ae22ea70830962f95cfc04ed20d16669c5632b2d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (53 matched lines \u00D7 2 locations): packages/daemon/src/domain/claim-service.ts:396 \u00B7 packages/daemon/src/domain/claim-service.ts:844 \u2014 the two spans are one implementation copied and then locally edited \u2014 420 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/daemon/src/domain/claim-service.ts"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c0a2d58169a9efaa78759e40710669536ff3cb1b34a9409f0e3d16bfd634973"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (52 matched lines \u00D7 2 locations): packages/daemon/src/domain/spec-review-service.ts:12 \u00B7 packages/ui/src/hooks/useSpecReview.ts:20 \u2014 the two spans are one implementation copied and then locally edited \u2014 287 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/daemon/src/domain/spec-review-service.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b25d2b68567e0deed43e4cde7acf66cec0092e520cf223184fc38b2f8704213d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (51 matched lines \u00D7 2 locations): packages/daemon/src/domain/files/file-write-service.ts:143 \u00B7 packages/daemon/src/domain/files/file-write-service.ts:234 \u2014 the two spans are one implementation copied and then locally edited \u2014 391 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/daemon/src/domain/files/file-write-service.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b1ba1a60be60639f9f034920091638f53bf8a26ab82ea13999ccd445e2c226e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (51 lines \u00D7 2 locations): packages/ui/src/components/DiscoveryOverlay.tsx:32 \u00B7 packages/ui/src/components/DiscoveryPanel.tsx: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":"packages/ui/src/components/DiscoveryOverlay.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"61a396f29ada52302e11ffe3c81a22f1c95328a016aead011e0428d572b47675"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (50 lines \u00D7 2 locations): packages/cli/src/lib/scope/logical-checkbox.ts:45 \u00B7 packages/daemon/src/domain/scope/logical-checkbox.ts:45 \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/lib/scope/logical-checkbox.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1338d129bb94376c54bbee0f575ce13825c399b69bb4d0fe465507f2b3c15e4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (50 matched lines \u00D7 2 locations): packages/daemon/src/adapters/pi-resume.ts:120 \u00B7 packages/daemon/src/adapters/pi-runtime-adapter.ts:358 \u2014 the two spans are one implementation copied and then locally edited \u2014 442 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/daemon/src/adapters/pi-resume.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c5c8809a7e4738307fd12e840f69017c98c945df8293e98738b36b8b20aaef"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (48 matched lines \u00D7 2 locations): packages/ui/src/components/AgentSpecReview.tsx:17 \u00B7 packages/ui/src/components/RigSpecReview.tsx:20 \u2014 the two spans are one implementation copied and then locally edited \u2014 270 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/ui/src/components/AgentSpecReview.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c1cb87940c79e4e83ec55e72975de1698c18b7d8763236283eb564391a8487"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (47 lines \u00D7 2 locations): packages/cli/src/config-store.ts:859 \u00B7 packages/daemon/src/domain/user-settings/settings-store.ts:510 \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/config-store.ts"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"565663fd36106c9b76ec3d21fba8aca437f53f076515426fe6eba2712cce7cc6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (47 matched lines \u00D7 2 locations): packages/daemon/src/domain/mission-control/notification-adapter-ntfy.ts:36 \u00B7 packages/daemon/src/domain/mission-control/notification-adapter-webhook.ts:44 \u2014 the two spans are one implementation copied and then locally edited \u2014 319 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/daemon/src/domain/mission-control/notification-adapter-ntfy.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"421bd5dd86fa2853ee8ad34bbbe4efc0cd4dcb4ea61438618e1aadfaaf16ed7c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (47 lines \u00D7 2 locations): packages/ui/src/hooks/usePluginFiles.ts:16 \u00B7 packages/ui/src/hooks/useSkillFiles.ts:14 \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/ui/src/hooks/usePluginFiles.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9b6f63c33d4e084e3fc53ec6398e85c0e011ab5744bb045d3aaff81013fe78"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (46 lines \u00D7 2 locations): packages/daemon/src/domain/plugin-discovery-service.ts:40 \u00B7 packages/ui/src/hooks/usePlugins.ts:14 \u2014 the 2 copies are spread across 2 files, 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/daemon/src/domain/plugin-discovery-service.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"712fa4f784f767ad570c076e3ea35ec5247cfe243aad286d3400170ae7764c2b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (45 matched lines \u00D7 2 locations): packages/cli/src/commands/capture.ts:308 \u00B7 packages/cli/src/commands/send.ts:837 \u2014 the two spans are one implementation copied and then locally edited \u2014 381 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/commands/capture.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a735b6d8b96f06c550e444a5cb9be06ba60c1e0365a5a2bbb82698ac4a00f0f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (45 matched lines \u00D7 2 locations): packages/cli/src/commands/send.ts:27 \u00B7 packages/daemon/src/lib/pane-envelope.ts:30 \u2014 the two spans are one implementation copied and then locally edited \u2014 394 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/commands/send.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ccae3c09b04b66733a6e36d6f59df8371ec8d5d062cbed87193120825f24d7e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (44 lines \u00D7 2 locations): packages/daemon/src/domain/bundle-context-packs-router.ts:95 \u00B7 packages/daemon/src/domain/bundle-workflow-specs-router.ts: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/daemon/src/domain/bundle-context-packs-router.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"308cc9d5ee924651f453ba6af3df4cca0ebc3a0ee515321a8a094f9854489812"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (44 matched lines \u00D7 2 locations): packages/daemon/src/domain/workflow-runtime.ts:1140 \u00B7 packages/daemon/src/domain/workflow-runtime.ts:1397 \u2014 the two spans are one implementation copied and then locally edited \u2014 349 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/daemon/src/domain/workflow-runtime.ts"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"942fb83f2c1d83d64f308a50ca2d142b4fc0e689a62f021618e72e418127d9f1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (43 matched lines \u00D7 2 locations): packages/cli/src/commands/workflow.ts:312 \u00B7 packages/cli/src/commands/workflow.ts:821 \u2014 the two spans are one implementation copied and then locally edited \u2014 250 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/cli/src/commands/workflow.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"735d5217d69ce8dc841106e5b4b0636045a1368c29771a8cd3c40c9dc93680bb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 2 locations): packages/cli/src/lib/scope/scaffold-placeholder.ts:26 \u00B7 packages/daemon/src/domain/scope/scaffold-placeholder.ts:26 \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/lib/scope/scaffold-placeholder.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f10c3b978e94d76db5fd2b0e87aebd0271e6d08b22cb0d5f05b92162f7b60ef"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 2 locations): packages/daemon/src/routes/queue.ts:1135 \u00B7 packages/daemon/src/routes/queue.ts:1231 \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/daemon/src/routes/queue.ts"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a4825b688edf2d8254bc8a7daa7676de92e813e73e8479ba0ae59bf54a431c7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (42 matched lines \u00D7 2 locations): packages/ui/src/components/AgentSpecValidateFlow.tsx:19 \u00B7 packages/ui/src/components/ImportFlow.tsx:82 \u2014 the two spans are one implementation copied and then locally edited \u2014 213 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/ui/src/components/AgentSpecValidateFlow.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8eb4e91534a81709d822786004b9daf5933051a85a46de39773255809dcb3e7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (41 matched lines \u00D7 2 locations): packages/cli/src/atomic-text-write.ts:14 \u00B7 packages/daemon/src/domain/user-settings/settings-store.ts:1382 \u2014 the two spans are one implementation copied and then locally edited \u2014 358 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/atomic-text-write.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe3e59461176455fb370b395c0b05aa03a45e511d8957ddd0f7d09e62e4a909"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (41 lines \u00D7 2 locations): packages/daemon/src/domain/queue-repository.ts:2792 \u00B7 packages/daemon/src/domain/queue-repository.ts:2980 \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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":2792}}}],"partialFingerprints":{"codehealthFindingId/v1":"b805b285668cca83ab33201547bd2940b7dbbcc8edfda06ee921bbac734572fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (39 matched lines \u00D7 2 locations): packages/cli/src/commands/scope.ts:281 \u00B7 packages/cli/src/commands/scope.ts:957 \u2014 the two spans are one implementation copied and then locally edited \u2014 233 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/cli/src/commands/scope.ts"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"68351bb34bcf73dae85406f8165bebfbf22d7a0ddb4b1202bf964632775002e8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 2 locations): packages/cli/src/config-store.ts:1647 \u00B7 packages/daemon/src/domain/user-settings/settings-store.ts:1261 \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/config-store.ts"},"region":{"startLine":1647}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea5fec11321182c9bb83f498e58a7530b40e3363ba38be081b8c9ce47f2f98c4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 2 locations): packages/daemon/src/domain/steering/steering-composer.ts:43 \u00B7 packages/ui/src/hooks/useSteering.ts:10 \u2014 the 2 copies are spread across 2 files, 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/daemon/src/domain/steering/steering-composer.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2c0513691dcc36f4a6f0132c9a5d32084a484c5aa9199464724f48381c94fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2 locations): packages/daemon/src/domain/bundle-agent-images-router.ts:157 \u00B7 packages/daemon/src/domain/bundle-workflow-specs-router.ts:141 \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/daemon/src/domain/bundle-agent-images-router.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cbabbd26f2b2dc7e431bed6cdc8ef5f465e2e2e6fadd1b03bcaed41d14c25a3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2 locations): packages/cli/src/lib/hosts/fanout-contract.ts:14 \u00B7 packages/daemon/src/domain/hosts/fanout-contract.ts:14 \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/cli/src/lib/hosts/fanout-contract.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"5172abdec583a47af4b667962c11c8a5bfefb5f3104462f882ec84f771399da5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 3 locations): packages/cli/src/session-name.ts:33 \u00B7 packages/daemon/src/domain/session-name.ts:214 \u00B7 packages/ui/src/lib/session-name.ts:33 \u2014 the 3 copies are spread across 3 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/session-name.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea607334c8aa6983bda0ba619c3147af90b0dbca0227c1fe7cc38cd14af8c55"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (37 matched lines \u00D7 2 locations): packages/daemon/src/adapters/stub-compaction.ts:38 \u00B7 packages/daemon/src/adapters/stub-restore.ts:54 \u2014 the two spans are one implementation copied and then locally edited \u2014 244 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/daemon/src/adapters/stub-compaction.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e737239b682d99065f04c4fe235160e4987e934fad541f336bc864003b5c497"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (36 matched lines \u00D7 2 locations): packages/daemon/src/domain/context-packs/manifest-parser.ts:203 \u00B7 packages/daemon/src/domain/context-packs/manifest-parser.ts:424 \u2014 the two spans are one implementation copied and then locally edited \u2014 372 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/daemon/src/domain/context-packs/manifest-parser.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea217efb53bd884a6a794ae349902a2058692fade5b975ab0386625fb404da4a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (35 matched lines \u00D7 2 locations): packages/daemon/src/domain/review/types.ts:266 \u00B7 packages/ui/src/hooks/useFleet.ts:26 \u2014 the two spans are one implementation copied and then locally edited \u2014 169 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/daemon/src/domain/review/types.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b4e934b0ee1c93d706262ba2614455e5fcae67303e3e20d4bef71b95f9d803"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2 locations): packages/ui/src/hooks/useAgentImageLibrary.ts:60 \u00B7 packages/ui/src/hooks/useContextPackLibrary.ts:38 \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/ui/src/hooks/useAgentImageLibrary.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"f93bb465ebfd89d8f860dd48389d93a4f903f4012f87b8274a5963edf48428e3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (34 matched lines \u00D7 2 locations): packages/cli/src/commands/agent-image.ts:24 \u00B7 packages/ui/src/hooks/useAgentImageLibrary.ts:7 \u2014 the two spans are one implementation copied and then locally edited \u2014 151 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/commands/agent-image.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd224e4f7d33f2e7494419925aeda01a5bb86736dc586b1f3000c979ffe859a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2 locations): packages/daemon/src/domain/slices/slice-detail-projector.ts:108 \u00B7 packages/ui/src/hooks/useSlices.ts:218 \u2014 the 2 copies are spread across 2 files, 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/daemon/src/domain/slices/slice-detail-projector.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb00ea6139eca2b6a88b4b8c13727762928b8f876069e6ab5379b013a74ee96"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2 locations): packages/cli/src/config-store.ts:1787 \u00B7 packages/daemon/src/domain/user-settings/settings-store.ts:1578 \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/config-store.ts"},"region":{"startLine":1787}}}],"partialFingerprints":{"codehealthFindingId/v1":"0849360fb76f0953c913a5301527a71207ba710e9d746bcf0e2e4a73835bbd98"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2 locations): packages/daemon/src/routes/files.ts:166 \u00B7 packages/daemon/src/routes/slices.ts:425 \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/daemon/src/routes/files.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"2674a0d2240c6fd3a9b74a3adcf13167a5c2b9efc33ecaf7214cf96cefd16879"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2 locations): packages/cli/src/commands/remove.ts:10 \u00B7 packages/cli/src/commands/shrink.ts:31 \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/commands/remove.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e4e7f3139db71b9c64c9b528a0e25d0bd98f77f127b1a0e77c9dd7e76cab4cd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (31 matched lines \u00D7 2 locations): packages/daemon/src/domain/codex-network-default.ts:165 \u00B7 packages/daemon/src/domain/provider/codex-usage-reader.ts:91 \u2014 the two spans are one implementation copied and then locally edited \u2014 294 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/daemon/src/domain/codex-network-default.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"37fa757403f130c1c153f02b2f1534090656c41394e474fe538bd7ea0cf9cf3c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (31 matched lines \u00D7 2 locations): packages/daemon/src/domain/queue-wake-ladder.ts:1948 \u00B7 packages/daemon/src/domain/watchdog-scheduler.ts:72 \u2014 the two spans are one implementation copied and then locally edited \u2014 160 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/daemon/src/domain/queue-wake-ladder.ts"},"region":{"startLine":1948}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed78694bc28b70b801afe6bc1c2b80bc4e7cd478107291c4b14a1e0357c5991a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2 locations): packages/daemon/src/adapters/claude-code-adapter.ts:1022 \u00B7 packages/daemon/src/adapters/codex-runtime-adapter.ts:1553 \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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"7adb53ac4168115d700f75b7d7d1e18526f3411ca0baa5dfc175b82d63691ae9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (30 matched lines \u00D7 2 locations): packages/daemon/src/domain/workflow-types.ts:215 \u00B7 packages/ui/src/hooks/useWorkflow.ts:39 \u2014 the two spans are one implementation copied and then locally edited \u2014 138 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/daemon/src/domain/workflow-types.ts"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d27fb7b8fd665a3158f4b6555474f2cfeedb7a36929d2453621b9e801d37d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (30 matched lines \u00D7 2 locations): packages/daemon/src/routes/mission-control.ts:223 \u00B7 packages/daemon/src/routes/watchdog.ts:41 \u2014 the two spans are one implementation copied and then locally edited \u2014 209 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/daemon/src/routes/mission-control.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"a522614a7bfa5c5a522fd2fd276122bfef841e3835b06d79c9070d948e025990"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (29 matched lines \u00D7 2 locations): packages/daemon/assets/plugins/openrig-core/hooks/scripts/permission-stop-descriptor.cjs:180 \u00B7 packages/daemon/src/domain/permission-stop-observation.ts:39 \u2014 the two spans are one implementation copied and then locally edited \u2014 349 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/daemon/assets/plugins/openrig-core/hooks/scripts/permission-stop-descriptor.cjs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d26f54964a9d6bd8a62f6b9ea9ab3b3a852e4602b4b418af2671053b035321"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (29 matched lines \u00D7 2 locations): packages/daemon/src/domain/review/gather.ts:534 \u00B7 packages/daemon/src/domain/review/gather.ts:769 \u2014 the two spans are one implementation copied and then locally edited \u2014 223 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/daemon/src/domain/review/gather.ts"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c3730c31af0d96630b3f9e4ed9bc80da0e21cedd92eec5153a1f7e1cd27102"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2 locations): packages/daemon/src/routes/projects.ts:379 \u00B7 packages/daemon/src/routes/watchdog.ts:188 \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/daemon/src/routes/projects.ts"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e27b1b5a88ba176c956030c6a8d5c64e3dc353791688aff3f2385d13b33203c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): packages/cli/src/config-store.ts:1735 \u00B7 packages/daemon/src/domain/user-settings/settings-store.ts:1525 \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/config-store.ts"},"region":{"startLine":1735}}}],"partialFingerprints":{"codehealthFindingId/v1":"215c16bd7e3852dd8858776583f2cf22dd44f4861c5e38a6a7ca8be1d04777ec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): packages/cli/src/tmux-health.ts:82 \u00B7 packages/cli/src/tmux-health.ts:126 \u2014 all 2 copies are in the same file, 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/cli/src/tmux-health.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a0295df29fda3703ae29230a21a2accc38fbea2d82a4a4173857752be79126a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (28 matched lines \u00D7 2 locations): packages/daemon/src/domain/hosts/read-through.ts:125 \u00B7 packages/daemon/src/routes/mission-control.ts:370 \u2014 the two spans are one implementation copied and then locally edited \u2014 205 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/daemon/src/domain/hosts/read-through.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c5d76fa47911153580b684f71e12dd146d1114bae6e9de111f33a39ca0b7a6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): packages/daemon/src/domain/up-command-router.ts:95 \u00B7 packages/daemon/src/domain/up-command-router.ts:158 \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/daemon/src/domain/up-command-router.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3761c08ba0e781f5680ff049722ec409ac7150da28f38ee160e064d764dea06"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): packages/daemon/src/domain/rig-repository.ts:556 \u00B7 packages/daemon/src/domain/rig-repository.ts:615 \u2014 all 2 copies are in the same file, 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/daemon/src/domain/rig-repository.ts"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ae677f1abd27425749db93b9cbcc1f0d7962a1dd427937e2b6e3f25d384eaf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (26 matched lines \u00D7 2 locations): packages/cli/src/commands/host.ts:773 \u00B7 packages/daemon/src/routes/hosts.ts:713 \u2014 the two spans are one implementation copied and then locally edited \u2014 153 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/commands/host.ts"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c863cacf545cbefbe4928a219f815d23a725ce9100a6a8b1f7532f82d04c5c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): packages/cli/src/commands/project.ts:27 \u00B7 packages/cli/src/commands/view.ts:16 \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/commands/project.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"febb9e7516f6ae3847a0155ae5e9db07f21d027b81148148b428282235762d7d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): packages/cli/src/lib/scope/scope-fs.ts:370 \u00B7 packages/daemon/src/domain/scope/node-file.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":"packages/cli/src/lib/scope/scope-fs.ts"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4b2432edada320291a82e117f0f792d3f5a3227bcb46a33ee3ea063b4cb3d9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): packages/daemon/assets/plugins/openrig-core/hooks/scripts/activity-relay.cjs:21 \u00B7 packages/daemon/assets/plugins/openrig-core/hooks/scripts/compaction-restore-bridge.cjs:19 \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/daemon/assets/plugins/openrig-core/hooks/scripts/activity-relay.cjs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3dd36f35c04a7be3671711703275955be3b72d980fbccbba2dcb9f35dbd2a64"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): packages/daemon/src/domain/mission-control/mission-control-read-layer.ts:32 \u00B7 packages/ui/src/components/mission-control/hooks/useMissionControlView.ts:4 \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/daemon/src/domain/mission-control/mission-control-read-layer.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e7066a3b64c6bb0884dca8d9078d8eaf0c2786f811b26592f6b05c8041b6541"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): packages/daemon/src/domain/mission-control/mission-control-write-contract.ts:528 \u00B7 packages/daemon/src/domain/mission-control/mission-control-write-contract.ts:797 \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/daemon/src/domain/mission-control/mission-control-write-contract.ts"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"598a891cda6b13ad2d5845930aef992f3b162f7c264ef8c7c42fdc6348e0bff6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 4 locations): packages/daemon/src/domain/bundle-types.ts:192 \u00B7 packages/daemon/src/domain/bundle-types.ts:221 \u00B7 packages/daemon/src/domain/bundle-types.ts:252 \u00B7 packages/daemon/src/domain/bundle-types.ts:284 \u2014 all 4 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/daemon/src/domain/bundle-types.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c03b1df8ada806ddef29d493efccff5757fb083eee042a808e511e512ad44b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): packages/daemon/src/domain/files/path-safety.ts:174 \u00B7 packages/daemon/src/domain/files/path-safety.ts: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/files/path-safety.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d0e191c117991630290cd29c4281907e7abac97fa5072a4cadbff14a3cee0c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (25 matched lines \u00D7 2 locations): packages/daemon/src/domain/restore-orchestrator.ts:1202 \u00B7 packages/daemon/src/domain/rigspec-instantiator.ts:263 \u2014 the two spans are one implementation copied and then locally edited \u2014 179 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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":1202}}}],"partialFingerprints":{"codehealthFindingId/v1":"14fbe3dbf545d9148aa5d59e054d776a8fb760ed65a9bfb4c120c0956a3ba841"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 3 locations): packages/daemon/src/routes/files.ts:93 \u00B7 packages/daemon/src/routes/plugins.ts:156 \u00B7 packages/daemon/src/routes/skills.ts:95 \u2014 the 3 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. 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/daemon/src/routes/files.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"938cf5ed8183ba08aec56c5915367f06513be86da8d0f1e2261f28cd76ec319b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 3 locations): packages/ui/src/hooks/useCompletedMissions.ts:11 \u00B7 packages/ui/src/hooks/useDismissedCardIds.ts:17 \u00B7 packages/ui/src/hooks/useDismissedSeqs.ts:11 \u2014 the 3 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. 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/ui/src/hooks/useCompletedMissions.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"0efb78b4fb5ee7192f1f8796143ce4d4f3595fda3857dce687542f803313186d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): packages/cli/src/provider-auth.ts:29 \u00B7 packages/daemon/src/domain/kernel-boot.ts:331 \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/provider-auth.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"7119bc9ba60da678cbf5c516c60b9ea130631dc6e1e7cc4a2c7d2161a479acd7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): packages/daemon/src/adapters/claude-code-adapter.ts:199 \u00B7 packages/daemon/src/adapters/codex-runtime-adapter.ts:828 \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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"1957f777cfcf5db6ab480f8c0a2521c3f4bac35b69851e2cba51991ccb8ce0c7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): packages/daemon/src/adapters/claude-code-adapter.ts:264 \u00B7 packages/daemon/src/adapters/codex-runtime-adapter.ts:858 \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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"71032f2aa144863d2fa96b53caef3b57e19460e4da310180522c0e9623d07f46"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): packages/daemon/src/adapters/codex-runtime-adapter.ts:3079 \u00B7 packages/daemon/src/domain/resume-metadata-refresher.ts:519 \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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":3079}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bda99075931de81f822570cfdbfe64d9b9ab8abe1fb742cd5273fa84d285315"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): packages/daemon/src/domain/agent-images/agent-image-library-service.ts:228 \u00B7 packages/daemon/src/domain/context-packs/context-pack-library-service.ts:454 \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/daemon/src/domain/agent-images/agent-image-library-service.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"61352102300bfc0deef7913e9ee59749c56961cc7528ea571e043da4ec56ddf4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (24 matched lines \u00D7 2 locations): packages/daemon/src/domain/package-install-service.ts:57 \u00B7 packages/daemon/src/routes/packages.ts:209 \u2014 the two spans are one implementation copied and then locally edited \u2014 193 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/daemon/src/domain/package-install-service.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf5b8b3f33d8286fed1eb6ab9ef92455eaa683f3fba7b6aaa134e1b57ca1b95"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): packages/cli/src/commands/host.ts:626 \u00B7 packages/cli/src/commands/host.ts:671 \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/commands/host.ts"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3251337f202ba5c0bb287065202646ee87e251272e42aac26d07cc1af327c4a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): packages/cli/src/commands/scope.ts:480 \u00B7 packages/cli/src/commands/scope.ts:828 \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/commands/scope.ts"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f30ab2082200b86fa12c8ee4c01a0309014e08e41133026f9d45bb4a27d6db"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): packages/cli/src/commands/scope.ts:1810 \u00B7 packages/cli/src/commands/scope.ts:1844 \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/commands/scope.ts"},"region":{"startLine":1810}}}],"partialFingerprints":{"codehealthFindingId/v1":"786f85fdac856d8c1a943791c336c2207e8b36ff21bcb016f2dd791242a3b284"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): packages/cli/src/config-store.ts:1145 \u00B7 packages/daemon/src/domain/user-settings/settings-store.ts:966 \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/config-store.ts"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7ac677f3cd57fda8935fe9dcd652f3490329eace3f5b342a5f5b87bc2fe10e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (23 matched lines \u00D7 2 locations): packages/daemon/src/domain/gateway/slack/state-store.ts:318 \u00B7 packages/daemon/src/domain/gateway/slack/state-store.ts:416 \u2014 the two spans are one implementation copied and then locally edited \u2014 275 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/daemon/src/domain/gateway/slack/state-store.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0bb847687ca3fc95b7ad103ebfc61fc2bc64ee3668670608c8ea2c6e1494e1c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): packages/daemon/src/routes/rigs.ts:858 \u00B7 packages/daemon/src/routes/sessions.ts:566 \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/daemon/src/routes/rigs.ts"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"993cde46d0e3a7d8adf760aa5bbecf9d6f8035a28e2449e5b89693d7fd40c068"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (23 matched lines \u00D7 2 locations): packages/ui/src/components/RigSpecDisplay.tsx:131 \u00B7 packages/ui/src/components/RigSpecDisplay.tsx:158 \u2014 the two spans are one implementation copied and then locally edited \u2014 144 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/ui/src/components/RigSpecDisplay.tsx"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea276b4769744fedd26baac1aa61986ac7acfb29b83996741a3c40949a0a2e62"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): packages/ui/src/components/project/ScopePages.tsx:547 \u00B7 packages/ui/src/components/project/WorkspacePortfolioPanel.tsx:186 \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/ui/src/components/project/ScopePages.tsx"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2293d2d99da47609b9f737cf71fa87bed3a13907a334dbc2a03a3f46fc587b8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (23 matched lines \u00D7 2 locations): packages/ui/src/hooks/useNodePreview.ts:34 \u00B7 packages/ui/src/hooks/useNodePreview.ts:96 \u2014 the two spans are one implementation copied and then locally edited \u2014 265 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/ui/src/hooks/useNodePreview.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf1148bf3fc42c7e38f5f7ed08d68a76674a529c0428905f3fc44ffa50cf517"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): packages/cli/src/commands/ps.ts:272 \u00B7 packages/cli/src/commands/whoami.ts:18 \u2014 the 2 copies are spread across 2 files, 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/commands/ps.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d653666ebab546b8f11e23fc88773c632ee1e872f0e7b94dfe28cc1eb80d77"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): packages/cli/src/commands/scope.ts:2360 \u00B7 packages/daemon/src/routes/scope-audit.ts:142 \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/commands/scope.ts"},"region":{"startLine":2360}}}],"partialFingerprints":{"codehealthFindingId/v1":"f269f880c6b7f22067c0234acebd8c581af66c5482f39363f86a6acc95f7478f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): packages/cli/src/config-store.ts:1082 \u00B7 packages/daemon/src/domain/user-settings/settings-store.ts:908 \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/config-store.ts"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcae9d32508c75160499a5efb56148a1db69f956fe13c75842833f0202fd1851"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): packages/cli/src/restore-packet/claude-transcript-parser.ts:165 \u00B7 packages/cli/src/restore-packet/codex-jsonl-parser.ts: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/restore-packet/claude-transcript-parser.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba679d2f5d93ffa5d9db58a9d4869f1001a7c601b4f570629a575f4b827dd0b6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 3 locations): packages/daemon/src/domain/rig-repository.ts:710 \u00B7 packages/daemon/src/domain/rig-repository.ts:739 \u00B7 packages/daemon/src/domain/rig-repository.ts:767 \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/daemon/src/domain/rig-repository.ts"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7927064af15080a3d4c87a8cfc86fe7aa2f11582689eb44dd419ad9b42aef9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): packages/daemon/src/domain/rigspec-instantiator.ts:3155 \u00B7 packages/daemon/src/domain/rigspec-instantiator.ts:3207 \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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":3155}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6632444c264c0e680ca47c879299d9ae28814fe25da217b5dff210e6d7aa178"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): packages/daemon/src/domain/watchdog-policy-engine.ts:496 \u00B7 packages/daemon/src/domain/watchdog-policy-engine.ts:520 \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/daemon/src/domain/watchdog-policy-engine.ts"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"c345d137ec7447853f2a10a911d3555cb91d8f82d59fa105ef414e86b52ab8d1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 3 locations): packages/daemon/src/routes/transcripts.ts:167 \u00B7 packages/daemon/src/routes/transcripts.ts:229 \u00B7 packages/daemon/src/routes/transcripts.ts:281 \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/daemon/src/routes/transcripts.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"517501c7e3ced0785b05856f02bb8618b56fad6a6a2a97f635c893210e761e11"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (22 matched lines \u00D7 2 locations): packages/ui/src/components/topology/TopologyTableView.tsx:187 \u00B7 packages/ui/src/components/topology/TopologyTerminalView.tsx:57 \u2014 the two spans are one implementation copied and then locally edited \u2014 129 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/ui/src/components/topology/TopologyTableView.tsx"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c2c7d251344c3941ba81c552d5d4d80dcee1b0539961d72fa2e90ae0a6cb1a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (21 matched lines \u00D7 2 locations): packages/cli/src/commands/attach.ts:91 \u00B7 packages/cli/src/commands/bind.ts:25 \u2014 the two spans are one implementation copied and then locally edited \u2014 148 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/commands/attach.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"9683b0dac84d56eecbdd001c48f38bf273d368fc03811ce9237192cf7f68475a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): packages/cli/src/commands/ps.ts:1688 \u00B7 packages/cli/src/commands/whoami.ts:471 \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/commands/ps.ts"},"region":{"startLine":1688}}}],"partialFingerprints":{"codehealthFindingId/v1":"0541349be351361d9d865432dd90fdafb5986cf8284a4e5a0df11e039782ef7c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): packages/cli/src/commands/scope.ts:1314 \u00B7 packages/daemon/src/routes/scope-audit.ts:220 \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/commands/scope.ts"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"eedb14a52982f0e3ffd9a7de0910f66ec4b7f9b45fcc188a648874ae400f5a8d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): packages/daemon/src/adapters/claude-code-adapter.ts:305 \u00B7 packages/daemon/src/adapters/pi-runtime-adapter.ts:266 \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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"02fb10252be07663f66ae4e67cda1dc87dd8e156544db05e3943aac4fe7c2451"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): packages/daemon/src/adapters/codex-resume.ts:210 \u00B7 packages/daemon/src/adapters/codex-resume.ts:264 \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/daemon/src/adapters/codex-resume.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"147539d10971cfe5aae7af7885673cece0994b25e16b17cd22fe0f907a0b0618"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 3 locations): packages/daemon/src/domain/workspace/workspace-doctor.ts:386 \u00B7 packages/daemon/src/domain/workspace/workspace-doctor.ts:463 \u00B7 packages/daemon/src/domain/workspace/workspace-doctor.ts:550 \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/daemon/src/domain/workspace/workspace-doctor.ts"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee28820dfdb114bf3d35deddbfcb34a6be31910d1d0ff98038b2bcd6eb2431e9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (21 matched lines \u00D7 2 locations): packages/daemon/src/routes/chat.ts:39 \u00B7 packages/daemon/src/routes/chat.ts:169 \u2014 the two spans are one implementation copied and then locally edited \u2014 191 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/daemon/src/routes/chat.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc53ba104e9f2a2a557044020e4a69876e39169d9c012cca1d44501f39f0ea69"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (21 matched lines \u00D7 2 locations): packages/daemon/src/routes/rigspec.ts:171 \u00B7 packages/daemon/src/routes/rigspec.ts:258 \u2014 the two spans are one implementation copied and then locally edited \u2014 209 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/daemon/src/routes/rigspec.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"3923376f691685cc8db4b014b33f6fd4284f9957cd44e373f58d67eade41cf94"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 3 locations): packages/ui/src/components/markdown/storytelling-primitives.ts:71 \u00B7 packages/ui/src/components/markdown/storytelling-primitives.ts:108 \u00B7 packages/ui/src/components/markdown/storytelling-primitives.ts:146 \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/ui/src/components/markdown/storytelling-primitives.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"839ba61a3f1eae7e2b76a2e8ecab91e28a30eb43a25c4ff1f95a5311e25ffdf8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3 locations): packages/cli/src/commands/release.ts:26 \u00B7 packages/cli/src/commands/remove.ts:23 \u00B7 packages/cli/src/commands/shrink.ts:44 \u2014 the 3 copies are spread across 3 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/commands/release.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"c37682dc065d60c7e4b19f8e3dac1a3c9c9417e91d2db2c9f0f76ab749134eb3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): packages/daemon/src/adapters/claude-code-adapter.ts:1108 \u00B7 packages/daemon/src/adapters/codex-runtime-adapter.ts:1704 \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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c4d5105957eca8a601ce1fd66b7f8621c62f747810bd560a0b3f9a1e01ae756"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): packages/daemon/src/domain/bundle-agent-images-router.ts:112 \u00B7 packages/daemon/src/domain/bundle-skills-router.ts:75 \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/daemon/src/domain/bundle-agent-images-router.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7fd10331a0a51f021c0b5f0ea089ebee20d2c93c73685f955345c74935d3306"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): packages/daemon/src/domain/inbox-handler.ts:50 \u00B7 packages/daemon/src/domain/outbox-handler.ts:123 \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/daemon/src/domain/inbox-handler.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f64b49b4bf4f5c41498e344ba3edab8ee29538741887b7982f8dfa59d56dd37"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): packages/daemon/src/domain/queue-stuck-sweep.ts:219 \u00B7 packages/daemon/src/domain/queue-wake-ladder.ts:142 \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/daemon/src/domain/queue-stuck-sweep.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"666c53a69f93361469d2c5d3a314a762e8fd87f52df67d1ed05f0d86ad7c3868"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): packages/daemon/src/domain/queue-transition-log.ts:101 \u00B7 packages/daemon/src/domain/queue-transition-log.ts:166 \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/daemon/src/domain/queue-transition-log.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3d44eeb47af54da2b5589e7a408b802c77ce075c5210a6e4ee7533de8216eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): packages/daemon/src/domain/rigspec-schema.ts:869 \u00B7 packages/daemon/src/domain/rigspec-schema.ts:901 \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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c953cb52765656a2e25a3a1dd6b01581283570b9a04cbea5f7c0bdf0d7c54b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (20 matched lines \u00D7 2 locations): packages/daemon/src/domain/spec-library-workflow-scanner.ts:173 \u00B7 packages/daemon/src/domain/spec-library-workflow-scanner.ts:207 \u2014 the two spans are one implementation copied and then locally edited \u2014 122 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/daemon/src/domain/spec-library-workflow-scanner.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f95f28ec863a60136c37559f3b6538b7f38a10b4b3702785814581be3d7be9d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): packages/daemon/src/domain/workflow-spec-cache.ts:772 \u00B7 packages/daemon/src/domain/workflow-spec-cache.ts:839 \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/daemon/src/domain/workflow-spec-cache.ts"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcff4c35a43517541e1622bf60346ba19d25434f4d00813a0108ed80f2b3304e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): packages/daemon/src/routes/packages.ts:109 \u00B7 packages/daemon/src/routes/packages.ts: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/routes/packages.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ba95a4420983704d29d60b7e664547a3960b2bc722d8959505f626ae844a37"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): packages/daemon/src/routes/queue.ts:1190 \u00B7 packages/daemon/src/routes/queue.ts:1284 \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/daemon/src/routes/queue.ts"},"region":{"startLine":1190}}}],"partialFingerprints":{"codehealthFindingId/v1":"9155a66cfa34acc901217be9e574e290ecac57da885e2b2e3ad8c0571a559eca"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): packages/daemon/src/routes/queue.ts:1728 \u00B7 packages/daemon/src/routes/workflow.ts:380 \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/daemon/src/routes/queue.ts"},"region":{"startLine":1728}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f877452645da33278a94b55ea7d9e8b5e607e6187b1121cf1f26e4a5e4d4e4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): packages/daemon/src/routes/sessions.ts:509 \u00B7 packages/daemon/src/routes/sessions.ts:619 \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/daemon/src/routes/sessions.ts"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c47f49d34d638fa835c3a78c412293a8f61f54e09d71db258643cc76d327f9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): packages/ui/src/components/LibraryReview.tsx:174 \u00B7 packages/ui/src/components/RigSpecReview.tsx:66 \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/ui/src/components/LibraryReview.tsx"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77dc72724dc444bdc22f47dd81fd1693fb76d8562fdff2faf80d7a1e5c0ab26"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): packages/ui/src/hooks/useDiscovery.ts:85 \u00B7 packages/ui/src/hooks/useDiscovery.ts:110 \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/ui/src/hooks/useDiscovery.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"539d5d452220882599f810a0b485b8839104268277feabf851ed7a902bb862f1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): scripts/generate-context-packs.mjs:105 \u00B7 scripts/generate-context-packs.mjs:213 \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":"scripts/generate-context-packs.mjs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"278f9a5e6e5093a4cec897d99f985a88993486fc8adbe3bd9ecf040f29a338b4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (19 matched lines \u00D7 2 locations): packages/cli/src/commands/import.ts:205 \u00B7 packages/cli/src/commands/launch.ts:369 \u2014 the two spans are one implementation copied and then locally edited \u2014 56 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/commands/import.ts"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c840c0b7018af0e9729a3b3292f8d39ec2bd6a0d36b50fc800e886dac426bbf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): packages/cli/src/commands/rig-mode.ts:413 \u00B7 packages/cli/src/commands/rig-mode.ts:596 \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/commands/rig-mode.ts"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"c02fca0e426c975a5b08878558a9185bfcd45fcb8b5c790a984328fc24edbeae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (19 matched lines \u00D7 2 locations): packages/cli/src/commands/start.ts:218 \u00B7 packages/cli/src/daemon-auto-start.ts:8 \u2014 the two spans are one implementation copied and then locally edited \u2014 126 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/commands/start.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"acc221e6e52af2f8036e79768093366456a2535c69aeb8f2fef7718678a4bcf0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): packages/cli/src/config-store.ts:1698 \u00B7 packages/daemon/src/domain/user-settings/settings-store.ts:1449 \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/config-store.ts"},"region":{"startLine":1698}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f4fec7af1c2426775f4f09c72c61f60fadf1cf13f94dd33eba5d5f768f7912"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3 locations): packages/daemon/src/adapters/claude-resume.ts:219 \u00B7 packages/daemon/src/adapters/codex-resume.ts:219 \u00B7 packages/daemon/src/adapters/codex-resume.ts:275 \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/daemon/src/adapters/claude-resume.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"031e855de6944d159f7ad12845e086d775373f03730433c0b8b8cebea0877ab7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): packages/daemon/src/adapters/pi-runner.ts:2004 \u00B7 packages/daemon/src/adapters/stub-runner.ts:273 \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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":2004}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83e3a8234b1487ffcb29cfc82172b65ba388ec9822d95af8dbe8d711c760059"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): packages/daemon/src/adapters/pi-runtime-adapter.ts:258 \u00B7 packages/daemon/src/adapters/stub-runtime-adapter.ts:139 \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/daemon/src/adapters/pi-runtime-adapter.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ae7940455011925992949247ae84999823ce4782c1a96f02e213d768eb62e6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): packages/daemon/src/domain/plugin-discovery-service.ts:781 \u00B7 packages/ui/src/components/LiveNodeDetails.tsx:160 \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/daemon/src/domain/plugin-discovery-service.ts"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa544ae92a67148584faaaff11f51a04ce3855255ed49d587fe58af7ccf7fc0c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): packages/daemon/src/domain/policies/edge-artifact-required.ts:54 \u00B7 packages/daemon/src/domain/policies/periodic-reminder.ts:22 \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/daemon/src/domain/policies/edge-artifact-required.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a44bbb168540e8b3422d1b54a9c8e28e907a7f664c800665f37df32342c361"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): packages/daemon/src/domain/provider/claude-usage-windows.ts:196 \u00B7 packages/daemon/src/domain/provider/usage-windows.ts:157 \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/daemon/src/domain/provider/claude-usage-windows.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae72ceb1d7b3680d3d07435cdb8489cf84e56d77f1f6f89c96e742db269b70d5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): packages/ui/src/components/SpecsWorkspace.tsx:235 \u00B7 packages/ui/src/components/SpecsWorkspace.tsx:258 \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/ui/src/components/SpecsWorkspace.tsx"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fffd178a39d129e4ad21481fb0378172d75e71e1bd43b470d67768acc59f157"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): packages/ui/src/components/lab/VellumBackgroundLab.tsx:108 \u00B7 packages/ui/src/components/lab/VellumBackgroundLab.tsx:249 \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/ui/src/components/lab/VellumBackgroundLab.tsx"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"77725fe78e8c9247bb556d21632662d9a8d6b5925d114b0f36e17ffad49e4414"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): packages/ui/src/components/project/ScopePages.tsx:373 \u00B7 packages/ui/src/components/project/ScopePages.tsx:1094 \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/ui/src/components/project/ScopePages.tsx"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"240dd0fbdb3690607565007c216d62a5dac6403679086b00bff9d092396589fc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): packages/ui/src/components/project/ScopePages.tsx:653 \u00B7 packages/ui/src/components/project/ScopePages.tsx:673 \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/ui/src/components/project/ScopePages.tsx"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed98a53b7f73d3b838669321a7e77f3ac898948a767ebebcd03e494049a045d0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): packages/ui/src/hooks/useProgressTree.ts:32 \u00B7 packages/ui/src/hooks/useSteering.ts:52 \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/ui/src/hooks/useProgressTree.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"97291766fc3614e8a41e52cfab9ccbdac2614e13f5b0bdbf8be56a4ab4149b61"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (19 matched lines \u00D7 2 locations): packages/ui/src/hooks/useSlices.ts:326 \u00B7 packages/ui/src/hooks/useSlices.ts:455 \u2014 the two spans are one implementation copied and then locally edited \u2014 165 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/ui/src/hooks/useSlices.ts"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec15aef768af658f3850195df733522121bf5cfeb82b56c8edb9fb085a98789d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3 locations): packages/cli/src/commands/agent-image.ts:110 \u00B7 packages/cli/src/commands/plugin.ts:131 \u00B7 packages/cli/src/commands/specs.ts:217 \u2014 the 3 copies are spread across 3 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/commands/agent-image.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"256ab4715bc0f1fea984a6dbc4773f3d3191155f514559c977b7be737d65fdd8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): packages/cli/src/commands/scope.ts:1871 \u00B7 packages/cli/src/commands/scope.ts:1902 \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/commands/scope.ts"},"region":{"startLine":1871}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcbb1abe1c03895659c3bf4e29b2b16574d89ae399723d9930f309436bb9d199"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): packages/cli/src/commands/view.ts:16 \u00B7 packages/cli/src/commands/watchdog.ts:20 \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/commands/view.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd877188dfb3fcceca899e211195e629b1e06fee6ca0c47035e2292618d2cf33"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): packages/cli/src/config-store.ts:1288 \u00B7 packages/daemon/src/domain/user-settings/settings-store.ts:1109 \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/config-store.ts"},"region":{"startLine":1288}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f0ad5407464233cc4675d554325a768a12bf334dfaacc960c426fd786052b2b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): packages/cli/src/lib/frontmatter.ts:8 \u00B7 packages/daemon/src/domain/frontmatter.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/lib/frontmatter.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9cf4ee4dffe43de32b66afb8bc95f6b991681a5ff15ea75040a1066392ff411"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): packages/daemon/src/domain/bundle-assembler.ts:45 \u00B7 packages/daemon/src/domain/pod-bundle-assembler.ts:49 \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/daemon/src/domain/bundle-assembler.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f0d11270a76365d535444a5ed1dce7d4357f57a5dd77bbabf1a43747ef015a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): packages/daemon/src/domain/plugin-discovery-service.ts:218 \u00B7 packages/daemon/src/domain/plugin-discovery-service.ts:238 \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/daemon/src/domain/plugin-discovery-service.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ca4a668d52564c8e1f6bf2bfd2e08ca8d4455e3adb49fddeaf7a94225f84bc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): packages/daemon/src/domain/requirements-probe.ts:70 \u00B7 packages/daemon/src/domain/requirements-probe.ts:119 \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/daemon/src/domain/requirements-probe.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aad38881e165aadba34d597205ea7ab60028662b7b4481b29117940170420b9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): packages/daemon/src/domain/rigspec-schema.ts:558 \u00B7 packages/daemon/src/domain/rigspec-schema.ts:1477 \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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d73267ade904db7af836074a88ed37ddaaeb41d1c3b0fa702b879f93516799"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): packages/daemon/src/domain/skill-catalog.ts:972 \u00B7 packages/daemon/src/domain/skill-catalog.ts:1005 \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/daemon/src/domain/skill-catalog.ts"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"223048fa6f9791f3e9f4d95f292f216c5e76cb0164d930f5f875f28e1d8adc77"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (18 matched lines \u00D7 2 locations): packages/daemon/src/domain/startup-orchestrator.ts:1084 \u00B7 packages/daemon/src/domain/successor-session-launcher.ts:547 \u2014 the two spans are one implementation copied and then locally edited \u2014 122 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/daemon/src/domain/startup-orchestrator.ts"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"4902f649fa0f9338bb39b06230144c2d4cd65841c23dfeab0cd54bd04a222659"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): packages/daemon/src/domain/workflow-spec-cache.ts:796 \u00B7 packages/daemon/src/domain/workflow-spec-cache.ts:861 \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/daemon/src/domain/workflow-spec-cache.ts"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d970511ff5e6472e5f33d46bf01b2858ea8f836c3e8bacce8c4e8ada434dc0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): packages/ui/src/components/PackageList.tsx:116 \u00B7 packages/ui/src/components/PackageList.tsx: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/ui/src/components/PackageList.tsx"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7c49d09e769eb0854c903edd9c8b169c78d4fc7ff05198ee330ad71a56002d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): packages/ui/src/components/dashboard/vellum/fidelity-glyphs.tsx:21 \u00B7 packages/ui/src/components/dashboard/vellum/graphics.tsx:17 \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/ui/src/components/dashboard/vellum/fidelity-glyphs.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"44daf5b069ff56955cbd1e6d20ceab28c1d713b45c08574fecc9df31de629fd7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): packages/ui/src/components/project/ScopePages.tsx:763 \u00B7 packages/ui/src/components/project/ScopePages.tsx:990 \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/ui/src/components/project/ScopePages.tsx"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"655151dbb4b68d15998f33dd35e279cd7241ce2a799595919c7a4355bf7fd5d0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): packages/ui/src/lib/hybrid-layout.ts:217 \u00B7 packages/ui/src/lib/hybrid-layout.ts:237 \u2014 all 2 copies are in the same file, 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/ui/src/lib/hybrid-layout.ts"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d05c8724ad87662fbfa041be0744a12a8277a52e2e8dcf020586b712ea6636a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): packages/cli/src/commands/walk.ts:420 \u00B7 packages/cli/src/context-resolve.ts:33 \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/commands/walk.ts"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8dab5d9117e848c8bd869c66efb42c84726512c596b7d1517a3b6adfc08e908"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3 locations): packages/daemon/src/adapters/codex-runtime-adapter.ts:885 \u00B7 packages/daemon/src/adapters/pi-runtime-adapter.ts:260 \u00B7 packages/daemon/src/adapters/stub-runtime-adapter.ts:141 \u2014 the 3 copies are spread across 3 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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f500197bb9cc6ae6ca54232aa093885cd247f256759e4abf0d0eab4405d490"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): packages/daemon/src/domain/continuity-policy-materializer.ts:190 \u00B7 packages/daemon/src/domain/continuity-policy-materializer.ts:215 \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/daemon/src/domain/continuity-policy-materializer.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b64b3411a02fba7e75a0412c748a8957187772a04e5d7ad637b9ee6eb5d693"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): packages/daemon/src/domain/files/path-safety.ts:61 \u00B7 packages/daemon/src/domain/progress/progress-indexer.ts:93 \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/daemon/src/domain/files/path-safety.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c6929fff1a6accec54f09e11c77839052d4bea9c5dd4b848aba90db40195ac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): packages/daemon/src/domain/gateway/relay-inbound.ts:194 \u00B7 packages/daemon/src/domain/gateway/relay-inbound.ts:214 \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/daemon/src/domain/gateway/relay-inbound.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c44159e6eac775372d8dd7c48635cfa7321ce68602ac92559885faa71899d5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): packages/daemon/src/domain/restore-preconditions.ts:48 \u00B7 packages/daemon/src/domain/restore-preconditions.ts:66 \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/daemon/src/domain/restore-preconditions.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"27486cea718806dc0488be9e27a9108996368213ddde0b2fcb3fa55f88d6e0b4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): packages/daemon/src/domain/seat-attention-reconciler.ts:542 \u00B7 packages/daemon/src/domain/seat-attention-reconciler.ts:755 \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/daemon/src/domain/seat-attention-reconciler.ts"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"0879ce8d88726f7204de5cef7722da8d965b1e4e2ec6495f00da022257553443"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): packages/daemon/src/domain/watchdog-jobs-repository.ts:587 \u00B7 packages/daemon/src/domain/watchdog-jobs-repository.ts:608 \u2014 the two spans are one implementation copied and then locally edited \u2014 75 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/daemon/src/domain/watchdog-jobs-repository.ts"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"4db18fe4cc210d690b48684cfef535e95610035c21ce2dfecc51250266abeba1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): packages/daemon/src/domain/watchdog-policy-engine.ts:352 \u00B7 packages/daemon/src/domain/watchdog-policy-engine.ts:683 \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/daemon/src/domain/watchdog-policy-engine.ts"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"38313cd9b18a49c89c221c053f746695407785fccbd009f781dc68edbc97d852"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): packages/ui/src/components/DiscoveryPanel.tsx:212 \u00B7 packages/ui/src/components/SystemPanel.tsx:88 \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/ui/src/components/DiscoveryPanel.tsx"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f047fc20ed2379d5a4e471b31044fdf3f5d17ead57580c92b90704cda143ca"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3 locations): packages/ui/src/components/LibraryReview.tsx:409 \u00B7 packages/ui/src/components/LibraryReview.tsx:548 \u00B7 packages/ui/src/components/workflow/WorkflowInstancePage.tsx:165 \u2014 the 3 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/ui/src/components/LibraryReview.tsx"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2081bcb975ecf89b6d5bcd9abdc977d5f53f9f72e46db7bac24e2568acb2fd7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): packages/ui/src/components/PackageInstallFlow.tsx:169 \u00B7 packages/ui/src/components/PackageInstallFlow.tsx:201 \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/ui/src/components/PackageInstallFlow.tsx"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75a6f79895b7fbdc197c988c056ab1fd0a98664c4a36f9b2a9b705a973746b0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): packages/ui/src/components/project/ProjectTreeView.tsx:297 \u00B7 packages/ui/src/components/project/ScopePages.tsx:622 \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/ui/src/components/project/ProjectTreeView.tsx"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d744229f20160e46609f24dd7c96dac02bd804e1fbb864c15222a905f872b00"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): scripts/generate-context-packs.mjs:342 \u00B7 scripts/generate-context-packs.mjs:366 \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":"scripts/generate-context-packs.mjs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"150c056ba66e6ce5d8a369a80a182f4aca18acb75ee93f09fd66b101258326c1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): packages/cli/src/commands/restore-check.ts:410 \u00B7 packages/cli/src/commands/restore-check.ts:462 \u2014 the two spans are one implementation copied and then locally edited \u2014 177 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/cli/src/commands/restore-check.ts"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b0b6f8ceaa14c2f5c8f32a5d462df082774882dc6ba17751fc9a2b84453515"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): packages/cli/src/commands/scope.ts:1525 \u00B7 packages/daemon/src/routes/scope-audit.ts:98 \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/commands/scope.ts"},"region":{"startLine":1525}}}],"partialFingerprints":{"codehealthFindingId/v1":"f17e34761a52e75f383ae4c9fa75b3143c2f9406373d8d27c22a45a3d1262c49"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): packages/cli/src/mcp-server.ts:1419 \u00B7 packages/cli/src/mcp-server.ts:1439 \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/mcp-server.ts"},"region":{"startLine":1419}}}],"partialFingerprints":{"codehealthFindingId/v1":"736339d152dfb719bb4616b3d17b78b11d9a5b774f159db7efa0967063b2f8c9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): packages/cli/src/restore-packet/claude-transcript-parser.ts:36 \u00B7 packages/cli/src/restore-packet/codex-jsonl-parser.ts:51 \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/restore-packet/claude-transcript-parser.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7795ea5f0e7f2eb711653db21d846d2802c0b2e87a899f686c2646ba4072ba3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): packages/daemon/src/adapters/tmux.ts:2080 \u00B7 packages/daemon/src/adapters/tmux.ts:2355 \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/daemon/src/adapters/tmux.ts"},"region":{"startLine":2080}}}],"partialFingerprints":{"codehealthFindingId/v1":"21dafd702cadce617bd8f5e60a4c2f972b82ba674ae90f9d0682aad73aab862b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): packages/daemon/src/domain/hosts/remote-daemon-http.ts:118 \u00B7 packages/daemon/src/domain/hosts/remote-daemon-http.ts:219 \u2014 the two spans are one implementation copied and then locally edited \u2014 163 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/daemon/src/domain/hosts/remote-daemon-http.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"753e0322e3ab53e473ed3fbf90156a5749ad273e4891bf27eb9243bf3e3c5572"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): packages/daemon/src/domain/restore-orchestrator.ts:2901 \u00B7 packages/daemon/src/domain/restore-orchestrator.ts:2935 \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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":2901}}}],"partialFingerprints":{"codehealthFindingId/v1":"224b0303b2029e15cd2c5f9644a54a4f015fc9dc9a5ec344482b3af6758655f9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): packages/daemon/src/domain/rigspec-schema.ts:798 \u00B7 packages/daemon/src/domain/rigspec-schema.ts:826 \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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"f54e5ff4b4ec942cfcae9325f127972fa8afa6f5bf7973883a6b1e1f6184cc3f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): packages/daemon/src/domain/workflow-projector.ts:604 \u00B7 packages/daemon/src/domain/workflow-projector.ts:1343 \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/daemon/src/domain/workflow-projector.ts"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6751409e13adebb422d7ea63bdc76e14ae277e7afdb2031167f2692e38f27c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): packages/daemon/src/routes/mission-control.ts:293 \u00B7 packages/daemon/src/routes/workflow.ts:396 \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/daemon/src/routes/mission-control.ts"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe19b6537b37984232c73a8896c39205872ad1d76e97638180d6da1137218252"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): packages/ui/src/components/graphics/RuntimeMark.tsx:403 \u00B7 packages/ui/src/components/graphics/RuntimeMark.tsx:478 \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/ui/src/components/graphics/RuntimeMark.tsx"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"674c8fe33c91ebd60d44c70a4eefef21acb99cbd68c3cba63b83967114b1bbca"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): packages/ui/src/hooks/useMissionDiscovery.ts:42 \u00B7 packages/ui/src/hooks/useScopeMarkdown.ts:71 \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/ui/src/hooks/useMissionDiscovery.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb0ed30978f776ca001d497301ecfed668a987187f441879f751dfea89ef7ec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): packages/cli/src/commands/acp.ts:316 \u00B7 packages/cli/src/commands/exec.ts:558 \u2014 the two spans are one implementation copied and then locally edited \u2014 89 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/commands/acp.ts"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc3be03a50c6878fc35320ca95ff0df758d8411cf1153ea9f2516f368b71f00"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/cli/src/commands/add.ts:39 \u00B7 packages/cli/src/commands/expand.ts:22 \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/commands/add.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb8bdae7494c84ab430121632a47b853165eaff2bde9762b9eb74aef30631e9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/cli/src/commands/agent-image.ts:304 \u00B7 packages/cli/src/commands/agent-image.ts:322 \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/commands/agent-image.ts"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eeba10ac78d608917c1ab34bc86e45c2971a45b9933bbad91ac957df78ad899"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3 locations): packages/cli/src/commands/archive.ts:39 \u00B7 packages/cli/src/commands/expand.ts:62 \u00B7 packages/cli/src/commands/grow.ts:73 \u2014 the 3 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. 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/commands/archive.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b0bf339f134eeedeb333e5d62260f485f964e3fad52941e4296442a64cf70ee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/cli/src/commands/bundle.ts:221 \u00B7 packages/cli/src/commands/bundle.ts:286 \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/commands/bundle.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b3d7e9b715a8a747cc7564de2ec8f57b394b987e16b361068f0b792e0c488c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/cli/src/commands/capture.ts:397 \u00B7 packages/cli/src/commands/transcript.ts:150 \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/commands/capture.ts"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"53dc05f21441811cc2c6b301081e921c02c280f3bfde8766f3d39afba16aebfe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/cli/src/commands/chatroom.ts:85 \u00B7 packages/cli/src/commands/chatroom.ts:276 \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/commands/chatroom.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"28075c08d48e79544425bf53b12bc2d37ad2ad451bc5ba4a562d11b3339c65ee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): packages/cli/src/commands/context.ts:311 \u00B7 packages/cli/src/commands/skill.ts:113 \u2014 the two spans are one implementation copied and then locally edited \u2014 166 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/commands/context.ts"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"46bed2b23d1b341096e2609ae11a41bc99f910502ae75daac10befab4df68ca4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/cli/src/commands/ps.ts:1746 \u00B7 packages/cli/src/commands/whoami.ts:513 \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/commands/ps.ts"},"region":{"startLine":1746}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc0a08ee12b74d3a6d7e49c0d383d23d079aabda60631941e02befa82a15ba5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/cli/src/commands/scope.ts:535 \u00B7 packages/cli/src/commands/scope.ts:890 \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/commands/scope.ts"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"200b4d48877f45e168b30ef641633209492d4bf9b78ab3240ebd1feab959764a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/cli/src/commands/scope.ts:1345 \u00B7 packages/daemon/src/routes/scope-audit.ts:245 \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/commands/scope.ts"},"region":{"startLine":1345}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5964d91ef845ee7c3ae74a1b81868fe8fdf4a47b7770f979be6dcb30e54c4c9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/cli/src/commands/stream.ts:31 \u00B7 packages/cli/src/commands/watchdog.ts:25 \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/commands/stream.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef2c6a4d051a9acf0c80667aed5430895f2c2e07341537645c75bd3fa798fb2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/cli/src/front-door.ts:174 \u00B7 packages/daemon/src/domain/permission-drift.ts:296 \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/front-door.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23e1419f26ed80262cca5563e159a442d581fdcada08670c454be5bd3f5663d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/cli/src/lib/scope/scope-fs.ts:90 \u00B7 packages/daemon/src/routes/missions.ts:207 \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/lib/scope/scope-fs.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3c23d0f977ea71607e17a8ab783b5eda7d0ee1c4b3e0c89cd384623382a822"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/daemon/assets/plugins/openrig-core/hooks/scripts/activity-relay.cjs:471 \u00B7 packages/daemon/assets/plugins/openrig-core/hooks/scripts/compaction-restore-bridge.cjs:177 \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/daemon/assets/plugins/openrig-core/hooks/scripts/activity-relay.cjs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1439ee11feb51891d96128c004f29be47db7cea487814ea789428dced828c51"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/daemon/src/adapters/pi-runtime-adapter.ts:598 \u00B7 packages/daemon/src/adapters/stub-runtime-adapter.ts:302 \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/daemon/src/adapters/pi-runtime-adapter.ts"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb9cc985e690144052329750191390a9cae9028de9528eb46319ab6d7d4253f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/daemon/src/domain/rigspec-schema.ts:1039 \u00B7 packages/daemon/src/domain/rigspec-schema.ts:1059 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e3a9d6e48a7c627735fbc69e64192fec63485933e2ea729ad68cd3de5637a0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): packages/daemon/src/routes/config.ts:96 \u00B7 packages/daemon/src/routes/config.ts:118 \u2014 the two spans are one implementation copied and then locally edited \u2014 177 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/daemon/src/routes/config.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b225a5721611bef31d1eb1229a89d10e87e1c8312ebf4d3ec21039d058f40ac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/daemon/src/routes/rigs.ts:662 \u00B7 packages/daemon/src/routes/up.ts:156 \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/daemon/src/routes/rigs.ts"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dbcac33a46d5a095095ff7273bb772755c8242efbda498ff0c3545b5ea031d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/ui/src/components/RigNode.tsx:238 \u00B7 packages/ui/src/components/topology/HybridTopologyNodes.tsx:251 \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/ui/src/components/RigNode.tsx"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf78793ac1f15629c674ce381c39f36acd8e6c30695f1407257af60bd187976"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/ui/src/components/RigNode.tsx:400 \u00B7 packages/ui/src/components/topology/HybridTopologyNodes.tsx:290 \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/ui/src/components/RigNode.tsx"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"73aa210fba1c594d6ec33fded4005329136a6db55ee40f0774aaf714168822ba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): packages/ui/src/components/lab/ProjectGraphicsPreview.tsx:56 \u00B7 packages/ui/src/components/project/ProjectMetaPrimitives.tsx:210 \u2014 the two spans are one implementation copied and then locally edited \u2014 73 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/ui/src/components/lab/ProjectGraphicsPreview.tsx"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e6e53088f5dc321bca81dd3942e13bbef6e0dba705d9fd5b546ad17f1c6e09"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/ui/src/components/review/MissionReviewTab.tsx:294 \u00B7 packages/ui/src/components/review/SliceReviewTab.tsx:238 \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/ui/src/components/review/MissionReviewTab.tsx"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"45bdb677dda53c7fec01eb5aa47ef23d0c4662dbb8d9f93081dabeb4a315261b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3 locations): packages/ui/src/components/topology/ScopePages.tsx:214 \u00B7 packages/ui/src/components/topology/ScopePages.tsx:324 \u00B7 packages/ui/src/components/topology/ScopePages.tsx:416 \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/ui/src/components/topology/ScopePages.tsx"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe04fa30269566438dd91096837e8e5025315d6d19518109cee7d2736c53ae7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/cli/src/commands/agent.ts:31 \u00B7 packages/cli/src/commands/rig.ts:274 \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/commands/agent.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc0e764be2f8d6d477464a25a88efc60da09b568af503fdee8a0b1e4b51cf9ae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/cli/src/commands/capture.ts:280 \u00B7 packages/cli/src/commands/transcript.ts:95 \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/commands/capture.ts"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2510628899bffdfc2db5c954624f77975d6d766eaec6b8006a0ad9c0dc96dc7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/cli/src/commands/provider.ts:57 \u00B7 packages/cli/src/commands/usage.ts:109 \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/commands/provider.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"96a8264652d9de6eba8945721ba40f93cba3f6247571a32d1109aa042d0fc45f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/cli/src/commands/queue.ts:2456 \u00B7 packages/cli/src/commands/queue.ts:2484 \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/commands/queue.ts"},"region":{"startLine":2456}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2894535f7ec6629819ec4b30c7ecc26b4bcc350468083d52abfefe8b85cd1d9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/cli/src/commands/queue.ts:2615 \u00B7 packages/cli/src/commands/queue.ts:2712 \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/commands/queue.ts"},"region":{"startLine":2615}}}],"partialFingerprints":{"codehealthFindingId/v1":"822b8602052dbb6bd21fb1be834bbc423a64e954f694eb264c37f220e2f8878e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/cli/src/commands/seat.ts:850 \u00B7 packages/cli/src/commands/seat.ts:1805 \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/commands/seat.ts"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0cc04831bbf46c09c524c89641ed29792fe994ed0a6a59a0db76ab2f9727fb3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/cli/src/commands/send.ts:825 \u00B7 packages/cli/src/commands/send.ts:917 \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/commands/send.ts"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"5557deb81c213988547b3f2362d5201339e8500b3808597632fad000a9325f15"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/cli/src/commands/slack.ts:524 \u00B7 packages/cli/src/commands/slack.ts:550 \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/commands/slack.ts"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"1607302e22b7100b3f34cc5434aacbd4cbf44ff5bb8031324c156269ac0cee92"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/cli/src/commands/specs.ts:273 \u00B7 packages/cli/src/commands/specs.ts:302 \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/commands/specs.ts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d8ff54d7eeb266f75ce3353a825a585cd688c038e10295c3ada7b49ebcf7493"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/cli/src/config-store.ts:1005 \u00B7 packages/daemon/src/domain/user-settings/settings-store.ts:832 \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/config-store.ts"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"2476852c136dec167797b6b533ca1271baa8fdb7b5fddc979d2a0db8e72a14ad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/cli/src/host-bindings.ts:31 \u00B7 packages/daemon/src/domain/hosts/learned-host-bindings.ts:15 \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/host-bindings.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"00370a93301832615bdbcd1800dc722e195f35675ca06e2dc0ac81a4f0bc781a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 7 locations): packages/cli/src/mcp-server.ts:1241 \u00B7 packages/cli/src/mcp-server.ts:1263 \u00B7 packages/cli/src/mcp-server.ts:1383 \u00B7 packages/cli/src/mcp-server.ts:1409 \u00B7 \u002B3 more site(s) not listed \u2014 all 7 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/mcp-server.ts"},"region":{"startLine":1241}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f52873ee3a9187115cf57e8f65048784b79903e5e3346673f408796a869128a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/cli/src/restore-packet/claude-transcript-parser.ts:260 \u00B7 packages/cli/src/restore-packet/codex-jsonl-parser.ts:166 \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/restore-packet/claude-transcript-parser.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b2fb79b97755093a2a28e62c68c82192a00733e6592e3dcc822c791c4a7a16"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/cli/src/restore-packet/redaction.ts:31 \u00B7 packages/daemon/src/domain/transcript-redaction.ts:12 \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/cli/src/restore-packet/redaction.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"736b25fb22214ee05c1cea3bf1e9eee9cd4bf0ad5d0e9c15fffdb0c0742a7f90"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/daemon/scripts/gen-control-plane-json.mjs:249 \u00B7 scripts/mirror-skills.mjs:767 \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/daemon/scripts/gen-control-plane-json.mjs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a8fefdc04dae4c9b9215d155190827c9e6f0921ec6c6a9751d00919b82c49e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/daemon/src/domain/bundle-types.ts:508 \u00B7 packages/daemon/src/domain/bundle-types.ts:698 \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/daemon/src/domain/bundle-types.ts"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e618421788fe4059c43329ab7bc705821bd01f4bc387f711cc02cd8af38b8ec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/daemon/src/domain/claim-service.ts:318 \u00B7 packages/daemon/src/domain/seat-handover-service.ts:1558 \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/daemon/src/domain/claim-service.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"4525b403af52bbf6575d1132489468b6e72238ba36e9553a5318a18e09d8add8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/daemon/src/domain/model-divergence/current-generation-record.ts:125 \u00B7 packages/daemon/src/domain/model-divergence/current-generation-record.ts:297 \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/daemon/src/domain/model-divergence/current-generation-record.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"3031f6f19d91893f5cb09b7c1e46f4a1eafaf664d57c5c7327c7fd89cf177d2a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/daemon/src/domain/native-permission-store.ts:292 \u00B7 packages/daemon/src/domain/native-permission-store.ts:341 \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/daemon/src/domain/native-permission-store.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"378dd69c6cce8f34dd490e6c249cecdd6af65b299f1ceb0b75b46282b79253d2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/daemon/src/domain/queue-repository.ts:3584 \u00B7 packages/daemon/src/domain/queue-repository.ts:3720 \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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":3584}}}],"partialFingerprints":{"codehealthFindingId/v1":"53af49d6c01060c291ed207f95e8e06fd9c689e7ce2c39f405e0ca997874a985"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/daemon/src/domain/rig-repository.ts:540 \u00B7 packages/daemon/src/domain/rig-repository.ts:588 \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/daemon/src/domain/rig-repository.ts"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9c970e3bb5f5db190302f6aaf759c47d620db593440738561f28059e79daf4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/daemon/src/domain/rigspec-instantiator.ts:728 \u00B7 packages/daemon/src/domain/rigspec-instantiator.ts:1576 \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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c956637d82a6a240d27654c4535f5a50d87159001a4cfc773442af2f58656cd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/daemon/src/domain/rigspec-schema.ts:580 \u00B7 packages/daemon/src/domain/rigspec-schema.ts:1490 \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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd3555251d86eab40205e39d24068a2e8b1f86b76ce2128320358399c6e3814"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/daemon/src/domain/session-transport.ts:3717 \u00B7 packages/daemon/src/domain/session-transport.ts:3779 \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/daemon/src/domain/session-transport.ts"},"region":{"startLine":3717}}}],"partialFingerprints":{"codehealthFindingId/v1":"03285be71f7096305529f324e3ce891a4ce35a3b8e67917e5065e23487b0c2ea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/daemon/src/domain/session-transport.ts:4539 \u00B7 packages/daemon/src/domain/session-transport.ts:4559 \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/daemon/src/domain/session-transport.ts"},"region":{"startLine":4539}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc04ce25f9a867b8fa8259155ed2f1ac887e579b8e8c3c35a39180eaf9419b0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/daemon/src/domain/slices/slice-detail-projector.ts:703 \u00B7 packages/daemon/src/domain/slices/slice-indexer.ts:1587 \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/daemon/src/domain/slices/slice-detail-projector.ts"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"11fce3215a1f777c847ef83469b0e70f50e70347f8ec42d747c595eb47ee30dc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/daemon/src/domain/spec-review-service.ts:127 \u00B7 packages/daemon/src/domain/spec-review-service.ts:241 \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/daemon/src/domain/spec-review-service.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"1deab9276efa48a088b5d9d892ba0dfb1271d76428c317227398560ed02ae603"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/daemon/src/routes/env.ts:70 \u00B7 packages/daemon/src/routes/env.ts:107 \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/daemon/src/routes/env.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cfa0b0c0d0d8d77f3c707d4f804307d0167bddf2a3247e34963e1be6c727fa7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/daemon/src/routes/files.ts:271 \u00B7 packages/daemon/src/routes/slices.ts:396 \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/daemon/src/routes/files.ts"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"072b861f50aacb1e0a4c5d8f8e0941a1a20b3e8616d92b1e0e1532cd534d81d7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/daemon/src/routes/require-sender-identity.ts:71 \u00B7 packages/daemon/src/routes/require-sender-identity.ts:126 \u2014 all 2 copies are in the same file, 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/daemon/src/routes/require-sender-identity.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6336a7eca081830b807c4b778d6384adcdbbb78f8a8c0dd978818a2b76fe76"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/daemon/src/routes/spec-review.ts:7 \u00B7 packages/daemon/src/routes/spec-review.ts:26 \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/daemon/src/routes/spec-review.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"65bbb0904f7146641d5b427e8e05e6dc146cbee81b6808ece3dddd684caaa8bd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/tui/src/crash-cart/render-crash-cart.ts:181 \u00B7 packages/tui/src/crash-cart/render-crash-cart.ts:210 \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/tui/src/crash-cart/render-crash-cart.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1099932fed61f2eedd10dd07cf782bfe8270f26ef1e2eb8ba3deca59892b5ee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/ui/src/components/SpecTopologyPreview.tsx:113 \u00B7 packages/ui/src/components/workflow/WorkflowTopologyGraph.tsx:268 \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/ui/src/components/SpecTopologyPreview.tsx"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e02937ecbc41ef741f0c5713cd49c8aeb33afc55c63c2c9c4cb08ca895a4a1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3 locations): packages/ui/src/components/drawer-triggers/FileReferenceTrigger.tsx:15 \u00B7 packages/ui/src/components/drawer-triggers/QueueItemTrigger.tsx:19 \u00B7 packages/ui/src/components/drawer-triggers/SubSpecTrigger.tsx:15 \u2014 the 3 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. 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/ui/src/components/drawer-triggers/FileReferenceTrigger.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f4514522136afadf70d3d1e09f91233c28b07fe69a39ccc240e6e9b4d33c18"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3 locations): packages/ui/src/components/for-you/Feed.tsx:412 \u00B7 packages/ui/src/components/project/ScopePages.tsx:147 \u00B7 packages/ui/src/components/topology/TopologyViewModeTabs.tsx:62 \u2014 the 3 copies are spread across 3 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/ui/src/components/for-you/Feed.tsx"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ab668ca14d840c69cdccb7075f2cad999b38e00240c934065ca34025f6bdfb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/ui/src/components/project/ScopePages.tsx:393 \u00B7 packages/ui/src/components/project/ScopePages.tsx:1119 \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/ui/src/components/project/ScopePages.tsx"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"4479cec3d3fda24ada63653c04214a0e6aae0923a7ba8f85d181760660b80ea9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/ui/src/lib/topology-activity.ts:241 \u00B7 packages/ui/src/lib/topology-activity.ts:256 \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/ui/src/lib/topology-activity.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e09139d5d299ba079b0afd9b8b6b42a60b656c74b66228bda2d5be0d57a098"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/cli/src/commands/adopt.ts:95 \u00B7 packages/cli/src/commands/rig.ts:105 \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/commands/adopt.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"5edc82a3e3dc1ccdf0dec65092386707189577d20d4634aeacd13d715cfeb41b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/cli/src/commands/agent-image.ts:159 \u00B7 packages/cli/src/commands/context.ts:569 \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/commands/agent-image.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7cb82b8fb9cffbd9d6030d0284442d81a99905a2c7f660480192a30c6402fae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/cli/src/commands/broadcast.ts:103 \u00B7 packages/cli/src/commands/send.ts:517 \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/commands/broadcast.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ce821cebc1ad92bd488b672c98bc835dbd1bc6b3f8434d29427091f99e524d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/cli/src/commands/env.ts:45 \u00B7 packages/cli/src/commands/env.ts:135 \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/commands/env.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"26222f0f2bfd504d330129177530946ab3ec00087bee3795f93ae26b65b95d21"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): packages/cli/src/commands/policy.ts:309 \u00B7 packages/cli/src/commands/policy.ts:353 \u2014 the two spans are one implementation copied and then locally edited \u2014 61 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/cli/src/commands/policy.ts"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba326d1554f43825aa4108ede52d4654d2d7eba518122ba71b33dfac63b7605"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/cli/src/commands/scope.ts:933 \u00B7 packages/cli/src/commands/scope.ts:1207 \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/commands/scope.ts"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b574dc32ff4f4e11a82fabb5ce60bba3b58ff8a08eff23f0810f5d46dc895b8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/cli/src/commands/scope.ts:1510 \u00B7 packages/daemon/src/routes/scope-audit.ts:18 \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/commands/scope.ts"},"region":{"startLine":1510}}}],"partialFingerprints":{"codehealthFindingId/v1":"0945d1346a8ce65b685847b21df6b29918fb9f1d7a1c2b1c51b366ab652dd753"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/cli/src/commands/seat.ts:1188 \u00B7 packages/cli/src/commands/seat.ts:1220 \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/commands/seat.ts"},"region":{"startLine":1188}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ee5aef3c6615b2ba55fb21df1088e39e02991484aa78aa3e8e5a64772083c7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/cli/src/config-store.ts:1182 \u00B7 packages/daemon/src/domain/user-settings/settings-store.ts:1003 \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/config-store.ts"},"region":{"startLine":1182}}}],"partialFingerprints":{"codehealthFindingId/v1":"14734a782037e37dea3c1ce92b53bef4660bd8f69c56ebbe601aa25915c3157f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/cli/src/lib/context-install.ts:54 \u00B7 packages/daemon/src/domain/context-packs/context-pack-library-service.ts:325 \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/lib/context-install.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c8a9f4d1ea77166c8d401e997ec0c4aa5ff98f214c12f9d254edecceaa3b85"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 7 locations): packages/cli/src/mcp-server.ts:1167 \u00B7 packages/cli/src/mcp-server.ts:1238 \u00B7 packages/cli/src/mcp-server.ts:1260 \u00B7 packages/cli/src/mcp-server.ts:1350 \u00B7 \u002B3 more site(s) not listed \u2014 all 7 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/mcp-server.ts"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ff9ab55261019567b89264e47de2353cfdc2de91cb46dd063abdf7d64428a1b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/daemon/src/domain/agent-images/agent-image-library-service.ts:98 \u00B7 packages/daemon/src/domain/context-packs/context-pack-library-service.ts:156 \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/daemon/src/domain/agent-images/agent-image-library-service.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3191fc8a269ca87a4f84658a1ea09ac1b224453fcc16c1d33380385877e1cbe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/daemon/src/domain/bundle-content-routing.ts:218 \u00B7 packages/daemon/src/domain/bundle-content-routing.ts:235 \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/daemon/src/domain/bundle-content-routing.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ab4a4cd8c2ab8bca1fa4a9be750a29f4412824c029af177cfaa2fb29b0573f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/daemon/src/domain/bundle-source-resolver.ts:102 \u00B7 packages/daemon/src/domain/bundle-source-resolver.ts:187 \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/daemon/src/domain/bundle-source-resolver.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ef1f7a61a8a9e61e883a6756ca1113f162aca931ac372662c0063ba273619c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/daemon/src/domain/claim-service.ts:339 \u00B7 packages/daemon/src/domain/seat-handover-service.ts:1577 \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/daemon/src/domain/claim-service.ts"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"77bea05d24182f0d5111517f001acabe3e4e0745da22e633ed27e21673410a4c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/daemon/src/domain/context-monitor.ts:234 \u00B7 packages/daemon/src/domain/seat-activity-service.ts:488 \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/daemon/src/domain/context-monitor.ts"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"be6325a7e6309600bc86e16cc684b18d22a9886a4f03d19df651fddc8b1bb478"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/daemon/src/domain/plugin-vendor-service.ts:179 \u00B7 packages/daemon/src/domain/plugin-vendor-service.ts:296 \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/daemon/src/domain/plugin-vendor-service.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a7425f5f3069acf374deffd5ae7714f5a407419356a6e480e5cc750a4e7d64"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/daemon/src/domain/policies/mode-scheduled-end.ts:20 \u00B7 packages/daemon/src/domain/policies/quiet-release.ts:90 \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/daemon/src/domain/policies/mode-scheduled-end.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2592f5471f0f2c9360aa78cf8b718e817a45eb1d61edac1727c22dd21a7ea5d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): packages/daemon/src/domain/seat-delivery-guard.ts:356 \u00B7 packages/daemon/src/domain/seat-delivery-guard.ts:409 \u2014 the two spans are one implementation copied and then locally edited \u2014 149 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/daemon/src/domain/seat-delivery-guard.ts"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c017ca1e9723f2061b514e9b24eff989f967d4afacbb427e40e9f908cc9b1b6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/daemon/src/domain/seat-handover-planner.ts:76 \u00B7 packages/daemon/src/domain/seat-handover-service.ts:442 \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/daemon/src/domain/seat-handover-planner.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"d26bdafbc3259c9a1f2cba998437a9ccec5fd9017d8c6580701328745151f9c4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/daemon/src/domain/startup-validation.ts:39 \u00B7 packages/daemon/src/domain/startup-validation.ts:90 \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/daemon/src/domain/startup-validation.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d3a10916dfaea8d9179633e8a37ef4274a0d54ba5097a7b0dcf51521083807"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/daemon/src/domain/user-settings/settings-store.ts:1052 \u00B7 packages/daemon/src/domain/user-settings/settings-store.ts:1074 \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/daemon/src/domain/user-settings/settings-store.ts"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"2331c12dbea1142cba261f242dfd417699d365e39266a52927dbb4c91547cd86"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/daemon/src/routes/watchdog.ts:31 \u00B7 packages/daemon/src/routes/workflow.ts:36 \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/daemon/src/routes/watchdog.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d52dba621b32d2e652fa9dbd844ec7a8a98270c017d32ef54a39326d560f3f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4 locations): packages/ui/src/components/LibraryReview.tsx:231 \u00B7 packages/ui/src/components/LibraryReview.tsx:403 \u00B7 packages/ui/src/components/LibraryReview.tsx:542 \u00B7 packages/ui/src/components/workflow/WorkflowInstancePage.tsx:159 \u2014 the 4 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/ui/src/components/LibraryReview.tsx"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"9483b60f00eae90ebd72a63cfb27cfdd27c2ddbe92858e0bd9156741b74aa794"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): packages/ui/src/components/RigCard.tsx:66 \u00B7 packages/ui/src/components/RigStatusCard.tsx:111 \u2014 the two spans are one implementation copied and then locally edited \u2014 62 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/ui/src/components/RigCard.tsx"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"706e8e9dacb849ee4c18473a58f3499791a7450c28b47744f5105d6cc249c52e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): packages/cli/src/commands/adopt.ts:172 \u00B7 packages/cli/src/commands/discover.ts:23 \u2014 the two spans are one implementation copied and then locally edited \u2014 89 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/commands/adopt.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f9adce70c00aa4636589048eeb3c709f6518e168548eb77d8bd6097838498e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): packages/cli/src/commands/chatroom.ts:225 \u00B7 packages/cli/src/commands/workflow-follow.ts:292 \u2014 the two spans are one implementation copied and then locally edited \u2014 98 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/commands/chatroom.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"42889ea19ce549130ec49e0e32345d39d619f945ba6a9a179920f408d8604857"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): packages/cli/src/commands/context.ts:534 \u00B7 packages/cli/src/commands/context.ts:850 \u00B7 packages/cli/src/commands/specs.ts:393 \u2014 the 3 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/commands/context.ts"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be7b9c261b119eadef20111e0b4fc209c79155ff3672e9f5bddd1da39b39af1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): packages/cli/src/commands/expand.ts:80 \u00B7 packages/cli/src/commands/reconcile-session.ts:96 \u2014 the two spans are one implementation copied and then locally edited \u2014 84 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/commands/expand.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"da739f1095f98b8f3481a6d579cb0131b33451016c85481b4dc5f2fd156d7a39"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/cli/src/commands/health.ts:372 \u00B7 packages/cli/src/commands/health.ts:393 \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/commands/health.ts"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8293df017ef409af8bde5001d549a71a6251ed72d8180af78bb712df5dc106d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/cli/src/commands/host.ts:713 \u00B7 packages/cli/src/commands/host.ts:743 \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/commands/host.ts"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"a654463c4eaada385e53151a0104962f4ecd2540f57fbf70eef6365e6ca0e54f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): packages/cli/src/commands/launch.ts:399 \u00B7 packages/cli/src/commands/reconcile-session.ts:96 \u2014 the two spans are one implementation copied and then locally edited \u2014 75 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/commands/launch.ts"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f2c211567f9ac952ac634aee3e57135dbd2f0f6e800390f010b9569415ae59"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/cli/src/commands/package.ts:34 \u00B7 packages/cli/src/commands/package.ts:93 \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/commands/package.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2bc401199d0c321dcf09375e277277492f1a8ae22ba94ac6272a347da46319e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/cli/src/commands/release.ts:8 \u00B7 packages/cli/src/commands/snapshot.ts:8 \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/commands/release.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d0f7e09f76e08b4aa99e74ff70ad22c1272fcff1b03d3b34b4a2832c311a95"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/cli/src/commands/restore-check.ts:294 \u00B7 packages/cli/src/commands/restore-check.ts:348 \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/commands/restore-check.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd18c6244725a354af2c29b5283cacec4a6768da9d80d2645837f21c3ae5c90"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/cli/src/commands/scope.ts:1652 \u00B7 packages/cli/src/commands/scope.ts:1674 \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/commands/scope.ts"},"region":{"startLine":1652}}}],"partialFingerprints":{"codehealthFindingId/v1":"5513896bc41334178db4c98204e294a93691dd63dc1ca5ed2cf7d4f54b6e7087"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/cli/src/commands/watchdog.ts:164 \u00B7 packages/cli/src/commands/watchdog.ts: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/commands/watchdog.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"09bc946df501f4b4d968173e03b081644b6448f19049eb6f596328a509b4974d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/cli/src/config-store.ts:1229 \u00B7 packages/cli/src/config-store.ts:1252 \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/config-store.ts"},"region":{"startLine":1229}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b1b86527fa1ca1684af4831bf94434dd37447fa1e300e37ceb9e08b22d8373"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/cli/src/config-store.ts:1264 \u00B7 packages/daemon/src/domain/user-settings/settings-store.ts:1085 \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/config-store.ts"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4815e89f60696dffe617364c1c3b3ece319b392bc613c88172edc12d9adf05"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/cli/src/config-store.ts:1630 \u00B7 packages/daemon/src/domain/user-settings/settings-store.ts:1243 \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/config-store.ts"},"region":{"startLine":1630}}}],"partialFingerprints":{"codehealthFindingId/v1":"3487f7622bcda1f442e2b6963a22de20121ec995a8f25a3298114dd014ca2639"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/daemon/assets/plugins/openrig-core/skills/loading-addressable-markdown/scripts/resolve-markdown.mjs:153 \u00B7 scripts/testbed-emit-manifest.mjs:62 \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/daemon/assets/plugins/openrig-core/skills/loading-addressable-markdown/scripts/resolve-markdown.mjs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a556ae1642150371596514b2fdc3e23b2b5a48dec9a7c76e6cb591131880aa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): packages/daemon/src/adapters/cmux.ts:174 \u00B7 packages/daemon/src/adapters/cmux.ts:213 \u00B7 packages/daemon/src/adapters/cmux.ts:257 \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/daemon/src/adapters/cmux.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d0d8c1ea17261ef91880ad7eae208a5fdcb03cc75efbb7f5369f44d33e022e2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/daemon/src/adapters/cmux.ts:243 \u00B7 packages/daemon/src/adapters/cmux.ts:279 \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/daemon/src/adapters/cmux.ts"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"906fb7a198c889eb3dc03602dc69667c582031230a4c66096724cf494c37588d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/daemon/src/adapters/codex-runtime-adapter.ts:844 \u00B7 packages/daemon/src/adapters/pi-runtime-adapter.ts:221 \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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3e0e222d7b095bfcf4bf82f51964fffdd1b464a32b9f5503a9d9f8f617847e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/daemon/src/adapters/codex-runtime-adapter.ts:2133 \u00B7 packages/daemon/src/adapters/codex-runtime-adapter.ts:2270 \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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":2133}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e44f6dbba807cfb901d3c2ff18e1b0605784873da002a2ea9f291586f35800"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/daemon/src/adapters/codex-runtime-adapter.ts:2346 \u00B7 packages/daemon/src/adapters/codex-runtime-adapter.ts:2678 \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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":2346}}}],"partialFingerprints":{"codehealthFindingId/v1":"430616e899c56fba346819f192df89f2df4037193b1c2b8eb39f038f0420221c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/daemon/src/adapters/pi-runtime-adapter.ts:226 \u00B7 packages/daemon/src/adapters/stub-runtime-adapter.ts:113 \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/daemon/src/adapters/pi-runtime-adapter.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b59f0c50151573cc12c040ed8d6c024c8b55a62f5b8bd4c27258fa72038ba3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/daemon/src/adapters/tmux.ts:1564 \u00B7 packages/daemon/src/adapters/tmux.ts:3023 \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/daemon/src/adapters/tmux.ts"},"region":{"startLine":1564}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c6f17a634aab29b438bbe44dfbe8b47d34eb288c573704dacaac14647d8bc5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/daemon/src/adapters/tmux.ts:2119 \u00B7 packages/daemon/src/adapters/tmux.ts:2378 \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/daemon/src/adapters/tmux.ts"},"region":{"startLine":2119}}}],"partialFingerprints":{"codehealthFindingId/v1":"56809ade63215087eec8ab28ef1fcb4630233cb24a46589cd6078560877ca29d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): packages/daemon/src/domain/agent-resolver.ts:131 \u00B7 scripts/check-substance-gate.mjs:454 \u2014 the two spans are one implementation copied and then locally edited \u2014 59 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/daemon/src/domain/agent-resolver.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ad26d34aed6e377c3be43dd84f4da26b6d5fe5e7650d5561602c9eb76afa8f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/daemon/src/domain/classifier-lease-manager.ts:49 \u00B7 packages/daemon/src/domain/project-classifier.ts:113 \u2014 the 2 copies are spread across 2 files, and each CITED SPAN is a SPECIALISATION DECLARATION \u2014 a type whose \u0060extends\u0060 clause names a base and whose body hands that base its own values through \u0060super(\u2026)\u0060. The shared module this dimension usually asks you to extract already exists: it is that base, every one of these sites already reaches it, and the \u0060super(\u2026)\u0060 call this row matched on is where each site passes its differences in. So do not read this as an extract-a-helper row \u2014 there is no missing helper, and what is left at each site is the declaration of one distinct specialisation, which cannot be deleted without deleting the thing it declares. Read what actually differs between the spans, because two different answers follow. Where the sites differ only in the values they hand the base \u2014 a type argument, a service, an alias, a cache \u2014 the repetition is a TEMPLATE, and the only moves that collapse it are to generate these declarations from the set they enumerate or to replace the repeated construction with one factory each site calls with its own values; where that set is the point, each site pinning one distinct thing, the repetition IS the enumeration and there is nothing to remove. Where instead a span carries logic OUTSIDE the delegation that is the same at every site, that logic is the part to move, and its home is the base type rather than a new module. Reported because the copies still drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/classifier-lease-manager.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e08179b6851724bae6d79096faa6e16fa03dad3d3f8fab2528784e341e4f20b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/daemon/src/domain/context-monitor.ts:227 \u00B7 packages/daemon/src/domain/seat-identity-reconciler.ts:478 \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/daemon/src/domain/context-monitor.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"59249f76b89ecc3ee0e5e192aab62bd5d3ced8ea42a4ee7360066258bbea529c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/daemon/src/domain/gateway/relay-outbound.ts:879 \u00B7 packages/daemon/src/domain/gateway/relay-outbound.ts:952 \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/daemon/src/domain/gateway/relay-outbound.ts"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d96991798a5d9525ca08b95c2f3bd53768c766f225ca501468e21cfffb9b93c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/daemon/src/domain/rigspec-instantiator.ts:578 \u00B7 packages/daemon/src/domain/rigspec-instantiator.ts:633 \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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e72bcdc189f3b0873c3b24f346ab1bf77acc308eb6cd8f94585848ef08542ee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/daemon/src/domain/rigspec-instantiator.ts:2529 \u00B7 packages/daemon/src/domain/rigspec-instantiator.ts:2992 \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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":2529}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ad84952e962309f9b0891896f8a873e29d3ab74fdf992b625c3554e50e30f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/daemon/src/domain/rigspec-schema.ts:438 \u00B7 packages/daemon/src/domain/rigspec-schema.ts:519 \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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc941e0c562f96bcda77365e9f139716c4baf2e65cac4a8a314fcba27158bf86"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): packages/daemon/src/domain/rigspec-schema.ts:775 \u00B7 packages/daemon/src/domain/rigspec-schema.ts:801 \u00B7 packages/daemon/src/domain/rigspec-schema.ts:829 \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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb2bfa472b9d264920eaa146c6d1113aabab91ffb372a47ffd6bbacfaf27797"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/daemon/src/domain/seat-skill-storage.ts:1096 \u00B7 packages/daemon/src/domain/seat-skill-storage.ts:1231 \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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea577dc96e2c27d6afc4806446dcb6e24735796c9dc3e185e77c4c55af47b5fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/daemon/src/domain/startup-orchestrator.ts:466 \u00B7 packages/daemon/src/domain/startup-orchestrator.ts:521 \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/daemon/src/domain/startup-orchestrator.ts"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a76dc90e727ceac77c5bd12ca5602ee316b19be5f7650402c451b1c15f2a610"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): packages/daemon/src/domain/watchdog-auto-registration.ts:80 \u00B7 packages/daemon/src/domain/watchdog-auto-registration.ts:203 \u2014 the two spans are one implementation copied and then locally edited \u2014 74 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/daemon/src/domain/watchdog-auto-registration.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"5abee39fbdfff19467c73d31d1b780831477a7db63fec4e73194ffdc175555ac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/daemon/src/routes/agent-images.ts:415 \u00B7 packages/daemon/src/routes/agent-images.ts:430 \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/daemon/src/routes/agent-images.ts"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"461e75778daf122889bc658f12b693ba5befc803537549ba59a4967387001dc8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/daemon/src/routes/bundles.ts:231 \u00B7 packages/daemon/src/routes/packages.ts:24 \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/daemon/src/routes/bundles.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"3abc7afb149d3e947963edf0b92593d96911e66ea48076f244b6fc5263951564"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): packages/daemon/src/routes/hosts.ts:624 \u00B7 packages/daemon/src/routes/hosts.ts:663 \u00B7 packages/daemon/src/routes/hosts.ts:687 \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/daemon/src/routes/hosts.ts"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"7677c14721e13d241515c8386ecc724fa3e18c1f3cdcf68490de0691f52be3a9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/daemon/src/routes/provider.ts:180 \u00B7 packages/daemon/src/routes/provider.ts:256 \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/daemon/src/routes/provider.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a6cad1e990783cc34c4bfaa1537b2468323ef6a6c753f9aa55ed64be4911ea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/daemon/src/routes/provider.ts:310 \u00B7 packages/daemon/src/routes/provider.ts:341 \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/daemon/src/routes/provider.ts"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7513bc991eb469c61f2576bb641ac046ceec0f14890b8c437668e33eb189cb8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/daemon/src/routes/sessions.ts:467 \u00B7 packages/daemon/src/routes/sessions.ts:597 \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/daemon/src/routes/sessions.ts"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85798402f1f856765a424fef90148018eb19ced987baf8fc88d871415df8e81"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/ui/src/components/BundleInspector.tsx:86 \u00B7 packages/ui/src/components/BundleInspector.tsx:131 \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/ui/src/components/BundleInspector.tsx"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"317f22ce6f5b2df08fef10d2759e6d3ac84df43ece3c24a39c1d274784880982"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/ui/src/components/dashboard/vellum/fidelity-glyphs.tsx:70 \u00B7 packages/ui/src/components/dashboard/vellum/graphics.tsx:52 \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/ui/src/components/dashboard/vellum/fidelity-glyphs.tsx"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e304f8a084413e432354afdcf629ef840eca88ec155a7a2bce9a9e82d3c60a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/ui/src/components/project/ScopePages.tsx:314 \u00B7 packages/ui/src/components/project/ScopePages.tsx:424 \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/ui/src/components/project/ScopePages.tsx"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e7a595e7a506578dfd9f3ef523ab5c4b6dc4607739cbfae52386ddaf0183ea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/ui/src/components/project/ScopePages.tsx:745 \u00B7 packages/ui/src/components/project/ScopePages.tsx:894 \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/ui/src/components/project/ScopePages.tsx"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"4140ba49d5b078ebd521ea0b3f6dbeb595d69b14cdbd3ca944c16171897b3740"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/ui/src/components/project/ScopePages.tsx:1243 \u00B7 packages/ui/src/components/project/ScopePages.tsx:1262 \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/ui/src/components/project/ScopePages.tsx"},"region":{"startLine":1243}}}],"partialFingerprints":{"codehealthFindingId/v1":"7042d60ad42eb57d6c84108cd96c6f1dfc23f54264a0421f47f05468b4ab2c12"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/ui/src/components/workflow/WorkflowsPage.tsx:89 \u00B7 packages/ui/src/components/workflow/WorkflowsPage.tsx:124 \u2014 all 2 copies are in the same file, 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/ui/src/components/workflow/WorkflowsPage.tsx"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f22588514fb674399f77ca8435f36bea55ee1d5c5ee7bcb76e9fc85d15fb498"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/ui/src/hooks/useSpecReview.ts:79 \u00B7 packages/ui/src/hooks/useSpecReview.ts:92 \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/ui/src/hooks/useSpecReview.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b26449b78d17c8b9f0232d529a4fa51a3430fedc98a00a992fe5d3231035ea4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): skills/_canonical/process/systematic-debugging/condition-based-waiting-example.ts:31 \u00B7 skills/_canonical/process/systematic-debugging/condition-based-waiting-example.ts: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/_canonical/process/systematic-debugging/condition-based-waiting-example.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b60d254722c297dc5ebf8085725284a96f188f5304e13bdf584f6bf042388b9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): packages/cli/src/commands/agent-image.ts:285 \u00B7 packages/cli/src/commands/slack.ts:590 \u2014 the two spans are one implementation copied and then locally edited \u2014 55 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/commands/agent-image.ts"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"22596fe75c52317f7416dab15acd71356e53e07c4af7b7108841b92a932fedab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/cli/src/commands/archive.ts:77 \u00B7 packages/cli/src/commands/unarchive.ts:59 \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/commands/archive.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7879441188003e96c0284f4f767519c74ee8769fbfce486d8791c85eb3f34cf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): packages/cli/src/commands/broadcast.ts:175 \u00B7 packages/cli/src/commands/ps.ts:1700 \u00B7 packages/cli/src/commands/whoami.ts:482 \u00B7 packages/cli/src/lib/run-on-host.ts:45 \u2014 the 4 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 4 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/commands/broadcast.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e1ea8669e9fafb76b8ce9338874c58b597457f2cd0c433e0ce6c701d59f66c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 5 locations): packages/cli/src/commands/context.ts:558 \u00B7 packages/cli/src/commands/context.ts:594 \u00B7 packages/cli/src/commands/plugin.ts:191 \u00B7 packages/cli/src/commands/plugin.ts:323 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 3 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/commands/context.ts"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"069bf9e05443727c06b2b20c29b914004204bb2bcf6a34fbec82d185d2e511d4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/cli/src/commands/provider.ts:520 \u00B7 packages/cli/src/commands/provider.ts:622 \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/commands/provider.ts"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"491651f47ecf7a820282fe234adcdd5ac1c178a01ca99ff78f23eb106c746e15"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): packages/cli/src/commands/queue.ts:2680 \u00B7 packages/cli/src/commands/stream.ts:239 \u2014 the two spans are one implementation copied and then locally edited \u2014 83 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/commands/queue.ts"},"region":{"startLine":2680}}}],"partialFingerprints":{"codehealthFindingId/v1":"08cf81804477f953e2c7d9cdea5013bd4a7bc1a5dddf92d1085c6e7258ff8bcb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): packages/cli/src/commands/scope.ts:260 \u00B7 packages/cli/src/commands/scope.ts:1894 \u00B7 packages/cli/src/commands/scope.ts:2031 \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/commands/scope.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"365fe439d5046c7f280928104677ddafae1ee313056031acdfd4cd8fffc84305"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): packages/cli/src/commands/seat.ts:1126 \u00B7 packages/cli/src/commands/seat.ts:1714 \u00B7 packages/cli/src/commands/seat.ts:1750 \u00B7 packages/cli/src/commands/seat.ts:1773 \u2014 all 4 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/commands/seat.ts"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"2596def08c9684799f2d5ab5de1d877b616c0365343b4d33ae0fcff92b08385c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/cli/src/commands/seat.ts:1293 \u00B7 packages/cli/src/commands/seat.ts:1498 \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/commands/seat.ts"},"region":{"startLine":1293}}}],"partialFingerprints":{"codehealthFindingId/v1":"271d6c3ed9e34d6c7548e7c12d7ae34dad140450615d66c3e0bbf3418bcac331"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/cli/src/commands/seat.ts:1901 \u00B7 packages/cli/src/commands/seat.ts:1946 \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/commands/seat.ts"},"region":{"startLine":1901}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead8c59840f10941836de0ea77f180e5a4220a4be6495d8c95a13a3c18dc9e57"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): packages/cli/src/commands/status.ts:26 \u00B7 packages/ui/src/components/RigCard.tsx:25 \u00B7 packages/ui/src/components/SnapshotPanel.tsx:28 \u2014 the 3 copies are spread across 3 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/commands/status.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"968af9728e44b0dd0f82013c0d9aeb14026731d0801e0012ff5356d9999be5f6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): packages/cli/src/commands/walk.ts:264 \u00B7 packages/cli/src/commands/walk.ts:337 \u2014 the two spans are one implementation copied and then locally edited \u2014 116 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/cli/src/commands/walk.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec70208efa11aed9475e78f15cb3937860b43e53d18dbf49f4307378e049bc99"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/cli/src/config-store.ts:1041 \u00B7 packages/daemon/src/domain/user-settings/settings-store.ts:873 \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/config-store.ts"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"68441e54ed51ba2c3d8ee0ca3c746b2ccf2101db0c6cf78231445defb201c9b3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): packages/cli/src/lib/context-install.ts:55 \u00B7 packages/daemon/src/domain/context-packs/context-pack-library-service.ts:326 \u00B7 packages/daemon/src/domain/context-packs/seat-recap-store.ts:160 \u2014 the 3 copies are spread across 3 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/lib/context-install.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef8d29eacf22ee644e825acdc78b7a498f3b4a1dcfa9f7a0da075e5adab1672a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/daemon/src/adapters/claude-code-adapter.ts:987 \u00B7 packages/daemon/src/adapters/codex-runtime-adapter.ts:1512 \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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"52fd71d25f6d01aff25e5616bb62162e375295b2232ea1a60ecbe7a93d4aab01"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/daemon/src/adapters/cmux.ts:125 \u00B7 packages/daemon/src/adapters/cmux.ts:137 \u2014 all 2 copies are in the same file, 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/daemon/src/adapters/cmux.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec986d354588abb15c83997fc8dd0fec2dea69e8d076136ef73ed4003e4ada6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/daemon/src/adapters/compose-services-adapter.ts:107 \u00B7 packages/daemon/src/adapters/compose-services-adapter.ts:150 \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/daemon/src/adapters/compose-services-adapter.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0de7c11fdd29067f44324e730365d6d79f6b39e9287032a0361833bd3c3fc5d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/daemon/src/adapters/pi-runner-protocol.ts:123 \u00B7 packages/daemon/src/adapters/stub-runner-protocol.ts:73 \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/daemon/src/adapters/pi-runner-protocol.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ccb102af326400362e0d3816c543005131cd2bd116573bf2a20e1569d1227e9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/daemon/src/adapters/tmux.ts:2502 \u00B7 packages/daemon/src/adapters/tmux.ts:2515 \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/daemon/src/adapters/tmux.ts"},"region":{"startLine":2502}}}],"partialFingerprints":{"codehealthFindingId/v1":"508b4a0a2c439c9aa2a92416bfa1afe701df691b81760a22c6721cb94fcce86c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 5 locations): packages/daemon/src/domain/bundle-types.ts:143 \u00B7 packages/daemon/src/domain/bundle-types.ts:194 \u00B7 packages/daemon/src/domain/bundle-types.ts:223 \u00B7 packages/daemon/src/domain/bundle-types.ts:254 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 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/daemon/src/domain/bundle-types.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"319c7467fd939022bbfd3a4632312d1fe78468165023ac83eaa92fe33c667d41"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/daemon/src/domain/claude-auto-mode.ts:111 \u00B7 packages/daemon/src/domain/claude-permission-rules.ts:30 \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/daemon/src/domain/claude-auto-mode.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6253c6d91ea9d4e0bce59cf0761d97f34f74d818596ec2628f34f39f47d341f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/daemon/src/domain/context-packs/manifest-parser.ts:454 \u00B7 packages/daemon/src/domain/context-packs/manifest-parser.ts:495 \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/daemon/src/domain/context-packs/manifest-parser.ts"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab87c890449bb72e546289fa18d73c27b5122bd7081e6747c25193e8740458df"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): packages/daemon/src/domain/continuity-policy-materializer.ts:422 \u00B7 packages/daemon/src/domain/history-query.ts:152 \u2014 the two spans are one implementation copied and then locally edited \u2014 62 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/daemon/src/domain/continuity-policy-materializer.ts"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"71711e5e1ea01690de6faf648d328aa3d1e0b968a5a49f9c8af7d6f827ba40d6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): packages/daemon/src/domain/gateway/relay-inbound.ts:965 \u00B7 packages/daemon/src/domain/queue-repository.ts:6457 \u2014 the two spans are one implementation copied and then locally edited \u2014 79 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/daemon/src/domain/gateway/relay-inbound.ts"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"644dbd536855d840adb65d52f30f2d1495fd3d663ec068afa6f73b64dbebc8b4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/daemon/src/domain/inbox-handler.ts:159 \u00B7 packages/daemon/src/domain/inbox-handler.ts:216 \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/daemon/src/domain/inbox-handler.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08506393f1bb10aaef1c4bae5695e2fd852573bec3a8317d653e1dc82aaa4b3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/daemon/src/domain/install-engine.ts:30 \u00B7 packages/daemon/src/domain/install-verifier.ts:27 \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/daemon/src/domain/install-engine.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"341959c8431f79328214893259a784b683aed7f4c9e419588f39196ca408e332"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/daemon/src/domain/install-planner.ts:295 \u00B7 packages/daemon/src/domain/install-planner.ts:310 \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/daemon/src/domain/install-planner.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8a77f31a666c130869195603dd26c765b22940922d4a25cd584b2050bfcb2e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/daemon/src/domain/mission-control/mission-control-read-layer.ts:174 \u00B7 packages/daemon/src/domain/mission-control/mission-control-read-layer.ts:187 \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/daemon/src/domain/mission-control/mission-control-read-layer.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea26f62e86e73d22ee48797583bf2f0d4ce1ce7ce8ec2d67195b26692200e757"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): packages/daemon/src/domain/node-inventory.ts:677 \u00B7 packages/daemon/src/domain/startup-orchestrator.ts:128 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 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/daemon/src/domain/node-inventory.ts"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b86b1a949d9f2a1fbbcb31a8425cd0a752fba0d32f79fe72d96e0fae615aab1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 5 locations): packages/daemon/src/domain/node-launcher.ts:138 \u00B7 packages/daemon/src/domain/reconciler.ts:44 \u00B7 packages/daemon/src/domain/restore-orchestrator.ts:345 \u00B7 packages/daemon/src/domain/rigspec-instantiator.ts:64 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 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. There is one copy in each of 5 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/daemon/src/domain/node-launcher.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd6803c0c41b01437a6743653cedf4b85574deb8df7296afc7326d1d159972a8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/daemon/src/domain/plugin-discovery-service.ts:288 \u00B7 packages/daemon/src/domain/plugin-discovery-service.ts:299 \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/daemon/src/domain/plugin-discovery-service.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"543445402278aea55222f65a65e04e3ce64d939b94284a456557de027e17a1e1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): packages/daemon/src/domain/policies/artifact-pool-ready.ts:26 \u00B7 packages/daemon/src/domain/policies/edge-artifact-required.ts:56 \u00B7 packages/daemon/src/domain/policies/periodic-reminder.ts:24 \u2014 the 3 copies are spread across 3 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/daemon/src/domain/policies/artifact-pool-ready.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d5c53ff9d8f127a3756b421af7d29e509a9f097ae6e262a6f661289c18bef1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): packages/daemon/src/domain/proof/source-watch.ts:189 \u00B7 packages/daemon/src/domain/proof/source-watch.ts:219 \u2014 the two spans are one implementation copied and then locally edited \u2014 65 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/daemon/src/domain/proof/source-watch.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c731708f79cecb199df6df4209b9f9bdd301e941d114d63f5485658dc208b2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): packages/daemon/src/domain/restore-orchestrator.ts:2873 \u00B7 packages/daemon/src/domain/restore-orchestrator.ts:2905 \u00B7 packages/daemon/src/domain/restore-orchestrator.ts:2939 \u2014 all 3 copies are in the same file, 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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":2873}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77c8c505dca0cc0dc1b5ffd4a474c487ce57aa56b3d2b62db166ec0849e9dfc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/daemon/src/domain/rig-lifecycle-service.ts:486 \u00B7 packages/daemon/src/domain/rig-lifecycle-service.ts:670 \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/daemon/src/domain/rig-lifecycle-service.ts"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1cc0fc05b91c79204670b8610797a2e9a08b2f4dd25c4805902431390e73c9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/daemon/src/domain/rigspec-instantiator.ts:891 \u00B7 packages/daemon/src/domain/rigspec-instantiator.ts:1618 \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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"960d35047985fddb42e151bd6fd67a0ab03f5c69996b0a949aa71823e21b2baf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): packages/daemon/src/domain/rigspec-preflight.ts:372 \u00B7 packages/daemon/src/domain/rigspec-preflight.ts:466 \u2014 the two spans are one implementation copied and then locally edited \u2014 86 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/daemon/src/domain/rigspec-preflight.ts"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e0107f4a148e6a76bb1dc7617845e306589a65d56de716b661dc87136e8b61c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/daemon/src/domain/seat-lifecycle-service.ts:1219 \u00B7 packages/daemon/src/domain/seat-lifecycle-service.ts:2048 \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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":1219}}}],"partialFingerprints":{"codehealthFindingId/v1":"98fd797efd788b58071af3cee49140f840a85c9e75c921dc686b8f3085fbab80"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/daemon/src/domain/session-registry.ts:606 \u00B7 packages/daemon/src/domain/session-registry.ts:626 \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/daemon/src/domain/session-registry.ts"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3071cad25cec6b332e3ac886bae5479049fd9f69928d3c8f90ae2b013dce6d2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): packages/daemon/src/domain/terminal/cmux-provider-adapter.ts:53 \u00B7 packages/daemon/src/domain/terminal/herdr-adapter.ts:432 \u2014 the two spans are one implementation copied and then locally edited \u2014 74 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/daemon/src/domain/terminal/cmux-provider-adapter.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06e3290857fab501cf4da5578a93630341a109c5e73ed3cc7f7740b7830c042"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/daemon/src/domain/workflow-runtime.ts:1265 \u00B7 packages/daemon/src/domain/workflow-runtime.ts:1798 \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/daemon/src/domain/workflow-runtime.ts"},"region":{"startLine":1265}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0216d72ffb56e42d21cd2da1c76f24862f53590927e5aa357f49d9ebcc53ed7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/daemon/src/domain/workflow/starter-spec-loader.ts:95 \u00B7 packages/daemon/src/domain/workflow/starter-spec-loader.ts:128 \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/daemon/src/domain/workflow/starter-spec-loader.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8aa4209a71878a48239150758e78daf843e706456375f436e18995ccc129acd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/daemon/src/routes/activity.ts:410 \u00B7 packages/daemon/src/routes/activity.ts:991 \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/daemon/src/routes/activity.ts"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf009ee7b12c2c149bd214648a296d4fbb79f8e2d7b8efebc093df327a61a2a9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/daemon/src/routes/projects.ts:233 \u00B7 packages/daemon/src/routes/watchdog.ts:173 \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/daemon/src/routes/projects.ts"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"b970834dc14f8620c6b5ad29e5371d14d46ad8366d3c223c3227a4bb71d8fb9d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/daemon/src/routes/rigs.ts:680 \u00B7 packages/daemon/src/routes/up.ts:174 \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/daemon/src/routes/rigs.ts"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14055263b91385e01c5775b20c3c73addb5e94afc3b113a1dc15b742a4261c8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/daemon/src/routes/rigspec.ts:75 \u00B7 packages/daemon/src/routes/rigspec.ts:94 \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/daemon/src/routes/rigspec.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e9627639e9f210e32e161ad5bf446e30d28999cc7c691c28aa72303f939ae6a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/daemon/src/routes/seat.ts:547 \u00B7 packages/daemon/src/routes/seat.ts:601 \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/daemon/src/routes/seat.ts"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a6d119bff7b65c66dadbec6132e5bcab105d23e30c0f388dd8dd598c9589b9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/daemon/src/startup.ts:2621 \u00B7 packages/daemon/src/startup.ts:2635 \u2014 all 2 copies are in the same file, 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/daemon/src/startup.ts"},"region":{"startLine":2621}}}],"partialFingerprints":{"codehealthFindingId/v1":"eefafd9722f95c457f65d5af7bc1111e2a364db3fbb2c2d32d4637c130959f56"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/daemon/src/terminal/TerminalSessionBroker.ts:393 \u00B7 packages/daemon/src/terminal/TerminalSessionBroker.ts:606 \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/daemon/src/terminal/TerminalSessionBroker.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"097e09d7d4e0c51a62e076f711a3b015e9ee4b3c725305235a532fb2205442d9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/daemon/src/terminal/TerminalSessionBroker.ts:593 \u00B7 packages/daemon/src/terminal/TerminalSessionBroker.ts:611 \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/daemon/src/terminal/TerminalSessionBroker.ts"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c5ec0e96566bced021aa55f80d55720819d23f3e6e12971d6b3d57a4bb445d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/tui/src/cost/cost-model.ts:139 \u00B7 packages/tui/src/usage/usage-model.ts:166 \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/tui/src/cost/cost-model.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe0714d831d97a5ff6c0f6e12ff78eeec72f047808bf1d2b7b10a089a9c7d5a9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): packages/tui/src/daemon-client.ts:209 \u00B7 packages/tui/src/daemon-client.ts:225 \u00B7 packages/tui/src/daemon-client.ts:250 \u00B7 packages/tui/src/daemon-client.ts:364 \u2014 all 4 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/tui/src/daemon-client.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0dadfd0d15a9c0d14c6850799567b4099c628a12842a6f3762b8727d2aeb0e2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/tui/src/execution/execution-model.ts:597 \u00B7 packages/tui/src/scopes/scopes-model.ts:131 \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/tui/src/execution/execution-model.ts"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"2889e41cb13cbb8801a439e55f777bd2f2c916f197775bdbb9105dac62d2e1f3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 5 locations): packages/ui/src/components/Explorer.tsx:79 \u00B7 packages/ui/src/components/PackageDetail.tsx:24 \u00B7 packages/ui/src/components/PackageInstallFlow.tsx:116 \u00B7 packages/ui/src/components/RequirementsPanel.tsx:14 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 5 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/ui/src/components/Explorer.tsx"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d55b1d72c8b8328d42190f0c8318ed493cfb5a3ac8867b0b24ddc0ad84ae3c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/ui/src/components/feed/cards/storytelling-cards.tsx:262 \u00B7 packages/ui/src/components/feed/cards/storytelling-cards.tsx:458 \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/ui/src/components/feed/cards/storytelling-cards.tsx"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1cd80958058080311ec3a972e0c3e4e4d98c5af229c4b4459a15226393fa6ec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/ui/src/components/lab/VellumBackgroundLab.tsx:346 \u00B7 packages/ui/src/components/lab/VellumBackgroundLab.tsx:542 \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/ui/src/components/lab/VellumBackgroundLab.tsx"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b18e076f873d3daad9fdfded44a6cf566c0143751f11064d674bef300070ba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): packages/ui/src/components/project/ProjectTreeView.tsx:191 \u00B7 packages/ui/src/components/project/ScopePages.tsx:561 \u00B7 packages/ui/src/components/project/WorkspacePortfolioPanel.tsx:200 \u2014 the 3 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. 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/ui/src/components/project/ProjectTreeView.tsx"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"8751e17f4bc967379369f5d248dbc744bcf5a0efd8e1222d5ece8eda3708fb12"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/ui/src/components/slices/tabs/TestsVerificationTab.tsx:143 \u00B7 packages/ui/src/components/slices/tabs/TestsVerificationTab.tsx:184 \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/ui/src/components/slices/tabs/TestsVerificationTab.tsx"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f76e5c4a1d9fc738e74f645bd9c2b28a704b78547fd14bfe29bc04aa6481a98"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/ui/src/hooks/mutations.ts:219 \u00B7 packages/ui/src/hooks/mutations.ts:240 \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/ui/src/hooks/mutations.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"e05ff178b3a9074d994e6a23c9a16a11be64cc3f4ff63b67f8d6061ac954c2d1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/ui/src/hooks/useContextPackLibrary.ts:74 \u00B7 packages/ui/src/hooks/useSlices.ts:110 \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/ui/src/hooks/useContextPackLibrary.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"20be019a7b606ab004ebe676ddc3f08856f1d66c2c6a89fb8abc9aa5690f40ee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/ui/src/hooks/useReview.ts:236 \u00B7 packages/ui/src/hooks/useReview.ts:250 \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/ui/src/hooks/useReview.ts"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"39fb467eb481d4a9f258d89be467b81aa7862e40919d11943990cb52b6de07b0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/ui/src/hooks/useSettings.ts:88 \u00B7 packages/ui/src/hooks/useSettings.ts:105 \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/ui/src/hooks/useSettings.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4405414bfd421c317e9934bf38eea8c9792a7ad18806cb2724e1c7b6ffade6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/ui/twin/fetch-stub.ts:66 \u00B7 packages/ui/twin/fetch-stub.ts:83 \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/ui/twin/fetch-stub.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"8066a7cacabbfac4c29bf39068e1f993f6aafc280f534059c08a945a4f472f59"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/internal-leak-scanner.mjs:67 \u00B7 scripts/mirror-skills.mjs:741 \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":"scripts/internal-leak-scanner.mjs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"9934ac29558f9a0540d4ed3ed23b108d41f8665cee7697dc1716da5a9594f037"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/cli/src/bin-wrapper.ts:21 \u00B7 packages/cli/src/index.ts:281 \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/bin-wrapper.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c8cb64d985b4fe2943e5f29f010564de064ff892f12346192b444d7a67fa51"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/cli/src/commands/add.ts:145 \u00B7 packages/cli/src/commands/fork.ts:98 \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/commands/add.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"397b8ef93f7aea468ea8732a6f18c2506b0a22bf46ecba36741bf5cac5527740"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): packages/cli/src/commands/agent-image.ts:137 \u00B7 packages/cli/src/commands/context.ts:548 \u00B7 packages/cli/src/commands/plugin.ts:173 \u2014 the 3 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. 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/commands/agent-image.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6e763e6fbc4b88fa22eb1930747303b4dac632518da954cc538b456a957eac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/cli/src/commands/attach.ts:140 \u00B7 packages/cli/src/commands/unclaim.ts:33 \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/commands/attach.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba1aaf4cf7f046d8c1241cdf912f7cafd8ecc43b96f3fa81465a559c08635e9e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): packages/cli/src/commands/bind.ts:7 \u00B7 packages/cli/src/commands/chatroom.ts:57 \u2014 the two spans are one implementation copied and then locally edited \u2014 83 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/commands/bind.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34d6d84e3ba09997e8c2d59bca619b97a3af01588b17a58bcd8c47c5460f663"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): packages/cli/src/commands/bind.ts:7 \u00B7 packages/cli/src/commands/discover.ts:7 \u2014 the two spans are one implementation copied and then locally edited \u2014 99 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/commands/bind.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ccbb51650f4b01d8176257fb926ef35049bfb3218f231543318881b5abf21b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): packages/cli/src/commands/bind.ts:7 \u00B7 packages/cli/src/commands/launch.ts:70 \u2014 the two spans are one implementation copied and then locally edited \u2014 101 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/commands/bind.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"cccde12301700dbf026b5247203a5fcbe7b4cbd769186835043bed116909ba78"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): packages/cli/src/commands/bind.ts:7 \u00B7 packages/cli/src/commands/unclaim.ts:7 \u2014 the two spans are one implementation copied and then locally edited \u2014 101 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/commands/bind.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"e19de4ad7f8024996da3beae3473a9c75e17a2b9994ff672b308e48916c31057"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/cli/src/commands/bootstrap.ts:29 \u00B7 packages/cli/src/commands/requirements.ts:10 \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/commands/bootstrap.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"922d198ea027b9b87a2cc925923b5e22e5eef163c69c8d88da01a32340b0e27d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): packages/cli/src/commands/chatroom.ts:57 \u00B7 packages/cli/src/commands/discover.ts:7 \u2014 the two spans are one implementation copied and then locally edited \u2014 83 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/commands/chatroom.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"9beddb9175a1309381d3e18c31ba01e2bff2dd745d7ac2f768a9284c800e8ebf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): packages/cli/src/commands/chatroom.ts:57 \u00B7 packages/cli/src/commands/launch.ts:70 \u2014 the two spans are one implementation copied and then locally edited \u2014 83 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/commands/chatroom.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c81bd7f40c3bd8b9341c733521190c2d2dfbf78875ed56221621c295a7d158"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): packages/cli/src/commands/chatroom.ts:57 \u00B7 packages/cli/src/commands/unclaim.ts:7 \u2014 the two spans are one implementation copied and then locally edited \u2014 83 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/commands/chatroom.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"944b8c9f172b59d3d517912deb06841e844afa25dcbbdae5e42100210e581c38"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/cli/src/commands/create.ts:43 \u00B7 packages/cli/src/commands/grow.ts:125 \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/commands/create.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c5d53a54b53bf32f7e8dca7414b2aff6030fa647595efa6ba69a2b9820da20"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/cli/src/commands/daemon.ts:240 \u00B7 packages/cli/src/commands/up.ts:321 \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/commands/daemon.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72389dd0f89cb1c67653e503f84f9ca23f99e771413dabaaf01c2218c079824"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/cli/src/commands/daemon.ts:313 \u00B7 packages/cli/src/commands/daemon.ts:327 \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/commands/daemon.ts"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6adec39d03dff7de8a53528e868b97cdccb68f6b642cf43bf97cc208aede4eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): packages/cli/src/commands/discover.ts:7 \u00B7 packages/cli/src/commands/launch.ts:70 \u2014 the two spans are one implementation copied and then locally edited \u2014 99 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/commands/discover.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"e93ad2221c9f547ad2fceb576bd84b1510f3e914bf935277f750f8c6357c2678"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): packages/cli/src/commands/launch.ts:70 \u00B7 packages/cli/src/commands/unclaim.ts:7 \u2014 the two spans are one implementation copied and then locally edited \u2014 101 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/commands/launch.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbbc8a2076b232618b2c353c6de55fef86ba3b100aabd71cedce28a41a09461c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/cli/src/commands/mcp.ts:90 \u00B7 packages/cli/src/commands/send.ts:377 \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/commands/mcp.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"d072563eb8ab691314918c30992732e28e4da7dbf62174aa1615f0b68668b01b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/cli/src/commands/package.ts:211 \u00B7 packages/cli/src/commands/snapshot.ts:43 \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/commands/package.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc94b56a21e0ec489390939793bbe11592d0dd72097a860e0f9bb5e1b682a9e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): packages/cli/src/commands/project.ts:229 \u00B7 packages/cli/src/commands/stream.ts:209 \u00B7 packages/cli/src/commands/terminal.ts:282 \u2014 the 3 copies are spread across 3 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/commands/project.ts"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4be636db2e84bae04232b4a40548cf9fad112473f2bfcd74a786cde65a168e1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): packages/cli/src/commands/ps.ts:1193 \u00B7 packages/cli/src/commands/ps.ts:1428 \u00B7 packages/cli/src/commands/ps.ts:1833 \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/commands/ps.ts"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"a10f316d4f7a6bde8697a18a68fd6aefc59c51a1c7ed7c0d3286f372f1a5cd4d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/cli/src/commands/ps.ts:1209 \u00B7 packages/cli/src/commands/ps.ts:1845 \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/commands/ps.ts"},"region":{"startLine":1209}}}],"partialFingerprints":{"codehealthFindingId/v1":"564bf6219bc076d54bc92cc55247226640d482125b2088d3f775be67b55b2de7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/cli/src/commands/ps.ts:1315 \u00B7 packages/cli/src/commands/ps.ts:1576 \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/commands/ps.ts"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"f74d457dadf3a51006ee2306e4a541e4e08cfcfe98a8bd42da1455a9f50f7414"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): packages/cli/src/commands/rig-mode.ts:286 \u00B7 packages/cli/src/commands/rig-mode.ts:320 \u00B7 packages/cli/src/commands/rig-mode.ts:547 \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/commands/rig-mode.ts"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"544cc12a1654100d8cbee8ef9ae5f2bac42a9ebbd840dbcce749fd01c07a2c7a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/cli/src/commands/scope.ts:1842 \u00B7 packages/cli/src/commands/scope.ts:1907 \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/commands/scope.ts"},"region":{"startLine":1842}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c847e94435b980f3f9e7dbd47815d5585eae5801a7452c9be2a653cae5057b6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/cli/src/commands/seat.ts:804 \u00B7 packages/cli/src/commands/seat.ts:1955 \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/commands/seat.ts"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e4e5f5f5c9c2db4dfefb54a82423e10609497a9a7e8e43dc874c3e48c3bd71"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/cli/src/commands/send.ts:476 \u00B7 packages/cli/src/commands/transcript.ts:61 \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/commands/send.ts"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7e568b9e94016ddc205bec168fa8d3b2ef8ba35daa36231aa0d2af0822b33e5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/cli/src/commands/slack.ts:233 \u00B7 packages/cli/src/commands/slack.ts:373 \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/commands/slack.ts"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8544f66c7d9104bb1ae63b12e362b850b4d170a491c287a453940a57b83021c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/cli/src/commands/specs.ts:65 \u00B7 packages/cli/src/lib/context-install.ts:31 \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/commands/specs.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"597cbee285f67e5c9635e6474dc0f0d916beef6483b0a59fea8d81c8a2fcbe34"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/cli/src/commands/specs.ts:432 \u00B7 packages/cli/src/commands/specs.ts:465 \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/commands/specs.ts"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"126ec19dfb93f82382d4ef4699057acc2269ce5e7b3acb436969895eb364c408"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/cli/src/commands/start.ts:93 \u00B7 packages/cli/src/commands/up.ts:24 \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/commands/start.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea0ca9b42a53dbe264db160632c46208000d6d590a833e660616f0b7d8ccfa5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/cli/src/commands/start.ts:572 \u00B7 packages/cli/src/commands/up.ts:770 \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/commands/start.ts"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ecfb9206b11a3e53cd4f8e9c7a6811c8ef90bd691eca5eff01cae86092f8f40"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/cli/src/commands/watchdog.ts:211 \u00B7 packages/cli/src/commands/watchdog.ts:364 \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/commands/watchdog.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"431f1a4ed2919d7bb925dd648df469ab80aab927023aef1a75cdd702bfd5a9e1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): packages/cli/src/cross-host-target.ts:82 \u00B7 packages/cli/src/cross-host-target.ts:122 \u2014 the two spans are one implementation copied and then locally edited \u2014 62 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/cli/src/cross-host-target.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"d68f8d4ff8c256e8689c642eca2eca2683043e22a96cea67f24693ad2d159520"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/cli/src/mcp-server.ts:2279 \u00B7 packages/cli/src/mcp-server.ts:2304 \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/mcp-server.ts"},"region":{"startLine":2279}}}],"partialFingerprints":{"codehealthFindingId/v1":"0226b477ac677f9448adb0604cd6662e8187537f9aacdd1115bb40a99d5ef796"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): packages/daemon/scripts/gen-control-plane-json.mjs:286 \u00B7 scripts/check-internal-leak-guard.mjs:38 \u00B7 scripts/check-substance-gate.mjs:118 \u2014 the 3 copies are spread across 3 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/daemon/scripts/gen-control-plane-json.mjs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02cb468e68f473492a6c7c256755cf97d4da71ee3993cf4cd15df3f0149840e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): packages/daemon/src/adapters/bounded-probe-exec.ts:143 \u00B7 packages/daemon/src/domain/provider/claude-auth-status-reader.ts:135 \u2014 the two spans are one implementation copied and then locally edited \u2014 84 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/daemon/src/adapters/bounded-probe-exec.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb38b8c93974c9b504d68a550906def923c0bdbbf146f888fda9363775b57fc4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/daemon/src/adapters/claude-code-adapter.ts:943 \u00B7 packages/daemon/src/adapters/codex-runtime-adapter.ts:1468 \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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be3545fc6d8880abfc9dfb08632794fad6ed18d2c8cf01456cf024f47024db4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/daemon/src/adapters/claude-code-adapter.ts:962 \u00B7 packages/daemon/src/adapters/codex-runtime-adapter.ts:1493 \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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"995e3dbabbaf516a65cf26286a137387a11c5deaf983ff0298886a69bba28fbe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/daemon/src/adapters/claude-code-adapter.ts:1003 \u00B7 packages/daemon/src/adapters/codex-runtime-adapter.ts:1530 \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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f7727cb69265397b2073ce2410d16178d7f8d40bb2f41e730d53b93b3c1654"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): packages/daemon/src/adapters/cmux.ts:155 \u00B7 packages/daemon/src/adapters/cmux.ts:179 \u00B7 packages/daemon/src/adapters/cmux.ts:218 \u00B7 packages/daemon/src/adapters/cmux.ts:262 \u2014 all 4 copies are in the same file, 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/daemon/src/adapters/cmux.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9744d535fadf6b5f87d7804d70dfd02586aab03c331568f1a103869ac2bc60c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): packages/daemon/src/adapters/tmux.ts:1053 \u00B7 packages/daemon/src/adapters/tmux.ts:1149 \u2014 the two spans are one implementation copied and then locally edited \u2014 91 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/daemon/src/adapters/tmux.ts"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"be547b35f7254326a6a3a3335676ec5c1fc8424673ce280a1bf70bb2082a04ea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/daemon/src/domain/active-occupant.ts:169 \u00B7 packages/daemon/src/domain/active-occupant.ts:190 \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/daemon/src/domain/active-occupant.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"a63540d68cfec21ab9f7dd6408d4ac3fb4ec8555967859c1ecc2a310a5bf4e5f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/daemon/src/domain/ask-service.ts:147 \u00B7 packages/daemon/src/domain/ask-service.ts:198 \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/daemon/src/domain/ask-service.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f404e5970186efaefd2df1002790c36647143ca7e728b17101f253689f271a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/daemon/src/domain/bundle-audit.ts:56 \u00B7 packages/daemon/src/domain/bundle-audit.ts:86 \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/daemon/src/domain/bundle-audit.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e919017911f4cf77e2c6f976b65636dcb582f98aebcd81d6ab26f2ffa0eff5b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): packages/daemon/src/domain/classification-attempts.ts:108 \u00B7 packages/daemon/src/domain/project-classifier.ts:117 \u00B7 packages/daemon/src/domain/queue-repository.ts:722 \u2014 the 3 copies are spread across 3 files, and each CITED SPAN is a SPECIALISATION DECLARATION \u2014 a type whose \u0060extends\u0060 clause names a base and whose body hands that base its own values through \u0060super(\u2026)\u0060. The shared module this dimension usually asks you to extract already exists: it is that base, every one of these sites already reaches it, and the \u0060super(\u2026)\u0060 call this row matched on is where each site passes its differences in. So do not read this as an extract-a-helper row \u2014 there is no missing helper, and what is left at each site is the declaration of one distinct specialisation, which cannot be deleted without deleting the thing it declares. Read what actually differs between the spans, because two different answers follow. Where the sites differ only in the values they hand the base \u2014 a type argument, a service, an alias, a cache \u2014 the repetition is a TEMPLATE, and the only moves that collapse it are to generate these declarations from the set they enumerate or to replace the repeated construction with one factory each site calls with its own values; where that set is the point, each site pinning one distinct thing, the repetition IS the enumeration and there is nothing to remove. Where instead a span carries logic OUTSIDE the delegation that is the same at every site, that logic is the part to move, and its home is the base type rather than a new module. Reported because the copies still drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/classification-attempts.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d4f8d2ac5f007df2a8b8a482b5f955d20dc788ac962692342f5e32cb9dc3ce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): packages/daemon/src/domain/compaction-restore-notice.ts:59 \u00B7 packages/daemon/src/domain/compaction-restore-notice.ts:89 \u2014 the two spans are one implementation copied and then locally edited \u2014 109 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/daemon/src/domain/compaction-restore-notice.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be0a8cd281df83ea05ecd61a27da154626285c749fb118f0001c1645b482315"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/daemon/src/domain/inbox-handler.ts:99 \u00B7 packages/daemon/src/domain/outbox-handler.ts:402 \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/daemon/src/domain/inbox-handler.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"450fd1e5f768b3b88907451f612e396c48e97278a778b00f5a3212f317559ae6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): packages/daemon/src/domain/instance-initialization.ts:67 \u00B7 packages/daemon/src/domain/workspace/default-workspace-scaffold.ts:147 \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":"packages/daemon/src/domain/instance-initialization.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"49680224c731d777e5994439a5dfae1ad61233dbfe19fca46aa557acce59b738"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): packages/daemon/src/domain/launch-wrapper.ts:59 \u00B7 packages/daemon/src/domain/process-limits.ts:66 \u2014 the two spans are one implementation copied and then locally edited \u2014 62 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/daemon/src/domain/launch-wrapper.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"233ec4fb93d2b84e26af903238f2a31fa7e842abc6773ded0a6231d6a4bad125"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/daemon/src/domain/mission-control/mission-control-write-contract.ts:345 \u00B7 packages/daemon/src/domain/mission-control/mission-control-write-contract.ts:548 \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/daemon/src/domain/mission-control/mission-control-write-contract.ts"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"da16a1f5f798fd46a43f2225e9cc706d76bec00ac10631a8371d2eb2b1a24e78"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): packages/daemon/src/domain/native-process-lineage.ts:566 \u00B7 packages/daemon/src/domain/seat-restart-in-place.ts:1035 \u2014 the two spans are one implementation copied and then locally edited \u2014 92 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/daemon/src/domain/native-process-lineage.ts"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db45ae3e8d3272d1532a2a32e8321991826035c4d24478d7edf846a0e86f794"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): packages/daemon/src/domain/outbox-handler.ts:631 \u00B7 packages/daemon/src/domain/outbox-handler.ts:647 \u00B7 packages/daemon/src/domain/outbox-handler.ts:671 \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/daemon/src/domain/outbox-handler.ts"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"921cc391e737374f141f281184b14e1bd3b0ae26b7b7c25b77d5c098a06c8c36"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/daemon/src/domain/policies/edge-artifact-required.ts:66 \u00B7 packages/daemon/src/domain/policies/workflow-keepalive.ts:95 \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/daemon/src/domain/policies/edge-artifact-required.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11eadd2e504a1c0a00e85fb5e2c0f71d3db0bd1d3180988093731a69a683d70"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/daemon/src/domain/queue-repository.ts:5362 \u00B7 packages/daemon/src/domain/queue-repository.ts:5458 \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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":5362}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d39b1cca19bc965f430d8c3733219789e75a1b965634a33d9143a23bed06e2e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/daemon/src/domain/queue-retention.ts:607 \u00B7 packages/daemon/src/domain/queue-retention.ts:622 \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/daemon/src/domain/queue-retention.ts"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"513a124358d0f58d210ffbf45d1c5038f820c751999a7b40d562b522182c5d44"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/daemon/src/domain/restore-preconditions.ts:164 \u00B7 packages/daemon/src/domain/restore-preconditions.ts:176 \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/daemon/src/domain/restore-preconditions.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a681fcc23fba2dc4336a8ce9c4cb47281299f0938f87380c250c4097030974"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/daemon/src/domain/rig-teardown.ts:150 \u00B7 packages/daemon/src/domain/rig-teardown.ts:265 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/rig-teardown.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae3ac214614dde64e683b4a9f41f415f0163a38a9aa3ddb2d1650f267a7e628"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/daemon/src/domain/rigspec-instantiator.ts:2655 \u00B7 packages/daemon/src/domain/rigspec-instantiator.ts:3011 \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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":2655}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec4f5201c6d06a5c474fce97ae0ea352ca2aca7904d7fd517e36f481b6df755"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/daemon/src/domain/seat-handover-service.ts:785 \u00B7 packages/daemon/src/domain/seat-handover-service.ts:869 \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/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1738b0782d6eba65116329b9ec3a439981896249cc283c24eef3ac42cc58b6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/daemon/src/domain/seat-runtime-home-record.ts:319 \u00B7 packages/daemon/src/domain/seat-runtime-home-record.ts:355 \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/daemon/src/domain/seat-runtime-home-record.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee6e2117071b3e5a744a6ddfd8db01a41b4b01fad69952d0d725728f8303555"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/daemon/src/domain/self-attach-service.ts:126 \u00B7 packages/daemon/src/domain/self-attach-service.ts:164 \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/daemon/src/domain/self-attach-service.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"73285f7729a83982bc83413f528a18d2ae56fe76698f71f028f01e4d316f50ce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/daemon/src/domain/session-transport.ts:3137 \u00B7 packages/daemon/src/domain/session-transport.ts:3735 \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/daemon/src/domain/session-transport.ts"},"region":{"startLine":3137}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b7a460c6f1f0a671d35f97640bac146be210bbaff03058017e30daf900843e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/daemon/src/domain/slices/slice-indexer.ts:1086 \u00B7 packages/daemon/src/domain/slices/slice-indexer.ts:1116 \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/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"1296d64ef32ab28042ede4896ce21b282b62648040e4df5b3ca6c5fdd200b31a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): packages/daemon/src/domain/terminal/herdr-follow-view.ts:111 \u00B7 packages/daemon/src/domain/terminal/herdr-viewer.ts:215 \u2014 the two spans are one implementation copied and then locally edited \u2014 78 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/daemon/src/domain/terminal/herdr-follow-view.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"877af7d73907c96e6e774dcde9f43738b65f6768016f1b76c6471bb29a283fc0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/daemon/src/domain/transcript-store.ts:429 \u00B7 packages/daemon/src/domain/transcript-store.ts:442 \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/daemon/src/domain/transcript-store.ts"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b15932d69d0f2518ce049b74a60f2b7d6e864a45c164e6965f12967b491304f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/daemon/src/domain/workflow-spec-cache.ts:290 \u00B7 packages/daemon/src/domain/workflow-spec-cache.ts:320 \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/daemon/src/domain/workflow-spec-cache.ts"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6515c5a6e8b7c4aa6621d912c95ef36278bb6e935a8b2f6b6cd6160216ce3cd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): packages/daemon/src/routes/bootstrap.ts:137 \u00B7 packages/daemon/src/routes/discovery.ts:53 \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/daemon/src/routes/bootstrap.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"984fbcfde06db51d00a86a4914488d0f88894346ca8af5aae726bae6bf3c7293"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/daemon/src/routes/queue.ts:389 \u00B7 packages/daemon/src/routes/views.ts:31 \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/daemon/src/routes/queue.ts"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"af412a90718a755bd428336857a0f4032f486da10920f0625ad325a67c560541"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): packages/daemon/src/routes/queue.ts:1032 \u00B7 packages/daemon/src/routes/queue.ts:1115 \u00B7 packages/daemon/src/routes/queue.ts:1212 \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/daemon/src/routes/queue.ts"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8c20f949360ede42f4661c411825f9f5dd8a4e5e3529c6f3a614a330a4369c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): packages/daemon/src/routes/restore-check.ts:72 \u00B7 packages/daemon/src/routes/restore-check.ts:83 \u00B7 packages/daemon/src/routes/restore-check.ts:101 \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/daemon/src/routes/restore-check.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67741cdaf303564e047a3aa40a1c80ba86af902148a528ba3b5af22a8139902"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/daemon/src/routes/rigspec.ts:133 \u00B7 packages/daemon/src/routes/rigspec.ts:253 \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/daemon/src/routes/rigspec.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"c787cf4d38e1d441989e578aff0b219636d59cdcbaf80a921ff2ac370d7fdcf1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/daemon/src/routes/scopes.ts:110 \u00B7 packages/daemon/src/routes/scopes.ts:124 \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/daemon/src/routes/scopes.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc990b6fac8fbb55461d051fe26bb67da2df42eb966fc2a9beb3faabc1f67646"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/daemon/src/routes/seat.ts:419 \u00B7 packages/daemon/src/routes/seat.ts:745 \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/daemon/src/routes/seat.ts"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3403ff27c398c85e9c4b15dd29afe8256cf4aa7ed0e4c2297394cad21922e79"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): packages/daemon/src/routes/sessions.ts:308 \u00B7 packages/daemon/src/routes/sessions.ts:539 \u00B7 packages/daemon/src/routes/snapshots.ts:109 \u2014 the 3 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/daemon/src/routes/sessions.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7cea9614e269972190bde7dcfc552bc875d073a9a64973f25d5ad4753f7b83d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/daemon/src/routes/sessions.ts:491 \u00B7 packages/daemon/src/routes/sessions.ts:606 \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/daemon/src/routes/sessions.ts"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"112d43601e84af05e3c562601373fbabcb0600c5dcbdd41a3d0c014f1386a20a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/daemon/src/routes/views.ts:35 \u00B7 packages/daemon/src/routes/watchdog.ts:72 \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/daemon/src/routes/views.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79f7cec55edcd816614f7d3149195c9951c59697c89874eee2e3a9619341658"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/daemon/src/routes/views.ts:53 \u00B7 packages/daemon/src/routes/watchdog.ts:175 \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/daemon/src/routes/views.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"f996700ea46cbbbcd7226c05f7651ec735f3dbf5c5e16a1e9ae520c66f758c19"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/ui/src/components/mission-control/missionControlAuth.ts:7 \u00B7 packages/ui/src/components/mission-control/missionControlAuth.ts:23 \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/ui/src/components/mission-control/missionControlAuth.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"414c019e2b7f7c216b5c956a029f2d9dee50ce68707e2b0220941d6a15f3c268"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): packages/ui/src/components/topology/TerminalLauncher.tsx:304 \u00B7 packages/ui/src/hooks/useHosts.ts:154 \u2014 the two spans are one implementation copied and then locally edited \u2014 62 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/ui/src/components/topology/TerminalLauncher.tsx"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d9f845a28ab0cee92e5f52a0a2ae74fdfd53f8b98b67a2504ae3004f8076285"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/ui/src/components/topology/TopologyTreeView.tsx:109 \u00B7 packages/ui/src/components/topology/TopologyTreeView.tsx: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/topology/TopologyTreeView.tsx"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4a96ad3922b51275f3cf756fb28c56112fa9f7e98932340463bce3379abd622"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/ui/src/hooks/useBootstrap.ts:42 \u00B7 packages/ui/src/hooks/useBundles.ts:44 \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/ui/src/hooks/useBootstrap.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"62072744b68dfab631001c4d6ce5433b0e98f7fac08d8ce3bf425a2283541926"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/ui/src/hooks/useDaemonVersion.ts:15 \u00B7 packages/ui/src/hooks/useSteering.ts:103 \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/ui/src/hooks/useDaemonVersion.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"67928b9fb556acd48f9c59c20b6a6722faceda4e96a49e4512deaa45852202eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/cli/src/commands/agent-image.ts:196 \u00B7 packages/cli/src/commands/context.ts:605 \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/commands/agent-image.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b7ee0cafae07920d8918cfc3e241091ada770a2bf4c2ae4cab67e6c08abd9f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): packages/cli/src/commands/auth.ts:93 \u00B7 packages/cli/src/commands/auth.ts:125 \u00B7 packages/cli/src/commands/auth.ts:147 \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/commands/auth.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"59eba41b81f3903f67e47b6d3a75195c4badd748d125b0cbaf257409412e595d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/cli/src/commands/bootstrap.ts:110 \u00B7 packages/cli/src/commands/bootstrap.ts:144 \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/commands/bootstrap.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b072d609ed9bce59fc0349c0b9de0fd4c876742301495e57c27c1a14e48bb48"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/cli/src/commands/broadcast.ts:140 \u00B7 packages/cli/src/commands/whoami.ts:388 \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/commands/broadcast.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"520d7d77efda23aaee8e49b6c8918eb5de8698cb38d00b2f373a08be3e1fc74f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/cli/src/commands/bundle.ts:67 \u00B7 packages/cli/src/commands/package.ts:10 \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/commands/bundle.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f03cfdae3d42462f7b3ab129d0573f78fff1c1a4a31342f49d9a24941b1293d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/cli/src/commands/compact-plan.ts:556 \u00B7 packages/cli/src/commands/restore-check.ts:376 \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/commands/compact-plan.ts"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cef6a666f5a5dc506b7862297009d7a2b4f0a0952827dbeaab7c92f5de141d7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): packages/cli/src/commands/config.ts:197 \u00B7 packages/cli/src/commands/config.ts:210 \u2014 the two spans are one implementation copied and then locally edited \u2014 65 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/cli/src/commands/config.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2796738f936297ea5b4d45ea311c65880df1e301a787e5d8986e852a1a71cbf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/cli/src/commands/context.ts:368 \u00B7 packages/cli/src/commands/context.ts:390 \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/commands/context.ts"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"555d0cb3965bb12a9e9251718cd7c06a7e3680aca3d6ceb6887c9c8ee5e6c4e9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/cli/src/commands/context.ts:611 \u00B7 packages/cli/src/commands/context.ts:683 \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/commands/context.ts"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f2d273bc014dfcabff6bea7fdc84e92a501a696a29dd072af3b57a1c570163f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/cli/src/commands/context.ts:649 \u00B7 packages/cli/src/commands/context.ts:665 \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/commands/context.ts"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"258c2b933f6e49e050dec47481a90401520e99f2f4bfee647a1d8882dcc6428b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): packages/cli/src/commands/grow.ts:66 \u00B7 packages/cli/src/commands/policy.ts:155 \u00B7 packages/cli/src/commands/skill.ts:171 \u2014 the 3 copies are spread across 3 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/commands/grow.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad36ef7d29108474ab91a315b159aa49978070278d4c3c516166e18585891cac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): packages/cli/src/commands/heartbeat.ts:308 \u00B7 packages/daemon/src/domain/workspace/frontmatter-validator.ts:92 \u2014 the two spans are one implementation copied and then locally edited \u2014 59 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/commands/heartbeat.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ee1fe78af119597c631db3d9a30fb8870a0daadf84da51919d3a3c007920f4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/cli/src/commands/host.ts:148 \u00B7 packages/cli/src/commands/host.ts:822 \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/commands/host.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"b954ad45b081fbeb360562d75894f89c245f82349c85212231f1e9c170889619"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/cli/src/commands/host.ts:962 \u00B7 packages/cli/src/commands/seat.ts:1152 \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/commands/host.ts"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c76541627441a3201cf88c1be301f55a981174299824f613f3765a11a6354ad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): packages/cli/src/commands/mcp.ts:155 \u00B7 packages/cli/src/commands/specs.ts:342 \u2014 the two spans are one implementation copied and then locally edited \u2014 54 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/commands/mcp.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"7658839be0484a5daf14dc4f915b584981b6fc153260fdbab548c78cdf3b07ee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): packages/cli/src/commands/project.ts:366 \u00B7 packages/cli/src/commands/stream.ts:208 \u00B7 packages/cli/src/commands/stream.ts:293 \u00B7 packages/cli/src/commands/watchdog.ts:313 \u2014 the 4 copies are spread across 3 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/commands/project.ts"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6539f014f716921aec7fdec80919701a8e934ff2de39a5ccb205edad26c808c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/cli/src/commands/ps.ts:1395 \u00B7 packages/cli/src/commands/ps.ts:1967 \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/commands/ps.ts"},"region":{"startLine":1395}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d54cea47df03ec73d1f2eea78dc8f3af37b80194c58322b080f9bf95a4ab6f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/cli/src/commands/queue.ts:2171 \u00B7 packages/cli/src/commands/queue.ts:2262 \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/commands/queue.ts"},"region":{"startLine":2171}}}],"partialFingerprints":{"codehealthFindingId/v1":"608feed47f071c6bbbd4bde55ab0ff1714757035a095408fa6ad1e2ce569bc62"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/cli/src/commands/rig-mode.ts:93 \u00B7 packages/cli/src/commands/workspace.ts:38 \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/commands/rig-mode.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a0b83c560a405022e5198d4b92c1abc932859b2372bf0f99f3fad1dedd39cb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/cli/src/commands/rig-mode.ts:323 \u00B7 packages/cli/src/commands/rig-mode.ts:550 \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/commands/rig-mode.ts"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca93c47146c826454df9080110a164f0f7fd01f54872803e57035c687746eae4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): packages/cli/src/commands/seat.ts:556 \u00B7 packages/cli/src/commands/seat.ts:1294 \u00B7 packages/cli/src/commands/seat.ts:1499 \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/commands/seat.ts"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb28dc399b547e86450f6a0253ae743d73a69fd44dcccfbef583d40f0fe785e4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/cli/src/commands/seat.ts:1226 \u00B7 packages/cli/src/commands/seat.ts:1450 \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/commands/seat.ts"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b826d84d5539457ccdb91531479f0d5f03805aa4611af9a195432cd03a74af"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): packages/cli/src/commands/stream.ts:293 \u00B7 packages/cli/src/commands/watchdog.ts:313 \u00B7 packages/cli/src/commands/watchdog.ts:325 \u2014 the 3 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/commands/stream.ts"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b41768f60378b337d2c74a9a2e0b4b8845a42c86d94b9ded39eda142d66d9d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/cli/src/commands/watchdog.ts:22 \u00B7 packages/cli/src/commands/workflow.ts:35 \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/commands/watchdog.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"82cea1768213d87f18fa06f8a4217c5047726f596f111c806ac58e56f1026b8a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): packages/cli/src/commands/workflow-render.ts:180 \u00B7 packages/cli/src/commands/workflow-render.ts:378 \u2014 the two spans are one implementation copied and then locally edited \u2014 97 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/cli/src/commands/workflow-render.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c6d7dd453ea8fb6fd9b7f9188239f28d18ee011d5596454c27478910617ec1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): packages/cli/src/commands/workflow-render.ts:112 \u00B7 packages/daemon/src/domain/workflow-projector.ts:68 \u2014 the two spans are one implementation copied and then locally edited \u2014 69 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/commands/workflow-render.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ed36ed91f535869fb21d08d2fcd8381c29aa034e7ce71244b43817ef5e0231"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): packages/cli/src/commands/workflow.ts:284 \u00B7 packages/cli/src/commands/workflow.ts:949 \u00B7 packages/cli/src/commands/workflow.ts:1015 \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/commands/workflow.ts"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19063e83e71d4c94c16c0ecdf44d59e529d2fde8685097e5bf52094c09cb0ed"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/cli/src/config-store.ts:1721 \u00B7 packages/daemon/src/domain/user-settings/settings-store.ts:1471 \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/config-store.ts"},"region":{"startLine":1721}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c74bf7bdbb8fe84abbb99e82935cd1f33bbdf489bc5f032689ad1952a1cecc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/cli/src/host-selection.ts:24 \u00B7 packages/cli/src/host-selection.ts:46 \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/host-selection.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cfe1c9849ad295373027a29919e6db7888810ac706cc4245dd2bc15c351d315"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/cli/src/lib/path-safety.ts:7 \u00B7 packages/daemon/src/domain/path-safety.ts:7 \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/lib/path-safety.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"1707c0755faf088dc08a68bbac15eeaddd8efb5c7f8570fe5dee6f3510f55eaf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/cli/src/lib/scope/scope-fs.ts:186 \u00B7 packages/daemon/src/domain/scope/scope-approve.ts:488 \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/lib/scope/scope-fs.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3efe7758e54b38e070b1d78b0ac7bd3660e48f091b570bef34f636f25d639c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/cli/src/lib/work-install.ts:446 \u00B7 packages/cli/src/lib/work-install.ts:473 \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/lib/work-install.ts"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82c4d1daa9209698e3ea7a1b43d00123e0bd13387134c54bf6cd96a76ed0390"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/cli/src/mcp-server.ts:1948 \u00B7 packages/cli/src/mcp-server.ts:1992 \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/mcp-server.ts"},"region":{"startLine":1948}}}],"partialFingerprints":{"codehealthFindingId/v1":"092755a0ccdf6e1c94c6c04905c19fb82793c193c2d6d919fc6a473514fedd5e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/cli/src/mcp-server.ts:2257 \u00B7 packages/cli/src/mcp-server.ts:2609 \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/mcp-server.ts"},"region":{"startLine":2257}}}],"partialFingerprints":{"codehealthFindingId/v1":"45db17670e829f153cbec3586521735ee738686ae0bfaf7a0e355def53e41cae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/cli/src/release-surface/generate.ts:18 \u00B7 packages/ui/twin/capture/twin-capture.ts:47 \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/release-surface/generate.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9adad57003c7481958c7254595916cd839d78b881bfea0cfc39b6891783ca20"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): packages/daemon/src/adapters/cmux.ts:101 \u00B7 packages/daemon/src/adapters/cmux.ts:116 \u00B7 packages/daemon/src/adapters/cmux.ts:291 \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/daemon/src/adapters/cmux.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7608f8736624d1494a1ccfa8e3eaa33e7751a240fedb8cd68106951dcbcaad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/daemon/src/adapters/codex-runtime-adapter.ts:125 \u00B7 packages/daemon/src/adapters/pi-runtime-adapter.ts:39 \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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f786b587c60f1f8be84400491199cf3beee724caa090967101dcddfb8b76c0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): packages/daemon/src/adapters/pi-runner.ts:2483 \u00B7 packages/daemon/src/domain/seat-restart-in-place.ts:1278 \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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":2483}}}],"partialFingerprints":{"codehealthFindingId/v1":"d240d2662822bbafa3b1b8eaebf58cb956c7ff679c5c8906d553fce0a4a02d9b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/daemon/src/adapters/pi-runtime-adapter.ts:645 \u00B7 packages/daemon/src/adapters/stub-runtime-adapter.ts:335 \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/daemon/src/adapters/pi-runtime-adapter.ts"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec757f5edf1d88958687c60758e20dbfe2518905c419eb68b48ca370936909d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/daemon/src/adapters/tmux.ts:2384 \u00B7 packages/daemon/src/adapters/tmux.ts:2476 \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/daemon/src/adapters/tmux.ts"},"region":{"startLine":2384}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6c0ca9c691df1f6f31d30f021d300eb6f2783596a0b8e6455a812fbd8c29a0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/daemon/src/adapters/tmux.ts:2653 \u00B7 packages/daemon/src/adapters/tmux.ts:2880 \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/daemon/src/adapters/tmux.ts"},"region":{"startLine":2653}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c94cac6e92a59b3f8aa43183d1e85707826bf1b38e1d0a1c0d104378ff3e7f4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/daemon/src/domain/agent-images/evidence-guard.ts:148 \u00B7 packages/daemon/src/domain/spec-library-service.ts:76 \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/daemon/src/domain/agent-images/evidence-guard.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b9457bd22a1b6e6bea416c5fa10a35c4aad3bd93260e0a9c6ad3f779350839"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): packages/daemon/src/domain/agent-manifest.ts:46 \u00B7 packages/daemon/src/domain/agent-resolver.ts:323 \u2014 the two spans are one implementation copied and then locally edited \u2014 56 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/daemon/src/domain/agent-manifest.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f07df3478eb53744e82180c08c0a400f4a9b300672628c58dc70602e915f47c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5 locations): packages/daemon/src/domain/bundle-agent-images-router.ts:189 \u00B7 packages/daemon/src/domain/bundle-context-packs-router.ts:255 \u00B7 packages/daemon/src/domain/bundle-plugins-router.ts:126 \u00B7 packages/daemon/src/domain/bundle-skills-router.ts:130 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 5 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/daemon/src/domain/bundle-agent-images-router.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"9946485bbdc6b416ef3d7d094840b4d34d06fea95d13d1746b827bb0c84a1b28"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): packages/daemon/src/domain/bundle-integrity.ts:65 \u00B7 packages/daemon/src/domain/bundle-integrity.ts:160 \u2014 the two spans are one implementation copied and then locally edited \u2014 75 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/daemon/src/domain/bundle-integrity.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0648519b7d89282c31b95ec202b391d2a22f6621f2a8fdfb85232a8074eabef"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/daemon/src/domain/bundle-source-resolver.ts:39 \u00B7 packages/daemon/src/domain/bundle-source-resolver.ts:137 \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/daemon/src/domain/bundle-source-resolver.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bee382c268e52d395bc5bc35788eac20ffeb8f1e319017040339fde14c59d32"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5 locations): packages/daemon/src/domain/bundle-types.ts:175 \u00B7 packages/daemon/src/domain/bundle-types.ts:211 \u00B7 packages/daemon/src/domain/bundle-types.ts:242 \u00B7 packages/daemon/src/domain/bundle-types.ts:274 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 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/daemon/src/domain/bundle-types.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab7045f43748e4719312062cd8ac538e730fe7908f1ed57417b3b1a42f716970"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): packages/daemon/src/domain/classifier-lease-manager.ts:199 \u00B7 packages/daemon/src/domain/inbox-handler.ts:158 \u00B7 packages/daemon/src/domain/inbox-handler.ts:215 \u2014 the 3 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/daemon/src/domain/classifier-lease-manager.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"65aa2b48fad4ba4ce54a47db40a7ff944e09f3f7095a9e66781d8cdab24b5a98"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): packages/daemon/src/domain/context-packs/profile-composer.ts:210 \u00B7 packages/daemon/src/domain/context-packs/profile-composer.ts:272 \u2014 the two spans are one implementation copied and then locally edited \u2014 71 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/daemon/src/domain/context-packs/profile-composer.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3841f668ec5fcea0b0ca3933853754d1f3b503770136f7a801b687a112b2b37"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/daemon/src/domain/gateway/slack/inbound.ts:636 \u00B7 packages/daemon/src/domain/gateway/slack/inbound.ts:713 \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/daemon/src/domain/gateway/slack/inbound.ts"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"994c8eeee92cd4e82066db85cd29705037b9b459544c7473c5b0a2d40ea0b56d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): packages/daemon/src/domain/human-questions.ts:51 \u00B7 packages/daemon/src/domain/human-questions.ts:63 \u2014 the two spans are one implementation copied and then locally edited \u2014 67 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/daemon/src/domain/human-questions.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d0b38f9700e7cee7d3101236af9f35d545195026fba40a1cd59723087736b0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/daemon/src/domain/install-planner.ts:88 \u00B7 packages/daemon/src/domain/install-planner.ts:141 \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/daemon/src/domain/install-planner.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc2a99735bc20f94f2fd4a28cbbb3447035b039d89b610dc05ed60ec2c77ef5d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/daemon/src/domain/native-process-arguments.ts:170 \u00B7 packages/daemon/src/domain/native-process-executable.ts:33 \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/daemon/src/domain/native-process-arguments.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf4c75903dc625b5d0014f0ff37a59a6e0f9c0c3b6de82c3618b9ab9c2a28819"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/daemon/src/domain/native-process-lineage.ts:530 \u00B7 packages/daemon/src/domain/native-process-lineage.ts:748 \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/daemon/src/domain/native-process-lineage.ts"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6b9a0f586c7026e348a02711d8eac016519d65cfefb383dbe461636b67dffa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/daemon/src/domain/package-manifest.ts:273 \u00B7 packages/daemon/src/domain/package-manifest.ts:283 \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/daemon/src/domain/package-manifest.ts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"f38b4d6c35f850b9b65f41e50826e6be1e7824e781a4922c399e42e963bca9de"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/daemon/src/domain/permission-drift.ts:129 \u00B7 packages/daemon/src/domain/permission-drift.ts:140 \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/daemon/src/domain/permission-drift.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"352c094cd13c58acee534dad941c6df17bf04588bda7ef4926febe93f59dd3de"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/daemon/src/domain/queue-pickup.ts:55 \u00B7 packages/daemon/src/domain/queue-stuck-sweep.ts:267 \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/daemon/src/domain/queue-pickup.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb8dacf4ad699a044531c0b95f01da5d672448764a8c15e2cd7e5451092b931"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/daemon/src/domain/queue-repository.ts:5128 \u00B7 packages/daemon/src/domain/queue-repository.ts:5313 \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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":5128}}}],"partialFingerprints":{"codehealthFindingId/v1":"f905c825e796bcb15f7ed92574dfcb3ab8b00c588e11b9dd4047ff83180642e8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/daemon/src/domain/queue-repository.ts:6166 \u00B7 packages/daemon/src/domain/queue-repository.ts:6200 \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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":6166}}}],"partialFingerprints":{"codehealthFindingId/v1":"65160df0e943ffbdc89a10014e0ecac754f3e30d12195c4e54392731fe5d3f7f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): packages/daemon/src/domain/queue-stuck-sweep.ts:257 \u00B7 packages/daemon/src/domain/queue-stuck-sweep.ts:267 \u00B7 packages/daemon/src/domain/queue-wake-ladder.ts:173 \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/daemon/src/domain/queue-stuck-sweep.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"83750a2aaf5a9ddade7a1bf8e998f1656a2350fc868e648dd6b42ea135ed344f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/daemon/src/domain/queue-stuck-sweep.ts:2029 \u00B7 packages/daemon/src/domain/queue-wake-ladder.ts:1046 \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/daemon/src/domain/queue-stuck-sweep.ts"},"region":{"startLine":2029}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5bf448a6bb1ff2c88c8185a2749eecf66a3bfdae3c5f621bcb83ce4188eb0e9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): packages/daemon/src/domain/restore-orchestrator.ts:331 \u00B7 packages/daemon/src/domain/restore-orchestrator.ts:340 \u00B7 packages/daemon/src/domain/rigspec-instantiator.ts:56 \u00B7 packages/daemon/src/domain/snapshot-capture.ts:39 \u2014 the 4 copies are spread across 3 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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"181d935ad1f0da30f25121d052d9a5156b0da131c55fd6a067976eecd7985eaa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/daemon/src/domain/rigspec-instantiator.ts:99 \u00B7 packages/daemon/src/domain/rigspec-instantiator.ts:1503 \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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"aacc4fb742ec816f56acab1f2147e5d6c606d9440980c187fb28304e2f28dca6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/daemon/src/domain/rigspec-instantiator.ts:1910 \u00B7 packages/daemon/src/domain/rigspec-instantiator.ts:1932 \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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":1910}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef48a30018ac99515cbdcd63fc0b0f6f53abcd0693e22f7324c484bebb871f45"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/daemon/src/domain/rigspec-schema.ts:263 \u00B7 packages/daemon/src/domain/rigspec-schema.ts:1357 \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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c40c5160ec6997b9e914d4006b900f346a304a2cce426f35899b3010235831"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/daemon/src/domain/rigspec-schema.ts:545 \u00B7 packages/daemon/src/domain/rigspec-schema.ts:1464 \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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f97f55f1f4a0f03689e0785d7b4d2d3f30f9584294d45d97040ba6f765a1252"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/daemon/src/domain/seat-handover-planner.ts:153 \u00B7 packages/daemon/src/domain/seat-handover-planner.ts:163 \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/daemon/src/domain/seat-handover-planner.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6b15d7859d88a32e48f44d1d6bb004afb67c05d94c60716072bce0b7693a11"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/daemon/src/domain/seat-handover-service.ts:1661 \u00B7 packages/daemon/src/domain/seat-handover-service.ts:1701 \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/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":1661}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd13fdc9a4526cec3ec7229ca522265e7cdc2960b7bc7ca69561c38a7f2da237"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): packages/daemon/src/domain/seat-launch-additions.ts:346 \u00B7 packages/daemon/src/domain/seat-skill-storage.ts:226 \u00B7 packages/daemon/src/domain/seat-skill-storage.ts:297 \u2014 the 3 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/daemon/src/domain/seat-launch-additions.ts"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"81945fa6d0d1eac04ae1c9deebb05131eba6248e376b99b53432072af8cadfb7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/daemon/src/domain/seat-lifecycle-service.ts:952 \u00B7 packages/daemon/src/domain/seat-lifecycle-service.ts:1022 \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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"c908988d76302524253fcb278aa43f5ab066889cce59fef37b6c2a3d2db83f4e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/daemon/src/domain/session-transport.ts:2541 \u00B7 packages/daemon/src/domain/session-transport.ts:2617 \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/daemon/src/domain/session-transport.ts"},"region":{"startLine":2541}}}],"partialFingerprints":{"codehealthFindingId/v1":"9396042c55cd38bc4f66d3176ec53c1c1c438fb3f90229b16f0183b688f3e207"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/daemon/src/domain/session-transport.ts:3587 \u00B7 packages/daemon/src/domain/session-transport.ts:4848 \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/daemon/src/domain/session-transport.ts"},"region":{"startLine":3587}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2390f8dd1c30eb2d58cccbe8a0f6420c6dc21b8284182ed29be8ffda287656f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): packages/daemon/src/domain/session-transport.ts:523 \u00B7 packages/daemon/src/domain/session-transport.ts:708 \u2014 the two spans are one implementation copied and then locally edited \u2014 115 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"af23ebcf2ea22d034060df5c98cc4e95b260e3d0c50f9790f7fdce25b9210a61"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/daemon/src/domain/skill-discovery.ts:200 \u00B7 packages/daemon/src/domain/skill-discovery.ts:322 \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/daemon/src/domain/skill-discovery.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"d769f1a041423356dd718c9a5d854121cd545907f12a067724525419dc099710"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/daemon/src/domain/slices/slice-indexer.ts:483 \u00B7 packages/daemon/src/domain/slices/slice-indexer.ts:977 \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/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a6d7d5672c40cb081a5167028c2b5e8917241621ac561d60c18f3c43143b0df"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/daemon/src/domain/slices/slice-indexer.ts:955 \u00B7 packages/daemon/src/domain/slices/slice-indexer.ts:990 \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/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"94936b7de1df9544ef8c4ff8c86e0c0ac522efb7b39a82ddc6b891c097c41d32"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/daemon/src/domain/spec-library-workflow-scanner.ts:357 \u00B7 packages/daemon/src/routes/workflow.ts:521 \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/daemon/src/domain/spec-library-workflow-scanner.ts"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"438c18f0daf86035b92c996206272092ad93279574862f98d40679037fe71842"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): packages/daemon/src/domain/spec-library-workflow-scanner.ts:278 \u00B7 packages/daemon/src/domain/workflow/slice-workflow-projection.ts:117 \u2014 the two spans are one implementation copied and then locally edited \u2014 64 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/daemon/src/domain/spec-library-workflow-scanner.ts"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"d683e38320f7b928bad8a939b416c75aa2f490a27fab3c178343aa6254da711f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/daemon/src/domain/terminal/terminal-service.ts:552 \u00B7 packages/daemon/src/domain/terminal/terminal-service.ts:566 \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/daemon/src/domain/terminal/terminal-service.ts"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c9346285fca6f37eaf23523ea0146ac4785253b0ff2cb60ffb389a25a9d63f3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): packages/daemon/src/domain/topology/multi-rig-launcher.ts:122 \u00B7 packages/daemon/src/domain/topology/multi-rig-launcher.ts:140 \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":"packages/daemon/src/domain/topology/multi-rig-launcher.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"721605aff930b3e02d2991d2782c6d867ca098c9c785a32b9f417f821ac62f95"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): packages/daemon/src/domain/workspace/frontmatter-validator.ts:92 \u00B7 scripts/generate-context-packs.mjs:284 \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/daemon/src/domain/workspace/frontmatter-validator.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4b8e0fc4e55faad6712545eb708148c14f39d2cd9daed4d1d839e0c962d11a2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/daemon/src/routes/activity.ts:336 \u00B7 packages/daemon/src/routes/activity.ts:356 \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/daemon/src/routes/activity.ts"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d91e1e3207031feeeea4eeb105fa7d485396b483510eed2f3ed5d3311b92670"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/daemon/src/routes/files.ts:218 \u00B7 packages/daemon/src/routes/workflow.ts:162 \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/daemon/src/routes/files.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca92d9c33585df0014293efb8f53b76b5c9442a1a1d895f043da2950bcdca56e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/daemon/src/routes/missions.ts:63 \u00B7 packages/daemon/src/routes/missions.ts:98 \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/daemon/src/routes/missions.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5419eb731eb62981658c499eb4ffa585c49ccfffdc8775cafdf8a3067c92f26"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/daemon/src/routes/queue.ts:326 \u00B7 packages/daemon/src/routes/watchdog.ts:47 \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/daemon/src/routes/queue.ts"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"807179b52256caae0ffa37b5f3a709979b88a14fdef9c82973c95264142fc1b0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): packages/daemon/src/routes/rig-delivery-drain.ts:16 \u00B7 packages/daemon/src/routes/rig-delivery-drain.ts:28 \u2014 the two spans are one implementation copied and then locally edited \u2014 146 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/daemon/src/routes/rig-delivery-drain.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"2807b5ce8fc95243116dcc7b83a07a311a186d9da0d7d43a908907b7addc751c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/daemon/src/routes/rigs.ts:425 \u00B7 packages/daemon/src/routes/rigs.ts:451 \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/daemon/src/routes/rigs.ts"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a9131d015ee20bd3bf88a8ff603d3748afd1e97f84dd4d9e671a83419bc33f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/daemon/src/routes/rigs.ts:484 \u00B7 packages/daemon/src/routes/rigs.ts:561 \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/daemon/src/routes/rigs.ts"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab40cd9674b0609f248f2e55efe971e8c4fb19776e55e929d5e68273f7aa449"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/daemon/src/routes/rigspec.ts:111 \u00B7 packages/daemon/src/routes/rigspec.ts: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/routes/rigspec.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2559d5cf5b36315697fdee65e43aea70d9273ff6972e4165ea5858efcf22882"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/daemon/src/routes/seat.ts:381 \u00B7 packages/daemon/src/routes/seat.ts:429 \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/daemon/src/routes/seat.ts"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba9a2127a66bb21f637477cf406b5be763c80409835cdfc6e3b08ef666ba5ed"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/daemon/src/routes/spec-library.ts:243 \u00B7 packages/daemon/src/routes/spec-library.ts:263 \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/daemon/src/routes/spec-library.ts"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"de5804cc532ff88de3b0044c9fe13c41722aa70d4409740887773aaac0f3026e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/daemon/src/routes/spec-review.ts:37 \u00B7 packages/daemon/src/routes/whoami.ts:46 \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/daemon/src/routes/spec-review.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef90b5b414077f1796a89bcff3bd22949602fa2df931fe38503183bed55a2a5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/daemon/src/routes/terminal.ts:152 \u00B7 packages/daemon/src/routes/terminal.ts:163 \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/daemon/src/routes/terminal.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"657073d043bdae4800e6f6ede98bfecf90f47e085f0741d72da2acdfb17c216c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/daemon/src/routes/workflow.ts:467 \u00B7 packages/daemon/src/routes/workflow.ts:477 \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/daemon/src/routes/workflow.ts"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d430dd8cbbcb991d561b5fa355230fc0b6061ce20774582c60f9b69437327b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/ui/src/components/AgentSpecDisplay.tsx:88 \u00B7 packages/ui/src/components/AgentSpecDisplay.tsx:106 \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/ui/src/components/AgentSpecDisplay.tsx"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"73efb1be95c9058747f17c108a1898c285dbfd69904d6d78f235b3afea6f4074"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/ui/src/components/ImportFlow.tsx:244 \u00B7 packages/ui/src/components/ImportFlow.tsx:317 \u2014 all 2 copies are in the same file, 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/ui/src/components/ImportFlow.tsx"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f2216e64c15f34b0ed817ece4238867c7bdcd0f1dfeb25745c22ab0384c4e1b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/ui/src/components/LibraryReview.tsx:279 \u00B7 packages/ui/src/components/LibraryReview.tsx:293 \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/ui/src/components/LibraryReview.tsx"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2330502d775c677de2b64c8e8161d8b1a0c24a0a1fcbf5ff31c883ca417502d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): packages/ui/src/components/PackageInstallFlow.tsx:149 \u00B7 packages/ui/src/components/PackageInstallFlow.tsx:174 \u00B7 packages/ui/src/components/PackageInstallFlow.tsx:206 \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/ui/src/components/PackageInstallFlow.tsx"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"8775fd0bcc7e6669ec44c4c42873339654904bf55a5f751f8826600e543132be"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/ui/src/components/RigNode.tsx:106 \u00B7 packages/ui/src/components/topology/HybridTopologyNodes.tsx:124 \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/ui/src/components/RigNode.tsx"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a6ae3b77f43710f3ed26e2468b9d8fc9b6975bb6fd2c223b3f8552b81f7c59"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): packages/ui/src/components/ThemeProvider.tsx:76 \u00B7 packages/ui/src/hooks/usePrefersReducedMotion.ts:9 \u2014 the two spans are one implementation copied and then locally edited \u2014 67 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/ui/src/components/ThemeProvider.tsx"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"545d85f8b819cd8f780611054c75cdc80b4d9fb353378f483ae5a01d8032b33d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5 locations): packages/ui/src/components/lab/VellumBackgroundLab.tsx:371 \u00B7 packages/ui/src/components/lab/VellumBackgroundLab.tsx:433 \u00B7 packages/ui/src/components/lab/VellumBackgroundLab.tsx:466 \u00B7 packages/ui/src/components/lab/VellumBackgroundLab.tsx:578 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 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/ui/src/components/lab/VellumBackgroundLab.tsx"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"f418e2edc1bbdd879b67dac321d505e97ec5448314ac86622dcde888c766dfb2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/ui/src/components/project/ScopePages.tsx:138 \u00B7 packages/ui/src/components/topology/TerminalLauncher.tsx:357 \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/ui/src/components/project/ScopePages.tsx"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d47e3e8da999d3ec3b95fd54c64f03cb69e624ae8e87bbc0131ed96a310559"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/ui/src/components/topology/HostMultiRigGraph.tsx:61 \u00B7 packages/ui/src/hooks/useRigGraph.ts:5 \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/ui/src/components/topology/HostMultiRigGraph.tsx"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d9c16c257fa771d559b9927c1f96ee30688825502aa12ad90624247931fc050"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): packages/ui/src/components/workflow/WorkflowInstancesBand.tsx:148 \u00B7 packages/ui/src/components/workflow/WorkflowsPage.tsx:105 \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/ui/src/components/workflow/WorkflowInstancesBand.tsx"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f0e9e6f11c2b5481059c11899f133459d329f5561487efbc954276e5ad1afc6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): packages/ui/src/hooks/useCompletedMissions.ts:43 \u00B7 packages/ui/src/hooks/useCompletedMissions.ts:53 \u2014 the two spans are one implementation copied and then locally edited \u2014 61 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/ui/src/hooks/useCompletedMissions.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"673e711729a9aaa580a5cfa8b3edd058ce642608aae5ac6a7dec1e34b355da4a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): packages/ui/src/hooks/useContextFleet.ts:54 \u00B7 packages/ui/src/hooks/useNeedsInputSeats.ts:17 \u2014 the two spans are one implementation copied and then locally edited \u2014 83 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/ui/src/hooks/useContextFleet.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c320baf602d2090a3d2e0e3eca142e3fd8e3b2a9fd962a5e915bd044d85f8f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): packages/ui/src/hooks/useFiles.ts:31 \u00B7 packages/ui/src/hooks/useProgressTree.ts:41 \u00B7 packages/ui/src/hooks/useSteering.ts:61 \u2014 the 3 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. 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/ui/src/hooks/useFiles.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"e80619e2ff4cb155c4f49da5c228f3095c1760baed6e0d6441dacee395ac131e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/ui/src/hooks/usePsEntries.ts:33 \u00B7 packages/ui/src/hooks/useRigSummary.ts:19 \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/ui/src/hooks/usePsEntries.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d0362da9c0413d748fcf2cb839668be5ffc8de10ade4bfec90288a107b7ef47"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/ui/src/hooks/useReviewAgents.ts:21 \u00B7 packages/ui/src/hooks/useRigGraph.ts:6 \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/ui/src/hooks/useReviewAgents.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeee554f830401a5730796f84433576dafa446f086de8317fd1edc37973fcc3c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/ui/src/hooks/useRigSummary.ts:24 \u00B7 packages/ui/src/hooks/useTerminalViews.ts:31 \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/ui/src/hooks/useRigSummary.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e9dd915becc421c370db01cae806b4d9a3fb142332cd7e0e9d466bccb6af87"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): skills/_canonical/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs:661 \u00B7 skills/_canonical/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs:702 \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":"skills/_canonical/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb59e1c643e22e5f2bfe1be97ee08d8faf91c1124215313c24a5559305f5d4d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): packages/cli/src/commands/acp.ts:25 \u00B7 packages/cli/src/commands/acp.ts:52 \u2014 the two spans are one implementation copied and then locally edited \u2014 107 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/cli/src/commands/acp.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"c893ff2844aed6a355e13dad6c81ecf4887e211301e34ecac8ab08dd5b9eb434"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/cli/src/commands/adopt.ts:141 \u00B7 packages/cli/src/commands/rig.ts:281 \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/commands/adopt.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"9851e6d182d944447739f52a100fd68f4cd22ae4fbe65840736854da97ac1bdc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/cli/src/commands/agent.ts:73 \u00B7 packages/cli/src/commands/rig.ts:259 \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/commands/agent.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6da15f2fcf974c1a38f473f5720e2c81b1007eb5113929f8d0f5c123d48cbe5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): packages/cli/src/commands/bind.ts:7 \u00B7 packages/cli/src/commands/env.ts:9 \u2014 the two spans are one implementation copied and then locally edited \u2014 97 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/commands/bind.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d343a6b25c242fbe396dc50ef64d5d7d9c0061b29b333d719600dcf9ce4dd63"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/cli/src/commands/bundle.ts:387 \u00B7 packages/cli/src/commands/transcript.ts:93 \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/commands/bundle.ts"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"72538b2672cb02693f473f007ba554e436ead24dae0183ce257851ae708e8657"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): packages/cli/src/commands/chatroom.ts:143 \u00B7 packages/cli/src/commands/seat.ts:856 \u00B7 packages/cli/src/commands/seat.ts:1811 \u2014 the 3 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/commands/chatroom.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ab68e1d548dd8da55f8eeb30b0b8b2590a7f968acbb0b970aacd6dfbecc18f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): packages/cli/src/commands/chatroom.ts:35 \u00B7 packages/daemon/src/domain/demo-rig-selector.ts:15 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 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/commands/chatroom.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba00c0dc914c7df6f96819df16f2b51db203c3f9068892cd0bbeeca33aa049b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/cli/src/commands/compact.ts:114 \u00B7 packages/cli/src/commands/context.ts:507 \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/commands/compact.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc4ef0690c2921a42f978989bf321460902d0c6a7376a144584fd7d9068279b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): packages/cli/src/commands/daemon.ts:25 \u00B7 packages/cli/src/commands/daemon.ts:60 \u2014 the two spans are one implementation copied and then locally edited \u2014 63 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/cli/src/commands/daemon.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7576b7addc8caf0634c6e4adfd6c99ac7c93f1489720aded5871bcf46ebcf9c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): packages/cli/src/commands/discover.ts:7 \u00B7 packages/cli/src/commands/env.ts:9 \u2014 the two spans are one implementation copied and then locally edited \u2014 97 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/commands/discover.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df4b57885805ec0547541dcef09e0333530f62cc86e72559be63d19a7749224"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/cli/src/commands/env.ts:121 \u00B7 packages/cli/src/commands/env.ts:152 \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/commands/env.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0895dfc84f89998f6de6f83ae8815760c8a1ce51e4a68593d5a3fceb8a89570"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): packages/cli/src/commands/env.ts:9 \u00B7 packages/cli/src/commands/unclaim.ts:7 \u2014 the two spans are one implementation copied and then locally edited \u2014 97 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/commands/env.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"dddda3fc277345519dc8ec24900f4429ad84dee1c49a8d28f4e5d62988718025"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/cli/src/commands/host.ts:184 \u00B7 packages/daemon/src/routes/hosts.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/commands/host.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"6285f4a7fdd5f35ce6f985296ae86e4ab012d2407a2f01544f9682e9ea7f166a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/cli/src/commands/import.ts:136 \u00B7 packages/cli/src/commands/rig.ts:305 \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/commands/import.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e10eb9e2e7c7e0fc1116202fdee14f8df8257bf4488fd219d8f0db9f8d2ced0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): packages/cli/src/commands/package.ts:19 \u00B7 packages/cli/src/commands/package.ts:216 \u00B7 packages/cli/src/commands/snapshot.ts:48 \u2014 the 3 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/commands/package.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2737020eefe5b89df5e957d712fb0c691f4f23f72c3f43943906d46b739af82"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/cli/src/commands/ps.ts:1112 \u00B7 packages/cli/src/commands/ps.ts:1779 \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/commands/ps.ts"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24db1b25296e3f632ab0a0656de5d5424aa455fa5f458810675ec9294cdcd4a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/cli/src/commands/queue.ts:725 \u00B7 packages/cli/src/commands/whoami.ts:262 \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/commands/queue.ts"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f260fa8f51a544f6a30aac2fc67cc743bb67dea717d9c317c50f4c5bc81315"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): packages/cli/src/commands/queue.ts:1384 \u00B7 packages/cli/src/commands/queue.ts:1964 \u00B7 packages/cli/src/commands/queue.ts:2070 \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/commands/queue.ts"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31e5a0192389a52466797af972fa444279d7f6132a84c34f407853f0845fa3f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/cli/src/commands/restore-check.ts:396 \u00B7 packages/cli/src/commands/restore-check.ts:487 \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/commands/restore-check.ts"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7950087434518b5f5422b63e3ab0a66c795fc0522d488bc627d790ba1c4eb19"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): packages/cli/src/commands/rig-mode.ts:298 \u00B7 packages/cli/src/commands/rig-mode.ts:424 \u00B7 packages/cli/src/commands/rig-mode.ts:607 \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/commands/rig-mode.ts"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c82d9de8c0b8c41865912ebd87225add07e2582433872b84354f19085ccc87"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/cli/src/commands/rig-mode.ts:391 \u00B7 packages/cli/src/commands/rig-mode.ts:578 \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/commands/rig-mode.ts"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1633378773402d83db4d7fe64d118e1c20a241a23f8138fb216d97574e1a852"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/cli/src/commands/rig-mode.ts:464 \u00B7 packages/cli/src/commands/rig-mode.ts:509 \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/commands/rig-mode.ts"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e7d565646e209438996fdc0a151db6a71bc8bfa321c9afa18fed1afd26349b4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): packages/cli/src/commands/scope.ts:574 \u00B7 packages/cli/src/commands/scope.ts:1870 \u00B7 packages/cli/src/commands/scope.ts:1901 \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/commands/scope.ts"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae29f0d9b037c241032820674bbb72c60ca723713e68d4fed9f7d8a3d75db7b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/cli/src/commands/scope.ts:911 \u00B7 packages/cli/src/commands/scope.ts:1269 \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/commands/scope.ts"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8433967305dfb00dc688037684ac545281b15f8bb7fea768a3db1b5c6b6321f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/cli/src/commands/scope.ts:1284 \u00B7 packages/daemon/src/routes/scope-audit.ts:202 \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/commands/scope.ts"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6ebefb625c12d9042d8f38d9f55ec52127ce391d4e1d2bbd8bca3362d433c2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): packages/cli/src/commands/seat.ts:1442 \u00B7 packages/cli/src/commands/seat.ts:1902 \u00B7 packages/cli/src/commands/seat.ts:1947 \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/commands/seat.ts"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"75bb3b65f7c00db9c6b3c634a92794a0ed3623d5615ed9170ce5d24abf1c2e95"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/cli/src/commands/up.ts:751 \u00B7 packages/cli/src/commands/up.ts:824 \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/commands/up.ts"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"51697948cfb10d93b40dec0fafdb0d1c4ed048f86b618db31f56cbe7282a5375"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/cli/src/commands/usage.ts:89 \u00B7 packages/tui/src/cost/cost-model.ts:43 \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/commands/usage.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ebf43dfbf6fa595b8c898ffbeb05a7a50c52a91008573f5c72e523fcb154a9a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/cli/src/commands/workflow.ts:88 \u00B7 packages/cli/src/commands/workspace.ts:65 \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/commands/workflow.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"171a3210d04d09d1ae37262e007980b405a7b938f954ca38e335b9b50c724a0a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/cli/src/config-store.ts:1355 \u00B7 packages/daemon/src/domain/user-settings/settings-store.ts:1432 \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/config-store.ts"},"region":{"startLine":1355}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee7c8f3c73f7fe84ab7250f6307592ab7efa34b34bff55f6233909705371e03"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/cli/src/daemon-lifecycle.ts:189 \u00B7 packages/cli/src/daemon-lifecycle.ts:205 \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/daemon-lifecycle.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4cf643972fd2ba4be74020e63b08a0394f554d16b0d32734567e3688bc6c28"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): packages/cli/src/daemon-lifecycle.ts:1384 \u00B7 packages/daemon/src/middleware/browser-boundary.ts:223 \u2014 the two spans are one implementation copied and then locally edited \u2014 59 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/daemon-lifecycle.ts"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d3dbeb9e25c011e0e19a57b49c51c7dbee24ee0d8ae8787da4ed6f60a817ad3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): packages/cli/src/lib/context-install.ts:77 \u00B7 packages/ui/src/components/markdown/storytelling-primitives.ts:179 \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/lib/context-install.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"00bceb11e581f5a1e9698cff9f01c889af4d338b46411c42f13c7d6d713a475e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): packages/cli/src/seat-attention.ts:41 \u00B7 packages/cli/src/seat-attention.ts:53 \u2014 the two spans are one implementation copied and then locally edited \u2014 75 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/cli/src/seat-attention.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcfb128b40901546f1bf377764cb042d20f0b5260734407ddaf40f9c29d3c9dc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/daemon/assets/plugins/openrig-core/hooks/scripts/compaction-restore-bridge.cjs:177 \u00B7 packages/daemon/assets/plugins/openrig-core/skills/claude-compaction-restore/scripts/precompact-hook.mjs:222 \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/daemon/assets/plugins/openrig-core/hooks/scripts/compaction-restore-bridge.cjs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcfed1994fe1ea8346aba110284cdbc2257bcc238f4a2eea2225952c07bde01f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): packages/daemon/src/adapters/claude-code-adapter.ts:537 \u00B7 packages/daemon/src/adapters/codex-runtime-adapter.ts:1305 \u00B7 packages/daemon/src/adapters/pi-runtime-adapter.ts:469 \u2014 the 3 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. 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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc26a2cdf3725483cdd40b392783c7d6d3ac57182e8a0877f6b616332418f424"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/daemon/src/adapters/claude-code-adapter.ts:1213 \u00B7 packages/daemon/src/adapters/codex-runtime-adapter.ts:1773 \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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":1213}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f3c0f2f9d6a0beabcecede47a9b62026543450565c4dbdd8cf9d0575e6ee73"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 8 locations): packages/daemon/src/adapters/codex-runtime-adapter.ts:273 \u00B7 packages/daemon/src/domain/restore-orchestrator.ts:352 \u00B7 packages/daemon/src/domain/restore-orchestrator.ts:365 \u00B7 packages/daemon/src/domain/rig-lifecycle-service.ts:177 \u00B7 \u002B4 more site(s) not listed \u2014 the 7 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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ec465747111ebc490a88c0790843551ec60ba423da0f2e9723748f3894a24c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): packages/daemon/src/adapters/codex-runtime-adapter.ts:1491 \u00B7 packages/daemon/src/adapters/pi-runtime-adapter.ts:598 \u00B7 packages/daemon/src/adapters/stub-runtime-adapter.ts:302 \u2014 the 3 copies are spread across 3 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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":1491}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e491ad4a3d300054d74ec2eff40460f84c4645c25bafcd4e990b645c487e55"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/daemon/src/adapters/compose-services-adapter.ts:123 \u00B7 packages/daemon/src/adapters/compose-services-adapter.ts:149 \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/daemon/src/adapters/compose-services-adapter.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"81355bb517abbc1a7e6503692c9989d39d74e708e387ffc573176b88aed5c66c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): packages/daemon/src/adapters/pi-openrouter-charge.ts:44 \u00B7 packages/daemon/src/domain/provider/usage-across-hosts.ts:376 \u2014 the two spans are one implementation copied and then locally edited \u2014 64 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/daemon/src/adapters/pi-openrouter-charge.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78de0123e24f46119f1afcce363e087a796b09c9267303875026546f8238d95"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/daemon/src/adapters/pi-runner.ts:2398 \u00B7 packages/daemon/src/adapters/pi-runner.ts:2462 \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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":2398}}}],"partialFingerprints":{"codehealthFindingId/v1":"f01ced54df0424361c3f16851ebf593a76805ef70968a6bf7cb76ef9bd18b604"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): packages/daemon/src/adapters/pi-runner.ts:887 \u00B7 packages/daemon/src/domain/codex-member-permissions.ts:214 \u2014 the two spans are one implementation copied and then locally edited \u2014 66 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c1a7fea87e87dd2ca64fb7f96288488198efb67ba67009362835d6424d30f5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/daemon/src/adapters/stub-runner.ts:240 \u00B7 packages/daemon/src/adapters/stub-runner.ts:253 \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/daemon/src/adapters/stub-runner.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d33fb12777535922691c1c3b20679dcaef9550cf09405f884d32141b6f1f70"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/daemon/src/adapters/tmux.ts:1580 \u00B7 packages/daemon/src/adapters/tmux.ts:1598 \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/daemon/src/adapters/tmux.ts"},"region":{"startLine":1580}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdcbc454a0659700c65a6096906889c78f50b8088a93cf3bb8d1d2d7152a99f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): packages/daemon/src/domain/agent-resolver.ts:172 \u00B7 packages/daemon/src/domain/spec-review-service.ts:299 \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/daemon/src/domain/agent-resolver.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1af5a145959a4fe317106907cab8d8fe18d5c5c0565d5ad31c07936193121d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/daemon/src/domain/bootstrap-orchestrator.ts:864 \u00B7 packages/daemon/src/domain/rigspec-instantiator.ts:1899 \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/daemon/src/domain/bootstrap-orchestrator.ts"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e22f0ba0a5803ba7fce82ca234ccd18e6c0e556898cce3fb13fdba0e53d9da0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): packages/daemon/src/domain/bootstrap-orchestrator.ts:169 \u00B7 packages/daemon/src/domain/bundle-content-routing.ts:98 \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":"packages/daemon/src/domain/bootstrap-orchestrator.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"8342f974b6cb2c39aee94f477f9efdb23702e578e64a75d2d5f283e088ba8332"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): packages/daemon/src/domain/bundle-content-routing.ts:62 \u00B7 packages/daemon/src/domain/bundle-types.ts:183 \u00B7 packages/daemon/src/routes/bundles.ts:648 \u2014 the 3 copies are spread across 3 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/daemon/src/domain/bundle-content-routing.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf85df6c5cc4a85248554a4f50586f25889086912fef924e5724cd9f70679597"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/daemon/src/domain/classifier-lease-manager.ts:405 \u00B7 packages/daemon/src/domain/project-classifier.ts:314 \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/daemon/src/domain/classifier-lease-manager.ts"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dfb855e606ae894e90f4c63f1c30d491ba5029dae105c517324d3bb23d06213"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/daemon/src/domain/claude-core-plugin-env.ts:78 \u00B7 packages/daemon/src/domain/claude-core-plugin-env.ts:99 \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/daemon/src/domain/claude-core-plugin-env.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"891706d235997024ce706ba516efd4b37741934d14e47f96a1fb6cd7587ff08f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/daemon/src/domain/codex-auth.ts:45 \u00B7 packages/daemon/src/domain/provider/codex-auth-reader.ts:50 \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/daemon/src/domain/codex-auth.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6697d041733fe91e3bc7c9122c20867841a9918ae50b7d2dea50d7a3d366d6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/daemon/src/domain/codex-network-default.ts:234 \u00B7 packages/daemon/src/domain/provider/claude-auth-status-reader.ts:87 \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/daemon/src/domain/codex-network-default.ts"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7eda254e5f734986b036436d2c435927028f1614dae09517651435c2d10796e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/daemon/src/domain/crash-cart-detect.ts:38 \u00B7 packages/daemon/src/domain/crash-cart-discovery.ts:52 \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/daemon/src/domain/crash-cart-detect.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ec72cf35a7186fec5788f92b7d4fca084b7e11e1cb5b587ec6f5d82e5408be"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/daemon/src/domain/gateway/human-registry.ts:687 \u00B7 packages/daemon/src/domain/gateway/participants.ts:185 \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/daemon/src/domain/gateway/human-registry.ts"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b7e66cad07657273fe82ec5d9dcd640e5780a256bab96b2a366c401be7e56e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/daemon/src/domain/gateway/slack/slack-delivery.ts:404 \u00B7 packages/daemon/src/domain/gateway/slack/slack-delivery.ts:508 \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/daemon/src/domain/gateway/slack/slack-delivery.ts"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb0662144ed0a05eb9fedcf3cf9fd76cf56c818bd44c4cd6d493d4859fb45e3e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): packages/daemon/src/domain/gateway/slack/thread-seat-map.ts:51 \u00B7 packages/daemon/src/domain/reply-to-choice.ts:54 \u00B7 packages/daemon/src/domain/reply-to-choice.ts:82 \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/daemon/src/domain/gateway/slack/thread-seat-map.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd678c5078d4304e9d314fe1ff21f0148c7c6b4b43eb2ce5507e9a22a537d254"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/daemon/src/domain/hosts/remote-daemon-http.ts:148 \u00B7 packages/daemon/src/domain/hosts/remote-daemon-http.ts:236 \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/daemon/src/domain/hosts/remote-daemon-http.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ec3a4b64d0f5c7eab1ee893ed1e8059d13d4b3bf4d7bc146a52ab0fb42bb6a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): packages/daemon/src/domain/native-process-lineage.ts:871 \u00B7 packages/daemon/src/domain/native-process-lineage.ts:930 \u00B7 packages/daemon/src/domain/native-process-lineage.ts:949 \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/daemon/src/domain/native-process-lineage.ts"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9044a69bc85421a273679314123b169cb7b02a4c11e8839f17b8e387445d8fc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/daemon/src/domain/permission-drift.ts:120 \u00B7 packages/daemon/src/domain/resume-token-validation.ts:46 \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/daemon/src/domain/permission-drift.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"d551541e783a6e5997d01296879ff8b47348471eeeead1d7d192d31037c657d2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): packages/daemon/src/domain/pi-usage-entries-store.ts:29 \u00B7 packages/daemon/src/domain/pi-usage-entries-store.ts:59 \u2014 the two spans are one implementation copied and then locally edited \u2014 132 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/daemon/src/domain/pi-usage-entries-store.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaeb7488ee67807a236b7fb5d711a3fe33e727c596c712c0ebd8d2f380c91745"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): packages/daemon/src/domain/queue-erasure.ts:148 \u00B7 packages/daemon/src/domain/queue-retention.ts:153 \u2014 the two spans are one implementation copied and then locally edited \u2014 85 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/daemon/src/domain/queue-erasure.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7468976087f6940378ce811e8440d88b94dd8fef1c3d8e0c5ade1ba80ed5f1b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/daemon/src/domain/queue-repository.ts:5014 \u00B7 packages/daemon/src/domain/queue-repository.ts:5025 \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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":5014}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de67cd9bfa1d1e45a5ec2d096bc3a1b5326d0c133b1c8961f8f91906cb5c493"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): packages/daemon/src/domain/restore-orchestrator.ts:349 \u00B7 packages/daemon/src/domain/rigspec-instantiator.ts:68 \u00B7 packages/daemon/src/domain/snapshot-capture.ts:51 \u2014 the 3 copies are spread across 3 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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3199b2d3ebfc161285e0553fd0eeb34551570087c09d3dd2bac4862fb2bf3d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/daemon/src/domain/rigspec-instantiator.ts:303 \u00B7 packages/daemon/src/domain/rigspec-instantiator.ts:2005 \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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"1068ce9590ef8462b99b28fba68345aa353370536e0c7510fdc3cb1898f194f1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/daemon/src/domain/rigspec-schema.ts:714 \u00B7 packages/daemon/src/domain/rigspec-schema.ts:750 \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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"06d7702f2c88fdc753c30628d5d0beb8d5ed1745e84aaee5bca0aff40e074be7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/daemon/src/domain/rigspec-schema.ts:935 \u00B7 packages/daemon/src/domain/rigspec-schema.ts:1025 \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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"80ab071d0c64e7c6bf02a21d9fba7f9f1c48031f1bb59c61c03ff28da7bd2f40"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/daemon/src/domain/seat-activity-service.ts:382 \u00B7 packages/daemon/src/domain/seat-activity-service.ts:615 \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/daemon/src/domain/seat-activity-service.ts"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd6526ebba9cb77978e4ca96edf968c3aae1507065e295b99c428dbd18f16c25"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): packages/daemon/src/domain/seat-activity-service.ts:303 \u00B7 packages/daemon/src/domain/seat-activity-service.ts:328 \u2014 the two spans are one implementation copied and then locally edited \u2014 96 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/daemon/src/domain/seat-activity-service.ts"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"1679eca04c7441140a2b4d57c04f8eeab539b303fa45e88b1e78aada2e172d38"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): packages/daemon/src/domain/session-transport.ts:3381 \u00B7 packages/daemon/src/domain/session-transport.ts:3580 \u00B7 packages/daemon/src/domain/session-transport.ts:4842 \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/daemon/src/domain/session-transport.ts"},"region":{"startLine":3381}}}],"partialFingerprints":{"codehealthFindingId/v1":"89613355dbc930c0a005c39107570c9257308f493ce7d0ed43d9a32510c0b81e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/daemon/src/domain/skill-catalog.ts:704 \u00B7 packages/daemon/src/domain/skill-catalog.ts:715 \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/daemon/src/domain/skill-catalog.ts"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc9e13a306246fbbdfacbae49e2347ab39da20051c82031067597fe8e72fd3d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/daemon/src/domain/spec-library-service.ts:205 \u00B7 packages/daemon/src/domain/spec-library-service.ts:219 \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/daemon/src/domain/spec-library-service.ts"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6fd01d48472e49a87b9993d5376322102675a3856ed649702640ccaa3bb378"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): packages/daemon/src/domain/spec-validation-service.ts:27 \u00B7 packages/daemon/src/domain/spec-validation-service.ts:42 \u2014 the two spans are one implementation copied and then locally edited \u2014 56 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/daemon/src/domain/spec-validation-service.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"166f600a7bd48e87e85282e521feb08c226694fd1bec123f29f7978447cc973e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/daemon/src/domain/user-settings/settings-store.ts:1476 \u00B7 packages/daemon/src/domain/user-settings/settings-store.ts:1561 \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/daemon/src/domain/user-settings/settings-store.ts"},"region":{"startLine":1476}}}],"partialFingerprints":{"codehealthFindingId/v1":"b990ec727629b57fbdbc10c6e83fead68ff589a446ca19307fa4d3910ef4349c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/daemon/src/domain/workflow-spec-cache.ts:496 \u00B7 packages/daemon/src/domain/workflow-spec-cache.ts:539 \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/daemon/src/domain/workflow-spec-cache.ts"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e2e12253792d3d1e90a870dafe67968adf7ddb8498985e3f42d0d494917a81a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): packages/daemon/src/index.ts:159 \u00B7 packages/daemon/src/index.ts:203 \u2014 the two spans are one implementation copied and then locally edited \u2014 67 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/daemon/src/index.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf8a979dc762b1fdd10fe96bc00fa619c02e9a6582430cad86dc41d9d23b4b6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/daemon/src/routes/activity.ts:491 \u00B7 packages/daemon/src/routes/activity.ts:566 \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/daemon/src/routes/activity.ts"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"25dd3ecdc3b286922f9cf0adcb9d50442158020fee15d6887635c38189d3a6bb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): packages/daemon/src/routes/agent-images.ts:165 \u00B7 packages/daemon/src/routes/agent-images.ts:249 \u00B7 packages/daemon/src/routes/context-packs.ts:124 \u00B7 packages/daemon/src/routes/context-packs.ts:173 \u2014 the 4 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/daemon/src/routes/agent-images.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9dad65652f7f0a8a19e72817eff6200bd6684ea533a0df4c1c90c533aa6746f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): packages/daemon/src/routes/env.ts:15 \u00B7 packages/daemon/src/routes/env.ts:71 \u00B7 packages/daemon/src/routes/env.ts:108 \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/daemon/src/routes/env.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"71986fd2bd0d35102f275b49fa7a99ccaf6ec0828986d365f81abaf28f645e8f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): packages/daemon/src/routes/files.ts:62 \u00B7 packages/daemon/src/routes/plugins.ts:97 \u00B7 packages/daemon/src/routes/skills.ts:63 \u2014 the 3 copies are spread across 3 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/daemon/src/routes/files.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a09a4614e9b5d856880a5ec2dec9cd8a97f49c18ca0f659e877ce8e20e02eeab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/daemon/src/routes/gateway.ts:257 \u00B7 packages/daemon/src/routes/gateway.ts:304 \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/daemon/src/routes/gateway.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed7798ed0666a670ff109e25b69631a14d0415314121f42fe7add51a741d23dd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/daemon/src/routes/projects.ts:93 \u00B7 packages/daemon/src/routes/workflow.ts:132 \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/daemon/src/routes/projects.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"84819fc4b0ac33cdffdeecf54ca5fb6665ffd0c15e40ad471cd6a9219f72e4e0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 11 locations): packages/daemon/src/routes/queue.ts:983 \u00B7 packages/daemon/src/routes/queue.ts:1001 \u00B7 packages/daemon/src/routes/queue.ts:1084 \u00B7 packages/daemon/src/routes/queue.ts:1106 \u00B7 \u002B7 more site(s) not listed \u2014 the 11 copies are spread across 3 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/daemon/src/routes/queue.ts"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a73534e7ae1364495fd7068f2b8a4df5f916f3a206d64b1bb03517017ec38f0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/daemon/src/routes/queue.ts:1834 \u00B7 packages/daemon/src/routes/views.ts:48 \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/daemon/src/routes/queue.ts"},"region":{"startLine":1834}}}],"partialFingerprints":{"codehealthFindingId/v1":"6298d3910d0991ac38bf7ea901f8c1871c726b73f9450360024bf6912271574b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/daemon/src/routes/restore-check.ts:114 \u00B7 packages/daemon/src/routes/restore-check.ts: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/daemon/src/routes/restore-check.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"5deba80a2f49d3d5e1200fa48432ed988c03e89520e19ba333ccff57d6075a58"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/daemon/src/routes/rigs.ts:401 \u00B7 packages/daemon/src/routes/rigs.ts:446 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/routes/rigs.ts"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"622475bc5b5d745eef61c11dc8e894c441aa56359205e0baaf8f3b92ba319d0b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/daemon/src/routes/rigs.ts:462 \u00B7 packages/daemon/src/routes/rigs.ts:489 \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/daemon/src/routes/rigs.ts"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"b52e82cf0ef5f338cfd210d0222715454e526032010090956bda7965072d8c0c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/daemon/src/routes/rigspec.ts:286 \u00B7 packages/daemon/src/routes/rigspec.ts:313 \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/daemon/src/routes/rigspec.ts"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"f203f69aceba6dfcb900935e22836f44ae501942749d7b8ae604f477e692fbcb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): packages/daemon/src/routes/scopes.ts:56 \u00B7 packages/daemon/src/routes/scopes.ts:111 \u00B7 packages/daemon/src/routes/scopes.ts:125 \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/daemon/src/routes/scopes.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c545eb228e528af2316cd1f1050035958895905107bedc3021b88c2d8e12f61"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/daemon/src/routes/slices.ts:158 \u00B7 packages/daemon/src/routes/slices.ts:189 \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/daemon/src/routes/slices.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"820548e8450acd2ac5eadc6aa4df1283553ef16617e00824bf48ddd13aceba2f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): packages/daemon/src/routes/spec-library.ts:222 \u00B7 packages/daemon/src/routes/spec-review.ts:17 \u00B7 packages/daemon/src/routes/spec-review.ts:36 \u00B7 packages/daemon/src/routes/whoami.ts:45 \u2014 the 4 copies are spread across 3 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/daemon/src/routes/spec-library.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb56a550779238c19af252400e4b9ef08db8776c9f75090ebae05ef666da323"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/daemon/src/routes/transcripts.ts:201 \u00B7 packages/daemon/src/routes/transcripts.ts:255 \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/daemon/src/routes/transcripts.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"575baa20a4c99e98b386781c4699a58664cb27fc2ecc06bc6e0097916a6c0734"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/tui/src/crash-cart/keys.ts:23 \u00B7 packages/tui/src/main.ts:403 \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/tui/src/crash-cart/keys.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"59770b353aad6a04056cf1bc5f57968c760c84889bcbbef21a496fe2c67183bf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/tui/src/execution/execution-model.ts:67 \u00B7 packages/tui/src/scopes/scopes-model.ts:108 \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/tui/src/execution/execution-model.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"4934f325fa53afb438cfb8690fbaf1c849fa5b7305ce39a89f4b90e577b1ac89"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/tui/src/render.ts:1731 \u00B7 packages/tui/src/render.ts:2087 \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/tui/src/render.ts"},"region":{"startLine":1731}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e361dc76289b8e622cea5d16b0a49587193d773470a1f52a2ab592f35b6cc8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): packages/ui/src/components/LaunchRecoveryModal.tsx:205 \u00B7 packages/ui/src/components/RigSpecDisplay.tsx:149 \u00B7 packages/ui/src/components/RigSpecDisplay.tsx:177 \u2014 the 3 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/ui/src/components/LaunchRecoveryModal.tsx"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"2087233c105b8a72b78448b35047724be44fbf65201610216b5fb4eda3ee8f1a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/ui/src/components/agent-images/ForkNowAction.tsx:144 \u00B7 packages/ui/src/components/agent-images/ForkNowAction.tsx:183 \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/ui/src/components/agent-images/ForkNowAction.tsx"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fbfac8bab24605cee89e1c6a076da33b93e32e233526297f0d1f035c0cd2cc2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/ui/src/components/dashboard/vellum/VellumDestinationCard.tsx:161 \u00B7 packages/ui/src/components/dashboard/vellum/VellumDestinationCard.tsx:195 \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/ui/src/components/dashboard/vellum/VellumDestinationCard.tsx"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"322fe8fa9f4c2acb8e5307e61511cf626767cd68dc9af5839e219219ac43b3a9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/ui/src/components/markdown/primitives.tsx:119 \u00B7 packages/ui/src/components/markdown/primitives.tsx:155 \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/ui/src/components/markdown/primitives.tsx"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f89cbdfbc381e104b62bbf4272ae13b719bf645aa7097554420643d8ab4c716"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/ui/src/components/mission-control/hooks/useMissionControlCliCapabilities.ts:21 \u00B7 packages/ui/src/components/mission-control/hooks/useMissionControlDestinations.ts:15 \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/ui/src/components/mission-control/hooks/useMissionControlCliCapabilities.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"096322cf7b710e003445d071780614a33cf6ffa6855dac4926f6b3b2acba3aae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/ui/src/components/mission-control/hooks/useMissionControlCliCapabilities.ts:24 \u00B7 packages/ui/src/hooks/usePackages.ts:16 \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/ui/src/components/mission-control/hooks/useMissionControlCliCapabilities.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"b97225eb5d04165d8699f63af874115178ebd5a8afd4b00ec0e5a4bf49e25f69"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/ui/src/components/project/ScopePages.tsx:1137 \u00B7 packages/ui/src/components/slices/tabs/TestsVerificationTab.tsx:99 \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/ui/src/components/project/ScopePages.tsx"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae76711482ec6f0876feaf5f4db5d22cfa2e58136a430e7462b8d4d8d6fbb847"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/ui/src/components/slices/tabs/DecisionsTab.tsx:47 \u00B7 packages/ui/src/components/slices/tabs/DecisionsTab.tsx:55 \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/ui/src/components/slices/tabs/DecisionsTab.tsx"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1dfcc07d36feccf12726460aaacd3b6223f433f42fbdcce8a023ab07d3f98c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): packages/ui/src/hooks/mutations.ts:102 \u00B7 packages/ui/src/hooks/mutations.ts:219 \u00B7 packages/ui/src/hooks/mutations.ts:240 \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/ui/src/hooks/mutations.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e1bdb33ed214ec36c2e910e1e19b1baf434b683d70d2f58920058645eeca621"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/ui/src/hooks/useActivityFeed.ts:61 \u00B7 packages/ui/src/hooks/useActivityFeed.ts:82 \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/ui/src/hooks/useActivityFeed.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"181bae9c843701bc940b0192207d30853df3d7598830ef6fa87f55dc78ab294d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): packages/ui/src/hooks/useAgentImageLibrary.ts:78 \u00B7 packages/ui/src/hooks/useContextPackLibrary.ts:60 \u00B7 packages/ui/src/hooks/useRigEnv.ts:20 \u00B7 packages/ui/src/hooks/useRigStatus.ts:37 \u2014 the 4 copies are spread across 4 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/ui/src/hooks/useAgentImageLibrary.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc063ca85ac46116c81b9802e80e1ba27090540f0417ffb3d4ce9d1fac51f0a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): packages/ui/src/hooks/useFiles.ts:70 \u00B7 packages/ui/src/hooks/usePluginFiles.ts:46 \u00B7 packages/ui/src/hooks/useSkillFiles.ts:44 \u2014 the 3 copies are spread across 3 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/ui/src/hooks/useFiles.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd536d8ed2be9f86999949230938a8c52eb51f91a866c541ba321ba1f10d0de"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): packages/ui/src/hooks/useFiles.ts:145 \u00B7 packages/ui/src/hooks/usePluginFiles.ts:60 \u00B7 packages/ui/src/hooks/useSkillFiles.ts:58 \u2014 the 3 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. 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/ui/src/hooks/useFiles.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b55742fbdccd8ee39a1dbb00fcb9477e77bec32f9480b61d453fc2d79a9c243"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/ui/src/hooks/useMission.ts:66 \u00B7 packages/ui/src/hooks/useSlices.ts:302 \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/ui/src/hooks/useMission.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"396eca0792d79548f595df05d8a197a619fa143c787b1a796bee11003d4e6492"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/ui/src/hooks/useRigEnv.ts:23 \u00B7 packages/ui/src/hooks/useSnapshots.ts:10 \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/ui/src/hooks/useRigEnv.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef01f4408009315e181a3fb379340ff3b5d3db93b43bd52ea829f38545a12f3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): scripts/portability-report.mjs:174 \u00B7 scripts/rewrite-daemon-imports.mjs:122 \u2014 the two spans are one implementation copied and then locally edited \u2014 54 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":"scripts/portability-report.mjs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c0e2cdb34cc2f67c4d9264512850c6b32a2c648ca9dddedbbbe617009173b5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): skills/_canonical/core/openrig-upgrade/scripts/backup-sqlite.mjs:29 \u00B7 skills/_canonical/core/openrig-upgrade/scripts/refresh-managed-plugin.mjs:7 \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":"skills/_canonical/core/openrig-upgrade/scripts/backup-sqlite.mjs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"308085398b4cc22e3173976a271d031ca18cee8937e23f946a356ff77bd1f6d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): packages/cli/src/bin-wrapper.ts:125 \u00B7 packages/cli/src/bin-wrapper.ts:144 \u2014 the two spans are one implementation copied and then locally edited \u2014 50 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/cli/src/bin-wrapper.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab62dc38ec697fb1cdd38f48d4f756b36492ecee3b2ff57c83d70e83b5424cc4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): packages/cli/src/client.ts:251 \u00B7 packages/cli/src/commands/doctor.ts:307 \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/src/client.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"02947520193e47082241c2f9b6cc057a614d2cd3dde2a37675cee9724b177c70"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/cli/src/commands/archive.ts:56 \u00B7 packages/cli/src/commands/bundle.ts:336 \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/commands/archive.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"4101a4412b8aeed0ea81ca535b0528cd9523961f2b4aba545a65629fc8bbc084"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/cli/src/commands/bundle.ts:23 \u00B7 packages/daemon/src/domain/daemon-version.ts:25 \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/commands/bundle.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"80ccb15b08f324c7a124cac89bb4b576563908ea57a1d7a6445c90f04b2a98f4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): packages/cli/src/commands/bundle.ts:165 \u00B7 packages/cli/src/commands/bundle.ts:389 \u00B7 packages/cli/src/commands/chatroom.ts:144 \u00B7 packages/cli/src/commands/seat.ts:1812 \u2014 the 4 copies are spread across 3 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/commands/bundle.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a42f9ae84af62471948a15558e5d4b36680e8a14b2de426c961ad874b519400"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/cli/src/commands/config.ts:258 \u00B7 packages/cli/src/commands/config.ts:289 \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/commands/config.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f26b868d1754bfe2396d0c9d54da93bc0902826fe75370595577ce79a1e2a96"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/cli/src/commands/context.ts:604 \u00B7 packages/cli/src/commands/specs.ts:424 \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/commands/context.ts"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"39def5f66352e0376a906357764b9f9709936d538113408528f4f3ea0459a8da"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/cli/src/commands/context.ts:757 \u00B7 packages/cli/src/commands/walk.ts:400 \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/commands/context.ts"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2706162dd0f413b2d3acc98b636f628b247a7ae34c5c2e0eb0e144ac67304b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): packages/cli/src/commands/context.ts:1011 \u00B7 packages/cli/src/commands/plugin.ts:202 \u00B7 packages/cli/src/commands/plugin.ts:293 \u2014 the 3 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/commands/context.ts"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"236fb9c0afd4f7a4f8d08c71c869f2ecf098cbf65803af33102d804de8bf1e04"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/cli/src/commands/down.ts:206 \u00B7 packages/cli/src/commands/launch.ts:229 \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/commands/down.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"8683970c5d775c7aff296f081bb7b91657492ea0165237789937165345e7da8b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/cli/src/commands/host.ts:927 \u00B7 packages/daemon/src/routes/hosts.ts:862 \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/commands/host.ts"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3d096422df0481671ec72425accb5179304c0f870c41084ca0429b280406e6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/cli/src/commands/package.ts:62 \u00B7 packages/cli/src/commands/package.ts:219 \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/commands/package.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"05bcb6325f205b9a781735cd0df8f4e83e372c19e695fca9a4648b5ff678b922"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/cli/src/commands/package.ts:191 \u00B7 packages/cli/src/commands/package.ts:199 \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/commands/package.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e31e7c271dbc07144897b4396505fb1aa8630ec69ba3688e7587d7ce503810"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/cli/src/commands/plugin.ts:131 \u00B7 packages/cli/src/commands/specs.ts:212 \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/commands/plugin.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1f8153a867ca7b268935ba2693e79a1b25476424c99ecea2039cfd22e6331c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): packages/cli/src/commands/project-jev.ts:135 \u00B7 packages/cli/src/decisions/decisions.ts:158 \u2014 the two spans are one implementation copied and then locally edited \u2014 132 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/commands/project-jev.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c1e8900f6ed2a660c1339bbb1917711014ea28e625284010fdc3d4705feb44d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/cli/src/commands/provider.ts:253 \u00B7 packages/tui/src/usage/usage-model.ts:80 \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/commands/provider.ts"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94c547fc5d7ef0f27d06439615d14de9a994eba48deb30625ec90e5f56417ed"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/cli/src/commands/ps.ts:491 \u00B7 packages/cli/src/commands/ps.ts:508 \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/commands/ps.ts"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89e3a481f56a538e099571ffbea328273ddaf29ef78669ca59895b433cdd479"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/cli/src/commands/ps.ts:1586 \u00B7 packages/cli/src/commands/workflow-render.ts:137 \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/commands/ps.ts"},"region":{"startLine":1586}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae041f1d7794e82101c6e3aede0b1a9c67218f8777f8e0fc894c51bd888d250"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/cli/src/commands/ps.ts:1202 \u00B7 packages/cli/src/commands/startup-proof.ts:113 \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/commands/ps.ts"},"region":{"startLine":1202}}}],"partialFingerprints":{"codehealthFindingId/v1":"d35fe9d5e128da7ac8f1b904f952b490447834d60b4b6cac68f5939c1e533a32"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/cli/src/commands/queue.ts:1074 \u00B7 packages/cli/src/commands/queue.ts:1081 \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/commands/queue.ts"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"c001b34ece1398fa6082111e65d8e300f143ea7a2b33089f13e7ffba5731f45d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/cli/src/commands/queue.ts:1596 \u00B7 packages/cli/src/commands/queue.ts:1611 \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/commands/queue.ts"},"region":{"startLine":1596}}}],"partialFingerprints":{"codehealthFindingId/v1":"7175ed87e99002714203466a663b7ef87443fdcc88b14ae93c67ab461419c7f3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/cli/src/commands/queue.ts:1645 \u00B7 packages/cli/src/commands/queue.ts:1665 \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/commands/queue.ts"},"region":{"startLine":1645}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b344cf2d894c81d4554b591bd92b1dbedbea998a0945ee770eeb5cb4dc9d26b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): packages/cli/src/commands/restore-check.ts:310 \u00B7 packages/cli/src/commands/view.ts:70 \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/commands/restore-check.ts"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"14199469530f51bf41d3d9b73b2b1abe8748092300b0226cd986e0596f855e05"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/cli/src/commands/restore-packet.ts:374 \u00B7 packages/cli/src/commands/restore-packet.ts:453 \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/commands/restore-packet.ts"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"5780bbc70de5085bc429bc527d95955c8bafa21ae5a88f6461ed5316e9a5d3e3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/cli/src/commands/rig-mode.ts:456 \u00B7 packages/cli/src/commands/rig-mode.ts:501 \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/commands/rig-mode.ts"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"951a53b7aae191121488e61bd279cf183c9b961145e92b77cc5e081b9ba72ef0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): packages/cli/src/commands/scope.ts:1546 \u00B7 packages/daemon/src/domain/slices/slice-indexer.ts:1541 \u2014 the two spans are one implementation copied and then locally edited \u2014 55 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/commands/scope.ts"},"region":{"startLine":1546}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae7dc53db61e1200c86831e3a9c7df0c29919ac4508e9161471cb83b9dcd4945"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/cli/src/commands/seat.ts:1802 \u00B7 packages/cli/src/commands/transcript.ts:85 \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/commands/seat.ts"},"region":{"startLine":1802}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9863138444f9af6ff8b29c907147de78d151be8561fffb9b8de46ad5160c49"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): packages/cli/src/commands/send.ts:720 \u00B7 packages/cli/src/commands/walk.ts:306 \u2014 the two spans are one implementation copied and then locally edited \u2014 89 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/commands/send.ts"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe502ec7b2127fece7a0f88353938bc14f6cb533a976dadd6197d9c04e323083"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/cli/src/commands/usage.ts:81 \u00B7 packages/tui/src/cost/cost-model.ts:35 \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/commands/usage.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"840034d0d6c12574224bb52a8b806727e9baa723017bed545373f77ccc2842de"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/cli/src/config-store.ts:1614 \u00B7 packages/daemon/src/domain/user-settings/settings-store.ts:1252 \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/config-store.ts"},"region":{"startLine":1614}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ececf6c2debc0f8a2a1d7cf5180a0651d17e47787fc6df304b4091654bf9c1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/cli/src/lib/scope/progress-edit.ts:71 \u00B7 packages/daemon/src/domain/progress/progress-indexer.ts:201 \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/lib/scope/progress-edit.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"0190af8321ef9e202df2c0ed7a621d5b9cd82157c330b6848908aad6d95a8730"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): packages/cli/src/restore-packet/claude-transcript-parser.ts:90 \u00B7 packages/cli/src/restore-packet/claude-transcript-parser.ts:114 \u2014 the two spans are one implementation copied and then locally edited \u2014 66 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/cli/src/restore-packet/claude-transcript-parser.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"83885dce8b045b1323819cec36cb113ba42a6e4104570ce368d0eed2f266726b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): packages/daemon/assets/herdr-app/mods/rig-strip/main.js:86 \u00B7 packages/daemon/assets/herdr-app/mods/rig-strip/main.js:129 \u2014 the two spans are one implementation copied and then locally edited \u2014 74 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/daemon/assets/herdr-app/mods/rig-strip/main.js"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"7372da9d7bd6fabe36a1e0f31bbfc028f0b3035f03555abc6dbd8a445b470d15"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/assets/plugins/openrig-core/skills/claude-compaction-restore/scripts/precompact-hook.mjs:30 \u00B7 packages/daemon/assets/plugins/openrig-core/skills/claude-compaction-restore/scripts/restore-from-jsonl.mjs:423 \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/daemon/assets/plugins/openrig-core/skills/claude-compaction-restore/scripts/precompact-hook.mjs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ccd25d2821dd4d37937a7e1a1bf4aa9ccb1ee2f17b2fe7c637ac9ce1ef15330"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/adapters/claude-code-adapter.ts:1244 \u00B7 packages/daemon/src/adapters/codex-runtime-adapter.ts:1769 \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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":1244}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c82033d48c476f48835a0d8929837912c936d0c9a9286d5137c3d2ae1b48032"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/adapters/cmux-transport.ts:226 \u00B7 packages/daemon/src/adapters/cmux-transport.ts:262 \u2014 all 2 copies are in the same file, 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/daemon/src/adapters/cmux-transport.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c958b594337043a1168d4ca4f6890acb837b970c5b68d9a7fb3b2059fafdcb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): packages/daemon/src/adapters/pi-openrouter-charge.ts:84 \u00B7 packages/daemon/src/domain/gateway/slack/slack-api.ts:254 \u00B7 packages/daemon/src/domain/hosts/remote-daemon-http.ts:200 \u2014 the 3 copies are spread across 3 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/daemon/src/adapters/pi-openrouter-charge.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac8d2b5a69d797bbee296de7ee8717b867d4f89f3ee71cdea972cd24d215a92"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): packages/daemon/src/adapters/pi-runner.ts:886 \u00B7 packages/daemon/src/domain/claude-credential-precedence.ts:35 \u2014 the two spans are one implementation copied and then locally edited \u2014 62 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e51867615aebd302202154f94dd00f0096002253fc8be8ba3eefb199650a481"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/adapters/pi-runtime-adapter.ts:37 \u00B7 packages/daemon/src/adapters/stub-runtime-adapter.ts:34 \u2014 the 2 copies are spread across 2 files, 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/daemon/src/adapters/pi-runtime-adapter.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5bcd22a101ffc5104be0f4dc666bd04807c3712a584fde0751babc3f4bafb1e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): packages/daemon/src/adapters/pi-runtime-adapter.ts:98 \u00B7 packages/daemon/src/domain/claim-service.ts:167 \u00B7 packages/daemon/src/domain/self-attach-service.ts:116 \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/daemon/src/adapters/pi-runtime-adapter.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b2e57c2e5f86739b277add31387b73965fe4a4a4541ec7a5f667493e155cd6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/adapters/tmux.ts:1715 \u00B7 packages/daemon/src/adapters/tmux.ts:1735 \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/daemon/src/adapters/tmux.ts"},"region":{"startLine":1715}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f5f0776c35f26f7264f6d56b19cea1edaa4bba9b5367f85797d9fe8b0521cd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/domain/agent-manifest.ts:113 \u00B7 packages/daemon/src/domain/agent-manifest.ts:513 \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/daemon/src/domain/agent-manifest.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"9458f29b4b14bf4581c04927dbfec05116ee41856547556b03e8e42dea810db5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/domain/agent-manifest.ts:151 \u00B7 packages/daemon/src/domain/rigspec-schema.ts:1399 \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/daemon/src/domain/agent-manifest.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"3990c453f999857425fc6a38532229b0f3307b344f3f556e4d04750f8bd9a40d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/domain/bundle-archive.ts:128 \u00B7 packages/daemon/src/routes/bundles.ts:978 \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/daemon/src/domain/bundle-archive.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddea5fb5b034a26ea5151af909c4090e531778b611b78bc61ac67d8ecf21bb47"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/domain/bundle-archive.ts:141 \u00B7 packages/daemon/src/domain/bundle-source-resolver.ts:44 \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/daemon/src/domain/bundle-archive.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bed01d0b687e4b73b8162b5decbadbab918b817067c2ffd18066588fa4a6857"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/domain/bundle-types.ts:89 \u00B7 packages/daemon/src/domain/bundle-types.ts:341 \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/daemon/src/domain/bundle-types.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"accdc84848044c9881fabf1f2170fd8eefeee3da067b14d1583cdb052abc6819"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/domain/classifier-lease-manager.ts:409 \u00B7 packages/daemon/src/domain/stream-store.ts:234 \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/daemon/src/domain/classifier-lease-manager.ts"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"b310b951dbb5fa31160abc23f44e63adc81a0fd1b9dd94a381d654d7689e9c9c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/domain/claude-compaction-enforcer.ts:1230 \u00B7 packages/daemon/src/domain/claude-compaction-enforcer.ts:1260 \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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca8a232a91f082dea657f9b9e3f36060fa0226e40941c8ab15db455bb06a9277"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): packages/daemon/src/domain/claude-credential-precedence.ts:37 \u00B7 packages/daemon/src/domain/codex-member-permissions.ts:214 \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/daemon/src/domain/claude-credential-precedence.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"e97f78323104eac992571ff1085b56e41b462feda35df576a7f535e0f721239c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): packages/daemon/src/domain/claude-theme-menu.ts:4 \u00B7 packages/daemon/src/domain/native-model-picker.ts:23 \u2014 the two spans are one implementation copied and then locally edited \u2014 112 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/daemon/src/domain/claude-theme-menu.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"4690f9b58c0457ac9976cddd0f8558ed26522ca104e0c48e4ac6a52479242b1c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/domain/cmux-layout-service.ts:134 \u00B7 packages/daemon/src/domain/terminal/view-composer.ts:99 \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/daemon/src/domain/cmux-layout-service.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"7942c76f6897c2b340f28386e7e8957b49b164335c94d8fd859aedb87cc4ad1c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): packages/daemon/src/domain/discovery-repository.ts:58 \u00B7 packages/daemon/src/domain/discovery-repository.ts:70 \u2014 the two spans are one implementation copied and then locally edited \u2014 59 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/daemon/src/domain/discovery-repository.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc277de57c1991764a170facb12302626c6540c5b57c6480364f273d9a3226b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): packages/daemon/src/domain/existing-rig-restore.ts:147 \u00B7 packages/daemon/src/domain/existing-rig-restore.ts:254 \u2014 the two spans are one implementation copied and then locally edited \u2014 66 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/daemon/src/domain/existing-rig-restore.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb8bcf2a0b61de698a716e4c28ac24f730c381dcb002c3bf72055ebd68116f6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/domain/gateway/participants.ts:73 \u00B7 packages/daemon/src/domain/gateway/participants.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/daemon/src/domain/gateway/participants.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb354cba15933b6fc23c4a96276f17d5bf4d37dd36f74b6b31c17c085d7c4808"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/domain/gateway/slack/slack-subsystem.ts:727 \u00B7 packages/daemon/src/domain/gateway/slack/slack-subsystem.ts:749 \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/daemon/src/domain/gateway/slack/slack-subsystem.ts"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f47b63fc9b12dc7d9272db17ca87589dcc6227a0a8b4522689fd075533a30b9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/domain/harness-not-started-notice.ts:14 \u00B7 packages/daemon/src/domain/network/network-connector.ts:54 \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/daemon/src/domain/harness-not-started-notice.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b19db3ac20ff84f22b11a6e718844cf7fb1b0597a0e731595b2b7f77f75a5f6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): packages/daemon/src/domain/health-detectors.ts:328 \u00B7 packages/daemon/src/domain/health-detectors.ts:511 \u2014 the two spans are one implementation copied and then locally edited \u2014 75 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/daemon/src/domain/health-detectors.ts"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"b99d9dda89d8125859d46b1dd8f7735be2f4b460bd9942d353c3cd57f6c15a16"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/domain/model-divergence/current-generation-record.ts:105 \u00B7 packages/daemon/src/domain/model-divergence/current-generation-record.ts: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/model-divergence/current-generation-record.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a39dc3227421206ab524239c7be815a5e419f6a77fca019ec26e2b68330d98e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): packages/daemon/src/domain/native-model-picker.ts:23 \u00B7 packages/daemon/src/domain/native-model-picker.ts:34 \u2014 the two spans are one implementation copied and then locally edited \u2014 84 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/daemon/src/domain/native-model-picker.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc0d9d6ed3601ed65a0b3efd8fb3ef26b5bcb0c095bbac5649688300446022a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): packages/daemon/src/domain/native-process-lineage.ts:532 \u00B7 packages/daemon/src/domain/native-process-lineage.ts:750 \u00B7 packages/daemon/src/domain/workflow-validator.ts:273 \u2014 the 3 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/daemon/src/domain/native-process-lineage.ts"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"91bafe32ea96a376770dc633b9a6403987bd1e9ec3adea0a405c10d5cd759635"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/domain/network/hub-client.ts:69 \u00B7 packages/daemon/src/domain/plugin-discovery-service.ts:577 \u2014 the 2 copies are spread across 2 files, 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/daemon/src/domain/network/hub-client.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ca3c53299b82734bce48c2c03adfd01059f817724520612c6a0d844a7214d0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/domain/node-cmux-service.ts:93 \u00B7 packages/daemon/src/domain/node-cmux-service.ts:114 \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/daemon/src/domain/node-cmux-service.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f0c3d2143817286bc3e953d5d882d9c04727dd0daf055f1feef60e8d780c72"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5 locations): packages/daemon/src/domain/package-manifest.ts:180 \u00B7 packages/daemon/src/domain/package-manifest.ts:211 \u00B7 packages/daemon/src/domain/package-manifest.ts:254 \u00B7 packages/daemon/src/domain/package-manifest.ts:271 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 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/daemon/src/domain/package-manifest.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1ec782ab660cf37f6f03c8d4c03917589ca375fcf894bffc2cca59506b4c50"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/domain/package-manifest.ts:205 \u00B7 packages/daemon/src/domain/package-manifest.ts:276 \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/daemon/src/domain/package-manifest.ts"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d72918a6219c97974d660860bca77570defb64eabe8d23a56b632d0e35a4c46"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/domain/package-manifest.ts:294 \u00B7 packages/daemon/src/domain/package-manifest.ts:301 \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/daemon/src/domain/package-manifest.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d1e8f00d4355f850b5efd205f86ab9cebd2de2147de6e7d697b6326ec61da5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/domain/provider/subscription-move-report.ts:122 \u00B7 packages/daemon/src/domain/provider/subscription-move-report.ts:141 \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/daemon/src/domain/provider/subscription-move-report.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dbcf3d069beea2ed81fb769f0259ebf38b9d54165bd328df8050e1dd8859348"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/domain/queue-wake-repository.ts:223 \u00B7 packages/daemon/src/domain/queue-wake-repository.ts:240 \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/daemon/src/domain/queue-wake-repository.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9ff4c98d9a612314d3a9ac496f53ba81ef77c7e03598ab337ae3ca4498d19a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): packages/daemon/src/domain/restore-guidance.ts:277 \u00B7 packages/daemon/src/domain/restore-orchestrator.ts:1836 \u2014 the two spans are one implementation copied and then locally edited \u2014 65 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/daemon/src/domain/restore-guidance.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e97db5e230808a4193d97e9c519b53b8af13e94ea97cb5c7928983ce5b35f30"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/domain/restore-orchestrator.ts:2769 \u00B7 packages/daemon/src/domain/restore-orchestrator.ts:2781 \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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":2769}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9af8d344eb041f325f3f070defe75dd5f7e63b767098805bff66a2958d58f0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/domain/resume-metadata-refresher.ts:299 \u00B7 packages/daemon/src/domain/resume-metadata-refresher.ts:580 \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/daemon/src/domain/resume-metadata-refresher.ts"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5d43e3ec4341566055f71dbfab5c4aaf5a5f0983aafe8ee5b8e846b6418b11"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/domain/rig-repository.ts:935 \u00B7 packages/daemon/src/domain/rig-repository.ts:969 \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/daemon/src/domain/rig-repository.ts"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb565cc976be69a0a8cd61495dfa29dbc5bec496f46292ce7ca81d0a82c22b78"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/domain/rigspec-exporter.ts:161 \u00B7 packages/daemon/src/domain/rigspec-exporter.ts:254 \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/daemon/src/domain/rigspec-exporter.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e284df31f512a6ed3f70b440873b488a9b6a30b20d94b44895a9da8850749c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/domain/rigspec-instantiator.ts:717 \u00B7 packages/daemon/src/domain/rigspec-instantiator.ts:1566 \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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"426ea6e6bda820511072057ce37455eeb19d7af58751e7032164b9ce6c7b21fb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/domain/rigspec-instantiator.ts:1023 \u00B7 packages/daemon/src/domain/rigspec-instantiator.ts:1174 \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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2f8924d37161388900df4ba8cbd016c7c926ac0712fc33387576805b19810e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/domain/rigspec-instantiator.ts:1820 \u00B7 packages/daemon/src/domain/rigspec-instantiator.ts:1832 \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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":1820}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5168648e115854a38fa83f6b4705690f7d121463831928bb53719f75d03e7e2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/domain/rigspec-instantiator.ts:2497 \u00B7 packages/daemon/src/domain/rigspec-instantiator.ts:2986 \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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":2497}}}],"partialFingerprints":{"codehealthFindingId/v1":"326fb3e929c0a4b4b01163cee4b166ffee6b8d6eea0177b333b7359d90d2d15f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/domain/rigspec-schema.ts:148 \u00B7 packages/daemon/src/domain/rigspec-schema.ts:239 \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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f5b301a39e10f98eae28689119d22c19c1835780ae60b132d93ef637b8e600"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/domain/role-resolver.ts:65 \u00B7 packages/daemon/src/domain/role-resolver.ts:76 \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/daemon/src/domain/role-resolver.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"e253fbed713a445f06f324eb3420b0c1e8f88255000b2676ae4c43349c50f0a6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/domain/runtime-verifier.ts:171 \u00B7 packages/daemon/src/domain/runtime-verifier.ts:182 \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/daemon/src/domain/runtime-verifier.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a5490feffd73f18917ebe3adbbb8b0de3366dd14a34b3d11e5b9e832e6a582b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/domain/seat-lifecycle-service.ts:2497 \u00B7 packages/daemon/src/domain/seat-status-service.ts:108 \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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":2497}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5d3d5fbdfa8cc36214395e186e7d9dcb2c06981889296ebbf735879f955f91"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/domain/session-fingerprinter.ts:126 \u00B7 packages/daemon/src/domain/session-fingerprinter.ts:134 \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/daemon/src/domain/session-fingerprinter.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"d61800c08db6e34fefccdb3934c8bd958e99f17d19f00ba27767f666c65bd199"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/domain/toml-tables.ts:9 \u00B7 packages/daemon/src/domain/toml-tables.ts:26 \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/daemon/src/domain/toml-tables.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"214653cc94e794ae4f3339ee19dd663f1cb4ea9f58238c4f1771b36e2306e2af"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/domain/user-settings/settings-store.ts:23 \u00B7 packages/daemon/src/domain/user-settings/settings-store.ts:31 \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/daemon/src/domain/user-settings/settings-store.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf890a3e97b4a5ec3feebd080a59dfb48dbab31a7dc4a9e97eb185d8c568826"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/domain/workflow-runtime.ts:1051 \u00B7 packages/daemon/src/domain/workflow-runtime.ts:1451 \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/daemon/src/domain/workflow-runtime.ts"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7870b5a3af91b5aacc935caa08c6cac8f339ef288ef7c51c85d60360fd71399"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/domain/workflow-spec-cache.ts:718 \u00B7 packages/daemon/src/domain/workflow-spec-cache.ts:825 \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/daemon/src/domain/workflow-spec-cache.ts"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"1188e8950b539301d70d723bb4f6817820507f3e56a19c19a0c62d4796296cfb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): packages/daemon/src/domain/workspace/workspace-resolver.ts:68 \u00B7 packages/ui/src/components/WorkspaceKindBadge.tsx:56 \u2014 the two spans are one implementation copied and then locally edited \u2014 61 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/daemon/src/domain/workspace/workspace-resolver.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3bc30516511e57c6a1c6678e7e1fa80da03850844e630e897a5725bf59f4a6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/routes/attention.ts:121 \u00B7 packages/daemon/src/routes/attention.ts:152 \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/daemon/src/routes/attention.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4940545d94338b5924fbad453aa7206d7977f642c8ef1b3752c696c85eae850"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/routes/bootstrap.ts:39 \u00B7 packages/daemon/src/routes/bootstrap.ts:80 \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/daemon/src/routes/bootstrap.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce9f3c5d34308dcca5920f2058ef3e016408c563b26c9e9cf85703f6b520182"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/routes/bundles.ts:658 \u00B7 packages/daemon/src/routes/bundles.ts:678 \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/daemon/src/routes/bundles.ts"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d81a05f0dc210779ae38585992ca3d24940f6ce43e200d919e93990d4a42888"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 8 locations): packages/daemon/src/routes/mission-control.ts:83 \u00B7 packages/daemon/src/routes/mission-control.ts:96 \u00B7 packages/daemon/src/routes/projects.ts:32 \u00B7 packages/daemon/src/routes/queue.ts:260 \u00B7 \u002B4 more site(s) not listed \u2014 the 8 copies are spread across 7 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/daemon/src/routes/mission-control.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f400500843e4a8ff37978432dbcb5e90bc7a0a2663db1887406d806a3500d24"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/routes/progress.ts:27 \u00B7 packages/daemon/src/routes/slices.ts:40 \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/daemon/src/routes/progress.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2af0a89d1c14b2ce63cf90483d0c1dac895230d1e29017ef504050dcf19ac8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 8 locations): packages/daemon/src/routes/projects.ts:150 \u00B7 packages/daemon/src/routes/projects.ts:164 \u00B7 packages/daemon/src/routes/projects.ts:184 \u00B7 packages/daemon/src/routes/queue.ts:862 \u00B7 \u002B4 more site(s) not listed \u2014 the 8 copies are spread across 3 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/daemon/src/routes/projects.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4f8241b69f3e2682358bcaefc2bf4393746a7bc3a2b270cfdcfa71ea2e27a3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): packages/daemon/src/routes/queue.ts:1773 \u00B7 packages/daemon/src/routes/stream.ts:263 \u00B7 packages/daemon/src/routes/stream.ts:272 \u2014 the 3 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/daemon/src/routes/queue.ts"},"region":{"startLine":1773}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fcfce1a68c36dbbd00b38b1878a64f97e5d6bdf6930e4b38a493e6fd65e7cd0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/routes/review.ts:95 \u00B7 packages/daemon/src/routes/review.ts:103 \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/daemon/src/routes/review.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5129396f6180e667519af383fe402015443da28e29d48ffb3083968a27027ab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): packages/daemon/src/routes/rigs.ts:362 \u00B7 packages/daemon/src/routes/rigs.ts:400 \u00B7 packages/daemon/src/routes/rigs.ts:445 \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/daemon/src/routes/rigs.ts"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e64ccee5a7e70d1ae3c3d8b93cf35f8aa926c02398b4515dd4f74b183f4147a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/routes/rigspec.ts:228 \u00B7 packages/daemon/src/routes/rigspec.ts:283 \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/daemon/src/routes/rigspec.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1792329f4834a5d8015cd59f93653a445d80809206fe76b8a6404c05b826eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/routes/seat.ts:93 \u00B7 packages/daemon/src/routes/seat.ts:139 \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/daemon/src/routes/seat.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc4d7939d005a534c8c94c26b0a6e50f96e64e3c99389d730963bade3e0711f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): packages/daemon/src/routes/seat.ts:626 \u00B7 packages/daemon/src/routes/seat.ts:655 \u00B7 packages/daemon/src/routes/seat.ts:704 \u00B7 packages/daemon/src/routes/seat.ts:715 \u2014 all 4 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/daemon/src/routes/seat.ts"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"1389a55bbcbb49614e26cec29998dbece61431761a524d59fe0bf7b67a240a02"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/routes/slices.ts:139 \u00B7 packages/daemon/src/routes/slices.ts:199 \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/daemon/src/routes/slices.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e817eea84e07c84e5422f86b1426d37d1a64a7e3f5810106f1220085323bc9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/routes/stream.ts:114 \u00B7 packages/daemon/src/routes/stream.ts:121 \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/daemon/src/routes/stream.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6498c01901b5fa3596ef4712cf5e03f1e3c33e3ce8f297b1ffc660b10256bf2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): packages/daemon/src/routes/transcripts.ts:156 \u00B7 packages/daemon/src/routes/transcripts.ts:205 \u00B7 packages/daemon/src/routes/transcripts.ts:259 \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/daemon/src/routes/transcripts.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"7043d671167b8dcc7340d2b1243e26e503c46ef6ebe272ee2b7259ac6b54bb9c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/routes/up.ts:391 \u00B7 packages/daemon/src/routes/up.ts:407 \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/daemon/src/routes/up.ts"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"c114ecb898ddcbfa3b878a0e4d21bf6ec81a6b32d1902678ddba7d772bef3922"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/daemon/src/startup.ts:1225 \u00B7 packages/daemon/src/startup.ts:1254 \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/daemon/src/startup.ts"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22e2947b371f0e693f01236702a37dcb13c07a486ccb92192619f7c3b18c929"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): packages/tui/src/crash-cart/render-crash-cart.ts:9 \u00B7 packages/tui/src/pulse/render-pulse.ts:9 \u2014 the two spans are one implementation copied and then locally edited \u2014 113 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/tui/src/crash-cart/render-crash-cart.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"6421fadfae897829d9457be83d5def0662c307ac4c6142e625724f0eaf5f680d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/tui/src/execution/execution-model.ts:348 \u00B7 packages/tui/src/health/health-model.ts:63 \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/tui/src/execution/execution-model.ts"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"f304e28ae14b9c9ebe0fbf9e8a1d7a4dd5fbf21a8fee49b4da7bb951f67f3f08"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/tui/src/main.ts:330 \u00B7 packages/tui/src/main.ts:350 \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/tui/src/main.ts"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a8a26631c881b646a13c6c70e28ecc312970a335569b98dd0a68e512ccc26e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/tui/src/render.ts:205 \u00B7 packages/tui/src/render.ts:214 \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/tui/src/render.ts"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a8fa1a25cd29c38d3913df7f36fb07661266ca7e607652cb16791322db3044c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/tui/src/state.ts:525 \u00B7 packages/tui/src/state.ts:544 \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/tui/src/state.ts"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"828a49b6b59bf61b84b74c8b183608baa6f8034ad96ee30d865a5af8f2b0ae8e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/ui/src/components/LiveNodeDetails.tsx:382 \u00B7 packages/ui/src/components/LiveNodeDetails.tsx:389 \u2014 all 2 copies are in the same file, 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/ui/src/components/LiveNodeDetails.tsx"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cde99f5b69163b9d36aa79182532066db1a9d907e63fe4622d84c88d6580b6d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/ui/src/components/feed/cards/storytelling-cards.tsx:688 \u00B7 packages/ui/src/lib/attention-feed.ts:159 \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/ui/src/components/feed/cards/storytelling-cards.tsx"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"865c9ea9739cc2ddcaa16bd940b5075b71818b774c2cd9ce9b33368c64114e32"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 21 locations): packages/ui/src/components/graphics/RuntimeMark.tsx:92 \u00B7 packages/ui/src/components/graphics/RuntimeMark.tsx:102 \u00B7 packages/ui/src/components/graphics/RuntimeMark.tsx:114 \u00B7 packages/ui/src/components/graphics/RuntimeMark.tsx:124 \u00B7 \u002B17 more site(s) not listed \u2014 all 21 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/ui/src/components/graphics/RuntimeMark.tsx"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"0172d8f22b58abe6f9d9cf5f3b5cef3359664a81ea7dde0012bc2e42414192da"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/ui/src/components/lab/VellumBackgroundLab.tsx:475 \u00B7 packages/ui/src/components/lab/VellumBackgroundLab.tsx:526 \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/ui/src/components/lab/VellumBackgroundLab.tsx"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba400581a2530cc1b540a442f6f135bf60285ffbc3fcd955fa12d07402de5b1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/ui/src/components/markdown/blocks.tsx:36 \u00B7 packages/ui/src/components/markdown/blocks.tsx:46 \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/ui/src/components/markdown/blocks.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e39ec2b90e67330fa3ab65c7d76b8455800703530862fa5fe2415ace76f740a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/ui/src/components/project/ScopePages.tsx:304 \u00B7 packages/ui/src/components/project/ScopePages.tsx:414 \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/ui/src/components/project/ScopePages.tsx"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"add95b282fbfe8401f5a01d058028a042791b973f144bea658de72a6e950b750"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/ui/src/hooks/useSpecReview.ts:114 \u00B7 packages/ui/src/hooks/useSpecReview.ts:122 \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/ui/src/hooks/useSpecReview.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c54b8737ecbdebcf765830e86c02188415d81721e09a9d7bfa69b64e24cc2df"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): packages/ui/src/lib/graph-layout.ts:65 \u00B7 packages/ui/src/lib/hybrid-layout.ts:139 \u2014 the two spans are one implementation copied and then locally edited \u2014 54 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/ui/src/lib/graph-layout.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bed3907a17a7b49222a1f1161e1b011170cc19282e963ed7fd3820208ad675e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): scripts/check-internal-leak-guard.mjs:202 \u00B7 scripts/mirror-skills.mjs:558 \u2014 the two spans are one implementation copied and then locally edited \u2014 55 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":"scripts/check-internal-leak-guard.mjs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"b55282cfcfceae6a03341d3364702ad4f71dfbb06df0fa9795fe347d64b8403a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/cli/src/acp/json-rpc-stdio.ts:88 \u00B7 packages/daemon/src/domain/model-divergence/effective-model-readers.ts:300 \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/acp/json-rpc-stdio.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d70fe61f3d7a7ce49c0c7970b4489e32f4dcd6151eb111d3d09628e79d1f377"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5 locations): packages/cli/src/commands/adopt.ts:79 \u00B7 packages/cli/src/commands/agent.ts:19 \u00B7 packages/cli/src/commands/export.ts:59 \u00B7 packages/cli/src/commands/import.ts:40 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 5 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/commands/adopt.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fcb7a315260607228700388fb05d37fecb10df2a97ba15f5903f9b15f2d752c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/cli/src/commands/auth.ts:71 \u00B7 packages/cli/src/commands/auth.ts:86 \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/commands/auth.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6288bfef039211fcfc5a57e26d8830569e22f2669495673dfd17c4268ed865"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): packages/cli/src/commands/auth.ts:119 \u00B7 packages/cli/src/commands/auth.ts:132 \u00B7 packages/cli/src/commands/auth.ts:177 \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/commands/auth.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bea23c138893ecb653365336a3da44bb649250533c8341d8fac237f6bb9a1aa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/cli/src/commands/bootstrap.ts:97 \u00B7 packages/cli/src/commands/bootstrap.ts:106 \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/commands/bootstrap.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"91bf1361cff89b1991f1c5684069ccfaa5abb2307cfe0472d6eb641f88ca047b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/cli/src/commands/bootstrap.ts:136 \u00B7 packages/cli/src/commands/up.ts:801 \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/commands/bootstrap.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"f93600a22a8818dbef485bbdcc523e80e9d3a7191f6d8a177e4fefa461f7416b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/cli/src/commands/broadcast.ts:244 \u00B7 packages/cli/src/commands/send.ts:1241 \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/commands/broadcast.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0332a8d630844650ee21064ae4b69f0b9c3a25bc824bc97a6f07888ef20048a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/cli/src/commands/chatroom.ts:119 \u00B7 packages/cli/src/commands/mcp.ts:163 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 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/commands/chatroom.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"3547636aab591d088bb1bfd25243a4f90b8b69eeadba3040c6906c7b5dabcc8f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/cli/src/commands/chatroom.ts:57 \u00B7 packages/cli/src/commands/policy.ts:127 \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/commands/chatroom.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"1159aec61b709f6ebe110ae0c21e4385c3a8edb050dd5c71faea39465903aff2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/cli/src/commands/down.ts:220 \u00B7 packages/cli/src/commands/grow.ts:72 \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/commands/down.ts"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"050d101cac8b76e2862f2ef338ce68a3685bcaf11016a93f663223b883e9567a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/cli/src/commands/down.ts:306 \u00B7 packages/cli/src/commands/down.ts:314 \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/commands/down.ts"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca9e4ef6c00d7daa437060ae05f202bf8a360cb5ae94de857bf260a25d0b0ba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/cli/src/commands/expand.ts:102 \u00B7 packages/cli/src/commands/shrink.ts:90 \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/commands/expand.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d15d942d9f834de71261dcf7a20acca5be649c63509f4fca0749bc42d1d794"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/cli/src/commands/expand.ts:110 \u00B7 packages/cli/src/commands/rig.ts:312 \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/commands/expand.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b91be7d991ee53427e3b2d2d5bee65935e74ec81e3c61e48eab581dc9c5f4d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/cli/src/commands/gateway.ts:588 \u00B7 packages/cli/src/commands/parked.ts:81 \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/commands/gateway.ts"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a6fd757fdc4c552a3f9b2f48d8a7d48a52d64dfdb9954bfd8693df478ed7dd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/cli/src/commands/host.ts:912 \u00B7 packages/daemon/src/routes/hosts.ts:846 \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/commands/host.ts"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"b553ca196731458b49d7d32259281e1d63488d4a98e3f75b3366258fa9bc441c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/cli/src/commands/plugin.ts:237 \u00B7 packages/cli/src/commands/plugin.ts:246 \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/commands/plugin.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2bd1188cc0f981fa9229133a1d0de4d7744a7c65486b86e00b3df825cbb413d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/cli/src/commands/plugin.ts:440 \u00B7 packages/daemon/src/domain/restore-check-service.ts:1902 \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/commands/plugin.ts"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"704a7bc1821c8670c80e010ffb7360f94943452371f3d460e4aed444f97373f3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/cli/src/commands/project-jev.ts:102 \u00B7 packages/cli/src/decisions/decisions.ts:176 \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/commands/project-jev.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31647fd0b26dba2d51cd67ffbf0fe1e1d3dad1b23b5470376ab0a976171dbf0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/cli/src/commands/project-jev.ts:20 \u00B7 packages/daemon/src/domain/classification-sources.ts:103 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 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/commands/project-jev.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c662bb371cdc74007d40c2a9a91f9261ea39cd378514a825ac26bb569c50565"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): packages/cli/src/commands/ps.ts:1820 \u00B7 packages/cli/src/commands/whoami.ts:549 \u00B7 packages/cli/src/commands/whoami.ts:557 \u2014 the 3 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/commands/ps.ts"},"region":{"startLine":1820}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11ec9167da89aaf31a8e9b5a5ade21d3dd6e2e111f7993746ce6951d0c52f52"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/cli/src/commands/queue.ts:1786 \u00B7 packages/cli/src/commands/queue.ts:1870 \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/commands/queue.ts"},"region":{"startLine":1786}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a654409527ad2efaeba00bdc2e9efc9415e3ddab18d507c1a6c11e258bf1b9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/cli/src/commands/queue.ts:1051 \u00B7 packages/daemon/assets/plugins/openrig-core/hooks/scripts/refocus.cjs:77 \u2014 the two spans are one implementation copied and then locally edited \u2014 62 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/commands/queue.ts"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae06eabe4da74dc7b89cc6cc216e4ea41af1c13c83930cc82f4ba3e10ca7705f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6 locations): packages/cli/src/commands/restore.ts:127 \u00B7 packages/cli/src/commands/seat.ts:710 \u00B7 packages/cli/src/commands/seat.ts:848 \u00B7 packages/cli/src/commands/seat.ts:1186 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 copies are spread across 3 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/commands/restore.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"e141e9edc611942b1401da9a2594cdbdc74b0bfd71e629d880a0208f7152052c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/cli/src/commands/restore.ts:200 \u00B7 packages/cli/src/commands/up.ts:936 \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/commands/restore.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ac3dc24e75efb2ad11c070c4ec4d4e8d283d7b40f7705e741a147eaf7848a7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/cli/src/commands/rig.ts:57 \u00B7 packages/cli/src/commands/rig.ts:68 \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/commands/rig.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8fe980e243d38b195638910c8ff961f66077352f0ebff4803e02590da260a5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): packages/cli/src/commands/seat.ts:1577 \u00B7 packages/cli/src/commands/seat.ts:1659 \u00B7 packages/cli/src/commands/seat.ts:1666 \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/commands/seat.ts"},"region":{"startLine":1577}}}],"partialFingerprints":{"codehealthFindingId/v1":"09408a683241fdcc9b1afefd51c19dd9a86653eabcef5d317a9b0a9a14bf3839"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/cli/src/commands/slack.ts:224 \u00B7 packages/cli/src/commands/slack.ts:483 \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/commands/slack.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"32ac94c50a2ddebe17063d50fd64305d1608b69c35fee01602685b62240ab024"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/cli/src/commands/snapshot.ts:22 \u00B7 packages/cli/src/commands/snapshot.ts:51 \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/commands/snapshot.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7aff00ad3c16ddc7f427463416611986694bf2efe58cac82de231d3e69a6ee4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/cli/src/commands/start.ts:488 \u00B7 packages/cli/src/commands/start.ts:613 \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/commands/start.ts"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"803ac6f22cfd62e1238096299e20e814576c0285d51ee89d74f08e9403945b76"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/cli/src/commands/start.ts:559 \u00B7 packages/cli/src/commands/up.ts:728 \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/commands/start.ts"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"a732419ff6cf50500da498c79842b897caecbbb98f154b4f718973f56f06859a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/cli/src/commands/up.ts:483 \u00B7 packages/cli/src/commands/up.ts:494 \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/commands/up.ts"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6c4c00ea8a1197c425d5860c5e373ff9c9e89c7037251728332b0431e537dc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/cli/src/commands/workflow-render.ts:223 \u00B7 packages/cli/src/commands/workflow-render.ts:414 \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/commands/workflow-render.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca76b1a354bc85ff9a5a594f6be505e110ef71a8d034e54dfa7d674d89c1932d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/cli/src/commands/workflow.ts:547 \u00B7 packages/cli/src/commands/workflow.ts:1091 \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/commands/workflow.ts"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"a62c9d3e4f1711b2846d515969e764b1eba5fbc8b2acd69e564c7da80f1274df"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/cli/src/commands/workspace.ts:274 \u00B7 packages/cli/src/commands/workspace.ts:289 \u2014 the two spans are one implementation copied and then locally edited \u2014 59 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/cli/src/commands/workspace.ts"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d7ccbe65e07dc848f1ab5033006cd05d01dcd1f04668bb93cb56874a7808f1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): packages/cli/src/config-store.ts:1074 \u00B7 packages/cli/src/config-store.ts:1084 \u00B7 packages/daemon/src/domain/user-settings/settings-store.ts:900 \u00B7 packages/daemon/src/domain/user-settings/settings-store.ts:910 \u2014 the 4 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/config-store.ts"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fb3c059fa9426e09a15394fa4f0dfd8c141f715231f65c6dba4f5a37d43001b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/cli/src/config-store.ts:1776 \u00B7 packages/daemon/src/domain/user-settings/settings-store.ts:1559 \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/config-store.ts"},"region":{"startLine":1776}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b824b69c47923e1a16c4d287ea4fbfc39c6c1aa27150c7fa43b58ac793e56c4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/cli/src/daemon-lifecycle.ts:1409 \u00B7 packages/cli/src/daemon-lifecycle.ts:1430 \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/daemon-lifecycle.ts"},"region":{"startLine":1409}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2384ea605dd9292a36b7c003955e3c29abc1cd9985f6dbe6b0c4f14bb4861d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/cli/src/lib/context-git.ts:74 \u00B7 packages/daemon/src/domain/context-packs/context-pack-library-service.ts:96 \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/lib/context-git.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac673d8df67c6e81efe359647cd862afb90f0d0b6117206eb751b494f4a5115"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/cli/src/lib/reconstruction-reader.ts:115 \u00B7 scripts/testbed-manifest.mjs:38 \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":"packages/cli/src/lib/reconstruction-reader.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8715da91e58adf25d388a8aad98b88e16b01e11a2cc9a481f1d504c4f73fdb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/cli/src/lib/scope/trust.ts:67 \u00B7 packages/daemon/src/domain/skill-audit.ts:135 \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/lib/scope/trust.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a0306c2faee7d01d918e92f30f1af2e484049ff55477d2db78b867ac411af5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/cli/src/lib/work-install.ts:98 \u00B7 packages/daemon/src/daemon-db-path.ts:36 \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/lib/work-install.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b12cd601ce10ad966e1913d0f9bc598db679757000a240b920a7cf2072ace75"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/cli/src/mcp-server.ts:478 \u00B7 packages/cli/src/mcp-server.ts:528 \u2014 all 2 copies are in the same file, 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/cli/src/mcp-server.ts"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"0751c92273d55ca99420afcaa1b3848978c4b1f1f8c7edf8c58b36fdbee118d9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/cli/src/release-surface/affected-skills.ts:48 \u00B7 packages/cli/src/release-surface/affected-skills.ts:54 \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/release-surface/affected-skills.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa389e200159d94e6ae067f1f19d4cba88d59087d54c6e55a20f972ee5dd77b6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): packages/daemon/assets/claude-hook-bridge.cjs:32 \u00B7 packages/daemon/src/adapters/pi-runner.ts:2014 \u00B7 packages/daemon/src/adapters/stub-runner.ts:283 \u2014 the 3 copies are spread across 3 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/daemon/assets/claude-hook-bridge.cjs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"4593d70a683e0761fa53e9dc541a2bcd670e4d4e62301196a28c50d47d1e22f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/assets/plugins/openrig-core/hooks/scripts/activity-relay.cjs:84 \u00B7 packages/daemon/assets/plugins/openrig-core/hooks/scripts/activity-relay.cjs:347 \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/daemon/assets/plugins/openrig-core/hooks/scripts/activity-relay.cjs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"be81179e24fd0103acd9287a1aae0687127804c79706cc937061356427fb21ca"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/scripts/probe-health-calibration.mjs:27 \u00B7 packages/daemon/scripts/probe-passive-ceremony.mjs:28 \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/daemon/scripts/probe-health-calibration.mjs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6b8fb56770737682f58706111599e35effc0c7b6272af6524fc1a78f75ca65c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/adapters/claude-code-adapter.ts:470 \u00B7 packages/daemon/src/adapters/claude-code-adapter.ts:505 \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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"d76ae6e086aa54b0f0b8a56a287ac30ad73f71216dc134d7160f51e238b93a85"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/adapters/cmux-transport.ts:363 \u00B7 packages/daemon/src/adapters/cmux-transport.ts:385 \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/daemon/src/adapters/cmux-transport.ts"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab7584693d84614683d9c190d6c973f22a2ecf39130d992ee35fae8cee123fe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/adapters/pi-runner.ts:2466 \u00B7 packages/daemon/src/adapters/stub-runner.ts:361 \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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":2466}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee0aac85193e7e87b2c91be2fd77f952f119194822268d516d0639d26af4c7c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/daemon/src/adapters/pi-runner.ts:1079 \u00B7 packages/daemon/src/domain/model-divergence/effective-model-readers.ts:300 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"529e7eec2212ffcdbb02c5810bf0fa80da1bd2c80b5ed388ac790ed8e4d17167"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): packages/daemon/src/adapters/tmux.ts:2484 \u00B7 packages/daemon/src/adapters/tmux.ts:2511 \u00B7 packages/daemon/src/adapters/tmux.ts:2525 \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/daemon/src/adapters/tmux.ts"},"region":{"startLine":2484}}}],"partialFingerprints":{"codehealthFindingId/v1":"164e133fdfe4ec1b05a1581ae3fe81740b42ab83d10e570bde883c2a09596801"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/agent-images/agent-image-library-service.ts:188 \u00B7 packages/daemon/src/domain/agent-images/agent-image-library-service.ts:197 \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/daemon/src/domain/agent-images/agent-image-library-service.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc7e68f77c2865b90ff3de2aa65d1c107fc9fbc63268752ca4be68a136cce715"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/daemon/src/domain/agent-images/agent-image-library-service.ts:39 \u00B7 packages/daemon/src/domain/spec-library-workflow-scanner.ts:333 \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/daemon/src/domain/agent-images/agent-image-library-service.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"8edc2b17d5b11204970d28da846119e2d2a29af97a0666285bb09b894bdff431"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): packages/daemon/src/domain/agent-manifest.ts:168 \u00B7 packages/daemon/src/domain/rigspec-schema.ts:152 \u00B7 packages/daemon/src/domain/rigspec-schema.ts:242 \u2014 the 3 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/daemon/src/domain/agent-manifest.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"964788d10a40702bf4be93410d9172509c9b9cebbb96d14b3abbddf3589c4ba3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/bootstrap-orchestrator.ts:221 \u00B7 packages/daemon/src/domain/bootstrap-orchestrator.ts:236 \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/daemon/src/domain/bootstrap-orchestrator.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9beff4dbb43842db09eea0db80ec1d74f244b7ffe8efde2aadb71958a098393"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): packages/daemon/src/domain/bootstrap-orchestrator.ts:299 \u00B7 packages/daemon/src/domain/bootstrap-orchestrator.ts:327 \u00B7 packages/daemon/src/domain/bootstrap-orchestrator.ts:369 \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/daemon/src/domain/bootstrap-orchestrator.ts"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"458ec7b31d462f233913eb61f47a3a1d8ddc3cd0559d768b4dd1f61b27f82614"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/daemon/src/domain/bootstrap-orchestrator.ts:169 \u00B7 packages/daemon/src/routes/bundles.ts:127 \u2014 the two spans are one implementation copied and then locally edited \u2014 61 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/daemon/src/domain/bootstrap-orchestrator.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae0f5512a5ee2e653f8f922161e736d58647df745b66a0d6552857a05ae44fd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/bundle-archive.ts:173 \u00B7 packages/daemon/src/routes/bundles.ts:345 \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/daemon/src/domain/bundle-archive.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea92da38253d8f2f4956e0b98ef1c1ecd15aa5448c036ba72a9ed6f8df532fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/daemon/src/domain/bundle-behaviour-inspect.ts:11 \u00B7 packages/daemon/src/routes/bundles.ts:367 \u2014 the two spans are one implementation copied and then locally edited \u2014 60 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/daemon/src/domain/bundle-behaviour-inspect.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f01bdc09a9ef1b12fa4a8dcb9e1e12377d578b9f4483ffcc6f21f1ddfc91e15e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/bundle-types.ts:499 \u00B7 packages/daemon/src/domain/bundle-types.ts:661 \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/daemon/src/domain/bundle-types.ts"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfbe0c29ef3b7147cb27e3e19edece492ee4bd48b85768bb45c5a8aed596d496"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): packages/daemon/src/domain/codex-network-default.ts:186 \u00B7 packages/daemon/src/domain/provider/codex-usage-reader.ts:116 \u00B7 packages/daemon/src/domain/terminal/herdr-transport.ts:125 \u00B7 packages/tui/src/socket-server.ts:201 \u2014 the 4 copies are spread across 4 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/daemon/src/domain/codex-network-default.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ea5a91fae552e4ad66c2e9aae80cb6b6c44530163d66c87fb683cd1d608660a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): packages/daemon/src/domain/context-packs/manifest-parser.ts:288 \u00B7 packages/daemon/src/domain/context-packs/manifest-parser.ts:467 \u00B7 packages/daemon/src/domain/context-packs/manifest-parser.ts:474 \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/daemon/src/domain/context-packs/manifest-parser.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"595544c1034568cae6189a451db7c78cba6d7f71e38d03251d33d14eddee9052"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/daemon/src/domain/desired-claude-activity-hooks.ts:37 \u00B7 packages/daemon/src/domain/desired-claude-activity-hooks.ts:59 \u2014 the two spans are one implementation copied and then locally edited \u2014 61 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/daemon/src/domain/desired-claude-activity-hooks.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca68a0fc3f63335a333155aefd2df99daf2540ab5086608dd1370c9d45538ec0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/daemon/src/domain/environment-startup.ts:164 \u00B7 packages/daemon/src/domain/environment-startup.ts:238 \u2014 the two spans are one implementation copied and then locally edited \u2014 149 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/daemon/src/domain/environment-startup.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dca7e93e6d6e8accbe36f6243aa76b62461446f74926329d05468fb47a4f3a4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/execution-view.ts:911 \u00B7 packages/daemon/src/domain/execution-view.ts:1272 \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/daemon/src/domain/execution-view.ts"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7381bfb9109d6a78ab3c46226bfe2a866b4dce71336e8385c3022c37314b42"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/gateway/human-registry.ts:164 \u00B7 packages/daemon/src/domain/gateway/protocol.ts:46 \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/daemon/src/domain/gateway/human-registry.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6dbd348c3e5b6bca0c6c7ee6130e9313fb84333e52f354e9259f3d339f072a2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/gateway/human-registry.ts:370 \u00B7 packages/daemon/src/domain/gateway/human-registry.ts:690 \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/daemon/src/domain/gateway/human-registry.ts"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd86898fe971659250cfa010632e5c2932ae40f29cf7051c87f5c893a52d9dbb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/gateway/protocol.ts:48 \u00B7 packages/daemon/src/domain/gateway/relay-outbound.ts:113 \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/daemon/src/domain/gateway/protocol.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0889b337087dfbc43faf8c3511890fb032b991a572e0780bbf8b67ba9c2c3e5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/gateway/slack/config.ts:188 \u00B7 packages/daemon/src/domain/gateway/slack/config.ts:201 \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/daemon/src/domain/gateway/slack/config.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"7431d76408693e73902e82e18552015dba712020f4920636347bcdb7d28009b0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/gateway/slack/inbound.ts:457 \u00B7 packages/daemon/src/domain/gateway/slack/inbound.ts:469 \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/daemon/src/domain/gateway/slack/inbound.ts"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7dc6d59913ecd41190dd1750977480c8329fe9046f917b3b78f564650de2e1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/gateway/slack/slack-delivery.ts:282 \u00B7 packages/daemon/src/domain/gateway/slack/slack-delivery.ts:483 \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/daemon/src/domain/gateway/slack/slack-delivery.ts"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d3f67734f063941a919ae5cf00fbe5f3aa32e4d6f6e754e88629076c182c9e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/gateway/slack/slack-delivery.ts:393 \u00B7 packages/daemon/src/domain/gateway/slack/slack-delivery.ts:503 \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/daemon/src/domain/gateway/slack/slack-delivery.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ccc5f81ef2a56f8499d5d4239011a1af370f9dad53b24598bbc560295936ce4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/gateway/slack/slack-subsystem.ts:1072 \u00B7 packages/daemon/src/domain/gateway/slack/slack-subsystem.ts:1187 \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/daemon/src/domain/gateway/slack/slack-subsystem.ts"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9dc1a81404e5e7db0812266d6171741c983d1e84e2c60aa6a44ad7340ecc291"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/gateway/transport.ts:61 \u00B7 packages/daemon/src/domain/terminal/herdr-transport.ts:123 \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/daemon/src/domain/gateway/transport.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bebbdd0524a852d0a19a604ca833117bb99e21cba2fd409566008832f759487"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/history-query.ts:212 \u00B7 packages/daemon/src/domain/history-query.ts:250 \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/daemon/src/domain/history-query.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"a93d9dbb75fb68039eb25caf1b7736de4b6f91fb6fa4fd0156d6b35c2b959ab0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/model-divergence/current-generation-record.ts:98 \u00B7 packages/daemon/src/domain/model-divergence/current-generation-record.ts:233 \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/daemon/src/domain/model-divergence/current-generation-record.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad227c052590a953cb2e184f4a253c867a37471e1cc0f6217aaa8cb8697a3e67"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/native-process-lineage.ts:347 \u00B7 packages/daemon/src/domain/native-process-lineage.ts:395 \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/daemon/src/domain/native-process-lineage.ts"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"359c1ff3305572e716bc6b5c7813f5b94cb2e89b8376be65fec011ed5db49b7c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/native-process-lineage.ts:366 \u00B7 packages/daemon/src/domain/native-process-lineage.ts:411 \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/daemon/src/domain/native-process-lineage.ts"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc300feffc7e51e530a2791e61337937eef3e23ee3e4b76d00797618d1cba7d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/native-resume-probe.ts:1088 \u00B7 packages/daemon/src/domain/native-resume-probe.ts:1096 \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/daemon/src/domain/native-resume-probe.ts"},"region":{"startLine":1088}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d2beb5c6c7bc6e93a4f18152509875a0d20f2b91e25aaa0624f580e30ee6bf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/node-launcher.ts:458 \u00B7 packages/daemon/src/domain/successor-session-launcher.ts:653 \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/daemon/src/domain/node-launcher.ts"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"b972081fe524fe0957dc0fb47ab8b63b0873a7c0fb8433bca5683b5e946af0cd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/outbox-handler.ts:215 \u00B7 packages/daemon/src/domain/outbox-handler.ts:223 \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/daemon/src/domain/outbox-handler.ts"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"a293d3f4ca6bbe3d3f065aaf7fda0043838e642d79b8178884d8f46e5662d701"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/package-manifest.ts:126 \u00B7 packages/daemon/src/domain/rigspec-schema.ts:1403 \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/daemon/src/domain/package-manifest.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da9b31d90b7bdaec90d3d2220bc7fb3782e06a0a4892f5c57c6095d8bec7b86"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/plugin-vendor-service.ts:367 \u00B7 packages/daemon/src/routes/packages.ts:49 \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/daemon/src/domain/plugin-vendor-service.ts"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c633ea4e0131d1ab781ee014ca4e7bad79cc28e75f6063a5e42b4e96dac16c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/policies/mode-scheduled-end.ts:177 \u00B7 packages/daemon/src/domain/policies/quiet-release.ts:327 \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/daemon/src/domain/policies/mode-scheduled-end.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"07311b7888dd3b4a8943c17cfc57700d0f228aa44c396c465a4a0776af09beda"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/daemon/src/domain/project-lifecycle-compiler.ts:327 \u00B7 packages/daemon/src/domain/workflow-reconciliation.ts:136 \u2014 the two spans are one implementation copied and then locally edited \u2014 72 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/daemon/src/domain/project-lifecycle-compiler.ts"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"732a75991ad3b0e7cfa09ffcb275dbc89e58987e8415aefa2eccc2e42baa3199"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/provider/claude-usage-reader.ts:153 \u00B7 packages/daemon/src/routes/bundles.ts:199 \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/daemon/src/domain/provider/claude-usage-reader.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"8659379894ac41022fed105e2453115a16088c68fac534524c3a585c7a4d6428"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/provider/claude-usage-windows.ts:145 \u00B7 packages/daemon/src/domain/provider/usage-windows.ts:227 \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/daemon/src/domain/provider/claude-usage-windows.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"92adf945580071338f5d5d397c9e6c4085186f8fcce3f00ed5e1791d90dcf6be"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/ps-projection.ts:351 \u00B7 packages/ui/src/lib/activity-visuals.ts:174 \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/daemon/src/domain/ps-projection.ts"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"829fd447ea125364e49dcc7be93fe4231e4ed4b0b19dab8042821fb883964820"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): packages/daemon/src/domain/queue-stuck-sweep.ts:1249 \u00B7 packages/daemon/src/domain/queue-stuck-sweep.ts:1257 \u00B7 packages/daemon/src/domain/queue-stuck-sweep.ts:1264 \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/daemon/src/domain/queue-stuck-sweep.ts"},"region":{"startLine":1249}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b7fee3e49f527b9d9b5be0dd277a557eea7620ea16138e5b125ec779589295"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/queue-transition-log.ts:74 \u00B7 packages/daemon/src/domain/queue-transition-log.ts:149 \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/daemon/src/domain/queue-transition-log.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe3d2a7ee5e7fef05677b581ec9dd75228e59592635371db185ad94cec871d2f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/daemon/src/domain/queue-wait-backoff.ts:124 \u00B7 packages/daemon/src/domain/queue-wait-backoff.ts:138 \u2014 the two spans are one implementation copied and then locally edited \u2014 60 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/daemon/src/domain/queue-wait-backoff.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"c297b13ae67a28437ab487f36b733e2adfbfa4150dd351781e4ccb9f59395f1a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/daemon/src/domain/queue-waiting.ts:40 \u00B7 packages/daemon/src/domain/queue-waiting.ts:55 \u2014 the two spans are one implementation copied and then locally edited \u2014 63 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/daemon/src/domain/queue-waiting.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"8729afa18302b5b61794a05e26b349b4633f94b1a03a9544ed88930be065aed3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/queue-wake-repository.ts:239 \u00B7 packages/daemon/src/domain/queue-wake-repository.ts:269 \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/daemon/src/domain/queue-wake-repository.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b96c17945c973c09b9f51b1e92fdfa0d4443e76a81e2e9bafc9a394c554e23d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/rigspec-instantiator.ts:1694 \u00B7 packages/daemon/src/domain/rigspec-preflight.ts:400 \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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":1694}}}],"partialFingerprints":{"codehealthFindingId/v1":"45228465d5943e99637926e21ac9df23d613e6a9eefc1c1327ce7ba54f7d3e7a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/rigspec-instantiator.ts:2611 \u00B7 packages/daemon/src/domain/runtime-switch-materials.ts:196 \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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":2611}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b6c6a576b693df019fb6c7f9a3e33a1de78fac771de3fe319af7c02057c7a7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/rigspec-schema.ts:913 \u00B7 packages/daemon/src/domain/rigspec-schema.ts:922 \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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa9709e316dabc1fc6a3cb483e94118d2c5af6f22b3e553d7fb4e4e264aa82d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/rigspec-schema.ts:1202 \u00B7 packages/daemon/src/domain/rigspec-schema.ts:1212 \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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":1202}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f141ade15e775621c60f6d124cd6f9e138b8ee54b4a356ead4ea9ce6567cda6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/daemon/src/domain/rigspec-schema.ts:83 \u00B7 packages/daemon/src/domain/seat-env.ts:25 \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":"packages/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"a322e36d5318af5725e9fe4e667753cbff280f882d46be76e0dd6ed8d5b1cbf0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/seat-activity-service.ts:487 \u00B7 packages/daemon/src/domain/seat-structural-activity-service.ts:246 \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/daemon/src/domain/seat-activity-service.ts"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"4934a3028f69aa9fb05a54254930a1054f95a373f83f2c1e7b72670d5e3e699b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5 locations): packages/daemon/src/domain/seat-handover-service.ts:482 \u00B7 packages/daemon/src/domain/seat-handover-service.ts:933 \u00B7 packages/daemon/src/domain/seat-lifecycle-service.ts:1210 \u00B7 packages/daemon/src/domain/seat-lifecycle-service.ts:1293 \u00B7 \u002B1 more site(s) not listed \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/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a423bb484333e4239e13c8e6990ef34dcd4625ee3c270695d49d18df6585c66"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/seat-lifecycle-service.ts:707 \u00B7 packages/daemon/src/domain/seat-lifecycle-service.ts:761 \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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"defd397650be1361e0eae46919e3ccae5c2f7d405c06a5e6ceb6bdac1f56a9ab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5 locations): packages/daemon/src/domain/seat-lifecycle-service.ts:966 \u00B7 packages/daemon/src/domain/seat-lifecycle-service.ts:1006 \u00B7 packages/daemon/src/domain/seat-lifecycle-service.ts:1036 \u00B7 packages/daemon/src/domain/seat-lifecycle-service.ts:1070 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"362ef7db2a87975a7d91dfc347064494c100970c42125f1177c3238e4e9353b8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/seat-lifecycle-service.ts:983 \u00B7 packages/daemon/src/domain/seat-lifecycle-service.ts:1101 \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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc2f60752fdbebf9c9f4854bce66a63381c77dc779e4251138e59d9d3db2c13"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): packages/daemon/src/domain/seat-lifecycle-service.ts:1007 \u00B7 packages/daemon/src/domain/seat-lifecycle-service.ts:1037 \u00B7 packages/daemon/src/domain/seat-lifecycle-service.ts:1071 \u00B7 packages/daemon/src/domain/seat-lifecycle-service.ts:1127 \u2014 all 4 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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f8c3ad76e1b2f6828f31c7b5f37bcde09dbc2c9b73a0c4b7fe3e7994b60880"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/seat-skill-storage.ts:649 \u00B7 packages/daemon/src/domain/seat-skill-storage.ts:790 \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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"efce4ff6ff7674495d98f86524378a22b97c669353c875484bc81c411be0d45b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/self-attach-service.ts:256 \u00B7 packages/daemon/src/domain/self-attach-service.ts:280 \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/daemon/src/domain/self-attach-service.ts"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"e49e1425dae78c50b23b3938df30129133491e681c57bafe0c5ee15b17243fab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/session-registry.ts:1012 \u00B7 packages/daemon/src/domain/session-registry.ts:1034 \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/daemon/src/domain/session-registry.ts"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a45d67c6b744f2e6cf14e10f6ff58061dd94a84e7c0e4a3a3fe3981d53e2137"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/session-transport.ts:3964 \u00B7 packages/daemon/src/domain/session-transport.ts:4168 \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/daemon/src/domain/session-transport.ts"},"region":{"startLine":3964}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e181401c4e8faf18840d425d99affb6007a589c31c36b9c3e3928b3e93fe1e9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/skill-catalog.ts:225 \u00B7 packages/daemon/src/domain/skill-catalog.ts:654 \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/daemon/src/domain/skill-catalog.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"990b7864c5a1f7849107c46d24d4b0a8bdcd431d3af5256190c46f8a773ae17a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/slices/qitem-membership.ts:38 \u00B7 packages/daemon/src/domain/slices/slice-indexer.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/daemon/src/domain/slices/qitem-membership.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"3885ccc2a133f7c4a1601240b6b9f6351936acd504d8dd49376ffb55844c5420"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/slices/slice-detail-projector.ts:798 \u00B7 packages/daemon/src/domain/slices/slice-detail-projector.ts:811 \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/daemon/src/domain/slices/slice-detail-projector.ts"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"291f94c60c29280cf87527e67e14a91157627e9f7bc8861cd20c23ea836547cc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/slices/slice-indexer.ts:942 \u00B7 packages/daemon/src/domain/slices/slice-indexer.ts:982 \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/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"71d6f08f19cd17f47b11700c774bb5154388ee398f2ea3709e445a3e754609c2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/slices/slice-indexer.ts:976 \u00B7 packages/daemon/src/domain/slices/slice-indexer.ts:1513 \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/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"967730251080196d9413a8ec4dfcd0daed87fc907a78a059cf11f082e7397726"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/slices/slice-indexer.ts:1208 \u00B7 packages/daemon/src/domain/slices/slice-indexer.ts:1215 \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/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"569fd5faa707755cba44712400c9e32569bada0133e3f827725dc9913eeb0504"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/startup-orchestrator.ts:906 \u00B7 packages/daemon/src/domain/startup-orchestrator.ts:939 \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/daemon/src/domain/startup-orchestrator.ts"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee39ada8abd250bcdcc20520be315cb88bf3535dbca74215605a0c9d3a046b16"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/startup-validation.ts:20 \u00B7 packages/daemon/src/domain/startup-validation.ts:62 \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/daemon/src/domain/startup-validation.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"355e134b6c17aa0e34fb1d06d77e90413e68440fed4251ee66e030e170ba9459"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/daemon/src/domain/stream-intake.ts:470 \u00B7 packages/daemon/src/domain/stream-intake.ts:492 \u2014 the two spans are one implementation copied and then locally edited \u2014 64 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/daemon/src/domain/stream-intake.ts"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"021181d1eed2b814c1e5e6092a0d1d8a80cb050d0df6bf0dd9994841146099fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/terminal/terminal-service.ts:334 \u00B7 packages/daemon/src/domain/terminal/terminal-service.ts:406 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/terminal/terminal-service.ts"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb7b51ea7f67e0c32020ba3672121c7d3392fa23115d1d8eaa9180017eaf3270"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/topology-defaults-installer.ts:121 \u00B7 packages/daemon/src/domain/topology-defaults-installer.ts:129 \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/daemon/src/domain/topology-defaults-installer.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"34586efc4b240980368b7c4e2f84c9a5d25160c837f17b658be5a9bd0bee7f30"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/user-settings/settings-store.ts:578 \u00B7 packages/daemon/src/openrig-compat.ts:26 \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/daemon/src/domain/user-settings/settings-store.ts"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"13863da6010cfc2b15a8748d8b805964c46cdf6d03b2a03161c9b65675a33ed4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/domain/workflow-projector.ts:2073 \u00B7 packages/daemon/src/domain/workflow-runtime.ts:2028 \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/daemon/src/domain/workflow-projector.ts"},"region":{"startLine":2073}}}],"partialFingerprints":{"codehealthFindingId/v1":"92691a6c0b0090664e4b338ccad5b025caa009a9cbc0c488e8838b5184f716c9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/routes/agent-images.ts:378 \u00B7 packages/daemon/src/routes/agent-images.ts:411 \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/daemon/src/routes/agent-images.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7875266e91417a82a7af44a9d40711ccff35ac0e2087f1d1b2ce44558afc3d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/routes/bundles.ts:577 \u00B7 packages/daemon/src/routes/bundles.ts:597 \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/daemon/src/routes/bundles.ts"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f1679c5b2d0858a9e754d58e3da6390e8fdeabf8aaf4018baacc1ba61edcdd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): packages/daemon/src/routes/chat.ts:150 \u00B7 packages/daemon/src/routes/env.ts:70 \u00B7 packages/daemon/src/routes/env.ts:107 \u2014 the 3 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/daemon/src/routes/chat.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"931ef74cba521d64665fc33b184be22b8be71a3774882fd962aae2658cd2781d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): packages/daemon/src/routes/config.ts:59 \u00B7 packages/daemon/src/routes/config.ts:90 \u00B7 packages/daemon/src/routes/context-packs.ts:94 \u00B7 packages/daemon/src/routes/workspace.ts:72 \u2014 the 4 copies are spread across 3 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/daemon/src/routes/config.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"06aef53e5479842f0f792a40ac8896e3b907b521f3f95ae868111e1db7fd16ab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): packages/daemon/src/routes/config.ts:75 \u00B7 packages/daemon/src/routes/config.ts:95 \u00B7 packages/daemon/src/routes/config.ts:117 \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/daemon/src/routes/config.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41667913f43a3df064abda8d7a6bab9af79cc892965b79a19ce620feee20862"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/routes/context-packs.ts:154 \u00B7 packages/daemon/src/routes/mission-control.ts:474 \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/daemon/src/routes/context-packs.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8503437ef70362d878f3b3a84b593c20141da7007d15df152062d922c9598c9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/routes/discovery.ts:82 \u00B7 packages/daemon/src/routes/discovery.ts:181 \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/daemon/src/routes/discovery.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a6a8ebea86925ba386807e0f5ad9a406d790774fef7c1de278c77f219c66a4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5 locations): packages/daemon/src/routes/files.ts:83 \u00B7 packages/daemon/src/routes/plugins.ts:124 \u00B7 packages/daemon/src/routes/plugins.ts:139 \u00B7 packages/daemon/src/routes/rig-mode.ts:139 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 4 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/daemon/src/routes/files.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a6f2b44dd6ef36a820dc470526b14e5c66d349bb7e1b2c275b178cb62882475"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/routes/gateway.ts:368 \u00B7 packages/daemon/src/routes/gateway.ts:381 \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/daemon/src/routes/gateway.ts"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3fa0ff700ffda9166dcf285c5d3071bf5c50fb27fbc3bd9db48687ca37148c5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/routes/hook-bridge.ts:111 \u00B7 packages/daemon/src/routes/hook-bridge.ts:136 \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/daemon/src/routes/hook-bridge.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4242a5bfb87ed66b4f59168c7c7e7ac4ee11794b672acc4dfcbfd76b41a1fba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/routes/missions.ts:42 \u00B7 packages/daemon/src/routes/scope-audit.ts:165 \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/daemon/src/routes/missions.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"1798fcf07340b2d8ec040810b320395b3b0fd85e48c364bc8ce5fefe54f3e951"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6 locations): packages/daemon/src/routes/plugins.ts:131 \u00B7 packages/daemon/src/routes/plugins.ts:147 \u00B7 packages/daemon/src/routes/plugins.ts:189 \u00B7 packages/daemon/src/routes/plugins.ts:225 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 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/daemon/src/routes/plugins.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7bec50873562a6e5cc02587609a0186a7edc63ffaeb952982fc671bef7b8d97"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/routes/queue.ts:1661 \u00B7 packages/daemon/src/routes/queue.ts:1684 \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/daemon/src/routes/queue.ts"},"region":{"startLine":1661}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df7079c56600262fe13614c82d6766dcce214edcb557ae0bb9d71af5b16da84"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): packages/daemon/src/routes/rig-mode.ts:143 \u00B7 packages/daemon/src/routes/terminal.ts:155 \u00B7 packages/daemon/src/routes/terminal.ts:166 \u2014 the 3 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/daemon/src/routes/rig-mode.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc60835a5c673c6e3c49c24a903f393b3a5299c031ecf6f5c4eedea274905a2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/routes/rigs.ts:220 \u00B7 packages/daemon/src/routes/rigs.ts:581 \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/daemon/src/routes/rigs.ts"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"8617876f300fab0c5e4a086af5af5ee42a5994562296a1df85ba2c5b12db5ba7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): packages/daemon/src/routes/rigs.ts:230 \u00B7 packages/daemon/src/routes/rigs.ts:735 \u00B7 packages/daemon/src/routes/rigspec.ts:221 \u2014 the 3 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/daemon/src/routes/rigs.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"5480c42145730e112d9ad16c3e44f03ab351f1af44deca8f96735c78f3ce8183"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/daemon/src/routes/rigs.ts:772 \u00B7 packages/daemon/src/routes/rigspec.ts:164 \u2014 the two spans are one implementation copied and then locally edited \u2014 78 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/daemon/src/routes/rigs.ts"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"47afa0c795239efea3d2c18fdbe40d57d346dd738e6cd1d05133d6cd30532a97"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/routes/seat.ts:562 \u00B7 packages/daemon/src/routes/seat.ts:586 \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/daemon/src/routes/seat.ts"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"242000de919b5656dff4c9769f0b5426be6eab417c22e8a4d2c8256ad3402c0f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/daemon/src/routes/sessions.ts:149 \u00B7 packages/daemon/src/routes/snapshots.ts:95 \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/daemon/src/routes/sessions.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0cb153cef97cb99101d853453fb3de0cc5f47ed3cf064b019a9031f3d8b423a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): packages/daemon/src/routes/sessions.ts:234 \u00B7 packages/daemon/src/routes/sessions.ts:311 \u00B7 packages/daemon/src/routes/sessions.ts:541 \u00B7 packages/daemon/src/routes/snapshots.ts:112 \u2014 the 4 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/daemon/src/routes/sessions.ts"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4293237f1d5e438ea073cfcf911968650dde634f780a1702aeb6ece5e8159f8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/tui/src/render.ts:858 \u00B7 packages/tui/src/render.ts:1090 \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/tui/src/render.ts"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"09adf87a33ae0d65a85a1d96928a09a284dca0add3b3d937d59b6a06ebeb1db1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/tui/src/render.ts:1747 \u00B7 packages/tui/src/render.ts:2120 \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/tui/src/render.ts"},"region":{"startLine":1747}}}],"partialFingerprints":{"codehealthFindingId/v1":"086839af340ef2f2774ef2a088ccb25f4c432e1310493c2d962d254b56f94b89"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/tui/src/topology/canvas.ts:51 \u00B7 packages/tui/src/topology/canvas.ts:59 \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/tui/src/topology/canvas.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"93fa2f829f6fc5d9cf87dc409d500307638978cd5a222a9698cd94742d1394e8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/tui/src/topology/styles/braille.ts:56 \u00B7 packages/tui/src/topology/styles/hatchet.ts:142 \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/tui/src/topology/styles/braille.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7a13028d83bc09dae6ad796c3c49d92737657ec7e4fd1096c054d6764192e3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/tui/src/usage/usage-hosts-model.ts:51 \u00B7 packages/tui/src/usage/usage-model.ts:165 \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/tui/src/usage/usage-hosts-model.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"97280a5f15c6979ece29c32eab01ed792b148a56caac5973cd6bcd08e2e36c7f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): packages/ui/src/components/RigEnvPanel.tsx:158 \u00B7 packages/ui/src/components/RigSpecDisplay.tsx:226 \u00B7 packages/ui/src/components/RigSpecDisplay.tsx:232 \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/ui/src/components/RigEnvPanel.tsx"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca86adda7b5054212c5a4ecdaa08540edb6ca63c73c9bd5a82b5d503d52cf83"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/ui/src/components/dashboard/HostConfigCard.tsx:40 \u00B7 packages/ui/src/components/mission-control/components/VerbActions.tsx:115 \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/ui/src/components/dashboard/HostConfigCard.tsx"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb63af0427ba69db76ae5baf50671adfc7add0c82d3b403f37bc1c68b7d7337e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/ui/src/components/dashboard/vellum/VellumDestinationCard.tsx:245 \u00B7 packages/ui/src/components/dashboard/vellum/VellumDestinationCard.tsx:341 \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/ui/src/components/dashboard/vellum/VellumDestinationCard.tsx"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87aee648b4f4f3a1d76b36d83a3a964c0227497bb734bdfb6a2415d039f62fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/ui/src/components/dashboard/vellum/VellumDestinationCard.tsx:278 \u00B7 packages/ui/src/components/dashboard/vellum/VellumDestinationCard.tsx:288 \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/ui/src/components/dashboard/vellum/VellumDestinationCard.tsx"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"1013aeee8a3216dd9d0ec28dd312e5407cb60fa84ccccb60f8da3cf3a6520584"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/ui/src/components/lab/VellumBackgroundLab.tsx:80 \u00B7 packages/ui/src/components/lab/VellumBackgroundLab.tsx:224 \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/ui/src/components/lab/VellumBackgroundLab.tsx"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"5077323fe0ec3769e947366407fab7e5ca0e279850d787bb9178092ff3478717"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/ui/src/components/mission-control/hooks/useMissionControlAudit.ts:45 \u00B7 packages/ui/src/components/mission-control/hooks/useMissionControlView.ts:51 \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/ui/src/components/mission-control/hooks/useMissionControlAudit.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd03c78f6bd5beb86690f9f6da98ec581f4dc881a1f9c4f9e4ead0a868e55a7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/ui/src/components/project/ProjectMetaPrimitives.tsx:175 \u00B7 packages/ui/src/lib/story-graph-model.ts:253 \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/ui/src/components/project/ProjectMetaPrimitives.tsx"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa5ed1a1dd8f9fec35cf36f3fe91413f0617d02dc4619d4430dd9a0187f8bf5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/ui/src/components/project/SteeringTab.tsx:155 \u00B7 packages/ui/src/components/project/WorkspacePortfolioPanel.tsx:75 \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/ui/src/components/project/SteeringTab.tsx"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"d314fb5022efcf7daab4da7c57f403ef1d4728218220be4edbf125b251a49b79"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/ui/src/components/review/NeedsYouAccordion.tsx:25 \u00B7 packages/ui/src/components/workflow/WorkflowInstancesBand.tsx:41 \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/ui/src/components/review/NeedsYouAccordion.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4dbcbfa12caafc8cfee8952b1e3b5087f15daaf86093d99e184e4468a288d56"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/ui/src/hooks/mutations.ts:34 \u00B7 packages/ui/src/hooks/useSpecLibrary.ts:101 \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/ui/src/hooks/mutations.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b918d302445722ed99d1b6c702fb2032de365a975e8224ed34b279d0ea77817"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/ui/src/hooks/mutations.ts:70 \u00B7 packages/ui/src/hooks/mutations.ts:235 \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/ui/src/hooks/mutations.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a98329ad4b9ced389f50c578d982c4d4b060ef18ef8e700b27f1ff1c6b5a55"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): packages/ui/src/hooks/useTopologyEdgeActivity.ts:68 \u00B7 packages/ui/src/hooks/useTopologyEdgeActivity.ts:74 \u00B7 packages/ui/src/hooks/useTopologyEdgeActivity.ts:80 \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/ui/src/hooks/useTopologyEdgeActivity.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae1178c7d32dc6f20bbe7aa4f531b3c55ce5d54568cce7b681ea6cb58918848"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/ui/src/hooks/useTopologyEdgeActivity.ts:143 \u00B7 packages/ui/src/hooks/useTopologyEdgeActivity.ts:149 \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/ui/src/hooks/useTopologyEdgeActivity.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e966d6be715ca25e7c8aebbd5f39a4b70b25cdce58839898a85a6452aecc969"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 9 locations): packages/cli/src/commands/acp.ts:186 \u00B7 packages/cli/src/commands/attach.ts:44 \u00B7 packages/cli/src/commands/bundle.ts:62 \u00B7 packages/cli/src/commands/create.ts:22 \u00B7 \u002B5 more site(s) not listed \u2014 the 9 copies are spread across 9 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/commands/acp.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"91541b8f82f445591d69b8345250b716fb798caedaa46ef622aeb2b095aec277"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/cli/src/commands/acp.ts:234 \u00B7 packages/cli/src/commands/exec.ts:306 \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/commands/acp.ts"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b63f94ea33fbf2377eccdb8de94760fbcff41875685e83b3f1bd3c994d3d051"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/cli/src/commands/chatroom.ts:137 \u00B7 packages/cli/src/commands/usage.ts:238 \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/commands/chatroom.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba1b3343537b345981b913876559f4754dfadcc07e193597d65b4455adab4b5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/cli/src/commands/chatroom.ts:419 \u00B7 packages/cli/src/commands/env.ts:144 \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/commands/chatroom.ts"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"6100ed21dd190e676da262faa35ad8b6446619ff35363848409c7682f6e2726c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): packages/cli/src/commands/community-harness.ts:29 \u00B7 packages/cli/src/commands/walk.ts:379 \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/commands/community-harness.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"9302a62b15e493f166b335ec15c73d580285f5343276371636f27d6a73323717"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/cli/src/commands/crash-cart.ts:37 \u00B7 packages/daemon/src/domain/crash-cart-probes.ts:100 \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/commands/crash-cart.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d25798e639b07f7ee7d438cca1791f26fc995be6fa9d50891bb9d85557aedff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): packages/cli/src/commands/create.ts:37 \u00B7 packages/cli/src/commands/restore.ts:127 \u00B7 packages/cli/src/commands/rig.ts:50 \u00B7 packages/cli/src/commands/seat.ts:848 \u2014 the 4 copies are spread across 4 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/commands/create.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4c9218507cdd4c5f248d401cd1defb5044993c26771ebd9e1e6d722a21a307"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): packages/cli/src/commands/gateway.ts:685 \u00B7 packages/cli/src/commands/gateway.ts:728 \u00B7 packages/cli/src/commands/gateway.ts:745 \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/commands/gateway.ts"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"19161f546d219bde8a6e504196b0793f50cca723d5881bc65cd7735f051d5087"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): packages/cli/src/commands/health.ts:202 \u00B7 packages/cli/src/commands/whoami.ts:349 \u2014 the two spans are one implementation copied and then locally edited \u2014 67 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/commands/health.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"3165c9a2ef87aee34bdcc98ebea52c8c5f1cf34b8aa20ea383d105cc32c498ad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/cli/src/commands/project.ts:222 \u00B7 packages/cli/src/commands/view.ts:90 \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/commands/project.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc0b72ff6de82c9dc6ccf9bd22d18a403abcce37b93da113767d66372e3c186"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/cli/src/commands/ps.ts:1179 \u00B7 packages/cli/src/commands/ps.ts:1811 \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/commands/ps.ts"},"region":{"startLine":1179}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ea3dc650419ad8fc3fbfa039427b4c77532c6603927dca8f55244a09485f81"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/cli/src/commands/queue.ts:1095 \u00B7 packages/cli/src/commands/queue.ts:1103 \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/commands/queue.ts"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a1cd2320c219587439bcf83906bcdeec51cb23d283e55cc1abd60741b11dfa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/cli/src/commands/queue.ts:1736 \u00B7 packages/cli/src/commands/queue.ts:1856 \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/commands/queue.ts"},"region":{"startLine":1736}}}],"partialFingerprints":{"codehealthFindingId/v1":"962f3fb6a3188db441a1e89f18e8296fcda8d00b3fd425f51f2b1f36e5f73f35"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/cli/src/commands/queue.ts:2141 \u00B7 packages/cli/src/commands/stream.ts:205 \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/commands/queue.ts"},"region":{"startLine":2141}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1c1b5ab049b00368886db0da6dcf68497d7c5910bb432a7a37c5066823f4a3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/cli/src/commands/restore-check.ts:384 \u00B7 packages/cli/src/commands/restore-check.ts:443 \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/commands/restore-check.ts"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc76d1f7b2999766e90d85000a6abaa85c7beba5dbd498a2bdd8b1b00bc704a8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): packages/cli/src/commands/rig.ts:79 \u00B7 packages/daemon/src/domain/pod-bundle-assembler.ts:358 \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/commands/rig.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0f4b8c5ca487c91ebc638136802b177635c71df18e5e7e29c3dceccc099240"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): packages/cli/src/commands/seat.ts:1002 \u00B7 packages/cli/src/commands/seat.ts:1007 \u00B7 packages/cli/src/commands/seat.ts:1012 \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/commands/seat.ts"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d6f17aa74c97f8e6713acb3e6f7b664f787ab8f890345eeaacef3739d79dbc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/cli/src/commands/usage.ts:42 \u00B7 packages/tui/src/cost/cost-model.ts:20 \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/commands/usage.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2678b844a3899a752ecd15bbdd7ac9887fbfbe7bd94e7b6a0fc373de708563"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/cli/src/commands/usage.ts:60 \u00B7 packages/tui/src/cost/cost-model.ts:56 \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/commands/usage.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea3d21fd69e53f3e10b745e3acba617a4b7b35d79f115adbef9bf0d46f57c03"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): packages/cli/src/commands/watchdog.ts:334 \u00B7 packages/cli/src/commands/workflow.ts:195 \u00B7 packages/cli/src/commands/workflow.ts:725 \u2014 the 3 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/commands/watchdog.ts"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"0310a2428f131c636d36ac38e798674301b17b71d3f0ef3f0c78946a72fb176e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): packages/cli/src/host-registry.ts:176 \u00B7 packages/daemon/src/domain/hosts/hosts-registry-reader.ts:111 \u00B7 packages/daemon/src/domain/topology/topology-manifest.ts:118 \u2014 the 3 copies are spread across 3 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/host-registry.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a8d4e4ecf6bbce5d8c446a4daa04187237be97db7fd4bb9803063cead1c9f76"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/cli/src/lib/check-in.ts:10 \u00B7 packages/tui/src/connected-assistants.ts:15 \u2014 the 2 copies are spread across 2 files, 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/lib/check-in.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"72a994d5050a88fbf30b1c3576bf07b88fe55e96259ca961207a106da99a3a85"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): packages/cli/src/lib/file-transfer.ts:206 \u00B7 packages/daemon/src/domain/gateway/slack/forwarding.ts:60 \u2014 the two spans are one implementation copied and then locally edited \u2014 70 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/lib/file-transfer.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"719d4bb32fb70f9dcac8806688180c1c2f384cd217c42fc0a1bc94cd5d709ecb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/cli/src/mcp-server.ts:1684 \u00B7 packages/cli/src/mcp-server.ts:1971 \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/mcp-server.ts"},"region":{"startLine":1684}}}],"partialFingerprints":{"codehealthFindingId/v1":"f39e9f663a59ef7ed885290d4796031b93d0928232b75c88175645b17982f864"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/cli/src/mcp-server.ts:1799 \u00B7 packages/cli/src/mcp-server.ts:2694 \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/mcp-server.ts"},"region":{"startLine":1799}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d2fcf396abf88d3da925b3c0fb3dc2c2d188a8bfd13763c7e813e24e4889be"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/cli/src/terminal-window.ts:102 \u00B7 packages/tui/src/terminals/open-window.ts:48 \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/terminal-window.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39de5746059edba8e039d9ae0d9d9f76ed6cf6a0d8fb37c09c3e8ccaa45edfa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): packages/daemon/scripts/capture-send-header.mjs:46 \u00B7 packages/tui/scripts/capture-crash-cart.mjs:50 \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":"packages/daemon/scripts/capture-send-header.mjs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a7e427a6e47b966ed7f92723e7cffaab19c98dcf841087d4cb1b24c1121ec8b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/adapters/bounded-probe-exec.ts:125 \u00B7 packages/daemon/src/domain/codex-network-default.ts:217 \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/daemon/src/adapters/bounded-probe-exec.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"e00a8033d41d3e8b2850af6b957ad245a7f2eb4801db040b252b818ef3c96f3a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): packages/daemon/src/adapters/claude-code-adapter.ts:767 \u00B7 packages/daemon/src/adapters/claude-resume.ts:208 \u00B7 packages/daemon/src/domain/resume-metadata-refresher.ts:448 \u2014 the 3 copies are spread across 3 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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f13a1e1c04dba6f95ebe8aa3ec6882e3f156a3ef4d7b3e0ab1bee7fc38f06a4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/adapters/claude-code-adapter.ts:1015 \u00B7 packages/daemon/src/adapters/codex-runtime-adapter.ts:1541 \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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7327c43b409467de109f43a7fb540083fbabc12360f6e0c83543cf025ec61e4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/adapters/community-harness-runtime-adapter.ts:216 \u00B7 packages/daemon/src/adapters/pi-resume.ts:171 \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/daemon/src/adapters/community-harness-runtime-adapter.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"da0454ce5b0f9f7f1b22800f7ebe9ecb6bdf69b7d4e6f7325bc97de9e5d55d5a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/adapters/openshell-podman-observer.ts:59 \u00B7 packages/daemon/src/adapters/openshell-podman-observer.ts:65 \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/daemon/src/adapters/openshell-podman-observer.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"472b5e5c2e4d173a849e46ef9172471a29b49cbf10ec57bc0ecf87116086dca4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/adapters/pi-runtime-adapter.ts:241 \u00B7 packages/daemon/src/adapters/stub-runtime-adapter.ts:129 \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/daemon/src/adapters/pi-runtime-adapter.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f90a8bea637f3cc09a92bcdb3e3ab30e8a4a674f38b0a783177fe54a5e59ad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/adapters/tmux.ts:730 \u00B7 packages/daemon/src/adapters/tmux.ts:753 \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/daemon/src/adapters/tmux.ts"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5f35631f0b132da353515050131de1bd1ffa760cea9607f6bb70550c271389"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/domain/bootstrap-orchestrator.ts:316 \u00B7 packages/daemon/src/domain/bootstrap-orchestrator.ts:732 \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/daemon/src/domain/bootstrap-orchestrator.ts"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c4954a131f97f4ae1bac1bebb73adc0061a1fb466753a82496bb838cd7f11d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/domain/bundle-archive.ts:245 \u00B7 packages/daemon/src/routes/packages.ts:33 \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/daemon/src/domain/bundle-archive.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2aabe4d4443ac6420ff6550a1d16838bfa6c25a6de56937b111db89e16cb44"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): packages/daemon/src/domain/bundle-behaviour-inspect.ts:14 \u00B7 skills/_canonical/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs:103 \u2014 the two spans are one implementation copied and then locally edited \u2014 68 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/daemon/src/domain/bundle-behaviour-inspect.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"a538ac2ee226b832f4ed59f525b891aa56865a7f166d0504d04d237782f0560e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): packages/daemon/src/domain/bundle-behaviour-inspect.ts:14 \u00B7 skills/_canonical/core/openrig-upgrade/scripts/refresh-managed-plugin.mjs:21 \u2014 the two spans are one implementation copied and then locally edited \u2014 80 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/daemon/src/domain/bundle-behaviour-inspect.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d895537b2e5a0ff0799cbbfb15fb6a1289ca747f60cc50b9d1201c91cd47426"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/domain/bundle-content-routing.ts:254 \u00B7 packages/daemon/src/routes/bundles.ts:610 \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/daemon/src/domain/bundle-content-routing.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"313f3dde050c9ee3e450bee9d9372c630de1bf3f31eeba1f8e015290867d1829"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/domain/bundle-source-resolver.ts:224 \u00B7 packages/daemon/src/domain/seat-launch-additions.ts:86 \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/daemon/src/domain/bundle-source-resolver.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"29fa6597c5cb63f87cea87154da5fb6d3cd53b14c944c5d57fce4187d99e691f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/domain/claude-auto-mode.ts:23 \u00B7 packages/daemon/src/domain/process-limits.ts:32 \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/daemon/src/domain/claude-auto-mode.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"63655eff2296dc338e2f1cd6cfe4595c708d55c52559351d5443da1a2a952366"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): packages/daemon/src/domain/claude-mcp-menu.ts:4 \u00B7 packages/daemon/src/domain/native-model-picker.ts:34 \u2014 the two spans are one implementation copied and then locally edited \u2014 59 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/daemon/src/domain/claude-mcp-menu.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"442ad2687ac38c09dbadf6af60d5b447cb6b3f26d7d2255967b2dcb12e8c9f4e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/domain/codex-auth.ts:485 \u00B7 packages/daemon/src/domain/codex-auth.ts: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":"packages/daemon/src/domain/codex-auth.ts"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fda78a0a1258c23ef2e35f51e202bd034feb850c89f1140e1cb1a6a61a425da"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/domain/context-packs/manifest-parser.ts:120 \u00B7 packages/daemon/src/domain/context-packs/manifest-parser.ts:449 \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/daemon/src/domain/context-packs/manifest-parser.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d3e669bbfe85fde2d471fd69229a21d9ddf8b442742da85e776ed8358351841"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/domain/gateway/slack/channel-recovery.ts:130 \u00B7 packages/daemon/src/domain/gateway/slack/thread-recovery.ts:129 \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/daemon/src/domain/gateway/slack/channel-recovery.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d634d1be88bba41ac4ca69f36c9fb5b8654c03cc559b3e27a66ffeda07af0b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/domain/gateway/slack/inbound.ts:666 \u00B7 packages/daemon/src/domain/gateway/slack/inbound.ts:748 \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/daemon/src/domain/gateway/slack/inbound.ts"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c1d1284bb9f3d3822aa1abba73aef414d1047585772d92b9513fee0cdb6cba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/domain/gateway/slack/inbound.ts:1019 \u00B7 packages/daemon/src/domain/gateway/slack/inbound.ts:1033 \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/daemon/src/domain/gateway/slack/inbound.ts"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d64ce97ed1c63c1017f1ed3b61b142e869e3f77401a90fa7638e913054188c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): packages/daemon/src/domain/health-diagnosis.ts:247 \u00B7 packages/daemon/src/domain/health-diagnosis.ts:263 \u2014 the two spans are one implementation copied and then locally edited \u2014 92 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/daemon/src/domain/health-diagnosis.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"0329c41cbbe2fb285a727ef2806f4c9ad386d1413f3d4f39caf09f138d3a0d62"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/domain/health-passive-ceremony.ts:244 \u00B7 packages/daemon/src/domain/health-passive-ceremony.ts:280 \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/daemon/src/domain/health-passive-ceremony.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcbbcd80414bcbc038deb509accddbced699f50baf6744b98610c09f79d60d59"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/domain/history-query.ts:121 \u00B7 packages/daemon/src/domain/transcript-store.ts:304 \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/daemon/src/domain/history-query.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"6408c0b1d67563d5be34391e4985b0c4178a8e704a9b7e02ced572636be2cbcb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): packages/daemon/src/domain/native-process-arguments.ts:115 \u00B7 packages/daemon/src/domain/native-process-arguments.ts:194 \u2014 the two spans are one implementation copied and then locally edited \u2014 73 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/daemon/src/domain/native-process-arguments.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"e560163e3e69758a467f7d9eeb53a6fab5caeda8cbe377468e7e117807443b2e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/domain/native-process-lineage.ts:829 \u00B7 packages/daemon/src/domain/native-process-lineage.ts:941 \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/daemon/src/domain/native-process-lineage.ts"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"20abb56d951b2c37bdd057a44edf0d7f5a0d9d59c5e6ac6352e15298275b276a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): packages/daemon/src/domain/openrouter-charge.ts:43 \u00B7 packages/daemon/src/domain/pi-usage-facts.ts:58 \u2014 the two spans are one implementation copied and then locally edited \u2014 62 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/daemon/src/domain/openrouter-charge.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"b453f161ccbb3a014533a6d1411e5c52fc96eab39e830507e14629d7b82aa1a7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): packages/daemon/src/domain/outbox-handler.ts:187 \u00B7 packages/daemon/src/domain/outbox-handler.ts:218 \u00B7 packages/daemon/src/domain/outbox-handler.ts:226 \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/daemon/src/domain/outbox-handler.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"c352191e44947c50acefe3dc75d4c7be6cf162ec3d0dfe084512dd2e8e00992b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): packages/daemon/src/domain/policies/delivery-deferral.ts:120 \u00B7 packages/daemon/src/domain/policies/delivery-digest-flush.ts:88 \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":"packages/daemon/src/domain/policies/delivery-deferral.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e81629a73273e100d2f3ef4fef75c7b46412827b40621a00a99fc0903ac07fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/domain/policies/mode-scheduled-end.ts:53 \u00B7 packages/daemon/src/domain/policies/quiet-release.ts:248 \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/daemon/src/domain/policies/mode-scheduled-end.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b68c443663288fd48a3fce71bf20e0f1bc05302bc8ced1f3ed4dde0e5574b4e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/domain/policies/parked-owner-consumer.ts:309 \u00B7 packages/daemon/src/domain/policies/parked-owner-consumer.ts:318 \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/daemon/src/domain/policies/parked-owner-consumer.ts"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"313c4e5bba56b1bb3d2af96fbb403362305261bac768111a964d62b993ee1036"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/domain/profile-resolver.ts:446 \u00B7 packages/daemon/src/domain/skill-catalog.ts:171 \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/daemon/src/domain/profile-resolver.ts"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"773210a5f0c6d111359b56fb91f96c15079eb676964a95fd6499a6bb14b31b6e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): packages/daemon/src/domain/progress/progress-indexer.ts:159 \u00B7 packages/daemon/src/routes/bundles.ts:369 \u2014 the two spans are one implementation copied and then locally edited \u2014 55 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/daemon/src/domain/progress/progress-indexer.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"7acdc111c02659e0d137de41eb92a09396c5e0d4cb97a7899352d71285fe6be5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): packages/daemon/src/domain/progress/progress-indexer.ts:159 \u00B7 scripts/generate-context-packs.mjs:284 \u2014 the two spans are one implementation copied and then locally edited \u2014 54 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/daemon/src/domain/progress/progress-indexer.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d3381c57026b85b106191ab819b377f5bf69711c9271fe1eb7eee799da4e506"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): packages/daemon/src/domain/ps-projection.ts:177 \u00B7 packages/daemon/src/domain/rig-repository.ts:1085 \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/daemon/src/domain/ps-projection.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"30364c3ea2add29adda280ecc8269041ad0881d962fbd312ffb7e2e9bd4828dd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/domain/queue-repository.ts:5808 \u00B7 packages/daemon/src/domain/queue-repository.ts:5817 \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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":5808}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b84fc2f7388af802227e39b32cfe8c35627205b754a43f8d6919f8c7030d52f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): packages/daemon/src/domain/queue-repository.ts:2109 \u00B7 packages/daemon/src/domain/queue-repository.ts:2185 \u2014 the two spans are one implementation copied and then locally edited \u2014 80 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":2109}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb75c55d3c02f16d0f4743aa9700ea94852c5b848caf7807a927e29a056d2bc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/domain/queue-stuck-sweep.ts:892 \u00B7 packages/daemon/src/domain/queue-stuck-sweep.ts:935 \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/daemon/src/domain/queue-stuck-sweep.ts"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae7f7d1248dd6320885b1c765924f4c6fd8c9c8e94db9758b1b5106fc4e87746"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/domain/queue-transition-log.ts:92 \u00B7 packages/daemon/src/domain/queue-transition-log.ts: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/queue-transition-log.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c42dfed5dc5a3b2ff3b6955bd44ba4e5aa1d276e2d9be92bd72522336d5d440"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/domain/review/gather.ts:608 \u00B7 packages/daemon/src/domain/review/gather.ts:677 \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/daemon/src/domain/review/gather.ts"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"134fb54fda9def426779bee8db64619242e9166f6dd12be0caa46f0c54cbef77"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/domain/rig-edge-ops.ts:112 \u00B7 packages/daemon/src/domain/rig-edge-ops.ts:154 \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/daemon/src/domain/rig-edge-ops.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"106a798efb7cac32b55efefb789a0e4a3d0ccc0661cab4c0ef32bceb6a54d523"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): packages/daemon/src/domain/rig-repository.ts:82 \u00B7 packages/daemon/src/domain/rig-repository.ts:127 \u00B7 packages/daemon/src/domain/rig-repository.ts:174 \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/daemon/src/domain/rig-repository.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e1ae0658c081f7256e1be637af946a605a88eb31db10319a2b59343c63225a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/domain/rig-repository.ts:183 \u00B7 packages/daemon/src/domain/rig-repository.ts:198 \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/daemon/src/domain/rig-repository.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"383e2e574c205fe61ea7b18804f859c3f9223b8527af048ec8f9e4944a1b11b5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5 locations): packages/daemon/src/domain/rig-repository.ts:656 \u00B7 packages/daemon/src/domain/rig-repository.ts:661 \u00B7 packages/daemon/src/domain/rig-repository.ts:671 \u00B7 packages/daemon/src/domain/rig-repository.ts:677 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 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/daemon/src/domain/rig-repository.ts"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"339b4a99afaa55af81367c1380af24e28c89f53d977be1dd9971c8919776517c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): packages/daemon/src/domain/rig-repository.ts:668 \u00B7 packages/daemon/src/domain/rig-repository.ts:674 \u00B7 packages/daemon/src/domain/rig-repository.ts:679 \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/daemon/src/domain/rig-repository.ts"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9cab4b18868d5d8b53c1293a19448e030530f3c51b1922c347b2f6758b1c114"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/domain/rigspec-exporter.ts:96 \u00B7 packages/daemon/src/domain/rigspec-exporter.ts:103 \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/daemon/src/domain/rigspec-exporter.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b1c4cfdb17f29b87b8e54b1abbf96b4add8c34d0198bbbab162e459f4267fe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/domain/rigspec-exporter.ts:169 \u00B7 packages/daemon/src/domain/rigspec-exporter.ts:275 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/rigspec-exporter.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a177628459f22e11976e6cba51955cf718a66cf78e4a75bcba7b6569da6dfc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/domain/rigspec-instantiator.ts:289 \u00B7 packages/daemon/src/domain/rigspec-instantiator.ts:1996 \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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b5c7c5af975809c393f2d2015409e11ee7919268ce3a002497d20f880183d1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/domain/rigspec-schema.ts:431 \u00B7 packages/daemon/src/domain/rigspec-schema.ts:899 \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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"1921bd4a63c1d8507f35ac812513634318981a8caae8b28b89ccf3e4338af9b4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/domain/rigspec-schema.ts:488 \u00B7 packages/daemon/src/domain/rigspec-schema.ts:867 \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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"e13dbee9fb9177c9685d0c1cd978bd49531d915a6ec3a9a1f5698fe7f8ca58a8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/domain/runner-permissions.ts:403 \u00B7 packages/daemon/src/domain/runner-permissions.ts:412 \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/daemon/src/domain/runner-permissions.ts"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"28470948e608485c46f76e031496ef3317fa267cd4d5388738ed1228ae00df23"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/domain/seat-handover-service.ts:1728 \u00B7 packages/daemon/src/domain/seat-handover-service.ts:1745 \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/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":1728}}}],"partialFingerprints":{"codehealthFindingId/v1":"8291e8905950adce724f8442307d60a1365b7f16e4462dfe6dc87d98f9577eb2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): packages/daemon/src/domain/seat-restart-in-place.ts:319 \u00B7 packages/daemon/src/domain/seat-restart-in-place.ts:367 \u2014 the two spans are one implementation copied and then locally edited \u2014 67 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/daemon/src/domain/seat-restart-in-place.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcb6191dcac29b2349ddbf3c7a0108a94d8d5ef2349da101d51a54d03ecbe980"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/domain/seat-skill-storage.ts:138 \u00B7 packages/daemon/src/domain/seat-skill-storage.ts:145 \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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc38762a2240f5b96c5af6aebc0a9b989af42e088c624697c893d55ddb02f1b4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/domain/seat-skill-storage.ts:305 \u00B7 packages/daemon/src/domain/seat-skill-storage.ts:328 \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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"1768c8fe5a5d23a861a1d8a79fa57002f265709b7e55f49d5527093f5023a848"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/domain/seat-skill-storage.ts:1127 \u00B7 packages/daemon/src/domain/seat-skill-storage.ts:1265 \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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ab02e8c914cb929453d59c2a3d18abf4bbe91b66cf7c077dab93a5ccf3ae631"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/domain/self-attach-service.ts:214 \u00B7 packages/daemon/src/domain/self-attach-service.ts:277 \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/daemon/src/domain/self-attach-service.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"c078f0f8f30f8d468e48e0fcea27ae39157e24b258e68c569433747d67dbd707"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): packages/daemon/src/domain/spec-live-conformance.ts:117 \u00B7 packages/daemon/src/domain/spec-live-conformance.ts:156 \u2014 the two spans are one implementation copied and then locally edited \u2014 53 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/daemon/src/domain/spec-live-conformance.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74b1c6552be8c4960f33b3f7959aacc6e6ab79c48eb3c2dc1827155ad3836a5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): packages/daemon/src/domain/terminal/herdr-app-install.ts:57 \u00B7 packages/daemon/src/domain/terminal/herdr-app-state.ts:74 \u2014 the two spans are one implementation copied and then locally edited \u2014 55 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/daemon/src/domain/terminal/herdr-app-install.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f9a6262e4c169537ade1066831dada378af0402a7f279d9678fe21f73f6850f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): packages/daemon/src/domain/terminal/herdr-viewer.ts:163 \u00B7 packages/daemon/src/domain/terminal/herdr-viewer.ts:290 \u2014 the two spans are one implementation copied and then locally edited \u2014 83 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/daemon/src/domain/terminal/herdr-viewer.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd6cc92f647def6b8983720c3e2c42ecace74304b875557412d13621e221a8a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): packages/daemon/src/domain/terminal/scope-task-terminal-view.ts:109 \u00B7 packages/daemon/src/domain/terminal/scope-task-terminal-view.ts:123 \u2014 the two spans are one implementation copied and then locally edited \u2014 70 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/daemon/src/domain/terminal/scope-task-terminal-view.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc90a20d98969c36dc5e775ed442fa9628758c2268d1a150177124dc13b1ccd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/domain/user-settings/settings-store.ts:962 \u00B7 packages/daemon/src/domain/user-settings/settings-store.ts:1099 \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/daemon/src/domain/user-settings/settings-store.ts"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd9d83c1e1811715f4bf04ddb02a6c6d155b0bff77ee1889565f31c73ca841c3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/domain/workspace/project-catalog.ts:54 \u00B7 packages/daemon/src/routes/slices.ts:282 \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/daemon/src/domain/workspace/project-catalog.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b71d650b395baa114385c9b650ffe305dad77548f03ae4a0240b7d6068f41b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/routes/activity.ts:944 \u00B7 packages/daemon/src/routes/activity.ts:1068 \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/daemon/src/routes/activity.ts"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f18ad92b0a0c013d4690a6f0b4d7d8c3453cc3dc59a2aef2787503fcb612d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5 locations): packages/daemon/src/routes/agent-images.ts:124 \u00B7 packages/daemon/src/routes/config.ts:37 \u00B7 packages/daemon/src/routes/context-packs.ts:62 \u00B7 packages/daemon/src/routes/health.ts:11 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 5 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/daemon/src/routes/agent-images.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"31362bfe33be76dc012fcc7d83a53a1358bf4761198d66cbeedda3b93a28e63b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 14 locations): packages/daemon/src/routes/agent-images.ts:131 \u00B7 packages/daemon/src/routes/agent-images.ts:380 \u00B7 packages/daemon/src/routes/agent-images.ts:390 \u00B7 packages/daemon/src/routes/agent-images.ts:413 \u00B7 \u002B10 more site(s) not listed \u2014 the 14 copies are spread across 4 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/daemon/src/routes/agent-images.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ad1a69b4e39e63c2f451e1cd0c8dc12d7f6cf338c4d199b944dba56d91c016"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 7 locations): packages/daemon/src/routes/agent-images.ts:138 \u00B7 packages/daemon/src/routes/agent-images.ts:334 \u00B7 packages/daemon/src/routes/config.ts:61 \u00B7 packages/daemon/src/routes/config.ts:92 \u00B7 \u002B3 more site(s) not listed \u2014 the 7 copies are spread across 5 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/daemon/src/routes/agent-images.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a50a3f96d340bc923154b7f9590fbfea62125c7e72e22508d0d48d2686eb7d9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6 locations): packages/daemon/src/routes/agent-images.ts:392 \u00B7 packages/daemon/src/routes/agent-images.ts:445 \u00B7 packages/daemon/src/routes/config.ts:74 \u00B7 packages/daemon/src/routes/config.ts:94 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 copies are spread across 3 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/daemon/src/routes/agent-images.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80572cd1eaec01b98aac3218277fe224e3979bde1d1ab6ed8e25c3bdf1ccfd2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): packages/daemon/src/routes/bootstrap-failure-response.ts:11 \u00B7 packages/daemon/src/routes/bootstrap.ts:18 \u2014 the two spans are one implementation copied and then locally edited \u2014 72 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/daemon/src/routes/bootstrap-failure-response.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a4d32511ef1ca8f386d27fe89547668c778c328964444a4e6ad6d03d3033df"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 8 locations): packages/daemon/src/routes/bootstrap.ts:9 \u00B7 packages/daemon/src/routes/bundles.ts:226 \u00B7 packages/daemon/src/routes/crash-cart.ts:48 \u00B7 packages/daemon/src/routes/discovery.ts:16 \u00B7 \u002B4 more site(s) not listed \u2014 the 8 copies are spread across 8 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/daemon/src/routes/bootstrap.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae1917274f18fb31043fb0ce22bfb1040ec61411bbc6aca32c9a7ca504faaa50"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/routes/bundles.ts:848 \u00B7 packages/daemon/src/routes/bundles.ts:935 \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/daemon/src/routes/bundles.ts"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a39b0c70ae9d013f98cd9c2d3657caf9d5d1f8a1ae9063c16893b4df0d125b7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): packages/daemon/src/routes/bundles.ts:1136 \u00B7 packages/daemon/src/routes/down.ts:25 \u00B7 packages/daemon/src/routes/up.ts:199 \u2014 the 3 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. 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/daemon/src/routes/bundles.ts"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"083d9deb0d4071d1c8cf9eae92867a60a236489d927afa33503251d49a36583d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): packages/daemon/src/routes/chat.ts:32 \u00B7 packages/daemon/src/routes/chat.ts:158 \u00B7 packages/daemon/src/routes/sessions.ts:685 \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/daemon/src/routes/chat.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed6198e3adde59c28ef244572c9fff1c0444a19d949daf68db9fd70384cf2f60"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/routes/context-packs.ts:149 \u00B7 packages/daemon/src/routes/context-packs.ts:168 \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/daemon/src/routes/context-packs.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"607088c4b8131ea2d195d40ded339ba135a83fb7ee3b5f1272566726855ae9d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/routes/context-packs.ts:239 \u00B7 packages/daemon/src/routes/context-packs.ts:353 \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/daemon/src/routes/context-packs.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"828513d9721e96d157635a2312a0b5511503c4756b9a4e6fc9d1dd230a5295be"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/routes/discovery.ts:74 \u00B7 packages/daemon/src/routes/discovery.ts:137 \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/daemon/src/routes/discovery.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce0ad9fabd25e0f81ae0475dc81a99d1eb494f0612a00517c3ddd809df06508"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): packages/daemon/src/routes/files.ts:230 \u00B7 packages/daemon/src/routes/watchdog.ts:101 \u00B7 packages/daemon/src/routes/workflow.ts:292 \u00B7 packages/daemon/src/routes/workflow.ts:420 \u2014 the 4 copies are spread across 3 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/daemon/src/routes/files.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"0089e1b56bff0b7beee05f844ef4fb79b52cc64b08e5b5375134da20279f5a36"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/routes/gateway.ts:249 \u00B7 packages/daemon/src/routes/gateway.ts:295 \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/daemon/src/routes/gateway.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"110b7a0c5d1990b4031b085af540c34366408b1f18f5fe7653958d27e5a9a77d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/routes/network.ts:49 \u00B7 packages/daemon/src/routes/network.ts:57 \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/daemon/src/routes/network.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a06c7f62d5e3d850b6b780b6b9183f2a7cc04b796cabb774a6d5dda85385e06"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 10 locations): packages/daemon/src/routes/packages.ts:102 \u00B7 packages/daemon/src/routes/seat.ts:381 \u00B7 packages/daemon/src/routes/seat.ts:429 \u00B7 packages/daemon/src/routes/seat.ts:636 \u00B7 \u002B6 more site(s) not listed \u2014 the 10 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/daemon/src/routes/packages.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5a3cd118c406527958f001bf836f20e117912026a8c459b5e64ed6a32b4ce6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/routes/projects.ts:117 \u00B7 packages/daemon/src/routes/projects.ts:124 \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/daemon/src/routes/projects.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c0ab9f89b23d4c0b431ad97ffa083c90ef98a0327190278291de568e19ca34"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/routes/queue.ts:1533 \u00B7 packages/daemon/src/routes/queue.ts:1544 \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/daemon/src/routes/queue.ts"},"region":{"startLine":1533}}}],"partialFingerprints":{"codehealthFindingId/v1":"da834f909ee22604c0c1fe8d805b9f355e2355a7faf17faaafc407f094e6ece6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/routes/queue.ts:1543 \u00B7 packages/daemon/src/routes/queue.ts:1555 \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/daemon/src/routes/queue.ts"},"region":{"startLine":1543}}}],"partialFingerprints":{"codehealthFindingId/v1":"0395e3a34bcf951d3ca2f882bf860402ff38212f04380a012f3226e68e362b99"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): packages/daemon/src/routes/rigs.ts:495 \u00B7 packages/daemon/src/routes/sessions.ts:645 \u00B7 packages/daemon/src/routes/sessions.ts:716 \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/daemon/src/routes/rigs.ts"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a35defcf4b17a070b43b134ec9098b1515c058e0a9192922463abf8e5ea4d20"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/routes/rigs.ts:638 \u00B7 packages/daemon/src/routes/snapshots.ts:133 \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/daemon/src/routes/rigs.ts"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d6f7b4d9f447a0eaaac776e86329828086d0b7d9befdea2a72521e68d2b301"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/routes/rigs.ts:828 \u00B7 packages/daemon/src/routes/rigs.ts:844 \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/daemon/src/routes/rigs.ts"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af367304a2266cbf3c9b8a5969e5c854c8e94b0f0e943e98c150153f3fd5467"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/routes/terminal.ts:104 \u00B7 packages/daemon/src/routes/terminal.ts:163 \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/daemon/src/routes/terminal.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b4e5653d39d8ef6c8dd5abe2dba82ad7064d7fbf40f1451f832dd8194b05490"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/routes/up.ts:363 \u00B7 packages/daemon/src/routes/up.ts:430 \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/daemon/src/routes/up.ts"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4f3f0fa574a9d6154cb28eda2256bab1d4bdb3af01997b94f60557b001e07e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/daemon/src/routes/workflow.ts:192 \u00B7 packages/daemon/src/routes/workflow.ts:487 \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/daemon/src/routes/workflow.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"393ff1727c44bc5f6dcc0123cce13abf03bf941a0e74cb25fbcef813b6861ca8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/tui/src/render.ts:784 \u00B7 packages/tui/src/render.ts:925 \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/tui/src/render.ts"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e8ec1b5fb5f2b26a2deed783c7e634acae327c8685ec5bd16eae7538e348c2c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/tui/src/state.ts:294 \u00B7 packages/tui/src/state.ts:327 \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/tui/src/state.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c21a1c358264ab48b68816c6c3270810917fb47d1b6b2a79780574353a12e3c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): packages/tui/src/terminals/open-window.ts:15 \u00B7 packages/tui/src/terminals/open-window.ts:163 \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":"packages/tui/src/terminals/open-window.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"206e3705267e956cfd7a24851bdd79c6eb2a674a9e7ebe3f0d4532a5500003b0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/ui/src/components/SeatOverviewSecondary.tsx:21 \u00B7 packages/ui/src/components/SeatOverviewTable.tsx:59 \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/ui/src/components/SeatOverviewSecondary.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"af55bfd5623ea0530ce93533ed1d1bf29535531bc844d93bc78a868f8b687943"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/ui/src/components/dashboard/vellum/VellumDestinationCard.tsx:284 \u00B7 packages/ui/src/components/dashboard/vellum/VellumDestinationCard.tsx:289 \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/ui/src/components/dashboard/vellum/VellumDestinationCard.tsx"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3d2262c3fd80c33ba5a7b4892926d25df255a41a3d981922753a389ac182cf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/ui/src/components/dashboard/vellum/fidelity-glyphs.tsx:58 \u00B7 packages/ui/src/components/dashboard/vellum/graphics.tsx:39 \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/ui/src/components/dashboard/vellum/fidelity-glyphs.tsx"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ab36579659d3ca39ea91fc70a64fc5f38df3d077f2cdead059addca82c7f56"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/ui/src/components/graphics/RuntimeMark.tsx:359 \u00B7 packages/ui/src/components/graphics/RuntimeMark.tsx:418 \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/ui/src/components/graphics/RuntimeMark.tsx"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"550fb38a3b94f78d03c4da505302155b9c81c7ed480f2649c8fe24f519ea62bd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/ui/src/components/topology/TopologyTableView.tsx:50 \u00B7 packages/ui/src/hooks/useNodeInventory.ts:87 \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/ui/src/components/topology/TopologyTableView.tsx"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"c247c2259c306f76a81c96672cca2011eaa962a1dddabaeeb6f5f7d082c00bc9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): packages/ui/src/hooks/useHosts.ts:36 \u00B7 packages/ui/src/hooks/useHosts.ts:132 \u00B7 packages/ui/src/hooks/useLaunchPlan.ts:38 \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/ui/src/hooks/useHosts.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"988058adebe56555ff719c626a02e57c3e14076a2b54ed00d3e23745ac815ada"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/ui/src/hooks/useNodeDetail.ts:90 \u00B7 packages/ui/src/hooks/useSlices.ts:362 \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/ui/src/hooks/useNodeDetail.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"782d98abf40b75dd32e8e01b98c7f15158b4b3e235fb2270e3ad3a6b3d55be8e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): packages/ui/src/hooks/usePlugins.ts:101 \u00B7 packages/ui/src/hooks/useRigChat.ts:14 \u00B7 packages/ui/src/hooks/useSnapshots.ts:10 \u2014 the 3 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. 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/ui/src/hooks/usePlugins.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c69ec1d2bdbab2a419fce4c99b10b38f5da22f969872c2adc7214213789e04e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/ui/src/hooks/useRigChat.ts:14 \u00B7 packages/ui/src/hooks/useSnapshots.ts:10 \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/ui/src/hooks/useRigChat.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f6897a662a481cb355733d887599ebea18fd031e45748cbce6ce99d6f7cfe7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): packages/ui/src/hooks/useSettings.ts:63 \u00B7 packages/ui/src/hooks/useSettings.ts:87 \u00B7 packages/ui/src/hooks/useSettings.ts:104 \u00B7 packages/ui/src/hooks/useSettings.ts:133 \u2014 all 4 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/ui/src/hooks/useSettings.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc1ec24b6246592980aeecd9a04a9dc7133393b1dcc53d6fb6db2b12d112600e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): packages/ui/src/lib/graph-layout.ts:257 \u00B7 packages/ui/src/lib/graph-layout.ts:261 \u2014 the two spans are one implementation copied and then locally edited \u2014 73 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/ui/src/lib/graph-layout.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"26408ba03c25a021bc4efe99a85a262c3886e2f171c113638d3a6aa7a1756c82"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): skills/_canonical/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs:455 \u00B7 skills/_canonical/core/openrig-upgrade/scripts/refresh-managed-plugin.mjs:75 \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":"skills/_canonical/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e2d63faa28002f9fc3c1db9491053479efede9d92c38aac82c34f3c6976e0d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/acp-real-queue.test.ts:12 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/event-bus.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/cli/test/acp-real-queue.test.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"94655cedf29d93ba261bdd700cb41f6b538608d286d9925374844d34ff608b26"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/acp-real-queue.test.ts:13 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/queue-repository.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/cli/test/acp-real-queue.test.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79c5acf42454c5bd868a8f56608136ed64e79c8d2196e4be9f227a2a6dc3c13"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/acp-real-queue.test.ts:14 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/routes/queue.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/cli/test/acp-real-queue.test.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc5565093a83223697ef26c34bd9a0a4746073447a7121ad06df03e193e5c7c1"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/acp-serve.test.ts:12 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/connection.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/cli/test/acp-serve.test.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e0bed1076777f4e8283524f0101a35ab69c6541b7e9ff4c6d727cfd27da9d4"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/acp-serve.test.ts:13 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/migrate.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/cli/test/acp-serve.test.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d854e2f7cbc1d569ed3cb78ef5ae494f508f3a1896821cc01227e3bfaf8971af"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/acp-serve.test.ts:14 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/all-migrations.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/cli/test/acp-serve.test.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9d56299f83dc2f6340712915d2de5b1c8710bb5768bdf399947ad81337a48c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/acp-serve.test.ts:15 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/event-bus.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/cli/test/acp-serve.test.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecd4df2812305fd11cb0dca68350fdca7aced0bfb8faffac2b0d0e76d0fedd84"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/acp-serve.test.ts:16 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/queue-repository.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/cli/test/acp-serve.test.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb9853baf38733d07729b32f2293a8a9d082077c5375d51bdfb1bbbf98cfc81"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/acp-serve.test.ts:17 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/routes/queue.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/cli/test/acp-serve.test.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5d7573f84f35cc400ba680ec8a801c4e3d1a6ae4243b897193e2e99991b370"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/acp-serve.test.ts:18 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/routes/mission-control.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/cli/test/acp-serve.test.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbebd6825e03cca397c23136e00a9af2b9b578867c87de073fbed6a80dbb9587"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/acp-serve.test.ts:19 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/mission-control/mission-control-write-contract.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/cli/test/acp-serve.test.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ddc7eceb16ee94baf9f2045572538272dd1eb8a74c83f1246c8687fee77e9ac"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/acp-serve.test.ts:20 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/mission-control/mission-control-action-log.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/cli/test/acp-serve.test.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"02348520a0ee1ad0a8f62dadbe8c6866e4ae0490d686cacc6db19fb59b099b8a"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/acp-serve.test.ts:23 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/gateway/human-registry.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/cli/test/acp-serve.test.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d97d06ef085cf03c14d2ac512e4dbbd759196d5a7d9b865668f50dcfd1afd4"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/attach-reply-address.test.ts:16 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/connection.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/cli/test/attach-reply-address.test.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba184fa2bb223a9d35ceeec0d5f76729b8a5082fb06724f29d7b6571be5dfc82"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/attach-reply-address.test.ts:17 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/migrate.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/cli/test/attach-reply-address.test.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"798fed720331b71bcaf2edef24088c0a2e8659dae4217260b34dd844bf7ad059"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/attach-reply-address.test.ts:18 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/all-migrations.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/cli/test/attach-reply-address.test.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2171709f68f75851a65f362eec0e42dce8e5f67ffc8e1d5dddfff8a64373b2"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/attach-reply-address.test.ts:19 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/rig-repository.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/cli/test/attach-reply-address.test.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"680c90800275c82bb5a52af452c98c3561b3091b0e726d8931a307804c8d26e0"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/attach-reply-address.test.ts:20 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/pod-repository.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/cli/test/attach-reply-address.test.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"6677bd8ab837caee2b9bf0243d6a72184a52891ecb9964a8416cb939deb2b456"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/attach-reply-address.test.ts:21 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/session-registry.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/cli/test/attach-reply-address.test.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a1cf7b1a27c7df5754082eb6be7ae2382a0a61a9217a7ca5a03aa7b3ed3370e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/attach-reply-address.test.ts:22 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/event-bus.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/cli/test/attach-reply-address.test.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2777ce5e3b12b35593599007701a2782cd3b8d17e3df99ee9a8a7b546eccb04"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/attach-reply-address.test.ts:23 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/self-attach-service.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/cli/test/attach-reply-address.test.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"57bdcab99d520b3bc5fe582fd925a5b57894e79eb6d77ff49ee73e3675a447a3"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/attach-reply-address.test.ts:24 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/session-transport.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/cli/test/attach-reply-address.test.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecfc9ab76f8636792e1f734e1b56adde112b2523630c2b62b3b89a5d563770a4"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/attach-reply-address.test.ts:25 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/whoami-service.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/cli/test/attach-reply-address.test.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a8770f5f2a0f311c130ef6cde360766ac1970b4761dc9168e4f750cfd6278ba"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/attach-reply-address.test.ts:26 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/transcript-store.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/cli/test/attach-reply-address.test.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"8787d5747fcc1e744f9ab8423478b40d96fec1d816520693a6a84f0bf2e72cd7"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/attach-reply-address.test.ts:27 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/routes/rigs.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/cli/test/attach-reply-address.test.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"45bf87affcc59b50f361fdeb98b4a218fea3e121775596276cb15101d8ff9ad5"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/attach-reply-address.test.ts:28 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/routes/transport.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/cli/test/attach-reply-address.test.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dca56ce7afed668a9e391970f04366040df44db51c4c6cd4a4517ce5142fafd"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/attach-reply-address.test.ts:29 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/routes/whoami.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/cli/test/attach-reply-address.test.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"98075a35a686a91e08fa8b889a6d0bf2f0b7f07b4f42a820fc510d4ed15db576"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/browser-boundary-cli-render.test.ts:13 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/middleware/browser-boundary.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/cli/test/browser-boundary-cli-render.test.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5f6db4a32837dedc11bd8b4fa5194ddced6607e5677a1366e7baced08dd441"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/bundle-behaviour.test.ts:7 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/bundle-behaviour.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/cli/test/bundle-behaviour.test.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"29fdd275c3909267a083a1fe536b5dfc19f9f2d657c79dcd17d3252b3fed0ab7"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/bundle-behaviour.test.ts:8 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/bundle-identity.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/cli/test/bundle-behaviour.test.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"477de271c1db7a2a628b81fc32d005266cf6594b45a52656b878f659e0db6b8d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/bundle-link-legacy.test.ts:6 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/connection.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/cli/test/bundle-link-legacy.test.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"e64949ab038767adbf426e6ee3fba18bff7efc962b185c5b5d9a22cdb5348516"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/bundle-link-legacy.test.ts:7 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/migrate.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/cli/test/bundle-link-legacy.test.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8504e6b02c705184a17ca6c51730f550a7da78c48df68a678eeaebd3263e9d4"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/bundle-link-legacy.test.ts:8 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/all-migrations.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/cli/test/bundle-link-legacy.test.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e519c91a0acd159c11df8e92ebbb1f57ce9abdb07045b9b9f21be04a7ab91c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/bundle-login-files.test.ts:7 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/connection.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/cli/test/bundle-login-files.test.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"d786bf398016c69129b39cdd25001a4a6b60878576e3271eb6af0040aedc51e8"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/bundle-login-files.test.ts:8 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/migrate.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/cli/test/bundle-login-files.test.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9cfe9690ee3a6dfcc2754b52991c9b3053ae5848b2a8fe86baa5000614cf7bd"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/bundle-login-files.test.ts:9 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/all-migrations.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/cli/test/bundle-login-files.test.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad969bdf8b8e6a60b5efd03709d9a099ad7006017690912cb7436d9bf62deddd"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/bundle-source.test.ts:8 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/pod-bundle-assembler.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/cli/test/bundle-source.test.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"270e1eeb0b4242eaf17a8110fe62d14ec5dd068618ee87b036acc4d825a11e52"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/claude-versioned-attention.test.ts:7 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/rig-repository.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/cli/test/claude-versioned-attention.test.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"037727d39bb89ef9ed8ca37735e23efadf802aeb1479987f9354ef7f31a292cf"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/claude-versioned-attention.test.ts:8 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/session-registry.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/cli/test/claude-versioned-attention.test.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2053300834000352ebd969eb43f8fea61f87560457cf140082178e4dd51332"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/claude-versioned-attention.test.ts:9 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/event-bus.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/cli/test/claude-versioned-attention.test.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"36964b85574475ea176c63210bb9b9149f944f0385a470b0981c261dd8c846e7"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/claude-versioned-attention.test.ts:10 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/snapshot-repository.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/cli/test/claude-versioned-attention.test.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"39dfbb18895020980278b7117b1181df0552addeabcb81aa51ec21dba9736629"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/claude-versioned-attention.test.ts:11 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/checkpoint-store.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/cli/test/claude-versioned-attention.test.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"07565caed3d798ecda81308465b7b47d2ffccc06bc51f61ca0ee77380405f2c6"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/claude-versioned-attention.test.ts:12 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/snapshot-capture.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/cli/test/claude-versioned-attention.test.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"6abc4c45bf4cc457900778c4e33007e66aceef0c463b323b8fc92422a4c9accc"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/claude-versioned-attention.test.ts:13 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/node-launcher.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/cli/test/claude-versioned-attention.test.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33345c3732858cb455e68eb2541bfabcb456c5d6971a8460307423b3aee0e23"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/claude-versioned-attention.test.ts:14 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/restore-orchestrator.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/cli/test/claude-versioned-attention.test.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f0844dc6a0a66b83af14c378cf9f28c5a74c4f304b79acccbd0d9d297df63a"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/claude-versioned-attention.test.ts:15 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/seat-attention-reconciler.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/cli/test/claude-versioned-attention.test.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"80833756df6a90d263e782259cbb700cd5eb5ef8a43d6213de49e0ce7b10e991"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/claude-versioned-attention.test.ts:16 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/seat-identity-reconciler.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/cli/test/claude-versioned-attention.test.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"468dabb9aa813ad6738f8d3d4b27bec1eea402f3b01f57f5ecf5f9851f978c86"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/claude-versioned-attention.test.ts:17 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/seat-identity-store.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/cli/test/claude-versioned-attention.test.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"255cb2736aaa3ec19b803eab6a70268fd566ee6c5bb8be8f203d1baec892f76c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/claude-versioned-attention.test.ts:18 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/agent-activity-store.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/cli/test/claude-versioned-attention.test.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed5e162d7c650c60b5cbfda3262859790d1ffef994896e9bb1dd46cb593a09dc"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/claude-versioned-attention.test.ts:19 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/node-inventory.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/cli/test/claude-versioned-attention.test.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb21aaabe5aa7026e67529be977a59a38b15a7e52c04ff3279a122d3380bb259"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/claude-versioned-attention.test.ts:20 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/routes/sessions.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/cli/test/claude-versioned-attention.test.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"217fb0e4d5f6279204a57379c550a42bdae7c92102955e8eb4524de89cc2bd75"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/codex-login-shell-config.test.ts:6 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/user-settings/settings-store.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/cli/test/codex-login-shell-config.test.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f9eee3192de550ecc9a66997b13f76a8be1866e2ec87a8eb3b2973cc32352dd"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/compact.test.ts:5 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/routes/compaction.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/cli/test/compact.test.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"92689633273041dda78610ccef75121b8dd0f6a6f77223e7b046264c56521b9c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/config-atomic-write.test.ts:6 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/user-settings/settings-store.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/cli/test/config-atomic-write.test.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a2e8e91d61f00f9ef237526cd2d8306c8eec4597d124c300bf8a49ed20539b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/context-install-suffixes.test.ts:6 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/context-packs/manifest-parser.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/cli/test/context-install-suffixes.test.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33fe9b42c979d879f9445086ad25b0e21b80af39d16b08d248932069ea7fcba"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/context-install-suffixes.test.ts:7 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/context-packs/context-pack-library-service.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/cli/test/context-install-suffixes.test.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceaafd03c0bbeb06111804bf556f66fda5a058e3d1568ff40dd058ab7322cd56"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/context-local-install-failure.test.ts:6 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/context-packs/context-pack-library-service.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/cli/test/context-local-install-failure.test.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c73429fe2613b60f4c45b16cf7bf0f4d3ec385ea15dcc1b87f0ba59098748b4"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/context-recap-write.test.ts:17 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/context-packs/seat-recap-store.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/cli/test/context-recap-write.test.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"24dd830deec44d4597da93d6674521c359a930b60234c3df1906bc0d005c68b3"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/desktop-wake-loop.test.ts:14 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/connection.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/cli/test/desktop-wake-loop.test.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"36cb23df5bd633fe9d891ab443249abfc11cf09b5c8f6eda0b3bfb695c9e23a3"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/desktop-wake-loop.test.ts:15 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/migrate.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/cli/test/desktop-wake-loop.test.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"da55d289b96f2f984986e0a5080ad9d7fea98cd0d80352dba90597c564530c03"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/desktop-wake-loop.test.ts:16 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/all-migrations.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/cli/test/desktop-wake-loop.test.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9eb04a94893a7ec22cfed555932ee3cae6c8943803b39c96054e8b88814d93b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/desktop-wake-loop.test.ts:17 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/event-bus.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/cli/test/desktop-wake-loop.test.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1b1a93967354de2f064f5d2834c5600e16baedd9bad68bc84cd35c0f370004"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/desktop-wake-loop.test.ts:18 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/queue-repository.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/cli/test/desktop-wake-loop.test.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"0830c2c67682c55176b18faaf38c806131a7a4db02d9696106d2fe3085b96177"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/down-remote-outcome.test.ts:9 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/routes/down.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/cli/test/down-remote-outcome.test.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fbd6f9210b58cca6e798b2a027cf7d93eb8e550f8550382115f480bd163ba6c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/environment-export-http.test.ts:1 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/queue-repository.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/cli/test/environment-export-http.test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e9b6cab00be9094d9d589e900aed46b52b828ce058afa00c51ee4c33044871f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/environment-export-http.test.ts:2 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/outbox-handler.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/cli/test/environment-export-http.test.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"fefd73a7388bc14b14ab75aefac579e8a6b4985be879dd62a464179f77827d5b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/environment-export-http.test.ts:3 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/event-bus.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/cli/test/environment-export-http.test.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"d60d95b1669eb0559bc7852ac5d53f653238691ea8d417c9e77c54aeca13c9c4"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/environment-export-http.test.ts:14 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/environment-platform.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/cli/test/environment-export-http.test.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d3bb1082711f37a28fac3bdd20b86710105f3281368a610b6a134e4914d33a"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/environment-export-http.test.ts:15 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/connection.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/cli/test/environment-export-http.test.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"b216f7d1f54972399ab843a6ac8b7ccf3f35e2f709764a35378c55d475f0fac2"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/environment-export-http.test.ts:16 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/migrate.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/cli/test/environment-export-http.test.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0278ea8492b745950b836e2f904e0e6b3669e5e8cfc1ca043ea5eff50530e69"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/environment-export-http.test.ts:17 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/all-migrations.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/cli/test/environment-export-http.test.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a0ec2e943e5bea9f14061476655db6e7e28ed98c48df7e7e264eff001b853f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/environment-export-http.test.ts:18 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/hosts/fanout-contract.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/cli/test/environment-export-http.test.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c7a004398841e143506838bf937797dd3afe55b046014ac59f9953d71cba39a"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/front-door.test.ts:14 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/permission-drift.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/cli/test/front-door.test.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c45621403297872376b3dbf60f90e627c6c09908a54c24e87650b9ced3fab03"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/gateway-human-registry-verb.test.ts:9 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/routes/gateway.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/cli/test/gateway-human-registry-verb.test.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e4ec0131b8e2ca2bfead52a760792ea060e17a9ceb615e2633963cea093d9f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/host-pair-decide.test.ts:15 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/event-bus.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/cli/test/host-pair-decide.test.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bdc5602a4e9023fb84f0aec36dca8603e10a1560026a8fe4473e10b648e66c0"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/host-pair-decide.test.ts:16 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/queue-repository.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/cli/test/host-pair-decide.test.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9cdbcb4f23db721ce89782ff0814829d6efc2b87bbcc568c7fbd3c1178d25b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/host-pair-decide.test.ts:17 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/queue-destination-check.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/cli/test/host-pair-decide.test.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"8abb06e7380a62776a45736bea9e395d914c7d91ef316a9eaae1fb4adf188d21"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/host-pair-decide.test.ts:18 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/routes/hosts.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/cli/test/host-pair-decide.test.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc92500a523ce0e14598846bbbb2bb713ef576c7d352ec74973f6ed26f4ba96"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-2026-07-28.test.ts:16 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/connection.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/cli/test/mcp-2026-07-28.test.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c6e2e4b586acd69ee27b37b11075a4d07820ff425581bba5c6940108af28f83"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-2026-07-28.test.ts:17 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/migrate.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/cli/test/mcp-2026-07-28.test.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7839b36d6635992266d200d8c5078f92ea17fea918d39900360865ab2f07326"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-2026-07-28.test.ts:18 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/all-migrations.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/cli/test/mcp-2026-07-28.test.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"9856a58322c0974fa5add740a4ac95070410054a1adec7e8fed7d1c533ad192f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-2026-07-28.test.ts:19 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/event-bus.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/cli/test/mcp-2026-07-28.test.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"45d514b5a1dcbd302be3fbdcc319a138923bc44e7b2ec65da6618da3a66b874e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-2026-07-28.test.ts:20 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/queue-repository.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/cli/test/mcp-2026-07-28.test.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a92d6d7f70d87285f32f98f5553754821649ec9b5b3184328b3be6cbde1c6d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-2026-07-28.test.ts:21 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/outbox-handler.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/cli/test/mcp-2026-07-28.test.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"050ad4738e38fef22cbf9dfc88750c474a5b7e7d9f5edda77ebfa38b1b076dfa"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-decisions-daemon.test.ts:14 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/connection.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/cli/test/mcp-decisions-daemon.test.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c84a3c50523d519419fbaaa78b67aded23d56721a44963f33f1d82c61a9aec"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-decisions-daemon.test.ts:15 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/migrate.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/cli/test/mcp-decisions-daemon.test.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"09454bf6a843a77dcdd4b790b6c3b54e281c9ca6b11726d5c657bc0b20600213"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-decisions-daemon.test.ts:16 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/all-migrations.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/cli/test/mcp-decisions-daemon.test.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9544606d57a7730554bdcbbfad782738ca3e358e4bec6815a3b428e8fa668d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-decisions-daemon.test.ts:17 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/event-bus.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/cli/test/mcp-decisions-daemon.test.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc0d6a07b4fa6fd89641e3862e29f3f7bf18ba0bf3483d2316682b4d8f14ecd"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-decisions-daemon.test.ts:18 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/queue-repository.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/cli/test/mcp-decisions-daemon.test.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0985aeecf1f0db89b441e30861da3250fecf317d0edb5ec8368cc1c34f22369"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-decisions-daemon.test.ts:19 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/gateway/human-registry.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/cli/test/mcp-decisions-daemon.test.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e357c7355a32e7822d192e3fd9bfe441e3739866dca8cd0c32c27449508ac88"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-decisions-daemon.test.ts:20 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/routes/gateway.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/cli/test/mcp-decisions-daemon.test.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f0f5e48d8cb8bcbeda48a8983ad3a41cdc9ed0c818b38cb7f06bcd539447f3"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-decisions-daemon.test.ts:21 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/routes/queue.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/cli/test/mcp-decisions-daemon.test.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b0d6a32e58c17c97521b7521821b37507a9192e981f1db000f48e194d85e6d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-http-daemon.test.ts:16 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/connection.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/cli/test/mcp-http-daemon.test.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"91efeae2f36f2e25cfbce329b9a3bd65b85d160db5e95323492cd36fb12ace4d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-http-daemon.test.ts:17 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/migrate.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/cli/test/mcp-http-daemon.test.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb178be530754ca7031ba8951848070cf055d1ab73dacb8041f6b563fc24ba36"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-http-daemon.test.ts:18 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/all-migrations.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/cli/test/mcp-http-daemon.test.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"b691bf30be433294e1effab34132e3cb2af0b035d85840c65abca0f1eff439ec"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-http-daemon.test.ts:19 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/event-bus.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/cli/test/mcp-http-daemon.test.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9cd55d23b691358d6b9182be956e710a16e94a40df969b36d2433e103d1fc64"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-http-daemon.test.ts:20 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/queue-repository.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/cli/test/mcp-http-daemon.test.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"163f424609ebf3a28d6d0d9f2b0f7fd13769f680a86ba4d0bf6c868bddd86458"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-http-daemon.test.ts:21 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/outbox-handler.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/cli/test/mcp-http-daemon.test.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"0782a561ed4cb3061625a2baea9901d4151f1a1ab4e41a67c218f04dcb80b581"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-http-daemon.test.ts:22 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/mission-control/mission-control-write-contract.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/cli/test/mcp-http-daemon.test.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc192bbec47ddc2e27518ffbb13c3d821015ddda2280302e678419145f746e7f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-http-daemon.test.ts:23 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/mission-control/mission-control-action-log.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/cli/test/mcp-http-daemon.test.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd2d380d2b1259f36c3c67aa1263eb61cd1286cc073bbe9e72181273d2873ed"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-http-daemon.test.ts:24 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/gateway/human-registry.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/cli/test/mcp-http-daemon.test.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf403778bda7785ad7a95b4082a10066104b871831bc9bbf35335cc95283ee8"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-http-daemon.test.ts:25 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/gateway/slack/queue-access.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/cli/test/mcp-http-daemon.test.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3df38eadcf745f8fd8aa6f5019fa8b374a721a10300e87726f27bc5ad2e5301"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-http-daemon.test.ts:26 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/gateway/slack/message.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/cli/test/mcp-http-daemon.test.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"40131a453be2e5405e48c6b093b2f85cf4232b6aec238df35377ed44202465e7"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-http-daemon.test.ts:29 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/hosts/fanout-contract.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/cli/test/mcp-http-daemon.test.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"8845ae0a0f1c7c811ebff3e0661d602455ada456b133ac63c5b5f79a89fefc89"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-http-grant-service-daemon.test.ts:16 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/connection.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/cli/test/mcp-http-grant-service-daemon.test.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa680f820e9e9afdf5b01a7ae6d3eb077bc5fb1165b2780a2a8239a5b9f3db8"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-http-grant-service-daemon.test.ts:17 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/migrate.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/cli/test/mcp-http-grant-service-daemon.test.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"a47b1d1dc5fd969447687c73eab0282cd564f1f9043f5d840002664af10ea06f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-http-grant-service-daemon.test.ts:18 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/all-migrations.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/cli/test/mcp-http-grant-service-daemon.test.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"be4c243d80402a7c03fe208b68e64b29e0b740b8d8a409c5fa102b45452286bb"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-http-grant-service-daemon.test.ts:19 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/event-bus.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/cli/test/mcp-http-grant-service-daemon.test.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f08ec8dd88a908e74741ae5d3c615f64b410fb83a3660d16c03d29a73cbfce"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-http-grant-service-daemon.test.ts:20 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/queue-repository.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/cli/test/mcp-http-grant-service-daemon.test.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eda53bf163e6b29c2f877431e3f278c534b092d4c3d096536aad4a8f67e10c5"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-http-grant-service-daemon.test.ts:21 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/mission-control/mission-control-write-contract.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/cli/test/mcp-http-grant-service-daemon.test.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"0111d7b0d52322d31f72866ee1782cce1f85f4df713394cc5e34ecb15c463f70"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-http-grant-service-daemon.test.ts:22 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/mission-control/mission-control-action-log.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/cli/test/mcp-http-grant-service-daemon.test.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"286fd8e6d29f3aac973ad018215f5a08f92c937113caced59fed9ba5b6512354"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-http-grant-service-daemon.test.ts:23 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/hosts/fanout-contract.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/cli/test/mcp-http-grant-service-daemon.test.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"99801e22d3121f8404c2a0aa25214ffb27c15b4e0dbf84318ab1c9c3984545ce"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-http-grant-service-daemon.test.ts:24 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/gateway/human-registry.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/cli/test/mcp-http-grant-service-daemon.test.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89829a17ac2583f60de2bb8e775b5ad1575b477557ae932eb8d169283c0f740"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-http-grant-service-daemon.test.ts:25 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/gateway/participants.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/cli/test/mcp-http-grant-service-daemon.test.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"262fb371c83e53066db9beed8c8f01bc2b69d290eb099e1d858739e1c57aebac"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-http-grant-service-daemon.test.ts:26 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/gateway/slack/queue-access.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/cli/test/mcp-http-grant-service-daemon.test.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d1842059463fadcc44bdabaeef5a31e0b91612fe707aabfca5dc64132396d4"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-http-grant-service-daemon.test.ts:27 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/gateway/slack/message.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/cli/test/mcp-http-grant-service-daemon.test.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b30ff057ddd727f71fbfb333aef620e308148ad29ce5671c3e1dc05dcbcdc7"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-http-grant-service-network.test.ts:16 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/connection.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/cli/test/mcp-http-grant-service-network.test.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc12c1c8e17254d96703d182a5bcd89d81c37aef73004ac65a51ef9a6070246"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-http-grant-service-network.test.ts:17 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/migrate.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/cli/test/mcp-http-grant-service-network.test.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf4cfbf29f23b7d083f1054214c101d95772909edb15f08c04aa5b3d5fc7d29f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-http-grant-service-network.test.ts:18 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/all-migrations.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/cli/test/mcp-http-grant-service-network.test.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c1bd7cf4e2d3b9d6e6b17b52b5bcac84a7c172bfdbf2df70b2ec1e535513d3"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-http-grant-service-network.test.ts:19 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/event-bus.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/cli/test/mcp-http-grant-service-network.test.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb01b4971f0cc4705be51a1a0caf28e995100521ee09c667e045fa5bda531a25"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-http-grant-service-network.test.ts:20 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/queue-repository.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/cli/test/mcp-http-grant-service-network.test.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"65249f60bb33d3bc0c0c47c8a45a8d05ba5f706fb82ba93b20324c628532d425"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-http-grant-service-network.test.ts:21 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/hosts/fanout-contract.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/cli/test/mcp-http-grant-service-network.test.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"68cb91e495ddab2685fc52a5c6680e2334f38b194531ce8690434ce5ba31ffac"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-operations-daemon.test.ts:15 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/connection.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/cli/test/mcp-operations-daemon.test.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2b00e1f14955d1cf8d5afed880f10c9742fcf5581c3e0c9db0a5960d8d0784"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-operations-daemon.test.ts:16 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/migrate.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/cli/test/mcp-operations-daemon.test.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9e3a52e5fada1d8ea2d17229eca0415d8f85e3efb3aae98856c11d67c56bcc"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-operations-daemon.test.ts:17 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/all-migrations.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/cli/test/mcp-operations-daemon.test.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"f42eac7f10ecc112e89389c40ea8b54947f7afa73d57db02e58ef25806cee80d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-operations-daemon.test.ts:18 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/slices/slice-indexer.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/cli/test/mcp-operations-daemon.test.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"f06a8720813559e93d573ec7bf2afc228748c3701250eaa3a0fa5c46b0edead7"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-operations-daemon.test.ts:19 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/slices/slice-detail-projector.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/cli/test/mcp-operations-daemon.test.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3691de18a18555548d41ecb633230bd911015934567c3c31289db6eafb52161"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-operations-daemon.test.ts:20 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/context-packs/context-pack-library-service.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/cli/test/mcp-operations-daemon.test.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd7a8d66ef09c815f98aebb8078b671872f5592de470fac1b804abd98179c98"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-queue-daemon.test.ts:14 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/connection.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/cli/test/mcp-queue-daemon.test.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"0848b43e5cf60e5aee91b94be5e733a822fe86060e3dae5e2e68e8aa048a4cd1"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-queue-daemon.test.ts:15 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/migrate.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/cli/test/mcp-queue-daemon.test.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a2bc86c63637239f2e51571660d79eb9d1ec512c0c8f4dfd7a676efa204331"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-queue-daemon.test.ts:16 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/all-migrations.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/cli/test/mcp-queue-daemon.test.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"3257650ad9cd783d76ac4623d16cec603bca9400a9037fa921d8a526d4df585a"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-queue-daemon.test.ts:17 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/event-bus.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/cli/test/mcp-queue-daemon.test.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f025688eba292746a6524c66d4ea3fe1e91ebd9175bd37bc4a8b3f702f294f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-queue-daemon.test.ts:18 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/queue-repository.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/cli/test/mcp-queue-daemon.test.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"eda37e6321da383e644c5c8f1c28125f31adf05f4f2e80558651310956a0bdd3"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-queue-daemon.test.ts:19 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/outbox-handler.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/cli/test/mcp-queue-daemon.test.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4866cef9a8dcaa0ae47502b527ec70f6e67b111025b768a4e976608143a5fb"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-telemetry-daemon.test.ts:10 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/connection.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/cli/test/mcp-telemetry-daemon.test.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f486c797d2ebd78bbb2c77c49a591c54b927872f76d72d20a68efe4097e6af5"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-telemetry-daemon.test.ts:11 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/migrations/003_events.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/cli/test/mcp-telemetry-daemon.test.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"269e9bd3db47763391e222497321489ada2229bac091d8b3c2e8e586983ffd8a"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/mcp-telemetry-daemon.test.ts:12 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/routes/telemetry.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/cli/test/mcp-telemetry-daemon.test.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f652684bdd40233f20bd71549ce98cb82a9a2c4d5508abe687c1b059d27c29"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/network-command.test.ts:11 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/all-migrations.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/cli/test/network-command.test.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc48495fbbf3729ca6a7a77f1b1f7bd6e63743a1a22f40387f8ea1016cfd231"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/network-command.test.ts:12 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/migrate.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/cli/test/network-command.test.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"2420a1cb4b638c01ea44159fb97340130d59d5c5588c9ccfe3e838bcff8a7cc9"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/network-command.test.ts:13 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/rig-repository.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/cli/test/network-command.test.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f128bd991d0bc5222d421d6b778edb585a17dbd18315e51fd6fbd027a77d10a6"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/network-command.test.ts:14 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/routes/network.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/cli/test/network-command.test.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ffebbf18c5dd8a49b0704b3a8170614e4fabcdade887af01fd17b8a66cc1cab"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/network-connector-hub.test.ts:12 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/connection.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/cli/test/network-connector-hub.test.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"31296e95cd00f57fc92984f8d65eb2c277ac90c63b7d10608cdc4251c75bbe9a"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/network-connector-hub.test.ts:13 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/migrate.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/cli/test/network-connector-hub.test.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"9694c1acd3876acc9fccc0ef644afe3200a606d55eb8e3a6d1ebd3384930ed92"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/network-connector-hub.test.ts:14 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/all-migrations.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/cli/test/network-connector-hub.test.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30e9a10ddd4daa6e0442ebffb9196b272bc032f5b0d2418b70bf2df53f0b6a5"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/network-connector-hub.test.ts:15 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/event-bus.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/cli/test/network-connector-hub.test.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"514f6d3857c751b62f759f1b20c326ae71b1c663dc60a571cac667026c7a75e5"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/network-connector-hub.test.ts:16 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/queue-repository.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/cli/test/network-connector-hub.test.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e0b046c16ed26afccf7cd05c3a5a2799fd88960b293d5ad511ad994c34d60b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/network-connector-hub.test.ts:17 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/outbox-handler.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/cli/test/network-connector-hub.test.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c67b667492d019f53798bff54394f767c4c6da9c6548f0270966e6b8ee6e1c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/network-connector-hub.test.ts:18 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/rig-repository.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/cli/test/network-connector-hub.test.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"14562fb35aa73ed076a0a838ad788f332ee4ed1d09ae3b608f78945b21e74762"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/network-connector-hub.test.ts:19 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/network/network-bindings.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/cli/test/network-connector-hub.test.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c96e7b9878e53df9cdc63bfa00ba2b856ffed562c9e119a4b8c7564a9ceb33"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/network-connector-hub.test.ts:20 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/network/network-connector.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/cli/test/network-connector-hub.test.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"34438e23eacafcc10e508d1a836b7b8d08f5840c1c9a4582aff8894159a71a2d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/package-working-directory.test.ts:10 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/connection.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/cli/test/package-working-directory.test.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b0864765cde275c2fc89277395e57a19a171a9179b15ab0b3ed90f908e09a3"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/package-working-directory.test.ts:11 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/migrate.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/cli/test/package-working-directory.test.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"d60bb4defc79504a841d039927d5e509e4890ad8510c72ee62fbdbb9605382d4"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/package-working-directory.test.ts:12 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/all-migrations.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/cli/test/package-working-directory.test.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"197c9a191b1312a1d7afc9a19e397e789afa6cffecf39f8e5afcc58582838906"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/package-working-directory.test.ts:13 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/event-bus.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/cli/test/package-working-directory.test.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4972414fe7132800de7411383555f2f28c73ee57c3f9884c2677aa5457bd51"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/package-working-directory.test.ts:14 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/package-repository.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/cli/test/package-working-directory.test.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c131a01ae0be60f1109a34c1bb313f7f436aca85f09c37c367169687744f00c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/package-working-directory.test.ts:15 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/install-repository.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/cli/test/package-working-directory.test.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa4e0cbc83b61a1cc02e2ea3aafa32bc86cc56ad657a565ab227e8887503cec8"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/package-working-directory.test.ts:16 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/install-engine.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/cli/test/package-working-directory.test.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"f57a56a6adedbdd35fc29b23b072904177ace76176ae3e791c8cbb9dededc374"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/package-working-directory.test.ts:17 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/install-verifier.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/cli/test/package-working-directory.test.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6956584563a55079dcfe77e8cddacff3eb89c944b64458821831cf302d05f1d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/package-working-directory.test.ts:18 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/routes/packages.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/cli/test/package-working-directory.test.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f1ccf1783ff85ac6c40d2fe4ce3d5d6204561e3fad7548403a73f2eebb8c7f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/policy-spec-delimiters.test.ts:3 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/permission-policy/policy-spec.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/cli/test/policy-spec-delimiters.test.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"edfa48a1c42015ab532fd84131d2388f6b08a6f8e1ea9d665e7c0245621e045f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/progress-ui-conformance.test.ts:14 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/progress/progress-indexer.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/cli/test/progress-ui-conformance.test.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"c823d3501b58fb5437a8ea8923761da81de6ce2db537c0512aeabad527f401ad"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/project-worker-entry.test.ts:10 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/routes/projects.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/cli/test/project-worker-entry.test.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"094e78d09654bb191757e170c583b494e10be44a16cf8244e40c7c4b552b988c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/project-worker-entry.test.ts:12 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/classifier-lease-manager.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/cli/test/project-worker-entry.test.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f2d7d11d54f2c734935b687a061905a8bf114b3f9022c90cb5bc85b8a2eefa"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/project-worker-entry.test.ts:13 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/classification-attempts.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/cli/test/project-worker-entry.test.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"68fe034b41a11f0c2de08ad156a69e7287ff875589d60d518f7d017689077b68"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/project-worker-entry.test.ts:14 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/classification-sources.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/cli/test/project-worker-entry.test.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b09c4fa9dfd20f25ea5bb2521229923ee6c79821b1a3bfee39db3053b89272"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/provider-usage-across-hosts.test.ts:14 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/provider/usage-across-hosts.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/cli/test/provider-usage-across-hosts.test.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6321096447cec19520a5a2f9f9fa049952608a61c698654966ecd06b7406b65"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/provider-usage-across-hosts.test.ts:15 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/provider/codex-usage-reader.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/cli/test/provider-usage-across-hosts.test.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"87556b166ed55a8b929f4291bbb431ad341dae8970c8a33edcb5cf621fd15f8b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/provider-usage-across-hosts.test.ts:16 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/provider/claude-auth-status-reader.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/cli/test/provider-usage-across-hosts.test.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"97af9f6fa0c1b15ac5b0f887f03c784896d373534e4c1e5bfeaa81ed487eb62f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/provider-usage-across-hosts.test.ts:17 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../tui/src/daemon-client.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/cli/test/provider-usage-across-hosts.test.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e6694bbac9eed53052f76f4f3b6da15d0095c002d63c4f8a51144c648d2a85"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/ps-daemon-label.test.ts:8 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/routes/ps.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/cli/test/ps-daemon-label.test.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"827a3d09c00f8405ce74e5ae6daa330751db30ff0647567e9954a00877fb43ba"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/ps-daemon-label.test.ts:9 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/ps-projection.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/cli/test/ps-daemon-label.test.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"00aef948a90a612aaaed7adb56b65b8fd1763d7430f4dbf82a6d78bb6ccf828e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/ps-resources.test.ts:8 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/routes/ps.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/cli/test/ps-resources.test.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ced521f655d574183407f7fe138e18d7f64e2b10843197ccc1e5895030cd008"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/ps-resources.test.ts:9 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/ps-projection.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/cli/test/ps-resources.test.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"09214dac9885725cb72124d6f0491b1b56e7fe05825bdcffdcedc65770e33969"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-destination-advisory.test.ts:8 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/startup.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/cli/test/queue-destination-advisory.test.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d055cbab5b22c1d8a08c71c9188ecdb0ad61b8b192d6b43e0f4c8192560e788"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-destination-advisory.test.ts:9 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/user-settings/settings-store.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/cli/test/queue-destination-advisory.test.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7bfd1603d20d1cca13a2e86699f92bf875e2a31ea07f4d482497a24a91ca7c1"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-destination-advisory.test.ts:10 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/queue-repository.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/cli/test/queue-destination-advisory.test.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a65cc081f36c173bb0d2735d0119ae75c3bd9bc6f91e1019264d093f676898a"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-destination-advisory.test.ts:11 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/gateway/human-registry.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/cli/test/queue-destination-advisory.test.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"802dfac426689eb81840cdc650e7e01488b8bd0cd11742afbe02370b7bbc5549"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-destination-advisory.test.ts:12 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/routes/queue.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/cli/test/queue-destination-advisory.test.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"77fa3b9e0ebe1ba5f65f9735c7029f5d6b16d8930494621ce430b04ce9298302"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-destination-advisory.test.ts:13 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/hosts/fanout-contract.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/cli/test/queue-destination-advisory.test.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"893fe27844e079328e02852b8d275c5a2866c7888a9f2314d763b87369e6dd6e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-destination-advisory.test.ts:14 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/current-work.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/cli/test/queue-destination-advisory.test.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f17498242aae5db8fafedcdc9ff0299ea4b528c3147a90f2b786041422a591"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-destination-status.test.ts:2 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/startup.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/cli/test/queue-destination-status.test.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd3b2c69e76eecab1d4267ff38347607c062feecb24d9229bada5857328d8c20"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-destination-status.test.ts:6 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/user-settings/settings-store.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/cli/test/queue-destination-status.test.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"7198c8f0ef5131985c42c6584819d0225651f28a53da5beef136d66cd96fafdd"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-destination-status.test.ts:7 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/hosts/fanout-contract.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/cli/test/queue-destination-status.test.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"795edfec3c90b8f77a0bef94e68586082b5d8b785fd7ceae545ffdcb04663c07"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-forwarded-response-outcome.test.ts:8 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/routes/queue.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/cli/test/queue-forwarded-response-outcome.test.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"2866e4a8378f6bd21898603f0b84e4dcc31f8c5298801d408d1f3a01023d45c5"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-host-qualifier-route.test.ts:21 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/connection.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/cli/test/queue-host-qualifier-route.test.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d894b0692c2dcccb522fb7795af4497b2f585575e4e71c8eda8e2efcbab751"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-host-qualifier-route.test.ts:22 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/migrate.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/cli/test/queue-host-qualifier-route.test.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33b81322c504374aa2a20c895ed0747d28b67b43aee1884e28ed4ecb88cc65a"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-host-qualifier-route.test.ts:23 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/all-migrations.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/cli/test/queue-host-qualifier-route.test.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc7ca9f4ebd375f0c253d6da9ba8b59a55693c78253b0dacac9f7157490d866"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-host-qualifier-route.test.ts:24 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/event-bus.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/cli/test/queue-host-qualifier-route.test.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ccac7daebe1214155f08f28aaccae3988e1770e1a74ca70bef64f2f8bd1093f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-host-qualifier-route.test.ts:25 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/queue-repository.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/cli/test/queue-host-qualifier-route.test.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"2532122fa8d84d99374300d45c5ea78b2e4d777ef67ef0a4b18a91563120ef4e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-pane-delivery-outcome.test.ts:2 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/startup.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/cli/test/queue-pane-delivery-outcome.test.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"d481eb05fd443a7e92fe6e3e4a28c009649ae1362186ed8fc66650aaf382e3d6"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-update-external-source.test.ts:9 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/connection.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/cli/test/queue-update-external-source.test.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce51d526fcd9940ab17cd8a1ddaf65da765b857fb192fb5a050e657bcfb12e7d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-update-external-source.test.ts:10 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/migrate.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/cli/test/queue-update-external-source.test.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"7460cad1cf736edb079560702565cf65d2413dfc86ef4c56d1f2f92204ec4504"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-update-external-source.test.ts:11 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/all-migrations.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/cli/test/queue-update-external-source.test.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe7a41dc17c577d80b4afcfde29a0477c22fbedc6d2ed70301aeae6d7f64670"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-update-external-source.test.ts:12 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/event-bus.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/cli/test/queue-update-external-source.test.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c18288dcd47d993b5d8123bd5fde3ce55daf09b7db1539f540ddc0b00271db"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-update-external-source.test.ts:13 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/queue-repository.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/cli/test/queue-update-external-source.test.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de15dcdd9570f8a68824eea43d248ba02b0ebb3c14e0a086f0612e681282089"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-update-external-source.test.ts:14 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/routes/queue.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/cli/test/queue-update-external-source.test.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"1315febf458b397aba8d80242e837e5d6ccb855c4ab1dda76da64a8a61e8f372"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-update-metadata-reject-cli.test.ts:9 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/connection.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/cli/test/queue-update-metadata-reject-cli.test.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b1dd9d9fd17429d405d58a1ed67c5424a8832d9f0210f2ecd06559c941a845b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-update-metadata-reject-cli.test.ts:10 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/migrate.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/cli/test/queue-update-metadata-reject-cli.test.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"23afe88af171769718aec76bc9aeca936e39651bcb564d83be58df646e4ae4d8"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-update-metadata-reject-cli.test.ts:11 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/migrations/001_core_schema.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/cli/test/queue-update-metadata-reject-cli.test.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a63a4037aac67c32aab2bd8291e6e3d4d34194993c3b47749b35ec029b8458"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-update-metadata-reject-cli.test.ts:12 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/migrations/003_events.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/cli/test/queue-update-metadata-reject-cli.test.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"547044c8534a70e2399a4c66374f08a5c786db4db52e2e0f7e4f10ef3502d726"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-update-metadata-reject-cli.test.ts:13 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/migrations/024_queue_items.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/cli/test/queue-update-metadata-reject-cli.test.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"32cad04367e0d929ccead05346b3508158735ed5f18334920ccb8590beedd874"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-update-metadata-reject-cli.test.ts:14 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/migrations/025_queue_transitions.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/cli/test/queue-update-metadata-reject-cli.test.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdcd697feed027737c7d2dafef0fef6615fd44f8133ead1984873b51a27aff88"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-update-metadata-reject-cli.test.ts:15 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/migrations/026_inbox_entries.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/cli/test/queue-update-metadata-reject-cli.test.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"a21874222bbd01fcdfa2a4be1c583b9122e003174a5cba0abef28989ff54eef7"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-update-metadata-reject-cli.test.ts:16 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/migrations/027_outbox_entries.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/cli/test/queue-update-metadata-reject-cli.test.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"1feb645db2ecbca4cd76bdfa4e32253fd786bf8767b686047e93cf6d81376318"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-update-metadata-reject-cli.test.ts:17 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/migrations/039_queue_target_repo.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/cli/test/queue-update-metadata-reject-cli.test.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b92efa307f668519cec1027c2d1395097ec25f6bf821703cc315695295aa29"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-update-metadata-reject-cli.test.ts:18 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/migrations/044_queue_item_summary.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/cli/test/queue-update-metadata-reject-cli.test.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"c13b4082eea4a528f0e0a8f1f1a677a3b27c83b79b913b1c099bfcd3700a4477"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-update-metadata-reject-cli.test.ts:19 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/migrations/048_queue_item_evidence_ref.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/cli/test/queue-update-metadata-reject-cli.test.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3a1717b502a6e818232ff789f15bf48421985d1ddbf5380d6f4da68526b253"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-update-metadata-reject-cli.test.ts:20 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/event-bus.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/cli/test/queue-update-metadata-reject-cli.test.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"a15988cb22afb72e886bc127d314ea05981c647306272527d28ef308a0b5e1c4"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-update-metadata-reject-cli.test.ts:21 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/queue-repository.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/cli/test/queue-update-metadata-reject-cli.test.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a2ce6076820041cd6fc02784083847425997048bc3d549b82381ccd47b9916c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-update-metadata-reject-cli.test.ts:22 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/routes/queue.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/cli/test/queue-update-metadata-reject-cli.test.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"360d65c0abaafa43494f7fca762d9de94f0c55c1654d86e07de45f74d010a1f0"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-update-readback-domain.test.ts:4 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/connection.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/cli/test/queue-update-readback-domain.test.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc14ea0a7108a1fc7d0fd01d0fbbfdc1e8ee31210a94b6afd3010ee0033728b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-update-readback-domain.test.ts:5 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/migrate.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/cli/test/queue-update-readback-domain.test.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"924beb7b13450ca06f996a67d7f1eace6d36255cb682cddf99be8ce851fe705d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-update-readback-domain.test.ts:6 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/all-migrations.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/cli/test/queue-update-readback-domain.test.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"980f38f875079e156c67ee3e9563eb895d4a88f6f250c73bb007940c95d13109"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-update-readback-domain.test.ts:7 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/event-bus.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/cli/test/queue-update-readback-domain.test.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad5ddc8d4e3b1bb4068104d273e3198c545a3c0ba20e075e15c8bcec09fed65b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-update-readback-domain.test.ts:8 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/outbox-handler.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/cli/test/queue-update-readback-domain.test.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"36fe7ff4be7473d7932bf5af7087a3a5a56fc12a9cd2aaf37b5f157ec0a7f118"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-update-readback-domain.test.ts:9 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/queue-repository.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/cli/test/queue-update-readback-domain.test.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db84e3dbe576ff7ef92e3265b72da27be3c494e18c9ec77b0703b3c3a2dc8ba"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-update-readback-route.test.ts:8 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/connection.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/cli/test/queue-update-readback-route.test.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b516fc3ce9aee23b4bf44e99a0c49109e1e8eb1917a4d0b8c6168a6140cb930"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-update-readback-route.test.ts:9 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/migrate.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/cli/test/queue-update-readback-route.test.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef148fee969c267e02b60356e6b922e91be7ecf96e2421a8fd72c14ca74bbec6"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-update-readback-route.test.ts:10 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/all-migrations.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/cli/test/queue-update-readback-route.test.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"d787c28d356cbf015dd7e0d7f13f06a26e381afc43ae68f351bb4ff177532900"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-update-readback-route.test.ts:11 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/event-bus.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/cli/test/queue-update-readback-route.test.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"e26f70fd82834a428e88964d92d4e5829aa38352fa99f0aba379b82daffd4386"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-update-readback-route.test.ts:12 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/queue-repository.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/cli/test/queue-update-readback-route.test.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"9011d74527c8cc78994e07a409dcdac486c31e384816ea2f55081064a97ad2ab"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/queue-update-readback-route.test.ts:13 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/routes/queue.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/cli/test/queue-update-readback-route.test.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"92109fb695fadd091fc28e745ece75dc740866924a2fc27c716bfb69c9f36b3a"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/scope-commands.test.ts:17 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/proof/judgments.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/cli/test/scope-commands.test.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5fe13501441c63036c372f9f419d6bedf798ab617a5a4e07529b5fa1a2ac7c7"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/scope-commands.test.ts:18 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/project-lifecycle-compiler.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/cli/test/scope-commands.test.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"d867e3e49fdce9837f1794ccf805250884b950e6f558465133517699e73ea343"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/scope-convention-scaffold.test.ts:26 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/workspace/frontmatter-validator.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/cli/test/scope-convention-scaffold.test.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d7a9c70a212cfe301054de95a7f50087072a26edc8f915b50145e2acec7a73"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/scope-slice-close-in-place.test.ts:11 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/proof/judgments.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/cli/test/scope-slice-close-in-place.test.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f08d1c9d31b77d09caeefa0af8c422647cec10d9b1d63dc97a103c662e274b5"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/scope-slice-close-in-place.test.ts:16 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/connection.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/cli/test/scope-slice-close-in-place.test.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"601f5589969ddce39f832d5a0ca55a5a1ca0463a8aeb4b0ddd4f874728e22edb"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/scope-slice-close-in-place.test.ts:17 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/migrate.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/cli/test/scope-slice-close-in-place.test.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"81fdfbb84f7c925978d17399a579fd9c0ba3d0d5a026efb0830713ae1184995a"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/scope-slice-close-in-place.test.ts:18 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/migrations/001_core_schema.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/cli/test/scope-slice-close-in-place.test.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a7b57d83d62706f0414504171a0d4dbe2d453cf7d76f7f43f14454dade0d4d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/scope-slice-close-in-place.test.ts:19 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/migrations/003_events.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/cli/test/scope-slice-close-in-place.test.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"60441ec74cd94c5a96b79785909f1127532cc50fefaa473edc8cbca5054cb601"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/scope-slice-close-in-place.test.ts:20 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/migrations/023_stream_items.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/cli/test/scope-slice-close-in-place.test.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e33c78e5a9064c66b0d7f364e7ca100d8242923e956070d96ef0349ef648d8"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/scope-slice-close-in-place.test.ts:21 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/migrations/024_queue_items.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/cli/test/scope-slice-close-in-place.test.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdaf2a94a4d4270427bf8d656684d804f77634aadf76bed81a4e80e80885311b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/scope-slice-close-in-place.test.ts:22 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/migrations/025_queue_transitions.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/cli/test/scope-slice-close-in-place.test.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b55dcf06ff10956c9d93d389f32beaf34466cd8c2dc408b0ca45dc64d3fed06"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/scope-slice-close-in-place.test.ts:23 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/migrations/037_mission_control_actions.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/cli/test/scope-slice-close-in-place.test.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3663d3d9db9776f6a6acc438738ba6784874cad752324e183bb59bcd4006671"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/scope-slice-close-in-place.test.ts:24 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/slices/slice-indexer.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/cli/test/scope-slice-close-in-place.test.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c4cbaf85c37bec7543d94e3680bc9379fca1fe93825b63a9ef52921a755de7"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/scope-slice-close-in-place.test.ts:25 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/slices/slice-detail-projector.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/cli/test/scope-slice-close-in-place.test.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b82b24ced2926c683542ba23eb1d529e55ad84f9bbc7ecc343d67ffd8d9973"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/scope-slice-close-in-place.test.ts:26 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/scope/scope-audit.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/cli/test/scope-slice-close-in-place.test.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ca41d1339e384751c30b14ec678a1dd10d98c1e7a5463bc00d720bf00dad15"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/scope-slice-close-in-place.test.ts:27 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/routes/slices.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/cli/test/scope-slice-close-in-place.test.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf14be84f2229326c7d502b48c52ce47495fdc04c1e0bf3361e5ee8b9c376ab"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/sender-identity.test.ts:3 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/connection.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/cli/test/sender-identity.test.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"d273d63032299d65466349eb53bc0f58ad155c5227ebc398d751ce5009f023f3"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/sender-identity.test.ts:4 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/migrate.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/cli/test/sender-identity.test.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"93adbaa94c80bc17bc2f1a1c6cf10c7d711c3529802673da926f840a69397f44"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/sender-identity.test.ts:5 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/all-migrations.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/cli/test/sender-identity.test.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca47b167d0150e3eec5cae6f12af3347af080916c989a5b2a91d427f7e51049e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/stream-consumer-ledger.test.ts:9 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/connection.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/cli/test/stream-consumer-ledger.test.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8d6576789e7d9c42482c0d03bb0178664e4258aa40e9aa75f755864c1c06ece"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/stream-consumer-ledger.test.ts:10 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/migrate.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/cli/test/stream-consumer-ledger.test.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dace04df1dcef6da83dfdc6358a9efa5155d99c81609548d7634a7cc622b3de"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/stream-consumer-ledger.test.ts:11 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/all-migrations.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/cli/test/stream-consumer-ledger.test.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9aa6c413fe9a3d7951d6de825b240f5dedd555c1b04dd4b22befd39611e234"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/stream-consumer-ledger.test.ts:12 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/event-bus.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/cli/test/stream-consumer-ledger.test.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"213cef210273ef7d759126cfd7793129f6e5c1a3b1ef4515d70581fa9c12c0e4"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/stream-consumer-ledger.test.ts:13 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/stream-store.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/cli/test/stream-consumer-ledger.test.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a7ddc4833e7b6c890838a602947e5eb4719461bb940f6763a6d6601d0786e6"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/stream-consumer-ledger.test.ts:14 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/classifier-lease-manager.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/cli/test/stream-consumer-ledger.test.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaf22fc7e409519156c59e1de11f9267d1a42cdd0c8360df3696c4c741952949"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/stream-consumer-ledger.test.ts:15 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/classification-attempts.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/cli/test/stream-consumer-ledger.test.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"edbbaae69cdb2a874d12f2b2a5b71c77d4865aba3f82f06512ade3e30bd3b464"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/stream-consumer-ledger.test.ts:16 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/project-classifier.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/cli/test/stream-consumer-ledger.test.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ff2907f2eefae47e65d31ff1978b600032b94ddcdb6c35498838c5728c9b0a"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/stream-consumer-ledger.test.ts:17 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/classification-sources.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/cli/test/stream-consumer-ledger.test.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde3207f479736c5a01690e1e462f62227489d4e993e66d1e52f5c131148c682"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/stream-consumer-ledger.test.ts:18 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/routes/projects.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/cli/test/stream-consumer-ledger.test.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"0abba307c2a40f2fcc6d6500b4148e2a0150ccea21d526573f197d0529f214c1"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/stream-consumer-ledger.test.ts:19 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/routes/queue.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/cli/test/stream-consumer-ledger.test.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"484a06102d28255a0e9e49fac7c3b5cb9f96ef1d549986894cd82efe8488b16a"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/stream-consumer-ledger.test.ts:20 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/queue-repository.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/cli/test/stream-consumer-ledger.test.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c4e2d496d04a1e020dc3cd91644b12e5cf24ae51f56a1245aab601e7fd57af"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/team-permission-parser.test.ts:10 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/adapters/kernel-authority.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/cli/test/team-permission-parser.test.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"e15b81f77e9a19e3a2c9174b2ea5d72a43d6f12b8939f6f0223e1bba0c08348b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/telemetry.test.ts:5 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/routes/telemetry.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/cli/test/telemetry.test.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"770901738ced5a37eb8ad294051bca5872b21ddbbf562d9788a0ee4eedf5d1a0"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/telemetry.test.ts:6 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/migrations/003_events.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/cli/test/telemetry.test.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"7178f080a3f5509218a5fd6028cb551058feb37a4057385e9dc78d2eaf42fbae"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/terminal-open-budget.test.ts:12 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/terminal/herdr-adapter.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/cli/test/terminal-open-budget.test.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"259521494f476db40067e52f544b3b8d788f1d576be0b8003e2c5495321e6b9a"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/terminal-open-budget.test.ts:13 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/terminal/herdr-transport.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/cli/test/terminal-open-budget.test.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b02c65787b80ec35cf880eabb91f48586e1673c3b0ded2f3ae3043618d194c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/terminal-open-budget.test.ts:14 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/terminal/view-composer.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/cli/test/terminal-open-budget.test.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"79801526c15b3e0bc4309903147d69795c84221688b62bfdbbe54b3f8ecbfbf6"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/terminal-open-budget.test.ts:15 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/routes/terminal.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/cli/test/terminal-open-budget.test.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"996df9f7a2a27d05e40dd92a37eb185cbfd6e03e18c866111e6e0d9f4f2ae751"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/terminal-window-kernel-preview.test.ts:7 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../tui/src/daemon-client.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/cli/test/terminal-window-kernel-preview.test.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"189e0ffedf3e01e4e7bf5d24533686bda98a0d764d18dd1063204753ee91dc36"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/terminal-window-kernel-preview.test.ts:8 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/routes/terminal.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/cli/test/terminal-window-kernel-preview.test.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"71afe09d8a227c235b13781858fe409bed0722ba5d30ebc0d14a318772c3a2cf"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/terminal-window-kernel-preview.test.ts:9 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/terminal/terminal-service.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/cli/test/terminal-window-kernel-preview.test.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"94cb961d92d356a80c436e7bb357c6b67c4d8ab9eb74be6e08492adb1d3c0f86"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/terminal-window-reuse.test.ts:5 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/terminal/view-composer.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/cli/test/terminal-window-reuse.test.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"566e3a5f47a2b2d79a4f5ef7390c0f08164b641c24f9896b88ef17cdebd2355d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/terminal-window-tmux.test.ts:9 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/terminal/view-composer.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/cli/test/terminal-window-tmux.test.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"3415405222fe06f99d69aec6417a578fa4fc2ff4ff5625c44d99c6f324d6cb02"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/terminal-window-tui-preview.test.ts:17 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../tui/src/daemon-client.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/cli/test/terminal-window-tui-preview.test.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2035314b0e21a469de70f336474d2af75aa2edaa003cba97bd20a77b170962f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/terminal-window-tui-preview.test.ts:18 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/routes/terminal.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/cli/test/terminal-window-tui-preview.test.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f756218c73c836871638a0f548b27ea21412c07b7fbe68cc10249a731d45f52"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/terminal-window-tui-preview.test.ts:19 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/terminal/terminal-service.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/cli/test/terminal-window-tui-preview.test.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfce7e3c48356ae99a1b5524e3db22d6915ec0be48e3561762c4ba9bd61c1495"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/terminal-window-tui-preview.test.ts:20 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/terminal/herdr-adapter.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/cli/test/terminal-window-tui-preview.test.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"930d3097f10187eb2892abf17f947846a40c7276bbf44d6b639fa1dcb4322fb7"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/terminal-window.test.ts:5 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/terminal/view-composer.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/cli/test/terminal-window.test.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b28d31abcc392a836294ed051eb5e1fe173e5012608458ff5eb0bd3446d4918"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/tmux-environment-config.test.ts:6 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/user-settings/settings-store.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/cli/test/tmux-environment-config.test.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"f084f819fd9bb7f98e347b20386366a9a0e1f0bda65516e23ceef7618c2899a6"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/tmux-server-record.test.ts:6 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/tmux-server-selection.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/cli/test/tmux-server-record.test.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"801da3bfd75527e89959c1fc3ae3cf1e9d0261a017925a513e33017a64d557b8"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/transcript-startup-config.test.ts:10 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/user-settings/settings-store.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/cli/test/transcript-startup-config.test.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc085c7fe26c3b3681b04a87d0e67dbea348905dc7fa8b2910f0c811d232088e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/transcript-startup-config.test.ts:11 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/transcript-rotation.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/cli/test/transcript-startup-config.test.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"d270b086d1bdefb35ff1b972ecf358a075f5bd98ed90ea07458498f57f2ce0a9"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/tui-timezone.test.ts:6 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/user-settings/settings-store.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/cli/test/tui-timezone.test.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e3743ebdf2784c674f9e3b67f4abb4dfde613e7cfc5c1f96cfe3f8ae0a760b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/up-archive-notice-render.test.ts:9 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/routes/up.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/cli/test/up-archive-notice-render.test.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3e7c61652d4cf8f141c759ac47a137f4a7a9d64d855096e9c4f33da02ec94d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/up-attention-render.test.ts:6 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/routes/up.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/cli/test/up-attention-render.test.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"82adb5831ebfbf615c3c1c833599e9c60324c822718724a7d48887e7c5fff5c8"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/workflow-acceptance-cli.test.ts:8 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/connection.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/cli/test/workflow-acceptance-cli.test.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d0dc04bd6a0dbb201b30f45f2616b74345bfe6d220b65e142685d68005891c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/workflow-acceptance-cli.test.ts:9 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/migrate.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/cli/test/workflow-acceptance-cli.test.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"44fba2bb312a4acc38d1518ee2e84c30fdd65c5e514fd8113bec4e171fe0757c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/workflow-acceptance-cli.test.ts:10 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/all-migrations.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/cli/test/workflow-acceptance-cli.test.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa95b0b80ec2b253a12b458145cbbbf2c355a45ffa660e4f063d39c16fdbed19"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/workflow-acceptance-cli.test.ts:11 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/event-bus.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/cli/test/workflow-acceptance-cli.test.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"27219a5c4d49a619eadb0e97b80e328b7d596ed0d2b0ae725b693b8e70187e06"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/workflow-acceptance-cli.test.ts:12 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/outbox-handler.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/cli/test/workflow-acceptance-cli.test.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"375937fd5e8abc5226dba0458064c805c2dd195fe14c489bbab63c4411b29112"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/workflow-acceptance-cli.test.ts:13 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/queue-repository.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/cli/test/workflow-acceptance-cli.test.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"e35ca6f0d89a9c42b1759232fa9c4e3814bab0fd80b5016f6845661c00aa744b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/workflow-acceptance-cli.test.ts:14 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/workflow-runtime.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/cli/test/workflow-acceptance-cli.test.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d4a7a469829b243e0ad7b24cc2d267b201779ba6f8f0ff6b0cab623ef502f7"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/cli/test/workflow-acceptance-cli.test.ts:15 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/routes/workflow.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/cli/test/workflow-acceptance-cli.test.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"969df2cf2ec71a9a99093e261ac0126bf354cbbbae8c179231eab42409856af2"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: packages/daemon/scripts/probe-health-calibration.mjs:26 reaches into another package with a relative path (../../tui/dist/demo-data.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/scripts/probe-health-calibration.mjs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"301fc0b73de43a4c0e215a1cd0edf9fe23d143cb1a0b2366ac0ea096d3509e2b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: packages/daemon/scripts/probe-health-calibration.mjs:27 reaches into another package with a relative path (../../tui/dist/health/health-model.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/scripts/probe-health-calibration.mjs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed480aeeb749876b92d762230e2af9f72a6647ac2848a8001aa52400c0192d32"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: packages/daemon/scripts/probe-health-calibration.mjs:28 reaches into another package with a relative path (../../tui/dist/render.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/scripts/probe-health-calibration.mjs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e72a4b116662f5d6c033d7c246c23b0a07fd28d1c7e9282ddcdb6fbab9d0d2c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: packages/daemon/scripts/probe-health-calibration.mjs:29 reaches into another package with a relative path (../../tui/dist/state.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/scripts/probe-health-calibration.mjs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"80620031ef2355e15a09a76cf363fbe83777028145c6cea2e1b8e79fb9f270e0"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: packages/daemon/scripts/probe-health-calibration.mjs:30 reaches into another package with a relative path (../../tui/dist/grammar.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/scripts/probe-health-calibration.mjs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e76c46a6ca4f5202bd08d10c0e79bd9cc039ab93a275c40dcdf04a46668e48"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: packages/daemon/scripts/probe-passive-ceremony.mjs:27 reaches into another package with a relative path (../../tui/dist/demo-data.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/scripts/probe-passive-ceremony.mjs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e060d2a38268d2bf3b8255d386da9bc45804bf638bc9e593750cbfde4302e1"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: packages/daemon/scripts/probe-passive-ceremony.mjs:28 reaches into another package with a relative path (../../tui/dist/health/health-model.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/scripts/probe-passive-ceremony.mjs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"4611e0c846608f9098d5926446092b69fbfe19acd0e3285d4ef22764942a08bf"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: packages/daemon/scripts/probe-passive-ceremony.mjs:29 reaches into another package with a relative path (../../tui/dist/render.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/scripts/probe-passive-ceremony.mjs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0cf09e6d49da918ff422dd44e1d646798b14a94abdc18edd8e9bc10528a0781"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: packages/daemon/scripts/probe-passive-ceremony.mjs:30 reaches into another package with a relative path (../../tui/dist/state.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/scripts/probe-passive-ceremony.mjs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d9e4cfc0a11228c54236a64b175a0a2f607c25740e34a6ce053a11811a32393"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: packages/daemon/scripts/probe-passive-ceremony.mjs:31 reaches into another package with a relative path (../../tui/dist/grammar.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/scripts/probe-passive-ceremony.mjs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"52fd25587ed5996bf73d77a588f3250ddb87a3a992f1c0310e530e70ee59a7c4"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: packages/daemon/scripts/run-evals.mjs:27 imports packages/daemon/test/helpers/eval-cases.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/scripts/run-evals.mjs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d15369329c1a2e3a3384e7c37bca341d984faf1327c2d84e688edb51cf18a3"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: packages/daemon/scripts/run-evals.mjs:28 imports packages/daemon/test/helpers/eval-runner.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/scripts/run-evals.mjs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb3cff1de8412c20708f5c799cc5d9646699954ce7da77cfbce58e2f1f93550c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: packages/daemon/scripts/run-evals.mjs:29 imports packages/daemon/test/helpers/eval-provider.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/scripts/run-evals.mjs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51f43522ac30c8b06aeabff6efc0c691b78b9df8369cc8d0562476b0b340a68"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: packages/daemon/scripts/run-evals.mjs:30 imports packages/daemon/test/helpers/eval-rig-provider.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/scripts/run-evals.mjs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"f932651c639738053cda015c8cf0acdf0dcb578700b8aeef47af56fdcd2ff23a"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: packages/daemon/scripts/run-evals.mjs:31 imports packages/daemon/test/helpers/eval-report.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/scripts/run-evals.mjs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"c293a3b0b744f455a75c3836926057a934542f1dc6a2de3018505d7ef935e8e9"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: packages/daemon/scripts/run-evals.mjs:32 imports packages/daemon/test/helpers/eval-ref-resolution.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/scripts/run-evals.mjs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a60fca452cf7c5c07e59213ef8a2d65269c7e6209f6351fa1bada7629715924"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: packages/daemon/scripts/run-evals.mjs:81 imports packages/daemon/test/helpers/eval-rig-runner.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/scripts/run-evals.mjs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e48098c245e0f58ed7d044502566c46c184c826cb4f59e6e88e59a6331a8b2"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/bootstrap-orchestrator.ts:3 imports packages/daemon/src/adapters/non-interruptive.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/bootstrap-orchestrator.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"e223f32f2874bf08d8793bd4dd376e312e494d35eb4c5bffa8fe781d67c278fd"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/bootstrap-orchestrator.ts:27 imports packages/daemon/src/adapters/preflight-exec.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/bootstrap-orchestrator.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac1b54f84eadf34578da0f8485cf831077c1f910ca27aebcfbcd7265a645bfea"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/bootstrap-orchestrator.ts:28 imports packages/daemon/src/adapters/runtime-probe-exec.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/bootstrap-orchestrator.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28e704bf39b7173019b7a27f606c07e3ccd5d07a602b4b5e60c8b94a2522281"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/bundle-install-context.ts:4 imports packages/daemon/src/adapters/shell-quote.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/bundle-install-context.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdfcb8bbe741af070977207c9aa643372cd279e6c4251adc4b6e0f2b49179afb"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/claim-service.ts:1 imports packages/daemon/src/adapters/shell-quote.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/claim-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ff58e7bfe380b13451bbe0295207f14216117406776ad822dec614b2c034c1"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/claim-service.ts:9 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/claim-service.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4bb2c89f71b98486fdba479f293c6ed481aa882dd9dee4e912b141e9bc3d7f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/claude-activity-hooks.ts:2 imports packages/daemon/src/adapters/shell-quote.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/claude-activity-hooks.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd25d959e1a635690a5fe14d41345d8f5a6bf2239cc91e92204013f6a9a9f40"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/claude-managed-launch.ts:10 imports packages/daemon/src/adapters/shell-quote.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/claude-managed-launch.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"4773d5b3bcf9dc22419b8b27625b84ffbff45a00e3a9dca4a292a95531219b37"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/claude-managed-launch.ts:11 imports packages/daemon/src/adapters/yolo-mode.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/claude-managed-launch.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef85cb7fbcbdb4951527f3d2c606159fc2869b28ae044074550155e8045c1738"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/cmux-layout-service.ts:34 imports packages/daemon/src/adapters/cmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/cmux-layout-service.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce1734f103dbb50039d3df0bb654bb1b99984bc96bf0cbab6a610bbc4c0d380"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/cmux-layout-service.ts:35 imports packages/daemon/src/adapters/tmux-server.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/cmux-layout-service.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"d83ec5daf7104d4cbd3e80d2add5df598d17a028ddedb943e8826f37f7a20b6b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/codex-member-permissions.ts:8 imports packages/daemon/src/adapters/shell-quote.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/codex-member-permissions.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1217b5b060b012cd5422a8b79e6b5cdbd9c4dd2f6a56fd4d3b708d1edd8c336"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/codex-network-default.ts:15 imports packages/daemon/src/adapters/shell-quote.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/codex-network-default.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e80899aecf9b1bec822e49ec0ab72f06ab5dc4680ade1580a9305edcbfc69e0"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/codex-rebuild-permissions.ts:7 imports packages/daemon/src/adapters/shell-quote.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/codex-rebuild-permissions.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"dea989eff66b23984d2d8a6751538f28d1d6cf1bdb7d92b6705ba55ddc4659a8"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/codex-team-workspace.ts:4 imports packages/daemon/src/adapters/shell-quote.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/codex-team-workspace.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ca61d754184c20cc5cc36d6241edb6846d893776ea4eee16cb0f4f13d9e795"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/compaction-restore-notice.ts:10 imports packages/daemon/src/adapters/shell-quote.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/compaction-restore-notice.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"79e65db3183ef24a3e6674ad0d6f2905fb445e5b47329b910d9729a278637ce1"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/environment-lifecycle.ts:5 imports packages/daemon/src/adapters/openshell-podman-observer.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/environment-lifecycle.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c0a4745e91ce2aeb8823245ea9d6a8cc36612f3258e99324626bddc1b62f9db"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/environment-startup.ts:6 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/environment-startup.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1511fff6a40a3d3346763e2c099c4f5e3755f0ead7d0a6ce643b06afdf526a"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/environment-startup.ts:7 imports packages/daemon/src/adapters/shell-quote.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/environment-startup.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"d757557a494ca7d4b7e5480788fda328c528906dfb12ca428bec0e7e8ccca42c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/environment-startup.ts:10 imports packages/daemon/src/adapters/openshell-driver.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/environment-startup.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"c78bb3de2335c4887e3701bd7d7c2a48c30539ea38204ae6857f6ecd11d9292d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/execution-view.ts:42 imports packages/daemon/src/adapters/shell-quote.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/execution-view.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f65addb9d76a7001631389f61d39c505c9a21c3007efd9d89c6f1c71e159023"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/expected-conversation.ts:4 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/expected-conversation.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d084171b31480f3ab1ef967cc745407a21c445ab5bb19226147e43d406a1235"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/external-install-executor.ts:3 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/external-install-executor.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"5179b2a2b82937e0ee33aa019dd76757d130e08b37c39a1846d200862b1fb42e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/external-install-planner.ts:2 imports packages/daemon/src/adapters/shell-quote.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/external-install-planner.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"c059ba0d195a36afdf7f2c20a13025132e3a7e8fb5a1eb37cebaf10e8dffaed1"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/gateway/operator-delivery-engine.ts:30 imports packages/daemon/src/adapters/shell-quote.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/gateway/operator-delivery-engine.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb842368cb000af7f38aff868dc0b5bd60a99e31c91fd826bb3fe98d8850a3e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/kernel-hook-review.ts:2 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/kernel-hook-review.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9638ded8cec9702b3342e76bfb5d0d3bfdbac8846ab8bd6be82295cd86ecff9"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/model-divergence/current-generation-record.ts:9 imports packages/daemon/src/adapters/pi-runner-protocol.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/model-divergence/current-generation-record.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4df7b25d4cfa12da5e57c3525b3484f04e836154fa453f41dcb36391499df31"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/model-divergence/effective-model-readers.ts:23 imports packages/daemon/src/adapters/pi-readiness.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/model-divergence/effective-model-readers.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"6efe99ab726c945d3e201a663b8635353046a2564c58879553d661544960ead0"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/native-resume-probe-evidence.ts:2 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/native-resume-probe-evidence.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd38f7f594138cd9bf0933b5b2b3c26d11adb85f0cb55a37c1a1ddf4993b317f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/native-resume-probe.ts:2 imports packages/daemon/src/adapters/shell-quote.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/native-resume-probe.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"134a00f50b1585f5c10f7acf465763c5d778b5c43c95d21e1eb3cdcc5e5b3889"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/native-resume-probe.ts:3 imports packages/daemon/src/adapters/yolo-mode.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/native-resume-probe.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"beeccf42331466e7114c788393379f5bc3a55ea548cd1f8b63a8ebf95e38cb4d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/native-resume-probe.ts:4 imports packages/daemon/src/adapters/kernel-authority.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/native-resume-probe.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"13168f2833211b6761dee680099b7db3b1c576fb85755e94eb4c22c6e706abff"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/node-cmux-service.ts:3 imports packages/daemon/src/adapters/cmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/node-cmux-service.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4301afdabe870c4d24cf8da036d24378a4d4b54405147671c74fd7a9f03b869"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/node-cmux-service.ts:4 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/node-cmux-service.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a63e7f7fd30d89b21fd781b6c21d290a87d10a55294f67c5aeea209485e8104"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/node-cmux-service.ts:5 imports packages/daemon/src/adapters/tmux-server.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/node-cmux-service.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba32bda734313403889b2301f468b015324d881e943b89192116efee3ba9a082"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/node-inventory.ts:22 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/node-inventory.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"77419b3133ae5c5783ba7a8d792ddcaed472b0aa6f30e83801d3acde8f382beb"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/node-inventory.ts:43 imports packages/daemon/src/adapters/tmux-server.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/node-inventory.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"c129adb31448130facdce0154a848d390046ace2a8759d70f9d8e31571368186"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/node-inventory.ts:49 imports packages/daemon/src/adapters/shell-quote.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/node-inventory.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"498936b6e18d28f04f6bcbe2f9d83f85df8f626aa6e4a2698ce141cf7f709489"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/node-launcher.ts:5 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/node-launcher.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b0c92a52332666ccc296ce51156668069670d5b2e5318682084f29bdaf9362"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/node-launcher.ts:29 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/node-launcher.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7b1bcd6ccdedcf698421df569bc253a2f22f9f5aca6ab538a489811acb31f6"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/node-launcher.ts:32 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/node-launcher.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"91dcabe719dc99492936237394484ee2dc8ce8fbc6240b8679f9fc11a524fde4"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/node-launcher.ts:67 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/node-launcher.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"f42a7c30e08d79cd4827fcfbcbe5e4cae28e9e5342aa93bcc0f617a8c242399a"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/node-launcher.ts:410 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/node-launcher.ts"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f80907425ff910f5523db62a9a6857a056e981a72bb06205fac21be6bcd621e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/node-launcher.ts:411 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/node-launcher.ts"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"edfb99b02b7fc3462f9a4826af0108c32557fe8d33af987c188f432863f21778"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/pane-binding-observation.ts:2 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/pane-binding-observation.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c1c0490012a0682dd21b8b5660756f079fe796561c81676173f44299ea0b81"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/pane-cutover.ts:1 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/pane-cutover.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"509bc1d10847c7d89e6f621b3bd4398cf3d69e1c271a04f1c70577470222aee5"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/permission-account.ts:6 imports packages/daemon/src/adapters/yolo-mode.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/permission-account.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1ce70870b3396aae098e184c4099d3ea4a05dc9f6168198b31b3932c2b7edc"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/permission-account.ts:8 imports packages/daemon/src/adapters/kernel-authority.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/permission-account.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a337c7419cce256bdfdae7e579fc0648097ef0c24ccc332804c05bfc1b1b7fa"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/pi-compaction-service.ts:2 imports packages/daemon/src/adapters/pi-runner-protocol.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/pi-compaction-service.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d55150ed59301b94a96c5f571655c5e34372f886be737d3305e455be41d8b97"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/provider/claude-seat-switch.ts:1 imports packages/daemon/src/adapters/shell-quote.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/provider/claude-seat-switch.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02adbbd0814975f7996c954d066d3d00f0b079a5a1da6aa107cc00805728bfe9"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/queue-wake-ladder.ts:2 imports packages/daemon/src/adapters/tmux-server.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/queue-wake-ladder.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"d750d871acac43ed185168995a39b9cffed5b64f7669bbfb8ccf1e1494c42583"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/reconciler.ts:4 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/reconciler.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dfd597211f8f690e28da5013d4758341e5c5262d956b57c03cb8020706eea05"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/requirements-probe.ts:1 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/requirements-probe.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"148adc42c4a141ffe35bf02f70ef7b4a8b10a1f722a186d50d7967bdb8dc142a"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/requirements-probe.ts:2 imports packages/daemon/src/adapters/shell-quote.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/requirements-probe.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2e29969c4b80c2a5fad34e50fe59b883c63dc68091322ec5ff996e99a9dc33"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/restore-orchestrator.ts:9 imports packages/daemon/src/adapters/non-interruptive.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b3967bdd206c9e88f52258c4214cdcf320a6aa4c13508ccde8f1c2fc8be829b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/restore-orchestrator.ts:10 imports packages/daemon/src/adapters/yolo-mode.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"196045cd3b3f510c87dc52a7eb33611ce62e05e9c9dd972f219778f281fba16b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/restore-orchestrator.ts:28 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9865cc1f8a1b90d2d5d15a959e77556b6353b7ec0d353f7876b97e9e8e0822"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/restore-orchestrator.ts:29 imports packages/daemon/src/adapters/claude-resume.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d829278c1fe66b38befed51ed65106399ec3ad7241ff627d87f35aa123b1de"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/restore-orchestrator.ts:30 imports packages/daemon/src/adapters/codex-resume.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"b811f67717e70849bb2737aaac9ca3db558499a1b5a3a614f371f78ffc73708c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/restore-orchestrator.ts:33 imports packages/daemon/src/adapters/pi-resume.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad158aea34f3b5b4cf3b15304e0fb9458d3d4d8e2d17ea5e963d1b733d3e4445"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/restore-orchestrator.ts:34 imports packages/daemon/src/adapters/omp-resume.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c44abc52aa373f9e9fd113f5e26a7c06b246d167eaf439660c3aadf68c032b5"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/restore-orchestrator.ts:113 imports packages/daemon/src/adapters/community-harness-runtime-adapter.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec195ad875a3bd4d6f4a828ba892061289053f416d9fd77592dcdc2c5ed7776c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/restore-orchestrator.ts:268 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd16cb1c95ac970f460f9a3307e2bf0997b022e292f64fc35dfad2e48ae397ee"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/restore-orchestrator.ts:274 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"920027e301e1bb893a1aabb666be8298ea4e042598d0966f38b765e4fdedbba7"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/restore-orchestrator.ts:1914 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":1914}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4079860af048e1336a9d2ee91600dd7a42e9c026ec4be889ddbb160e43cfec9"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/resume-metadata-refresher.ts:2 imports packages/daemon/src/adapters/shell-quote.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/resume-metadata-refresher.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee63becae962ad13a8791fd5ed1e93b7251631c290ec98a8d62e85d778da535"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/resume-metadata-refresher.ts:6 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/resume-metadata-refresher.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf664103d0d6f37fc4b90d56c2351effb0c1f9ac72b6294ad68796d71bce7f1"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/rig-lifecycle-service.ts:6 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/rig-lifecycle-service.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"6527081360b854ff091788da9628e9334625789f8f64b9a1a49b8adc9f7d996e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/rig-teardown.ts:4 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/rig-teardown.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d05b83eb220e9bdd3b69995233f152d956786e96fed644a0e634ec9e78ba64"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/rigspec-instantiator.ts:42 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"b491046f1eb9b57f350a55b5fc49050183f3a255d75accc6518198b2b6bcc4dd"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/rigspec-instantiator.ts:52 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa014828ce19087796a84fbef93e1a981e98f0a91e1055c1a44614c9d7e14bc0"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/rigspec-instantiator.ts:343 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"8284842495550e80b1d00ae8d18caa16b449e18e8227a42e8a1c58a39972397e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/rigspec-preflight.ts:4 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/rigspec-preflight.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d42d593a6dd6cbe7036d9fc209eb93f2c0043b590db354f49310c4024898e8"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/rigspec-preflight.ts:5 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/rigspec-preflight.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f9579e225f2476c56420019f7d91ed56d32affc238b82568da4f6d16d16f1fa"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/rigspec-preflight.ts:6 imports packages/daemon/src/adapters/preflight-exec.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/rigspec-preflight.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"58be189caf537e42b0689c17c5b2256bffd7514e2d1f725dcc30928ffc97640b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/rigspec-preflight.ts:7 imports packages/daemon/src/adapters/pi-readiness.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/rigspec-preflight.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac2ca70f8e96a9edd456edf6c05c9300d52dbc89058f5a7b05f8f91507d6eaa3"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/rigspec-preflight.ts:11 imports packages/daemon/src/adapters/shell-quote.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/rigspec-preflight.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b77f8314f540cf96fdc429fe8f34a9a2ece4f8939a02c88d4e1b18bb92d0f0"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/runner-grant-launch.ts:2 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/runner-grant-launch.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf5a6ca8af4775e525895020198dfb274f09a3abd03562c13f7a8f6efcc605b1"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/runner-grant-launch.ts:3 imports packages/daemon/src/adapters/shell-quote.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/runner-grant-launch.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9604885da77865aead26d72082a42a455e1bd535fd5132369cc8e2759fbdb02"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/running-name-guard.ts:2 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/running-name-guard.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a95dd45405e09c819aaab972b75f157c55318f7c804f53ed09b09a949be15d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/runtime-verifier.ts:3 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/runtime-verifier.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"f72ae82fc41c665b94102a29cc99b3857b1d3c7d4f19843883355700762388da"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/runtime-verifier.ts:4 imports packages/daemon/src/adapters/bounded-probe-exec.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/runtime-verifier.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f5359f28796c1e487bde6c5d205a091581e58ee38c56cca94651c05be155aca"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/seat-activity-service.ts:2 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-activity-service.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"022b48e4db4ce2b97a1865d9fb76989ec1a76216e9192869777a6cc6798b9767"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/seat-attention-reconciler.ts:9 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-attention-reconciler.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d5800779ef46a858a9ca8be4cafcf4c8f80bcf078123a366b59e1376f9b443"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/seat-effort.ts:4 imports packages/daemon/src/adapters/pi-runner-protocol.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-effort.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d6e0337695d155d7bcc8b921ce68541d54b1457e67bda7afdb1029a77c8033"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/seat-handover-service.ts:14 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4cb4bc7ea8b45aee6c8a5324f5ec21c009fca12bb45d8fe258b7c81c714616b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/seat-handover-service.ts:15 imports packages/daemon/src/adapters/shell-quote.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e6e05f08a869213544c16458f0ae89012034d9d805a8f9b72a507962cfb999"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/seat-handover-service.ts:179 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"328910114cee215bb552a4fc22cb61aa668d1989878e17981c10180669e39c29"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/seat-handover-service.ts:193 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a157b592dd69418eb79211aac17adaaa109ada4796ff0026cae4d985651e40"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/seat-handover-service.ts:197 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ad9e152d059299068db97defa7d3c06c3711e467b1dcd7a4d21c81138d0738"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/seat-handover-service.ts:1378 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":1378}}}],"partialFingerprints":{"codehealthFindingId/v1":"33fb70df9a2719311e4385434cb50bca1a033ac8e2418c0d2b656d6af485ec3b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/seat-identity-reconciler.ts:1 imports packages/daemon/src/adapters/pi-runner-protocol.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-identity-reconciler.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58fbcc6e62064b894355e6bc756edd604c89a25e30f6bfd6bccb014622778a5a"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/seat-identity-reconciler.ts:10 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-identity-reconciler.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"a04dacc65b273efbd116fcdc9db6485398f2b0263af7caebc71795a3c9a1b657"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/seat-launch-environment.ts:6 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-launch-environment.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3f53d112404fe0e6d52a14de6a2313bd4b729ba3431df723578c610fb1f974"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/seat-launch-environment.ts:7 imports packages/daemon/src/adapters/shell-quote.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-launch-environment.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"4486648020967fcf980a80ef184ed21c55d8a1e22537c8c71fb44480d2ea4e25"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/seat-lifecycle-service.ts:12 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2dc607390c0a5f6967b3cb97bd5b7d39d4a5f1694ff600039092ac8b7c82b35"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/seat-lifecycle-service.ts:14 imports packages/daemon/src/adapters/shell-quote.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e4261a70986a1e2b4ad30d51ba956d265816989da0c5f7421ef78c6a1d6e0ee"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/seat-lifecycle-service.ts:15 imports packages/daemon/src/adapters/pi-runner-protocol.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e24ef135236cfdb823fc5e89f0c5f185f3734d04f07596f8f2f334d3d89d26"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/seat-lifecycle-service.ts:55 imports packages/daemon/src/adapters/community-harness-runtime-adapter.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"a82f6df910fc476cbdeb00985e09ce66867b6aeab44d8895f0105e400fca182b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/seat-restart-in-place.ts:6 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-restart-in-place.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"028a8d61047be92c73cdbba4ce5e25dc93c4200b16816408cde9eb6916d7d8cd"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/seat-restart-in-place.ts:20 imports packages/daemon/src/adapters/codex-runtime-adapter.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-restart-in-place.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"509a6c9479a2bb63798565484b73966d460ad7e6277044555976949e100fce4d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/seat-runtime-switch-service.ts:4 imports packages/daemon/src/adapters/pi-runner-protocol.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-runtime-switch-service.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8205c98cc1a78c40aeac5e90a0a637815bdcd919a395d5a8f91fed1d497ac7"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/seat-runtime-switch-service.ts:18 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-runtime-switch-service.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb60b332421b0b9690200d4c5080e3618ab03cf46597d0dde0b6559c6b75c79"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/seat-runtime-switch-service.ts:116 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-runtime-switch-service.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"3627b09b9317a20ce8021d9cf2e22502200f0374a37b9073c748bf8c32494496"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/seat-runtime-switch-service.ts:141 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-runtime-switch-service.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"b78bf1517bd39fa20be9bcbee6e7136babeaa0a265b0638e2c8eec2310167803"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/seat-runtime-switch-service.ts:425 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-runtime-switch-service.ts"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fab05f3fba1ed78fdd04bdd29a1cc8298facec89a2fd8105792e03d89eb9f84"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/seat-structural-activity-service.ts:2 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-structural-activity-service.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea8ba0a8462ae092405332a596dc3da1bc25e5bec9c3158e0b9242353d9b697"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/seat-switch-client-service.ts:2 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-switch-client-service.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ad0a949e1417c13160525aeb3f8f3be430f4dbcf2401ae4a2a9b79a208763a"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/seat-switch-client-service.ts:4 imports packages/daemon/src/adapters/tmux-server.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-switch-client-service.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef3a01a266d08844692e9539ca1a5eae39b619b30e8d71412ce3bf153aa7ed8c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/self-attach-service.ts:7 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/self-attach-service.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd1c978be30bcf1f7e6cec9805a9555525b2f0d85bddb4925d1f3a6fb0ab1a7"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/service-orchestrator.ts:2 imports packages/daemon/src/adapters/compose-services-adapter.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/service-orchestrator.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a3ef954fea0de58c5566e21308d47ffb199c8ee315d70ce8af2224b9cffddb"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/services-readiness.ts:1 imports packages/daemon/src/adapters/compose-services-adapter.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/services-readiness.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e22f74858460ca4ec15253b197d376a78b022821136aaf37e846376920f6f0"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/session-fingerprinter.ts:1 imports packages/daemon/src/adapters/cmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/session-fingerprinter.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"397ade00b0e0b90ec5cda669cccae91620a1f00c39289182b0f56594612e1567"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/session-fingerprinter.ts:2 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/session-fingerprinter.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e4cc7fb85073a438621536b38aa3ce5d56236edb46ded718ca22da531442df9"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/session-transport.ts:41 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/session-transport.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"208e182ebc76bc20034b3aef7b82e8aad5d9ab3192a70ce3f62c7a4b4e37baa7"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/startup-orchestrator.ts:2 imports packages/daemon/src/adapters/non-interruptive.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/startup-orchestrator.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"02fe532fc0501c022b850379a5979cf791bce0b36ad75cc646974f075f2c7638"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/startup-orchestrator.ts:3 imports packages/daemon/src/adapters/yolo-mode.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/startup-orchestrator.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8c087c73b1f91568ab606ea30fb39aa68a395c16e707e4008c3d8d6681d8f0"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/startup-orchestrator.ts:8 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/startup-orchestrator.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b0935d1cc6f568c94541d291b6c45133eba63316bd80b8903f86cea84de08c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/startup-orchestrator.ts:9 imports packages/daemon/src/adapters/claude-resume.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/startup-orchestrator.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"598e1d6253c4506f8fe75f78deb832a9d3686b6a602c169d51ab2d563159878e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/startup-orchestrator.ts:29 imports packages/daemon/src/adapters/shell-quote.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/startup-orchestrator.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8a6f93cebe02c6c87c0539cb86bec5c0972a18d63a0312b574bd69a776044d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/startup-orchestrator.ts:31 imports packages/daemon/src/adapters/community-harness-runtime-adapter.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/startup-orchestrator.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9ac3db5376edd384a81d89a695890da64c5ca04506327f84052b1f671260b7"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/startup-orchestrator.ts:32 imports packages/daemon/src/adapters/pi-community-runtime-adapter.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/startup-orchestrator.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5064505fb93040d67f451d231b5557dd5a373654d12063c55e38f8376bd85e0"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/successor-session-launcher.ts:5 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/successor-session-launcher.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"627f05010d68ddbdd91d9ab765163501dce0509604123d747d30b20c2e5aba54"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/successor-session-launcher.ts:117 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/successor-session-launcher.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"5425898dc95b4b139c07b92fcd651c4a1a5d74811753dcbd19a1c2a5ff09617f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/successor-session-launcher.ts:140 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/successor-session-launcher.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"d292e2d335524b24e2351a3b9efdb4e85826ff0a128a41e63d90a2b7c12992bc"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/successor-session-launcher.ts:397 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/successor-session-launcher.ts"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f26e9c17c6e2169780cd9789b376bd7900dfcf941e449d75f9db97e27b57f8"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/successor-session-launcher.ts:400 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/successor-session-launcher.ts"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"f036e079624a9663481cb640164a096c2025512f353e7ff6c9f148c3372661d8"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/successor-session-launcher.ts:414 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/successor-session-launcher.ts"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2dc74f79211097e0f3a22024dd1dca940fab132dda6e8079d9139f49d18e976"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/terminal/cmux-provider-adapter.ts:18 imports packages/daemon/src/adapters/cmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/terminal/cmux-provider-adapter.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"536a0cc4c98f82fbf130f52c5084fc0ea1828dd5fc9942a843a09b81fdc60ea5"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/terminal/herdr-sessions.ts:7 imports packages/daemon/src/adapters/tmux-exec.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/terminal/herdr-sessions.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e920062c254d796f53443cbe98f0bbf8074a4a68396734f215add884b06b5a2"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/terminal/herdr-viewer.ts:7 imports packages/daemon/src/adapters/tmux-exec.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/terminal/herdr-viewer.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f242fb39301bb2e463b27c483023882bb58f0ffde4009e09341421d97f69411"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/terminal/herdr-viewer.ts:10 imports packages/daemon/src/adapters/shell-quote.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/terminal/herdr-viewer.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2a8090bb3b464c15bf8852541355399f095e3dd971bb0b72bd7a16d083bfff"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/terminal/rex-transport.ts:5 imports packages/daemon/src/adapters/tmux-exec.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/terminal/rex-transport.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac33d505ed86c0471c84fe9d3c3392e15ffe4eb6b8092ab914e99d70dd09288"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/terminal/terminal-service.ts:3 imports packages/daemon/src/adapters/shell-quote.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/terminal/terminal-service.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32c0eaf8ddf50803525773f1d5d1eeed89d131b752d207a22cbde86da0784f9"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/terminal/terminal-service.ts:47 imports packages/daemon/src/adapters/tmux-server.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/terminal/terminal-service.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b2f538b9c9ceb3c6acbb07c7949f652a99bc9e7ca07bda0b9cd9da69318fe6"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/tmux-discovery-scanner.ts:1 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/tmux-discovery-scanner.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"115a6dbcb6b3149f8d80cdb127bb556463b558f7c60c65100f3261bc4b80513a"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/tmux-option-defaults.ts:2 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/tmux-option-defaults.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4de41c855a80d93d99178e07c3def2b4f6119db809ab9aa7619db0630e6c392"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/tmux-server-selection.ts:4 imports packages/daemon/src/adapters/tmux-exec.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/tmux-server-selection.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"c47e6a65c429f6bc94230eb6b27532c3956d6f006ab03a1213eef0d972cbc360"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/tmux-server-selection.ts:5 imports packages/daemon/src/adapters/tmux-server.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/tmux-server-selection.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4fa098d0350248bcdc20f3e9156a084fe7704e6d6ae76e85ffd00e17cd00cb"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/transcript-capture.ts:2 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/transcript-capture.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"a258a59f93dafe703efb4836fd2f16a2620808796dc62824d2053b6e29218c66"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/transcript-rotation.ts:18 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/transcript-rotation.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"6864dfbbab3ab122f4f9023530194ed3405998f137b28c52a6cc4518653f573b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/types.ts:658 imports packages/daemon/src/adapters/tmux.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/types.ts"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"4569d0a65097240b6e540d3ab66955446cca02f98d2c554b31d9e2bdaac58cc8"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/workflow-guidance.ts:1 imports packages/daemon/src/adapters/shell-quote.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/workflow-guidance.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"151cdc435834a3ed7ce32032fb54c93a52d01a15620037444af05dbc39e03a97"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/workflow-projector.ts:58 imports packages/daemon/src/adapters/shell-quote.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/workflow-projector.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e4ee6b2f9e8a418ea7af056d5c67f784f64b8dbc119689e74e6fc5086ac09b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [layered:upward-import]: packages/daemon/src/domain/workflow-reconciliation.ts:10 imports packages/daemon/src/adapters/shell-quote.ts against the layered-src rules."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/workflow-reconciliation.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"959d6eaf273785e8482a48eb2cb6932d8c8c412522870853f9ad5d2c48df329c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/daemon/test/attention.test.ts:163 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../tui/src/attention/source-continuity.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/daemon/test/attention.test.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a3d8c5c3eba988d7574e3bdaa4ce62f6ac280e7d29830e382b227c869fd9d3"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/daemon/test/attention.test.ts:164 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../tui/src/attention/attention-model.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/daemon/test/attention.test.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d52ccce5db462b5f1f49165fef29d201d5e29c149e7d9a6d1ea9538cc41aaff"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/daemon/test/attention.test.ts:165 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../tui/src/state.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/daemon/test/attention.test.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ad0b597a97a88bffa690560edab196f30e386f0bb6625c9f4a587b6d3cdb5d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/daemon/test/attention.test.ts:196 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../tui/src/attention/source-continuity.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/daemon/test/attention.test.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"442e77ae11d8d1e54a6d38b9113cb4cfbd6ad003634e2b83c04c42e94265b44d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/daemon/test/attention.test.ts:197 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../tui/src/attention/attention-model.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/daemon/test/attention.test.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"f28046f6ac25847f8f3ed918a9409212feb04b210f58596d86331bf44d046159"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/daemon/test/attention.test.ts:198 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../tui/src/state.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/daemon/test/attention.test.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e487bb563634789cfc00053d4fd8f55edf6da6c570a2f1641eee0c7b062cb7"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/daemon/test/browser-boundary-listener.test.ts:16 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../tui/src/daemon-client.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/daemon/test/browser-boundary-listener.test.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"72198c8f614c5b1978e19a72d24653a56b97ced0e7e52dcfb83394c22a142dd6"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/daemon/test/node-attention-consumers.test.ts:12 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../tui/src/daemon-client.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/daemon/test/node-attention-consumers.test.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"339768532ae39c3bc5c3ba1f48fb0409dd136b814a4066384d8d241daefaee15"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/daemon/test/node-attention-consumers.test.ts:13 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../tui/src/hydrate.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/daemon/test/node-attention-consumers.test.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5b65195467a07b4a8db6a52c00e46cdc1ddfcfa44a44f52745495e1263b004"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/daemon/test/provider-claude-token-usage.test.ts:17 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../tui/src/usage/usage-model.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/daemon/test/provider-claude-token-usage.test.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca84f760a371659ebe4ee0b48fb3eb697672d3064442175a57c93ef54a8ba92c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/daemon/test/steering-only-asks.test.ts:346 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../tui/src/daemon-client.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/daemon/test/steering-only-asks.test.ts"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"c978eee5fc22d6080de7771624709cfe34e923ba70075b24e9ae5266610403ad"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/daemon/test/steering-only-asks.test.ts:347 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../tui/src/attention/attention-model.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/daemon/test/steering-only-asks.test.ts"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea5547f6affe33e7ef382cc0af61b4e4654a18e4ba8ac1e7a4ecb13b43fa6b0"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/daemon/test/steering-only-asks.test.ts:348 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../tui/src/state.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/daemon/test/steering-only-asks.test.ts"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a5f121caf754f6f9899d884cadc5f7deea41bb9b80a320758d0da1c2111d53d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:undeclared-workspace-dep]: packages/tui/src/connected-assistants.ts:1 imports @openrig/daemon/connection-contract, a package this repository publishes, but this package\u0027s own package.json does not list it in dependencies (or peer/optional dependencies) \u2014 it resolves only through the workspace link, so an installed copy of this package is missing it. Add it to this package\u0027s dependencies."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/tui/src/connected-assistants.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e10b957a49e3a79b4a14efbe4475626226b379bc62d5dbf5ef1a52d26c4e1ba8"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:undeclared-workspace-dep]: packages/tui/src/main.ts:2 imports @openrig/daemon/daemon-shutdown, a package this repository publishes, but this package\u0027s own package.json does not list it in dependencies (or peer/optional dependencies) \u2014 it resolves only through the workspace link, so an installed copy of this package is missing it. Add it to this package\u0027s dependencies."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/tui/src/main.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cad6ff231b4f579abef064a237750b938843bb1ebbed3a907adb68f1e07ad04"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:undeclared-workspace-dep]: packages/tui/src/pulse/pulse-model.ts:2 imports @openrig/daemon/attention, a package this repository publishes, but this package\u0027s own package.json does not list it in dependencies (or peer/optional dependencies) \u2014 it resolves only through the workspace link, so an installed copy of this package is missing it. Add it to this package\u0027s dependencies."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/tui/src/pulse/pulse-model.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b9a8e03e5a2da0aa2a15545419015486a93334d325fb5c6e27c3059d1a9dd1"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:undeclared-workspace-dep]: packages/tui/src/types.ts:111 imports @openrig/daemon/connection-contract, a package this repository publishes, but this package\u0027s own package.json does not list it in dependencies (or peer/optional dependencies) \u2014 it resolves only through the workspace link, so an installed copy of this package is missing it. Add it to this package\u0027s dependencies."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/tui/src/types.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee6d47a179b28b92f799e149fc871b9d1c59fc86f48e91b857bf3a2c9417b76"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:undeclared-workspace-dep]: packages/tui/src/types.ts:319 imports @openrig/daemon/health-projection, a package this repository publishes, but this package\u0027s own package.json does not list it in dependencies (or peer/optional dependencies) \u2014 it resolves only through the workspace link, so an installed copy of this package is missing it. Add it to this package\u0027s dependencies."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/tui/src/types.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b1660f3551e36edcebc4382a6631e80246511d00ec9d165086bc1bb049c925"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:undeclared-workspace-dep]: packages/tui/src/types.ts:414 imports @openrig/daemon/attention, a package this repository publishes, but this package\u0027s own package.json does not list it in dependencies (or peer/optional dependencies) \u2014 it resolves only through the workspace link, so an installed copy of this package is missing it. Add it to this package\u0027s dependencies."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/tui/src/types.ts"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"68190db5341f2ed94c54dbf7b50c9be1beb73ac40a63613661ea81d4202f381f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/action-auth.test.ts:11 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/migrate.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/tui/test/action-auth.test.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf0bd0926350303ac0162a301a97cbd4143a528dac69480258db3c944b1a8c9"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/action-auth.test.ts:12 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/all-migrations.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/tui/test/action-auth.test.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b2291d18813edb617eacb559cc7b64c6fa4b59aae1860ba0016925a50a373f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/action-auth.test.ts:13 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/event-bus.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/tui/test/action-auth.test.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c2ccf4eae39fad4757315890f0c45136574fe733cf48413ffbeb99a7378555"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/action-auth.test.ts:14 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/queue-repository.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/tui/test/action-auth.test.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee260edbbf9dc16280bfb8f84bb16235a5b3d4b6dfb7be1274b850b69073a1d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/action-auth.test.ts:15 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/queue-destination-check.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/tui/test/action-auth.test.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"58419604ce15966e81cccd0165faf9fe74a1db325bf515d60681078db35299c3"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/action-auth.test.ts:16 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/mission-control/mission-control-write-contract.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/tui/test/action-auth.test.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c69b03fbc91b1f0c9e9ae4e7989f5edee6e68f14beee88e484ac7fdeabe61f3"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/action-auth.test.ts:17 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/mission-control/mission-control-action-log.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/tui/test/action-auth.test.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"384786e165f666f137c8b3e17f72ae83e5ba1cf08b0e895c377f77d997398079"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/action-auth.test.ts:18 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/routes/mission-control.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/tui/test/action-auth.test.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c2c93e233514672333d9c023d84f27015244f420eb2c89f4b1a4dad3cdc9d9"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/action-auth.test.ts:19 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/routes/hosts.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/tui/test/action-auth.test.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe43aab719df81a873ba8182587e68a7d323b9674b23d0d934b126a81464809"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/browser-boundary-tui-render.test.ts:8 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/middleware/browser-boundary.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/tui/test/browser-boundary-tui-render.test.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"67699d94e2bcfac271c384ae843e907b115922e8a3ead7775eb5a484e1a036ec"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/config-journey.test.ts:6 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/routes/config.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/tui/test/config-journey.test.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e63808505ac4a161e04fb5a118375da57d3a1b64b2f5ddc3cbd8669a125be0"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/config-journey.test.ts:7 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/routes/gateway.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/tui/test/config-journey.test.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4608c331c1da701fc389e574d93018228dfb7d20a6ce26d9d16b1c1ab313b7"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/config-journey.test.ts:8 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/user-settings/settings-store.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/tui/test/config-journey.test.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09afa068b54f9fbc52aca5799fb4e493a1bfdb52f677f5c1197635ff4970bbc"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/config-journey.test.ts:9 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/gateway/slack/config.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/tui/test/config-journey.test.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"401ab943ca7f65d8a11a12d956a9c0cf76fae9ed58169971c4305e4351e71efc"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/config-model.test.ts:4 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/user-settings/settings-store.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/tui/test/config-model.test.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98bac9b3bcf4df0fef013cb69f6a82e198f59bd541bd574e80ddf676ebc9fda"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/connections-journey.test.ts:6 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/routes/gateway.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/tui/test/connections-journey.test.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"e448876174d181ed771a935d7da504973eb183d833b6a15a1d048f853194e49d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/connections-journey.test.ts:7 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/gateway/human-registry.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/tui/test/connections-journey.test.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"046af7e0d974ec1efd1c39c1b9b68c05cc8f04e9218b3eb69b38f84b8ec9a8d6"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/connections-journey.test.ts:8 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/gateway/channel-operations.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/tui/test/connections-journey.test.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc3c51c9908473ee39cf8f5cbcc97f943509ee58f8c4ec4366dad14f3e4d052"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/connections-journey.test.ts:9 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/gateway/slack/config.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/tui/test/connections-journey.test.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"25718ec7d40d2726e4b811caf36f2c7268b5f34bdfa4eb2fb2bf852fc6b3dd44"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/connections-journey.test.ts:10 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/user-settings/settings-store.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/tui/test/connections-journey.test.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db4907f19e30ef4d3f90f79a5a68fd7122d00a5b1d2dfc7279ac41c2ed7bf6d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/crash-cart-start-daemon.test.ts:2 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/daemon-shutdown.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/tui/test/crash-cart-start-daemon.test.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dec04821e40b0cf49cc7853ff59d339e43c257267b6f5281a9e4694a422f540"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/helpers/cost-fixture.ts:7 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../../daemon/src/db/connection.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/tui/test/helpers/cost-fixture.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a814492ca540a19a765b848a78aac188339559acd52255629bf17ca536119e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/helpers/cost-fixture.ts:8 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../../daemon/src/db/migrate.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/tui/test/helpers/cost-fixture.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a344495426068e605efdfe401b9e2605b6cf3e9dc512d2bfa5e00abfd3dfc56"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/helpers/cost-fixture.ts:9 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../../daemon/src/db/all-migrations.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/tui/test/helpers/cost-fixture.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"21cd16ab0070d67dbf640bcf5c2637bae65de610610e491f0124717201104756"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/helpers/cost-fixture.ts:10 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../../daemon/src/domain/usage-samples-store.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/tui/test/helpers/cost-fixture.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eca91f620fcc0841b1af68853986248b8f9fa30a8b8c7a0854096dc235bc55a"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/helpers/cost-fixture.ts:11 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../../daemon/src/domain/pi-usage-entries-store.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/tui/test/helpers/cost-fixture.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b86ae565ec8e537e700851a271b91f8411b7b95f45f9de2bbe63d031fdb10c6"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/helpers/cost-fixture.ts:12 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../../daemon/src/routes/telemetry.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/tui/test/helpers/cost-fixture.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cdf0f66b7948c30fc05fd9ed5bb33295a29801041136b8d05cad2439fe53c0d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/mission-outcomes.test.ts:6 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/proof/judgments.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/tui/test/mission-outcomes.test.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ecc99327e57b62bb122a805949affeec522ae2f2131132f0c72e738b2b93ae"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/queue-sample-coverage.test.ts:3 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/connection.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/tui/test/queue-sample-coverage.test.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed3ba3ff3d5ad2fe6f6d3b91b337afb6f338fa76fafecaa5f9b68951f75f9ad"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/queue-sample-coverage.test.ts:4 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/migrate.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/tui/test/queue-sample-coverage.test.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"276a3c7f81a825963b1473d29934fad47e5fde498afe805aa1d4365a242cb9d2"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/queue-sample-coverage.test.ts:5 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/all-migrations.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/tui/test/queue-sample-coverage.test.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb859e3f90db8235563fb6c4647e85f064c32c81a5702e22537934beda8e392"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/queue-sample-coverage.test.ts:6 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/event-bus.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/tui/test/queue-sample-coverage.test.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"498ed95b665d7dbb17ce0d269f54cc7d331e8f94f3fca8522af311fc889b78c6"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/queue-sample-coverage.test.ts:7 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/queue-repository.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/tui/test/queue-sample-coverage.test.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60103b606450512560bdb80e78f4ae4f989b10c36fb41b326d7bb50bf5ff758"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/queue-sample-coverage.test.ts:8 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/routes/queue.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/tui/test/queue-sample-coverage.test.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b7b4a325f19b138bdd72725cceeb64f1f57484ef52c568e686e3b66df860427"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/reading-journey.test.ts:6 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/routes/files.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/tui/test/reading-journey.test.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"27340c2394683e6a88d529ad18721503f6003461d43fe61c5d0bbc0e30ca8433"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/slack-manifest-connections.test.ts:9 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/routes/gateway.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/tui/test/slack-manifest-connections.test.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba865c702c0e40b97e27f66720e2ad2425be9b1bcbfb39a77f788bc409760a2"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/slack-manifest-connections.test.ts:10 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/gateway/channel-operations.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/tui/test/slack-manifest-connections.test.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"de3e826d26fcbf5b79284a6daaa5b55bebc7668c36a1fb314554dd944544a146"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/slack-manifest-connections.test.ts:11 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/gateway/slack/config.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/tui/test/slack-manifest-connections.test.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e2415255d635b64bca1e7db149ba16bbaf56590e0024036c2d85359ba2177e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/slack-manifest-connections.test.ts:12 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/gateway/slack/manifest.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/tui/test/slack-manifest-connections.test.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"799176c1863fa760c5a136cca02973a6da0bdfbd7bbdcd4d3280f8bb6ff72b14"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/slack-print-link.test.ts:7 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/gateway/slack/manifest.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/tui/test/slack-print-link.test.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"0366500554b3d5935030bfc6e159fec051475e776e309e20c87e68de3fa5e50e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/terminal-journey.test.ts:3 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/terminal/terminal-service.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/tui/test/terminal-journey.test.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"799a250b0e8a60b2f2a353bdffbd6f953fc3ff217c649540cf7fe207c7c72129"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/terminal-journey.test.ts:4 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/terminal/herdr-adapter.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/tui/test/terminal-journey.test.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"179f789c8ceac598dcfd12b60d332cd44c5d1d3927fb4545520b2702db3d59ab"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/terminal-journey.test.ts:5 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/routes/terminal.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/tui/test/terminal-journey.test.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"86dfa8103419d4a0b51c89bcfbb3876fa31b417a78872a1a7890c276fd6ae60c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/usage-journey.test.ts:10 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/routes/provider.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/tui/test/usage-journey.test.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd25d3c8cdfbf1c48861784baa622cefb1204eecd3c249f95177085c781c65e4"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/usage-journey.test.ts:11 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/routes/config.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/tui/test/usage-journey.test.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c87fec29e054807f2bf10be0c543f9addb9af1c81287f36960b56f86bd9f4f8"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/usage-journey.test.ts:12 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/routes/gateway.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/tui/test/usage-journey.test.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"745868a2248d8f7a5095b50b078c6ce494af0adf574cad979e62c9e74867758d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/usage-journey.test.ts:13 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/user-settings/settings-store.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/tui/test/usage-journey.test.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"9444d84d0087882dfafa1bf5e9c9ea9b27d786abd9d6812688f4ce00fe8bc3f3"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/workflow-journey.test.ts:6 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/connection.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/tui/test/workflow-journey.test.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e6d03bbd37be5c667d8591fe44c196300972e1c60ebd6db5a99b12120bd7dc"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/workflow-journey.test.ts:7 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/all-migrations.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/tui/test/workflow-journey.test.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"00cbdcd9b00ca868f60473c849d479ebf1c866accdfd007989428b3307fad98a"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/workflow-journey.test.ts:8 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/db/migrate.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/tui/test/workflow-journey.test.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"db19eda1ced0b2737c11b808e14540aad0d8020b8c14a826f8f327a9e664cefa"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/workflow-journey.test.ts:9 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/event-bus.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/tui/test/workflow-journey.test.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b3882f540939d2f18765841ab0f015125b7004ced57dbe770b78b9253893350"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/workflow-journey.test.ts:10 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/queue-repository.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/tui/test/workflow-journey.test.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"08cf839495217ad9c646348b1757b989d208edeeca7565c9be028f64ad8f2607"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/workflow-journey.test.ts:11 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/watchdog-jobs-repository.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/tui/test/workflow-journey.test.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dae3569b1323b50d0d6fbf671a784f2c91156b321cd6bb59219f5be1f01ddd7"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/workflow-journey.test.ts:12 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/workflow-runtime.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/tui/test/workflow-journey.test.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"617d9a312b39a68a8ea06067d3479199772e052fb321d863f416158fa0f944b2"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/tui/test/workflow-journey.test.ts:13 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../daemon/src/domain/execution-view.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/tui/test/workflow-journey.test.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ab589b7c860a81e6ea353e78c76e7dc85f3c7922702a2ee6344b127143bc2b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: scripts/regen-edge-digests.mjs:22 reaches into another package with a relative path (../packages/daemon/scripts/gen-control-plane-json.mjs) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/regen-edge-digests.mjs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dfd96bb6cfe9d9051af5e5e2b1d5d63e0cb3e59ef5c95798c8696715cedc9f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startNodeWithWarnings (cyclomatic 280, cognitive 455): startNodeWithWarnings has cyclomatic complexity 280 and cognitive complexity 455; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/startup-orchestrator.ts"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"462215effceddc2932769e49565e2554aa50c86e5f2db77aac2f6083a074d758"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 255, cognitive 441): (anonymous) has cyclomatic complexity 255 and cognitive complexity 441; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of 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/commands/up.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda3d13faf5cc8d80cede1b2c35bcbf6de117d72a858eb9d91fd5c8bf5528b62"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hydrateSnapshot (cyclomatic 238, cognitive 262): hydrateSnapshot has cyclomatic complexity 238 and cognitive complexity 262; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/tui/src/hydrate.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b991ed95adf704224c7bd62cc0c63e7566299c2ff4f3bb54ee51a8ac465163"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function contentLines (cyclomatic 237, cognitive 520): contentLines has cyclomatic complexity 237 and cognitive complexity 520; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/tui/src/render.ts"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9947a0e199d7aa65d5911b6689954d1500861708b1388fb2bf514d42c192a1b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function postLaunchRestore (cyclomatic 216, cognitive 416): postLaunchRestore has cyclomatic complexity 216 and cognitive complexity 416; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":1947}}}],"partialFingerprints":{"codehealthFindingId/v1":"769405a39aacc3b567a8231233b235e6fef15993a86aa9ca7182708368d7862f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function advancePromptRefusals (cyclomatic 203, cognitive 375): advancePromptRefusals has cyclomatic complexity 203 and cognitive complexity 375; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/queue-wake-ladder.ts"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1dc8167136e433565e2a2c82c5f82b5f4e28089ea628b83fd7d8e1dc9b9e822"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runStuckSweep (cyclomatic 195, cognitive 337): runStuckSweep has cyclomatic complexity 195 and cognitive complexity 337; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/queue-stuck-sweep.ts"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"5490675bdb1e210fe925b6781ddaf8d498954ade236b3ff5e29965ae271a7982"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sendUnguarded (cyclomatic 191, cognitive 287): sendUnguarded has cyclomatic complexity 191 and cognitive complexity 287; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/session-transport.ts"},"region":{"startLine":3444}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c45a4f7b757006b1f356407d7fb0bddf83765f7d7d11ecaf23353a0ab6ceb52"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function describeBundleBehaviour (cyclomatic 176, cognitive 430): describeBundleBehaviour has cyclomatic complexity 176 and cognitive complexity 430; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/bundle-behaviour.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c64300f5f3129b7964a644d29bf2f6c97ce9850101fafaa50cfdcb8c273aa07"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateInTransactionalContext (cyclomatic 170, cognitive 186): updateInTransactionalContext has cyclomatic complexity 170 and cognitive complexity 186; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/queue-repository.ts"},"region":{"startLine":3628}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75b86c1d8771db4e7f967b2f7532dda87a0c2a3d1ad8910ed14e63e39d58c8d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function postHook (cyclomatic 160, cognitive 229): postHook has cyclomatic complexity 160 and cognitive complexity 229; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/routes/activity.ts"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"2746a74c2e6f333d3663ce63008e270154950fc68752de7b9d7af1db6029d376"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handover (cyclomatic 146, cognitive 216): handover has cyclomatic complexity 146 and cognitive complexity 216; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"1197642603179213a907436d831cbc2c12a8076d6ce6123a16a6b4cbf68d605b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restoreNodeWithCompensation (cyclomatic 146, cognitive 194): restoreNodeWithCompensation has cyclomatic complexity 146 and cognitive complexity 194; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"4daaeff8c02218be731320077237cb31efdd07bf1334194bd1b9b9cca65dbad4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reduce (cyclomatic 143, cognitive 123): reduce has cyclomatic complexity 143 and cognitive complexity 123; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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/tui/src/state.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d92b19137f502f7b5b45bbe5af4aeb0492f7fe9b7c6b6d767c22801f6a3bcc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 140, cognitive 288): (anonymous) has cyclomatic complexity 140 and cognitive complexity 288; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of 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/commands/start.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"27181c700bc287839e297c4ed5bb990051a94ac6114849175fbabdd1b51cbeb1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openTerminalWindow (cyclomatic 140, cognitive 202): openTerminalWindow has cyclomatic complexity 140 and cognitive complexity 202; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of 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/terminal-window.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc4d05f2d7c7984b07261bd1ea4e6d00001ffdf460fae2c76dcfbacc174443b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 137, cognitive 193): (anonymous) has cyclomatic complexity 137 and cognitive complexity 193; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of 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/commands/launch.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e28d613fb254330d70242320abeba88530620b946e5a9429e4273c2a22ed8b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createDaemon (cyclomatic 136, cognitive 175): createDaemon has cyclomatic complexity 136 and cognitive complexity 175; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/startup.ts"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed6013047782750585c3e509ad8aafa660f5c369aa4687378c98719cf477be57"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleEvent (cyclomatic 132, cognitive 183): handleEvent has cyclomatic complexity 132 and cognitive complexity 183; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":1594}}}],"partialFingerprints":{"codehealthFindingId/v1":"e85880d2180a84ecf3ff75ac871d3ce5584b2fe93c01ce83d27fb23aa8d0e372"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function launchExistingAgentMember (cyclomatic 121, cognitive 154): launchExistingAgentMember has cyclomatic complexity 121 and cognitive complexity 154; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":2477}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab0b7520088d6699961cf28f7f3b5d916b759e9fe1758663b367aefb01e79a8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleInput (cyclomatic 116, cognitive 235): handleInput has cyclomatic complexity 116 and cognitive complexity 235; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/tui/src/main.ts"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a354cc78c82c6df3e3d2a13707f46493ce804280657a661c882bacee09a18e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runWakeLadderTick (cyclomatic 113, cognitive 223): runWakeLadderTick has cyclomatic complexity 113 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/daemon/src/domain/queue-wake-ladder.ts"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d3c2e0f0a671390cf2d514eeb188097dc2fad75f1c5b9fbebc1094b5a54402e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setRuntime (cyclomatic 112, cognitive 115): setRuntime has cyclomatic complexity 112 and cognitive complexity 115; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-runtime-switch-service.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b6296cd5fcb331d75b97328707a4a960731baee7f821b99772746e004853f0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 110, cognitive 217): (anonymous) has cyclomatic complexity 110 and cognitive complexity 217; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/routes/attention.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"db127feafe3976417dbd811e524fd0dbe8edf7c8eaf32c043064f5626d4f1405"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 110, cognitive 141): (anonymous) has cyclomatic complexity 110 and cognitive complexity 141; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/assets/plugins/openrig-core/hooks/scripts/refocus.cjs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"667c0205abacf876176e3902561031705f9926b7fb960d980411a9dd4284dd7b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderBody (cyclomatic 109, cognitive 145): renderBody has cyclomatic complexity 109 and cognitive complexity 145; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/tui/src/render.ts"},"region":{"startLine":1925}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec163d2a99d3c2c444a3de1a55c75d6deff83cf8efc3335945ab0116aee19170"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function apply (cyclomatic 107, cognitive 145): apply has cyclomatic complexity 107 and cognitive complexity 145; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/terminal/herdr-follow-view.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d56ed2d36e5956ed8f0265b8d2b5558a882cc16b8c5d1a63c4a7b147949238"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function engineDeliver (cyclomatic 106, cognitive 166): engineDeliver has cyclomatic complexity 106 and cognitive complexity 166; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/gateway/slack/slack-subsystem.ts"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"6901793dd256e92fa2d97c9f3b6421181dc644a211d7aa105b4b587cf2972578"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 106, cognitive 144): (anonymous) has cyclomatic complexity 106 and cognitive complexity 144; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/finite-telemetry.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"932eddaa0f6ec9aa29c53b1c74782a72044061b1b2bdb0c70b227b2dd54fcb3f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildExecutionView (cyclomatic 104, cognitive 152): buildExecutionView has cyclomatic complexity 104 and cognitive complexity 152; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/execution-view.ts"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"a70dd4fc399ee5528d49f9f395ef4aadb353af376a2b7d6acf90581ed650fb95"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rebindAndVerifyPaneIdentity (cyclomatic 103, cognitive 127): rebindAndVerifyPaneIdentity has cyclomatic complexity 103 and cognitive complexity 127; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-attention-reconciler.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e451949a27529ad1cfdfd9304a1e4f8a2cb7f8b90d0b19a977f20b3dc0140a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 102, cognitive 110): (anonymous) has cyclomatic complexity 102 and cognitive complexity 110; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/routes/startup.ts"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d7f37a9d732d96d0db768859bef8aed6563a12a1970f2e540733d31d61a22e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleResponse (cyclomatic 100, cognitive 170): handleResponse has cyclomatic complexity 100 and cognitive complexity 170; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"98fb4c4888ab846eb4eb32b046ddf1b81f31aed5666b4be319a1eacfac79e8c6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function launchHarness (cyclomatic 100, cognitive 121): launchHarness has cyclomatic complexity 100 and cognitive complexity 121; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2c678a6ec30f0bf7b8ddf471e7a3ee3fbdd32a53a86b8de10e8387bbc89194"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addNode (cyclomatic 99, cognitive 121): addNode has cyclomatic complexity 99 and cognitive complexity 121; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/rig-repository.ts"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed97cae0c44389c433be9ef5be55e9541b7caaf204634105184df8efd02954fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleNodes (cyclomatic 97, cognitive 153): handleNodes has cyclomatic complexity 97 and cognitive complexity 153; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of 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/commands/ps.ts"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41a38e48961ba95d83077638579dc3a3384d92f95e81eb584180ed4a2f9cd37"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 97, cognitive 128): (anonymous) has cyclomatic complexity 97 and cognitive complexity 128; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of 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/commands/import.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e803459797d8f04ba8dfaacc715e2133873181d800d6cc255ea22ad5d7a100"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateAgentSpec (cyclomatic 96, cognitive 243): validateAgentSpec has cyclomatic complexity 96 and cognitive complexity 243; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/agent-manifest.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"463f2ec20df3cf9d3b0a937f839688118ab2a88834b204fb0eb6e1ba82f885de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recoverAfterRestart (cyclomatic 96, cognitive 108): recoverAfterRestart has cyclomatic complexity 96 and cognitive complexity 108; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":2113}}}],"partialFingerprints":{"codehealthFindingId/v1":"472f871ea1fa362c3dfc9433a8a750ff541b64abcbf6900f8369a1a3a77435b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 95, cognitive 94): (anonymous) has cyclomatic complexity 95 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/commands/ps.ts"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a18884029bac6916c16f61dbb603cbc81a0df200d6b54f68b08d59960f8153"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 94, cognitive 173): (anonymous) has cyclomatic complexity 94 and cognitive complexity 173; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of 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/commands/provider.ts"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0353df39f504837bd54d4c669636e0bb983b14aeced941090e13117b22de955"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evaluate (cyclomatic 93, cognitive 146): evaluate has cyclomatic complexity 93 and cognitive complexity 146; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/policies/parked-owner-consumer.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2791c93f0d215bbe983956ce04130eb6e21a27b26ae73e856827acc03e484de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 93, cognitive 144): (anonymous) has cyclomatic complexity 93 and cognitive complexity 144; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/gateway/slack/slack-delivery.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"6719c577eb8034519227b7e225ae6759e61a950de7431dc39a64a6052c61ff83"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function planPermissionAccount (cyclomatic 93, cognitive 114): planPermissionAccount has cyclomatic complexity 93 and cognitive complexity 114; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/permission-account.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"58920ed1dade76d21e45cd1f1f69ea44fbb80a54bc7bc4d3af0b9c92742da7b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 88, cognitive 121): (anonymous) has cyclomatic complexity 88 and cognitive complexity 121; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of 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/commands/send.ts"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bad7634f5a7ca9d759978d88f3a6c7f587bb2d239f3a02745d469d3a41e4913"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function command (cyclomatic 88, cognitive 98): command has cyclomatic complexity 88 and cognitive complexity 98; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-launch-environment.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f10208b1858422ce9e2ec27018858eba86b07d6d89a636c14c9e106912b79d4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function printHuman (cyclomatic 87, cognitive 141): printHuman has cyclomatic complexity 87 and cognitive complexity 141; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of 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/commands/seat.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"0963da25a93f9306ac4cd7c4193823516417bd7dad2c65d22dbee55f748c0036"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateMember (cyclomatic 87, cognitive 122): validateMember has cyclomatic complexity 87 and cognitive complexity 122; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a84f57ebb1396d6cc5e92076648774f13a02296373c0e03443faaa713ac83c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reconcileSkillLoadout (cyclomatic 85, cognitive 117): reconcileSkillLoadout has cyclomatic complexity 85 and cognitive complexity 117; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/skill-catalog.ts"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a049e57d5971bf789f9338a41119f6d375e25a09683be120f595cc56b3b28ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 85, cognitive 113): (anonymous) has cyclomatic complexity 85 and cognitive complexity 113; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/routes/bundles.ts"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0054f755dc5a795448ff9c538e7b139f215c3782194ae584456e8f5541f211e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyPaneActivity (cyclomatic 85, cognitive 69): classifyPaneActivity has cyclomatic complexity 85 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 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab96bf959f42153d1128bfcddd72ed52d9074349648f4c2bc60b7dcdaa8d984"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateManifest (cyclomatic 84, cognitive 212): validateManifest has cyclomatic complexity 84 and cognitive complexity 212; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/package-manifest.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddcc516a2f007fd0581f5d90bd36935c194229a98d24ae4f45db2900979219eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sendClassifiedInput (cyclomatic 82, cognitive 109): sendClassifiedInput has cyclomatic complexity 82 and cognitive complexity 109; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/session-transport.ts"},"region":{"startLine":3046}}}],"partialFingerprints":{"codehealthFindingId/v1":"345ef2ec666fdeafcf66ea14132168ffca3c0d0cbf8affd4888036ec4f491126"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function attemptLand (cyclomatic 81, cognitive 82): attemptLand has cyclomatic complexity 81 and cognitive complexity 82; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/gateway/slack/inbound.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc42fab0ae2e391dea6c13a0000c1b54f00508827bc36c115405364a8f16820d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 79, cognitive 154): (anonymous) has cyclomatic complexity 79 and cognitive complexity 154; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of 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/commands/walk.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e522756f83d3ba3a0f7a47a8067491d0f8363aa88c8ac39737189573c6db63c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evaluate (cyclomatic 79, cognitive 72): evaluate has cyclomatic complexity 79 and cognitive complexity 72; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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/daemon/src/domain/watchdog-policy-engine.ts"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c7bc4b319be7167ace3c8b7c214a0583dbe258ef8b1f8637e7a1232e277e5e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readWorkflowGuidance (cyclomatic 78, cognitive 115): readWorkflowGuidance has cyclomatic complexity 78 and cognitive complexity 115; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/workflow-guidance.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02a27cc42b1c2ef284faf9f8f48f531caf87d545567e20387ae8c50f8eefb42"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspectComposerInput (cyclomatic 78, cognitive 113): inspectComposerInput has cyclomatic complexity 78 and cognitive complexity 113; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/session-transport.ts"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ef188f82fe3cffe7b5569da4b3248d7afd382830c2614af17e5c285871ae57"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function launchNodeTargets (cyclomatic 76, cognitive 124): launchNodeTargets has cyclomatic complexity 76 and cognitive complexity 124; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ca066d28e56b575443fbe9407c12271b55f7d1c23d1c52d822f629bf8123ba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function execute (cyclomatic 76, cognitive 91): execute has cyclomatic complexity 76 and cognitive complexity 91; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-runtime-switch-service.ts"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b1aa72ef43932712d3326f5f41c9aea2d336d74f8560354e47ca0d6e97fe27"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validate (cyclomatic 75, cognitive 169): validate has cyclomatic complexity 75 and cognitive complexity 169; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":1399}}}],"partialFingerprints":{"codehealthFindingId/v1":"9afbb6d39ee1048ad4250e67ad6f5731e5e6193732c05a2c58ba706e69abbb15"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function attemptResume (cyclomatic 75, cognitive 130): attemptResume has cyclomatic complexity 75 and cognitive complexity 130; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":2790}}}],"partialFingerprints":{"codehealthFindingId/v1":"44654602ac606fb23dbc02cf6f15cbcad36353717a00d10ec442f3e643df29d1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function send (cyclomatic 75, cognitive 93): send has cyclomatic complexity 75 and cognitive complexity 93; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/routes/transport.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd40d07d35ad78208d1949cc9f01cc792b488b6038e2c787d58a5a2ded4136a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function judge (cyclomatic 75, cognitive 90): judge has cyclomatic complexity 75 and cognitive complexity 90; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/test-system/delivery/cases/d18.mjs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f6becdc74e17e85748f9566c595f9783ef1c119d585125e815cbc1a3bfc6cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 74, cognitive 109): (anonymous) has cyclomatic complexity 74 and cognitive complexity 109; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of 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/commands/proof.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3aeca1a2894195ba71bd8812f3389395e0cabe160f6bfffefb16e59aa580a7c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 74, cognitive 93): (anonymous) has cyclomatic complexity 74 and cognitive complexity 93; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/workflow-projector.ts"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae496856b1ffb942eb5a122215211847d2f976bcf55926e4eb049510ed6cadd2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function observe (cyclomatic 73, cognitive 87): observe has cyclomatic complexity 73 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":"packages/daemon/src/domain/seat-restart-in-place.ts"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"fedb48afdeda015fd1aee5c8677edf8f40d6c0eec46b470f1c140f8c3f860bfb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyScopeItem (cyclomatic 72, cognitive 141): classifyScopeItem has cyclomatic complexity 72 and cognitive complexity 141; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of 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/lib/scope/scope-audit.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"d68ac9c7806e5d5c0362120d16c24431d15ae75b658b81e906b8dd318f1065c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyScopeItem (cyclomatic 72, cognitive 141): classifyScopeItem has cyclomatic complexity 72 and cognitive complexity 141; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/scope/scope-audit.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"a274dbdf4b6764a7324734b0560f3c80236ac0665117e39871756d3a8c84b8a0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeStages (cyclomatic 72, cognitive 123): executeStages has cyclomatic complexity 72 and cognitive complexity 123; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/bootstrap-orchestrator.ts"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc67efcf59634c455c8c9158cdb0889bfb307e09fdf6e5169ef1367b264f9dc9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function errorResponse (cyclomatic 71, cognitive 94): errorResponse has cyclomatic complexity 71 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 is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/routes/workflow.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ec60b7c15c985233fc151cc96191ca5051af841a5a03a53b1339440b637171"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function launchFresh (cyclomatic 71, cognitive 88): launchFresh has cyclomatic complexity 71 and cognitive complexity 88; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":1638}}}],"partialFingerprints":{"codehealthFindingId/v1":"0470524657bf04a1d5ff3b3ba595ba8a99fb7863e680f824efe66ce1f5549d5f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function agentDetailLines (cyclomatic 71, cognitive 65): agentDetailLines has cyclomatic complexity 71 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 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/tui/src/render.ts"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"d807d76e32e84045cfd1f90fb5bcd22698dbd650c6ed849bb61f355889752c9f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseAtoms (cyclomatic 70, cognitive 145): parseAtoms has cyclomatic complexity 70 and cognitive complexity 145; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/context-packs/manifest-parser.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c14a230d3f2687f9b50a31c6b4101962873776a1561d75127bd3d5dec7325df"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 70, cognitive 96): (anonymous) has cyclomatic complexity 70 and cognitive complexity 96; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of 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/mcp-server.ts"},"region":{"startLine":1688}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce50b94b8530016b49c8fe9cc8ad2c17b6bad4bded0623423694d1a7f70b0d4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bootstrap (cyclomatic 69, cognitive 137): bootstrap has cyclomatic complexity 69 and cognitive complexity 137; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/bootstrap-orchestrator.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"065b8e69f52d5c97e1237b44bed427ae1ca8352e0dda24e37b0897f08f2788fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function eraseQueue (cyclomatic 69, cognitive 104): eraseQueue has cyclomatic complexity 69 and cognitive complexity 104; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/queue-erasure.ts"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c5e85639b475ecdd451f962a1cac942e7af5c7507c5e089d7d72521bf6094a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function launchHarness (cyclomatic 69, cognitive 76): launchHarness has cyclomatic complexity 69 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":"packages/daemon/src/adapters/pi-runtime-adapter.ts"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"338e8dbe962e7297a8b2709b7dd68ce243b7aea8eb8c749325130784f718f999"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function read (cyclomatic 68, cognitive 149): read has cyclomatic complexity 68 and cognitive complexity 149; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/health-passive-ceremony.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"f90d8f3bf2f005991b0a037cf4b73753ac16c1664855d606273e003c7bcf6482"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function answerAsk (cyclomatic 68, cognitive 74): answerAsk has cyclomatic complexity 68 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/daemon/src/domain/mission-control/mission-control-write-contract.ts"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c25e62c1379864cb74e37aa2ecbc5a526590268ec46d1c6e6ae2fb95a0a431"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function key (cyclomatic 68, cognitive 63): key has cyclomatic complexity 68 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 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/tui/src/startup.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"8323bdb5bf85cddae3bc699eeae5e52f05b3bff3c9218b5ec4a711d4253f89d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeToolBrandId (cyclomatic 68, cognitive 33): normalizeToolBrandId has cyclomatic complexity 68 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/ui/src/lib/tool-brand.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd7d6044d50b15bc60c4f4ce15fe5ff53ba672ec1e66082496552b6503720632"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function observedQueueCounts (cyclomatic 66, cognitive 110): observedQueueCounts has cyclomatic complexity 66 and cognitive complexity 110; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"9895fb33abc8e93a1ea6f35d44b74e10857e895f5c6210bc7919aabb480dfbb8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 66, cognitive 88): (anonymous) has cyclomatic complexity 66 and cognitive complexity 88; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/routes/context-packs.ts"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c3fd0738c525ae11d18b0219c71c026d2d04358d84204358e8978179d14e2a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function clearAttention (cyclomatic 66, cognitive 86): clearAttention has cyclomatic complexity 66 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/daemon/src/domain/seat-attention-reconciler.ts"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c23b6690926c7d1d476d4106acf339c6229ac4b1589d85fc32b4a05dee40d8a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 66, cognitive 77): (anonymous) has cyclomatic complexity 66 and cognitive complexity 77; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of 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/commands/seat.ts"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"487044cfa0324faf9fb3de8923b9aec0b34a779a80e4df5f24bf53fc0d201f3c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function annotateInputBox (cyclomatic 66, cognitive 76): annotateInputBox has cyclomatic complexity 66 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":"packages/daemon/src/domain/session-transport.ts"},"region":{"startLine":5345}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5bd1a485063eaab768e2ad291760119264a8560a2495eeba466ace032c5484"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeVerdict (cyclomatic 65, cognitive 79): computeVerdict has cyclomatic complexity 65 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/daemon/src/domain/seat-identity-reconciler.ts"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f95e7f78c50375943a7236b332ddb3d3bfb411d402e0af92e27052a669ebb6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 64, cognitive 92): (anonymous) has cyclomatic complexity 64 and cognitive complexity 92; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of 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/commands/grow.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"25954c857691762276fe91227b926f3e1942635fae18806dc1070223004fce41"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 64, cognitive 90): (anonymous) has cyclomatic complexity 64 and cognitive complexity 90; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of 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/commands/status.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f685dbf4a143148a1e77c99857b6731781e7ec3fb8deea132396abb51f1a498"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validatePreRestore (cyclomatic 64, cognitive 87): validatePreRestore has cyclomatic complexity 64 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":"packages/daemon/src/domain/restore-preconditions.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15512ca8e7c30341d5d0b6bc8042e1eaf8b4643bbfc95ee8d57abfe0a864541"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function FeedCard (cyclomatic 64, cognitive 59): FeedCard has cyclomatic complexity 64 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 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/ui/src/components/for-you/FeedCard.tsx"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"722afe7a16af15f098d1358373146c66d156e6829cda029d25d2b2d92e0c3026"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 63, cognitive 135): (anonymous) has cyclomatic complexity 63 and cognitive complexity 135; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of 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/commands/slack.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"274470eb637ff8992fd29a30cf1f53b0fd9c0fd327cd2ec80cc2d60b47476809"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 63, cognitive 97): (anonymous) has cyclomatic complexity 63 and cognitive complexity 97; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of 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/mcp-server.ts"},"region":{"startLine":2462}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f569e35c5e348b70342b63bb191e2f25c30c936784a7e29525854570d1dace7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resume (cyclomatic 63, cognitive 68): resume has cyclomatic complexity 63 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/daemon/src/adapters/claude-resume.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f19b653e28a320fd72d22ab36b4ceebb429c0cfa2811aec5e5aa76a8e071a8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifySendReadiness (cyclomatic 63, cognitive 68): classifySendReadiness has cyclomatic complexity 63 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":4475}}}],"partialFingerprints":{"codehealthFindingId/v1":"9175f4cfd64c541160514c6d513f6ad607ee940d21bbbe72ff3d445b9c48d244"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function maybeAutoCompactUnchecked (cyclomatic 63, cognitive 58): maybeAutoCompactUnchecked has cyclomatic complexity 63 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 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":1326}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b10840694df3f998d683e9df615a4d57ad3ff09ee011052a0ade983f1e3e76"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function RigNode (cyclomatic 63, cognitive 57): RigNode has cyclomatic complexity 63 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 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/ui/src/components/RigNode.tsx"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4218d809b58e9d76781723bb9a20303001397accbe229f3632542b9d390999"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseText (cyclomatic 62, cognitive 173): parseText has cyclomatic complexity 62 and cognitive complexity 173; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/tui/src/input.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4d1fd150856ff0884fe0a828800908d53a1e2e98440b99c42529889995db85"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateParticipantsFile (cyclomatic 62, cognitive 112): validateParticipantsFile has cyclomatic complexity 62 and cognitive complexity 112; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/gateway/participants.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f0115df96311990a13d7f3e3c0d79d5ca7ae5263fb07562f766b9608439440"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function instantiate (cyclomatic 62, cognitive 103): instantiate has cyclomatic complexity 62 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/daemon/src/domain/workflow-runtime.ts"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"f165e1df5b5cb71b10f6381a8bf13f8b476c182e68e5bf8dc0cbe97e56bc4ef6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveNodeConfig (cyclomatic 62, cognitive 92): resolveNodeConfig has cyclomatic complexity 62 and cognitive complexity 92; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/profile-resolver.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e96e19d3ddf992c1eae23772509b4b44b0e99cd6ddcbad287f3d8c75f9f850c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 62, cognitive 56): (anonymous) has cyclomatic complexity 62 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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/mcp-server.ts"},"region":{"startLine":1866}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2dc8ee4877393c6705f7b47d8fac656fc4935cf8b01052d4fe5b0a9a135d04c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readCompactionRecord (cyclomatic 62, cognitive 46): readCompactionRecord has cyclomatic complexity 62 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 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"77291f47ffb44a52dbdaa19d52c6f31313cf9a3645a59810823bf57798b4d7b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeExplorerRows (cyclomatic 61, cognitive 162): computeExplorerRows has cyclomatic complexity 61 and cognitive complexity 162; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/tui/src/state.ts"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ddb3923a5c6bacdb9ccc0fe63aba6757caff969b309b6258b47034e4bc79bff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveWorkPosition (cyclomatic 61, cognitive 123): resolveWorkPosition has cyclomatic complexity 61 and cognitive complexity 123; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of 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/lib/work-install.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b504d2cc01862310efcf79f2563d0b41aea46667057d5e526a465bc3cd0ecb8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 61, cognitive 94): (anonymous) has cyclomatic complexity 61 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 is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of 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/commands/down.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"03aaecb50bd2250e655c8e91083578a9338c73126d30402311f3321f1c2f43c1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resume (cyclomatic 61, cognitive 61): resume has cyclomatic complexity 61 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/daemon/src/adapters/pi-resume.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"8259120cab6cb08edfe193e90280ec344831f13b67ece0aa49d983706e729f79"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function FeedCardQuestionAsk (cyclomatic 61, cognitive 56): FeedCardQuestionAsk has cyclomatic complexity 61 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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/ui/src/components/for-you/FeedCardQuestionAsk.tsx"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f4e6f6a5c108c449ea1a018406137b647c11cd5a5bd6f96ed5f0a7e711b2e0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toAgentRow (cyclomatic 61, cognitive 55): toAgentRow has cyclomatic complexity 61 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 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/tui/src/hydrate.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db9873191121375854e703e4f2487a29f922972e3cacb215fb7b4815b8dc821"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runSetup (cyclomatic 60, cognitive 108): runSetup has cyclomatic complexity 60 and cognitive complexity 108; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of 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/commands/setup.ts"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b0a8b0e58cfb37d37f04b06ef62b1d8e333722e8f73d435e603e011ff73f8eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function instantiateOnce (cyclomatic 60, cognitive 93): instantiateOnce has cyclomatic complexity 60 and cognitive complexity 93; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":1478}}}],"partialFingerprints":{"codehealthFindingId/v1":"a36ae2037ce31e9bc27f8b5fc61372e23f396d088a4087cc35003d2d7bc4fa25"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resume (cyclomatic 60, cognitive 61): resume has cyclomatic complexity 60 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/daemon/src/adapters/codex-resume.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"c172624aaf8f26e61c39beffb043767b3ec9580d6089cd1255b766ccc26d4a98"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function context (cyclomatic 59, cognitive 115): context has cyclomatic complexity 59 and cognitive complexity 115; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/rig-mode/operating-posture.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"a137338cab906c025d54a4722bf0853aaaaa2a147eab8fc5b3777a8d5a332916"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 59, cognitive 101): (anonymous) has cyclomatic complexity 59 and cognitive complexity 101; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/workflow-spec-cache.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"978551771638a69ef45ede0b21b8561d0c887b18b8341869f7a91adac5b414c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 59, cognitive 77): (anonymous) has cyclomatic complexity 59 and cognitive complexity 77; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/routes/agent-images.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a88dc20bb7c4456f6224b09d29bac4dcaca522443058f16b0061a70c7ee6563"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 59, cognitive 66): (anonymous) has cyclomatic complexity 59 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":"packages/daemon/src/routes/queue.ts"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb653210dfcab9809af7839495d5d275b3ce17004469467ef5ebe1e742a7b2a9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startOwnedDaemon (cyclomatic 58, cognitive 89): startOwnedDaemon has cyclomatic complexity 58 and cognitive complexity 89; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of 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/daemon-lifecycle.ts"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f9f898d4dba40c37059d4d1f0a289cff9edda0c6eeff46a10e37a8e2211992"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generationRecord (cyclomatic 58, cognitive 84): generationRecord has cyclomatic complexity 58 and cognitive complexity 84; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/routes/sessions.ts"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1717d2b3b1e4cd84eb9d6f0e36066dd02cd0c4bdd90df7bed42ad817647ba56"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 58, cognitive 73): (anonymous) has cyclomatic complexity 58 and cognitive complexity 73; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/workflow-runtime.ts"},"region":{"startLine":1550}}}],"partialFingerprints":{"codehealthFindingId/v1":"867135096eab588897d38b0dbadf0eeeecdc4b7744e991e02fea71da1e3c3ce8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ensureOnce (cyclomatic 58, cognitive 67): ensureOnce has cyclomatic complexity 58 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/daemon/src/domain/terminal/herdr-viewer.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"842c003b9696c3aa43943949a3971c75caf49f69cc2d9cd75ce0fad2d3a68aef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyResumeLaunch (cyclomatic 57, cognitive 105): verifyResumeLaunch has cyclomatic complexity 57 and cognitive complexity 105; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":1890}}}],"partialFingerprints":{"codehealthFindingId/v1":"e29fdcddc11dd4fad7d6708db31ddf46958371319477e4f5c43c366a769a2e19"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 57, cognitive 95): (anonymous) has cyclomatic complexity 57 and cognitive complexity 95; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of 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/commands/ask.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1194ec457d68621ab2c62edf0b66bf588003bfaf0e616715c1e5dfbae4cbed3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compare (cyclomatic 57, cognitive 75): compare has cyclomatic complexity 57 and cognitive complexity 75; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/workflow-reconciliation.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f8bc63bb8ef64877252f9fcb9057d7193ba7354a1596f8a031d3aacda7cb66"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareLaunch (cyclomatic 57, cognitive 55): prepareLaunch has cyclomatic complexity 57 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 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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"58de958b0ddd3392231dbf8dcb83ec30d680cd96b4b51cb83e6d6ccc2abb7b7f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function retryFirstStart (cyclomatic 57, cognitive 53): retryFirstStart has cyclomatic complexity 57 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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":1333}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a817bf596878519cbc67c730996dff3aeb009683454813d1d5ef8b41ced9f8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isRestoreUsableSnapshotData (cyclomatic 56, cognitive 87): isRestoreUsableSnapshotData has cyclomatic complexity 56 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":"packages/daemon/src/domain/snapshot-repository.ts"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"3700259eb75248c0acf4a0b4b541af84f552e0ebfdf05eaa0b2b242eb813ca8a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 56, cognitive 65): (anonymous) has cyclomatic complexity 56 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/daemon/test/restore-claude-activity.test.ts"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf59c4fe99d074e94f3a54c16a56bf68d2c6b3457b99cd264dc65d28300fb9b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 56, cognitive 63): (anonymous) has cyclomatic complexity 56 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/daemon/src/routes/provider.ts"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8082fe79a61285adb520c0d5e78fb666a078278df64185343cf6f42ef85506"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function post (cyclomatic 56, cognitive 57): post has cyclomatic complexity 56 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/daemon/src/domain/runner-channel.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e62105991230a95dee0ff9ab1c7c0071a17ea1ae7f36622480ce614a39d66b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sendPreparedCompact (cyclomatic 56, cognitive 54): sendPreparedCompact has cyclomatic complexity 56 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 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":1765}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e76c11610f12e167960b12e5e2c410a0d9d3d8f0b61c05cfa8d9849f063b77"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recover (cyclomatic 56, cognitive 53): recover has cyclomatic complexity 56 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/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"2659a0afdcd8e297c1943cbf9345cb8ccee52af3d4a3d000ced3ed18b15011e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openView (cyclomatic 55, cognitive 107): openView has cyclomatic complexity 55 and cognitive complexity 107; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/terminal/herdr-adapter.ts"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d68813f6ed7732e54a0fdaad294d821f165677eacd71a454c8ede4fd4f5c3f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseWorkflowSpec (cyclomatic 55, cognitive 78): parseWorkflowSpec has cyclomatic complexity 55 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":"packages/daemon/src/domain/workflow-spec-cache.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"f752ac470477acc2719043af02dfb57307e86f8c8b0fa873777e477ca76c9930"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderPulseScreen (cyclomatic 55, cognitive 71): renderPulseScreen has cyclomatic complexity 55 and cognitive complexity 71; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/tui/src/render.ts"},"region":{"startLine":1640}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a791d056be700db3a1b965de0513ca664eb867918b07cea2c59a25ee63c39b9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectTmuxServer (cyclomatic 55, cognitive 67): selectTmuxServer has cyclomatic complexity 55 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/daemon/src/domain/tmux-server-selection.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"5593274ac35b219a0b2f4cc4dc9d0e1d174fe02a0ee843fafb459eff627d517d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parsePreset (cyclomatic 55, cognitive 60): parsePreset has cyclomatic complexity 55 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":"packages/daemon/src/domain/community-harness-presets.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c3a497fa958a838dea7d40003f1a8d894d03557e836dad511cacbace0eea56"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 54, cognitive 83): (anonymous) has cyclomatic complexity 54 and cognitive complexity 83; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of 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/commands/bootstrap.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"41335c6a5053de40566b5e6c2282ee3818cb16ea141a5b131f80b882d35ec849"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyResumeLaunch (cyclomatic 54, cognitive 82): verifyResumeLaunch has cyclomatic complexity 54 and cognitive complexity 82; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"08822e9b902effaa11f19a09cdebdd0a61a9d6c7b6c898e3eaf3f345a66588d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 54, cognitive 68): (anonymous) has cyclomatic complexity 54 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/cli/src/commands/whoami.ts"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a1b2c5adeeb290d80d4c1aa30854f56392da9c18e379398aeb9c999089dd1b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function launchNode (cyclomatic 54, cognitive 58): launchNode has cyclomatic complexity 54 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/daemon/src/domain/node-launcher.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"00837dd2911d46090d88f2ff41f3a66541ccd7eb58bd3b7b3f3da77d8bcb8020"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createInTransactionalContext (cyclomatic 54, cognitive 58): createInTransactionalContext has cyclomatic complexity 54 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":2555}}}],"partialFingerprints":{"codehealthFindingId/v1":"28225db618aa8d07233755cb4703b20362e80296357d14e16c5ca8942844e000"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 54, cognitive 49): (anonymous) has cyclomatic complexity 54 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 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/daemon/src/domain/rig-repository.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"f01afb41d27213fe55d54432a12f9edf608772a911db96c309de9378c911b918"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 53, cognitive 110): (anonymous) has cyclomatic complexity 53 and cognitive complexity 110; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of 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/commands/scope.ts"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4b621af3a25295ad454a7e5be62be42cf276678a4debff6ef840e39f793a81"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 53, cognitive 97): (anonymous) has cyclomatic complexity 53 and cognitive complexity 97; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of 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/commands/context.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5eb3893c20aa4d6f1f3d8329e4a31a52f94ef6384fe81dee6e2943917dc30a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readArrangement (cyclomatic 53, cognitive 94): readArrangement has cyclomatic complexity 53 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 is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/execution-view.ts"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1d951657cb0246883d2a940c1b0a3e5a824cd5013a4dd5e1c35607fa2f810a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function settingsBrowser (cyclomatic 53, cognitive 70): settingsBrowser has cyclomatic complexity 53 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/daemon/src/domain/user-settings/settings-browser.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a00a41d0cad8d89a09d3fcad97b1e2cf02f55bbfa757329f0736077914dd51d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 53, cognitive 69): (anonymous) has cyclomatic complexity 53 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":"packages/daemon/src/domain/execution-view.ts"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c968442dc1480b73300232beffe9fb73e88ec3955a85a32bafa98feb8caba2e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function launch (cyclomatic 53, cognitive 63): launch has cyclomatic complexity 53 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/daemon/src/domain/environment-startup.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b94e0cb6fef2ba94d57f5140eb81ee3c36d618484c2ddda414474104092a00f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createMcpServer (cyclomatic 53, cognitive 54): createMcpServer has cyclomatic complexity 53 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/mcp-server.ts"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac16e6671db62423692a65da81de94c939c2e5f1f1fdf1c8a1b507e681bb81cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function teardown (cyclomatic 52, cognitive 90): teardown has cyclomatic complexity 52 and cognitive complexity 90; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/rig-teardown.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f31f187f971dbef11e6410478c0e1db5fc6452a923fdbfc62eed1297243d7f8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runFanOutSend (cyclomatic 52, cognitive 64): runFanOutSend has cyclomatic complexity 52 and cognitive complexity 64; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of 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/commands/send.ts"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"95c59df0451b86e138b231054bde58beb2dc715bfab4a034bebfbe637ed470a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildRestoreOutcomeMap (cyclomatic 52, cognitive 63): buildRestoreOutcomeMap has cyclomatic complexity 52 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/daemon/src/domain/node-inventory.ts"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcf02f07698b640e256c762ba1bad7121ce50a8bb492d8e5a96e0631a24c5cd3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function crossHostHandoff (cyclomatic 52, cognitive 50): crossHostHandoff has cyclomatic complexity 52 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 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/daemon/src/routes/queue.ts"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"609b4657d900e63be4d3155fbe4ee9ce446137b551914bafa14bbfd1ab5c680c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pollSeat (cyclomatic 52, cognitive 44): pollSeat has cyclomatic complexity 52 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/daemon/src/domain/seat-structural-activity-service.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"db60522ebd426ae4ce4321183f6d9d71aff3e86972cb37883794b264201d981c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseProfiles (cyclomatic 51, cognitive 128): parseProfiles has cyclomatic complexity 51 and cognitive complexity 128; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/context-packs/manifest-parser.ts"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c639fd8a8dc58e8f260588643a1cd8c7a2fcab1d0bf257866c5a50132d2b45"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compileProjectLifecycle (cyclomatic 51, cognitive 81): compileProjectLifecycle has cyclomatic complexity 51 and cognitive complexity 81; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/project-lifecycle-compiler.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef49723078fd491edb48ca6d8189b433cda29ed9dc9c9cc5649baa115d1524d9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restore (cyclomatic 51, cognitive 63): restore has cyclomatic complexity 51 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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf00bf7e203f737a6ab80ced0e4d5eb3880b0caaf73998da5496805321b0097"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readWakeLadderBackstop (cyclomatic 51, cognitive 46): readWakeLadderBackstop has cyclomatic complexity 51 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 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/daemon/src/domain/queue-wake-ladder.ts"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"7857ae651db3e160f23a27ab9d0da970dc0a0bc3c22bf92b564a10ab61365132"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function attentionLines (cyclomatic 50, cognitive 133): attentionLines has cyclomatic complexity 50 and cognitive complexity 133; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/tui/src/attention/attention-model.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe1c2587d128ed96c87e6f9a3a0f667d2be07344f8d3060b5fa6694f7a3f85a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function terminalLines (cyclomatic 50, cognitive 80): terminalLines has cyclomatic complexity 50 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 is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/tui/src/terminals/terminal-model.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e25c30579e8cc38a32d1c1fa8855b54ae53f1fbd32ced32f9b36e5fa63c8778"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderInstanceShow (cyclomatic 50, cognitive 63): renderInstanceShow has cyclomatic complexity 50 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/commands/workflow-render.ts"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb12a51e79066087ecb523abe00d5d289ad44fc2f6bcb5e8aa594a7f5b43516"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function page (cyclomatic 50, cognitive 61): page has cyclomatic complexity 50 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/daemon/src/domain/gateway/slack/channel-recovery.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1640466c3d01202d5df16255e7c6a10d10b08d5c83b1cf493feb6176309494d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordHookActivity (cyclomatic 50, cognitive 53): recordHookActivity has cyclomatic complexity 50 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":"packages/daemon/src/routes/activity.ts"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a0e762ce78b417790202cedd2641f89da9e16b058cb84c10c14136678a0fd0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepare (cyclomatic 50, cognitive 42): prepare has cyclomatic complexity 50 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 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/daemon/src/domain/claude-managed-launch.ts"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"da098d15c2f55e276ed09d6e701a058e9449f04a9161f2b930f106f8add08d59"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getDaemonStatus (cyclomatic 49, cognitive 94): getDaemonStatus has cyclomatic complexity 49 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 is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of 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/daemon-lifecycle.ts"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe882dd51431adc69834ce91cddda58c131ce9520a73f58870ec595f30f087ea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function connectionsLines (cyclomatic 49, cognitive 71): connectionsLines has cyclomatic complexity 49 and cognitive complexity 71; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/tui/src/connections/connections-model.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cce4b7099899cf32b460819d760f19e41246095a90caacfbd0bcd09331a66d8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolve (cyclomatic 49, cognitive 67): resolve has cyclomatic complexity 49 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/daemon/src/domain/whoami-service.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe5e417f1230ce4c2cb25947c419ad6decf9a669c41fcae659721cff3c2b8e3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateHumanFragment (cyclomatic 49, cognitive 64): validateHumanFragment has cyclomatic complexity 49 and cognitive complexity 64; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/gateway/human-registry.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e191e26895b87faa40397b00e7a2e3b9775c08ff2e6b1afde877a4e4fd588c9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseAgentImageManifest (cyclomatic 49, cognitive 63): parseAgentImageManifest 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/daemon/src/domain/agent-images/manifest-parser.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0aaa08b6124406ce26584545134c70790b3c15628f98b21eb4a467ca270f7e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 49, cognitive 56): (anonymous) has cyclomatic complexity 49 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of 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/commands/seat.ts"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f5090fd31d55a928f950693626a0c3fb9e39316a803ef64932293804295223"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 49, cognitive 56): (anonymous) has cyclomatic complexity 49 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of 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/commands/terminal.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dbc4ceeb1a8249240f83e6bc757eef24363eb46bb2adb39d21da85e51ec9ac2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function projectStep (cyclomatic 49, cognitive 46): projectStep has cyclomatic complexity 49 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 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/daemon/src/domain/workflow-projector.ts"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"e06dfde99ccaaae90d9d48b54478191d18487a148789ec1f10c34f91acca9c73"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 48, cognitive 116): (anonymous) has cyclomatic complexity 48 and cognitive complexity 116; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of 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/commands/export.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"d76046d988c333aa9f23afa80ac2925a3e5545b9970c03e2a33808e795ed0d77"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function errorResponse (cyclomatic 48, cognitive 90): errorResponse has cyclomatic complexity 48 and cognitive complexity 90; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/routes/queue.ts"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b4353192ec611d0f979eea702de272ada334b801a4c58dd044cc07347498a40"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function captureSnapshot (cyclomatic 48, cognitive 76): captureSnapshot has cyclomatic complexity 48 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":"packages/daemon/src/domain/snapshot-capture.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"d98fc67ad474648f450d10368a6a2954a052d636965cc8ea5b72b95d54fff0be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatRemoteUpFailure (cyclomatic 48, cognitive 66): formatRemoteUpFailure has cyclomatic complexity 48 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":"packages/cli/src/commands/up.ts"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"9282ecc25fb2f633599c14228a433dbb596e5b7c878920a3ab3398b051ab191e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 48, cognitive 63): (anonymous) has cyclomatic complexity 48 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/daemon/test/helpers/scenario-real-deps.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"9591eae03082442b1e16e6d2986f05278feb1908416ba97cb61bdfd68298c4f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rowLines (cyclomatic 48, cognitive 59): rowLines has cyclomatic complexity 48 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/queue-receipt.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9364548be5b0ec57ad76877f4282acc6a56dbd165e87ff05a80476c85f18f30"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function arbitrate (cyclomatic 48, cognitive 44): arbitrate has cyclomatic complexity 48 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/daemon/src/domain/seat-activity-service.ts"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"629c481bde02ee086de85249a1d49f79e55c741a17cb295b800c362222eb50f5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validate (cyclomatic 47, cognitive 95): validate has cyclomatic complexity 47 and cognitive complexity 95; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1167302dfaf0cc47de119a0e06aef7858ec786fcf1de1343dc048317fa69f5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assessNativeResumeProbe (cyclomatic 47, cognitive 82): assessNativeResumeProbe has cyclomatic complexity 47 and cognitive complexity 82; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/native-resume-probe.ts"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa3ad4d36079fbe981d57117e142ef3e88f5b1e9105b3f3ecd073d175c34f1d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 47, cognitive 80): (anonymous) has cyclomatic complexity 47 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 is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/routes/hosts.ts"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"4710a4877f6fd91a26f420607853117eed979199ac56cdecf723551fcc04f8ab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function waitingView (cyclomatic 47, cognitive 64): waitingView has cyclomatic complexity 47 and cognitive complexity 64; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/queue-repository.ts"},"region":{"startLine":6265}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee9ee622caa30659fc1a857bba14d446f67eb2e7fc44d1931b7fbeb16266bde"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function removeNodeWithin (cyclomatic 47, cognitive 61): removeNodeWithin has cyclomatic complexity 47 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/daemon/src/domain/rig-lifecycle-service.ts"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe265996d4993263833bdeb29ad29892ed0be3cb71cf6d9c41b0ef7965dbf8c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildSlackGatewayWire (cyclomatic 47, cognitive 54): buildSlackGatewayWire has cyclomatic complexity 47 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/daemon/src/domain/gateway/slack/slack-subsystem.ts"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"37017ea303877d58aa4c026c9839f71ef1102c722ff67053afa2486969df1ffd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildOutboundMessage (cyclomatic 47, cognitive 45): buildOutboundMessage has cyclomatic complexity 47 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 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/daemon/src/domain/gateway/slack/message.ts"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e92be63305a9fbe3f0410cd135301e341e4310f14c9ff6b4747135c9dd061e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateDisposition (cyclomatic 47, cognitive 42): validateDisposition has cyclomatic complexity 47 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 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/daemon/src/domain/stream-dispositions.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"2164d743a92a9242405a272029ff7f55c2b687803d41ce99e4eae5a32f00bc85"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recreate (cyclomatic 47, cognitive 39): recreate has cyclomatic complexity 47 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 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/daemon/src/domain/environment-lifecycle.ts"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"723a350b184012dee3227b8631be34d65f241d087915015d5fe5e0205fd4f0b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function preflightMembers (cyclomatic 46, cognitive 116): preflightMembers has cyclomatic complexity 46 and cognitive complexity 116; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/rigspec-preflight.ts"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"4531daf092152631ead2e4bdd7b0965ead241f5b048a9f6750070901bb327a91"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refresh (cyclomatic 46, cognitive 94): refresh has cyclomatic complexity 46 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 is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/resume-metadata-refresher.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b33551bc3bde8eafb8ac521037023ff26cce75af95fdb511f5b8a798ff309ea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function effect (cyclomatic 46, cognitive 69): effect has cyclomatic complexity 46 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":"packages/daemon/src/domain/environment-lifecycle.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c62a6ac3e242c142d743a6e32df4e78d2b78f35fd6f16f498ef97693d6e41ea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recover (cyclomatic 46, cognitive 65): recover has cyclomatic complexity 46 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/daemon/src/domain/seat-runtime-switch-service.ts"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a50f24a54209458a498de3b8126f6195f4be218d6cbaa4a057fef6f6d5e387"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function page (cyclomatic 46, cognitive 59): page 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":"packages/daemon/src/domain/gateway/slack/thread-recovery.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"751b034193d4b6da7a9c0f19bcd40e7650c7fce75e2ebc8c3ab9be00cb55672e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareSeatLaunchAdditions (cyclomatic 46, cognitive 57): prepareSeatLaunchAdditions has cyclomatic complexity 46 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/daemon/src/domain/seat-launch-additions.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d6c7bb28fd085e1bbfa3e256d5f48857f3dcfc85bbef8b421e6bf0adca9569"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 46, cognitive 43): (anonymous) has cyclomatic complexity 46 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":"packages/daemon/src/domain/outbox-handler.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a69ef01ba5f2e79dba836e848c6cf6597182a498225cdc1e91b5386088a75ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function eventSummary (cyclomatic 46, cognitive 31): eventSummary has cyclomatic complexity 46 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/ui/src/hooks/useActivityFeed.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a52178d478491c3ea6ddc1ac982179a59476a249803c6872bbdc0592f68c59"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function workflowDetail (cyclomatic 45, cognitive 98): workflowDetail has cyclomatic complexity 45 and cognitive complexity 98; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/tui/src/execution/workflow-model.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f0ab952c0c3f0e14af57d710f92ab43c0acc0a67f4d44e0e38d50359df5cec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateHostRegistry (cyclomatic 45, cognitive 85): validateHostRegistry has cyclomatic complexity 45 and cognitive complexity 85; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of 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/host-registry.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9609795f6bd506b7ff975eeb48f05cf45be1af9bebb020e5da5aa2844f03e2f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateHostRegistry (cyclomatic 45, cognitive 85): validateHostRegistry has cyclomatic complexity 45 and cognitive complexity 85; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/hosts/hosts-registry-reader.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"288c40e4081211f3246792b22c14e51633c5b24e59a2cbfd124004cdc54337d6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ensureMembershipIndex (cyclomatic 45, cognitive 83): ensureMembershipIndex has cyclomatic complexity 45 and cognitive complexity 83; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":1361}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed710d7ca3eec01764d010b5001f589b599bc9e2328cd108360eae4f13ca9b9c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function diagnosisRequest (cyclomatic 45, cognitive 82): diagnosisRequest has cyclomatic complexity 45 and cognitive complexity 82; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of 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/commands/health.ts"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"f835b1a481a829255eea77a29a55adbcf6804d72eef35e28464b2dd43e75de4b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readWaitingView (cyclomatic 45, cognitive 61): readWaitingView has cyclomatic complexity 45 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/daemon/src/domain/queue-waiting.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"022f5fa25671b5f3c0b298c463922ced38a9b4ca8ea50a51de2faf9f89d56b81"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function observeSeat (cyclomatic 45, cognitive 61): observeSeat has cyclomatic complexity 45 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/daemon/src/domain/seat-activity-service.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d6d9337838387290b9c8d708c7f0ec67f0de5d2f3430471d2df349dd78e644"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reconcileSession (cyclomatic 45, cognitive 59): reconcileSession 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/daemon/src/domain/claim-service.ts"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"3729454c678f87d01b64a3cbf927d585d2d5842507c4d2d6a34542268ac56c1c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 45, cognitive 53): (anonymous) has cyclomatic complexity 45 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":"packages/daemon/src/routes/startup.ts"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"40cd22935d52b7d0227127a299b6db8e9f0f264bbc2a1e7ca5f8146778b563fd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 45, cognitive 52): (anonymous) has cyclomatic complexity 45 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/daemon/test/pi-shell-launch-native.test.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c3c0de72a1092f043bac2d29b820799157d90b0ce9b4bfa12704120ce1d78e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseRunnerArgs (cyclomatic 45, cognitive 36): parseRunnerArgs has cyclomatic complexity 45 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 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":1929}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed767fee9c783ea463dbe322e708bdcdcb6f672d46799237bc9713718088c83"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function printHumanHandoverResult (cyclomatic 44, cognitive 74): printHumanHandoverResult has cyclomatic complexity 44 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/cli/src/commands/seat.ts"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f4d07b45106ecdc9ecd0e7e0ec7953d280f06537c06ffaeebbc2ff637ce3f8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 44, cognitive 66): (anonymous) has cyclomatic complexity 44 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":"packages/daemon/src/routes/rig-cmux.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"927087abaafb3dffb43403453e0b43324803597156a25ae228658e38a01cb9b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 44, cognitive 55): (anonymous) has cyclomatic complexity 44 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/daemon/src/routes/bundles.ts"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d7e539edb3c0e0902fdeb6cf3fc40c24a8862ef04e2760cec3a5c4c4efddc1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 44, cognitive 49): (anonymous) 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/cli/src/commands/add.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"64614a2dc2154dca6150bc759fd429b9d5ace0857dc934213b926690a6ce5556"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 44, cognitive 47): (anonymous) has cyclomatic complexity 44 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":"packages/daemon/test/claude-handover-readiness.test.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac16b01320906640e248711b62723f307654f1f521c589cd61f11d498c571b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evaluate (cyclomatic 44, cognitive 46): evaluate has cyclomatic complexity 44 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/daemon/src/domain/policies/workflow-keepalive.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"491036589de11b3d07d975dcc61db26d7e6a0c5e067f6ad6750d36aa02997370"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 44, cognitive 39): (anonymous) has cyclomatic complexity 44 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 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/daemon/src/domain/rosters.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d54eef5b21cc7acf5283df1dfd558f2254bda45f838ab5b3dde07d42e89a92f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function connectionsProjection (cyclomatic 44, cognitive 37): connectionsProjection has cyclomatic complexity 44 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":"packages/daemon/src/domain/gateway/connections-projection.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89f94f636268befaf9fb6ab56c4b0a238073436f8cd31578ab467975c5fa2ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 44, cognitive 33): (anonymous) has cyclomatic complexity 44 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/daemon/src/routes/rigs.ts"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"498deff4478b88f7c6ca2aa1dd1afdbb7301150482ae72861e0520f5cd31a202"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sendClassified (cyclomatic 43, cognitive 72): sendClassified has cyclomatic complexity 43 and cognitive complexity 72; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/session-transport.ts"},"region":{"startLine":2858}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3addc80f540cf433745b817bb28f4c95932bc7573e94413ec1ffcc2bed647a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 43, cognitive 67): (anonymous) has cyclomatic complexity 43 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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c7669b5d1649d6bbc9e0f94c69a81479f042f6fe9530a2124ea6e395fa400b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function windowLauncher (cyclomatic 43, cognitive 56): windowLauncher has cyclomatic complexity 43 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of 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/terminal-window.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"de074277dcabb2de102c0e8ad32197a9cb924177231176c16330e109baae8dd4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyLibrary (cyclomatic 43, cognitive 56): applyLibrary has cyclomatic complexity 43 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/specs/agents/shared/skills/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"167ee435dcc140107282f60a15eca41c7c98e88783fcfc5f504b2d7355fddfe9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function launchPreset (cyclomatic 43, cognitive 56): launchPreset has cyclomatic complexity 43 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/adapters/community-harness-runtime-adapter.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c1ffc6e5867a1782581dd0c6272103dfe664106f73382787a0f1f76c69ee68"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyLibrary (cyclomatic 43, cognitive 56): applyLibrary has cyclomatic complexity 43 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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/_canonical/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"b939101041c0fa83abb5f1a10fe5d50f08155cdf99ca3e6e6e8eb622eb2c5a93"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rollback (cyclomatic 43, cognitive 48): rollback has cyclomatic complexity 43 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/daemon/specs/agents/shared/skills/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"948f5c6d77d545ce55f936ccd3ea0568cdbcca33e5f96e37e1e517364c8461f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rollback (cyclomatic 43, cognitive 48): rollback has cyclomatic complexity 43 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":"skills/_canonical/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"161dfdea1abc345dc2490fe733d356048380f6a39c6347761bcc2809d9dfc937"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 43, cognitive 42): (anonymous) has cyclomatic complexity 43 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 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/daemon/test/helpers/scenario-pipeline.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"887afb1c6bb57ec2fd6377a667e105af3be41d8a45b1f33b1320530489b35a1e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 43, cognitive 37): (anonymous) has cyclomatic complexity 43 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":"packages/daemon/src/domain/outbox-handler.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6f6d199cfe795bd988a7ad1a998463fc8fda60fe02e46f86aec90dd6d7a42b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanWorkflowSpecFolder (cyclomatic 42, cognitive 95): scanWorkflowSpecFolder has cyclomatic complexity 42 and cognitive complexity 95; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/spec-library-workflow-scanner.ts"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"38d5b8923f7bf7782f525c78333d94b717003c1c962d87b5bee9145fac767c34"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function analyze (cyclomatic 42, cognitive 83): analyze has cyclomatic complexity 42 and cognitive complexity 83; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/assets/plugins/openrig-core/skills/claude-compaction-restore/scripts/restore-from-jsonl.mjs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec7f0c7b97d234473a3eca5c992736108575178fa4d88d97c2735ede330ed68"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function instanceContentLines (cyclomatic 42, cognitive 79): instanceContentLines has cyclomatic complexity 42 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/tui/src/render.ts"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7520716454ec9805ba580507188c739e3ae99053dbbbe4869ea2ef8921d7bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function doctorLegs (cyclomatic 42, cognitive 71): doctorLegs has cyclomatic complexity 42 and cognitive complexity 71; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of 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/commands/host.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8dd2de3624c023bf0f653b8174fa6501cce879019feb8c2e160f9924a5c7a2e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function attemptAction (cyclomatic 42, cognitive 64): attemptAction has cyclomatic complexity 42 and cognitive complexity 64; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/gateway/slack/inbound.ts"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4b15370437986ecfaa9b2fe8ff5696d3bf52fe5db2aba7cdd742a892f3c21de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderTrace (cyclomatic 42, cognitive 55): renderTrace has cyclomatic complexity 42 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/daemon/assets/plugins/openrig-core/hooks/scripts/refocus.cjs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d1ff293be7cdee73accc00ea2f943fba26421a5097525addbd63c0c1f2ae3c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function triggerManualCompactUnchecked (cyclomatic 42, cognitive 55): triggerManualCompactUnchecked has cyclomatic complexity 42 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd017e95245b69375cfd05577090bb6c2d7a967ce3c880af79fcc4d30f5581e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function attempt (cyclomatic 42, cognitive 53): attempt has cyclomatic complexity 42 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":"packages/daemon/src/domain/draft-aware-delivery.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa71d33fc6ba56ae18311d958f60c6b71ce95e4dcbb996838b2fa15359ef21f1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function launchHarness (cyclomatic 42, cognitive 47): launchHarness has cyclomatic complexity 42 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":"packages/daemon/src/adapters/community-harness-runtime-adapter.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf61577b707ca168ee28c387a3a6ec467cb61925862a6830d3bcf63a068ed510"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createApp (cyclomatic 42, cognitive 41): createApp has cyclomatic complexity 42 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 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/daemon/src/server.ts"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e4e9bee5895bcf816abed591d29489281845fce4f9980788620ccb6917e48fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function grantServiceCaller (cyclomatic 42, cognitive 39): grantServiceCaller has cyclomatic complexity 42 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 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/mcp-http.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d76b49d4d994c79dacc21061d0aa7e2ac07dccb38add5a48028d155a361bae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function TerminalLauncher (cyclomatic 42, cognitive 39): TerminalLauncher has cyclomatic complexity 42 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 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/ui/src/components/topology/TerminalLauncher.tsx"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb6d08a1b025aa87bf97b3a5041642e032cd488c2863f9917926a78a8f7ea66"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function noteEndedPreparation (cyclomatic 42, cognitive 27): noteEndedPreparation has cyclomatic complexity 42 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":2235}}}],"partialFingerprints":{"codehealthFindingId/v1":"23aa01334cf4ba0dda8166ecb74156b74c15f8555915e60047ad7ec0122a4674"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatBundleBehaviour (cyclomatic 41, cognitive 76): formatBundleBehaviour has cyclomatic complexity 41 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":"packages/cli/src/bundle-behaviour.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba5697886671f80eb06e1f89393bb9d294661e8a928064b45f16e61088b38b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evaluateOnce (cyclomatic 41, cognitive 62): evaluateOnce 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/daemon/src/domain/health-diagnosis.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"05fe5a8a0b248bcb38b13287693c35672a60a83b1a2bd4e01afa658b55530ee3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function projectEntry (cyclomatic 41, cognitive 58): projectEntry has cyclomatic complexity 41 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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":1460}}}],"partialFingerprints":{"codehealthFindingId/v1":"890d6d82bf43ae84b5888ec72e0ccfd7d65aeedebcda28ee50653922d7ed3e32"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drainPendingStage (cyclomatic 41, cognitive 53): drainPendingStage has cyclomatic complexity 41 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":"packages/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"9237dc15be471c46177fb264c4f90694e9a1c9dc9d7cca01d11af89f7c9e2cfd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function attemptBot (cyclomatic 41, cognitive 52): attemptBot has cyclomatic complexity 41 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/daemon/src/domain/gateway/slack/inbound.ts"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a5de33cd8e2761a4c75862c365aeae53767396d891ea46f7bbdf0363abf591"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveHumanDeliveryReadiness (cyclomatic 41, cognitive 50): resolveHumanDeliveryReadiness has cyclomatic complexity 41 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/daemon/src/domain/gateway/human-readiness.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5fe619ed89d6236f3d09bb6388eb927c871093307ad5266f05fc75811fd35b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dispatchEscalation (cyclomatic 41, cognitive 50): dispatchEscalation has cyclomatic complexity 41 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/daemon/src/domain/gateway/operator-delivery-engine.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ee5fc59289cbcb8a91467c7d9bb8dbb3e77de40e7eb7b891441873db6ef97f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 41, cognitive 49): (anonymous) has cyclomatic complexity 41 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/daemon/src/domain/gateway/relay-outbound.ts"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a60605f16d160dc314508887122facec8cd212a525a5cb41f87df34e7d9698"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function approve (cyclomatic 41, cognitive 48): approve has cyclomatic complexity 41 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/daemon/src/domain/scope/scope-approve.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"d722f00c270e52da104057c8d699f1e35637d297f38c3a37d7340cfdc7efdbf7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function routed (cyclomatic 41, cognitive 45): routed has cyclomatic complexity 41 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":"packages/cli/src/commands/stream-outcome.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90daae0adbc0912b1b54a9865ebd908c2b90763c24705c83cfc5bd2e57f35e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function judge (cyclomatic 41, cognitive 45): judge has cyclomatic complexity 41 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":"packages/cli/src/decisions/decisions.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"6401533de305afb6a39518cd81aa59bc1091e2a0ada0ee922d55481ba466f7fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 41, cognitive 44): (anonymous) has cyclomatic complexity 41 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/daemon/test/native-claude-delivery.test.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77586efa32a45eeb76d34ce89cfee88900af494fc6b277cb60b182b28374bfb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function register (cyclomatic 41, cognitive 43): register 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/daemon/src/domain/watchdog-jobs-repository.ts"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef1a2faa1677ccfbb412ea48f4b0c6cec8e9c27c3270ae5c551a9fce84da32d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sendInteractiveText (cyclomatic 41, cognitive 42): sendInteractiveText has cyclomatic complexity 41 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/daemon/src/domain/startup-orchestrator.ts"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f19a539c84c8c868590c66df21365802b288cf1ae8778fc22a5c5c029dc6767"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reviewSelectedHistory (cyclomatic 41, cognitive 41): reviewSelectedHistory has cyclomatic complexity 41 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/daemon/src/routes/startup.ts"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"828e64a71fb66ec8b6a5ddd3e76b5f0018f690563f5e519ee9f8b02a991d9e19"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function HybridAgentNodeInner (cyclomatic 41, cognitive 40): HybridAgentNodeInner has cyclomatic complexity 41 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 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/ui/src/components/topology/HybridTopologyNodes.tsx"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"544c00cab97351e10b670f5ff09d3dbb46211f7f63bf27cf52792a4d4a5f8326"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildInventoryItem (cyclomatic 41, cognitive 38): buildInventoryItem has cyclomatic complexity 41 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/daemon/src/domain/node-inventory.ts"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bfe4d3e504ecb262d74dd154587253f10171bf87701d27bd80d3658d5b8d2ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 40, cognitive 72): (anonymous) has cyclomatic complexity 40 and cognitive complexity 72; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/session-transport.ts"},"region":{"startLine":3159}}}],"partialFingerprints":{"codehealthFindingId/v1":"178f1fe7f423f508f890f4573dd3d63bc8dc78ef7e4e7940285f0ab6bfdd929f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setHumanField (cyclomatic 40, cognitive 59): setHumanField has cyclomatic complexity 40 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/daemon/src/domain/gateway/human-registry.ts"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c8707534914d01c8caed4cc3c1e5c9317b12061e2fcf077cd791d2e2dcd893"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 40, cognitive 53): (anonymous) has cyclomatic complexity 40 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":"packages/cli/src/commands/host.ts"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ebb1bd4d694aa434ab11a56b719d57af0e22f6f17067ce41337c6f5536057fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function beforeInput (cyclomatic 40, cognitive 53): beforeInput has cyclomatic complexity 40 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":"packages/daemon/src/domain/seat-delivery-guard.ts"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"a33dec89d6769e93cd8e5d19b176b1d28a6b9656a88065881f6274bcb7126708"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validate (cyclomatic 40, cognitive 53): validate has cyclomatic complexity 40 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":"packages/daemon/src/domain/workflow-validator.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"153a17223c51655c84b054649cea619059bbfef4a046c28b5296cbadc728ccef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function route (cyclomatic 40, cognitive 51): route has cyclomatic complexity 40 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/twin/fetch-stub.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eee33894886129527ebeab0832054625efbb6ac3fab75c0c8d060d2dffb98a8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 40, cognitive 47): (anonymous) has cyclomatic complexity 40 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":"packages/cli/src/commands/exec.ts"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0be57c5f24348bd803077225043c62c2403b93d4aa78e5a61b0e1c409ad57b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runHttpHostSend (cyclomatic 40, cognitive 47): runHttpHostSend has cyclomatic complexity 40 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":"packages/cli/src/commands/send.ts"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e8e4985f7ff6a727e4d7783dac67cb75ae1847a5602ff2ba12c35328ae69127"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function probeSessionActivity (cyclomatic 40, cognitive 47): probeSessionActivity has cyclomatic complexity 40 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":"packages/daemon/src/domain/session-transport.ts"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2151a88c3f0989769fca484d2a570c2191aec492d4ffcd46f188e61aaeb9967"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateWatchdogJob (cyclomatic 40, cognitive 46): updateWatchdogJob has cyclomatic complexity 40 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/daemon/src/domain/watchdog-job-update.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"721f83cf2c04e9e5567b259d5280d3f0de176711603ff53f3730263d1b342c1b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildCodexResumeDisplay (cyclomatic 40, cognitive 37): buildCodexResumeDisplay has cyclomatic complexity 40 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":"packages/daemon/src/domain/native-resume-probe.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce07fb5388924da90b2c35a192e259b5f1288956068bfcd049374c7450c66193"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordAttempt (cyclomatic 40, cognitive 36): recordAttempt has cyclomatic complexity 40 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 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/daemon/src/domain/watchdog-policy-engine.ts"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"925a15cb4fe7670588351f75fb20ac67ee7c37b084e8ebb34cd38999a5ef1166"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reportEvidence (cyclomatic 40, cognitive 34): reportEvidence has cyclomatic complexity 40 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 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/daemon/src/domain/seat-activity-service.ts"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"b360038b4c9709a4ded829a1a1f4f1fe90fcccad29f708d9ca7d0bb45465638d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reconcileSweep (cyclomatic 39, cognitive 57): reconcileSweep has cyclomatic complexity 39 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/daemon/src/domain/seat-identity-reconciler.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"02881760810a4375a13c65f4db6cc871d0d8a0dce99455f232714314a5a2e10c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fn (cyclomatic 39, cognitive 52): fn has cyclomatic complexity 39 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/daemon/src/domain/gateway/slack/slack-delivery.ts"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"c443a7c2c683d260fcde4ed335a674c0271d5fe9b543bc5205cdb601aa278c7b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addMemberToPod (cyclomatic 39, cognitive 50): addMemberToPod has cyclomatic complexity 39 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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e0e67c875d99b5eb71cda5051497e5c078ad4d3c4583d0e7bdd475c77b1deb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createSuccessor (cyclomatic 39, cognitive 47): createSuccessor has cyclomatic complexity 39 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":"packages/daemon/src/domain/successor-session-launcher.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"c510a6745a66f222741338e0afb561ba163ceba34154498e352865c4f4212705"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 39, cognitive 47): (anonymous) has cyclomatic complexity 39 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":"packages/daemon/src/routes/up.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"69daae75e62bb3c4c63ab0efd0c0c8883ffa6e1a583ad023cd5acd121ef59ac8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseManifest (cyclomatic 39, cognitive 45): parseManifest has cyclomatic complexity 39 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":"packages/daemon/src/domain/context-packs/manifest-parser.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd273de7d410196bf7938f93e0b8e45748490006f0a4b566977eb55fe4e8c9d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readStartupContext (cyclomatic 39, cognitive 44): readStartupContext has cyclomatic complexity 39 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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":2187}}}],"partialFingerprints":{"codehealthFindingId/v1":"af5af2507eef39bb5415e4fa6f8f87fbfb97fe87e972e05985df31de952662bc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sliceDetail (cyclomatic 39, cognitive 42): sliceDetail has cyclomatic complexity 39 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/tui/src/execution/execution-model.ts"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"01deb9b47ecaef5c70727d2d82bc561f4877edf12a2dd2de895acb93b7b2b613"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mapPiEvent (cyclomatic 39, cognitive 39): mapPiEvent 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfaa92a4a1052078c8fdf1024e8cd37fcb828d7170b5b46284317142b32f676c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 39, cognitive 37): (anonymous) has cyclomatic complexity 39 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":"packages/daemon/src/domain/graph-projection.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"886a4934d1726d735d918dafd01d1b426faac074032905720d48a0069bbede2d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function followPackagedSeatSkills (cyclomatic 38, cognitive 82): followPackagedSeatSkills has cyclomatic complexity 38 and cognitive complexity 82; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"a45a04ef91b8ad2dbbe97b0d476a24c4b41618aa0b35e6572f8f7b440d26fe58"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 38, cognitive 65): (anonymous) has cyclomatic complexity 38 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/daemon/src/routes/rigspec.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7b8c20e0b6a8f0ec51e55e9597e97113f70a33c3711cf9482a3ba299299f1a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function analyzeWalkSuffix (cyclomatic 38, cognitive 60): analyzeWalkSuffix has cyclomatic complexity 38 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":"packages/cli/src/lib/walk-consumption.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"651c9be3688a79af788aa7ae3b4388ef401f548e2d2089e12ec30f7e401e91e4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function consumeAuthorBundleYaml (cyclomatic 38, cognitive 60): consumeAuthorBundleYaml has cyclomatic complexity 38 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":"packages/daemon/src/routes/bundles.ts"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7aae33f55ee4e5dea1e29f3949a6e115f2883eabc0b7d30d30a45132602c537"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateLegacyBundleManifest (cyclomatic 38, cognitive 58): validateLegacyBundleManifest has cyclomatic complexity 38 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/daemon/src/domain/bundle-types.ts"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bcb7d633d46e73003bb7291d2722e0cc93b3e31c193e139b87c8a66892d0538"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function installRigMods (cyclomatic 38, cognitive 58): installRigMods has cyclomatic complexity 38 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/daemon/src/domain/terminal/herdr-app-install.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"153a57ca494bbde8df7fd16f1a080de808459245326151e8fed38a4834a0e733"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateRelayOutboundEnvelope (cyclomatic 38, cognitive 55): validateRelayOutboundEnvelope has cyclomatic complexity 38 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/daemon/src/domain/gateway/relay-outbound.ts"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"f21386b2cddec8357990739c8dbfe07d398373fdb761acbe665e6bd835d16dd7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function projectEntry (cyclomatic 38, cognitive 52): projectEntry has cyclomatic complexity 38 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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c12c23d5c912518e8178a43d82ecf30e4468d076ed619b977c7008f9eb79c7e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 38, cognitive 51): (anonymous) has cyclomatic complexity 38 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of 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/commands/bundle.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38999f270bf6f442958ab3ca8a27bbac49c2d82be56bc5e5d300c6800f6f1f3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function unregisterWorkflowSpecs (cyclomatic 38, cognitive 48): unregisterWorkflowSpecs has cyclomatic complexity 38 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/daemon/src/domain/workflow-spec-unregister.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc27ea2c1388ddfe9043ca48f604d399b3a9316c8dd56334a1c288cefb220321"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildStorytellingFeedItems (cyclomatic 38, cognitive 46): buildStorytellingFeedItems has cyclomatic complexity 38 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/ui/src/components/feed/cards/storytelling-cards.tsx"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d1a45081b3870cc00897f15fb6eb055ae2f7659e09fe9e60d05d01280c9965"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 38, cognitive 42): (anonymous) has cyclomatic complexity 38 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/commands/fork.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae1557048c6d964061e811b7bcc1d6f542020bf37aa1f47d698ae8a10740efc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordJudgment (cyclomatic 38, cognitive 41): recordJudgment has cyclomatic complexity 38 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/daemon/src/domain/proof/judgments.ts"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"02bce1cff5983cba8ec6b91ecff1c57e26e98ecaa25b4b1d3e617d2c73e58301"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reconcileNodeRuntimeTruth (cyclomatic 38, cognitive 40): reconcileNodeRuntimeTruth has cyclomatic complexity 38 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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":2979}}}],"partialFingerprints":{"codehealthFindingId/v1":"5462f1312ef9869aefab2999a63003cfee75b2c37cd264c170f03deb38c3a9c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveIdentityVerifiedClaudeRecord (cyclomatic 38, cognitive 39): resolveIdentityVerifiedClaudeRecord has cyclomatic complexity 38 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/daemon/src/domain/model-divergence/current-generation-record.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d3dee158406421da6ddcd63e50c1e4c682225d1d0e4e6e8ecbdf7fdebb8883d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 37, cognitive 65): (anonymous) has cyclomatic complexity 37 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/daemon/src/routes/sessions.ts"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b98bc398b2e834bea261875edf84890d369435344b1beb9b31e115c737f01b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseClaudeTokenUsage (cyclomatic 37, cognitive 64): parseClaudeTokenUsage has cyclomatic complexity 37 and cognitive complexity 64; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/provider/claude-token-usage.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c93d222e3fccb69fdd900f0d118ec1665442d8c451ffa23ed9023dbc466524"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createSessionUnchecked (cyclomatic 37, cognitive 56): createSessionUnchecked has cyclomatic complexity 37 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/adapters/tmux.ts"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"110ff361ea21428f747af7163f0442b71badaf76e094da693d1750c46356a01f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 37, cognitive 53): (anonymous) has cyclomatic complexity 37 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":"packages/daemon/test/community-harness-dsh-example.test.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b1d03b36c6dbc7cc06bc973aeb5d0726e76f2fa2d81a2a446f4b8c3dd64e2a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolve (cyclomatic 37, cognitive 52): resolve has cyclomatic complexity 37 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/daemon/src/domain/native-permission-store.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"058e0ad7997938fa2e269f2e9c4ef13c01776d49706587f4d094313b7a54763b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyResume (cyclomatic 37, cognitive 51): verifyResume has cyclomatic complexity 37 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/adapters/codex-resume.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c86b10b4599664697130207b4e386b86c6f4a2fb8fa28bcc8a30b2a992210e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deliveryResolutionEvidence (cyclomatic 37, cognitive 48): deliveryResolutionEvidence has cyclomatic complexity 37 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/daemon/src/domain/queue-stuck-sweep.ts"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"d11bdaee4e4c05223baa6f8eacc651951792d600c3d6f24b0b9323415e228c6b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 37, cognitive 42): (anonymous) has cyclomatic complexity 37 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/daemon/src/adapters/tmux-control.ts"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b14bdfa7f678db4129f5b905b71b05f6361ad6c4eb4014d4d36df93a7f913d1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handle (cyclomatic 37, cognitive 40): handle has cyclomatic complexity 37 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/test-system/delivery/stand-ins/core.mjs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"8718a7c39a323889711a565005dc4b58d4f7c2f38004c5c72b080b95a6504c3e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 37, cognitive 38): (anonymous) has cyclomatic complexity 37 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/commands/watchdog.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac13a97d53cb865a3a1147b62dc3c11d0e77f8a2e683838ed626cd548d77528"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 37, cognitive 36): (anonymous) has cyclomatic complexity 37 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 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/daemon/src/routes/watchdog.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af89ff88adb42e7ee83ef4dd276fbdcd6c1fddd19cf9f286e08c3f89b30d2b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function launchFirstMaterializedNode (cyclomatic 37, cognitive 35): launchFirstMaterializedNode has cyclomatic complexity 37 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 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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde5a38f2d2b6122ab9a5c01d70afc63363266718bbc7028a283ed1f089d8f93"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function MissionScopePage (cyclomatic 37, cognitive 34): MissionScopePage has cyclomatic complexity 37 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 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/ui/src/components/project/ScopePages.tsx"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"715a7874ccc9e5963b434331d00b60980ea8612966b4991ece9b305859430485"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runNetworkBindingPass (cyclomatic 36, cognitive 77): runNetworkBindingPass has cyclomatic complexity 36 and cognitive complexity 77; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/network/network-connector.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3fd75fe4985db406e5817a76c3894069f95a4375f975f5e5d85b304055dc31a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectReactiveEventSignals (cyclomatic 36, cognitive 54): collectReactiveEventSignals 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/daemon/src/domain/provider/reactive-tap.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"daefce26480f7901110cbfda572b985ecf8913af26f10adbf316258bc66249ea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startupLines (cyclomatic 36, cognitive 54): startupLines 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/tui/src/startup.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd034c2f70c4afc53e05120d4b753d24dad2c38e8045caa9917355323187511d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sendAfterHook (cyclomatic 36, cognitive 53): sendAfterHook has cyclomatic complexity 36 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":"packages/daemon/test/claude-conversation-rotation.test.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf28b755355044f8a37875f005c106f261c32980fe5d50da16f2f0ba949483d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function postureCheck (cyclomatic 36, cognitive 47): postureCheck has cyclomatic complexity 36 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":"packages/cli/src/commands/host.ts"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed9785d5211207192b306b6d4c3c013039a24020d0e18caaf0c677db967e179"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 36, cognitive 45): (anonymous) has cyclomatic complexity 36 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":"packages/daemon/src/routes/queue.ts"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"8781b921f1227854b29f8cca26c884d524df8f187f9eb4fab1915ba34275f1b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 36, cognitive 44): (anonymous) has cyclomatic complexity 36 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/commands/adopt.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a91f9d8767d5289e92c200941ea48b2ef7567dded6c920f6413a368f06137a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function seatLoadout (cyclomatic 36, cognitive 44): seatLoadout has cyclomatic complexity 36 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/commands/skill.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc122ede544ce2caf1f0f4af2b03e396d51e752727843921aa7c2ce538347041"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 36, cognitive 40): (anonymous) has cyclomatic complexity 36 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/daemon/src/domain/workflow-projector.ts"},"region":{"startLine":1330}}}],"partialFingerprints":{"codehealthFindingId/v1":"df26525e80fb4bd10f60669add0d34ea5ac462200a04c15aa055deafc2a35bf6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 36, cognitive 39): main has cyclomatic complexity 36 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":2252}}}],"partialFingerprints":{"codehealthFindingId/v1":"96eea9369ebcfae999447920f5e7e8b9ff6d8a5c2aee71191fb4b55c4d987000"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 36, cognitive 33): (anonymous) 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/daemon/src/domain/seat-runtime-switch-service.ts"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcff082f95793aa30c44d4d63b57c5c10fd508b407b95f2257a845d2b19f700b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function BundleInspector (cyclomatic 36, cognitive 33): BundleInspector 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/ui/src/components/BundleInspector.tsx"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"b14ac64f18f6c892e6d36e451c697545015c12dfd9b98a221093042a3f64a07f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function safeValue (cyclomatic 36, cognitive 32): safeValue has cyclomatic complexity 36 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/daemon/src/domain/user-settings/settings-browser.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"3808e6ed4e1fede27c293192c3116cb051685b751cd553f9e787b33f9599ecb3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function push (cyclomatic 36, cognitive 28): push has cyclomatic complexity 36 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/daemon/src/adapters/omp-rpc-frame.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a263a2b8df7fe018063a16ff5dafcebf0f7dacbe03b3e2a432cf47bf2ed6e6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderStatusHuman (cyclomatic 35, cognitive 61): renderStatusHuman has cyclomatic complexity 35 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/commands/provider.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcdd425c5a6c92f8429b48428d214b2d43aeae76818b01a37180c42ae9e31d2f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 35, cognitive 61): (anonymous) has cyclomatic complexity 35 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/commands/scope.ts"},"region":{"startLine":1271}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb16a5d8f3a7b4a3d675efe17d1fdc9d14c18a946f6b32ca1f1b76b02890c07"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function plan (cyclomatic 35, cognitive 57): plan has cyclomatic complexity 35 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/daemon/src/domain/install-planner.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd6c868a4bdaa705572a01eb3bed8299e153b61a22046ac1ef0116eb66e39ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function references (cyclomatic 35, cognitive 57): references has cyclomatic complexity 35 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":"scripts/check-first-run-references.mjs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d418aa8319c3f5a5495fd8808417350327e405dae87f82c34c8755e3d4a569"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function postOpenAsks (cyclomatic 35, cognitive 56): postOpenAsks has cyclomatic complexity 35 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/gateway/slack/open-asks.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d9882524c3e3988ca9aed5a8f7f28d6861343373c70fa1254615249b1fa2e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cleanSeatSkills (cyclomatic 35, cognitive 52): cleanSeatSkills has cyclomatic complexity 35 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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b3c795d0724fe33d0735a1c28e831250a9c6243ab5595780681ef9da30ef24"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 35, cognitive 49): (anonymous) has cyclomatic complexity 35 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/daemon/src/domain/gateway/relay-inbound.ts"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"96798fe5a35562a3b2dc9c56ac91429d2b659df3e7b762f440f3d9873fd74069"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeRunnerObservations (cyclomatic 35, cognitive 48): normalizeRunnerObservations has cyclomatic complexity 35 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/daemon/src/domain/agent-activity-store.ts"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"00869d128a1d6701b083cf3af03b5c1787d4fb27d99c0df0b67c7b2c5ff3114f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function draw (cyclomatic 35, cognitive 44): draw has cyclomatic complexity 35 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/tui/src/main.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8fd70f02657530f4fdc0d1de7ea8bb96a37da24bb916231193a5119ec6c151"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function askLiveRunner (cyclomatic 35, cognitive 41): askLiveRunner has cyclomatic complexity 35 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/commands/ask.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e4d26a731057980f6784baad5de03fd04f5b8bdcd0d443d2764780ba921ed2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 35, cognitive 40): (anonymous) has cyclomatic complexity 35 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/daemon/src/domain/gateway/slack/slack-subsystem.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"27fc9d40f761d30961eafd6d3f87a7cbddcc6ce3a78e12388b8bef7b35b204ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function errorResponse (cyclomatic 35, cognitive 40): errorResponse has cyclomatic complexity 35 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/daemon/src/routes/projects.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a495e9644b9d59ea3033d75cecc1c195da5575bd88544c9aa0127b39412991d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function describeLineageFailure (cyclomatic 35, cognitive 39): describeLineageFailure has cyclomatic complexity 35 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/daemon/src/domain/seat-attention-reconciler.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"b353fa908741420baed2bcc80ce93ef588623e1e4b7d4b4820ebfb6c084f3126"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 35, cognitive 37): (anonymous) has cyclomatic complexity 35 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/commands/attach.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a5ea159e0ede67cfa2762714da57d5abbce35b2d90ce0f22eaffaec15e067f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function overviewLines (cyclomatic 35, cognitive 36): overviewLines 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/tui/src/execution/execution-model.ts"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ab4db38b448280bfa1f3578a0799fdbc3de52ae91d129cfb4fc8d641b7d79e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 35, cognitive 34): (anonymous) has cyclomatic complexity 35 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 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/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":1886}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1583e9a3069d0156c9a35b535038a491c72c77766c89be215fb2cdfd40b1449"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 35, cognitive 33): (anonymous) has cyclomatic complexity 35 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/daemon/src/routes/discovery.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"671143bf026f278e61c110bddb4ed04016d07e1a8c64d8dbc08ffcf0744f4500"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function notifyOccurrence (cyclomatic 35, cognitive 32): notifyOccurrence has cyclomatic complexity 35 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/daemon/src/domain/health-diagnosis.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ed83da5e8509fc0057683ea097e6dbd7b4178bc2e9e72e88876e04a45c2626"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 35, cognitive 32): (anonymous) has cyclomatic complexity 35 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/daemon/src/domain/transcript-rotation.ts"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"45d562c9cb2c3988bd33290f330cc52d31c56a53778544f1c9bfb7e116ca343d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readTelemetryPage (cyclomatic 35, cognitive 30): readTelemetryPage has cyclomatic complexity 35 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 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/daemon/src/domain/finite-telemetry.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"5048b8a99cc89c6f525735e0e469f0210363fd6865534b98fb4239e3c675198f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildAcceptance (cyclomatic 34, cognitive 63): buildAcceptance 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/daemon/src/domain/slices/slice-detail-projector.ts"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"d417d845af86df17e1594f6cc7e1c56ba4e06bab01dbeb765c657800756ff0bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 34, cognitive 60): (anonymous) has cyclomatic complexity 34 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":"packages/tui/src/stylize.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"3676799a2550784a378be943ed8db44a34860f4d16b5abcdd2c0e761e94341d5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 34, cognitive 52): (anonymous) has cyclomatic complexity 34 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/acp/agent-server.ts"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb276c17a411c06e2350a127aa46cb7540a650d17f669e0e643291b55d30ae4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drillTo (cyclomatic 34, cognitive 50): drillTo has cyclomatic complexity 34 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/tui/src/state.ts"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c7c67260c16aa75dcf91f970b0ac15c371b71e9f16bffd78f785ff307cd909"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recoveredConversation (cyclomatic 34, cognitive 48): recoveredConversation has cyclomatic complexity 34 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/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2f754f28586a7db4d7b4d27653287adc322de5cd798a4f073ba5341498c1aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderTraceTree (cyclomatic 34, cognitive 45): renderTraceTree has cyclomatic complexity 34 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":"packages/cli/src/commands/workflow-render.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0dc23b4e7c8de1bfafdd08af2da7418074c4b3ba555146f780c694e7b11f00a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 34, cognitive 45): (anonymous) has cyclomatic complexity 34 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":"packages/tui/src/hydrate.ts"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"afea5dd0288124b88958a84ba7adae1a28f6f96638bfba5b4ea5bd73d54310d8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 34, cognitive 44): (anonymous) has cyclomatic complexity 34 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/commands/bundle.ts"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"1becde3ea07c918391740821561c7bae30370620aff7e88858b52eb730002d25"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderUsageRow (cyclomatic 34, cognitive 44): renderUsageRow has cyclomatic complexity 34 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/commands/provider.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e0b5c205d847956936a61d23c1b142c1066fece904b04eaa9796faca016343b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function switchHeld (cyclomatic 34, cognitive 43): switchHeld has cyclomatic complexity 34 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/daemon/src/domain/provider/claude-seat-switch.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb81d252e21e4b81072b14263996e3bf1e34a512afa54f78862383b3dbb4f70"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function read (cyclomatic 34, cognitive 42): read has cyclomatic complexity 34 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/daemon/src/domain/runner-permissions.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"986c52275160f6f8ced44f823874b8903d4f5e9460d5b69c80fa44b1a098c1ad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 34, cognitive 40): (anonymous) has cyclomatic complexity 34 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/test/start.test.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"32fe429b3d375e715a86de42b131984da232de66b8c5a1e11d7f654794d5bc06"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function admittedRules (cyclomatic 34, cognitive 40): admittedRules has cyclomatic complexity 34 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/daemon/src/domain/permission-stop-observation.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f649a7c09991d6d29517bddd00e8af8fe5abe61e1cb3dc78f85cdd41132447"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 34, cognitive 35): (anonymous) has cyclomatic complexity 34 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/daemon/src/routes/proof.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"473110a116b889cb05d9a9009515a9cfaa900a1094f478eb34eca6c6bc60211f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SliceScopePage (cyclomatic 34, cognitive 33): SliceScopePage has cyclomatic complexity 34 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/ui/src/components/project/ScopePages.tsx"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"04513239c1d22a35881355478a5d966ce0ee48dcd80cf8bc2f1b8c64ca3d417e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 34, cognitive 31): (anonymous) has cyclomatic complexity 34 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/daemon/src/domain/rigspec-exporter.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"b60896ea33c28c585163a156e2edab95a21fefb25382222643bcc37805998c89"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 33, cognitive 63): (anonymous) has cyclomatic complexity 33 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/commands/roster.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eec9bf38180024879e9d53bf72d0815256e640159f46c432e4d5ac32874ce72"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deriveWorkCandidates (cyclomatic 33, cognitive 62): deriveWorkCandidates has cyclomatic complexity 33 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/daemon/src/domain/current-work.ts"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc2b0534e42471f8256d26b60eb715e2aa96e7ee4a332748549bc40309062b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordReaderAction (cyclomatic 33, cognitive 47): recordReaderAction has cyclomatic complexity 33 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":"packages/daemon/src/domain/stream-reader-actions.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"be3c7d9891a934db52a3eccc639af3e63033d642d5c4d4ad2e551f6e638cac57"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 33, cognitive 45): (anonymous) has cyclomatic complexity 33 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":"packages/cli/src/commands/provider.ts"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde99704a67dc799b0a2c65af5a490e4f920e48f3278b21ae92c5be630cc572e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function excludeNewGeneratedFiles (cyclomatic 33, cognitive 45): excludeNewGeneratedFiles has cyclomatic complexity 33 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":"packages/daemon/src/domain/generated-file-hygiene.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccfdb03ef68adaea657b2a36af66ea00b5513595790ac3f983e2f54c64e63f61"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function allowanceLines (cyclomatic 33, cognitive 43): allowanceLines has cyclomatic complexity 33 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/tui/src/usage/usage-model.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"451353ba9c75736229ae14e0d337c981777d106a7ea4cd8ecf387838b9e630b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function beginPreparation (cyclomatic 33, cognitive 39): beginPreparation has cyclomatic complexity 33 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":1599}}}],"partialFingerprints":{"codehealthFindingId/v1":"8066758d7dd321abeb55e752d14aa15277e9096f8b4a38eada9bc7223d101391"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function finishJoinedResume (cyclomatic 33, cognitive 39): finishJoinedResume has cyclomatic complexity 33 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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":2647}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4291213c804c89e1f534a5c1c71b39ba5ef09040e8b3c48839b51630e262edc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deliverPreparation (cyclomatic 33, cognitive 36): deliverPreparation has cyclomatic complexity 33 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":1706}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75300fd79df68be860d9b3eabfcc3830e33aa6294ed34da94c83b1e45c3045a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveExpectedConversation (cyclomatic 33, cognitive 36): resolveExpectedConversation has cyclomatic complexity 33 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/daemon/src/domain/expected-conversation.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"735076b05c120b06295687b4527591bf4de5da4d71aed782905973ca252d654f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validate (cyclomatic 33, cognitive 34): validate has cyclomatic complexity 33 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/daemon/src/domain/health-checkpoints.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"3205f831101bf48d551ef1c7dc8f4d4e6443c8b7252ed09de2dd3cb180fbf04c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ringHostedWake (cyclomatic 33, cognitive 34): ringHostedWake has cyclomatic complexity 33 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/daemon/src/domain/hosted-wake.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e4c95f8ca8113c14043bacec9f4e6764259ab16be999b09df9dcc9e46a9934f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 32, cognitive 58): (anonymous) has cyclomatic complexity 32 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/commands/rig.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"924609b7463662a67b29f3c61697b8d65b5a6128fa368a692f39d216d4be23c1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 32, cognitive 52): (anonymous) has cyclomatic complexity 32 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/commands/rig-mode.ts"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e4de21532ea6cf49af16c6a6ae972ae6095a3bcf55e3be6b1423303c14a1da7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function settleOne (cyclomatic 32, cognitive 52): settleOne has cyclomatic complexity 32 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/daemon/src/domain/gateway/slack/settled-asks.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"a02ceceac1da5556f2a7310af6721f6b39a9890eebe7396c7d0880e83308b0dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 32, cognitive 46): (anonymous) has cyclomatic complexity 32 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/daemon/src/domain/watchdog-delivery-receipts.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"339820012c4d8019a2a14880c9ae8a31a05c2d988b6cd4f5064429078bb73ae5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deliverWakeIntent (cyclomatic 32, cognitive 44): deliverWakeIntent has cyclomatic complexity 32 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":1695}}}],"partialFingerprints":{"codehealthFindingId/v1":"bced6256e05772042c1b405df961846fba1a60998f357b7423de194daca52e29"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 32, cognitive 43): (anonymous) has cyclomatic complexity 32 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/commands/setup.ts"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"92dda9cb3b0e5c4efa9c2ce89722148fcf28a5bc2b2067d9816efd3e2907d483"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 32, cognitive 43): (anonymous) has cyclomatic complexity 32 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/daemon/src/routes/transport.ts"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"bacd4af49da5c7ee9c2dd5e83132dbe97917aa269868a0de256de6020cd3b6d0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 32, cognitive 42): (anonymous) has cyclomatic complexity 32 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/daemon/test/refresh-probe-cleanup.test.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f25fb09a8ec750ffd15bdb0a9e00d4e29530f2993c20e95eb5e2337a2be4aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 32, cognitive 41): (anonymous) has cyclomatic complexity 32 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/test/bundle.test.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c516e11f5629f6f2479c066c625be089eee6e303b857855c8bede8d901761a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateCodexMemberPermissions (cyclomatic 32, cognitive 38): validateCodexMemberPermissions has cyclomatic complexity 32 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/daemon/src/domain/codex-member-permissions.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f0c35936b922617867750096e5d43e5574f1832e49d17887faf4322ec9ee9d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setCwd (cyclomatic 32, cognitive 38): setCwd has cyclomatic complexity 32 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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d8eeb2c2520a3d0f3698e2456ac54b4b66c82484f6ae4d79b130ceaeca9a4e0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runAcpAssignment (cyclomatic 32, cognitive 37): runAcpAssignment has cyclomatic complexity 32 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/acp/connector.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"20afcba4406e871ce0d2de2cce95de866dc325316db069a88e6aff63ecefea37"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 32, cognitive 36): (anonymous) has cyclomatic complexity 32 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/daemon/src/routes/stream.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e55cc41282f951d97f4379bfc2e1706a8146f327893d04e0a58b9d41541f74"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readThrough (cyclomatic 32, cognitive 34): readThrough has cyclomatic complexity 32 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/daemon/src/domain/workflow-spec-cache.ts"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b56a64b8b0cf5c63bc33e067965eaa9e0454f8637f98f616505817426250f73"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function finalizeWithDiscovered (cyclomatic 32, cognitive 32): finalizeWithDiscovered has cyclomatic complexity 32 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":"packages/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf4c29c4169ad72dfa74c531d0082a56c2bbba849c79203e6b72f403c7f89ac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function listSharedHistories (cyclomatic 32, cognitive 32): listSharedHistories has cyclomatic complexity 32 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":"packages/daemon/src/domain/shared-history-selection.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd136239688dad45fd07f4d1d7b73b23887bd70fe8b5f9b0895c5666ba23822a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rowToNode (cyclomatic 32, cognitive 31): rowToNode 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/daemon/src/domain/rig-repository.ts"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7987d0922f904a8aeff71d8973c29df028651f3ae18c4c28d3176fb26e27102"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 32, cognitive 29): (anonymous) has cyclomatic complexity 32 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":"packages/daemon/src/routes/queue.ts"},"region":{"startLine":1559}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4454f08804d323c79f7adb6a105974e4d9475fd3d74ef5ab39eb684b9d852c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bindingMatch (cyclomatic 32, cognitive 26): bindingMatch has cyclomatic complexity 32 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/daemon/src/domain/activity-grants.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70277426b5a0906b07326f59aad1fe94a5aaea5f858d60f4fd9dbd61d97b647"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function managedSystemWorldState (cyclomatic 32, cognitive 25): managedSystemWorldState has cyclomatic complexity 32 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 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/daemon/specs/agents/shared/skills/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"a03ac5758c1e0054931fd096738d66b78920baee175e43a0a56b6b7e759911f4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function managedSystemWorldState (cyclomatic 32, cognitive 25): managedSystemWorldState has cyclomatic complexity 32 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 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":"skills/_canonical/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"deadf5ee59f7a8cc4711ab47974f11075c775935ee9443100e93a56d69251750"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function wake (cyclomatic 31, cognitive 62): wake has cyclomatic complexity 31 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/daemon/src/domain/stream-classification-worker.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"88710fea2d028f9a86b61d80dabbbfed0f7f87162b43a0716256ca34b3c7423a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 31, cognitive 55): (anonymous) has cyclomatic complexity 31 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/daemon/src/domain/provider/provider-seat-accounts.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"01cd6e3f1cd9fbc59d61c98c8ff7b682bf0e9106393b7405ede9dd6ccccf0651"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function claudeArgvIds (cyclomatic 31, cognitive 48): claudeArgvIds has cyclomatic complexity 31 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/daemon/src/domain/native-process-lineage.ts"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ecf687a69413c3be202e6fd41bb11ec6841f6d0b341c887cad2ee74d077c270"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateTopologyManifest (cyclomatic 31, cognitive 47): validateTopologyManifest has cyclomatic complexity 31 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":"packages/daemon/src/domain/topology/topology-manifest.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"27991f0fe0ccc1a956801827ccdf05b838356694611e283f7828dd75b26bb47c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evaluate (cyclomatic 31, cognitive 46): evaluate has cyclomatic complexity 31 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/daemon/src/domain/policies/context-usage-threshold.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd725c96106b62c479751f85769bb8eca8d528dae607882d21eef7d01ddfb68f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runDoctorChecks (cyclomatic 31, cognitive 45): runDoctorChecks has cyclomatic complexity 31 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":"packages/cli/src/commands/doctor.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e1eaf79e757db8ec70e96539a59d008cb9b95c363fb26f04059e4061ebf6c00"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 31, cognitive 44): (anonymous) has cyclomatic complexity 31 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/daemon/src/domain/ps-projection.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac963c15edb9916fdb2c31067fe4b23658175985bb62bd53e10f0f60e709d4cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function planRuntimeSwitchMaterials (cyclomatic 31, cognitive 44): planRuntimeSwitchMaterials has cyclomatic complexity 31 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/daemon/src/domain/runtime-switch-materials.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc52ba8aad357c50a1332dd2c2ddd8b49068e6ad5c0e4639676beab1100af2c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 31, cognitive 44): (anonymous) has cyclomatic complexity 31 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/daemon/test/ps-summary-stall-red.test.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b9a191800795ceeb80a34b4d9ccf33ad546003c1087b8c01309e4bd7b882ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function launchHarness (cyclomatic 31, cognitive 41): launchHarness has cyclomatic complexity 31 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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57057cafaf820c49bb6e93a71adccb6fc7891e1d180a91befa43220d86680f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handlePodAwareSpec (cyclomatic 31, cognitive 39): handlePodAwareSpec has cyclomatic complexity 31 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/daemon/src/domain/bootstrap-orchestrator.ts"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e22830edd95303892a13b4461e703a380fd1379bdeddfffa859ff58bc7d724b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 31, cognitive 39): (anonymous) has cyclomatic complexity 31 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/daemon/src/routes/compaction.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a33f2da567f1c93d52acd34f1f93bedc91d52f5e572a0bc2cda9b1e893d1272"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 31, cognitive 39): (anonymous) has cyclomatic complexity 31 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/daemon/test/restore-orchestrator.test.ts"},"region":{"startLine":2982}}}],"partialFingerprints":{"codehealthFindingId/v1":"57dcec9f805359536cd688ffd3eb9da5e54ae3943eb8c4c148edd347fea930db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 31, cognitive 38): (anonymous) has cyclomatic complexity 31 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/commands/context.ts"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98eceaaa0a3712b96e9d316103f77f86327c39e10244b7bdc1115c788a38b6d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function respawnPaneUnchecked (cyclomatic 31, cognitive 37): respawnPaneUnchecked 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/daemon/src/adapters/tmux.ts"},"region":{"startLine":2295}}}],"partialFingerprints":{"codehealthFindingId/v1":"d533c687e08396b81590d484cf0e82d2ec14f9d03f7a07cc12eb876f0bd9b9d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function attemptState (cyclomatic 31, cognitive 37): attemptState 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/daemon/src/domain/pi-compaction-service.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc082816bfe5200306919d59d78aa63f57cf7d3f0cbd118f293ffe681e2acba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function planOwnedCodexContentApproval (cyclomatic 31, cognitive 36): planOwnedCodexContentApproval has cyclomatic complexity 31 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/daemon/src/domain/codex-owned-plugin-trust.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"4860ca44add3b3e3cc81758f359e16971b5704a682fbfa7c1305210b550c2bc2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 31, cognitive 35): (anonymous) has cyclomatic complexity 31 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/commands/scope.ts"},"region":{"startLine":1044}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ad4031967f95b642c00f2d2d555020780d20e5886b89b7e2d240a73d48fa7b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function projectForExternal (cyclomatic 31, cognitive 35): projectForExternal has cyclomatic complexity 31 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/mcp-server.ts"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91e32fc931a9886e5a505f9129e5615d61e2e6b810e8f07adac8015cae48fe1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 31, cognitive 35): (anonymous) has cyclomatic complexity 31 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/daemon/src/routes/mission-control.ts"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ef820df02b6634c5e3ff9e90c17a2a8ffb50f40e1a24d26aed4e8d44a85a60"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function request (cyclomatic 31, cognitive 33): request has cyclomatic complexity 31 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/daemon/src/domain/pi-compaction-service.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"e60dc3f4b70f2c77f1910a705627ccc5cbf9e3cea34adaae4f9186f3daa3cc7f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openRexView (cyclomatic 31, cognitive 32): openRexView has cyclomatic complexity 31 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":"packages/cli/src/terminal-window-rex.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb205140dd4276f7264b1ff7cd2cc8d7106f58bdb24dd1ded1de0c612041817"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openTerminalInWindow (cyclomatic 31, cognitive 31): openTerminalInWindow has cyclomatic complexity 31 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/tui/src/terminals/open-window.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f56682d8cea9d936f271dee735335682ab9962d6dd6201a6c14230d928d882"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function configContentLines (cyclomatic 31, cognitive 30): configContentLines has cyclomatic complexity 31 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 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/tui/src/config/config-model.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ede73741e4e6c69f440c7ca40fb43404408d3ce1a8546bc8721d4730bd7b34b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 31, cognitive 29): (anonymous) has cyclomatic complexity 31 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":"packages/daemon/src/routes/seat.ts"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"295d7508282e3bb3fc420d98c3a8d29272b64972295786eb46b8eaa7e60a5216"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function show (cyclomatic 31, cognitive 26): show has cyclomatic complexity 31 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/daemon/src/domain/health-diagnosis.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"8828790073f8920a792f26343f50ba757b66b276d297c312a6f8cb58d672e943"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function followInstance (cyclomatic 30, cognitive 63): followInstance has cyclomatic complexity 30 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/commands/workflow-follow.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3cdda34ae3bfecf0d354b4b9d8524e4fa2f07354c298f34b9bfaef7dd17652"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fingerprint (cyclomatic 30, cognitive 58): fingerprint 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/daemon/src/domain/session-fingerprinter.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71b547e8dfc581191d79415a85a7466c2742e7f9e9c1b552730b75be090b247"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCodexJsonl (cyclomatic 30, cognitive 53): parseCodexJsonl has cyclomatic complexity 30 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":"packages/cli/src/restore-packet/codex-jsonl-parser.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dce5da1d59d9a52d4154f62cce87312fee24bea83ad4015a1a00fc1445b4d1a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function materializePodBundle (cyclomatic 30, cognitive 53): materializePodBundle has cyclomatic complexity 30 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":"packages/daemon/src/domain/bundle-source-resolver.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"4917d002e5d9310cdb05624b4d9a8da9b5bf03fb6d05e9a6125e75ab21be5977"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 30, cognitive 52): (anonymous) 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":"packages/cli/src/commands/slack.ts"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58704beaa6e60b8fae79d6d93f12d1fbe4242703a9dd7eb00a12a876af1439a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reportBack (cyclomatic 30, cognitive 52): reportBack 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":"packages/daemon/src/domain/network/network-connector.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"e00c99bedd90c6f6d602d02624b8250e8402ffdcf404fe23a6e6ded8d304ff23"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 30, cognitive 48): (anonymous) has cyclomatic complexity 30 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/commands/chatroom.ts"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"d37e0b4e569ac319be062e7834a939f0f78746b0f95d69ecaf87e8aea13de4f3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 30, cognitive 48): (anonymous) has cyclomatic complexity 30 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/commands/compact.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"065bc3e2a1d80bd127c8cae141f2004810cfa3d612e2f2b004f224a4123c8687"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readCodexThreadIdFromLogs (cyclomatic 30, cognitive 46): readCodexThreadIdFromLogs has cyclomatic complexity 30 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/daemon/src/domain/codex-thread-id.ts"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"922048cfaffba91af3e367d66c056fd8fc5599b6c7c0a5862bd242fe203b7cee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function claudeSessionIdentity (cyclomatic 30, cognitive 46): claudeSessionIdentity has cyclomatic complexity 30 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/daemon/src/domain/native-process-lineage.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c7882fcbb0230bcf3f58ef86793fe21d76f5f21613ab3b2a23360d6e370899"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderAcrossHosts (cyclomatic 30, cognitive 44): renderAcrossHosts has cyclomatic complexity 30 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/commands/provider.ts"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e614de81cb95c013323a422686e641bf225a5cf1f646adace394a2c5f63ddf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeWorkflowScope (cyclomatic 30, cognitive 43): normalizeWorkflowScope has cyclomatic complexity 30 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/daemon/src/domain/workflow-scope.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f9500dcdb6e74e5529d55bb985fa277a29a3e908b1b3cc21008cc732193f31"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 30, cognitive 41): (anonymous) has cyclomatic complexity 30 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/commands/expand.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff54386fa5d983deaf64fde9d09668beddc0c5d34f6075a3c47d191bd22ec88b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 30, cognitive 41): (anonymous) has cyclomatic complexity 30 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/commands/queue.ts"},"region":{"startLine":1458}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0aafaccd17ceec9c35b6be59d5d26b19477dfde5a799bd3b0abb2a62ad2051"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 30, cognitive 40): (anonymous) has cyclomatic complexity 30 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/test/send.test.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"a97545c795a3103cde4e4da3df37b7cad16ad870da5a1db5095608becefb1d6d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 30, cognitive 40): (anonymous) has cyclomatic complexity 30 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/daemon/src/domain/kernel-hook-review.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"cffadb971cbdd72268288bd796c67e0610255690e6554468d1e58290e78b18a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function open (cyclomatic 30, cognitive 40): open has cyclomatic complexity 30 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/daemon/src/domain/terminal/herdr-app-provider.ts"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"70dd4748e139b4f01e574abd866fa6a93cd5301b54a2f95e87c72846367c12e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runDeliveryDigestFlush (cyclomatic 30, cognitive 39): runDeliveryDigestFlush has cyclomatic complexity 30 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/daemon/src/domain/policies/delivery-digest-flush.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f13b4b790893726c5b36bb35fefb007a621ab9774a1a35d29fd632729f16f21"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runArm (cyclomatic 30, cognitive 34): runArm 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/test-system/delivery/cases/d04.mjs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef480eb6f1190f88d37d5587f4a54ee95f1f4e2d75b5d47c398b72aa6edaeb2c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 30, cognitive 33): (anonymous) has cyclomatic complexity 30 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/cli/src/commands/queue.ts"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"8255891cf92d5d460f76267e07de7ee90876a15ac3dff6c3667ff201ca532e81"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 30, cognitive 33): (anonymous) has cyclomatic complexity 30 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":4676}}}],"partialFingerprints":{"codehealthFindingId/v1":"b17c1bdb319575e04d6e3d191821dfd654d1793dbaf57dea2a1eed5f6e60c510"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 30, cognitive 32): (anonymous) has cyclomatic complexity 30 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":"packages/daemon/src/domain/provider/claude-token-usage.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65c7edd14ac8bea2a6d9a7fce1b33065b9d492fb021440f1a149229ad53f195"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function proveAttemptSuccessorOnce (cyclomatic 30, cognitive 32): proveAttemptSuccessorOnce has cyclomatic complexity 30 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":"packages/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d7ed2b9411cc42fd46065afe3460ac82c0706aa9a294c724b231d9b36ec1a2c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 30, cognitive 30): (anonymous) has cyclomatic complexity 30 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/daemon/src/domain/codex-filesystem-preflight.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c0288a122042aec97063d8341f93297ad780fd32c7edae89d5708d2f0d538fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 30, cognitive 30): (anonymous) has cyclomatic complexity 30 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/daemon/src/domain/queue-stuck-sweep.ts"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"885c5d0806cffb799cc9edef9ae21cd83fabdb35e5a7e5661510190219b5e1cc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function currentCodexAuthRefusal (cyclomatic 30, cognitive 29): currentCodexAuthRefusal has cyclomatic complexity 30 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":"packages/daemon/src/domain/native-resume-probe.ts"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c25e675f96382e071c53c317a7a4ff982f0a51e1e531d7670a4e0e6f41d50d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function diagnoseProducerLink (cyclomatic 30, cognitive 29): diagnoseProducerLink has cyclomatic complexity 30 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":"packages/daemon/src/domain/session-transport.ts"},"region":{"startLine":4674}}}],"partialFingerprints":{"codehealthFindingId/v1":"9488b9814d9b1ef5343d29f913c2e9c33641393ee164076f824d0cfa53d5bc42"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function world (cyclomatic 30, cognitive 29): world has cyclomatic complexity 30 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":"packages/daemon/test/seat-restart-in-place.test.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a58573a38fc2619e17671b79df4d143fc9ebcfaadda877a6864800d701a71d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 30, cognitive 28): (anonymous) has cyclomatic complexity 30 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/daemon/src/domain/execution-view.ts"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"071023631d0075bc64136c9e376d606458180a1d4f6d921dd1b1e5f1febb14ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function VerbActions (cyclomatic 30, cognitive 28): VerbActions has cyclomatic complexity 30 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/ui/src/components/mission-control/components/VerbActions.tsx"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"987a798d1aa2adab1dc8e0b8b1a5265bedc36beb68c35a8363fef90914d5d0dd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function continueStartupUnchecked (cyclomatic 30, cognitive 27): continueStartupUnchecked has cyclomatic complexity 30 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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":1389}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cc76354311a945e2f17c30f0b7d148ddae7fc537bcf1a3ccaf1eaad5523f4e6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assessManagedProbe (cyclomatic 30, cognitive 26): assessManagedProbe has cyclomatic complexity 30 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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"907134298e94d822cee9c3484a9914189759d9dcc648050e4552caf0378aad79"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveIdentityVerifiedPiRecord (cyclomatic 30, cognitive 26): resolveIdentityVerifiedPiRecord has cyclomatic complexity 30 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/daemon/src/domain/model-divergence/current-generation-record.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"92681aae83d239d0b88f18ceba3aa42fe4b821bb64201269888d222fc155db25"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 30, cognitive 26): (anonymous) has cyclomatic complexity 30 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/daemon/src/domain/rigspec-exporter.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa84c7c2ad1e9a5b6eb5a92ef9765a7c78f65dc27e5311186a38e381d9560f6c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 30, cognitive 22): (anonymous) has cyclomatic complexity 30 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/daemon/src/routes/provider.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecd3481aaf5c03790ae3d06ebe25b5b7218f90a530465cf62de218b9a2d5dd12"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 29, cognitive 64): run has cyclomatic complexity 29 and cognitive complexity 64; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/test-system/delivery/cases/d18.mjs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1abf1e4ccb2da08efdd8eb60abe8c0d3fe6fa79974e147bad031ef65c57b93"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkSeatAttention (cyclomatic 29, cognitive 58): checkSeatAttention has cyclomatic complexity 29 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/seat-attention.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc9e56157da2542e34e144260d97b2a06570af45c48be9713bb1feeb99c1b3c6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 29, cognitive 57): (anonymous) has cyclomatic complexity 29 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/daemon/src/domain/terminal/scope-task-terminal-view.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"c87fbc9a49bbfe8e7d27c035e00e1ae36ad01e5216f5dd8053a362d7180c4422"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function waitForDeliveryOutcome (cyclomatic 29, cognitive 55): waitForDeliveryOutcome has cyclomatic complexity 29 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/cli/src/commands/queue.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e19c049402a4633d6eb704c3e57d7f312ae1a8a545accfa5f24065d4ea9acb0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restoreMissingGuidance (cyclomatic 29, cognitive 52): restoreMissingGuidance has cyclomatic complexity 29 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/daemon/src/domain/restore-guidance.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ddc7fbc4172c8a869821ec3f6bd39dd370a3960586771b26a9a65f8d0850bac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readLadder (cyclomatic 29, cognitive 46): readLadder has cyclomatic complexity 29 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/daemon/src/domain/queue-wake-ladder.ts"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ed29e2f8edc7c61a2ba212b1debeace2ed45750b43fe46fe1f6abc5a8055b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 29, cognitive 42): (anonymous) has cyclomatic complexity 29 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/commands/plugin.ts"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"b670b7f12a8b7656e230b564abbdb6ca5c5cbad0021cc621e14027076479c848"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 29, cognitive 41): (anonymous) 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/daemon/src/routes/queue.ts"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf03456056155aef12983c779c8da4a328540b40a1088101fc852bd946589b1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 29, cognitive 40): (anonymous) has cyclomatic complexity 29 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/daemon/src/routes/bundles.ts"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"d132959a7cb8f457d40ab5f43880a73b036b9e650b1dda6363244d80a069b57a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveSkillLoadout (cyclomatic 29, cognitive 36): resolveSkillLoadout 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/daemon/src/domain/skill-catalog.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ee5b0fd3e91bdb66a27bc7448424e9b12d1e1b6d30c5bb966d31cf06b951ce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function composeHumanUpdates (cyclomatic 29, cognitive 36): composeHumanUpdates 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/tui/src/attention/attention-model.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b53d1222d7487e58dcf6d1bde9e2286aff8f49a19f200844f81d4c04371186"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildStoryForest (cyclomatic 29, cognitive 35): buildStoryForest has cyclomatic complexity 29 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/ui/src/lib/story-graph-model.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a362740f991cd962e2174794d2ecf3e29cd5d9feb9817a83a7f0f71f936cb31"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stopDaemon (cyclomatic 29, cognitive 34): stopDaemon 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/daemon-lifecycle.ts"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f47392e795eb3dc938874501f4ee576c1527748ef418c7bef82f04b51776a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readHost (cyclomatic 29, cognitive 33): readHost has cyclomatic complexity 29 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/daemon/src/domain/provider/usage-across-hosts.ts"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8fe702b747f147aa673ffe8f1f045b6d78d605f0301450dd56477188e8271ac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 29, cognitive 32): (anonymous) has cyclomatic complexity 29 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":"packages/daemon/src/routes/rigs.ts"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8740e6e85f45bb2f7c792923aef5ff6f1e25f277155c8ade00e38f7957147b1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function importGitHubBundle (cyclomatic 29, cognitive 31): importGitHubBundle has cyclomatic complexity 29 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/lib/bundle-source.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"784f7132c5ebe9955bcc76691ef58dcb5be74316d48ad41a6c25555ee8d94b46"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decideDelivery (cyclomatic 29, cognitive 30): decideDelivery has cyclomatic complexity 29 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/daemon/src/domain/gateway/delivery-rules-engine.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb73c18347c90c892b1cb56de1064e368576932a81ad4d845086d5a5ac55519"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 29, cognitive 28): (anonymous) has cyclomatic complexity 29 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/commands/scope.ts"},"region":{"startLine":2206}}}],"partialFingerprints":{"codehealthFindingId/v1":"626124a79f6dfc92fa509dce70e2cbbbffb2cd51340b0ffbca845c1daa900de7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkSeatReadiness (cyclomatic 29, cognitive 28): checkSeatReadiness has cyclomatic complexity 29 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/daemon/src/domain/restore-check-service.ts"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"f357338dc15a786f9938b200f6fcc442c734164627631b222d3ad61ca8685e0f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function QueueItemViewer (cyclomatic 29, cognitive 28): QueueItemViewer has cyclomatic complexity 29 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/ui/src/components/drawer-viewers/QueueItemViewer.tsx"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"37cc2973e08ac0cd0bf4b3690f96e502596532369386d24b945aa21ab602350d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function describeDaemonRejection (cyclomatic 29, cognitive 26): describeDaemonRejection 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/cli/src/commands/workflow-errors.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"d001d046594757ffe11ae0ee5bacfeebf9422f35719feb293449fcd404ae61a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspectClaude (cyclomatic 29, cognitive 25): inspectClaude has cyclomatic complexity 29 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 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/daemon/src/domain/permission-drift.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"5745c2c70c7b8a3f3a480f62c6e1aa80144f5d899e3c9765a3333f5de3b014c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordRestoreFailure (cyclomatic 29, cognitive 24): recordRestoreFailure has cyclomatic complexity 29 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"1108c416d4319f8afea79fc452b18ae813977faa717816d7608cb1de595fc2a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function retainedResume (cyclomatic 29, cognitive 22): retainedResume has cyclomatic complexity 29 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/daemon/src/domain/environment-startup.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"093ef10c5da226833754aef18f06bfa59376ad38219ec5e294cdceee46029656"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function usageAcrossHostsFacts (cyclomatic 28, cognitive 54): usageAcrossHostsFacts has cyclomatic complexity 28 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/daemon/test/helpers/usage-hosts-harness.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf7b7930f26ef1761cf3e714cf0228ea1d5beba14bb37ef2d0b707da5a76aece"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readTaskTerminalSnapshot (cyclomatic 28, cognitive 50): readTaskTerminalSnapshot 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/daemon/src/domain/terminal/task-terminal-view.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af81b0f62f78a7340da19092ab8d8b305563710d6a31950cd65da8051edb02a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function words (cyclomatic 28, cognitive 49): words has cyclomatic complexity 28 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/daemon/assets/claude-team-permissions.cjs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6605c0ee9045a5e7cb5b7b8bb43a2a4509012eb7f4ad19ebf03797654f6480f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseHumanQuestions (cyclomatic 28, cognitive 47): parseHumanQuestions has cyclomatic complexity 28 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":"packages/daemon/src/domain/human-questions.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54d993b2f5468e129d6099d1bb1f3419dfee07ed2ea8e43fd95e0e2399facfb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyResume (cyclomatic 28, cognitive 45): verifyResume has cyclomatic complexity 28 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":"packages/daemon/src/adapters/claude-resume.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9c536628fbe1d9704209fc8d6d9bcec8623f20ced45669849335b3afe0b58d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 28, cognitive 43): (anonymous) has cyclomatic complexity 28 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/commands/daemon.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f41a67b926960abca28b865bb935b38c17e5f2d381f2e504e4765c735044f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeCostView (cyclomatic 28, cognitive 43): computeCostView has cyclomatic complexity 28 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/daemon/src/domain/usage-series.ts"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f77e92c58e1d0b87bee83fb9ccf8bd314548328ce998f4326499dd5be13526"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function profileRemainsReadOnly (cyclomatic 28, cognitive 42): profileRemainsReadOnly 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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":1240}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ecd791fafdc9b1da99c381014a29170dee6fd1e9175fc4d4a32a85a646e1e3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 28, cognitive 40): run has cyclomatic complexity 28 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/daemon/test/herdr-follow-view.test.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b0d74b52273de45b9a604b14060c4c49525933d67564b9a6f276ac896f084c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 28, cognitive 39): (anonymous) has cyclomatic complexity 28 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/commands/package.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"869ab9c70ca7de296845347102905802b7e576287ea976df908f4da4d26788ea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareRelayDecision (cyclomatic 28, cognitive 37): prepareRelayDecision has cyclomatic complexity 28 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/daemon/src/domain/gateway/relay-outbound.ts"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"94013645289ee328a41d0dbd1ec7a7537bd1d3a4d56b28f1d127b45bff660f00"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runCrossHostPs (cyclomatic 28, cognitive 34): runCrossHostPs has cyclomatic complexity 28 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/commands/ps.ts"},"region":{"startLine":1692}}}],"partialFingerprints":{"codehealthFindingId/v1":"573ef8968b89396fc7971d5a58009c68c62f1e80657cd087e41026068236bbc9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateEvalCase (cyclomatic 28, cognitive 34): validateEvalCase has cyclomatic complexity 28 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/daemon/test/helpers/eval-schema.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd239ff1f6993fd0c4217b009042d577566a26ebde63b01076975f0ef6b9f3b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rawCandidate (cyclomatic 28, cognitive 33): rawCandidate 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/daemon/src/domain/seat-activity-service.ts"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3bde71a505fa03e4c683d60e3b1ee2119c8475e585e731f774b7cf80ce3a3a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readRecordedTmuxServerArgs (cyclomatic 28, cognitive 32): readRecordedTmuxServerArgs has cyclomatic complexity 28 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":"packages/cli/src/tmux-attachment.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee52919b1c30da84a78f5aab14fc192e6ca6bf03ff5534edc82afe87dd6cd90"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildCommand (cyclomatic 28, cognitive 32): buildCommand has cyclomatic complexity 28 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":"packages/daemon/src/adapters/cmux-transport.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5278b542ce4a29343e303bd8665f5361313a9a5dd69a3c83225986e4b6cf73"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function actOn (cyclomatic 28, cognitive 30): actOn has cyclomatic complexity 28 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/daemon/src/domain/mission-control/mission-control-write-contract.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eeaf03ffa04b2fed1f53bea7f54e496961e941cbcf6b2fed9ee671f3d7395a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function create (cyclomatic 28, cognitive 30): create has cyclomatic complexity 28 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/daemon/src/domain/workflow-instance-store.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec8a63fa82c5bc0242ea3248aa13d94f84b16e8191047a2e659fad889a603cde"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 28, cognitive 29): (anonymous) has cyclomatic complexity 28 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/commands/ps.ts"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fefad206a788724cf6b9a5a2500b02bfa4f2052a21b2c6361b7228565c7e880"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ledger (cyclomatic 28, cognitive 29): ledger has cyclomatic complexity 28 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/daemon/src/domain/proof/judgments.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"2294c811b9ebab4e7ceb05134d82e16a74ca26af203a4d53807fe4d8541f0674"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pollPermissionPrompt (cyclomatic 28, cognitive 28): pollPermissionPrompt has cyclomatic complexity 28 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/daemon/src/domain/seat-activity-service.ts"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e6c21042b6254228745e89b358b8f4ca8c79d781309daf53fb732ac0dbd5a1b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inPlaceTarget (cyclomatic 28, cognitive 27): inPlaceTarget has cyclomatic complexity 28 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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":2035}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf5185f42b5838e0dba7cac2a289c8686dea1286fba59087e560bfcf7a74186"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function CompactStatusRow (cyclomatic 28, cognitive 26): CompactStatusRow has cyclomatic complexity 28 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/ui/src/components/mission-control/components/CompactStatusRow.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"1830db0d23bc369c08905faf910db8526a3635525f13f1afa1d369af406e6edd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ensureCodexCorePlugin (cyclomatic 28, cognitive 25): ensureCodexCorePlugin has cyclomatic complexity 28 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 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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1c4b080563456cdeefdce44471047c4620067ffb57162db225584341521547"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function passRunnerAnswerToDecider (cyclomatic 28, cognitive 25): passRunnerAnswerToDecider has cyclomatic complexity 28 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 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":4488}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a71493489b307c832e48f80b684013e0388c6aa16c083c47b85e3574ab3f35f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function eventToken (cyclomatic 28, cognitive 25): eventToken has cyclomatic complexity 28 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 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/ui/src/components/project/ProjectMetaPrimitives.tsx"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f83695c3c27fef4e658f177c031a836bb7a4ef86b402bd7c474397c2c6e40c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 28, cognitive 24): (anonymous) 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/commands/workflow.ts"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c7ed1ece98ea98d66739895f3e9d9c61e6745c387dffcb6d0816e0a5f10b3c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evaluatePassiveCeremony (cyclomatic 28, cognitive 23): evaluatePassiveCeremony has cyclomatic complexity 28 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 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/daemon/src/domain/health-detectors.ts"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b56929d8174ba187dddbf874e04d9b2917a596a4eb7a62a1b6da0cac2162ea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshQueueRow (cyclomatic 28, cognitive 23): refreshQueueRow has cyclomatic complexity 28 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 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/ui/src/components/for-you/FeedCardQuestionAsk.tsx"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"37aa7d606d236de8060dcd944b4d18587dc4537e73caf9d7b6a2dc569cbe438a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 28, cognitive 22): (anonymous) has cyclomatic complexity 28 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/daemon/src/domain/node-inventory.ts"},"region":{"startLine":1862}}}],"partialFingerprints":{"codehealthFindingId/v1":"811e518bbb5044e1a9c694bdd2f036889ddfb29e83eea72e5dc8a85de3408976"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function queueStateToken (cyclomatic 28, cognitive 20): queueStateToken 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/ui/src/components/project/ProjectMetaPrimitives.tsx"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3500f1bc7e0b447e321c03494889b47cb3119346911197c2d24f63129e07fcb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateProgress (cyclomatic 28, cognitive 18): validateProgress has cyclomatic complexity 28 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/daemon/src/domain/health-diagnosis.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07a495c0beb9951d9e23f6c9242a8f69eab618071702de81c8dfe1fba0fe01d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseMarkdown (cyclomatic 27, cognitive 56): parseMarkdown has cyclomatic complexity 27 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/markdown/MarkdownViewer.tsx"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f203b84711288e844296a76d987e46d066988b3f260701f3589471f90e9614"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assemble (cyclomatic 27, cognitive 52): assemble has cyclomatic complexity 27 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/daemon/src/domain/pod-bundle-assembler.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"cabde3e504e442656e7a8f90d1503419aecb39d36a969df6ab812b42e2392853"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateExpect (cyclomatic 27, cognitive 46): validateExpect has cyclomatic complexity 27 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/daemon/test/helpers/scenario-schema.ts"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbbe61b543318e35e6c82cce02533a22e87602479f55a5f4f606cf92b9345cea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shellSyntaxIn (cyclomatic 27, cognitive 45): shellSyntaxIn has cyclomatic complexity 27 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":"packages/daemon/src/domain/community-harness-presets.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb695b9c54d2d550c071660e81ef3d7f2bac65c967086508c8392d30581309d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shrinkPod (cyclomatic 27, cognitive 45): shrinkPod has cyclomatic complexity 27 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":"packages/daemon/src/domain/rig-lifecycle-service.ts"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f8898e25c7ce7beaf379e78109290be59774916adabfb5ce5b64342b307e0df"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verify (cyclomatic 27, cognitive 43): verify has cyclomatic complexity 27 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/daemon/src/domain/install-verifier.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"e540d9e3f8186ed3cf8f053a7650f200bb556dbe45fddb0b197029d102f88cdb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 27, cognitive 42): (anonymous) has cyclomatic complexity 27 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/daemon/src/domain/gateway/relay-inbound.ts"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c898aa9829920d086ad66ea5e4f0631d1da9e6534540fd99b8eca9d08d8e7d7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function catchUp (cyclomatic 27, cognitive 41): catchUp 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/daemon/src/domain/stream-intake.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1bc0cfdafc4284d3fe77b687e08eaa56db3aeaa17363ca2bea5c8ab7535c91d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateWorkspaceBlock (cyclomatic 27, cognitive 39): validateWorkspaceBlock has cyclomatic complexity 27 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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"1153eba28cc0bc4f158a50117b68491ecbe70c3dbc496dae34c20e9bb6e46b7e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ask (cyclomatic 27, cognitive 38): ask has cyclomatic complexity 27 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/daemon/src/domain/ask-service.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b0acd9edfcd27c475f3646b4e14dd72d75a9248f6573171c2729c3cae2a671"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findClaudeComposer (cyclomatic 27, cognitive 37): findClaudeComposer 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"4884663ca2bc238e16245ec00430cc3e9bc905dfabb68bf73f484039bf13ea55"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openView (cyclomatic 27, cognitive 36): openView has cyclomatic complexity 27 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/daemon/src/domain/terminal/rex-adapter.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b8e77c0e539433a74810133170dca77216f8bfe31954ebec7012865ed2bd50"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ensureDefaultWorkspace (cyclomatic 27, cognitive 35): ensureDefaultWorkspace has cyclomatic complexity 27 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/daemon/src/domain/workspace/default-workspace-scaffold.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"4260fe4818cb26efe5db661fe42185541a32c4347b1ef71468965ddf3178a2a0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildPermissionRuleSuggestions (cyclomatic 27, cognitive 34): buildPermissionRuleSuggestions has cyclomatic complexity 27 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/daemon/assets/plugins/openrig-core/hooks/scripts/permission-stop-descriptor.cjs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"b44c5876ea249ec106912a2f969983ce09255f26f2b6c8574f2d39aa306c9357"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reconcilePreparations (cyclomatic 27, cognitive 34): reconcilePreparations has cyclomatic complexity 27 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":2016}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a628fb22e948d1e9c60aad5e65bb4f6255fc95b9d2dd046b13cccb403139545"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function remoteJsonRequest (cyclomatic 27, cognitive 32): remoteJsonRequest has cyclomatic complexity 27 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":"packages/daemon/src/domain/hosts/remote-daemon-http.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"05cb20b46bff699ce3a965a5bfbfa982475cd117ef0eaefb516a723d2a816d1c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 27, cognitive 32): (anonymous) has cyclomatic complexity 27 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":"packages/daemon/src/domain/queue-repository.ts"},"region":{"startLine":4919}}}],"partialFingerprints":{"codehealthFindingId/v1":"07381858fc17b9c205ce80dfd8c3f4c4061654e826ac737d98cd6c4ebd25ba90"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decideCodexNetworkDefault (cyclomatic 27, cognitive 31): decideCodexNetworkDefault has cyclomatic complexity 27 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/daemon/src/domain/codex-network-default.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eff0d6618fdc572f41fe84de44d3276f150dc9442300737953f1047fc100e6a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function performWakeSend (cyclomatic 27, cognitive 31): performWakeSend has cyclomatic complexity 27 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":2207}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d202509c275e66e03e10f6df6cb2c98eb7a2f8eb127b0075cb50c59c95f1a6a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateContextPackManifestForInstall (cyclomatic 27, cognitive 30): validateContextPackManifestForInstall has cyclomatic complexity 27 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/lib/context-install.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"c658f227b011955193ee9eebba6a093215570c097246df3ec79cb756ea47b454"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 27, cognitive 30): (anonymous) has cyclomatic complexity 27 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/mcp-server.ts"},"region":{"startLine":2129}}}],"partialFingerprints":{"codehealthFindingId/v1":"94822a4d1dd4a726afdb0ca2f4ae1bdd92a9808394e3d482e338a1fa7b8f76ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractPiUsageFacts (cyclomatic 27, cognitive 30): extractPiUsageFacts has cyclomatic complexity 27 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/daemon/src/domain/pi-usage-facts.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd01e91919cca1f55c33df15c7f00ee83732af91b6e8a13ca89712649a38aa57"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 27, cognitive 29): (anonymous) has cyclomatic complexity 27 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/commands/broadcast.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"007d41461aad431c14f71d22c997edd5333b11191f90c5f930929cb9ba1bf597"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pruneEvents (cyclomatic 27, cognitive 28): pruneEvents has cyclomatic complexity 27 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/daemon/src/domain/queue-retention.ts"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc804204e91b9d145eba7426ddcbea44e0cb5304bd95af54cb79f21c5ad067d0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isStoredRigSpec (cyclomatic 27, cognitive 28): isStoredRigSpec has cyclomatic complexity 27 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/daemon/src/domain/rig-repository.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"4039b889ce5ae7d0f554813710100a971a4c8c6ba340b471b4ba915d5ddf268a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function endAvailability (cyclomatic 27, cognitive 27): endAvailability has cyclomatic complexity 27 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/daemon/src/domain/gateway/human-operating-modes.ts"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"4569350ecd9c659064aa9d3f4fa3b63b1a0722631361923d209d8c6e0c3152ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 27, cognitive 24): (anonymous) has cyclomatic complexity 27 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/daemon/src/domain/restore-plan-preview.ts"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"8939592db1ffba5014e024b5a6f6e9d991dd1caa87743407bc6559160141d5e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function composeSliceReview (cyclomatic 27, cognitive 24): composeSliceReview has cyclomatic complexity 27 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/daemon/src/domain/review/compose.ts"},"region":{"startLine":1114}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d43e170dafb2cf356549510282877470c4acb5da34551f50d417123caea58fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function endedAttemptGate (cyclomatic 27, cognitive 21): endedAttemptGate has cyclomatic complexity 27 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c525f0afbd9ffa744d81462964629bfb0579fc1ce745841a91e2ffba766615"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runTmux (cyclomatic 27, cognitive 21): runTmux has cyclomatic complexity 27 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/daemon/test/tmux-exact-target.test.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f7e673a892e789336e8b9966fb650978acf9109a5441078f8c42b976d7c0e3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function config (cyclomatic 27, cognitive 20): config has cyclomatic complexity 27 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/daemon/src/domain/environment-platform.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"437f95b2ab11c5c5b47ee227be63757680cc1ef845366c6e84412926f73fe54d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getStatus (cyclomatic 27, cognitive 19): getStatus has cyclomatic complexity 27 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/daemon/src/domain/queue-wake-repository.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"3080107703e9d0a20d17ad86941a3d42c3a44405b736574deb80cadbbba27056"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classify (cyclomatic 27, cognitive 17): classify has cyclomatic complexity 27 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/daemon/specs/agents/shared/skills/core/openrig-upgrade/scripts/refresh-managed-plugin.mjs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab63f503b11cc4f9916d28b1deef46a8b6eaa71194ffaaece9ad64c6d0ab77a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classify (cyclomatic 27, cognitive 17): classify has cyclomatic complexity 27 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":"skills/_canonical/core/openrig-upgrade/scripts/refresh-managed-plugin.mjs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"192f815acb08548d6d28a1ecd084657b0f0105a1731db92f50b12f294b356927"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 26, cognitive 87): (anonymous) has cyclomatic complexity 26 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":"packages/daemon/test/claude-interactive-launch.test.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e88f1acfcb1dd98bcf19fb2df75343cd5e79ad2ba4f1f1b00edea24250dd9b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function listPlugins (cyclomatic 26, cognitive 68): listPlugins has cyclomatic complexity 26 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/daemon/src/domain/plugin-discovery-service.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"5968e0df283ec981e67f8ef37341f4476a9010d397d38f43907348a32744105d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runWorkflowBootSweep (cyclomatic 26, cognitive 52): runWorkflowBootSweep has cyclomatic complexity 26 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/daemon/src/domain/workflow-boot-sweep.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7e8b2476bff9d7e7817892fe6098c0476dc6875d11188bc6495b7236cacff9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanQuotes (cyclomatic 26, cognitive 51): scanQuotes has cyclomatic complexity 26 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/assets/claude-team-permissions.cjs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac81c846b64cbd5d05f250b6ad942c52c6566b0bc251e8f4446de40dd8eb469"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lineStartsAtDocumentLevel (cyclomatic 26, cognitive 50): lineStartsAtDocumentLevel has cyclomatic complexity 26 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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":2717}}}],"partialFingerprints":{"codehealthFindingId/v1":"24015ca7f49a0aebe3f5e53f1383dcc07a8cd1c1083327e0fb9a821169c3d366"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getLatestForNode (cyclomatic 26, cognitive 46): getLatestForNode has cyclomatic complexity 26 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/daemon/src/domain/agent-activity-store.ts"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6171f9d587a31c66f2f9d6c4881ff75f3bd2075d1efcbb0910b16e878c6a90e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 26, cognitive 42): (anonymous) has cyclomatic complexity 26 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/mcp-http.ts"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ef4f48f54453f2c289420a91bca244a73d328c0516bcc5fe4aa15e3cf2f4bd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cellMain (cyclomatic 26, cognitive 41): cellMain has cyclomatic complexity 26 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/test-system/delivery/run.mjs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d85616194b0765c0c81f6d7304f67f279cc5d44f6be4484b225f0e44a2495d6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bindReview (cyclomatic 26, cognitive 41): bindReview has cyclomatic complexity 26 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":"scripts/check-substance-gate.mjs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5604b40f4fdd2e51b84f9e7cb0a95b26b437d59fa07accebcc7daefe5df2bc7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspectExceptionReadiness (cyclomatic 26, cognitive 39): inspectExceptionReadiness has cyclomatic complexity 26 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/daemon/src/domain/workflow-exception-readiness.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"110d4e7611cd6b8030097668a39afdbf127c851720d08fa3d7df5c1f5fa45886"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fleetScopesLines (cyclomatic 26, cognitive 39): fleetScopesLines has cyclomatic complexity 26 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/tui/src/scopes/fleet-scopes-model.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce4fcc1f735cbaad26444767c814dba4da9d266b7a3dd85ca61ce983a6f47299"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 26, cognitive 36): (anonymous) has cyclomatic complexity 26 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/commands/shrink.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d80872f8e4bfc2fb779b0f13cd53c7fea51d5e6801351c768621ae86d072fc3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sendShellCommandUnchecked (cyclomatic 26, cognitive 35): sendShellCommandUnchecked has cyclomatic complexity 26 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/daemon/src/adapters/tmux.ts"},"region":{"startLine":1982}}}],"partialFingerprints":{"codehealthFindingId/v1":"979194f005690b249dd717d39e7d11198ff6775de31f2df8eb7d95b3ddf0f885"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readRefocusRecord (cyclomatic 26, cognitive 35): readRefocusRecord has cyclomatic complexity 26 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/daemon/src/domain/refocus-record.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"448112a0ddbd1ddeca8e0bfd38617f9f1c4a559f922f8ffdb6d06c9c806b9e56"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scopedLaunchCommand (cyclomatic 26, cognitive 34): scopedLaunchCommand has cyclomatic complexity 26 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/daemon/src/adapters/tmux.ts"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"57af74d3005e1c95a7d40085c18b33b139ec72791669126b161ef2b97dc6619c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tomlSections (cyclomatic 26, cognitive 32): tomlSections has cyclomatic complexity 26 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":"packages/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":2460}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56ffc7d39be70e29533787ff3f9c8bc0703896456bb966391d55cd4fd7123af"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyCheckpoint (cyclomatic 26, cognitive 32): verifyCheckpoint has cyclomatic complexity 26 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":"packages/daemon/src/domain/environment-lifecycle.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"c379a89a9870cd4c33cd05073b1553e2eb6ec4d7f0ffab2175d8c72b62ba8805"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getNodeDetail (cyclomatic 26, cognitive 32): getNodeDetail has cyclomatic complexity 26 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":"packages/daemon/src/domain/node-inventory.ts"},"region":{"startLine":1271}}}],"partialFingerprints":{"codehealthFindingId/v1":"63342ae7e09298c869df05a73df7cdde6451e64be8043eacc625126f4380ac3e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getWorkflowReview (cyclomatic 26, cognitive 32): getWorkflowReview has cyclomatic complexity 26 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":"packages/daemon/src/domain/spec-library-workflow-scanner.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"c852fe676d19c5e77caf56aa8ae72b4305367035a269fd5f979b2f2083ad4e8a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function humanOpen (cyclomatic 26, cognitive 31): humanOpen has cyclomatic complexity 26 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/commands/terminal.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"941af512b4bec61e6fac92049ee369312b15b9d6fbede0fc6a176773114edb65"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 26, cognitive 30): (anonymous) has cyclomatic complexity 26 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/commands/environment.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d679fd3f80120806efdff28a1b504f6617605d5105dc07f043b21190be9aead"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateClassifyInput (cyclomatic 26, cognitive 30): validateClassifyInput has cyclomatic complexity 26 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/daemon/src/domain/project-classifier.ts"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"519521183e6bd0ab1ed9dde9f4efea531debbb46614685872aea64df487dbd97"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 26, cognitive 29): (anonymous) has cyclomatic complexity 26 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/commands/reconcile-session.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad26922b9f0fcf40378b23c6b750855f6108f59830b43f6a9781763d178de71"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runCrossHostSend (cyclomatic 26, cognitive 28): runCrossHostSend has cyclomatic complexity 26 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/commands/send.ts"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4e24e6cba2beae52b3697d51f216c26b4347f2a639210fa2a94dca96b5effb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 26, cognitive 28): (anonymous) has cyclomatic complexity 26 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/daemon/src/domain/project-classifier.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ec0f18bd6a54b1d7469496b4ebd5f78d3c2c0682d2d046001faa1b238d213e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function followView (cyclomatic 26, cognitive 28): followView has cyclomatic complexity 26 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/daemon/src/domain/terminal/terminal-service.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d3519f0ea5d74aa4e3eefea4d0ee15867fab9a21f1ef9ad110016c90359c5d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 26, cognitive 27): (anonymous) 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/commands/queue.ts"},"region":{"startLine":2381}}}],"partialFingerprints":{"codehealthFindingId/v1":"689d678ad624baef1be3f52e0e4d6af50c1f6c636776caf0821e3ed5cd6b4cac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 26, cognitive 27): (anonymous) 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/daemon/test/claude-handover-readiness.test.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf082fde859162d35c4c5ad17edcd3fa5c93e5575121f1407c927431674f90c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function enrichRosterMember (cyclomatic 26, cognitive 25): enrichRosterMember has cyclomatic complexity 26 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 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/commands/roster.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"13bd413088b103f59d3da2e03cd34b355ba4893f0e494b2a1ca2be04fbf52e2d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 26, cognitive 25): (anonymous) has cyclomatic complexity 26 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 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/daemon/src/domain/rigspec-codec.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a7ac3eba0479c5f44f9ed152b55c08277e572338c61934514ec6721d1251b7b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 26, cognitive 25): (anonymous) has cyclomatic complexity 26 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 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/daemon/test/seat-launch-environment-regression.test.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db4b68eab1828fafe3d576de821d9e2a527d114b1482d10b2e317ff96f3fff6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function terminalDeliveryResult (cyclomatic 26, cognitive 24): terminalDeliveryResult 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/cli/src/commands/queue.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa07a92e19a90d7a60e83bf97de1b4f25bb34013ba9ca6b361f53ea9d5a94976"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function codeResultOf (cyclomatic 26, cognitive 23): codeResultOf has cyclomatic complexity 26 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 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/queue-artifact.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b3b15adee4ba048f339455630a634be4d8e69981df538ee89374b53b5d336e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 26, cognitive 20): (anonymous) has cyclomatic complexity 26 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":1709}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa0575b5ad774614beaa44fa085d05c66e7fdd3926f7c11793eccba3ebaa6b7d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 26, cognitive 17): (anonymous) has cyclomatic complexity 26 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/daemon/src/routes/discovery.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cfc7949d9da03d1000d004d7c719f84962fdb38cd7d7a5d84bf3670212052b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function connectPiRunnerChannel (cyclomatic 25, cognitive 60): connectPiRunnerChannel has cyclomatic complexity 25 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":"packages/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":2185}}}],"partialFingerprints":{"codehealthFindingId/v1":"8583fbc7c5fb12934163b26c69caca7b2898859482883fd6bee77d37fcac4968"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function check (cyclomatic 25, cognitive 52): check has cyclomatic complexity 25 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/daemon/src/domain/rigspec-preflight.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b9f96cec059d316e497aac3f915a943d49aa3cdca63458dc18c0b121e629f1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computePodLaunchOrder (cyclomatic 25, cognitive 51): computePodLaunchOrder has cyclomatic complexity 25 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":1960}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3078300837734552215eef55df6080541c4371deae481409d2f2ab4baac766"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshWorkflowEntries (cyclomatic 25, cognitive 46): refreshWorkflowEntries has cyclomatic complexity 25 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/daemon/src/routes/spec-library.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"d39f4042dcc9a71db1cd88c3b72b35f0df6d1236fc1ecc54434e604969475d3f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyQueuePreconditions (cyclomatic 25, cognitive 45): applyQueuePreconditions has cyclomatic complexity 25 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":"packages/daemon/test/helpers/scenario-pipeline.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a641adb582b11c3ac438ef7df0f9b990e9a8db9c8d4f609a13985338b7abd71"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tokenizeWithKeywordsAndComments (cyclomatic 25, cognitive 45): tokenizeWithKeywordsAndComments has cyclomatic complexity 25 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":"packages/ui/src/components/markdown/SyntaxHighlight.tsx"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c82737b90a415c8d52d141fab6406a61df2635cbce69d9cdb0b1a7c17e07952"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function check (cyclomatic 25, cognitive 43): check has cyclomatic complexity 25 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/daemon/src/domain/restore-check-service.ts"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"30441ff2ce704d294705e688fbca4012b851f96185b568c832c48dbf29446b5e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function effortReport (cyclomatic 25, cognitive 43): effortReport has cyclomatic complexity 25 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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8877fa17f69fb1fd71e1d481439c51b0e8dbab269a7b1f565509459b0c27ed3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 25, cognitive 41): (anonymous) has cyclomatic complexity 25 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/daemon/src/adapters/tmux.ts"},"region":{"startLine":2697}}}],"partialFingerprints":{"codehealthFindingId/v1":"5347156d5b70885a4bf790956cd7d3b3cdbe294efc924875a00b4e54f56d2ba8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalize (cyclomatic 25, cognitive 39): normalize has cyclomatic complexity 25 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/daemon/assets/claude-team-permissions.cjs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7011eff6166b72f9d0ca2053fe53e9c735d25fe337396a8611eecca0156562a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildWorkspacePanes (cyclomatic 25, cognitive 37): buildWorkspacePanes has cyclomatic complexity 25 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/daemon/src/domain/cmux-layout-service.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"e85984094bbc408ccbd6895be4acd701215c00adf37effae6313f69dc0442619"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 25, cognitive 36): (anonymous) 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":"packages/cli/src/commands/skill.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eecb233255d5552d6bab90fae52d2bce3bab37ce1fb8f820083cd80152f6012"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeSessionSource (cyclomatic 25, cognitive 35): normalizeSessionSource has cyclomatic complexity 25 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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21048a67ebdf2efd90d84f3b961747ad994cb1a1dc22a8ecb039af91df19c57"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateStartupAction (cyclomatic 25, cognitive 35): validateStartupAction has cyclomatic complexity 25 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/daemon/src/domain/startup-validation.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d2e8cd0ba9c34597bf71ba77fa99674bb98014ff41e8ee9486ccceeff7ee4b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function planFollowingTiles (cyclomatic 25, cognitive 35): planFollowingTiles has cyclomatic complexity 25 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/daemon/src/domain/terminal/terminal-follow-policy.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"26650a7dbccbc23f598c972dc7ec02dfea791ecaa23f356397c670a6348a5757"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 25, cognitive 34): (anonymous) has cyclomatic complexity 25 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/ui/src/components/RigGraph.tsx"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c3bc864a0dcb49540197e4d6eaf27fb84e80168ca08581f908b1e9b324f9997"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function EvidenceOpener (cyclomatic 25, cognitive 34): EvidenceOpener has cyclomatic complexity 25 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/ui/src/components/review/EvidenceOpener.tsx"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4380bc15092082d0740f18d01ee7a12403c8667fd1e108b0645fa6c862ab5d5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 25, cognitive 33): (anonymous) has cyclomatic complexity 25 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/cli/src/commands/restore.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"447e0e2f3dea7fa182516395a4c848af2aaf0897f7d93abca52282794eeb0bdc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restart (cyclomatic 25, cognitive 33): restart has cyclomatic complexity 25 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/daemon/src/domain/seat-restart-in-place.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"3afebb49a2734de962a4b613f4d26bca3d30e465dd96fccd4552382016b2cbea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runHttpPs (cyclomatic 25, cognitive 32): runHttpPs has cyclomatic complexity 25 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":"packages/cli/src/commands/ps.ts"},"region":{"startLine":1767}}}],"partialFingerprints":{"codehealthFindingId/v1":"45332253bb7b9010be386ffa8f34a2f5992578678db7c6f5bd5aeb3740405229"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function observe (cyclomatic 25, cognitive 32): observe has cyclomatic complexity 25 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":"packages/daemon/src/domain/permission-stop-observation.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b10a1e9150f226a0f085e179891b5d3f30123a7343a577818b6bfd0cf3b9a21"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startAgent (cyclomatic 25, cognitive 32): startAgent has cyclomatic complexity 25 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":"packages/daemon/src/domain/successor-session-launcher.ts"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"189f427348d1e22f02352dfc57dcdcb369b7f5fe705d08cb9f318bfde263566f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 25, cognitive 32): (anonymous) has cyclomatic complexity 25 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":"packages/daemon/test/claude-mcp-menu.test.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"d37c0b7c6f0df5efe738c7fbc0ce54ba9a1796fd71e1131cb88b93d67155f092"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deriveClaimPickup (cyclomatic 25, cognitive 31): deriveClaimPickup has cyclomatic complexity 25 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/daemon/src/domain/queue-pickup.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66fbb9ce6afa19549b862ace7f5554e68c5ab7c49ed01fa12c1a087fb91b570"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseTopologyActivityEvent (cyclomatic 25, cognitive 31): parseTopologyActivityEvent has cyclomatic complexity 25 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/ui/src/lib/topology-activity.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"d889cdcadd9c9d46a3386ca74f4e3498c859ab9652da9f54ed35b183aafd2f01"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 25, cognitive 29): (anonymous) 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/commands/bundle.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29f53c421833b185519bf45de2e83483035aee400b6270d6a08f1d8b5181eb3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 25, cognitive 29): (anonymous) 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/test/start.test.ts"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58e3f887b19d52f4e69712250659ae155e6e2e2a33fc3cda105c930f6db84c1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exitedSeats (cyclomatic 25, cognitive 29): exitedSeats 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/daemon/src/domain/terminal/herdr-adapter.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b69c4965907072b6d5156a7a107f5a38983eae49308317382de51108230fc56"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findPendingRelayReplyRef (cyclomatic 25, cognitive 27): findPendingRelayReplyRef has cyclomatic complexity 25 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/daemon/src/domain/gateway/relay-outbound.ts"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a8cd9971b98236d28a5b781bf1fd95a05a4261bc93bf29447961896163f616"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 25, cognitive 26): (anonymous) 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/daemon/src/routes/packages.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"0acaf6d0673dc49b47d94b3fb8d3eff578d592eba9e3cdd2664309dfd6ec3816"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evaluateRelayCandidate (cyclomatic 25, cognitive 25): evaluateRelayCandidate 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":"packages/daemon/src/domain/gateway/relay-config.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d99240b66ae6d75c16e4b554c53a7986d2a876647ebf64481ee119717e7d9b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function record (cyclomatic 25, cognitive 25): record 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":"packages/daemon/src/domain/mission-control/mission-control-action-log.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db734fa4039210c6f958451577ce1aa23654bca2034f5765fe99ecf5ef10ab1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 25, cognitive 25): (anonymous) 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":"packages/daemon/src/routes/hosts.ts"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"4398cc42e4c630f34f8c59cf55a1c473c412b0761b0854f669a4faa45e0e0f02"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 25, cognitive 23): (anonymous) has cyclomatic complexity 25 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 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/ui/src/hooks/useActivityFeed.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"eebd2b872f6a951b2ad9836ed926815d9ffdfe80a7d0d2228ed9e307aa7444c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readConnectionConfiguration (cyclomatic 25, cognitive 22): readConnectionConfiguration has cyclomatic complexity 25 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/daemon/src/domain/gateway/connections-projection.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f05bd77f684fa4461663435ec3df8328dea557a92d1702c6953c2b73898156"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 25, cognitive 22): (anonymous) has cyclomatic complexity 25 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/daemon/src/domain/node-inventory.ts"},"region":{"startLine":1606}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b021396f38fd0f02ce70f5b151f4d7138fb35b000a8f3f2f9bd6895f4ae611e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inputReadDiagnostic (cyclomatic 25, cognitive 20): inputReadDiagnostic has cyclomatic complexity 25 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/daemon/src/domain/input-read-diagnostic.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"580f2693ac0aef4c4b8362a54f6c6dff0d88ea45fe8855993e3a7dcd6ef2c66c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function BootstrapWizard (cyclomatic 25, cognitive 20): BootstrapWizard has cyclomatic complexity 25 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/ui/src/components/BootstrapWizard.tsx"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e250995f81e1bf8f551c24efdd620f0af60d064a87f1cbc8e41670fc79a689"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deriveResumeToken (cyclomatic 24, cognitive 50): deriveResumeToken has cyclomatic complexity 24 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/daemon/src/domain/resume-token-capture.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4855565cc1feccd7fd3da692119d83fb48a7e02fe644f77f2bdac32be23202"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 48): (anonymous) has cyclomatic complexity 24 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/daemon/test/bundle-local-skills.test.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dcb44606b0efcf651b2c62d1af933ab9e714a45b81301e61ee6f7018a6bc21a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writeSeatRecap (cyclomatic 24, cognitive 47): writeSeatRecap has cyclomatic complexity 24 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":"packages/daemon/src/domain/context-packs/seat-recap-store.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f1b6a36d5d189a1e1bed514013bc99ac794d300112332bebecb4282a2bf34f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 46): (anonymous) has cyclomatic complexity 24 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/acp/connector.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"74502b55fbd97f4ed4248b7f30d0e66e14adb0c17fc05a143f30d52348cd9594"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 40): (anonymous) has cyclomatic complexity 24 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/daemon/src/domain/queue-erasure.ts"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c716bca4171877ea4cf9a9bf0a094e203f856345728a1d24040f427a5934864"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function waitingFor (cyclomatic 24, cognitive 39): waitingFor has cyclomatic complexity 24 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/daemon/src/domain/gateway/human-mode-account.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd973257744ecad1fd08ba19a1883031bc81f05adaf118c08c29f780ba89dfc3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 38): (anonymous) has cyclomatic complexity 24 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/commands/context.ts"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"721dd4f1dc853eda3673fe805d70f73af0bcd2a02b48ba93d568e356ba73b5d5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hasLiveAttachments (cyclomatic 24, cognitive 38): hasLiveAttachments has cyclomatic complexity 24 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/daemon/src/domain/terminal/herdr-live-workspace.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d00fddd79d74d7386443c73fe17b05dbe7a8506fe4c3bd5363d5311dc3a8611"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 37): (anonymous) has cyclomatic complexity 24 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/lib/reconstruction-reader.ts"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f7bcdad2d7c1e4b13474844d372077e0a7fdbf1795d9a119bf17ea3bdc9a039"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function execute (cyclomatic 24, cognitive 37): execute has cyclomatic complexity 24 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":"scripts/pr-scenarios.test.mjs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c98487c46c31bbcfdc1d834c0c86975f38dc99b02897195c8a8416fe175a0f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderSeatAccounts (cyclomatic 24, cognitive 36): renderSeatAccounts 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/commands/provider.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"222f6ffb11af014b07d2de1477d75635be4f224b85a9e3cc652dd79f0cdf2e70"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 35): (anonymous) 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/commands/compact-plan.ts"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"f680cb50d55b1fa8576ab0d6d063f8550a1d7c2825de387c39517d5d7d6a43a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 34): (anonymous) has cyclomatic complexity 24 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/commands/seat.ts"},"region":{"startLine":1657}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df0236857100c24843cf6d51faee5a105d533bd6ff5c15113ff3fa30a91ff11"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function composeFromFiles (cyclomatic 24, cognitive 33): composeFromFiles has cyclomatic complexity 24 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/daemon/src/domain/context-packs/context-pack-library-service.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2cc3e552a319019033b60d17d11b5550aeac417c8266b0be806416c3993002d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function followSeatSkills (cyclomatic 24, cognitive 33): followSeatSkills has cyclomatic complexity 24 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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29702fae9514f374e93695e8cec509d78b390a129a46e2bcd85d66a97fbcaf9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 33): (anonymous) has cyclomatic complexity 24 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/daemon/test/seat-handover-service.test.ts"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"3204b1183d813ceec1d965d16f27b9ed33e23b2ac133d74759b68803bc9c1db1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 32): (anonymous) has cyclomatic complexity 24 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":"packages/cli/test/provider.test.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"6524aa1cfaa1c5fd68963a8d931304e821abceacae7847a1f35a28c00bbeed00"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deliverDigestPost (cyclomatic 24, cognitive 32): deliverDigestPost has cyclomatic complexity 24 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":"packages/daemon/src/domain/gateway/slack/slack-subsystem.ts"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"201738a53d9bf4c8620323a746cd714465d22179510a73623ecd8a7c452d6e14"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function project (cyclomatic 24, cognitive 32): project has cyclomatic complexity 24 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":"packages/daemon/src/domain/provider/usage-windows.ts"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed264c10b6ccd4afc3763ace3fb2ff9040aef31469848af9125b3f83cd9826d8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkpoint (cyclomatic 24, cognitive 31): checkpoint 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/daemon/src/domain/environment-lifecycle.ts"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"b388a677d569af19454e8906c94cfefb8760a60bacbfa24397ed84c895bd7c89"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 31): (anonymous) 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/daemon/src/routes/rigspec.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"be27b4b079b291c2737f65fb0bf33dfa8dbfb4c48da967cae14b64529c55131f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function configValue (cyclomatic 24, cognitive 31): configValue 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/tui/src/config/config-model.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3601c74791805bf6119cd1b86e17519e145828f53743668ce26c16fb0deb758"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readMissionReadiness (cyclomatic 24, cognitive 30): readMissionReadiness has cyclomatic complexity 24 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/daemon/src/domain/proof/judgments.ts"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"38eec6f8fc9d8b210ca0a02939a0ba9bf6f4927406f936cad91ac62a1bb21195"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 30): (anonymous) has cyclomatic complexity 24 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/daemon/src/domain/queue-stuck-sweep.ts"},"region":{"startLine":1697}}}],"partialFingerprints":{"codehealthFindingId/v1":"974969e9352ff0f694a7e5d3b4afa131d5416d0348f5adddea1848f88af5a0a9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function namedSeats (cyclomatic 24, cognitive 29): namedSeats has cyclomatic complexity 24 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/mcp-server.ts"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f90125088f6d6750c576ac44e690636080b37e33ab71cd2a6ec01bcfd1bbe2b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 29): (anonymous) has cyclomatic complexity 24 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/daemon/test/helpers/staging-docker-invoker.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c218e335618bcc48683c00922ddc7f31de0e5daed2c6e38d6df54e9aff8bfe4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runCrossHostCapture (cyclomatic 24, cognitive 28): runCrossHostCapture has cyclomatic complexity 24 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/commands/capture.ts"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa018c23a57143ae4ae5152616518dabae76198b50fde45dad89d9bf26cad3e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parsePsControls (cyclomatic 24, cognitive 28): parsePsControls has cyclomatic complexity 24 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/commands/ps.ts"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"e47983f09a7b47b8d3453088f1efe68f10a08df248c6cb489781d1bf3205f608"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readHostScopes (cyclomatic 24, cognitive 28): readHostScopes has cyclomatic complexity 24 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/daemon/src/domain/hosts/fleet-scopes.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"26bcacd45e41888a7a66ed9d888379fe23408503742b7e938fc4b6e989beb54e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assessSnapshotCurrentOccupants (cyclomatic 24, cognitive 28): assessSnapshotCurrentOccupants has cyclomatic complexity 24 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/daemon/src/domain/rehydrate-eligibility.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76bcc471e53fdb7d83fd04f99b9234941af616f750168647d29c0616a6bf758"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function submitPermission (cyclomatic 24, cognitive 28): submitPermission has cyclomatic complexity 24 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/daemon/src/routes/activity.ts"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e82175acc084b276a7c57a8166bce08806e2b5966fe51b76444a16c878ffc5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 26): (anonymous) has cyclomatic complexity 24 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/commands/capture.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0bd4cb72d182d9df161488b1c6554df9405331b2a2123a9f22f6e10d367d93"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applySeatSkills (cyclomatic 24, cognitive 26): applySeatSkills has cyclomatic complexity 24 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/daemon/src/domain/seat-skill-apply.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"03745a08ce116807735316cae1ac245ba95468ec905228fc472b96761bbf0566"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writeFixtureSlice (cyclomatic 24, cognitive 26): writeFixtureSlice has cyclomatic complexity 24 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/daemon/test/review-fixtures.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3d7d2946d3d6a92f30938d8aca6825b553f47cb8de3d60b7d11c96daafe100"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 25): (anonymous) 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/commands/mcp.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f32de7b5c4096e9dbf402a880148c072e939e1606743ca2f62d186d1963f653"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function piCredentialSource (cyclomatic 24, cognitive 25): piCredentialSource 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/daemon/src/adapters/pi-readiness.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"e14083f1ab016b04c49f7267f8667073d26b2271183c8accaf129458a173de15"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function read (cyclomatic 24, cognitive 25): read 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/daemon/src/domain/gateway/slack/state-store.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"10360d5b66f981b72f0eced4d8b9c1b37a542bdbbc4ef7f8ad82c04d77a4f869"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 25): (anonymous) 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/daemon/src/routes/files.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b730e5ddef2765bfc483a2bbcf92c78391337ea90d263ffc0a49f27bdaa23d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function finishManagedWake (cyclomatic 24, cognitive 23): finishManagedWake has cyclomatic complexity 24 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 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ed82c7ff00056a3382a18b635451ecca92f8d4e90133bb402bd79aa71e5b6d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 23): (anonymous) has cyclomatic complexity 24 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 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/daemon/src/domain/queue-stuck-sweep.ts"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"852fa5c6d795c845a397adff525817dfb548ec8142e93b5f2f24a91d539d49e3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openView (cyclomatic 24, cognitive 23): openView has cyclomatic complexity 24 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 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/daemon/src/domain/terminal/terminal-service.ts"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ac6afdb3e7148e3b56713ce770a14466ff74745804f9a599b4bed12640aa94"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function piUsageRequest (cyclomatic 24, cognitive 23): piUsageRequest has cyclomatic complexity 24 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 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/daemon/src/routes/activity.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4358906a6a2cce9bf86d6b11a17e4b114d759961b3ffa72e5ad52e345f2f50"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 20): (anonymous) has cyclomatic complexity 24 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/ui/src/hooks/useGlobalEvents.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96abca44537accac684de5cc4db08e2047d8afa85c488df70fe98930407b7c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openMissionControl (cyclomatic 24, cognitive 18): openMissionControl has cyclomatic complexity 24 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/front-door.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e35bd7f32474512ce6eaa544e17b578cdea1de47feec07b6e4837167ce490a9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 18): (anonymous) has cyclomatic complexity 24 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/daemon/src/routes/seat.ts"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa88e30c0b4ab83e8dbf87fca57b4b19903ac8f7a50f1235fa3527bd4acb0bbd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dispose (cyclomatic 24, cognitive 17): dispose has cyclomatic complexity 24 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/daemon/src/domain/health-diagnosis.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"196030a789b9ae257567b037295ae99b87c8d53399fc0e231e6ae3f0d68c58e4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function planProjection (cyclomatic 23, cognitive 56): planProjection has cyclomatic complexity 23 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/projection-planner.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"343f3ee384ca47672ddef9e1cff02463a6af3c7ddfeebc56026cf3481ed6ac49"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evalExpr (cyclomatic 23, cognitive 49): evalExpr has cyclomatic complexity 23 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/cli/src/release-surface/extract-surface.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc0c7c8bcc62dd24cec1a12274056faa9333f58ea34c99b6a3226a8de48e6ae0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 23, cognitive 49): (anonymous) has cyclomatic complexity 23 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/daemon/src/domain/gateway/slack/slack-subsystem.ts"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"b211acc7c2a82eeac7329ae2e630ae37179ab4f5a2461a877f5f927b5614a459"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sweepHookBridgeOnce (cyclomatic 23, cognitive 42): sweepHookBridgeOnce has cyclomatic complexity 23 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":2944}}}],"partialFingerprints":{"codehealthFindingId/v1":"51417ef7caeae5bfc5b0d411831d93a9bb26b9801c1a78a83925b14c62d6fb95"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function composeAttentionRollup (cyclomatic 23, cognitive 40): composeAttentionRollup has cyclomatic complexity 23 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/commands/workflow-render.ts"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5cc6f89993fa04e986cf302ae7f3271a6688205693100fb516e0f38ed6af7b9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseClaudeTranscript (cyclomatic 23, cognitive 40): parseClaudeTranscript has cyclomatic complexity 23 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/restore-packet/claude-transcript-parser.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece09557108e1d86dc1d8b1d6103a30903b011d9a713219895c80a1b64ce8b23"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onmessage (cyclomatic 23, cognitive 39): onmessage has cyclomatic complexity 23 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/daemon/src/domain/gateway/slack/socket-inbound.ts"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab6d3269fb3b1aab0253a94ac650ecedf93c6ef124bcf04c0ad54747a70899e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function piCredentialEvidence (cyclomatic 23, cognitive 38): piCredentialEvidence has cyclomatic complexity 23 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/daemon/src/adapters/pi-readiness.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75c1a8edbd52d9cf8261508591a2ad922c05489abf956089ba14688453033dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 23, cognitive 35): (anonymous) 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/daemon/src/routes/seat.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fdd0f3f7afe97c23fbec53c06c126d707b3bd1ae5304134de7668f044afe38a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runSuite (cyclomatic 23, cognitive 35): runSuite 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/test-system/delivery/run.mjs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"165e73c0de043ab634d4409e385bcbe417e17d5a1a5b419031331cd93e347082"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeGatewayMessage (cyclomatic 23, cognitive 34): decodeGatewayMessage has cyclomatic complexity 23 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/daemon/src/domain/gateway/protocol.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3c82215cae508fc093bcbf11ae458a2342726f45ff44f29d4ed67b518254bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inferCatalogProject (cyclomatic 23, cognitive 34): inferCatalogProject has cyclomatic complexity 23 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/daemon/src/domain/workspace/project-catalog.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac02520fc457acee76dee66bac59cdfc43305db2a5324ec7ad6a6e80edd34d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 23, cognitive 34): (anonymous) has cyclomatic complexity 23 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/daemon/src/routes/scope-approve.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db32d9de8966a203d778d0b4f2b5389520f391a9df9703c3ad3a08c768a7314"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 23, cognitive 34): run has cyclomatic complexity 23 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/daemon/test/herdr-viewer.test.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f6ea5f37662a7b0826c654b73195f631db84f9682ce456ef5f9702a7386496"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveView (cyclomatic 23, cognitive 33): resolveView has cyclomatic complexity 23 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/daemon/src/domain/terminal/terminal-service.ts"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"5911b54a84d5699a855eff69a2860d28cd39fd22e0f7a983a521042fad3544c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function archiveIfBeforeBoot (cyclomatic 23, cognitive 32): archiveIfBeforeBoot has cyclomatic complexity 23 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":"packages/cli/src/daemon-start-lock.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b391af7ede59a112c9b098d0afddbe95766ff829580b7d141b4b9f4f701be86"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evaluateCreateScope (cyclomatic 23, cognitive 32): evaluateCreateScope has cyclomatic complexity 23 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":"packages/daemon/src/domain/current-work.ts"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d0de9fb0ebc5f7ea51485df5aba6a39d1274717bb0c064738e71504689902d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function registerBundleProject (cyclomatic 23, cognitive 32): registerBundleProject has cyclomatic complexity 23 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":"packages/daemon/src/domain/workspace/project-registration.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4ccb96f50514d9d359b05ae83be86bb664a190a22e3fc1f4f4b4f1e95ee5b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveWorkProject (cyclomatic 23, cognitive 30): resolveWorkProject 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/lib/work-install.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"54749f52ecc801c1003f513ea39281e7884ca074f0be3b05413b88483039bb4a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 23, cognitive 30): (anonymous) 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/tui/test/registered-remote-hosts.test.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"72237ddb55915a27ac95e73a0962f2260737273be8424603312cc37a4bf55fa1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseTemplate (cyclomatic 23, cognitive 29): parseTemplate 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/decisions/decisions.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"0576ba8e225846774291e80629553b720d09becb0d25483a1b7e3d805bc60ecc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reportUsageFacts (cyclomatic 23, cognitive 29): reportUsageFacts 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":1438}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b0a2e9b8c627070e810f0cf857846e3cf0507ee3bfe944cfdfb1c490724ffd9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function remoteRefreshLeg (cyclomatic 23, cognitive 29): remoteRefreshLeg 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/daemon/src/domain/provider/usage-across-hosts.ts"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd9950c5a5ef1186cb16d5d2b866bb20d67de46f95fd3482dcaf1c3119bb330"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 23, cognitive 29): (anonymous) 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/daemon/test/profile-resolver.test.ts"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"34db09ba45cfbc637bf03749f13c26d30a0e120006bbad066cf506faf2600ddd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderBroadcastResults (cyclomatic 23, cognitive 28): renderBroadcastResults 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/commands/broadcast.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb5587e69926b019119136bed6dd7882b4b12d5f0325d189806a9400970949f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sendClassic (cyclomatic 23, cognitive 28): sendClassic 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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"477eb323e1a9b3364a0e966d5bd152245b898a263a9f2b6954bbf2b825435553"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkClaudeSeat (cyclomatic 23, cognitive 27): checkClaudeSeat has cyclomatic complexity 23 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/daemon/src/domain/provider/claude-seat-switch.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d96d0019856bcf4772ff0b231f2c41e2136548572baf2af7213d525aae4bd274"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deliverRebuildPrimingPacket (cyclomatic 23, cognitive 27): deliverRebuildPrimingPacket has cyclomatic complexity 23 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/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":1607}}}],"partialFingerprints":{"codehealthFindingId/v1":"0266668a4bf8164e49a3372a888b0b013d379fb3154dee172617acc03f59218f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 23, cognitive 27): (anonymous) has cyclomatic complexity 23 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/daemon/test/spec-library-starters.test.ts"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"a079d746e945c3dcd782db2e965c3ddacd4fb18a2b36c8faceea652c30841af6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function layoutHybridRig (cyclomatic 23, cognitive 27): layoutHybridRig has cyclomatic complexity 23 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/ui/src/lib/hybrid-layout.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"81eea21aad6e500376e734023c7aa2e7cec17744ab052630936b07e61030c810"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 23, cognitive 26): (anonymous) has cyclomatic complexity 23 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/commands/gateway.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a4ff9d89299461bdff3728d8de73f17ebd6c24b135686c4980ca7f2f57d8c7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decideCodexFilesystemPolicy (cyclomatic 23, cognitive 26): decideCodexFilesystemPolicy has cyclomatic complexity 23 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/daemon/src/domain/codex-filesystem-preflight.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"992a649cf896e88f50780df3e4cbdb0416afc2866023eb18a2ed5992f317f080"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ensureOpenRigInstance (cyclomatic 23, cognitive 26): ensureOpenRigInstance has cyclomatic complexity 23 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/daemon/src/domain/instance-initialization.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"553ecfdaa0b41da1ad38fbaba3b091db04fe82b9075dd40a3e12c15a1a8859b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function useScopeMarkdown (cyclomatic 23, cognitive 26): useScopeMarkdown has cyclomatic complexity 23 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/ui/src/hooks/useScopeMarkdown.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96707be77aebabc87d86de14e5cd32e647ca5edac135226b6a7c367f0417c23"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyEffect (cyclomatic 23, cognitive 25): applyEffect has cyclomatic complexity 23 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/decisions/stream-consumer.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"e85932d91b0d4dadb62eacb4c5ab5d05240e20887bb49fe90e4515ac3ad9429a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkStartupContext (cyclomatic 23, cognitive 25): checkStartupContext has cyclomatic complexity 23 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/daemon/src/domain/restore-check-service.ts"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00a4dfbc317342fbe2dcf3a135e699581a7fb99aa92d932e5cb0bf7edd28dc4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setPermissions (cyclomatic 23, cognitive 25): setPermissions has cyclomatic complexity 23 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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a879f05928ddf608f897a3ad3a2d5eb3bbcda0052b68981b32ee630b06b61c8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stopManagedTmuxSeat (cyclomatic 23, cognitive 25): stopManagedTmuxSeat has cyclomatic complexity 23 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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":2099}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a15eed3a75b1025056a28de84e5f45e2e4a005874c9a61e469f39a5d3e122f0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function useMissionDiscovery (cyclomatic 23, cognitive 24): useMissionDiscovery 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/ui/src/hooks/useMissionDiscovery.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b802c16d0b0a5f6636b89e3d8b53fb3885649c6e5bd598588e2b656abad6db9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mapResult (cyclomatic 23, cognitive 23): mapResult has cyclomatic complexity 23 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/mcp-server.ts"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9fb854530f4297da60cc40960a9eb06ecc1a5c52c3c315dfc81017883de2164"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function settlePairRequest (cyclomatic 23, cognitive 23): settlePairRequest has cyclomatic complexity 23 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/daemon/src/routes/hosts.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"774453bab7162b54739711260dee374fe0376661703e0f69d2fade854a37a867"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scopeIdentityLines (cyclomatic 23, cognitive 23): scopeIdentityLines has cyclomatic complexity 23 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/tui/src/scopes/scopes-model.ts"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"a247b079c41332f43665f60b310cbbeaa30f9a51834b01e7aa4af17ba9a527cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 23, cognitive 22): (anonymous) has cyclomatic complexity 23 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/test/lifecycle.test.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a4b552956bb7a6656510d3d137c58ae6ead6111ce43062e5e498fcf1e2da92"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stageSuccessor (cyclomatic 23, cognitive 22): stageSuccessor has cyclomatic complexity 23 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/daemon/src/domain/successor-session-launcher.ts"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"9344f185b6feb7b73c858225313e3656ccdff456411f35d09a61d9ec8e4f5b4a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function projectDependencyGraph (cyclomatic 23, cognitive 22): projectDependencyGraph has cyclomatic complexity 23 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/daemon/src/domain/workflow-projector.ts"},"region":{"startLine":1244}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed987a77f6bfbafba85a656dfcd6bc49f07cf0a68086e2702a5c4268ba32e430"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function makeFatNode (cyclomatic 23, cognitive 21): makeFatNode has cyclomatic complexity 23 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/cli/test/ps-compact.test.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64bc6e611f1203eca0a80d24332a8b63d3838254b7b6939755a153b686c047a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bind (cyclomatic 23, cognitive 21): bind has cyclomatic complexity 23 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/daemon/src/domain/claim-service.ts"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc233dc1f12903398ad9aef4bd4c4030103159a2402e323c720eac4583e8460f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 23, cognitive 20): (anonymous) has cyclomatic complexity 23 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/mcp-server.ts"},"region":{"startLine":1818}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e7a9a4be4d12b6d5ebcb5b5824e1eb5032628cf98989f3d5fe86699920babe7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function claudeAutoModeStatus (cyclomatic 23, cognitive 20): claudeAutoModeStatus has cyclomatic complexity 23 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/daemon/src/domain/claude-auto-mode.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"f569481af2bf1652c0416f89052ef7a9c5e64c81f2c79e7810ccacc9292c09ea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseInboundEnvelope (cyclomatic 23, cognitive 20): parseInboundEnvelope has cyclomatic complexity 23 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/daemon/src/domain/gateway/relay-inbound.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"3deee1d222bae459797daad953cbb83d65420e196462c54e1098c38ca50eacc2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 23, cognitive 20): (anonymous) has cyclomatic complexity 23 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/daemon/src/domain/queue-stuck-sweep.ts"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"43094080f87409cb857fc2f296c35811e120e3ab061003bae1917faa605afde8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function claudeDeliveryObservation (cyclomatic 23, cognitive 20): claudeDeliveryObservation has cyclomatic complexity 23 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":4405}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b12354e95d509b6ededf58eed6e0be5c91692c82c8d88215801f91d5912d12f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SeatOverviewTable (cyclomatic 23, cognitive 20): SeatOverviewTable has cyclomatic complexity 23 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/ui/src/components/SeatOverviewTable.tsx"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c2672e5f247394c35c4c66da837930512fe660859fb60b70b094550372b578"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executionSliceStripLines (cyclomatic 23, cognitive 19): executionSliceStripLines has cyclomatic complexity 23 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/tui/src/execution/execution-model.ts"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"636e2cdf8adc7533da4b8928f284379122d4e7c43111e37196872ae5bfc4fb5c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ForkNowAction (cyclomatic 23, cognitive 19): ForkNowAction has cyclomatic complexity 23 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/ui/src/components/agent-images/ForkNowAction.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"c580eaf01df5998e71f0dec8bf581c77b48fc02e01aba503b80b2bae69fcc2dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function PackageInstallFlow (cyclomatic 23, cognitive 18): PackageInstallFlow 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/ui/src/components/PackageInstallFlow.tsx"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f78b7efc5bd9b42d78a9383e65415b9b759b447b42083ae605db71d435fc0e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function RigSpecDisplay (cyclomatic 23, cognitive 17): RigSpecDisplay has cyclomatic complexity 23 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/ui/src/components/RigSpecDisplay.tsx"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c3c6308c8e110e514adc6b4ffa7f57f2a1076af9dc9bb0d5c4c6306767918f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getRunnerObservation (cyclomatic 23, cognitive 15): getRunnerObservation has cyclomatic complexity 23 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/daemon/src/domain/agent-activity-store.ts"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7a37ee07014ba90205a9adba547272d2c763111d570116c4d581dded831620"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareWork (cyclomatic 23, cognitive 9): prepareWork has cyclomatic complexity 23 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/commands/environment.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e3de3c1aecb124e89afc78d7ffe1429b6ee81a77db3c81d5b7fbe0f0d77c313"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function read (cyclomatic 22, cognitive 43): read has cyclomatic complexity 22 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/acp/agent-server.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"97be090b1a5954269b40405507d026b82f11078bc7d6d72b6aa68a51ad8dc4e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deliverStartup (cyclomatic 22, cognitive 43): deliverStartup has cyclomatic complexity 22 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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e9392426bb3a37139de0a6ef259719b8f2f6388baa8d568ad12582c96e493ce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateContinuityPolicy (cyclomatic 22, cognitive 42): validateContinuityPolicy has cyclomatic complexity 22 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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52a7d6dd161451663d4a73548bc292946b1c80daf02dd8f83dabece67665f7d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function composeView (cyclomatic 22, cognitive 42): composeView has cyclomatic complexity 22 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/daemon/src/domain/terminal/view-composer.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a114517246574a6b875bf18351163fe35dd1de9933fdfae50d42a40725ff947"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dismissSkippableCodexUpdatePrompt (cyclomatic 22, cognitive 39): dismissSkippableCodexUpdatePrompt has cyclomatic complexity 22 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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":1387}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b009f2ee62ee1d2630a5276934e97ca98fdaace3e87e0b140a231b108626d8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeRecoveryGuidance (cyclomatic 22, cognitive 39): computeRecoveryGuidance has cyclomatic complexity 22 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/daemon/src/domain/node-inventory.ts"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"855a75f5cd97196d4923f354f1c9d784c4484c29b8ae836f15132213ec024528"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function errorResponse (cyclomatic 22, cognitive 39): errorResponse has cyclomatic complexity 22 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/daemon/src/routes/watchdog.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72dcf5baaeea71b739a5e1f7e482d9be1217a86ef754b0c0737433516d9e5f1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkGeneratedEdges (cyclomatic 22, cognitive 38): checkGeneratedEdges has cyclomatic complexity 22 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":"scripts/mirror-skills.mjs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1cb5d7008ef5f18325be68877ca4df49c22c210deb26a72411522823fb99532"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function routeBundleContents (cyclomatic 22, cognitive 37): routeBundleContents has cyclomatic complexity 22 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/daemon/src/domain/bundle-content-routing.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da4cac80d5e09927cb55bb17435086423c11f9b9eaaa4c420abe11ffd1ab190"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function newestPiModel (cyclomatic 22, cognitive 36): newestPiModel has cyclomatic complexity 22 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/daemon/src/domain/model-divergence/effective-model-readers.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"cafd1a8b6bafeef219bae15cf2619f335aabd6e4722311ddab43275e5d908614"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function check (cyclomatic 22, cognitive 36): check has cyclomatic complexity 22 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":"scripts/check-first-run-references.mjs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"16877d034123b56f4a711c4144b761bb9c46f09b1fd6bedcd4ebe7a06b3b2035"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateChannelMap (cyclomatic 22, cognitive 34): validateChannelMap 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":"packages/daemon/src/domain/gateway/slack/channel-map.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb960f343ef566061254006ae9f707775335facf16a3d6037c8925bc902eb131"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 34): (anonymous) 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":"packages/daemon/src/routes/review.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c04dc6d46178543d78f720b674c13b57966ae5fb2f106082c646150de19190"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function remoteCounts (cyclomatic 22, cognitive 33): remoteCounts has cyclomatic complexity 22 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/daemon/src/domain/hosts/fleet-scopes.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4e069cec163472a02bfa8bbe94f2483f8b465b8d5768e0a574a77f49c94f47"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function explainNativeRejection (cyclomatic 22, cognitive 33): explainNativeRejection has cyclomatic complexity 22 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/daemon/src/domain/native-process-lineage.ts"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ced086bae876dbc5f4752318f02e743d53354693e0b815c8f27cfdc58764bb1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function proofProvenanceLines (cyclomatic 22, cognitive 31): proofProvenanceLines 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":"packages/tui/src/scopes/scopes-model.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"19e9e565a6f032ff278cf40ed01561785f204864fdb78c36500bde341c3c21cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 30): (anonymous) has cyclomatic complexity 22 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/daemon/src/adapters/tmux.ts"},"region":{"startLine":1338}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b1add167b766ebf41a24b4caf964906b88444476e9ae43ec02e624f8aff6f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function project (cyclomatic 22, cognitive 30): project has cyclomatic complexity 22 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/daemon/src/domain/provider/claude-usage-windows.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"b565a4914c737d29cc8a1830be5527ad664cba3d99aba65a91fd822a59ec2493"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validatePodBundleManifest (cyclomatic 22, cognitive 29): validatePodBundleManifest 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/daemon/src/domain/bundle-types.ts"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"6adacd81602dcba724cebeccc2755a438793a3ff67b21fc23e445619bfaf619b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function project (cyclomatic 22, cognitive 29): project 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/daemon/src/domain/environment-platform.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a0e077e6f22cb36db5657c7624fe495c372c5f45fa9435a75d513e993d567f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 29): (anonymous) 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/daemon/src/domain/workflow-runtime.ts"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"42de459a830008483f87e139a327d84718af1e37b905a13180441fe38967017d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveKeyAction (cyclomatic 22, cognitive 29): resolveKeyAction 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/tui/src/input.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8899b603423b35d10577d5bc9db89d61c84ebc4b1f126a5e3682e17e0cf83f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadHostBindings (cyclomatic 22, cognitive 28): loadHostBindings 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/host-bindings.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3659f692bff06c6ad5ed9a9fe3bfe6d13bd95b87d095d2e0c59b6df8116d8fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function provisionManagedBootstrap (cyclomatic 22, cognitive 28): provisionManagedBootstrap 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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":1144}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78bcf73b7022c3774e34efebbe6a822a465916ab850c3ee3897dda51c44e100"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function agentResolvedAgainstRecordedRoots (cyclomatic 22, cognitive 28): agentResolvedAgainstRecordedRoots 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/daemon/src/domain/desired-claude-activity-hooks.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"3929cb72263ecb4b6fb65dd98ff9a745338e76228b20b1161974ff70d45f8648"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function proofEvidence (cyclomatic 22, cognitive 28): proofEvidence 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/tui/src/scopes/scopes-model.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9d3e5ed474674091066fa46144c4e2470654b135d6519273bcfde0b0528da1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sendClassic (cyclomatic 22, cognitive 27): sendClassic has cyclomatic complexity 22 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/daemon/src/adapters/claude-resume.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d308e3b306fdfde0edf33da9b03e7d3d80b3b82c022bbcaa6b1b24c400cd421"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function candidatesMatching (cyclomatic 22, cognitive 27): candidatesMatching has cyclomatic complexity 22 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/daemon/src/domain/native-process-lineage.ts"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f54e8472c591ee72f1becd20e2beecb7b69639e6f28e03e6413b4138112501"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function confirmOwnRig (cyclomatic 22, cognitive 26): confirmOwnRig has cyclomatic complexity 22 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/commands/down.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"21532244e44d87a2e7f549f98ab1febf6a115d89e3002ddf31f9b00a9eb1e96a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkBundleFolder (cyclomatic 22, cognitive 26): checkBundleFolder has cyclomatic complexity 22 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/lib/bundle-check.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e6ba5821c3a6d4f276ab45959fb0276251d470fc21b0ae2134420ee6a6d761"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function credentialPrecedence (cyclomatic 22, cognitive 26): credentialPrecedence has cyclomatic complexity 22 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/daemon/src/domain/claude-managed-launch.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a852ecc7b16d72f35af0767671dc195eb91b44b868140a1f212d9077104735c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function observeSeat (cyclomatic 22, cognitive 26): observeSeat has cyclomatic complexity 22 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/daemon/src/routes/startup.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb02ce6278bd5b5660972285c2cecbca568266fd29a92115e4bafaa2272b8da"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function copiedResource (cyclomatic 22, cognitive 26): copiedResource has cyclomatic complexity 22 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/daemon/test/seat-set-cwd.test.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f979a9294cee4d2525df0192e0f571417f0776cda735e3656703fa50882a62e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 25): (anonymous) has cyclomatic complexity 22 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/commands/context.ts"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"234ba72a9fb256b21bbe68d8b947cbfe914114c72eca26bc7161a8d2537a3e1b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decide (cyclomatic 22, cognitive 25): decide has cyclomatic complexity 22 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/decisions/decisions.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b262a9b00dc052f3cd6af689c5f7e1962ea9efe4e6f22838adb41ce7dc3be83"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 25): (anonymous) has cyclomatic complexity 22 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/daemon/src/domain/mission-control/mission-control-write-contract.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"37fc09c3d8cfe6699e676aa132b5bc46ba72aca742417176d336acae422cc4e4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function withDeliveryGuard (cyclomatic 22, cognitive 24): withDeliveryGuard 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96a75a45e2b21608b0d5247606f91cb17e9f3d743f73489579b21f4db2bb8e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 24): (anonymous) 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/daemon/src/domain/skill-audit.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2c8f3cfebf48467641e37eeb729364f04858c61ec8c27430f5a9291b790f31"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deliver (cyclomatic 22, cognitive 24): deliver 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/daemon/src/domain/watchdog-delivery.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac69f68d59925095cc5a1dbab401c74dc661479c3c605e944ac4643b21b55dc9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function target (cyclomatic 22, cognitive 24): target 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/daemon/src/routes/proof.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee4d784b0998cd65212135a270c7e9652dded7931c511fc00cf46eb27ac4f5f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 24): (anonymous) 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/daemon/test/pi-shell-launch-native.test.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4fa55150ddc1fd96b8956a372b0fb24eed4a69f183c25678580c56a5a35e2d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function launchExistingTerminalMember (cyclomatic 22, cognitive 23): launchExistingTerminalMember 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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":2975}}}],"partialFingerprints":{"codehealthFindingId/v1":"12da9fcfb4722e5d873083477ef292114cb357eed6cea448e99ae1222a72b491"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseTerminalPolicy (cyclomatic 22, cognitive 23): parseTerminalPolicy 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/daemon/src/domain/terminal-policy.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"468648ce48609722a2a39796a9fe06238b2fb59d35d57e08fa1d98b135a2bc86"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 22): (anonymous) 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/cli/src/commands/proof.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0b0341fad7784ea159e9a281f5310d3e7aade445265accdf3a1938416e01b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readLaunchResult (cyclomatic 22, cognitive 22): readLaunchResult 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/daemon/src/domain/community-harness-launch-result.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c0a7a40bb1e66778610bdbde651da0310c7c0b9bbb313abaa143b3de5abb218"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startServer (cyclomatic 22, cognitive 22): startServer 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/daemon/src/index.ts"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a5d338bbbb62f77512626470cda36053bdd66c984a41d11b5979dcafa02d868"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SliceReviewTab (cyclomatic 22, cognitive 22): SliceReviewTab 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/ui/src/components/review/SliceReviewTab.tsx"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae6ba8561522a14060237857fc58148ab7188f787c4e3d5b4405ad8241686e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readLibraryConfig (cyclomatic 22, cognitive 21): readLibraryConfig has cyclomatic complexity 22 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/daemon/specs/agents/shared/skills/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"199ff7dfaeba2a542a0800cdf420fd339d33c67b0033df3a897e23ee2a1e28b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function communityHarnessLabel (cyclomatic 22, cognitive 21): communityHarnessLabel has cyclomatic complexity 22 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/daemon/src/domain/community-harness-presets.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb6c0e0d062f7e19a4401dbc00e80d0579d89522af725a82e81ff49ea82f53ae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function diagnoseSeatParked (cyclomatic 22, cognitive 21): diagnoseSeatParked has cyclomatic complexity 22 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/daemon/src/domain/parked-query.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"41beda79108107ede66ed5e8eaba5b2370b526f30963fdb0115ca675d2192864"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rowToItem (cyclomatic 22, cognitive 21): rowToItem has cyclomatic complexity 22 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":6350}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ec9dd6b6b634cac86e1b4f8eae6e7b5368962422526b27f6e4dfdcbcaf1b71"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function contract (cyclomatic 22, cognitive 21): contract has cyclomatic complexity 22 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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"61525414ed623abd405e9f14887bec5fc9bf9326237b141192ad929f97f241f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evidenceFromHookActivity (cyclomatic 22, cognitive 21): evidenceFromHookActivity has cyclomatic complexity 22 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/daemon/src/routes/activity.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"060c372487555fd8064cd05b3ce2cd350427bfd5fc513f85fe8509d5937b13f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readLibraryConfig (cyclomatic 22, cognitive 21): readLibraryConfig has cyclomatic complexity 22 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":"skills/_canonical/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"232e5b28b703a05abdfc90003854b7605e38782c454b6f8264c6fd7abed6591c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function streamOutcome (cyclomatic 22, cognitive 20): streamOutcome has cyclomatic complexity 22 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/commands/stream-outcome.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"068ddc47290cdedc59bf5b6532e192f6fd4ddd6af236d278d2d089555120f9fc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getOwedRestore (cyclomatic 22, cognitive 20): getOwedRestore has cyclomatic complexity 22 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"d331eddee26541bf5a1a0c3f73d89890c054a679a565b04a674fa193608b8cac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 20): (anonymous) has cyclomatic complexity 22 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/ui/src/components/DiscoveryPanel.tsx"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb55b8e57a56bd4362c2bec0181569d4b29185228da621ff1879097ae788c34"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function repairMissingPane (cyclomatic 22, cognitive 17): repairMissingPane has cyclomatic complexity 22 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/daemon/src/domain/claim-service.ts"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"fab8fe78d524c0475f078d7e1b1ca25e46e74a90734f95185675113e2e98fdda"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function locationKey (cyclomatic 22, cognitive 17): locationKey has cyclomatic complexity 22 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/tui/src/state.ts"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"835a0813cd11b30a47c91f2d023e6000dc904a00a150404315044cfca77f3b22"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 15): (anonymous) has cyclomatic complexity 22 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/commands/workflow.ts"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb91b6a3e5b2e65289dfaaa7c54589a906c986a0a4a64ce4474b690a224911d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function observeCodexRebuildPermissions (cyclomatic 22, cognitive 15): observeCodexRebuildPermissions has cyclomatic complexity 22 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/daemon/src/domain/codex-rebuild-permissions.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da6fda9df110c9be5c89e75dcce2b1ef0d27d773f13ad274509e71dedd01caf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function settledElsewhereHeadline (cyclomatic 22, cognitive 14): settledElsewhereHeadline has cyclomatic complexity 22 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/ui/src/components/for-you/FeedCardQuestionAsk.tsx"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"57d05e31f3c34affe57a7207a41b514db3a3b67053254a5adeca84b42617ae47"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 45): (anonymous) has cyclomatic complexity 21 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":"packages/cli/src/commands/policy.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"e25c11505691ff31bfde7574d312890e2255bd9362564dbb4c89e3967b851214"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateMappedFrontmatter (cyclomatic 21, cognitive 39): updateMappedFrontmatter has cyclomatic complexity 21 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/lib/scope/scope-fs.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"2623bca8adfa405584aafef8b9f5091f11b7709fa52889bf27327817b060e94b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseProgressFile (cyclomatic 21, cognitive 39): parseProgressFile has cyclomatic complexity 21 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/daemon/src/domain/progress/progress-indexer.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde84bf238ee53383dc82771564b6be3cde8d1758a41191cf2689fb96ced92ac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 37): (anonymous) 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":"packages/daemon/src/routes/scope-audit.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"c70bdc17d6deff12d01c96ed1f1f9dd5bcec300a8a13b8f0c2823c651504abaf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function projectTaskOwners (cyclomatic 21, cognitive 36): projectTaskOwners has cyclomatic complexity 21 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/daemon/src/domain/terminal/task-terminal-view.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb6f6dc3222317b238f1e512d33a92814e0a7fd5fd3472b76192bbd47c355b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function unpack (cyclomatic 21, cognitive 35): unpack 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":"packages/daemon/src/domain/bundle-archive.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9c6db148da17ac1891437230a22eb296be3687a324d0fc568342d73830ec7b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function adoptLivePanesRig (cyclomatic 21, cognitive 35): adoptLivePanesRig 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":"packages/daemon/src/domain/crash-cart-conductor.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1302ec31b83e7cddddd4358783f03222fad9940eafc9101995c12f15089a035"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function statusAcrossHosts (cyclomatic 21, cognitive 34): statusAcrossHosts 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/cli/src/commands/provider.ts"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac3b70144808f974c770b097f8d99a3183aa1622ab95d4f00c60ce3846f338aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addGitContext (cyclomatic 21, cognitive 34): addGitContext 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/cli/src/lib/context-git.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"325126e9842370a965a0289084fccbd43b89e4bd853e74f6376a4538c83726ba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function removeCodexActivityHooks (cyclomatic 21, cognitive 33): removeCodexActivityHooks has cyclomatic complexity 21 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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f47f94e4d8ea4a085b2ef5bc044b18c2912d0896c4b863bf9aabba84c2b28fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleRoute (cyclomatic 21, cognitive 32): handleRoute 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":"packages/cli/test/package.test.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee61ce6ada1b58837a89f8cd650e65392edd753e2ca59df44dd0f90837cf93a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderPlainTextBody (cyclomatic 21, cognitive 32): renderPlainTextBody 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":"packages/daemon/src/domain/gateway/relay-outbound.ts"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"12652bf2d6ab6f6ab47fe3bf9b736af932143fc0baf02042bf54f294bfe61328"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 31): (anonymous) has cyclomatic complexity 21 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/commands/context.ts"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a32136ece8a38425f57f997993b7bd1071d4a2285f3d29c44def261fbc3bcf6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function waiter (cyclomatic 21, cognitive 31): waiter has cyclomatic complexity 21 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/daemon/assets/claude-hook-bridge.cjs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"90150750aed8d85f1073f9eb32265f3bf5b7eaa29115632d662f8b26c5c80f53"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 31): (anonymous) has cyclomatic complexity 21 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/daemon/src/domain/gateway/slack/slack-api.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf671da093740a41fe6883b31c0f3343a0dddd3debc688f463eab7e891cb21d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 30): (anonymous) has cyclomatic complexity 21 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/commands/seat.ts"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"fab1a534119a93b6ad195c1928fb94cc563a33fb5a7353a4fc8f299ed38f1c76"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function retryPromptWakesOnClear (cyclomatic 21, cognitive 30): retryPromptWakesOnClear has cyclomatic complexity 21 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":2066}}}],"partialFingerprints":{"codehealthFindingId/v1":"c596a94ba9a50871ad6c9c57e7b95be5e32778c7f29d6a768904b6d9e37d350f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkHooks (cyclomatic 21, cognitive 30): checkHooks has cyclomatic complexity 21 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/daemon/src/domain/restore-check-service.ts"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"5daf033cb01f5ad0519e5bd8038a46028ced999be6b22b9c4b5068faa3a04fb1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function instantiate (cyclomatic 21, cognitive 30): instantiate has cyclomatic complexity 21 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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec17534a291619af1e6a5f75c95e8cb3d6cded2c8a822714e2d42eff0227380"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function waitForIdle (cyclomatic 21, cognitive 30): waitForIdle has cyclomatic complexity 21 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":4268}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e245c61b007327ce6e23fce0a44801e8c1cdb13b1c85401eff4aa40365d9db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function answer (cyclomatic 21, cognitive 30): answer has cyclomatic complexity 21 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/test-system/delivery/stand-ins/messages.mjs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c136ca000f5d17d25c83dc5f6ee88cfcfcf2a969b96eda8798cf49fa7f5c4e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toDisposition (cyclomatic 21, cognitive 29): toDisposition has cyclomatic complexity 21 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/decisions/stream-consumer.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1add9700486c485e9046b40342003118e2dd725c199052d1031a6712dad5e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 29): (anonymous) has cyclomatic complexity 21 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/daemon/src/daemon-db-path.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"e469db909bb9e41b9eab8f4f57ab95da396d848d7c9a69d93567104d56f2ad83"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateServicesBlock (cyclomatic 21, cognitive 29): validateServicesBlock has cyclomatic complexity 21 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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb365dae6a51ebbca0a3a39b2708d788bc0f611d788fe1a9dc5c40851d50565b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 28): (anonymous) 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/commands/requirements.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"0184a920eb191d592522769542df5e383723a54a6cec6ba02396633c5d333def"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pollAllRunningTmuxSeats (cyclomatic 21, cognitive 28): pollAllRunningTmuxSeats 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/daemon/src/domain/seat-activity-service.ts"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f3af3fd807c406a30a95a0a30cb7ede9a9df94f4df37d9f11cce062ed8dbf4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolvePluginSkills (cyclomatic 21, cognitive 28): resolvePluginSkills 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/daemon/src/domain/skill-catalog.ts"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"143cf4c58d1f60f27f81ebe65beafdfb912d8dc8c7e0e88a49d4fdffbfc4ad5e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 27): (anonymous) 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/commands/queue.ts"},"region":{"startLine":2224}}}],"partialFingerprints":{"codehealthFindingId/v1":"587dbbbe280d0518746a13bbcbfba9edc873aae63ff46e25dbbee85aeb6f25c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function retryOwnDeadLetters (cyclomatic 21, cognitive 27): retryOwnDeadLetters 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/daemon/src/domain/gateway/slack/inbound.ts"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac359bae8175404dfe039555cfbe10ef29f3e2bb60d3cf22627847dbb52bea5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function projectionCopyDirectory (cyclomatic 21, cognitive 27): projectionCopyDirectory 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/daemon/src/domain/seat-cwd-preparation.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34e397fe0d248e25096f63dda7489ed1ab867a08f1e05d00e8b71a0de564e2f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 27): (anonymous) 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/daemon/src/routes/workflow.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad0e43d7cdcb11e3aa2000e8558e48142c7607ca0222a3fcb9b30bf76e695a9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 26): (anonymous) has cyclomatic complexity 21 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/daemon/src/routes/rigs.ts"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8929a7e84b13b9bfb1a5e8a567ddd3696751720e48de164e492da7d6f7293f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setup (cyclomatic 21, cognitive 26): setup has cyclomatic complexity 21 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/daemon/test/seat-restart-in-place-native.test.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d935583d027739afcb0bbee04fb9849d7df84afbf671c65c1da77dc024dd51c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function usageHostsLines (cyclomatic 21, cognitive 25): usageHostsLines 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/tui/src/usage/usage-hosts-model.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb403fe00559d86b0c14973445c0f9a0f552b271ec65edd3390b2a7b45a1204f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildOpenRigPayload (cyclomatic 21, cognitive 24): buildOpenRigPayload 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/daemon/assets/plugins/openrig-core/hooks/scripts/activity-relay.cjs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"8713552befa72491958b8426ccfeb8a64e15a69b8b848765441b11548bd0a696"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setEffort (cyclomatic 21, cognitive 24): setEffort 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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc2c911dac69fdaea8fcff5516187ef1ce68dc282d94cb5b9bb325874d4985f1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 23): (anonymous) 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":"packages/cli/src/lib/bundle-check.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd5d4dcfd8824f9b3eeb627478ba72fa082b5db1344df609275f79347417708"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setParticipants (cyclomatic 21, cognitive 23): setParticipants 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":"packages/daemon/src/domain/network/network-installations.ts"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"64380273df831c18d824471b0bce58fe07c3452533e68a00cf4040e773dbd254"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function quietHoldCustody (cyclomatic 21, cognitive 23): quietHoldCustody 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":"packages/daemon/src/domain/quiet-hold-custody.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"874a525146cb4cd50e965d20f17a457cca26f72df8d5976ea84fabfebe06b620"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveExports (cyclomatic 21, cognitive 23): resolveExports 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":"packages/daemon/src/domain/role-resolver.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a118f709131652c2395be6082c98d89cce714d06f2a5f4c7bc03cbe56f29664"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function endVerified (cyclomatic 21, cognitive 23): endVerified 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":"packages/daemon/src/domain/terminal/herdr-app-provider.ts"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae418423e4bd8db407a0006bc74755c448b776e2a1050c8a6701a5b47568c21"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function probeFrontDoor (cyclomatic 21, cognitive 22): probeFrontDoor has cyclomatic complexity 21 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/front-door.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"71cb800d17f4a4da247845ebf8c97cc4bc0c690b73dda1f6c85ced76139633bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ensureEscalationRow (cyclomatic 21, cognitive 22): ensureEscalationRow has cyclomatic complexity 21 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/daemon/src/domain/queue-wake-ladder.ts"},"region":{"startLine":1863}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e4a24332d1eea16f0cd10d475421f462a5896ef26e464253ff385dd8bce61e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveComposed (cyclomatic 21, cognitive 22): resolveComposed has cyclomatic complexity 21 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/daemon/src/domain/terminal/terminal-service.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"354c158d2398fbb644424e4a27eee9e25e704ba5fc249e362003bd9d387704b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 21): (anonymous) has cyclomatic complexity 21 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/commands/restore.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22fe4a0488fe8130dae0c9fef0cb7121dabfc7a259c087ea6ce1017ddf72d01"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 21): (anonymous) has cyclomatic complexity 21 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/daemon/assets/claude-statusline-context.cjs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1f414b64edce7e436627535173e23094981f27b0ae4baaa150f871ec5c8fef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function serializePodBundleManifest (cyclomatic 21, cognitive 21): serializePodBundleManifest has cyclomatic complexity 21 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/daemon/src/domain/bundle-types.ts"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6412b89f43ebccd1fbaa3c4c79364628f1de2ce035eba90e71ec22b4eee81a0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readGuidanceProjection (cyclomatic 21, cognitive 21): readGuidanceProjection has cyclomatic complexity 21 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/daemon/src/domain/guidance-projection.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa701bd893e12841b8d323159ee0134b5d8d1a2ad414909ace6be81599bdb69"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectContextEpisodeEvidence (cyclomatic 21, cognitive 21): selectContextEpisodeEvidence has cyclomatic complexity 21 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/daemon/src/domain/health-detectors.ts"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71fd8e55baf1de628a7fdb54abc9f47c88a5921a28a089ab6e845ecaa26fee0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function seatLines (cyclomatic 21, cognitive 21): seatLines has cyclomatic complexity 21 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/tui/src/usage/usage-model.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5931648f5a2473dcc3b978c7d12e1ed0cf0ed014252e9a4d4dbcc51abc7fc8e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runnerUsage (cyclomatic 21, cognitive 20): runnerUsage 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/daemon/src/domain/context-usage-store.ts"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"944388473d6445a16fea8a04f93debd914af2904e4b01eb6bcac82176bb7c176"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function captureClaudeSessionId (cyclomatic 21, cognitive 20): captureClaudeSessionId 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/daemon/src/domain/resume-metadata-refresher.ts"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d5bf38109e6a2676ba33bcc6f5877b6c0324c25c9e5e46a37d09c5535f6dbb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isStoredServices (cyclomatic 21, cognitive 20): isStoredServices 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/daemon/src/domain/rig-repository.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff03fcb00c809a17a013486110dc3b60a6e5a4cb9e0269c15a00becd585fee0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 20): (anonymous) 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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":1320}}}],"partialFingerprints":{"codehealthFindingId/v1":"856b9867fca184cc60d4a876be942669cb0b5bbe8adf56b7aad9933927d5836d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function incomplete (cyclomatic 21, cognitive 20): incomplete 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/daemon/src/domain/seat-restart-in-place.ts"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d7f49377c5deb92d7b9a0258450acf9212e5977514cccf0668db905a5b411d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findCurrentPiDialog (cyclomatic 21, cognitive 20): findCurrentPiDialog 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e3344d07c471c507ae4a798682b41a18602f3a7ba23ae489ee1fb35d08b9a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 20): (anonymous) 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/daemon/src/routes/provider.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"f20837b913b89852370be7b8b81a09ad1621ab6e464163f81f6559b12c335c0d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 20): (anonymous) 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/daemon/test/claude-interactive-isolation.test.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee1bff5cad9a158ab2a161ec40bd10f7d6cb8303c1edb7ec5153d7630b97dd9b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveCrossHostTarget (cyclomatic 21, cognitive 19): resolveCrossHostTarget 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/cross-host-target.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7426f81053d210e7c59215d0578fc2c6eb615f8b5efd675267bdf3d2bccf047"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 19): (anonymous) 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/daemon/src/domain/outbox-handler.ts"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e3d3e2f932592da96561fa088877c056a6f6275c7fe0ee0a0ac06f4bede07e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function preWaitForIdle (cyclomatic 21, cognitive 19): preWaitForIdle 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":3309}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a9434f12a9402c7501ca42ef9f37e09924e8f189e3b4c5d1d322fc13ed6086"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function AppShellInner (cyclomatic 21, cognitive 19): AppShellInner 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/ui/src/components/AppShell.tsx"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ce4ea7d9af4cca008fc24495300ba35652e4a6fcce1549d2984ebe4e9eb903"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ProjectTreeView (cyclomatic 21, cognitive 19): ProjectTreeView 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/ui/src/components/project/ProjectTreeView.tsx"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f878c062f0ca51d46c6453cd297eb18904a3d1e02d2ae5958761261b056f54"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 18): (anonymous) 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/daemon/src/domain/health-checkpoints.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b4f665e64e9bee92f0456e1e1fbda0e160c68ffd8731117af593e3c2a03f7b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bindToGrant (cyclomatic 21, cognitive 18): bindToGrant 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/daemon/src/routes/activity.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b3ba194f34ff3451b77166b3251ef1e67edd8cf457265ff646e26866214c30"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readRecord (cyclomatic 21, cognitive 17): readRecord 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/daemon/src/domain/tmux-server-selection.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a7ce1e83ae15599b4a933e69b2cf6f2920cd748f14aee95708885b09c9d347"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function respond (cyclomatic 21, cognitive 17): respond 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/daemon/test/tmux-argv-legacy-equivalence.test.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"c903eef262b63a50582866cc6ba1eef9c84bf6cd53daf366c3bd50d2df8b87f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drainPendingPreparedCompact (cyclomatic 21, cognitive 16): drainPendingPreparedCompact has cyclomatic complexity 21 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"c784fa12d4f31472ce1c54bfa782e58fa01aa50563ea9ad9e46466ed488dd04c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function FileViewerWithFetch (cyclomatic 21, cognitive 15): FileViewerWithFetch has cyclomatic complexity 21 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/ui/src/components/drawer-viewers/FileViewer.tsx"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d3a5ec7d5770f65bd7763a716eb6e7db68db278dcc29baae8d4c3ecf0be064"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 13): (anonymous) has cyclomatic complexity 21 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/daemon/src/domain/skill-catalog.ts"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"1354d4e9c36d890a00547099c56ca92d3f58f9feca68b8c1f8ff86e5e894bf7e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeDestroy (cyclomatic 20, cognitive 46): executeDestroy has cyclomatic complexity 20 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/destroy-helpers.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"606ba4f743fd81231fd5489aa9ec3a7948dca270ed633222e454550ebc30ca6c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runFanOutPs (cyclomatic 20, cognitive 40): runFanOutPs has cyclomatic complexity 20 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/commands/ps.ts"},"region":{"startLine":1899}}}],"partialFingerprints":{"codehealthFindingId/v1":"f074d8d4b2961a72e7b3157747a729675ac609f855447bc84a5af0f5a7cd6f27"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function codexCorePluginEnablement (cyclomatic 20, cognitive 38): codexCorePluginEnablement has cyclomatic complexity 20 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/daemon/src/domain/codex-core-plugin-install.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b8e2372d7696572729bb7aaff59535a71ac81bac52ff57a0d327048b5b9ec07"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolvePersistedRestorePosture (cyclomatic 20, cognitive 37): resolvePersistedRestorePosture has cyclomatic complexity 20 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/daemon/src/domain/permission-policy/persisted-restore-posture.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc8000948112d41526589406e9baec72b59f59051b808986b12be9358ccafad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function seatSkillReplay (cyclomatic 20, cognitive 35): seatSkillReplay has cyclomatic complexity 20 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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8053ed8e1e5b5747473ff9c1fb553947825c930861329a192727fc4a1fde4a8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getDerivedAttentionOutcome (cyclomatic 20, cognitive 34): getDerivedAttentionOutcome has cyclomatic complexity 20 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/daemon/src/domain/seat-attention-reconciler.ts"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"609f8699ab25c77e855a8307410e1875552a23b5544b23fffae38016db53982a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 33): (anonymous) has cyclomatic complexity 20 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/cli/src/commands/chatroom.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ab0763ceaed831f651a5f131c4d6904beb66c886b1c087ecba64fbc909868d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 33): (anonymous) has cyclomatic complexity 20 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/cli/src/commands/gateway.ts"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8cfc5467a28219c97045bab1c2565d1c78e5549334d7374ad0cb1de8e373ab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runSeatHandover (cyclomatic 20, cognitive 31): runSeatHandover has cyclomatic complexity 20 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/commands/seat.ts"},"region":{"startLine":1843}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a5acd58a8fbdefda9f00ca3275af6d0c4bb9089b3ce05f1d5e62e7d039ce794"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 31): (anonymous) has cyclomatic complexity 20 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/daemon/src/domain/provider/codex-usage-reader.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad42cd31144a2bac4184f144d3cbc450693c32c3ce85f30a1fe2373de706c089"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function waitForKernelReady (cyclomatic 20, cognitive 30): waitForKernelReady has cyclomatic complexity 20 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/daemon-lifecycle.ts"},"region":{"startLine":1520}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b14ad5908a68d5f2eeca4d284320d18406cb58e871a4f7f9bb9c8b6b92c5ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validatePolicySpec (cyclomatic 20, cognitive 30): validatePolicySpec has cyclomatic complexity 20 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/lib/permission-policy/policy-spec.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ff42a2f73bc3a26741dae0c64fb2a5c76f91294d1599f807486d70ba77461e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hostedMembersOf (cyclomatic 20, cognitive 30): hostedMembersOf has cyclomatic complexity 20 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/mcp-server.ts"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"e642403437f806e7fae0f70fcde226ee75e9e283b062c51b700ba73eb10f84fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reconcileClaudeActivityHooks (cyclomatic 20, cognitive 30): reconcileClaudeActivityHooks has cyclomatic complexity 20 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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":1331}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d184293b7a1dd741851b0d79d5a84f5d13706ec109f7450e2feac4a304d5e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deliveryFact (cyclomatic 20, cognitive 30): deliveryFact has cyclomatic complexity 20 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/daemon/src/domain/gateway/slack/open-asks.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c29297fea374581046820cece1ab925e9b8c9e1079ac313ffeafd4e31c50cd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findExactNativeResumeProcess (cyclomatic 20, cognitive 30): findExactNativeResumeProcess has cyclomatic complexity 20 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/daemon/src/domain/native-process-lineage.ts"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3108c8d87a9f5a411add9c9e6065464ebb807fbe6d6f0c2cfe677e60952cbe2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validatePolicySpec (cyclomatic 20, cognitive 30): validatePolicySpec has cyclomatic complexity 20 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/daemon/src/domain/permission-policy/policy-spec.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ac1caf890630b67a084fa4cbd7608d62f62d08650db47af2552e12783c2203"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function missionIdAliases (cyclomatic 20, cognitive 30): missionIdAliases has cyclomatic complexity 20 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/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c1cd942fb4cae174f05a5f8154d3f5c4ade5ba47f3730192d8550156f8896f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function AccountFetch (cyclomatic 20, cognitive 30): AccountFetch has cyclomatic complexity 20 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/daemon/test/network-installations.test.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d41566751cf6af4b20ef15667d047a811ce87276ae96d222d39532a387b1a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 29): (anonymous) has cyclomatic complexity 20 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/commands/rig-mode.ts"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ead17afcd421fb584b7fe161d3a7538d26cb0101ea0f237392febd481d43ef8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveMissionsRoot (cyclomatic 20, cognitive 29): resolveMissionsRoot has cyclomatic complexity 20 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/lib/scope/scope-fs.ts"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9bf8a31823e9e47399df9de7dab844f4c0e76e52b3eacdd2cfb4984d40fd24d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runQueueRetentionSweep (cyclomatic 20, cognitive 29): runQueueRetentionSweep has cyclomatic complexity 20 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/daemon/src/domain/queue-retention.ts"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"7632ea8f7fda57dcefbc66658784902c175dcddf21a42a6539bc401e5e36d777"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 28): (anonymous) 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/commands/project.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fae4a8e399833233f5a1d45dad7b2c23e2f5da1896c2ccf4af0d9c0356bde4b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 28): (anonymous) 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/daemon/src/domain/gateway/slack/thread-routing.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3e61e7b5a5052c8d09e250725a249a1fcd29b30c7948f824f7395c0104ca42"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeEvent (cyclomatic 20, cognitive 28): normalizeEvent 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/ui/src/hooks/useTopologyEdgeActivity.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c3e411f368789892105952281143dbe3a94271f54b9235cd45215aa208e4540"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reset (cyclomatic 20, cognitive 27): reset 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/config-store.ts"},"region":{"startLine":1743}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3cabe646baba6e0200995f6d7dea7bee1a7a0e6bdc5352c3070e5375ff8b8f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function socketDeliveryLines (cyclomatic 20, cognitive 26): socketDeliveryLines 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/commands/slack.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff8344be7f71170bbaf93b1b29e2ef71f00c8c7ed50d61274b3e771b12daa6d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function wallClockReset (cyclomatic 20, cognitive 26): wallClockReset 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/daemon/assets/plugins/openrig-core/hooks/scripts/activity-relay.cjs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"abdf310b91925de2e91e6975e99d3169d84cb0b6ac0a2b8bee85d29223d9a14e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function listOutbox (cyclomatic 20, cognitive 26): listOutbox 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/daemon/src/domain/gateway/relay-inbound.ts"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"e54086c61b6d3fd639eb903acda6e370de9d7088ae88b2f68198be94bf6eb126"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readInputBox (cyclomatic 20, cognitive 26): readInputBox 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":1981}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b085570e97c1db5e9c3f0b34cac37faaf92f65248e47b146cc934ed5a537350"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 26): (anonymous) 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/daemon/test/pi-runner-handshake-native.test.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"420578cf7ffdd3dff237750ef2b0e546941627f613d364705d64936a654139ab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkDependencyRoot (cyclomatic 20, cognitive 25): checkDependencyRoot 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":"scripts/gate-lane-hermeticity.mjs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"5934b54383c12adaec0e8ebeb58f5fdd60e27f45a675ed684156b665788bdf5d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writeTextAtomically (cyclomatic 20, cognitive 24): writeTextAtomically has cyclomatic complexity 20 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/atomic-text-write.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f21d042083a41c3891a22a1cda188c351926ccf7b0fbbd1f49ecb5c7462db6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 24): (anonymous) has cyclomatic complexity 20 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/commands/seat.ts"},"region":{"startLine":1409}}}],"partialFingerprints":{"codehealthFindingId/v1":"650293b18de21c84f1190924a675c29cf639c8dd20c4f4cc6bcc39d1c98479f8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function providerChargeText (cyclomatic 20, cognitive 24): providerChargeText has cyclomatic complexity 20 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/commands/usage.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b3d3acf0d07c67e47aaf6bed901dd70972a40ca4e1d4fac7d67749411d47f8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readPiSessionEntryIds (cyclomatic 20, cognitive 24): readPiSessionEntryIds has cyclomatic complexity 20 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"b39cf1d62f07835b262a95075ff06ced6fc8b598494eca7f2593c293a0c1b2ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function postRelayEnvelope (cyclomatic 20, cognitive 24): postRelayEnvelope has cyclomatic complexity 20 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/daemon/src/domain/gateway/relay-outbound.ts"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"af1552efe3114b4eb354a97f34f4c662e1674df7c1296e8e19835115f5fbde19"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectNativeProcess (cyclomatic 20, cognitive 24): selectNativeProcess has cyclomatic complexity 20 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/daemon/src/domain/native-process-lineage.ts"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c4fc9afdd9248cf894a93c37f8cd752db1a32a6a7252438655aeb6cc3782c07"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkMoveReport (cyclomatic 20, cognitive 24): checkMoveReport has cyclomatic complexity 20 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/daemon/src/domain/provider/subscription-move-report.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"3609e0b28957506376e9bc0a6f43b2b0bad60c31c3a468ae5276fc80157dbda8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function seatLaunchAdditionsAt (cyclomatic 20, cognitive 24): seatLaunchAdditionsAt has cyclomatic complexity 20 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/daemon/src/domain/seat-launch-additions.ts"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a053f5cb5cdde69720727d6a55194eb9b4e36d28244bd48ce9bd77207e23e61"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function providerChargeText (cyclomatic 20, cognitive 24): providerChargeText has cyclomatic complexity 20 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/tui/src/cost/cost-model.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e765c213d98ac14a37b843a91282dc1c5e89283210b31770cece01753e1146af"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function finish (cyclomatic 20, cognitive 23): finish has cyclomatic complexity 20 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/commands/queue.ts"},"region":{"startLine":1559}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0780376e8819c6e798255a6a4d311b9c06570e61ce655ddf7ee4643847a075a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runOnSshHost (cyclomatic 20, cognitive 23): runOnSshHost has cyclomatic complexity 20 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/lib/run-on-host.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4eff67d62dc1ded7746cc28c530473d2dcc57b4478bb996f5959c8f7cdd3098"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function requestsAdvisoryFor (cyclomatic 20, cognitive 23): requestsAdvisoryFor has cyclomatic complexity 20 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/mcp-server.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb64038aa9e0d6d714ba229fda71cc910dbfb818cfc73a85e75acdce9313410f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveRecapSeat (cyclomatic 20, cognitive 23): resolveRecapSeat has cyclomatic complexity 20 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/recap-seat.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be4c8786c6f3cf4395caba8bc1966bed490496dcf91cf40ada36ddd5b7102c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function columns (cyclomatic 20, cognitive 22): columns 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/terminal-window.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9683f3579f6497da79a3ae2d8e707746866d5218dbf5f90d10f2715fdd1ffd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 22): (anonymous) 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/daemon/src/startup.ts"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e21671c4c0e83e2cffd1822c2ff24ae950eb9323a5ac4c529055e6ed09c7341"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function listenerOwnerCheck (cyclomatic 20, cognitive 21): listenerOwnerCheck has cyclomatic complexity 20 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/commands/doctor.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf49a49bf366817554527bc9ca5d77c5fa2391ffc72249e6bd4de5d2e418b97"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function report (cyclomatic 20, cognitive 21): report has cyclomatic complexity 20 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/commands/edge.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"35219e12b2ae35f292629e69f5e18349a01fe7c077266be396d81db070f6f3d0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 21): (anonymous) has cyclomatic complexity 20 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/daemon/src/domain/bundle-behaviour.ts"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"3512d071573f367addae4a93b07bf8d6d946d7e5f84c833230e3961aa0ee7b5e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeSample (cyclomatic 20, cognitive 21): normalizeSample has cyclomatic complexity 20 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/daemon/src/domain/context-usage-store.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"979b418afa63596b241e8ea56fda1d40ef75706114458ab5b505082dd67cd237"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function read (cyclomatic 20, cognitive 21): read has cyclomatic complexity 20 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/daemon/src/domain/gateway/slack/state-store.ts"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"9193ae950cc0fa6006e9b1d52076cf973973eeb9eb146f4d2144f7ecc3feba1d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 21): (anonymous) has cyclomatic complexity 20 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/daemon/src/domain/rig-edge-ops.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e8211d248c7dc0efd93203d3ef7d4587525b1dc56757291b3310bfb987d7a88"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function autoDetect (cyclomatic 20, cognitive 21): autoDetect has cyclomatic complexity 20 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/daemon/src/domain/up-command-router.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a218b78e27a80ee01a43885b27f32815fd27f726e6a6287d55194f22911b36"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseWatchdogSpec (cyclomatic 20, cognitive 21): parseWatchdogSpec has cyclomatic complexity 20 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/daemon/src/domain/watchdog-policy-engine.ts"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"679d8d3a3d528aab4df0ab81b7b488d6afd61737b21dc3df02512e4f661a4c3c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 21): (anonymous) has cyclomatic complexity 20 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/daemon/src/routes/gateway.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"0133d840bb0e4fe089a66b4343af88719f78844e0e17d7f7c0ab300e0c245755"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 21): (anonymous) has cyclomatic complexity 20 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/daemon/src/routes/sessions.ts"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc742090e9da982080f0046bc708502e68eb1d0b0eb2c18a26f6fcf95d7427f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function simple (cyclomatic 20, cognitive 21): simple has cyclomatic complexity 20 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/daemon/test/tmux-server-systemd-scope.test.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89fc77112a7aa60c140a8f6abde507d22d17253eee1380059f7df544f4b8fa6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ProofSliceCard (cyclomatic 20, cognitive 21): ProofSliceCard has cyclomatic complexity 20 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/ui/src/components/project/ProofTab.tsx"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"e95c032e9fa8feb84ab2fad531dd9773f0cc0027e8d4f46bd5198a83a2bf4a94"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepare (cyclomatic 20, cognitive 20): prepare 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/daemon/src/domain/model-divergence/current-model-reader.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"03287759490435e64d5ee7456d0d6bc99ffb2b67da731ca04a52a5bd7b38ffb0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertAddressAvailable (cyclomatic 20, cognitive 20): assertAddressAvailable 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/daemon/src/domain/session-registry.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3f57983327745c7369f771edf4ee5f8be705ddb63d192fcfd63b5d5268850d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 20): (anonymous) 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/daemon/src/middleware/browser-boundary.ts"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"9615b5d509a87734e8af1fc9b9672a7e8e7557135a5597cfce00edd41ea1254e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function launchedSeat (cyclomatic 20, cognitive 20): launchedSeat 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/daemon/test/restore-guidance-after-down.test.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3bd22267fb8032ece5fe6fe23e4ffdb2031ce44edbb1e77f398ca43565418a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseArguments (cyclomatic 20, cognitive 20): parseArguments 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":"scripts/check-internal-leak-guard.mjs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e40e316227a5cacbd55eef67ea106c5c37c2a46112bf5695c32691a782301f0d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function persistedMember (cyclomatic 20, cognitive 19): persistedMember 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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":2283}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae782d81cffe1c8f898bb88174d13af0a155bc11dc5d35bbc8ee7d239f29085"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 20, cognitive 19): constructor 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/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"13da5b65c8153808bdb2d2d16cafdde5c2926afd87c5c766d12965167f1b9077"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function effortSummary (cyclomatic 20, cognitive 19): effortSummary 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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":2583}}}],"partialFingerprints":{"codehealthFindingId/v1":"de5612aecd85d9ebeebcce67e663e6a8fa33bc588f1a20139971cbd1adf71931"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function doReconcileStartupReadiness (cyclomatic 20, cognitive 19): doReconcileStartupReadiness 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":5148}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2713d6e5e9026803fdb882cbf4a1dc42e0047798aa19c55dce440aba18e8e46"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function HotPotatoEdge (cyclomatic 20, cognitive 19): HotPotatoEdge 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/ui/src/components/topology/HotPotatoEdge.tsx"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"1355ced574089c6c8d133cf2fe49fd88f30e712d5233846ddedca3c01f3ef2ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function piCostLine (cyclomatic 20, cognitive 18): piCostLine 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/commands/usage.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f36f0e3b5f4d4f6b72a23cf61258ff9171bf9fad88ea870830b03a5c2e2af33"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function follow (cyclomatic 20, cognitive 18): follow 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/daemon/assets/herdr-app/mods/rig-strip/main.js"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"00519eef029aabce308df026aa6f260c5af39ff63eff9cbacee55860ad66e998"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateHealthPolicy (cyclomatic 20, cognitive 18): validateHealthPolicy 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/daemon/src/domain/health-policy.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78d1a629d3f116d78835495ef82c119473602dc8ab710f1cad40d13c11fff5b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 18): (anonymous) 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/daemon/test/restore-hook-selection-matrix.test.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"30617b4c98d1cf33883260a29d312a85361565d60426a05c037b6e01fff8f3cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function piHeadLine (cyclomatic 20, cognitive 18): piHeadLine 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/tui/src/cost/cost-model.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc7d82b733100031407133ceb81b1c649df9191801a8a3c22f3e97f2548f0b24"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function WorkspaceScopePage (cyclomatic 20, cognitive 18): WorkspaceScopePage 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/ui/src/components/project/ScopePages.tsx"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b781d6685edc29fe68318518f423a6951126b2133fb21b57d581d9c7f8a42fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function HostScopePage (cyclomatic 20, cognitive 18): HostScopePage 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/ui/src/components/topology/ScopePages.tsx"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ead8f7111ea69077929cf55acbb56826a0905195882fc669fb66b2d86b4c599"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function WorkflowStepNode (cyclomatic 20, cognitive 18): WorkflowStepNode 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/ui/src/components/workflow/WorkflowTopologyGraph.tsx"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44e80dc8a17e720b80855841230bec6a392cdc070fe31219fcf7ebcfda049a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hookEventState (cyclomatic 20, cognitive 17): hookEventState has cyclomatic complexity 20 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/daemon/src/domain/agent-activity-store.ts"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"98bfe35e24a7f8fb529ac5ba30664d3682fceea82e1a515d37dbc5a8d3cc4278"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCodexPermissionEnvelope (cyclomatic 20, cognitive 17): parseCodexPermissionEnvelope has cyclomatic complexity 20 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/daemon/src/domain/codex-rebuild-permissions.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"8672479d9c0049d644205ce7c2ad92673968b730b91479400ee57b74c10b820b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ingestDecision (cyclomatic 20, cognitive 17): ingestDecision has cyclomatic complexity 20 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/daemon/src/domain/gateway/slack/inbound.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"b863f1133007ff1315814c89f475f77030a00a3877f1c930f4ac145fcb8fb944"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function looksLikeCodexLoginPrompt (cyclomatic 20, cognitive 17): looksLikeCodexLoginPrompt has cyclomatic complexity 20 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/daemon/src/domain/native-resume-probe.ts"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9bf5d43fc890e877262ad9b2e726aeea85c9f6e794a006116fde5fbdda30e94"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validPiProviderCharge (cyclomatic 20, cognitive 17): validPiProviderCharge has cyclomatic complexity 20 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/daemon/src/domain/pi-usage-entries-store.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ca42bb1a448bcdfadaa8ed27ed8f9f8fe56deae2371536b57260a9a717ce9d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runScenarioFile (cyclomatic 20, cognitive 17): runScenarioFile has cyclomatic complexity 20 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/daemon/test/helpers/scenario-pipeline.ts"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d97349d077700d3665a24ca06aafa572da59e07a997defa0ba476fb13067723"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function intendedActionFor (cyclomatic 20, cognitive 16): intendedActionFor has cyclomatic complexity 20 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/daemon/src/domain/restore-plan-preview.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec2eb1ee6e516bde95b5f55a5440b50b3a3a69899ef833ec0bf42f737710140"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectedState (cyclomatic 20, cognitive 16): selectedState has cyclomatic complexity 20 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/daemon/src/routes/startup.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"523f9ee1cfc07573d784fc416fd5d843fc41628a927a0f188bbca214d3698b2e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function memberStartupSource (cyclomatic 20, cognitive 15): memberStartupSource has cyclomatic complexity 20 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/daemon/src/domain/rigspec-exporter.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa6164f681a5efab3a4219d46ba7bc40a1936fc9d4b820559bdf53d6aef6f4f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verificationReceipt (cyclomatic 20, cognitive 13): verificationReceipt 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/daemon/specs/agents/shared/skills/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"c93addf2b65ebb70e3c7e42500ec4cdde29cc614127c184ebfd8389a7acd13f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verificationReceipt (cyclomatic 20, cognitive 13): verificationReceipt 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":"skills/_canonical/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"77308e8c07e4bdaab7aca8274b6c40df8eea3033819a3c4016623da7b4f32ca0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hasPickupEvidence (cyclomatic 20, cognitive 11): hasPickupEvidence has cyclomatic complexity 20 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/daemon/src/domain/queue-wake-ladder.ts"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40ddc48fd09951f39359d519645a2a19a7446b8c859b07022c545298a17161b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateSurfaces (cyclomatic 19, cognitive 44): validateSurfaces has cyclomatic complexity 19 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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"e64876b0a0b89931b4176d21e6867963e883e471d12c7b8f6bda12bfceb9a34c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deliverStartup (cyclomatic 19, cognitive 37): deliverStartup has cyclomatic complexity 19 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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c36a1ec4dd4e3f95ea93c93a4e71bf03fc2f9f90f91b9eca3e68e0bcebd620"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function missionIdAliasesForCounting (cyclomatic 19, cognitive 35): missionIdAliasesForCounting has cyclomatic complexity 19 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/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6dd3655bf3e3377920b443fdc43ebcb582c9b98b39049719fc0287feec23ae7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 33): (anonymous) has cyclomatic complexity 19 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/cli/src/commands/file.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"9754f075101cdacf764666ecaba1d263a09a98f951ef8f0954af6107e34953f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeTopBurn (cyclomatic 19, cognitive 33): computeTopBurn has cyclomatic complexity 19 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/daemon/src/domain/usage-series.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"c65120d94e49a259bcfd88c04a4b32a72650e44da23c6e0f998a46b65d4a9759"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function project (cyclomatic 19, cognitive 32): project has cyclomatic complexity 19 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":"packages/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b5a200e4ece49115a81adc83470e48d837a488dd14d4abd426c0c601a6e3a0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveWorkContextHome (cyclomatic 19, cognitive 31): resolveWorkContextHome has cyclomatic complexity 19 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/lib/work-install.ts"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a43e980de15ec18b5765b354b52ad69bd947aaaa09d1b99027134d0f7d8d9d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compareRequirements (cyclomatic 19, cognitive 30): compareRequirements has cyclomatic complexity 19 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/daemon/src/domain/codex-filesystem-preflight.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"eda93f412dee979eb6ed6d14f4b94cb12dcaad4352106f46cdfd38450b4252fc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deriveCurrentWork (cyclomatic 19, cognitive 30): deriveCurrentWork has cyclomatic complexity 19 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/daemon/src/domain/current-work.ts"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a758de7638ea1d71a914beb440bbc3fdb926054d1369263b5ab1007d9de081"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function program (cyclomatic 19, cognitive 29): program 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/daemon/test/tmux-server-systemd-scope.test.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b5d07039b4c5a959e39fd64d60c5cf420d29fb3a0e681c03459cf6cea0d674"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 28): (anonymous) has cyclomatic complexity 19 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/commands/restore-check.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"c599bb9d043d63f667bd187d7431db63873a51436485fcd72c95721ba8176ea7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 28): (anonymous) has cyclomatic complexity 19 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/daemon/assets/plugins/openrig-core/hooks/scripts/refocus.cjs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"1106b4645286a0c1c7f496319f66f0b59e543c5ddadd073fe55d18bce9107e6f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 27): (anonymous) has cyclomatic complexity 19 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/commands/env.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"4567b76183ed3fa4b6fc04ddd79f961b83e46409bc59b0cdb7f6d89adee8b417"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectMission (cyclomatic 19, cognitive 27): selectMission has cyclomatic complexity 19 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/daemon/src/domain/terminal/scope-task-terminal-view.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cc8bbc5942d2eca486905aa5cd194e9b4f45b5deb833694fa5b9e082e92ac0d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyTreeLayout (cyclomatic 19, cognitive 27): applyTreeLayout has cyclomatic complexity 19 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/ui/src/lib/graph-layout.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d94d9d90764e0d9302bd162b49b0ce11b1de04b56628a39b0efb89d34e35fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanLegacy (cyclomatic 19, cognitive 26): scanLegacy has cyclomatic complexity 19 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/daemon/specs/agents/shared/skills/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef8f282deeb5f13c5b6dafac848847e5e31c81ae6ef89294e1f9fb0e72927d6d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function summaryOf (cyclomatic 19, cognitive 26): summaryOf has cyclomatic complexity 19 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/daemon/src/domain/gateway/slack/inbound.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ecb7dfd928501660439370a8e6fb00c626562d5422a47ef3bb12ec215790218"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function propagateBlockerCompletion (cyclomatic 19, cognitive 26): propagateBlockerCompletion has cyclomatic complexity 19 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":4209}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bbf45ee19027ac80dde241be3a0ce7d773646fbc87afca5c94aaa1eae6335f1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function add (cyclomatic 19, cognitive 26): add has cyclomatic complexity 19 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/daemon/src/domain/terminal/scope-task-terminal-view.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"531b8996c062d3245efc0264210cf6ff1e8f5ef91423e5459fced956557505f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 26): (anonymous) has cyclomatic complexity 19 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/daemon/test/compaction-restore-notice.test.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd3fad594e7224eefde1ab716da0c57d183e860edd45deba1c51853c2d04320"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitCommands (cyclomatic 19, cognitive 26): splitCommands has cyclomatic complexity 19 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/daemon/test/tmux-server-systemd-scope.test.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"214655e5afd4ceb835b81e300eaddf7425aa15583b2f238322001724e2dc2f63"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanLegacy (cyclomatic 19, cognitive 26): scanLegacy has cyclomatic complexity 19 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":"skills/_canonical/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd8d177eb1a198fd93e6abfc28b84814ebc2dd16712b78a7f19e5542502cef9a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runCrossHostWhoami (cyclomatic 19, cognitive 25): runCrossHostWhoami has cyclomatic complexity 19 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/commands/whoami.ts"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"94c5421b17235f48aefc2b535a27a5b64546dbe7fe23f0314a9dd4f605bd2ad2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writtenFact (cyclomatic 19, cognitive 25): writtenFact has cyclomatic complexity 19 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2186442b5c9c8e9767053333707cac5c9e12254b0106e470f37d88d4ab72f61"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 24): (anonymous) has cyclomatic complexity 19 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/test/context.test.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe6c48155a719724d86c9fa33a76ee408234e2674d91a599b3a5db133b7d8a2e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function get (cyclomatic 19, cognitive 24): get has cyclomatic complexity 19 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/test/stream-consumer.test.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"34097be6316fabbef249177de872fa90e7bdeb24d32b21535daad269400091ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeCodexUsage (cyclomatic 19, cognitive 24): normalizeCodexUsage has cyclomatic complexity 19 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/daemon/src/domain/provider/codex-usage-windows.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc40cb2995db0e7c2bece9871fd510f9a26217a48a47dfdd83e233616ebecb7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function joinedTranscript (cyclomatic 19, cognitive 24): joinedTranscript has cyclomatic complexity 19 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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f32854b8fac61b642bfe52f5c9ca92a14176a890292f4d803cb1de220c37af"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 24): (anonymous) has cyclomatic complexity 19 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/daemon/test/claude-executable-foreground.test.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f6dc03c208972d4890f0a5303ee4830553c7625c5637d20d8db8d860bcbb1b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 24): (anonymous) has cyclomatic complexity 19 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/daemon/test/delivery-rules-engine.test.ts"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f583f954a948b6079695dd2999e36c4349b9fc3ad27cdae501103b45e1a22b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function systemdRun (cyclomatic 19, cognitive 24): systemdRun has cyclomatic complexity 19 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/daemon/test/tmux-server-systemd-scope.test.ts"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ad423afacf59d9da0bf38b8794da1d3e86cc959d9908dd0e0e2d9e3b6c3c1e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeAct (cyclomatic 19, cognitive 24): executeAct has cyclomatic complexity 19 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/tui/src/main.ts"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"7734542f83de2beb885397a68b609f0e16145491be63d5053102630c9ff0c2fd"}},{"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/commands/gateway.ts"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"105c8d0df94c1d25ad7827de07eba8cbf5adf7660601fcd85ccbdfa7c58833cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function install (cyclomatic 19, cognitive 23): install 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/daemon/src/domain/agent-images/agent-image-library-service.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab7d0d71bff262e047fdb32f009d66281774ffe41a1a4502640ed2828952b827"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validatePluginResources (cyclomatic 19, cognitive 23): validatePluginResources 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/daemon/src/domain/agent-manifest.ts"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d46e62ab75dd22b7e2cce9f1b0a2aaf4194c7296ef717b6761f3d19014ec71a"}},{"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/test/export-import.test.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf0cc0348fa71c81eaac2ee313987e1de4fb883b24ad2345cb7b0fccac506ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runQuietRelease (cyclomatic 19, cognitive 22): runQuietRelease 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/daemon/src/domain/policies/quiet-release.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"877d1e9364e11ad0a189624cf3772fee262b2026d6d3376c0db8f3748c59cfad"}},{"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/daemon/src/domain/project-lifecycle-compiler.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd80a160b60605d58a59bfb49e85294ef49b136858cc518925589cda362cc530"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function planFresh (cyclomatic 19, cognitive 22): planFresh 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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":1569}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef8cd21efbba5eafc9c56c10c615b2ab446d64128456ffcf514ad048016f9949"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 21): (anonymous) 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/commands/restore-packet.ts"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"9974c13e7808a5c0b2d2d101cd0f22c0a9fa3f98f84ba97f6253e5910fce2d17"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readReconstruction (cyclomatic 19, cognitive 21): readReconstruction 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/lib/reconstruction-reader.ts"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf7db21b0be8fb896399fb9c6ae1b26d339a19ff892312322a864a2d727f7b1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function copyOntoFresh (cyclomatic 19, cognitive 21): copyOntoFresh 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/daemon/src/domain/codex-auth.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d0dcef342c8ded2fd6dfd811c4b44904432b186d1a3b67c203048184bb2399a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function desired (cyclomatic 19, cognitive 21): desired 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/daemon/src/domain/gateway/slack/settled-asks.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"06dd462186c32de1ff6c13aacb7ca1baff987ea7b19e1d2b223676d03e582657"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveMentionUserId (cyclomatic 19, cognitive 21): resolveMentionUserId 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/daemon/src/domain/gateway/slack/slack-subsystem.ts"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc5dc009ff07c294dbaaa517ebc81aa47eba72d79cf8ac0deb4d328a9bad501"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadLearnedHostBindings (cyclomatic 19, cognitive 21): loadLearnedHostBindings 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/daemon/src/domain/hosts/learned-host-bindings.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c46d020ac23a1efbfa1d6437e70f180e12b976c5f16630f34e099090e04d348"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 21): (anonymous) 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/daemon/src/routes/hosts.ts"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"148eeed957a3eb0dd790181ece40c33851da7848e94600dc993e98afc93deced"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 20): (anonymous) 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/commands/bundle.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c39d9eec2c9cc6733c256fb39f23e3e0c412bbc7de9fdf6eb57154f9e698ebe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildPiRunnerCommand (cyclomatic 19, cognitive 20): buildPiRunnerCommand 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/daemon/src/adapters/pi-runner-protocol.ts"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6b6141064535a590c50fa71b59ae500ecaac6b5a50a5bf4e8b67f25f38be70"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveOfferedReplyRefContext (cyclomatic 19, cognitive 20): resolveOfferedReplyRefContext 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/daemon/src/domain/gateway/relay-inbound.ts"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f2e0df1130a84c9c35bce2f4c71380d71ae0f28804f346541654934ea9c3c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function snapshotLaunchOutcome (cyclomatic 19, cognitive 20): snapshotLaunchOutcome 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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0cd355c77f44afed4f4ebc5f0b35f9ca8826cd8cc1f7df53cce89323b57c85"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 20): (anonymous) 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/daemon/src/domain/review/compose.ts"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2ae19802fe8963dddac73857d1f12c401ae2bf9a16f913acd411ff426bec42"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateRecord (cyclomatic 19, cognitive 20): validateRecord 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/daemon/src/domain/rig-mode/rig-mode-validator.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f575d106d917bc7407e315db0f10ec8bb1f5c31a263cb48a0aa58b47f0f4828"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateFrontier (cyclomatic 19, cognitive 20): updateFrontier 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/daemon/src/domain/workflow-instance-store.ts"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5cbf1b3a8185a683c823cf1bbc9d7e666c09a1fa93d6df3bea3066cc9f8f2da"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 20): (anonymous) 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/daemon/src/routes/chat.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e4d82d8244d14a50db17741c47491b455f2c2ccbdc8faecef00e7f1dfede445"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 19): (anonymous) 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/commands/usage.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f49c03bba0907ed458a3a3cac2fd9aa1601b7897621661221686f1bb97f84b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createAndBindToPod (cyclomatic 19, cognitive 19): createAndBindToPod 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/daemon/src/domain/claim-service.ts"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e150142de7663015f8b8a97b13b7e581c4dce6c0c48ea2c85c2f9044e30c38"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function postChatMessage (cyclomatic 19, cognitive 19): postChatMessage 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/daemon/src/domain/gateway/slack/slack-api.ts"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c502fa9ffea0011ccfd7a5e7a3b55ebc43b7e89815c4f6a36b6a20e8fd3ec0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 19): (anonymous) 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/daemon/src/routes/sessions.ts"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"488c55afa2960c697da666caa24b5839503217a67baf436fd1886b35a4afa7ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 19): (anonymous) 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/daemon/test/node-attention-consumers.test.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41c1e76da54373ce37ee0082b4ddf9c6042e8f4dcc985996af50e24672958fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyDeliveryEffect (cyclomatic 19, cognitive 18): classifyDeliveryEffect has cyclomatic complexity 19 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/commands/send.ts"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"4207897b86af99fce31c8fb673d9b4e9821d5c24533fff6f503e1dfc6b5a4869"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 18): (anonymous) has cyclomatic complexity 19 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/daemon/src/domain/provider/claude-auth-status-reader.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed56739e2f88e17180cbf6ec81c3ccdf4be8d4008b92f4061f5e81e718055de0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function listRows (cyclomatic 19, cognitive 18): listRows has cyclomatic complexity 19 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":5110}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a90dc43a077983769ce99aa71576b361d79b605d5e34b4c9f232ed09764e32"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateCrossPodEdge (cyclomatic 19, cognitive 18): validateCrossPodEdge has cyclomatic complexity 19 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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee9e6ce577d627606e2013afab5950368d2d763c0d19277cd03aef0ce585654e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 18): (anonymous) has cyclomatic complexity 19 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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":1549}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa230f08e219fab6dd5a60433bacbd06ada8bbc559a7877deda543383fbbabf0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function submit (cyclomatic 19, cognitive 18): submit has cyclomatic complexity 19 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/daemon/src/domain/runner-permissions.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de913551759e01d6c34c9c95dbda64b069599e1a25a374cf9219685fef9f6e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateThresholdUnits (cyclomatic 19, cognitive 18): validateThresholdUnits has cyclomatic complexity 19 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/daemon/src/domain/watchdog-jobs-repository.ts"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"747da0eec0b7270b5982d2a760f4f532d5ae12a2ff55c92dedc50dcbdf582524"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setPermissionsHandler (cyclomatic 19, cognitive 18): setPermissionsHandler has cyclomatic complexity 19 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/daemon/src/routes/seat.ts"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d2b22e2018bc29c0c8ed47fb546db5a8cb24683662618dfdbbca01e7408b0a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toStoryInput (cyclomatic 19, cognitive 18): toStoryInput has cyclomatic complexity 19 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/ui/src/components/project/ScopePages.tsx"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"33304444b79902a18a098d7838955e9f5cc57f09884cc4c6895e58f27e5be9c1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function RigScopePage (cyclomatic 19, cognitive 18): RigScopePage has cyclomatic complexity 19 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/ui/src/components/topology/ScopePages.tsx"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"749175a0e0e3497b3a53727de28d7455d4532722cea7659a7d1e938833070db0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 17): (anonymous) 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/mcp-server.ts"},"region":{"startLine":2340}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ae9e8ef1b95015bb9acac7d990fd16d32c4af04aaa9956c4c271d5b56ca8fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createRunnerInput (cyclomatic 19, cognitive 17): createRunnerInput 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ea6ef2a4d3f37b57844ad809f54e054c636eea962d05562353719971ed41a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function overrideBeforePaste (cyclomatic 19, cognitive 17): overrideBeforePaste 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":3880}}}],"partialFingerprints":{"codehealthFindingId/v1":"23608461a7025e53d796f52763d43f11c1b5ba1ed01607b78a4fd576a0ff1608"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fail (cyclomatic 19, cognitive 17): fail 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/daemon/src/domain/startup-orchestrator.ts"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c3ebd1e549b525c012b56c124e686c0eae46fc84d6b159d1a09d87cebe0cdb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseIdentityPrincipal (cyclomatic 19, cognitive 17): parseIdentityPrincipal 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/daemon/src/routes/require-sender-identity.ts"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b4833746418604acc39781496a2558463d2c2854fe857de4083c898357063b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 17): (anonymous) 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/daemon/test/claude-resume-rotation-recovery.test.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"1127eef64991ae4cd7c78d2fa8c4262b9e0c4b9db7f419dd04732cd7f5390796"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visit (cyclomatic 19, cognitive 17): visit 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":"scripts/cli-runtime-dependencies.test.mjs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8fb46b1d27045e1bfb29e39e8a5f83fe9b12ca83341ca151ca3895dac36f7a8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fixture (cyclomatic 19, cognitive 17): fixture 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":"scripts/pack-release.test.mjs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"b56b44112ec580ba21a9e3d23dae7bea3f89762f72305559fca11a5d4fd6da9e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function daemonHumanReadiness (cyclomatic 19, cognitive 15): daemonHumanReadiness has cyclomatic complexity 19 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/commands/gateway.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a13abbc7059075ce828d0989a4e71d4ef22d224704a87ec286515c7eb70bf8d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isStoredSessionSource (cyclomatic 19, cognitive 15): isStoredSessionSource has cyclomatic complexity 19 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/daemon/src/domain/rig-repository.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"a16e30132925429af886fca0d7cc4c9b9b7c08ffa5d2478614924a5a51d728e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setPolicy (cyclomatic 19, cognitive 15): setPolicy has cyclomatic complexity 19 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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":1138}}}],"partialFingerprints":{"codehealthFindingId/v1":"a558f843407a0d10dcdd7772e8f6ff5d763bb9c5d565b131f2333958c049395b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readOwnershipManifest (cyclomatic 19, cognitive 14): readOwnershipManifest has cyclomatic complexity 19 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/daemon/src/domain/skill-catalog.ts"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"60bb7efe6745ae14a521f80f53512d661358d8a7dbcec35e9f434c0d759c5c32"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decode (cyclomatic 19, cognitive 13): decode has cyclomatic complexity 19 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/daemon/src/domain/finite-telemetry.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9959be0a6cd37dbf9245d546e42b41bc9bf528bc4d5e4210e9da7649e16b7a9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function beforeNative (cyclomatic 19, cognitive 12): beforeNative has cyclomatic complexity 19 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/daemon/src/routes/startup.ts"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac33dd8f75ea03077eab8aee26d348bddf4b5be3a221b9ab7980e01c014d7e36"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function askPerson (cyclomatic 18, cognitive 36): askPerson has cyclomatic complexity 18 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/acp/agent-server.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"9510ec7942788f68dc2e529879b8a2853fee234af909a2f3c24d4a00547a5c4b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 34): (anonymous) has cyclomatic complexity 18 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/commands/restore-packet.ts"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f19ea7526d46b1117993da02d5b6f2756ab79555000ae58a0d0382e871eaf29"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function composerContainsOwnedText (cyclomatic 18, cognitive 33): composerContainsOwnedText has cyclomatic complexity 18 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/daemon/src/domain/composer-prompts.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"83a5f3d2f0376d39788cb3e5aabc1825a7f2ecbe27158e7a3840bf66801e9f8e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 33): (anonymous) has cyclomatic complexity 18 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"40093497d3587bdae1cd2d77fc33033f0e230722a005a9bd22f138aae51955de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function frontmatterIntent (cyclomatic 18, cognitive 32): frontmatterIntent has cyclomatic complexity 18 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":"packages/daemon/src/domain/current-work.ts"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"23153f069e7362309ab366dc72f48d9c9bb546ca1be6d7badd93ed8f9ed7bad6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordAlreadyStoppedIntent (cyclomatic 18, cognitive 31): recordAlreadyStoppedIntent 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/daemon/src/domain/rig-teardown.ts"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b9d0142e337df853a43e6cd15107c8f2f99d0d9bf4d8b2df08d0decede8374"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function postAction (cyclomatic 18, cognitive 31): postAction 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/ui/src/components/mission-control/hooks/useMissionControlAction.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6ce2c30ce523bdb2f0d656d7d372d4fa5dc76ab384cd515ff121468d8ed44b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 30): (anonymous) has cyclomatic complexity 18 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/commands/agent-image.ts"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"d27418bdbeceb93cf0e9a15dccda5be788642a8904223cd9c5c4b1ce500cd1f1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deriveWorkflowExceptions (cyclomatic 18, cognitive 30): deriveWorkflowExceptions has cyclomatic complexity 18 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/daemon/src/domain/review/compose.ts"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85e140f016ae539e92045c82060b2083cb7655598f70d332accf19f50ae5df4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pairingLines (cyclomatic 18, cognitive 29): pairingLines has cyclomatic complexity 18 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/tui/src/config/pairing.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f55165ec7e4d4e07bd8c7b11df149b8f69ba8be44610dd5a66d617af455432"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readRosterInventory (cyclomatic 18, cognitive 28): readRosterInventory has cyclomatic complexity 18 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/commands/roster.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8b93312d08cd1988d34eef16a20645a677759afbc54ea9b69aa84e80760041"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readNativeEffort (cyclomatic 18, cognitive 28): readNativeEffort has cyclomatic complexity 18 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/daemon/src/domain/seat-effort.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"04dead9c38899969bba6114f7c91399bd80879455a976661812b5ca2552ee158"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildStory (cyclomatic 18, cognitive 28): buildStory has cyclomatic complexity 18 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/daemon/src/domain/slices/slice-detail-projector.ts"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"2970479391694bdbf28f967a6ff48b1831c9a4ff426f3409aa402ea5d88fec12"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function errorResponse (cyclomatic 18, cognitive 28): errorResponse has cyclomatic complexity 18 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/daemon/src/routes/mission-control.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"a61cd70b49e9e4387308195ece3c335f3847b3707dc0817cec2519f699ee5962"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 27): (anonymous) has cyclomatic complexity 18 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/test/snapshot-restore.test.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"b52e61e4edb71403a0a53e23beaecd5c3a622d2ab659294d139b5c808c44acce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeActions (cyclomatic 18, cognitive 27): executeActions has cyclomatic complexity 18 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/daemon/src/domain/startup-orchestrator.ts"},"region":{"startLine":1166}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a534d494f9d63ebb2d335bd67a8a6dd1fb6127e78a058cad64edfd37010ea7d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 18, cognitive 26): main 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":"scripts/generate-context-packs.mjs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"107cfc22ec7c4c4cb7a88efc0f1bc3d158f2c64923c7dec66e6982e5c7ede623"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 25): (anonymous) has cyclomatic complexity 18 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/commands/rig.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd20ab328c19d03ee4ccf3665a900d1d787559b20ced823ef3f58ea685d1be6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function printSeat (cyclomatic 18, cognitive 25): printSeat has cyclomatic complexity 18 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/commands/skill.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"860e56cc3413e2ae7dfef2cfdce421fdea32e992055e56cc79905250833b0ac1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 25): (anonymous) has cyclomatic complexity 18 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/commands/skill.ts"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62992c3f88a45933c565cf6f81282cf7940c04974711b295eefc67c0abd059d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writeAtomic (cyclomatic 18, cognitive 25): writeAtomic has cyclomatic complexity 18 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/daemon/src/domain/files/file-write-service.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"82435ecf791be50294eb92430b5a75814192c301c89224eb25556c4692dfc6b1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shallowWatches (cyclomatic 18, cognitive 25): shallowWatches has cyclomatic complexity 18 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/daemon/src/domain/proof/source-watch.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"90daac9414f2ba7d6a299130bee679608ec36fa5e62464dfcbbc3ce5081ca6c7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function seatGuidance (cyclomatic 18, cognitive 25): seatGuidance has cyclomatic complexity 18 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/daemon/src/domain/restore-guidance.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca3ca04f8aabf20fa5d64aaf95d992a7049e84ff0bfa81b75fa672d6fa0135cd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reconcileState (cyclomatic 18, cognitive 25): reconcileState has cyclomatic complexity 18 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/daemon/src/domain/terminal/herdr-app-provider.ts"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f622866f2a4cd31bd19a52808e6f8069521c0a441ffb8217a3c702b76817b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reset (cyclomatic 18, cognitive 25): reset has cyclomatic complexity 18 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/daemon/src/domain/user-settings/settings-store.ts"},"region":{"startLine":1528}}}],"partialFingerprints":{"codehealthFindingId/v1":"a016dc9fb962957210a9d0c5bcfabc4c40c25199d3b3397e2eeeb254cde4d676"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 24): (anonymous) has cyclomatic complexity 18 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/commands/context-reconstruction.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbeece01a150c6c71cf0dbeec82a0f7714596a1ae25af0284591386eb7ba1b73"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addProgressRow (cyclomatic 18, cognitive 24): addProgressRow has cyclomatic complexity 18 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/lib/scope/progress-edit.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"97776b83f4d736615b5ccf498eaeb970964f165278f8be690ac4f485cba02ef6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 24): (anonymous) has cyclomatic complexity 18 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/daemon/test/claude-handover-readiness.test.ts"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28f7dc91f66feeab894f7a487064f25ebce6ee1885e94acc640062f23f06893"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 23): (anonymous) 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/commands/provider.ts"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5158ca1774e885b7328fd0071d396e1dab899db377149419b4cc942f2741d52"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 23): (anonymous) 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/commands/release.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0f2a170a4f763ec1abb3272875c7e18073f9e0115f39dbd5093bb0d783f42e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readClaudeCompactionMessage (cyclomatic 18, cognitive 23): readClaudeCompactionMessage 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/daemon/assets/plugins/openrig-core/skills/claude-compaction-restore/scripts/precompact-hook.mjs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af6c54788883c20e3f62188bd2b4a4d4d46de90a8b22bf6c05c8ca0574c3184"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveLaunchOverrideFromFacts (cyclomatic 18, cognitive 23): resolveLaunchOverrideFromFacts 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/daemon/src/domain/native-permission-store.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"e523c5cf342d2d736531d9bda2c84e87e379bb056af3135402569f8179bd5b02"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function effortNote (cyclomatic 18, cognitive 23): effortNote 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/daemon/src/domain/provider/claude-seat-switch.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d36989a26b9d4909b2c3d0291f6129809bcd9e9a257b146400653624b4685e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rollupClaude (cyclomatic 18, cognitive 23): rollupClaude 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/daemon/src/domain/provider/host-usage-rollup.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"592373766c27902eeb5adf376aa53267f21cdf5033f076ccd83f399471ba89f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 23): (anonymous) 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/daemon/src/domain/watchdog-delivery-receipts.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a568be156752e00eba9e65609879656180e32dd6448e03bfe62ca3b85240ab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 18, cognitive 22): run 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/system-preflight.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"a562c24e33e2e072aa53ab876e85763f427c6f270ba3d9f5cc55e4073750b899"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function read (cyclomatic 18, cognitive 22): read 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/daemon/src/domain/permission-stop-observation.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1bd96352fecaee43af56b0ce1b8b6ed28fde76f5732303ff7337286107ba6e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function listablePullOutboxKeys (cyclomatic 18, cognitive 22): listablePullOutboxKeys 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":6456}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb5c34f94890e2408a961acfd56303b99066aaa20f613a8e26ee29bb1cb0e4b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writeConfig (cyclomatic 18, cognitive 22): writeConfig 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/daemon/src/domain/user-settings/settings-store.ts"},"region":{"startLine":1381}}}],"partialFingerprints":{"codehealthFindingId/v1":"27defe2043ca9b92200f8df06aa6602fc0265977c2f90bfca6d37979402f663c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateFile (cyclomatic 18, cognitive 22): validateFile 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/daemon/src/domain/workspace/frontmatter-validator.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3001d936d63885768d01f37a63efa27d797e29502ede056e7fa8a241537650"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 21): (anonymous) 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/cli/src/commands/remove.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"322b519ad8d0da51516952925d951420d2afa1d5564d2cfb997fc377355f30ba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateLegacySources (cyclomatic 18, cognitive 21): validateLegacySources 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/daemon/specs/agents/shared/skills/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"405414be252c923b620dbcb3833299edf4bc14b851910e3838f1dad228f12b58"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeHookActivity (cyclomatic 18, cognitive 21): normalizeHookActivity 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/daemon/src/domain/agent-activity-store.ts"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"27155404fbee01bae4292847bc30bdfd76a4c277de865f90577eb253028448e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 21): (anonymous) 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/daemon/src/routes/mission-control.ts"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1ed789f0d9e5ee3f6947cc62b62d252f8be18bcd4be5f5c316cc2dd7677401b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 21): (anonymous) 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/daemon/test/pi-shell-launch-native.test.ts"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d888d0b45637f06a556fa9bfc7c3231a8b0ac40c22e3ec065e0e97caa285335"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 21): (anonymous) 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/ui/src/components/RigGraph.tsx"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d4bc32cb704f0ad9c2665825e64ebdf1ac2bff577e1ffac3ba6c396f108d62"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateLegacySources (cyclomatic 18, cognitive 21): validateLegacySources 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":"skills/_canonical/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"1843de87b82e509c1ad1563616f69e8a20ab071bbc2d91634050f3de2c094e23"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function paneOccupant (cyclomatic 18, cognitive 20): paneOccupant 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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aba89ca47323ac6e9bc458eb8d2e4b10b0a8be10c72d5fa690e1075ead53ad2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function provisionContextCollector (cyclomatic 18, cognitive 20): provisionContextCollector 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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":1268}}}],"partialFingerprints":{"codehealthFindingId/v1":"189b525ce7cd9bf3dc7858de29279a5501852d16d820bf5659f4f691cea66eff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getStatus (cyclomatic 18, cognitive 20): getStatus 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/daemon/src/domain/kernel-boot-tracker.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"8456b11c880fc3470c156232251848566c77307c6191a7773d8e1d5d29084164"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 20): (anonymous) 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/daemon/src/domain/queue-wake-ladder.ts"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"062c965d26da2bc2a54cb4da6c064a1f2835b590fc4b30c959a9eb0faa2dcccc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reconcileStoredSelection (cyclomatic 18, cognitive 20): reconcileStoredSelection 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/daemon/src/domain/seat-skill-apply.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"68cbabf4c2d20f786d23d73aa6f84d3c153e435a26deb049dab77739e8ea1a00"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 20): (anonymous) 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/daemon/src/domain/workflow-validator.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbfb8cd7afa4d7c9db35981b45372178f27e6d5064df2ea64aa5ac8d420f8613"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detailLines (cyclomatic 18, cognitive 20): detailLines 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/tui/src/cost/cost-model.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"931ce0918268804dcdf2fe65956512017a5aa49d4e0053738fd61277c7d2623d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function healthDetailLines (cyclomatic 18, cognitive 20): healthDetailLines 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/tui/src/health/health-model.ts"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"93f88d323e05ee21c338faf2198a49cf38de658d317132041c3cd4df96540682"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 20): (anonymous) 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/ui/test/p5-mission-discovery.test.tsx"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa1d5c6afc1d05f34c52e116b14f7bab8cb7bcb5a2dd1d53ecd15d2fc2a197f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 19): (anonymous) has cyclomatic complexity 18 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/mcp-server.ts"},"region":{"startLine":2071}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e13a252e659977c838922974bf5d21921b7f5ee90b538b9e0facf55369a650e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function project (cyclomatic 18, cognitive 19): project has cyclomatic complexity 18 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/daemon/src/domain/gateway/slack/queue-access.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca1924c71f2775ba3a521cd5de522f222b0a5749292f86edecc893765df35aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recipientFor (cyclomatic 18, cognitive 19): recipientFor has cyclomatic complexity 18 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/daemon/src/domain/policies/mode-scheduled-end.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"badbb15057e919a23fc981df34c5ec175518e3a2f4d71e8740dc5ec4118b80e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 19): (anonymous) has cyclomatic complexity 18 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/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":1590}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6a1194c1829846269ef79da7bdde404b46a7ac1f7bb8b7ae81b73c59f606fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readPage (cyclomatic 18, cognitive 19): readPage has cyclomatic complexity 18 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/daemon/src/domain/stream-subscriptions.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"c951252d37e6caf1c3ef1fc5ed086b5366e5afd05ea754fdadea06e86af8d248"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pumpManaged (cyclomatic 18, cognitive 18): pumpManaged has cyclomatic complexity 18 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":1144}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2c9050c377116d704f94418e98966dfc7dc720fffba851fdb161bf3b5a8c5d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeLegacyBundleManifest (cyclomatic 18, cognitive 18): normalizeLegacyBundleManifest has cyclomatic complexity 18 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/daemon/src/domain/bundle-types.ts"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c7915da340afe7145b9e68f13f1cf7cb9e10adc23f636748ca0f31fffc986f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveEscalationOwner (cyclomatic 18, cognitive 18): resolveEscalationOwner has cyclomatic complexity 18 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/daemon/src/domain/escalation-owner.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d72079bba1fb4e4a71809e3828c7117cdaa098ed59904f355c54d2f8c611ede"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decisionRevision (cyclomatic 18, cognitive 18): decisionRevision has cyclomatic complexity 18 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":4759}}}],"partialFingerprints":{"codehealthFindingId/v1":"9525003e28ce9de61b1ec36891714fb44665a0db584039966c96eb9d45196b94"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tokenStateFor (cyclomatic 18, cognitive 18): tokenStateFor has cyclomatic complexity 18 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/daemon/src/domain/restore-plan-preview.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f2cc120b0dcad9a633c9485f6e7fe8b9651637560fd1fa185c293cbdca1ca9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reportNow (cyclomatic 18, cognitive 18): reportNow has cyclomatic complexity 18 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/daemon/src/domain/terminal/rex-agent-status.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8535dc0024bdfc93b09fe4b24a6da0443771c6b2a2d3c89885dc861eaa606b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function modeChangeControl (cyclomatic 18, cognitive 18): modeChangeControl has cyclomatic complexity 18 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/test-system/delivery/cases/d18.mjs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"706070f879a1ec70b111339bd51f649808ff2b6a445ab9f315bc05d80181ee5c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function settingsFileConflicts (cyclomatic 18, cognitive 17): settingsFileConflicts has cyclomatic complexity 18 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/daemon/src/domain/claude-credential-precedence.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2fcc10bf0bd13534349330c0f654860fb1651e3a53081ca031e6f1e7fc8eda7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeStartupStatus (cyclomatic 18, cognitive 17): normalizeStartupStatus has cyclomatic complexity 18 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/daemon/src/domain/context-monitor.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab82fae449f5e1af66c838f79c9bf79748ebb19bcf28f712a2cf3c55d0877ec5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatRelayOwnerNotificationAccepted (cyclomatic 18, cognitive 17): formatRelayOwnerNotificationAccepted has cyclomatic complexity 18 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/daemon/src/domain/queue-transition-log.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c92fb147d78b6cca687b7c20983d8671d647e3342b358c0004cb92575dabee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 17): (anonymous) has cyclomatic complexity 18 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/daemon/src/domain/rigspec-codec.ts"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc91014f9fbf6a21e8fa72c79815e988f4877712edcf53001a7b8dbd88ed5b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isSelfReferential (cyclomatic 18, cognitive 17): isSelfReferential has cyclomatic complexity 18 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/daemon/src/domain/skill-audit.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd09b4acb40e56e311a855d644980fe1ecd19b94cbe27c2b4670ab4bb41d652"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 17): (anonymous) has cyclomatic complexity 18 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/daemon/src/domain/workflow-runtime.ts"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c773e5c512944adf1374ed4d250517f08979cfc5ece87381c0117b1832df703"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 17): (anonymous) has cyclomatic complexity 18 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/daemon/src/domain/workflow-runtime.ts"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdef42c2d5f27a833530167298ea33fff2d1338dc530fc527f7fcdbdc287ae3a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function forwardQueueWrite (cyclomatic 18, cognitive 17): forwardQueueWrite has cyclomatic complexity 18 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/daemon/src/routes/queue.ts"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce44e63addb16bd8ea9e0522232208ba8262b406bda3a053ca489ec8327b89b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 17): (anonymous) has cyclomatic complexity 18 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/daemon/src/routes/queue.ts"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"7149bfbe668a9a63ed1b4eec5fcf5b0c458ee01f4f35e637e5e791b0ca8b7d10"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 17): (anonymous) has cyclomatic complexity 18 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/daemon/src/routes/queue.ts"},"region":{"startLine":1212}}}],"partialFingerprints":{"codehealthFindingId/v1":"2baebdca112c5dbee4dfeffee41a3b083571493412b4de6100ca12ecc5e4bf3a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 17): (anonymous) has cyclomatic complexity 18 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/daemon/test/session-transport.test.ts"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"f64115fccb9d446d193b8d956a0a51d44780436d25862bb217bcc4cb107e888c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ToolMark (cyclomatic 18, cognitive 17): ToolMark has cyclomatic complexity 18 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/ui/src/components/graphics/RuntimeMark.tsx"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b78ddcdbc29871e7866b4f02e027576b413c4bd75731f36f9919c4da6094d3e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runProjectWake (cyclomatic 18, cognitive 16): runProjectWake 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/commands/project-worker.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"99654f31a02188da3ea3d91bc6dd421f6cba8b79febb3d47f7d45313b2063468"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function modelObservation (cyclomatic 18, cognitive 16): modelObservation 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/lib/model-observation.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"306d788a9d7564568b52096055c9191f22465d03c6bc6dc045cfb2d339b54b8c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lookUp (cyclomatic 18, cognitive 16): lookUp 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/daemon/src/adapters/pi-openrouter-charge.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"d018b955c659eade63b5bc891a6327a2a3df84517c8b2a31a167d797769789db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function carrySeatLaunchAdditions (cyclomatic 18, cognitive 16): carrySeatLaunchAdditions 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/daemon/src/domain/seat-launch-additions.ts"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75aedb6dd8bf1bd8cd77db9d164186dc4e9f285324c9dbb462de830ff64b94f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderScreen (cyclomatic 18, cognitive 16): renderScreen 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/tui/src/render.ts"},"region":{"startLine":1899}}}],"partialFingerprints":{"codehealthFindingId/v1":"066fab3f9b6dee42749ce749bf0fc42710cacf118e3e41eaf36f5c20dffa1fa3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function describeState (cyclomatic 18, cognitive 16): describeState 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/tui/src/socket-server.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb6eacad1f50cae5014a5a90c789d18d9aeb60e1de0d4a301ea16da497e323f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function RigEnvPanel (cyclomatic 18, cognitive 16): RigEnvPanel 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/ui/src/components/RigEnvPanel.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a97a61be2119b9f3cc4731a19616d1008e93b2761da56bb4c19dd4fae48429"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function RigGraph (cyclomatic 18, cognitive 16): RigGraph 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/ui/src/components/RigGraph.tsx"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56d2fd034329ec59ec0e4e64346be34b55255601ab42c47e69e0352b6e7a75e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SessionPreviewPane (cyclomatic 18, cognitive 16): SessionPreviewPane 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/ui/src/components/preview/SessionPreviewPane.tsx"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ffb296d5179e516ec3ca9f8e0231cef996407104daaf402e35925836616151"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function StoryStepCard (cyclomatic 18, cognitive 16): StoryStepCard 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/ui/src/components/slices/tabs/TimelineTab.tsx"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"671e931e7c1d413130906d0aca5cc9140ca7ac59f8cd34db10166a4f0e8796ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeRelayReplyRef (cyclomatic 18, cognitive 15): decodeRelayReplyRef 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/daemon/src/domain/gateway/relay-outbound.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceebeede80652ac844d36be1e9700c78a3fdbd83c20c5a50a144e5fcc33e56a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function submit (cyclomatic 18, cognitive 15): submit 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/daemon/src/domain/health-checkpoints.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbed53ea7d05d764c19efdad7e8119ecdd22f533bb929f63750e59420ff61d65"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 15): (anonymous) 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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e37c1ff74a232b4128f91d5325f5349c5cd8f27d8d47a44b7a5473a3a9f33a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordRuntimeHome (cyclomatic 18, cognitive 15): recordRuntimeHome 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/daemon/src/domain/seat-runtime-home-record.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b84c66e205bb5159d4d410288508c408e00b582da9628629649746087011ff3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 15): (anonymous) 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/daemon/src/routes/seat.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3e23a82446331330d15a7338cfe15785d8ca7d9d33dace750964f5b3a2b24d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 15): (anonymous) 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/daemon/src/routes/sessions.ts"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"04c05815c23afb5b7e130179d414565bf57d7b8edea3d8bcb66f0530802e7c66"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function HostConfigCard (cyclomatic 18, cognitive 15): HostConfigCard 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/ui/src/components/dashboard/HostConfigCard.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea670b43b0fee9404d222800f987acdc5a9cb95e90f5737acafd65ddb85b696e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ExceptionBanner (cyclomatic 18, cognitive 15): ExceptionBanner 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/ui/src/components/workflow/WorkflowInstancePage.tsx"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"3607f1ec0c8b3efa5c659be9d39805460e1cd0c1af597e87c77cd7c2482dcf29"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyWakeResult (cyclomatic 18, cognitive 14): classifyWakeResult 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":1395}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90458a8e53efcb911c25d2f9ba9e29b19415594ec7766b75f037c214f40512e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function LiveNodeDetails (cyclomatic 18, cognitive 14): LiveNodeDetails 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/ui/src/components/LiveNodeDetails.tsx"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71f103771c7ccada974de3026665f7c8788ad19a9189227374161a4437331db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tokenize (cyclomatic 18, cognitive 14): tokenize 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/ui/src/components/markdown/SyntaxHighlight.tsx"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad927b0309a950bdb561d0e97f868c98d86abf0e116e5295a0dee7b6671236d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function claudeLimitResetAt (cyclomatic 18, cognitive 13): claudeLimitResetAt has cyclomatic complexity 18 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/daemon/assets/plugins/openrig-core/hooks/scripts/activity-relay.cjs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"c720f6f67f721d144663fe2dfbca906ff9aa730d417ed97102bcac7ef1de9ee3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function attemptReaction (cyclomatic 18, cognitive 13): attemptReaction has cyclomatic complexity 18 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/daemon/src/domain/gateway/slack/inbound.ts"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ec1049ac42878bfc305f2d4ca7e05d1e53bc4b7cadaea7ed379acee8897794"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evaluateQueueWait (cyclomatic 18, cognitive 13): evaluateQueueWait has cyclomatic complexity 18 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/daemon/src/domain/queue-wait-backoff.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde897fc87e71dde676e36493581dafa27ebc7ac38df191d9388555a863e0499"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 13): (anonymous) has cyclomatic complexity 18 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/ui/src/components/for-you/FeedCardQuestionAsk.tsx"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b7dd88163e293e755616b979768256d291556cb08dd9935ac90f2811b809d5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateJev (cyclomatic 18, cognitive 12): validateJev has cyclomatic complexity 18 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/commands/project-jev.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a716f8ba171bdc9f44e3c11dcc3395f82ae03601a44be7016498360a78cffa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validPiUsageFact (cyclomatic 18, cognitive 11): validPiUsageFact has cyclomatic complexity 18 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/daemon/src/domain/pi-usage-entries-store.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa94c35a29555cd12113185cd4f6ae8d88697f361cc8b77801d82973a72c91fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 11): (anonymous) has cyclomatic complexity 18 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/daemon/src/domain/terminal/herdr-viewer.ts"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c9912ff3057423509a8bebc98db662fa6d4d39fdf3945c9a9eb1993f55b8ff6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseGitHubBundleLink (cyclomatic 18, cognitive 9): parseGitHubBundleLink has cyclomatic complexity 18 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/lib/bundle-source.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d41044175b76ac448f2a7ff0032f69cc4c143fd458fd343ae2678ef53a92b18"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function seatScopeStart (cyclomatic 17, cognitive 35): seatScopeStart has cyclomatic complexity 17 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/daemon/src/adapters/tmux.ts"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee432dd76cd9a7c7e6b23047dd6697d04496b592f4d5c8e5ba01e95d7f88f494"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeRestorePlan (cyclomatic 17, cognitive 33): computeRestorePlan has cyclomatic complexity 17 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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"4558da6db9f0cfe06016cb38a946726a8dff18965c0774b3933cc7cbc081acce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeLaunchOrder (cyclomatic 17, cognitive 33): computeLaunchOrder has cyclomatic complexity 17 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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f47320a1489b0fc7032a808907102015962bc8976dfa7e052d897009a904564"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stageConfiguration (cyclomatic 17, cognitive 32): stageConfiguration 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":"packages/cli/src/lib/bundle-configuration.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f257d642524e503e50f7b2918c6bb3406c070ab7e2806a125c9578d16cdb59"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractSkillEdgeLayout (cyclomatic 17, cognitive 32): extractSkillEdgeLayout 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":"packages/daemon/scripts/gen-control-plane-json.mjs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bec1ac7266d05c83af895ed01b6050941d2fc76c9c3c5e59ffc7e995597837d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evaluateWaitTargets (cyclomatic 17, cognitive 31): evaluateWaitTargets 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/daemon/src/domain/services-readiness.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"0455a984b7f78925ae25aa82c1a2e61ab4b6b93b66eb217ff02046be3d43a29e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function replace (cyclomatic 17, cognitive 30): replace has cyclomatic complexity 17 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/daemon/src/domain/network/network-installations.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"704917fb58f3ad578966bd922c0642e2c01e86f526b6f4f52d1b35f3463a6748"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function work (cyclomatic 17, cognitive 28): work has cyclomatic complexity 17 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/commands/stream-outcome.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"530413f52bdeb0aaa105389bc4088ed595794203757f77851396686661713520"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function continuationArguments (cyclomatic 17, cognitive 28): continuationArguments has cyclomatic complexity 17 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/daemon/src/domain/claude-continuation-launch.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd06b877aa93585f47f9b758a42d6effc8b559808602bcce63d406e7529a675"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function liveStartReservation (cyclomatic 17, cognitive 27): liveStartReservation has cyclomatic complexity 17 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/daemon-lifecycle.ts"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a0f6bc2f5d060a394963d65c34f67d0f6de8991243d97889af6de97cab9b7e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function richInline (cyclomatic 17, cognitive 26): richInline has cyclomatic complexity 17 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/daemon/src/domain/gateway/slack/message.ts"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"75701a05eaefba15b71d6db12e7e3b5b3c039b7fa67d9e58b2f7298deb7c36ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deriveUsageLimitPools (cyclomatic 17, cognitive 26): deriveUsageLimitPools has cyclomatic complexity 17 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/daemon/src/domain/provider/provider-signals.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"a16d4635aeba4d1fa4aa426b953d8e14f5dea4d254b1aae97cb1b44e03b7a08b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 25): (anonymous) has cyclomatic complexity 17 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/commands/scope.ts"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"4916f6d1926d5752654ef3896b404c0927107de9119f174c6948dfb9a9e0dece"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reconstructionOutput (cyclomatic 17, cognitive 25): reconstructionOutput has cyclomatic complexity 17 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/lib/reconstruction-reader.ts"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3e43c1d42bc6a41dc539fb06f1ffd6aae4c77442c1159319974163534c7afa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 25): (anonymous) has cyclomatic complexity 17 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/test/slack-cutover-cli.test.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fba7e1e2ad342e04a796e911daff3e24bb2ae2c3923e5104b7475e0f114cd94"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fallbackLineStart (cyclomatic 17, cognitive 25): fallbackLineStart has cyclomatic complexity 17 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":5977}}}],"partialFingerprints":{"codehealthFindingId/v1":"515d18d8a71ea82b749e5891b819d3ebff2a19da5ef042426aa9664220e7810e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanWorkflowSpecs (cyclomatic 17, cognitive 25): scanWorkflowSpecs has cyclomatic complexity 17 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/daemon/src/domain/spec-library-workflow-scanner.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"54dfdc000e66c3114f4d44e568a83bb90b73b1e29f44d2b76cb1f2a2be425535"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function capabilityDeltaExpiryFindings (cyclomatic 17, cognitive 24): capabilityDeltaExpiryFindings has cyclomatic complexity 17 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/lib/scope/capability-delta.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"7deb3f11d1554cb994ff76c2b39b1be4b00637425e997f33b22560603862a05d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 24): (anonymous) has cyclomatic complexity 17 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/test/chatroom.test.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"edce42747edb9e8a9c1a924afae331415373589202632caf1fbcb7bc195d5a74"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildPiChildEnv (cyclomatic 17, cognitive 24): buildPiChildEnv has cyclomatic complexity 17 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/daemon/src/adapters/pi-runner-protocol.ts"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"068e68b747d7cd13c1d028d621d6e48c266ce1f7aabedcaaf2695da6a02e2a8b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 24): (anonymous) has cyclomatic complexity 17 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/daemon/src/domain/context-packs/profile-source-resolver.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"da4777a842583e948845d7f0879ab9bf63d8df46ecab392d2f37697ef72f1f50"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 24): (anonymous) has cyclomatic complexity 17 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/daemon/src/domain/rig-lifecycle-service.ts"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"37dbbd33aa1ed826e4462786c282abfd1a9fb5cfda30f10a6dbe62af0387ab41"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function observeRuntimeHome (cyclomatic 17, cognitive 24): observeRuntimeHome has cyclomatic complexity 17 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/daemon/src/domain/seat-runtime-home-record.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed4cd96992c3a13b52c545755dc92106789a4c83557128dd25af4a9014f4ff5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function answer (cyclomatic 17, cognitive 24): answer has cyclomatic complexity 17 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/test-system/delivery/stand-ins/responses.mjs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"d86277c4fcfc9ce869384b95ff16705a575973079018866a5820766a35ac6b64"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildWriteReceipt (cyclomatic 17, cognitive 23): buildWriteReceipt 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/queue-receipt.ts"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"18b1b805621adb28993be40a19c3fd68a1fd48c1844dba9cf4705f92cc3282a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cleanupOwnedClaudeCwd (cyclomatic 17, cognitive 23): cleanupOwnedClaudeCwd 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/daemon/src/domain/claude-owned-settings.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06d7300622557f542dde8b1e38ed39e9ea7c4ae89db83289197a93a78f6b58a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function currentRestoreSnapshot (cyclomatic 17, cognitive 23): currentRestoreSnapshot 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/daemon/src/domain/current-restore-snapshot.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"b04f52fd3128c47cdae642a38672fcc93dea60164a6021f989cd30140d49fa48"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 23): (anonymous) 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/daemon/src/domain/provider/subscription-move-report.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37f8540581ff0735db029e8c3e39941375c0667a449a7642e63f3fa4e09f3e4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function retryUnroutableWakesOnReachable (cyclomatic 17, cognitive 23): retryUnroutableWakesOnReachable 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":2147}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c8169636199ce0f2cc8bff6a191392ca85f7fdf3b075b5dffd1b6894f8f5c84"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function listFiltered (cyclomatic 17, cognitive 23): listFiltered 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/daemon/src/domain/workflow-instance-store.ts"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"182f154b1afe270564824710f4f8b962fd6dc472414ab88f36d6f23d00a3c730"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compileGate (cyclomatic 17, cognitive 23): compileGate 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/daemon/src/domain/workflow-projector.ts"},"region":{"startLine":1896}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff574154d0b573daa68434ade71b4e7b0484fc17f3651d9aeea098793fb41a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function laneDetail (cyclomatic 17, cognitive 23): laneDetail 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/tui/src/execution/execution-model.ts"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bef357e4f3c2efc57d07fe5c345ac493fa179b45ac208cc3501aeee85a32da6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderSeat (cyclomatic 17, cognitive 22): renderSeat 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/commands/parked.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa935d04183bb1571b0afa075de7332a95266ff01bed526f534d3e1199d7c1a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rowReceipt (cyclomatic 17, cognitive 22): rowReceipt 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/queue-receipt.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a9cd73854d3f80ac81ae2862b4c5f8c51c467190214553ceeff2bf88438d16"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function measureWindow (cyclomatic 17, cognitive 22): measureWindow 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/terminal-window.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b71b17c1c0402a1127198f273bcef8833d970b1688a44ee637a8c398b893e61"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 22): (anonymous) 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/test/down.test.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"a00ca77474faad6ed82c4709969375f78c202c21b941c065a68ad656c898e5de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readImageEntry (cyclomatic 17, cognitive 22): readImageEntry 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/daemon/src/domain/agent-images/agent-image-library-service.ts"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a6c89df99431f3885ac04c6396deb144ccb1894659c85802aa3120b06075baa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readReadyFreshLaunchFences (cyclomatic 17, cognitive 22): readReadyFreshLaunchFences 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/daemon/src/domain/fresh-occupant-relation.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"604c4234241085ccbfe393c45b78816a0182c127e64b12c9b87f40208a4ebc61"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function record (cyclomatic 17, cognitive 22): record 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/daemon/src/domain/outbox-handler.ts"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"b03da64893e113310cfc777a47d27666c5cf9592771b7e2c4b7ad77307e3c990"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function composerRegion (cyclomatic 17, cognitive 22): composerRegion 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/daemon/src/domain/startup-submission-evidence.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"a784c44bbd3cbc4d5e44a31ff59d4fea8b4ee39881776ccf0f7bd715ca4c5c0b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drain (cyclomatic 17, cognitive 22): drain 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/daemon/src/domain/stream-intake.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c928c0c806aa5b0fd5c75daf83158fce854c1c993b88a1bd93f13968e459b33"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 22): (anonymous) 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/daemon/src/routes/gateway.ts"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ecfe10a215f85d868458aa4f1820108c1564a1f3af35a2937d1fd846a7ae7e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 21): (anonymous) 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/commands/tui.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e5f94f25ff0f549eb74078e7bf3d856cf2f4ce3056f4da19d6df8333ff57958"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectRuntime (cyclomatic 17, cognitive 21): detectRuntime 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/restore-packet/runtime-detect.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"d08cfc18b166539edc5326d68e5f3f3324720c7a11bc53eb3ef89912947d0ca1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classificationSources (cyclomatic 17, cognitive 21): classificationSources 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/daemon/src/domain/classification-sources.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbba6a6bdd43a4cefdb8810316be24595809536be4f20dc01009214e86e0f173"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cleanSeat (cyclomatic 17, cognitive 21): cleanSeat 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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":1289}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe2da7edf898a49b9aa9e0bc156244f0aea909f044d7a87ee2662dfcb7e247e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function switchClient (cyclomatic 17, cognitive 21): switchClient 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/daemon/src/domain/seat-switch-client-service.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"76685b4aa243235a96a720becc455f27a98b5bf77c60153c8e3b1c59db6683ca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 17, cognitive 20): fetch 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/client.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f55a4720185a2365073c7a66be6c72fb273b33260af09bddbefd9bec64962f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function canonicalProjectionSnapshot (cyclomatic 17, cognitive 20): canonicalProjectionSnapshot 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/daemon/src/domain/gateway/human-registry.ts"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"1150bbe49dee2908949c0a8d7e353444fb7ec486737c28c5641fbd357f54c914"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bootKernelIfNeeded (cyclomatic 17, cognitive 20): bootKernelIfNeeded 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/daemon/src/domain/kernel-boot.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf2cf16c6cb796f688c0498c8cbe284b470af9850d85e5e882e7436492ef204"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 20): (anonymous) 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/daemon/src/routes/gateway.ts"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7bd4e4a33c0aa562f3aa896cdd40e34434dfaedff8ee459d337aa644b90ac8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 20): (anonymous) 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/tui/src/page-read.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d312b03558896df304d49746b8a141955f11290783e45ba8627a23b031a7f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 19): (anonymous) has cyclomatic complexity 17 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/commands/chatroom.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"f798ee0ea19f30bdd644d5e444b9adb50e1777b01c33648b648d0a48f23d34a2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 19): (anonymous) has cyclomatic complexity 17 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/commands/host.ts"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"3434f0da78e40423e2d5d1c0f638bcfb026581c6afa37cba6c5be1055c447d05"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseFilter (cyclomatic 17, cognitive 19): parseFilter has cyclomatic complexity 17 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/commands/ps.ts"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42ba0043ef9ecc1c050f8afbc1cc49b7a98477774d5c1dc2dc249dba5c57a59"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveLibrarySpec (cyclomatic 17, cognitive 19): resolveLibrarySpec has cyclomatic complexity 17 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/commands/specs.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec1e45c4b34d854c6f669a4b01deaa5a1042b6706eda5a0ac3508a16f395883"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 19): (anonymous) has cyclomatic complexity 17 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/commands/specs.ts"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"97bf414c7be4f1c6d2f8e014740689e39f4f928b062f63c41ccfb38ac797402d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveActivityEndpoint (cyclomatic 17, cognitive 19): resolveActivityEndpoint has cyclomatic complexity 17 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":2004}}}],"partialFingerprints":{"codehealthFindingId/v1":"70493291731678e0be0f36a425580984fa65c0af952a8843efeac2b4be723aa1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveStubActivityEndpoint (cyclomatic 17, cognitive 19): resolveStubActivityEndpoint has cyclomatic complexity 17 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/daemon/src/adapters/stub-runner.ts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"22fe189a87766b4f402e2ab3bda90aaa6b63b739ce0a9cd7d5f0e78c64b4e94b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compareFilesystem (cyclomatic 17, cognitive 19): compareFilesystem has cyclomatic complexity 17 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/daemon/src/domain/codex-filesystem-preflight.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a36698f55e7816b25b182fed229d48360b8cc54f18135d6fc5e39497a31c17f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readHostAttention (cyclomatic 17, cognitive 19): readHostAttention has cyclomatic complexity 17 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/daemon/src/domain/feed/attention-aggregator.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"20bcf8b1e998e2a760282ff2f58db043c36cddf4c16b6e575b9eb8ff38d562ea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readNativeProcessArguments (cyclomatic 17, cognitive 19): readNativeProcessArguments has cyclomatic complexity 17 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/daemon/src/domain/native-process-arguments.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"c687789091c7e01d04a939eb6df50f519fc7f9cc910d10f8e969864f9e3eb1fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyOwnerNotification (cyclomatic 17, cognitive 19): classifyOwnerNotification has cyclomatic complexity 17 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":1435}}}],"partialFingerprints":{"codehealthFindingId/v1":"da98e051b8b48b0acc49e870f12dbde985b24c3f9b9bdd988e1849dcc9fc3b09"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reuseLiveWorkspace (cyclomatic 17, cognitive 19): reuseLiveWorkspace has cyclomatic complexity 17 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/daemon/src/domain/terminal/herdr-adapter.ts"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce01a0f6cd3ff2a1e0623b5c5deb2eab7b7b89316186fea1bd2e7e8d6000c9a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decideOnce (cyclomatic 17, cognitive 19): decideOnce has cyclomatic complexity 17 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/tui/src/config/pairing.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"1960fda8eb595ffc34ab2b6544cf50533aa9edcfa216695ca4302302040c2fe0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 19): (anonymous) has cyclomatic complexity 17 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/ui/src/components/topology/TopologyTableView.tsx"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f77455bde4495a42355d041349b754d3770325be12bc03ddd341d2db9ae5c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyEvent (cyclomatic 17, cognitive 19): classifyEvent has cyclomatic complexity 17 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/ui/src/lib/feed-classifier.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"6496c3375c0066c724585664e56686e4ad52ad1bdb2853038e279d71c7c7f5ba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runHttpHostCapture (cyclomatic 17, cognitive 18): runHttpHostCapture 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/commands/capture.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"436a831f02ce3f55ccd240c3220bd00f457a33f14447c8ffea0ec4d55601d673"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 18): (anonymous) 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/test/start.test.ts"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3048750a7e724553244200825ca6c7e578e08f6f538899d69793a7bca1cf299"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function context (cyclomatic 17, cognitive 18): context 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/daemon/src/domain/claude-managed-launch.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"647b329ed6a6e816a8610a9044cb1816cc9000bc62709fb76bd24b048ce842db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readNativeProcessLaunch (cyclomatic 17, cognitive 18): readNativeProcessLaunch 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/daemon/src/domain/native-process-arguments.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"b698ddc5e2c0219191a24f2e803c93c8c89723531089de944a2e7b09b7541452"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function unclaimSession (cyclomatic 17, cognitive 18): unclaimSession 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/daemon/src/domain/rig-lifecycle-service.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb15b60d81df4a6f38fd99a28b66901e002eeb2e743d81306d87ff09c3d54a94"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 18): (anonymous) 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/daemon/test/claude-auto-startup.test.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d6ec8a44a9cfcc7c184f61288837bf0a1905029df7e781439f84b6b68d87f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 18): (anonymous) 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/daemon/test/send-prompt-guard.test.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c1d6446707e8c891445b4b9ac846079dda4485cdc9d7bd0f6325373220676e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 17, cognitive 18): run 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/tui/src/main.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed816b08a61e5326f912b3ea926a49bd98bbdce8dee2602d764544ead2bec686"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function printRestartReport (cyclomatic 17, cognitive 17): printRestartReport 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/cli/src/commands/seat.ts"},"region":{"startLine":2063}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e39b359ef10318e05e116eb9021e7ff30c09f31c86e6d4e12916a028bc68b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function get (cyclomatic 17, cognitive 17): get 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/daemon/src/domain/pi-compaction-request-store.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c90b3c3ef69889eb80a2437b78718e95035e2338fd5d1f1b63ab7f7f2b3df84"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handoffWithin (cyclomatic 17, cognitive 17): handoffWithin 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":2791}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c1afee7426d197871fa4f44dc82d87bb1833221d5aef92fdf8ef6bdd75db16f"}},{"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/daemon/src/domain/session-transport.ts"},"region":{"startLine":4925}}}],"partialFingerprints":{"codehealthFindingId/v1":"021b1cef97448b56cfd1073cacf450379ae3ab2ce4500e1b58c3683c5ca081c8"}},{"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/daemon/src/routes/provider.ts"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a7eeba6321055a67e4ff6ac044d53fa297a7b0f5beb00b244d231d06f39bd5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function postSessionIdentity (cyclomatic 17, cognitive 16): postSessionIdentity 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":1838}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11a390d94deb938a6989699ba45dc0fdc2992dd4cd3695b7a12417ff79528a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function serializeLegacyBundleManifest (cyclomatic 17, cognitive 16): serializeLegacyBundleManifest 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/daemon/src/domain/bundle-types.ts"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bab72136713b3dbb5fca57ca0241a26dd177b75e06f89d22e229495ba441866"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readWakeOutcome (cyclomatic 17, cognitive 16): readWakeOutcome 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/daemon/src/domain/connection-contract.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"25decd893f5e5ca46a84d05653cdd109e4c6d9f72c2fadf027902ca6c661f2a8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function query (cyclomatic 17, cognitive 16): query 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/daemon/src/domain/mission-control/audit-browse.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed0e8d85eed2410c56f405d43cd90571807adff12e05a49f49a2aad47205664"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assessCurrentStateRehydrateEligibility (cyclomatic 17, cognitive 16): assessCurrentStateRehydrateEligibility 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/daemon/src/domain/rehydrate-eligibility.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"77805bf1f7a550281753314e67e281d133b6018de4c1eaa5486b469cbc366bf0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateHostInfraDeclaration (cyclomatic 17, cognitive 16): validateHostInfraDeclaration 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/daemon/src/domain/restore-check-service.ts"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fcc45b247bf156e821998ead98f7ad1fa2b58336c84d275dc351161aed35e50"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function piEffort (cyclomatic 17, cognitive 16): piEffort 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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5239aeed3661e3e51d3e791e6303b96d80c7ce99b5c8394fe7f3686545d9909"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 16): (anonymous) 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/daemon/src/domain/session-registry.ts"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"c60592bc19763107e280f8369805837b698edb690f000954cd59a58d8c5abdf6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchImpl (cyclomatic 17, cognitive 16): fetchImpl 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/daemon/test/slack-channel-map-wire.test.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2eefc3d67744143f4b72984165ca529021fa5ee4674fd1f6a165a9d36f0550"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function RigSpecReview (cyclomatic 17, cognitive 16): RigSpecReview 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/ui/src/components/RigSpecReview.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb3e3f523b493a27467adcd695d5e251a4f4eb754e8d7af7f82e58c44e2e942"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onSuccess (cyclomatic 17, cognitive 16): onSuccess 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/ui/src/components/for-you/FeedCardQuestionAsk.tsx"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"919b3d49be86a368fa938cc2eceaba9f260b01c257a4bafac9e8f8395bcd4de9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renewContentApproval (cyclomatic 17, cognitive 15): renewContentApproval 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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"906a7f5899664692d71159cff63ae1ac99475001ed24b59b5e0ecab157d3bd7b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function feedPerspective (cyclomatic 17, cognitive 15): feedPerspective 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/daemon/src/domain/feed-perspective.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"15882929e221580851e84ce6e2dd827097acefad85d7911d8d5a7762b5313598"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function personFacingBody (cyclomatic 17, cognitive 15): personFacingBody 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/daemon/src/domain/gateway/slack/queue-access.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c215555c573620b7b53a2e0f579f1ba23ebed161403d32012d41c34b298a93"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runModeScheduledEnd (cyclomatic 17, cognitive 15): runModeScheduledEnd 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/daemon/src/domain/policies/mode-scheduled-end.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63fd9cfd27ca5578c08f7f1de62e303d0c75196b2beec84158073ffc3ce6928"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateAuthoringLayout (cyclomatic 17, cognitive 15): validateAuthoringLayout 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":"scripts/mirror-skills.mjs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f56c4cdf31cb1b3e1665128418083ecf42c12d1ac83c1910e2d7a606c61d73"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function create (cyclomatic 17, cognitive 14): create 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/daemon/src/domain/environment-platform.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"d44c0e70e152ce978499f8b6fa48fde2b2713bdb665b8ec15c9b23e00afd6324"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 14): (anonymous) 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/daemon/test/claude-question-picker.test.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab56219577fc855f67a3347d6e5e198f4d2e0a1914f9068f88eec20c8d377c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 14): (anonymous) 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/ui/src/components/RigGraph.tsx"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a1d29c20575b7298ab6906cfa8b90393ecc4f6fe88f0e8f0e71f076571069e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareWorker (cyclomatic 17, cognitive 13): prepareWorker 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/commands/project-worker.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f71b1d1f1288fe866f641eb28147343366f3d56f653d5feb4f4f0737bc9b20"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 13): (anonymous) 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/commands/ps.ts"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a5010969bd2983666388d008cfc31eca7f47aeae09350d3c10fb0c3f96bcec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getActivityStateWithSource (cyclomatic 17, cognitive 13): getActivityStateWithSource 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/ui/src/lib/activity-visuals.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"f99367569513f02871d3fdbbb906aa08b34db9a2f8c5ee8afbe3a7e99f6848d6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeBundleSource (cyclomatic 17, cognitive 12): normalizeBundleSource has cyclomatic complexity 17 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/daemon/src/domain/bundle-types.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4deb5847a482df08b9f68369f85e797167e9962c0977a09492e5cfd087ae91c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createQitem (cyclomatic 17, cognitive 12): createQitem has cyclomatic complexity 17 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/daemon/src/domain/gateway/slack/queue-access.ts"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"f396f0fd2c7b5b75a19477ec41a90c335051ff71f4fe029b6589a3e31cc345da"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function appendContextSample (cyclomatic 17, cognitive 12): appendContextSample has cyclomatic complexity 17 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/daemon/src/domain/usage-samples-store.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"94e49f89f1dddf7952248e7fac0ade63b0e22f08cb99c11b8dc259424a2e5207"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mutationFn (cyclomatic 17, cognitive 12): mutationFn has cyclomatic complexity 17 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/ui/src/components/agent-images/ForkNowAction.tsx"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"766c2fb6d738f3e4120912302a595fbda98f0e9179224349d89fb14e6bf1cd63"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function chargeLines (cyclomatic 17, cognitive 11): chargeLines has cyclomatic complexity 17 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/tui/src/cost/cost-model.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"202673853f5117b06c25dd586c9a904e2815b0e8ad81fd303228500b30ed6948"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reviseGraph (cyclomatic 17, cognitive 9): reviseGraph has cyclomatic complexity 17 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/daemon/src/domain/workflow-reconciliation.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc20dee1f8bbf5a3a80611e01edc03ce5f6eeb59034dd0f4765533b7859fc54"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function consumeStream (cyclomatic 16, cognitive 38): consumeStream has cyclomatic complexity 16 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/commands/workflow-follow.ts"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"8759f9891dcda3e29edc4e6029a2902c695977aff1bd24e00cf10f8646a37bff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 36): (anonymous) has cyclomatic complexity 16 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/test/capture.test.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d25776e7d9d98f129dabaaedd5583b330415c5c2c4995c2dcbffa47cc9ec41"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractHookIdentities (cyclomatic 16, cognitive 34): extractHookIdentities has cyclomatic complexity 16 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/daemon/src/domain/plugin-discovery-service.ts"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d24b9c020422ed29b23ff5d20a69fa8a2e6122194f6e3a932f528b1d3313aa0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 34): (anonymous) has cyclomatic complexity 16 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/daemon/test/queue-recent-transitions.test.ts"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea1c083f1461e5c630545399ce19bea47c1b660b31995e8d5a4b00915596fd7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evaluateStepDeadline (cyclomatic 16, cognitive 31): evaluateStepDeadline has cyclomatic complexity 16 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/daemon/src/domain/workflow-deadline.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe1684a5b2420de349f9d639e90cc499f2778ef8b0ff4468f1554185b407f151"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 30): (anonymous) 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":"packages/tui/src/live-events.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee550cec7684f7bc9cd3ef00423f4cfbdc9952372c938d3779f18a10c8202ae7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveExplicitSlice (cyclomatic 16, cognitive 29): resolveExplicitSlice has cyclomatic complexity 16 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/lib/work-install.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7376944074578000aa1142fbb42a405e9aa13982a8ee9ff0a1f9db04ad5b978"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkSharedConversations (cyclomatic 16, cognitive 29): checkSharedConversations has cyclomatic complexity 16 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/daemon/src/domain/restore-check-service.ts"},"region":{"startLine":1752}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7cf39ce1f9029a007ea7da274f2e0a97bedd939cee5f7b92ae3ac08e5ad579"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validatePod (cyclomatic 16, cognitive 27): validatePod 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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"71424947389871fd7b44686e2487d70c4a3c4aade0f97373a9331b1d1f6c50e4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decide (cyclomatic 16, cognitive 26): decide has cyclomatic complexity 16 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/daemon/assets/claude-team-permissions.cjs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60b968b04504dcb7b048139a2c6b0ef8ea564cff157e12c6ad00de2ebff58fd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 26): (anonymous) has cyclomatic complexity 16 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/daemon/src/adapters/pi-openrouter-charge.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"d400ff09790d6afd8eb4177b91440e2ce3d0f54a8eac7ea9b1e81e72fefbd45d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanOnce (cyclomatic 16, cognitive 26): scanOnce has cyclomatic complexity 16 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/daemon/src/domain/discovery-coordinator.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b69861be52bb288c77281c2e91df509b256c6c2becbdd524fa51e07f827eab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanHeaders (cyclomatic 16, cognitive 26): scanHeaders has cyclomatic complexity 16 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/daemon/src/domain/markdown-address.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ab0babf27d9469b838c2b6798b79c0cd1b4053d475c2c82230393ecd924c0e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function localLines (cyclomatic 16, cognitive 26): localLines has cyclomatic complexity 16 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/tui/src/local-reading.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7887bf12e5569d9b52e566810fbd725b19750271759908a9c59a48aaff0c607"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function boot (cyclomatic 16, cognitive 25): boot 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/daemon/src/domain/service-orchestrator.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"471b680b4d81e58ea301ca1302b9ceaf6b8163a1ec7da2010e15c796124d006a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function read (cyclomatic 16, cognitive 24): read 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/commands/telemetry.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"f148ec622b2fb8567885df83c321f79f7fef3fa78106dbe1cbd2effc56e2c66d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchRecentMessageTexts (cyclomatic 16, cognitive 24): fetchRecentMessageTexts 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/daemon/src/domain/gateway/slack/slack-api.ts"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c68b7d1aa7c4cf7ffd8860e4c1f37b4931369399a162fed1854c7fef9649ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function noticeHarnessNotStarted (cyclomatic 16, cognitive 24): noticeHarnessNotStarted 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/daemon/src/domain/harness-not-started-notice.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a020e73f4f64302f9f1210efbe1b63f5070676c8cda8a76bdc2f296e2ea5177"}},{"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/daemon/src/domain/queue-erasure.ts"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"e64179a719ddb65636942227e43188fbc7f53fbfd7e6bc0a0c887496e28fcfea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function eraseRigRecords (cyclomatic 16, cognitive 24): eraseRigRecords 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/daemon/src/domain/queue-erasure.ts"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f9f6f454735b1ee56fcbad1ae3a775b7b764ec038263b9650a31ff5163e9b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function materializeValidatedSpec (cyclomatic 16, cognitive 24): materializeValidatedSpec 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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f89b1dbd4694019595f89305f6ff4d855af496f347564142e96626163a9e1cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 23): (anonymous) 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/commands/policy.ts"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8fa24373458030abaa7c0070f41b2a71ec5e41f75c7a476d1f6e87706509659"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walkClaudeContent (cyclomatic 16, cognitive 23): walkClaudeContent 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/restore-packet/claude-transcript-parser.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd9b26609b15cc28e90eaaa29b121799d04de865e3a450b5220067dfabeca71"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createAtomic (cyclomatic 16, cognitive 23): createAtomic 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/daemon/src/domain/files/file-write-service.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"83685e2eb90d3f655ec343d1a9a9864f82a75dc8deb5993d8aaa171113110f7c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 23): (anonymous) 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/daemon/src/routes/spec-library.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1336c46fcf88e8f2636d94645849aec3e1201efc918c45a073dca42b048f5d7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 22): (anonymous) has cyclomatic complexity 16 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/commands/host.ts"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"613afe53ef7f0c382569616ad7cf05b0e1fed6fb2e94b098200184b08d717936"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 22): (anonymous) has cyclomatic complexity 16 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/lib/bundle-check.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6260d222663c5ea42cbfc8e3d7f11481fc34f651b310d3cc019bdd3f9b6a800"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectImageRefs (cyclomatic 16, cognitive 22): collectImageRefs has cyclomatic complexity 16 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/daemon/src/domain/agent-images/evidence-guard.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"76917e4fbe527dc88bd162f928dedb5c1c32e4eaad3a4000f47350b35d049972"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function piSeatPinReadings (cyclomatic 16, cognitive 22): piSeatPinReadings has cyclomatic complexity 16 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/daemon/src/domain/model-divergence/effective-model-readers.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a4eef72e23566c063fe327764730c3227cbf29d8e5281866c03053a891cdf6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateStartupFile (cyclomatic 16, cognitive 22): validateStartupFile has cyclomatic complexity 16 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/daemon/src/domain/startup-validation.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"418c9982a46b0056091560e75d7a16f3c0c1ec0f4fb81f6490d82cdf93358e74"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function routerLineStep (cyclomatic 16, cognitive 21): routerLineStep 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/cli/src/commands/setup.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"f891980213a3507ad38027c52deae940f6d993c4ab37e427ccb40d6641359462"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveParked (cyclomatic 16, cognitive 21): resolveParked 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/daemon/src/domain/mission-control/mission-control-write-contract.ts"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"297f6857219ab96d2a6f2abe49f359f9894e9f7979493e61d9f5ec4cdaceea5d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 21): (anonymous) 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/daemon/test/health-passive-ceremony.test.ts"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"e977205bb673e4fc144341b6df842866125d5a73df6fb423935a44534fc0666d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 20): (anonymous) has cyclomatic complexity 16 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/commands/agent.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b8db731210863c23279d2ea2a22ac73a5d37d41ce07b52f313be3b5d5d99722"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function emitHandoffScopeAdvisories (cyclomatic 16, cognitive 20): emitHandoffScopeAdvisories has cyclomatic complexity 16 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/commands/queue.ts"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"45379c3968df6c2785cc206d6f04944ec4cfe3fb7e21aac858395c57a9fc562a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validatePluginsBlock (cyclomatic 16, cognitive 20): validatePluginsBlock has cyclomatic complexity 16 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/daemon/src/domain/bundle-types.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9147279d82cb7f07845e4e4cfc3dfd2307c166162251afe52b3322b09ed4aad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordedSeatSkillFiles (cyclomatic 16, cognitive 20): recordedSeatSkillFiles has cyclomatic complexity 16 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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"481d7a6c84402f3a852c6a8ec5a058ead5ba1c0bc27948a8d76d11b147f9f2eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 20): (anonymous) has cyclomatic complexity 16 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/daemon/test/seat-skill-follow.test.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"5371a807afe03602ed81c2bd3f98657968b1b5cecaa0a4e4c33abf24fc21cf0d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertAcyclicLaunchDependencyGraph (cyclomatic 16, cognitive 20): assertAcyclicLaunchDependencyGraph has cyclomatic complexity 16 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/daemon/test/spec-library-starters.test.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe89d22f2f73de5d0fa85400a1cbbe17e4f88ff13183e711128d48ab5cca02c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readBackQueueUpdate (cyclomatic 16, cognitive 19): readBackQueueUpdate 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/cli/src/commands/queue.ts"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"adbace0128433d12b82384f0c7ec4df35c13477a4f71712d92753bc4ba2289fd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateHostEntry (cyclomatic 16, cognitive 19): updateHostEntry 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/cli/src/host-registry.ts"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb09b9096afc33a9cbda607b77a61ce3e9217adc8da7be09406a407a298740a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolvePermissionPolicyAttachment (cyclomatic 16, cognitive 19): resolvePermissionPolicyAttachment 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/cli/src/lib/permission-policy/policy-ref.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"535e4b82da4074646b27d40d233f846939df2c44861cd7d1cda2c0028e7cbb1f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function wakeEvidence (cyclomatic 16, cognitive 19): wakeEvidence 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/cli/src/queue-receipt.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f69c88c35c1d9ed29dd25016e0a3de3a07351a1d571e1cd246a8e52f78d9f97"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function post (cyclomatic 16, cognitive 19): post 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/cli/test/stream-consumer.test.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae3cd0a379fc82309a1383ff702e12d75ee2dfe75a0d635daa1f6d6a440a23c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 19): (anonymous) 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/daemon/src/domain/agent-activity-store.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"6659b2709a14a78cdd5755edc4634ad13faeb827a354bb65b6b64f17bd26813b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveInternal (cyclomatic 16, cognitive 19): resolveInternal 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/daemon/src/domain/codex-thread-id.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"d818db48523ad087ac1c59e059e0b3145002da2431af7a3cdf37a04efc8d86f1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function quietStateFor (cyclomatic 16, cognitive 19): quietStateFor 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/daemon/src/domain/gateway/human-quiet-windows.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2c571c1726c39dd587854156b6c00730ad8457f415a554c433fda17466750c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateHostEntry (cyclomatic 16, cognitive 19): updateHostEntry 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/daemon/src/domain/hosts/hosts-registry-writer.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"1992fe45176d46fbab9e41a0b831c4fad355d6de9642f222e914f51ecb744c33"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolvePermissionPolicyAttachment (cyclomatic 16, cognitive 19): resolvePermissionPolicyAttachment 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/daemon/src/domain/permission-policy/policy-ref.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdffb8b1d06e194bb60b7d32c075d021be9acf0fc0373e14c83143cdb5a68e0d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildRigRollup (cyclomatic 16, cognitive 19): buildRigRollup 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/daemon/src/domain/restore-check-service.ts"},"region":{"startLine":1798}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb91d0e08628f56b51c424103634596dde5d5bdaf8159023920b80f1392c6016"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 19): (anonymous) 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/daemon/src/routes/down.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed2707a3913d4d51486129e6dc346e28eb0b40b7e79499b790929e9373e7217"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 19): (anonymous) 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/daemon/src/routes/files.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4fa91d015b459d86a84cdf2892e6452864a8ea610ca02dfe6c0544d6efbba52"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readPage (cyclomatic 16, cognitive 19): readPage 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/tui/src/live.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cafec86a25901f7d5fc442b356713712913dbb5e533cec18f6525c900c05006"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function printHuman (cyclomatic 16, cognitive 18): printHuman 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/commands/restore-check.ts"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"6606955b41225adbe9fb1d8e97f18bd975c9b22a53531fb6688e05a7ae5634c1"}},{"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/commands/scope.ts"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d89649baff761158dbecec6e78138edc7a43ebb76bef66bcf77f6693899046"}},{"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/test/terminal-window-rex.test.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79d1c540d6782b0619fbc80ef0cb077c7843ec7d710e6e5a640943335aa3176"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visit (cyclomatic 16, cognitive 18): visit 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/daemon/src/domain/codex-owned-plugin-trust.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"40aa520d49d0d64967d679e71379f509e4ced2c1ad59861914d0abee383f799e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function joinAutomaticRestore (cyclomatic 16, cognitive 18): joinAutomaticRestore 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/daemon/src/domain/existing-rig-restore.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"0995b019f28f2dacca8de73cc6f501fec231db37f09137c553cd1e8f7b914713"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evaluateCoordination (cyclomatic 16, cognitive 18): evaluateCoordination 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/daemon/src/domain/health-detectors.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"a21e37191ee22a632c90d82bef5521b174782a2e4e34001e689a744f7bce93e4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readHostComposedRig (cyclomatic 16, cognitive 18): readHostComposedRig 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/daemon/src/domain/review/fleet-compose.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e1beeb794486c872751176ae879d031876259bb0bbf655edd9dd3f225e7403e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reviewPodAwareRigSpec (cyclomatic 16, cognitive 18): reviewPodAwareRigSpec 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/daemon/src/domain/spec-review-service.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"7762cb51766d222362eaf4fff4bfd665b9a9341aa622df17b30173f69760f00b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateYamlAsRigSpec (cyclomatic 16, cognitive 18): validateYamlAsRigSpec 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/daemon/src/domain/up-command-router.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1dae33d10aa6d900fe30165868eb81d3f6e86ce118feb29d39449a215810457"}},{"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/daemon/src/routes/transport.ts"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e4723bdbf68ee9641efe9468afbff13f125d2869f4bb5b35f894a2817909c75"}},{"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/daemon/test/restore-orchestrator.test.ts"},"region":{"startLine":2826}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde1483527acf28c71705ed3ed3f356b8d95bb4f2430b5b6cf50bc827fcdebdc"}},{"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/daemon/test/restore-orchestrator.test.ts"},"region":{"startLine":3034}}}],"partialFingerprints":{"codehealthFindingId/v1":"108bc63aa4e741a990fbc5293fb4bd1dd1269bfdb4c74d1314957b3f7a5ade61"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function configBrowser (cyclomatic 16, cognitive 18): configBrowser 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/tui/src/daemon-client.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed28a003c9347a250fb17dc784b44989d66b2056939570699646b0e297a4f879"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 17): (anonymous) 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/commands/health.ts"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"16dcda4e6781ffc56d1aa4f4a71d15f4c878d44f5a61f485dcb3a1d5634622b9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readClaudeSelfReportEvidence (cyclomatic 16, cognitive 17): readClaudeSelfReportEvidence 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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":1504}}}],"partialFingerprints":{"codehealthFindingId/v1":"1caa2f96ccab88f467a6e6894b95319808a2fac2ad5c64827f9fd220b57336a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizePayload (cyclomatic 16, cognitive 17): normalizePayload 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/daemon/src/adapters/cmux-transport.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"3130001bc5b416e80da11917011a9a8c30f238e44ce9de1b1029ea21e9b2f949"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 17): (anonymous) 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/daemon/src/domain/gateway/human-operating-modes.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41b75c150c61e90733627dec298197574c5df2cd2cd3e69d1572db6ed681899"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exchange (cyclomatic 16, cognitive 17): exchange 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/daemon/src/domain/network/network-installations.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa4c975d5004287ad638d77935766f19ea2b416b42118e66c24a12bfca123294"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recentChange (cyclomatic 16, cognitive 17): recentChange 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/daemon/src/domain/queue-transition-log.ts"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"d99d6b36e4c4d6ababf7904bafef169bcf96e78ea3acf59a4b591e5840572a81"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 17): (anonymous) 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":4023}}}],"partialFingerprints":{"codehealthFindingId/v1":"942f2c502aa4bb6d0d601916e67bb6f57447df6e391c97f347b476d62b3ca690"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resumeFailureOccurrence (cyclomatic 16, cognitive 17): resumeFailureOccurrence 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/daemon/src/domain/workflow-runtime.ts"},"region":{"startLine":1395}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7198f2211f16755e665192151f66d016bdb442c3a44b6eb6aec5b71cf4832f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 17): (anonymous) 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/daemon/src/routes/hook-bridge.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"52dc473b0870811ac40d70f67a1839a1855f67ccb5c5ec1f13bca6c069f01f5d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 17): (anonymous) 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/daemon/src/routes/hosts.ts"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b48f1ddc7bd4d1d8321892cc4d8aeeb28d90cef8a3615ce8c36ad3306ca0fda"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function statusGlyph (cyclomatic 16, cognitive 17): statusGlyph 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/tui/src/topology/glyphs.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b90a6b4b189a43412bd1cf345e54b80ed0f63f5c96f3e89415d0a0d9802c53"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 16): (anonymous) has cyclomatic complexity 16 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/commands/create.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff5bfcc6dea1ee1fddca299c04e2f7822b2cd863285459937ed8e5e974bf7f0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 16): (anonymous) has cyclomatic complexity 16 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/commands/transcript.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ac9f5f50b164b4473585c7b82582f16b5ccec0d1808f2bfab8b3535e8513a8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readConfiguredContent (cyclomatic 16, cognitive 16): readConfiguredContent has cyclomatic complexity 16 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/daemon/assets/plugins/openrig-core/hooks/scripts/refocus.cjs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f616b41ea840b4f7af6f654e0439be98460a7fa4b311fc99b66e656fcbb9e60"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function capture (cyclomatic 16, cognitive 16): capture has cyclomatic complexity 16 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/daemon/src/adapters/openshell-podman-observer.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"08347c714f0034f941a82f0a1fa8f2aa85d7f693e1bee669780de060e41284b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 16): (anonymous) has cyclomatic complexity 16 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":2837}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe7372f2f97e3110a555eaa27252b8958f27e7820b8f3beb3da00b0a1b8aeb5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function currentDeliveryEpisode (cyclomatic 16, cognitive 16): currentDeliveryEpisode has cyclomatic complexity 16 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":5710}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf55fec53dbccbe59b92c7a4719f49f4041c1e4ecadf3584e8df7f03cdcfcfcd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function append (cyclomatic 16, cognitive 16): append has cyclomatic complexity 16 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/daemon/src/domain/queue-transition-log.ts"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa56b86058d9bec7a1e4ab911175f230be32fbbb2d68d2114b6b5cf70c8f7f9c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 16): (anonymous) has cyclomatic complexity 16 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/daemon/src/domain/stream-store.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"654ea1fe556ab7918339528b3e5f1cacd5559f580ad6d385742403cb8dade29d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 16): (anonymous) has cyclomatic complexity 16 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/daemon/src/routes/packages.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e42f623d02d060cfb7c9179be6dc62bb76cf85110edb160542e9a8c3c12113"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function argvExec (cyclomatic 16, cognitive 16): argvExec has cyclomatic complexity 16 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/daemon/test/tmux-seat-process-limits.test.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43e99ea1d61792426e594d156aa87178beeb68a3659e58b63723b5c014f988d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function proveResumedProcess (cyclomatic 16, cognitive 15): proveResumedProcess 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":"packages/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":1858}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce45f73aa27ec7ec3460fcf5441c55e9c36ec06fcd4ec4bc779d434c16d7f78"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function paint (cyclomatic 16, cognitive 15): paint 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":"packages/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"6118bfba62b2f2f5d133af470e06e490041ffe06cd8cb034152ac9f1020ae0e0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createProbeSession (cyclomatic 16, cognitive 15): createProbeSession 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":"packages/daemon/src/adapters/tmux.ts"},"region":{"startLine":1277}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33215c46c8ea9e599019c8c7d832aaaca68c918e5ab5e3f82cbbc825bb323bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordHookEvent (cyclomatic 16, cognitive 15): recordHookEvent 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":"packages/daemon/src/domain/agent-activity-store.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ec7bed3427c02b780ffeb169a6dc4928cfe80ccca70b989a0feda79c8cdddb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function save (cyclomatic 16, cognitive 15): save 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":"packages/daemon/src/domain/gateway/human-operating-modes.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"627e7bcb40ac1d82ee76eb95d59a162d19e07fee847ffc2a5f903ebc859a2b71"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleEnvelope (cyclomatic 16, cognitive 15): handleEnvelope 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":"packages/daemon/src/domain/gateway/slack/inbound.ts"},"region":{"startLine":1083}}}],"partialFingerprints":{"codehealthFindingId/v1":"4703321374fa8868a60e8bd1c5a1f35b39de25e5b27d525eac3eef6bd29021c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handoffAndComplete (cyclomatic 16, cognitive 15): handoffAndComplete 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":"packages/daemon/src/domain/queue-repository.ts"},"region":{"startLine":2979}}}],"partialFingerprints":{"codehealthFindingId/v1":"967fd27ab77edba5aa63330455312b25e7948bf84698ce329d348ff0b7cd16b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decide (cyclomatic 16, cognitive 15): decide 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":"packages/daemon/src/domain/runner-permissions.ts"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"548c3406e221e80674c4aea7f49cd16a9a8652c9ca902493e66444260deea85c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchesStoredWaitingDecision (cyclomatic 16, cognitive 15): matchesStoredWaitingDecision 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":"packages/daemon/src/domain/workflow-projector.ts"},"region":{"startLine":1514}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c7115cc425b849353850693c924158fcdd326bed070997a855e96f1cbc86aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 15): (anonymous) 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":"packages/daemon/src/routes/gateway.ts"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ccbcd484773d86ac5d28194629be13a05281e5c15c0eaec7456598c699209e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function relaunchInPane (cyclomatic 16, cognitive 15): relaunchInPane 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":"packages/daemon/src/routes/provider.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"f18ac1c80c89ccf8b7848cc51328a4f755e5caa4899c277e3ef26146043e4e1b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readOpenBody (cyclomatic 16, cognitive 15): readOpenBody 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":"packages/daemon/src/routes/terminal.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"d508f11c8f8f9d7d8b7f8e1b711998e0088df923d300c55a3f1ad02996f90334"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 15): (anonymous) 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":"packages/daemon/src/routes/workflow.ts"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"b183665932f11f8674715fd2366f0a9113e5227df5ad9aa85f83ed65dc113fa8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 15): (anonymous) 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":"packages/daemon/test/codex-limit-banner.test.ts"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"9081aba4f717dff598f2cad44cb8b2d1179163ad0eb236a302fd88494a87eea8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function paintContent (cyclomatic 16, cognitive 15): paintContent 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":"packages/tui/src/stylize.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cef5e0084e6a6d5b5626c5453174b18377a2c9657f5cf5637585ff83385dfc2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function eventColor (cyclomatic 16, cognitive 15): eventColor 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":"packages/ui/src/hooks/useActivityFeed.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57e82626e9fa02c7f51e58d2b90e08e17b049592057d77c293bb5bf7bf9fd55"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 14): (anonymous) 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/commands/queue.ts"},"region":{"startLine":2175}}}],"partialFingerprints":{"codehealthFindingId/v1":"954f053e75f9b118213fdf462ce9c2f3b69279b3e0e73bc8d18433fb7e2d7d23"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 14): (anonymous) 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/test/terminal-window-reuse.test.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5be56781c603059601b0d7ad487fcd5acec3dc8673330e573d2d08cfe7dd10b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function acceptRunnerRequest (cyclomatic 16, cognitive 14): acceptRunnerRequest 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"076f4284a80b48959855c668af9da805fed20e22fe2e86ed6ce971f63039dc27"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 14): (anonymous) 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/daemon/src/domain/gateway/slack/slack-subsystem.ts"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7fb67be528fa0cd92ed17b3a0aa88dc5a094e0de73fce49dcaafc7a66023401"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function claudeContinuationExecutable (cyclomatic 16, cognitive 14): claudeContinuationExecutable 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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":1653}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c0f2d6066f664db7e7342f29fd5acc9a978e02cde46b39647319be6beadc18"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function countEnvelopeOccurrences (cyclomatic 16, cognitive 14): countEnvelopeOccurrences 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"055231aa6e43b5ac6a531605c5d31d3a18bfa187e4d881162277cbb22cf0b3df"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function spawn (cyclomatic 16, cognitive 14): spawn 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/daemon/test/helpers/eval-rig-session.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"623b518bb4899909a18c3d5cef2ff8809c1ca42b8c1c77d32aa836453b7e2fb7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function LibraryRigReviewContent (cyclomatic 16, cognitive 14): LibraryRigReviewContent 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/ui/src/components/LibraryReview.tsx"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"0109f4d159c34dd4fc03049cebef0d8cb2d75704ca5941d3529499a4c167b4e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function BriefPanel (cyclomatic 16, cognitive 14): BriefPanel 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/ui/src/components/project/SteeringTab.tsx"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"94c7b353765a85c75de334447b49cdb01263ca48ea94744626adfba1dc1d6435"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function automaticRestoreOverrides (cyclomatic 16, cognitive 13): automaticRestoreOverrides has cyclomatic complexity 16 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/daemon/src/domain/existing-rig-restore.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"95648a8df44dca4e9bed7b5ae170967f9a225c0f2543d9f1b1b36b33c5604143"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseBindingSpec (cyclomatic 16, cognitive 13): parseBindingSpec has cyclomatic complexity 16 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/daemon/src/domain/gateway/human-registry.ts"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32dcb8cc6d9376273ef78770e9f4dc87641febb53f33bed9e778ee9d413408c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 13): (anonymous) has cyclomatic complexity 16 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/daemon/src/domain/queue-wake-ladder.ts"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"7020237d936d9b4f39ac82ff209118ef3b4de74bee734aa4a67dcfbd030c4536"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bootstrapFailureResponse (cyclomatic 16, cognitive 13): bootstrapFailureResponse has cyclomatic complexity 16 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/daemon/src/routes/bootstrap-failure-response.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"8edbc69d10322baf7c7f459cfdb60d2816f13cc6652e8bc020e9297b5ef10822"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function storedSourceOf (cyclomatic 16, cognitive 12): storedSourceOf 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/cli/src/commands/queue.ts"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd6c97bb3a5640240b55b81173f8b1c771f61f2046dab9d224a7afee44e4b07"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readQueueWhoami (cyclomatic 16, cognitive 12): readQueueWhoami 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/daemon/assets/plugins/openrig-core/hooks/scripts/refocus.cjs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf5c2a14906e83effacda18cf0588c96e73d6010032c2d1c6a1bf9a159645cc4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onopen (cyclomatic 16, cognitive 12): onopen 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/daemon/src/domain/gateway/slack/socket-inbound.ts"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"441f2712154c9e3d76a368e6c9524edf05752a0135704eee70fa730ea9f1f5bc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hookOrPaneActivity (cyclomatic 16, cognitive 12): hookOrPaneActivity 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/daemon/src/domain/node-inventory.ts"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"270ed116f531a341dcbf68c0570a4fce577e493270c8cc877b31890d987a5ef0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verify (cyclomatic 16, cognitive 12): verify 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/daemon/src/domain/seat-restart-in-place.ts"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b277ceef573505fa09ae2e0b642a02a0f5fabeb1d0388823699697e114bfe30"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isValidGitRef (cyclomatic 16, cognitive 11): isValidGitRef 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/daemon/src/domain/execution-view.ts"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb66177a9954eefbca7bf5059f635adc0ffb3ddf9f2c3d796fa26792d40f3936"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 11): (anonymous) 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/daemon/src/routes/seat.ts"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"8512295cb4987b5b7d66e7b76b91100e1cf496ed30038e2e94636811d7a6e812"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseMissionStatus (cyclomatic 16, cognitive 11): parseMissionStatus 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/ui/src/components/MissionStatusBadge.tsx"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"c719ec20a7f7f7c20c34aa90225a9b46087395b03de9252d70cd5ffb06189558"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeRuntimeBrandId (cyclomatic 16, cognitive 11): normalizeRuntimeBrandId 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/ui/src/lib/runtime-brand.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22310a9a8d306ab1b9d8504a62a78ee25947b32e26142c9f5130274e9b6b3ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function emitScopeAdvisories (cyclomatic 16, cognitive 10): emitScopeAdvisories has cyclomatic complexity 16 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/commands/queue.ts"},"region":{"startLine":1514}}}],"partialFingerprints":{"codehealthFindingId/v1":"987eb2588b31524e86710ea2a05c7629c7727f6103817bd02bb046deedc66827"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderEvent (cyclomatic 16, cognitive 9): renderEvent has cyclomatic complexity 16 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/commands/workflow-follow.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc55fd3558d0f5a57bf36468c911b0a5c54f9e941030772da2f4bb6677dc9387"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hasExpectedStagedText (cyclomatic 15, cognitive 34): hasExpectedStagedText has cyclomatic complexity 15 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca005c9b44ede9307b475fd40eaf82a49c2cd5581c22a0dce0c42e5a76e236ce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 32): (anonymous) has cyclomatic complexity 15 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":"packages/daemon/test/queue-repository.test.ts"},"region":{"startLine":1454}}}],"partialFingerprints":{"codehealthFindingId/v1":"378bac1c3246f80976c6624c29b755822640652f7f3c69e4e9ba9f7dc50b484a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deliverStartup (cyclomatic 15, cognitive 31): deliverStartup 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/daemon/src/adapters/pi-runtime-adapter.ts"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f6a3af82005cc2f67ca937f89948966f12901b71a8a50870c5b022df52e2ab4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 31): (anonymous) 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/daemon/test/builtin-team-providers.test.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff28cce91c1866f5378b2601b3363b1a1641e8ca1c50c07cc0489f77fc547ab8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectConflicts (cyclomatic 15, cognitive 28): detectConflicts 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/daemon/src/domain/conflict-detector.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dede6cbd08bd1003420464c67bf6728d295d51b3c671333d2e1ca7bb2baebd6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 27): (anonymous) has cyclomatic complexity 15 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/acp/agent-server.ts"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb13fee164de9fa4d6d6ca976a7059585a903ee225c94ef18c449ddb79c8af91"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function routeContextPacks (cyclomatic 15, cognitive 27): routeContextPacks has cyclomatic complexity 15 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/daemon/src/domain/bundle-context-packs-router.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ebfb3965f0101c5ba2d27e40d7d69a3a5c4f37f564bd9ba271f53a185ed023"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shellWords (cyclomatic 15, cognitive 27): shellWords has cyclomatic complexity 15 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/daemon/src/domain/seat-restart-in-place.ts"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1cd4d82825f026c7443b10c7db9b8ebab043ea64c6e793e18bbe756f88ef66"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function key (cyclomatic 15, cognitive 27): key has cyclomatic complexity 15 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/tui/src/local-reading.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"539efc17b551a2e23f77024765a422fc279e193fc068e5fb92743b73b4708e87"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deriveRelayEvents (cyclomatic 15, cognitive 26): deriveRelayEvents has cyclomatic complexity 15 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/daemon/src/domain/claude-activity-hooks.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"142db86826d982160ab9f60fc952f6a27f48c6ae38cbacd04cd2b0f511009b42"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 26): (anonymous) has cyclomatic complexity 15 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/daemon/test/bundle-v2-apply-target.test.ts"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d754692a2070a7a157d2f44176d419b65630515daa06ff1ede69feb5a7ae69"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function apply (cyclomatic 15, cognitive 25): apply 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/daemon/src/domain/install-engine.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea94de6037dfaf30cbe106d5aecff00e939787fb03acd88f713e8c62c954723e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 25): (anonymous) 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1f5ca1a80f24e69165a480cc977114fa8b758c98fd05634cae33987cd25ea1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateClaudeAdditions (cyclomatic 15, cognitive 24): validateClaudeAdditions has cyclomatic complexity 15 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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"d457c2ff09b158de5be40e4f5968524b7c9fcab1876cccf82575532e5d8e3771"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function emittedEffortFromArgv (cyclomatic 15, cognitive 24): emittedEffortFromArgv has cyclomatic complexity 15 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/daemon/src/domain/seat-effort.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"618f8b1e6eb035e0385d20990b2b12be90888969807ec06e4554858110377381"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 24): (anonymous) has cyclomatic complexity 15 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/daemon/test/prompt-answer-delivery.test.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"b368f335759dd9b75f7a98601c366a8f54b4e102e207e62d4d1c35f0a161fc22"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function commandReference (cyclomatic 15, cognitive 24): commandReference has cyclomatic complexity 15 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":"scripts/check-first-run-references.mjs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"b44aa92ad161df6d66c34e9a65746ac7a08f18f81dc321f02e07f13f8acdaf92"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 23): (anonymous) has cyclomatic complexity 15 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/commands/daemon.ts"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8469ff1a025ae2b5f619ac9104c36ef0c145a8fff937a3a55f9adc5b68cb79"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyIntegrity (cyclomatic 15, cognitive 23): verifyIntegrity has cyclomatic complexity 15 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/daemon/src/domain/bundle-integrity.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0e5934c21521a59b2b2febbb9d85040c48cff5be83330386dab4388910d0eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveCrashCartKey (cyclomatic 15, cognitive 23): resolveCrashCartKey has cyclomatic complexity 15 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/tui/src/crash-cart/keys.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d74570a62b3d5b3135ea472e71b9f4fa67740bd060a7230dc244eb5c84b440"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 22): (anonymous) 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/commands/archive.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"c57258d3a11f2c6d92165a465c1828e8cb58f02868b75bd0ce93abdc6bf7070f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exercise (cyclomatic 15, cognitive 22): exercise 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/daemon/test/hermetic-tmux.test.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc91af1cd5cc7ce6f00586c39e4b00a3cd795abe53a5162ab42191abb1725ad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function words (cyclomatic 15, cognitive 22): words 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/daemon/test/tmux-server-systemd-scope.test.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8cbfc5faa89a99b21ca2f66b2e2e1831df92a9817f9d9b8a6553fcf4ea7c55"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findSlice (cyclomatic 15, cognitive 21): findSlice 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/lib/scope/scope-fs.ts"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b5dd8be03b8153a0b753c4010a25f380a1b74bb69976231d15581dfca6b2e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkOtherHookChannels (cyclomatic 15, cognitive 21): checkOtherHookChannels 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/daemon/src/domain/restore-check-service.ts"},"region":{"startLine":1346}}}],"partialFingerprints":{"codehealthFindingId/v1":"0548aa710703c34a44447de06b92e2f00e8c7a3d8823e6daad31876277cf49f3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writeSeatSkillCatalog (cyclomatic 15, cognitive 21): writeSeatSkillCatalog 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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":1090}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f495010ea1de694387204734b198341f3155e20b638781805d5f8f15f8c1b9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyToSeat (cyclomatic 15, cognitive 20): applyToSeat 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/commands/policy.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"677728b08c33c52176ca7b3c78d3749455b699e6793e8929e9b7ca5a6089e1cd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 20): (anonymous) 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/commands/seat.ts"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff839d63dc1e9e8bab5f77b346798e62f2192af02cee326ed2bf857517dec407"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseLogicalCheckboxes (cyclomatic 15, cognitive 20): parseLogicalCheckboxes 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/lib/scope/logical-checkbox.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"8117e620b4bbed7479b02adf1333d79753ef5b0c458f4a9067cc3e7b0c6c83d8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 20): (anonymous) 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/daemon/src/domain/native-process-lineage.ts"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"58194e0eae9856f3be3783d96651d659691c090e618f77b50404e00217596092"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findUndelivered (cyclomatic 15, cognitive 20): findUndelivered 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":5503}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4bac0d42e45b02b7f11bc3eca616e67701af93a659ec402e9d702db7fd9a47"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepare (cyclomatic 15, cognitive 20): prepare 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/daemon/src/domain/runtime-switch-materials.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d630e58980ece8ce40bcaff9d82eedb8153ee6c6dc05e649d6fa6694af9465"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseLogicalCheckboxes (cyclomatic 15, cognitive 20): parseLogicalCheckboxes 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/daemon/src/domain/scope/logical-checkbox.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"718335bfc68b9530a8522a1d7e4b453e40418c76105fff7e47670bea453866e0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 20): (anonymous) 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/daemon/src/routes/snapshots.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"329cbdaa0be28c9f5c3d53d5227b88147a4ebd26cdd0aa411b84a969f100fb3f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tokenizeJson (cyclomatic 15, cognitive 20): tokenizeJson 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/ui/src/components/markdown/SyntaxHighlight.tsx"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"b035725cb1b640b008c354d1c4c79c0304e2d4ae27665d44abf76a8c5c82c31b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareWorkspaceBuild (cyclomatic 15, cognitive 20): prepareWorkspaceBuild 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":"scripts/prepare-workspace-build.mjs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4b773ca876c19fb74f7b59b02d3a75a67a31478950c7395313e7725baad7d5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bundleInstallError (cyclomatic 15, cognitive 19): bundleInstallError has cyclomatic complexity 15 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/commands/bundle.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d07406a512f4339de497affc0a8d6ac6ba62149a4d65aad73007e24b917ece"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function modelLines (cyclomatic 15, cognitive 19): modelLines has cyclomatic complexity 15 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/commands/ps.ts"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1c5d6b13130e731b87a5f2744a643a068c61b5a596edfe6e37b0eb09487d08"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function seatEnvKeys (cyclomatic 15, cognitive 19): seatEnvKeys has cyclomatic complexity 15 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/daemon/src/domain/claude-managed-launch.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"4033f35f5e65f14eaf9037887c3987265b75ea6c4c74050cec5d05236651fb18"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordedSuccessorNotice (cyclomatic 15, cognitive 19): recordedSuccessorNotice has cyclomatic complexity 15 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/daemon/src/domain/destination-successor.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"807caeaa4a3c254eb02ffed8d97be0ee4ac53f9721812875c433af07e24614a9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 19): (anonymous) has cyclomatic complexity 15 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/daemon/src/domain/gateway/slack/slack-subsystem.ts"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1344f73417550617d7079ccc06fa4b7ba41822542ae79872070a76aae0bf5d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function claudeHookFromLaunchedProcess (cyclomatic 15, cognitive 19): claudeHookFromLaunchedProcess has cyclomatic complexity 15 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/daemon/src/domain/native-process-lineage.ts"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c4e6e93e95c7b85cff39c4002e9fb3c02c0154cac46adddd4aa35d153bd890"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function serializeManifest (cyclomatic 15, cognitive 19): serializeManifest has cyclomatic complexity 15 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/daemon/src/domain/package-manifest.ts"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a258103769f3dd03a050aff6ccf75d1e85dced88a5c80187b24eff0a14cb4ad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildRecovery (cyclomatic 15, cognitive 19): buildRecovery has cyclomatic complexity 15 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/daemon/src/domain/restore-check-service.ts"},"region":{"startLine":1587}}}],"partialFingerprints":{"codehealthFindingId/v1":"2811ea5ef8ba6075b139b0504b0ec056c32010c493a75236d8f45f4481d15771"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readToolTurn (cyclomatic 15, cognitive 19): readToolTurn has cyclomatic complexity 15 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/daemon/src/domain/seat-restart-in-place.ts"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ba1464c3fce6744279df072874e9716797728b6baf09fbb7f45b34ec0582b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findAttributedViewerPanes (cyclomatic 15, cognitive 19): findAttributedViewerPanes has cyclomatic complexity 15 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/daemon/src/domain/terminal/herdr-viewer.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6db9f7d1b3dc826dda398ec5a76d580d8b74d8ae89a48edbd7d0c19638de3ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 19): (anonymous) has cyclomatic complexity 15 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/daemon/src/domain/workspace/frontmatter-validator.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac22f19caf2314a232cb74560590ae1f14a4e133e957fcb61208394996ab9c8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reflowTo (cyclomatic 15, cognitive 19): reflowTo has cyclomatic complexity 15 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/daemon/test/pi-runner-pane-compose.test.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"b68a80b2d8af71cde3ce732161a52a306ed90f1ee659dbd50050f0c27c67e452"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 19): (anonymous) has cyclomatic complexity 15 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/daemon/test/queue-park-wake.test.ts"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"af950940a52e2c2d0176b74a18e0fc6be905befaa6a2fa66987086dac2bce2b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restoreKeyAction (cyclomatic 15, cognitive 19): restoreKeyAction has cyclomatic complexity 15 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/tui/src/crash-cart/restore-input.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c5bbc41bb07098ac16bcbc069cd1ac0843489f9f298e3805ba9455b62fb9f97"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 18): (anonymous) has cyclomatic complexity 15 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/commands/parked.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d86e069d564877f3b4f5322763ee9c25e9c65bb08a1998ab26b1bdcb609396"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 18): (anonymous) has cyclomatic complexity 15 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/commands/queue.ts"},"region":{"startLine":1738}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a9b5c53ee6e1dc15a305bc3b581e0ed0ca091ec4bcc1071663b836fb704dfa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 18): (anonymous) has cyclomatic complexity 15 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/commands/rig.ts"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"14b1bd7f45e1b737da708f954f649ad546a7eeec736ca573fd6123278a35cd72"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizePluginsBlock (cyclomatic 15, cognitive 18): normalizePluginsBlock has cyclomatic complexity 15 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/daemon/src/domain/bundle-types.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"87cd63478fb1c30a6a369863d724faa36bf67434b32782e1dfd4aaa80910dc5e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function insideClaudeTrustDialog (cyclomatic 15, cognitive 18): insideClaudeTrustDialog has cyclomatic complexity 15 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/daemon/src/domain/native-resume-probe.ts"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"c348d5819024ee2333adff9282f3380baa2ab768e8859c8b9c61ab6c752d5486"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordCodexLimitBanner (cyclomatic 15, cognitive 18): recordCodexLimitBanner has cyclomatic complexity 15 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/daemon/src/domain/provider/codex-limit-banner.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b1e299879fa62e37e1cdffbcbbcc34d6ee761bd961f6e6f88ff1b0e918af82"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function expand (cyclomatic 15, cognitive 18): expand has cyclomatic complexity 15 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/daemon/src/domain/rig-expansion-service.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"313af42ce3164fef6b7e6f29bb4c9982cda6888e04b90821af80cb7c44a3b874"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 18): (anonymous) has cyclomatic complexity 15 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":3241}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ca38a40ee25aef05d33d7cee1c8cf78b4f0f9acf1bee6ed82022ec22864320"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleStreamItem (cyclomatic 15, cognitive 18): handleStreamItem has cyclomatic complexity 15 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/daemon/src/domain/stream-intake.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9821754f80464adcf3f1e4cbbfb77df2413dffbac7bad33bbfd84f9616f2f03"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function receive (cyclomatic 15, cognitive 17): receive 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/acp/json-rpc-stdio.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff884196a8db696fe78ab0ee3617d4352bfbf497a78bdd907e3b247b7ffe696a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 17): (anonymous) 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/commands/scope.ts"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d560ab3ff14e09ed4dbc6377c28d6f53ba7db1e6c137560393125487b9ea55"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 17): (anonymous) 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/test/terminal-window.test.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d0fe772425ac589185ad98f2d88f7cd524e099f6351959f60b72e44e64621c7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeAgentSpec (cyclomatic 15, cognitive 17): normalizeAgentSpec 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/daemon/src/domain/agent-manifest.ts"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"d13b3777612945304e577bce86f55fb2cf1f87e12903542ccfc31f4843b3bc1e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function composeRigStatus (cyclomatic 15, cognitive 17): composeRigStatus 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/daemon/src/domain/rig-status-compose.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48992cbb902aa72a1d19d6f440715dc585e64109296bb7aa2eb41d9ab38226d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function confirmPacketSubmission (cyclomatic 15, cognitive 17): confirmPacketSubmission 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/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":1719}}}],"partialFingerprints":{"codehealthFindingId/v1":"08fd0bb0d50020d753cc7e12a21063846db59c39d0e9537fe6be907a80bdd760"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 17): (anonymous) 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/daemon/src/domain/workflow-exception-escalation.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d009cb3eca8f9d92c3c80633c8e304e63bfcb477f07a482c7d4bec4dd7a7dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 17): (anonymous) 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/daemon/src/routes/bootstrap.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a19c919a1a88ddd4af34b73e30e454e734843f47adfa1148fcc2da376354a2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stateWord (cyclomatic 15, cognitive 17): stateWord 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/tui/src/execution/execution-model.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf144bc8e215c609b8304f456488ddca438bf79f0b82a2e5167bf0b6afa33cd0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 16): (anonymous) has cyclomatic complexity 15 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/acp/connector.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"12673b637b837083037d9529a0bdee7166ddd98c6156081a880c62efa8045c4c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startMcpHttpServer (cyclomatic 15, cognitive 16): startMcpHttpServer has cyclomatic complexity 15 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/mcp-http.ts"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a37ba9a12936d7da9ef02d099a1702239d3131f612538a43154acfe7000b62"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateLifecycle (cyclomatic 15, cognitive 16): validateLifecycle has cyclomatic complexity 15 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/daemon/src/domain/agent-manifest.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1e12ec490154a02322ea3a9e46ca7b5701cb98af4baba23c2924ce3fe295a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function claudeCurrentRows (cyclomatic 15, cognitive 16): claudeCurrentRows has cyclomatic complexity 15 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/daemon/src/domain/native-resume-probe.ts"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd52102d9d3a47ce616ae3d3c3cde558000e622c6ba5a6f8850d34a20e795174"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deriveExceptions (cyclomatic 15, cognitive 16): deriveExceptions has cyclomatic complexity 15 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/daemon/src/domain/review/compose.ts"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"b65b601b5b40e6f2c038c697e4ac07577333cce502cebf9400884dfb4adead87"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function codexChain (cyclomatic 15, cognitive 16): codexChain has cyclomatic complexity 15 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/daemon/src/domain/seat-restart-in-place.ts"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"44846de300d1f76659ebf1f8511e574a9c86c03fcddb32551fdc9ff090abd704"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function replaceGitIgnoreBlock (cyclomatic 15, cognitive 16): replaceGitIgnoreBlock has cyclomatic complexity 15 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/daemon/src/domain/skill-catalog.ts"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ffb9408148171ecaa6db75fc143e84a55b08f4ca560cd39da0c04871521efdd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 16): (anonymous) has cyclomatic complexity 15 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/tui/src/detail.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9228832cc204d402b8ae020aa06f5986e197fa76fe6c9b0743b3d1dc3a0bed2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 15, cognitive 15): run has cyclomatic complexity 15 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/commands/edge.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c9a0cdd5358e829b24657b3ad8e6d653d206ad4a5a0facead9ab6a46d1e53a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 15): (anonymous) has cyclomatic complexity 15 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/commands/provider.ts"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d102a9f78af8a1615fbdb5a7d8b1f2f08fe886010494620a0c3cda439317b9e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validatePsLadder (cyclomatic 15, cognitive 15): validatePsLadder has cyclomatic complexity 15 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/commands/ps.ts"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dfeb675f9a6fe9ddb0cd70b81d60b56bd9ba4db61390314827809db77f21697"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 15): (anonymous) has cyclomatic complexity 15 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/mcp-server.ts"},"region":{"startLine":2403}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6b9bd461e65873accdbd0496667818e460ec0f1530425356bd1081c146801f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkReady (cyclomatic 15, cognitive 15): checkReady has cyclomatic complexity 15 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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"145fe39828cac30079fa74c065a10f5d309b60afb17db23a1cc6548d206d03f3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function authSeatSet (cyclomatic 15, cognitive 15): authSeatSet has cyclomatic complexity 15 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/daemon/src/domain/codex-auth.ts"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d9afaab8608fddf49ae47ef7eaf0566443002882af14dacc25eaf6a8d78a9e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyManagedKernel (cyclomatic 15, cognitive 15): classifyManagedKernel has cyclomatic complexity 15 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/daemon/src/domain/kernel-boot.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd646f55c00c9654bfe4b46e0e1c03a4e14134be1d355429896874182e52a97"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readSliceReadiness (cyclomatic 15, cognitive 15): readSliceReadiness has cyclomatic complexity 15 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/daemon/src/domain/proof/judgments.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced667d6a86eb551ba9056421b0f2f642465cfcf93c6c711089593613f8a390b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readAtReadableSize (cyclomatic 15, cognitive 15): readAtReadableSize has cyclomatic complexity 15 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":4913}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1b4a6ce264faf02ba17cfabc1a3cc27183068c6464da85e9c170616a90b1e6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 15): (anonymous) has cyclomatic complexity 15 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/daemon/src/routes/activity.ts"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e3bc679be69ef4e8408b3a660f7515c95697a66294be70f696834a6fa04ba3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeSurfaceRow (cyclomatic 15, cognitive 14): normalizeSurfaceRow 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/daemon/src/adapters/cmux-transport.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d539d960b3453251449a4ea6144d0ffda978234c9fee7feff141b578a30f00"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 15, cognitive 14): constructor 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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd14a9d6d17579c8f3079581ade7a9a8cf93779c55dbf1b855710f891b10f4c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function healthAuthority (cyclomatic 15, cognitive 14): healthAuthority 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/daemon/src/domain/health-context.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"3757fac02883202d8e0ce381376304fc5203076af6a62a71c021971efa3ca919"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 14): (anonymous) 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/daemon/src/domain/lifecycle-manifest.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e0734c60a77e845a6e30a25dbbf184f75a320339432743894f198612951062"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function target (cyclomatic 15, cognitive 14): target 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/daemon/src/domain/rig-mode/operating-posture.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d62045d4a316488aa9e8dafbfe5a7eb29c9188a21f0fea359043574859a617c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectProvider (cyclomatic 15, cognitive 14): selectProvider 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/daemon/src/domain/terminal/terminal-service.ts"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"850a1eb1b912d584c321efe0d0609b6dc20d01714cccee710412ef389fd449c7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 14): (anonymous) 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/daemon/src/routes/activity.ts"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d92aeb7575d1ca543251c2201c0487524af626f1ed08a409e51a7653b7132e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 14): (anonymous) 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/daemon/src/routes/gateway.ts"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e8389eb7876b46a0bc65a2e499311db8cf643010431c04c2e8b4e762d4b3533"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 14): (anonymous) 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/daemon/src/routes/rigs.ts"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"f751f080e5ba10a6b3d372d4cfc436189ade35a028871fd3235f3fc4db638f54"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writeRigFixture (cyclomatic 15, cognitive 14): writeRigFixture 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/daemon/test/public-world-pack.test.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b96be72c4f2a35ac21172c80db060d2c64a027cd82260b2cc36f030c1ca778"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function row (cyclomatic 15, cognitive 14): row 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/daemon/test/queue-stuck-sweep-elapsed-yield.test.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c80dc59d928728425a627f4057b62260c7bc0e4d2effa5173fd08aa871637a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runHook (cyclomatic 15, cognitive 14): runHook 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/daemon/test/refocus-context-ref.test.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf6b7ddbc2df88e1b79a1e7967b15fa3072664b0510cb7fa76d3607cb0c12a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 14): (anonymous) 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/daemon/test/tmux-server-isolation-daemon.test.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"a684b40c62bfe86da9982dc2f5e887c430e420a3012832a164bda2ee63558ff1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function operationalState (cyclomatic 15, cognitive 14): operationalState 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/tui/src/render.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"114dca05c7b8ce5e035ac489bdc1891702cd96c5e4f6af3696a6c67ce4ebfab6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SettingsSystemStatusPanel (cyclomatic 15, cognitive 14): SettingsSystemStatusPanel 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/ui/src/components/system/SettingsSystemStatusPanel.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"650921759ba35749f8dc95daf5f794f13767fba1d06648ec74fd081690e21531"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visit (cyclomatic 15, cognitive 14): visit 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":"scripts/rewrite-daemon-imports.mjs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd626c14668f4f0b973db1d69ee83614e5c7d4024d93338250794a98a42ad298"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function printCurrentWorkChoice (cyclomatic 15, cognitive 13): printCurrentWorkChoice 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/commands/queue.ts"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f61cd7ed2d1ea4d12d1999cea73a81dc12c232762b6fa46bdfc842105350563"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function withOriginPeersCommand (cyclomatic 15, cognitive 13): withOriginPeersCommand 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/commands/whoami.ts"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"662e92244e4ef3e0f97bbc7fa1d7953467e530203d111a97987c57dcd13b6a06"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evaluateContext (cyclomatic 15, cognitive 13): evaluateContext 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/daemon/src/domain/health-detectors.ts"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"b593c291fc0431f75f6c0672f3874877731550c47392c795650807aa8904ef35"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 13): (anonymous) 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/daemon/src/domain/hosts/read-through.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9a1e3f46ce9a1c50e7de3ea32dc598436d66b2e312b1a5d1b1ce8792ed5b1f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 13): (anonymous) 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/daemon/src/domain/node-inventory.ts"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"86fc25b278f73c033e0a3a9ba5a7035c5e750f138666b5cfcaafcabface1eaa4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 13): (anonymous) 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/daemon/src/domain/seat-delivery-guard.ts"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"b784b9c3f32a0a4bcd4eefe343880548160e527cf14baff74baabbe8e0ebd409"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findContextUsageForSession (cyclomatic 15, cognitive 13): findContextUsageForSession 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/daemon/src/domain/watchdog-jobs-repository.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9bd1ee704e8e91ce3651dcd21691c48563ce81e7dad89db81185fe0c44323a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 13): (anonymous) 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/daemon/src/domain/workflow-reconciliation.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"e302c495e474263d77524862627aaaf7c127b93b3457b7e84ebe41d3d814e65b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectedRefs (cyclomatic 15, cognitive 13): selectedRefs 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/daemon/src/routes/startup.ts"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d02b2b1a6b05b8c69d7e97b30b0bcece2dc48443149726359966ad8d71466c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function abandonedRecoveryReservation (cyclomatic 15, cognitive 13): abandonedRecoveryReservation 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/tui/src/socket-server.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"3653506f94f74c2fb042549edaa73aaea39a015077f9b6a23d90cbfd768c9bfb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SystemPanel (cyclomatic 15, cognitive 13): SystemPanel 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/ui/src/components/SystemPanel.tsx"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ebd51ab5943cf5e19d3331c148e7d39e95056a9d8cff4fba4019ad6c0845221"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function FileViewerBody (cyclomatic 15, cognitive 13): FileViewerBody 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/ui/src/components/drawer-viewers/FileViewer.tsx"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b5093276353c3209f39f6e9fac4b6580d6bf6b6638624b6d2aad077f9445f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function BoardRowExpansion (cyclomatic 15, cognitive 13): BoardRowExpansion 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/ui/src/components/review/MissionReviewTab.tsx"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4816063cacde70e6a135961ba3ed614839353c713f84bf950ea73b27e4194d6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildWritePacketOptions (cyclomatic 15, cognitive 12): buildWritePacketOptions 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/commands/restore-packet.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"52946943ddd95bfb5c20a82f97fc8a20017fafc276d63ee62810b8aa8c794229"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function currentClaudeThemeMenu (cyclomatic 15, cognitive 12): currentClaudeThemeMenu 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/daemon/src/domain/claude-theme-menu.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4c41acfb09d6ab6f59c77daf20a1382a11f877df4a7419d0c8b579efc919f1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function maybeAutoCompact (cyclomatic 15, cognitive 12): maybeAutoCompact 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/daemon/src/domain/context-monitor.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"5382714e5aa279552788e4355cd6d48abac132a9bf17b138d4a55a0b7a5dba15"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toCreateScopeAdvisory (cyclomatic 15, cognitive 12): toCreateScopeAdvisory 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/daemon/src/domain/current-work.ts"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"292d2ca544f314c6ce2e43729eb362658c06f946ff8f34cd86570e967f1a372c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lookup (cyclomatic 15, cognitive 12): lookup 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/daemon/src/domain/draft-aware-delivery.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d294f5fbfbd4f27eaa7bb917be43f01415e9bfc551cc9203bacafe2afa61939"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 12): (anonymous) 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/daemon/src/domain/queue-stuck-sweep.ts"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"91674d97838a96ce0fe0d3d13e3c9d8786d923c681a09656fa517ab28b567e0b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 12): (anonymous) 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/daemon/src/domain/queue-stuck-sweep.ts"},"region":{"startLine":1188}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d709e270972c4d893c0fb17f9a56ca97e1a9d87d0f689ad383772e65d5bf3b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyPaneRuntimeMatch (cyclomatic 15, cognitive 12): classifyPaneRuntimeMatch 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/daemon/src/domain/seat-identity-reconciler.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ba2bcbb7f6265379304650b9b17662963896046e97e92dc60fa9a084fc4cc3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function observe (cyclomatic 15, cognitive 12): observe 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/daemon/src/domain/working-liveness.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"b089ef1029f0734f37c736f51dadf7e1fddc532e85f67be3b793725b0d9d90a2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function StatusSection (cyclomatic 15, cognitive 12): StatusSection 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/ui/src/components/LiveNodeDetails.tsx"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd78e89cad45124f95fb95946c33a4b148729306779dbe1ab63c3a42d99b0a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function MissionGlance (cyclomatic 15, cognitive 12): MissionGlance 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/ui/src/components/project/WorkspacePortfolioPanel.tsx"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"13869f7806caa7bbb3bee4ec77c1682a705388b90b867e0b6add07968ce12d58"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 11): (anonymous) 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/daemon/src/routes/terminal.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c677fc386c3f21247c9fbad1338b13fcafd045b7033831aae8780764484549"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reconstructPayloadFromReceipt (cyclomatic 15, cognitive 10): reconstructPayloadFromReceipt has cyclomatic complexity 15 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/daemon/src/domain/gateway/relay-inbound.ts"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9828d553a9ca5cb42f7e9b89a275c6cbe89124782b2731680e776db7c7807c6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 10): (anonymous) has cyclomatic complexity 15 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/daemon/src/routes/seat.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"2438bcccaf527ec0efb09c24912074b48b07b6a58d02685919a9210ae9c992e6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function servedByOwnRepeatingReminder (cyclomatic 15, cognitive 9): servedByOwnRepeatingReminder 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":"packages/daemon/src/domain/queue-wake-repository.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c0e54cee8c259909f879f34d9ca5d5e7db820f68e1c4b1d2c7d4d1a7b11983c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 38): (anonymous) has cyclomatic complexity 14 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/daemon/test/transcript-batched-capture.test.ts"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"517026b15b107701fe59549c6a5d1e070faea38cf52256e83d8b93ff4a2e31ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cleanup (cyclomatic 14, cognitive 35): cleanup has cyclomatic complexity 14 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/daemon/test/helpers/hermetic-env.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb15db08775a70abe93681bc5ded4ea072f8acb3962c469f25895a1fa16c15d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadStarterWorkflowSpecs (cyclomatic 14, cognitive 33): loadStarterWorkflowSpecs has cyclomatic complexity 14 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/daemon/src/domain/workflow/starter-spec-loader.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"a33ce913045c9e4f73a76209596df7d64911d1658186ba4773eeb881edf5febc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveWorkNodeDirs (cyclomatic 14, cognitive 30): resolveWorkNodeDirs has cyclomatic complexity 14 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/daemon/src/domain/current-work.ts"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"269d34b2f5a2431269dc89036ccd99e1c5cfe88fb75602cb10e734f3c621b23a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function groupUsageAcrossHosts (cyclomatic 14, cognitive 30): groupUsageAcrossHosts has cyclomatic complexity 14 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/daemon/src/domain/provider/usage-across-hosts.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f9ee83876ea922c33b96cb24d4cca1cfb74a023fca92a48da7037b28912534"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function policyOf (cyclomatic 14, cognitive 28): policyOf has cyclomatic complexity 14 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/daemon/src/domain/proof/judgments.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"12eccb6872fd532e02679f3fb40322e03e0a33d020f2ec0d0cc3d83136e17ab8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function unionFleet (cyclomatic 14, cognitive 28): unionFleet has cyclomatic complexity 14 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/daemon/src/domain/review/fleet-compose.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b426289192e8b747f93ccbeff438df928afe0b530014249e7f9f9f82e9a1e78"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deliverStartup (cyclomatic 14, cognitive 27): deliverStartup 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":"packages/daemon/src/adapters/stub-runtime-adapter.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a87b38ea11d9d15e50d4c947e774e198ce48647e0765c498c8e25b616d869e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 26): (anonymous) 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/cli/src/lib/reconstruction-reader.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"d83afea5d84f86f2196981c107d7ad1f755fcff6e6c5651086804f1b2f253924"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deriveMissionDependencyGraph (cyclomatic 14, cognitive 26): deriveMissionDependencyGraph 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/cli/src/lib/scope/scope-audit.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62c8ec76e4b63ccb19614af3092d7a81f95b36f4270f23a8e6f39c61233eb5d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deriveMissionDependencyGraph (cyclomatic 14, cognitive 26): deriveMissionDependencyGraph 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/daemon/src/domain/scope/scope-audit.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a5fbcdd36370a5d2c0d6527fe216ed3a8b974ef331879f2174835e31b9c0a00"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveWithImports (cyclomatic 14, cognitive 25): resolveWithImports 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/daemon/src/domain/agent-resolver.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cacf864648fc4f9d9c99f126fb8640c83eaf39924b66918817fc0ba342a430b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCreateScopeTags (cyclomatic 14, cognitive 25): parseCreateScopeTags 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/daemon/src/domain/current-work.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03b6554396cd1ac56730f5a3ed6658ed35a059a1b82ff2774f1b5e9eac77326"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderBraille (cyclomatic 14, cognitive 25): renderBraille 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/tui/src/topology/styles/braille.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad1b2247c74fb6c636251bed08fae31cf37cd0e569e3505065d34c6bcb97b91"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sanitizeFrontmatterEntries (cyclomatic 14, cognitive 24): sanitizeFrontmatterEntries 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":"scripts/mirror-skills.mjs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8a96d0e578c1e708fd3496400cc82544f042edc4d4e09d5687c68318869e93"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyResume (cyclomatic 14, cognitive 23): verifyResume 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":"packages/daemon/src/adapters/pi-resume.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec705859b6efa782520e395094844aa1ab6444acf0fb61bb270a4ba415730d02"}},{"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":"packages/daemon/src/domain/gateway/operator-delivery-engine.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"c963579fb5ccd5a3f0abb7b7885483834b1d468fd1074696b0c47b420eecf2be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseMarkdownSections (cyclomatic 14, cognitive 23): parseMarkdownSections 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":"packages/daemon/src/domain/markdown-address.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a6194db8eeaf55117db83f946a282cc4293e0a20fb9fdf1fdceaed46d721d7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function withoutTomlPath (cyclomatic 14, cognitive 22): withoutTomlPath 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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":3016}}}],"partialFingerprints":{"codehealthFindingId/v1":"712526181b89a129c62c6fc3b3aee0e1f0532944d55c2d062065baf67858495d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function codexConversationToken (cyclomatic 14, cognitive 22): codexConversationToken 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/daemon/src/domain/native-process-lineage.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ef5160976327b075b9eb8d260e0a4a281bb22fab9dccb393564b3b4450a37d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function directClaudeChildren (cyclomatic 14, cognitive 22): directClaudeChildren 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/daemon/src/domain/native-process-lineage.ts"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c20dd3dee5874712d57ceec062cafc470fcbf660c80043f2a1f450dfce557b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 22): (anonymous) 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/daemon/src/routes/rig-mode.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"239a4861e47967501fed24bc7afc81fbe82d9e08feae6e49cc7cc1642e742086"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 21): (anonymous) 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/commands/rig.ts"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f00bd4c78c4079d5f27902b2229d3124ea0ccbf5cec0a30ae4a5714a8919bbd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function upsertManagedCodexConfigFragment (cyclomatic 14, cognitive 21): upsertManagedCodexConfigFragment 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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":2906}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c2fd48c0aa421c5852a7a6fa1469cda9ff8f7251476bb8f65c97eaa68f0547"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanCatalog (cyclomatic 14, cognitive 21): scanCatalog 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/daemon/src/domain/skill-catalog.ts"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"625b7edcf2d94257d7d94554004e8b31e186414c7310cd0a33ea55ec1a31da5f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function driveRestoreLifecycle (cyclomatic 14, cognitive 21): driveRestoreLifecycle 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/tui/src/crash-cart/restore-lifecycle.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1bcadadd6aa84b0ee1ad3a30d94f16ae65690f12e190f1165cc54a40d4b82a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executionContentLines (cyclomatic 14, cognitive 21): executionContentLines 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/tui/src/execution/execution-model.ts"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7aa33464c3099953fc56957db0ae4c4e36725e586ab5dddb4ee0b372f6b7ba4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectGitHubBundleSource (cyclomatic 14, cognitive 20): selectGitHubBundleSource 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/lib/bundle-source.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"9561351e1a6f0c7dce424c0ae9b0606348cf26e0eae9539c5fed9f8eb8d677de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeCapabilities (cyclomatic 14, cognitive 20): normalizeCapabilities 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/daemon/src/adapters/cmux.ts"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"041652f098856055f203eb88c1b4972a3a9cdfd5301e6aa0234d94989d662206"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assemble (cyclomatic 14, cognitive 20): assemble 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/daemon/src/domain/bundle-assembler.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb28f4e3237a84dcce526478a7282da3a2f95648e324881b11fad6124892f3e6"}},{"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/daemon/src/domain/gateway/slack/slack-recovery.ts"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"460b64a911d3c1e9263151587e445fc7d5ef5a8a74506438185a0ead1638307f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectRestoreUsable (cyclomatic 14, cognitive 20): selectRestoreUsable 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/daemon/src/domain/snapshot-repository.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"941d7c7d150be7be8e9a4f5ac2c0a8c2c700b4e321dd19ea9438be351b66ef77"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveNodeWorkspace (cyclomatic 14, cognitive 20): resolveNodeWorkspace 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/daemon/src/domain/workspace/workspace-resolver.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31b333036c0dd877d199b3ff6627e3b31734ae69fee8aea8922297992a15919"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function listDestinations (cyclomatic 14, cognitive 20): listDestinations 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/daemon/src/routes/mission-control.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"81090eaedb58a854fada7b602b89498f7571b18519ea202e40827967fd4e0a8c"}},{"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/daemon/test/structural-skip-native.test.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"97059307e0cec7c3af5a25884cca6693f957b59c71a56b81d9651a7808561a2d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rankNodes (cyclomatic 14, cognitive 20): rankNodes 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/tui/src/topology/layout.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aff0a1095f8b60eca16f9fa177c0fa45287a2740b0711c7b3f6acaa6943eafc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 19): (anonymous) has cyclomatic complexity 14 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/commands/doctor.ts"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"950e58110cbc1a5bb78d7cc4cd7433112a43f489b30341c3ebbd3dcc0bf46eb6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function withClient (cyclomatic 14, cognitive 19): withClient has cyclomatic complexity 14 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/commands/queue.ts"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e18cca5e619a96773522ab6ce783b09fd2896e69457970313bd584b761866f8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function printCompact (cyclomatic 14, cognitive 19): printCompact has cyclomatic complexity 14 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/commands/restore-check.ts"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74e06702d42b70677c02b0effea08605b93f12c08b9deeb830a4a1a3d410165"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findSiblingHome (cyclomatic 14, cognitive 19): findSiblingHome has cyclomatic complexity 14 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/daemon-lifecycle.ts"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec9d53b15d11f23f162379f7aed1f66729856ec3ee0f356e6e211adc0f45e5f8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 19): (anonymous) has cyclomatic complexity 14 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/test/bootstrap.test.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"436ba972b77990bd62c533a3f2b9434714f066402e1b196a671213375c4f9fd9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function launchHarness (cyclomatic 14, cognitive 19): launchHarness has cyclomatic complexity 14 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/daemon/src/adapters/stub-runtime-adapter.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc38b319fb4f18c6e75082fb7b345ba849972e0bcab33084c5833e79b93942a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkReady (cyclomatic 14, cognitive 19): checkReady has cyclomatic complexity 14 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/daemon/src/adapters/stub-runtime-adapter.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75dd3cd1d3869e2e79d5f9281a57ca09fe74d328f757e30f9dbdd4ba83c2043"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function composeProfile (cyclomatic 14, cognitive 19): composeProfile has cyclomatic complexity 14 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/daemon/src/domain/context-packs/profile-composer.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed65c55c10597622ff470a4b139164cf0fa44cb5d6db3a659d2f3f894911a4f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function read (cyclomatic 14, cognitive 19): read has cyclomatic complexity 14 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/daemon/src/domain/health-detectors.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a6a2d8884a54e93d9b586e963dfa5e9e3d6cd04c83bbb77370bf6ac003de05"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshQueueWaits (cyclomatic 14, cognitive 19): refreshQueueWaits has cyclomatic complexity 14 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/daemon/src/domain/queue-wait-backoff.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f926dfc665da011d12e3c5ed63710becf77fdbf9946f6593897363420bcfbe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 19): (anonymous) has cyclomatic complexity 14 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/daemon/test/transcript-batched-capture.test.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ae85748b62d95ef22ebd6c7f65fc5bee00354ffce771037b51876748ad85e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shellWords (cyclomatic 14, cognitive 19): shellWords has cyclomatic complexity 14 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/tui/src/execution/workflow-model.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f899b8907f76fca63aa7e3d661ab76c493c342088f4c37a4d070081d57407c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 18): (anonymous) has cyclomatic complexity 14 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/commands/provider.ts"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ad1f11d7cb95788c17e6d6e48abfcf5f015bc76ce59f11c0b33bc068301557"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function queueReadTarget (cyclomatic 14, cognitive 18): queueReadTarget has cyclomatic complexity 14 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/commands/queue.ts"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e9461ed2ee78df1e573deca0254b2d236f27e8365de2d852a34953e9847242"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lastStopState (cyclomatic 14, cognitive 18): lastStopState has cyclomatic complexity 14 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/commands/start.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"643066966a294791b05462a08fda62a8845d05729204752c2b448bd3b804018f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 18): (anonymous) has cyclomatic complexity 14 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/mcp-server.ts"},"region":{"startLine":1533}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2e008fa9846380f4ed741d18bb97a9980116156eba14073299d04cc908a512e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handlePiLine (cyclomatic 14, cognitive 18): handlePiLine has cyclomatic complexity 14 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"71803c0ad3d31a61516f7af7383a324be20523ee08dec25c20f2826b14868a49"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readAllPaneProcesses (cyclomatic 14, cognitive 18): readAllPaneProcesses has cyclomatic complexity 14 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/daemon/src/adapters/tmux.ts"},"region":{"startLine":2986}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb954824817e8733aec7f48cee30f2c079fdcbd611376389efc4548abd4c9f90"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function seatTokenLaunch (cyclomatic 14, cognitive 18): seatTokenLaunch has cyclomatic complexity 14 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/daemon/src/domain/claude-managed-launch.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe8f12ce6d8a974240696abb30c8e85c89eac9ffe0d8173fb6cc28a089a0fd88"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateMarkdownAddressability (cyclomatic 14, cognitive 18): validateMarkdownAddressability has cyclomatic complexity 14 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/daemon/src/domain/markdown-address.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11286248f6b217423ddfcb8471823d7d296c3f8b62a372b922b19625f4410ce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tokens (cyclomatic 14, cognitive 18): tokens has cyclomatic complexity 14 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/daemon/src/domain/native-process-lineage.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff5824e274f1a7523f1894354f1b53b043c644dcf3687983ce34861de2e05ad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectUsageHosts (cyclomatic 14, cognitive 18): selectUsageHosts has cyclomatic complexity 14 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/daemon/src/domain/provider/usage-across-hosts.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d94cfd202b90d219ace20b61fb1ff01fefa3c1ac0d645d184929c67c9f5f7aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resumingConversationSeats (cyclomatic 14, cognitive 18): resumingConversationSeats has cyclomatic complexity 14 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/daemon/src/domain/restore-preconditions.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef10f2a8bd8f6bea425aa8a41715186f94950eca71d298338ddfd5d32dc91e99"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rigRoster (cyclomatic 14, cognitive 18): rigRoster has cyclomatic complexity 14 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/daemon/src/domain/review/gather.ts"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"43be0fd416a16f9d985e12c3ee4c88873a282eb80062e89fa4b3449245d2c55b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isStoredContinuityPolicy (cyclomatic 14, cognitive 18): isStoredContinuityPolicy has cyclomatic complexity 14 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/daemon/src/domain/rig-repository.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"748217f375227d4d768f01d6a8ff920ca605b78342bacb6b6f60314abb832736"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 18): (anonymous) has cyclomatic complexity 14 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/daemon/test/prompt-clear-continuation.test.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"639b599ccae5fecea9a6524f506c2caab1db1888041deacae2338ca451f30707"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 18): (anonymous) has cyclomatic complexity 14 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/tui/src/startup.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"67cff88fecf9ff469382c12f6a3ed55d50120a32d8e77d1d960b14a4a4569a88"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function terminalExplorerRows (cyclomatic 14, cognitive 18): terminalExplorerRows has cyclomatic complexity 14 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/tui/src/terminals/terminal-model.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"486cb35b1798fdfa870f5b66743f61dedc4e6344af6aa8ef86674c8bff00d88c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeHumanQuestions (cyclomatic 14, cognitive 18): normalizeHumanQuestions has cyclomatic complexity 14 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/ui/src/components/for-you/FeedCardQuestionAsk.tsx"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1166f0f29ce51b7d9422fad545d959db7504a6745a0f08478fe7cb762b0e2c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanInternalLeaks (cyclomatic 14, cognitive 18): scanInternalLeaks has cyclomatic complexity 14 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":"scripts/internal-leak-scanner.mjs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9dff655d5999be6f0b6a5c87164919231cfcf02d2a24b6970c53cbb52cd2aa0"}},{"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/commands/gateway.ts"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c380b3e7d16c43c751fa6e5498d88e338d1c500c55ff59628d02444ffc6f9c9"}},{"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/commands/specs.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c4dd789d034bcbaee38521f63d3e6d9c2cb0890a70a42f53589d75a3f301914"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveEndpoint (cyclomatic 14, cognitive 17): resolveEndpoint 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/daemon/assets/plugins/openrig-core/hooks/scripts/activity-relay.cjs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89dff4039aa6fd0d38d22d7bd83494491c657c31b7b3b14bd34fee151a88058"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verify (cyclomatic 14, cognitive 17): verify 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/daemon/specs/agents/shared/skills/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"875aa01af6af33c4adbe98b1e08284d03469f21528394407d8892506e2a8615e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scopeStartOutcome (cyclomatic 14, cognitive 17): scopeStartOutcome 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/daemon/src/adapters/tmux.ts"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf055aede28f0626bc95d1132c0238dac55819e318353cc9185402f8165bacee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pluginEntries (cyclomatic 14, cognitive 17): pluginEntries 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/daemon/src/domain/bundle-content-routing.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"0caa63bcef77075af7197c4371e0d3cdd4c1be16c08bd7dda98c34dc8ea5b816"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readFileSync (cyclomatic 14, cognitive 17): readFileSync 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/daemon/src/domain/gateway/relay-inbound.ts"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"344716686be980c38877df81bade2bc9be62f485f5c2063138ef5bce3a90dfa1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writeSeatSkillRouter (cyclomatic 14, cognitive 17): writeSeatSkillRouter 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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"303e3590976bafd17445b6b5db98cd8d9512654aef14405bed4ad8e3bfdc1026"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reveal (cyclomatic 14, cognitive 17): reveal 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/daemon/src/domain/terminal/herdr-app-provider.ts"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9195b914db5f57227b432dacc31524d2e48d20e8af4a9356c4750a2767a514c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openPending (cyclomatic 14, cognitive 17): openPending 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/daemon/src/domain/terminal/herdr-app-provider.ts"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1de85b55d59b208768264c9f5496cb3b26482bcc1318a51cb3954af2f382377"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchImpl (cyclomatic 14, cognitive 17): fetchImpl 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/daemon/test/slack-images.test.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"2629d3493d047550f813b9a74e3c60a1e830ae99b65030044842b68a1a570108"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function perform (cyclomatic 14, cognitive 17): perform 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/tui/src/main.ts"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e7a74294aeda1a01c4aa740b560733165f22936d0437ecb111a42109e68ea9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fileLines (cyclomatic 14, cognitive 17): fileLines 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/tui/src/reading.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"3856e0a4845eb8e19c468d7583775067a2214dc5118563fd0738ca193796aba6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function queueFacts (cyclomatic 14, cognitive 17): queueFacts 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/tui/src/render.ts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9095a8da4bc90b46c4eb76147d5ce69a846cbcd43db64790e22f454ab5b3ec7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchFleet (cyclomatic 14, cognitive 17): fetchFleet 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/ui/src/hooks/useContextFleet.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"da852ccef8d7d05f5c7c7b806312ccb014284707a14fd883c1fa7c2c073cb16e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchNodePreview (cyclomatic 14, cognitive 17): fetchNodePreview 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/ui/src/hooks/useNodePreview.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a1dd12d13f9ec814184704c73fa4ec860717fdda56168818878038c1fe7fa8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verify (cyclomatic 14, cognitive 17): verify 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":"skills/_canonical/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"5454cc2a5e9e1e45f85b41e803d6efe201e3fedd7e090d0e34470bfd652f967e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 16): (anonymous) 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/commands/seat.ts"},"region":{"startLine":1218}}}],"partialFingerprints":{"codehealthFindingId/v1":"24051d9a764c0afc832cd87d4d43a62b21c5bf278b3e2f88f1f690252990fb34"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderGraphRevision (cyclomatic 14, cognitive 16): renderGraphRevision 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/commands/workflow-render.ts"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c5e98949e7431483783c724d8c093cb30b967c286cce1f130df1300b48e2a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ensureCodexJsonActivityHooks (cyclomatic 14, cognitive 16): ensureCodexJsonActivityHooks 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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"71d0c86766baf6ce24b1025dc3cd4455e87bcc3d39641ec0bc721d383b2a4da5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveRuntimeExecutable (cyclomatic 14, cognitive 16): resolveRuntimeExecutable 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":2106}}}],"partialFingerprints":{"codehealthFindingId/v1":"78bc07dc6b8bd13e71210f438e41533f3784e5e27b5b6cc02557381547958012"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validate (cyclomatic 14, cognitive 16): validate 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/daemon/src/domain/environment-artifacts.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"f908209192044f96b2620fabbfcca16b87f39e88558d75979acc3e22a06c2af7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function transfer (cyclomatic 14, cognitive 16): transfer 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/daemon/src/domain/gateway/slack/slack-subsystem.ts"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"62870201ec8af375f85fb93431bdb521bf6d09d013fdcdc52301fceb5356a0da"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function act (cyclomatic 14, cognitive 16): act 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/daemon/src/domain/mission-control/mission-control-write-contract.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd192eeae42643581c167b8411e37138150f4d61f338d0e5f79a122a8edb9156"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectPlugin (cyclomatic 14, cognitive 16): detectPlugin 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/daemon/src/domain/plugin-discovery-service.ts"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"add3e3971be61404eb3f0da08a6e66df443317fd4d3dd311eb3dfaefbc9eb96f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ledgerOf (cyclomatic 14, cognitive 16): ledgerOf 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":5897}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b4a8b18d940091679bbf1939ebf37dff39742a96390c39a36185e0f638dd53"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function commit (cyclomatic 14, cognitive 16): commit 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/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":1864}}}],"partialFingerprints":{"codehealthFindingId/v1":"b77dc4dab8dfdb88e00207952034a7cc26651576cfca26636147bcffaa73e975"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function attempt (cyclomatic 14, cognitive 16): attempt 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/test-system/delivery/cases/d18.mjs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"a681feb59671eeba1b64a64e6a41d594ce08ef6e607014af82ae0e1c767d48cd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readTerminals (cyclomatic 14, cognitive 16): readTerminals 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/tui/src/terminals/terminal-model.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"c60bf87e40d977d9274ff4d9965d25148ce1e84ac55bd1dcf7ca4e7a41d8971d"}},{"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/src/commands/bind.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b6c31f628aebbaf28c37995762253a4ad5e6a437101b869a7a1157bdde9c324"}},{"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/src/mcp-server.ts"},"region":{"startLine":2035}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f55667dbbbe718a6e1457f642f256e20a5281b073b074da8e7dba770be820ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exec (cyclomatic 14, cognitive 15): exec 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/test/setup.test.ts"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7a298a1887f5b32613deca5a74ec26c0f6c9296a964d7b2594c04e56b47c25"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeRateLimits (cyclomatic 14, cognitive 15): normalizeRateLimits 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/daemon/assets/claude-statusline-context.cjs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eab6a2300fa94e7ff34e5c313ce2064d282f3faaed0c4b6462680639d95eb38"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyState (cyclomatic 14, cognitive 15): applyState 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/daemon/specs/agents/shared/skills/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcdfa8e1c58bbba68adb91e2fbce9c99a2d60342532eb0e6b052d22e745d5f64"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkReady (cyclomatic 14, cognitive 15): checkReady 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/daemon/src/adapters/pi-runtime-adapter.ts"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"38d18fad603280d7cb23202e500e7a88c7ac8b9fcf78179232e189820d59c57a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function trackedThreadSources (cyclomatic 14, cognitive 15): trackedThreadSources 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/daemon/src/domain/gateway/slack/slack-recovery.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a8ecf1819a4a78ccb584153233ae63bd901a50b7101c41db9709949fe60435"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function currentClaudeLoginRefusal (cyclomatic 14, cognitive 15): currentClaudeLoginRefusal 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/daemon/src/domain/native-resume-probe.ts"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"914e3e14158bf71446ba93956b137ac2534f031efd6f0110cb0b2493fca7b0df"}},{"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/daemon/src/domain/proof/source-watch.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"b33d7a7f8f2daf7f6071fbcc629aed728844d0714819a19bd44a7e23acd99174"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function serialize (cyclomatic 14, cognitive 15): serialize 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/daemon/src/domain/rigspec-codec.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eeee1cde159faa9545064c78268b9de452d5eeb0b226a9166ea3bf80d75e518"}},{"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/daemon/src/routes/hosts.ts"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31eaa74472e27bea00ac5017d3c5bcd94af565b1904babeef7192908f6f4f01"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderExistingRestore (cyclomatic 14, cognitive 15): renderExistingRestore 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/daemon/src/routes/up.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"73250354c54868653bf9111bc37298076c85c6f33abc0e583611ab2fa012cfbf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function RigOverviewTab (cyclomatic 14, cognitive 15): RigOverviewTab 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/ui/src/components/topology/ScopePages.tsx"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"c320c2c6628481b006b689587054e3f46fb4f7ee68947ec70ef560656140b55e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseArguments (cyclomatic 14, cognitive 15): parseArguments 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":"scripts/check-substance-gate.mjs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd3c48f5dfc07f9137f8c2b631517a040a351ded8f29d45574000d00ecb9ceaa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyState (cyclomatic 14, cognitive 15): applyState 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":"skills/_canonical/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"d55492231e4d5526a8a5884fe7e27bd8e6d91d241b2ea2526e3f5e9a86806d74"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runCrossHostBroadcast (cyclomatic 14, cognitive 14): runCrossHostBroadcast 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/commands/broadcast.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fef130fc6a98fbd847b19f4f6f4bd697d034c75c8550edb57d6b0c25189496d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 14): (anonymous) 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/commands/capture.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a82dd4e0c854139af2aa4b0742d8550b0d935b583388f89217791a1572ce11"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyQueueEntry (cyclomatic 14, cognitive 14): classifyQueueEntry 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/commands/heartbeat.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa428d2b52d6cf551bfe1248a3c6076904a350f421ed369e3c9999ba00e1af10"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writeTargetState (cyclomatic 14, cognitive 14): writeTargetState 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/commands/rig-mode.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e58af159ab07d9f2ee3e86472ea68bcb1aca1caaefb1091b3bd9b0f5bb5973"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveMissionCreateRoot (cyclomatic 14, cognitive 14): resolveMissionCreateRoot 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/commands/scope.ts"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f3dc413b22f274671eedfba90e959f2f1ab30c935c3a533e6a9a71930308d6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 14): (anonymous) 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/mcp-server.ts"},"region":{"startLine":1975}}}],"partialFingerprints":{"codehealthFindingId/v1":"d80d1637c3600e33be2f5fd2be9d9d38e74ba4fbe7339011ce1e374267e01b56"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordRefocusResult (cyclomatic 14, cognitive 14): recordRefocusResult 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/daemon/assets/plugins/openrig-core/hooks/scripts/refocus-health.cjs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb71c434559d9457b87dc2a9dcdc4a6ebbff139215bd146d6d8eed533492160"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function homeIsolationAdvisory (cyclomatic 14, cognitive 14): homeIsolationAdvisory 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/daemon/src/domain/home-isolation.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab44959877ff57b4d10752fd497639391770c2347ec86e51691edb27400f2d8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 14): (anonymous) 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":3023}}}],"partialFingerprints":{"codehealthFindingId/v1":"627b1eeef7181c3fd46bebe46a1555a7778b96d32f04db9283afa516a98e2757"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pruneStreamItems (cyclomatic 14, cognitive 14): pruneStreamItems 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/daemon/src/domain/queue-retention.ts"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba6a7ca42eb9b1bad94862dfa6bef537ce8e472eefca603e9bc5c545e0884f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateWaitTarget (cyclomatic 14, cognitive 14): validateWaitTarget 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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"80ec053b1a4b14957b3a35d3fc7f6f03b30e76d3ccda73bdba1d6eb94ce5300d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function list (cyclomatic 14, cognitive 14): list 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/daemon/src/domain/stream-store.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"1caba44d8c50becab8066ef694ee8db699576a1509652c30303e3300f8b14e8d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function remoteUpLeaf (cyclomatic 14, cognitive 14): remoteUpLeaf 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/daemon/src/domain/topology/remote-up-leaf.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"d209d1c3a68ea10553eebb7c008635951728996f482051b6c1b63b7bd8220049"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 14): (anonymous) 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/daemon/src/domain/workflow-runtime.ts"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4242c048e57dc52918d3c3d7b37cc35f24f7d6e07aaf330b111f2d99c52ddb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function wrapPaneEnvelope (cyclomatic 14, cognitive 14): wrapPaneEnvelope 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/daemon/src/lib/pane-envelope.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"8613825353642f52e380dad37f702f07c61d1bce8f74c9a38487935bdc4bdf57"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 14): (anonymous) 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/daemon/src/routes/packages.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ab8a0f39bacea09036734c2b91b588986e5eb911fbd56125f553933410c383"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 14): (anonymous) 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/daemon/src/routes/seat.ts"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a15b85fca71baed62467a0e2571716182bfbc87cd485e54dddddacd3f51de35"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 14): (anonymous) 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/daemon/src/routes/slices.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe6af4435425009c92944188928c1a08cf1977cb0eb259a4a35abbc5f0bfb8a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 14): (anonymous) 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/daemon/src/routes/workspace.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f0c987bd17735e1f3e3cf070bff2b7dcc534ffba088e750f0383f8590d45d1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 14): (anonymous) 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/daemon/test/codex-selection-history.test.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf62bd50f94f81595783c73edc25eb8ca035c7285b107857ea73d4f6e2148013"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 14): (anonymous) 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/daemon/test/community-harness-dsh-example.test.ts"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7aeb73ff35615fa51e53509e116139db0eb8d4ad2395bd5c6a83d6c9f3ffd36"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveTopologySession (cyclomatic 14, cognitive 14): resolveTopologySession 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/ui/src/lib/topology-activity.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fafd070b14cb6abb8a1731c49720b7bd2e001a137462a83743efc3c71435cc4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 13): (anonymous) 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/commands/plugin.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f78dededae714895c9ebd8b7b5c5324348e573c0c269c086464f1deb22e853d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 13): (anonymous) 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/commands/rig-mode.ts"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f9cceb92848a9bbdb946d861c0597a49a4d98a0e4c2a9fb459e6d2e3c27156"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 13): (anonymous) 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/commands/workflow.ts"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"118270b03bcccc80cbf5ed9cb921c7d3c7a4568d66e88b68ccae994d869f6634"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function successorOf (cyclomatic 14, cognitive 13): successorOf 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/mcp-server.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"d113b9dc34f5fac538af884218aaaa8ebe67b57f1c3f56b1aec495bdfb237718"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 13): (anonymous) 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/test/plugin.test.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"80129cbbfaef45026826566e3263790bcd0591160d0c5e22ea5ed57a36b99e2e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeFile (cyclomatic 14, cognitive 13): normalizeFile 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/daemon/assets/plugins/openrig-core/skills/claude-compaction-restore/scripts/restore-from-jsonl.mjs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba79062bb5a536160becd55a915b342b5b683c02a7b708948f99970c50190d9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runtimeProbeFailure (cyclomatic 14, cognitive 13): runtimeProbeFailure 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/daemon/src/adapters/preflight-exec.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e2575c83245b91f8b35001237b4d66825e3ddb39cc01b98023ce6ebe291fc9f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeProvenanceBlock (cyclomatic 14, cognitive 13): normalizeProvenanceBlock 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/daemon/src/domain/bundle-types.ts"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c78811720ea46d055fce328f0b336f3f01e7564ba389d5cdf405daf32112a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 14, cognitive 13): constructor 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/daemon/src/domain/claim-service.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a40f0c73ae7c81ff41defe96a25bb63cbd509e6db4d67b94ded404b7de9a2c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 14, cognitive 13): constructor 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"085a0d5b79bbcb50e27d8281cc6f9fbe246da2e0eb4739e63a589b6f7a4addb7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function upsertDiscoveredSession (cyclomatic 14, cognitive 13): upsertDiscoveredSession 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/daemon/src/domain/discovery-repository.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56878d52b13714e6329f982ba9a5ce9d00ca84ce3b74d6a5da73ebaf1154061"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildRelayExpectedReceipts (cyclomatic 14, cognitive 13): buildRelayExpectedReceipts 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/daemon/src/domain/gateway/relay-outbound.ts"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"807514380a82166df47b77209e46f73b991006de53727b091743535177c98964"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 13): (anonymous) 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/daemon/src/domain/gateway/slack/bot-inbox.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"506aa7561d2a9f66566ab035187c870a1a392ceeeb538505ece75ca79add150f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 13): (anonymous) 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/daemon/src/domain/lifecycle-obligations.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c33d26833920b7a5aafe8a2528cc5c366f7f7b358a5bc328565276575f1432db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function observeClaudeDelivery (cyclomatic 14, cognitive 13): observeClaudeDelivery 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/daemon/src/domain/native-process-lineage.ts"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"07414712cf0df0da95a2a25c05bc783938c122fdc12a026f222ab6c163a845d0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function currentAskVerdict (cyclomatic 14, cognitive 13): currentAskVerdict 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/daemon/src/domain/policies/quiet-release.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"41030ccccf9365d62db3098e3bbe3b185a346aa3aa614d1164bd20d073d3c3eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function operatorRung (cyclomatic 14, cognitive 13): operatorRung 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/daemon/src/domain/queue-wake-ladder.ts"},"region":{"startLine":1754}}}],"partialFingerprints":{"codehealthFindingId/v1":"8566976cb58322f513c13e59ca6a7ffd99727938088b44567220cee8b4d3dd64"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validatePodLocalEdge (cyclomatic 14, cognitive 13): validatePodLocalEdge 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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f26be35a266af0b5748033e8f6b0658af2ed295e0015604c101ebe5ece2fbb1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isRecoverableStartupFailure (cyclomatic 14, cognitive 13): isRecoverableStartupFailure 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/daemon/src/domain/startup-orchestrator.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"450624f41bdf13bf3a09f76aa4b6b30c2523c04230843d76015d14dd9f4d4afd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rowToJob (cyclomatic 14, cognitive 13): rowToJob 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/daemon/src/domain/watchdog-jobs-repository.ts"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a9a8dcbde76f66b1c599e4d21497ccab715d53f0f03abfaed4488ff3d835f3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateAcceptance (cyclomatic 14, cognitive 13): validateAcceptance 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/daemon/src/domain/workflow-projector.ts"},"region":{"startLine":2095}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a0daa11cd727d00f306316b0cf979d098f4a3803188933d79d49c39fd10d6e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fileAssetResponse (cyclomatic 14, cognitive 13): fileAssetResponse 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/daemon/src/routes/slices.ts"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe2ba0b97dec32d09d4b1905bd4f6cd07b89071caaf59a85ae258824718eec1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fixture (cyclomatic 14, cognitive 13): fixture 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/daemon/test/runner-permission-path.test.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"745b9ad5fd04b8872dfa077b90fe571f7ee395f8d3ad56a1c14fbdee40edf708"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function healthSummaryLine (cyclomatic 14, cognitive 13): healthSummaryLine 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/tui/src/health/health-model.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d3469fed0ad5162ff5814b11e177d70420126b4018902f7f9f878c4f701f86a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dispatch (cyclomatic 14, cognitive 13): dispatch 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/tui/src/state.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1bff83984923c7f4ca3d287233fdea4cfa4402a3f0fba7af9634f522805cca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function KernelStatusCard (cyclomatic 14, cognitive 13): KernelStatusCard 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/ui/src/components/KernelStatusCard.tsx"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df0c677b59325b7c59bc49d5a7d4c77b025b597e6080807b9776eeeb6bb318c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function PluginDetailPage (cyclomatic 14, cognitive 13): PluginDetailPage 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/ui/src/components/specs/PluginDetailPage.tsx"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a2d78be8d4a060edb3a507ed97b8c3baec0743fc473eb8bc8f757b81ba852c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function WorkflowInstancePage (cyclomatic 14, cognitive 13): WorkflowInstancePage 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/ui/src/components/workflow/WorkflowInstancePage.tsx"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"42cb5f20ee65f6af7b70422a0953b67eee35100d637bebf52c5c9a8a64168976"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveProfilePieces (cyclomatic 14, cognitive 12): resolveProfilePieces 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/commands/walk.ts"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e09f23b84e031d5d167c6b559ab94721f4e4072e46d4d11cc95e6d9dde6270f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 12): (anonymous) 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/commands/workflow.ts"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2eb69d8864d73d794798511c24387198a2ccac01c39d38e486831b99230edf8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function currentPiRecord (cyclomatic 14, cognitive 12): currentPiRecord 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/daemon/src/domain/model-divergence/current-model-reader.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dfc6695632feb050ad0ef52a1913e783107e01c5b08c605ca02656c38ec46b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function diagnoseRuntimePosture (cyclomatic 14, cognitive 12): diagnoseRuntimePosture 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/daemon/src/domain/permission-drift.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6e03ed5e219c39d6da6e2ddeb91dda44b336b600b2cbe8af426e0aa4430175"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseReplyToChoice (cyclomatic 14, cognitive 12): parseReplyToChoice 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/daemon/src/domain/reply-to-choice.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61f6782f5a463962ea712fe365e526df62160817675a027aaa19aea6481584a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function launchPersistedFresh (cyclomatic 14, cognitive 12): launchPersistedFresh 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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":2223}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c4c7e314676c54874419991f1c9839f2e2d8f6b4cb69774ca5bf5b4d14e45af"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordDeliveryEvidence (cyclomatic 14, cognitive 12): recordDeliveryEvidence 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":2821}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6526971ea9fbf1e8761c8d557afdbfcb80807ca1a9e999eec6e27b620788ca9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function appliedPaneIds (cyclomatic 14, cognitive 12): appliedPaneIds 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/daemon/src/domain/terminal/herdr-adapter.ts"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f3cd5612b9f6e5255e5f21198895e0e7f9c3dab28ba9c971e5ed869eba016e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 12): (anonymous) 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/daemon/src/routes/chat.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"b957460b17f0dcca98c86149197a0fe12df3a60dd8b991313bccb5f948c3b13b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 12): (anonymous) 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/daemon/test/claude-full-restore.test.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"faba1f49b11fc89cf43100025d36d04de91809b40e561b5df7cc91ed96b24d7c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 12): (anonymous) 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/tui/src/execution/execution-model.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d57757ac2abba7108a99b1cbec2c018a3e0586b7d947ddfbaf081898e6dd8f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function effortObservedText (cyclomatic 14, cognitive 12): effortObservedText 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/tui/src/render.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"0451c0da5c5fd85ccffa6a004f27a12f18a45771575e3d2f14519612b13618c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ImportFlow (cyclomatic 14, cognitive 12): ImportFlow 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/ui/src/components/ImportFlow.tsx"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"d07272e0188dc8a773c8fcfa553aee229aa4d45eea204bee206f5693c46247a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function PreviewPane (cyclomatic 14, cognitive 12): PreviewPane 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/ui/src/components/preview/PreviewPane.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a6ae961fc2b72c51e8505ac9ba259aee826b085980ad8bd330fbe27de1bc99"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stopPreparation (cyclomatic 14, cognitive 11): stopPreparation 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":2272}}}],"partialFingerprints":{"codehealthFindingId/v1":"0947b104485f6670dc1af6ce71abe25730dc9eedd7533eb577e09eae975b98c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateCadences (cyclomatic 14, cognitive 11): validateCadences 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/daemon/src/domain/watchdog-jobs-repository.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"498a5bab766074eeabf26353ea1d661e41c3f1cb60cbc9dba6baaa30fa186c3f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveEscapeAction (cyclomatic 14, cognitive 11): resolveEscapeAction 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/tui/src/input.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ed85cf03f59f30f30bbace0c2341ed9c3230ca92c0637fa0e85036fca11d5e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function BundleInstallFlow (cyclomatic 14, cognitive 11): BundleInstallFlow 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/ui/src/components/BundleInstallFlow.tsx"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"26dbd4cf8461141a868100c8e9925308b9a6a170b4069d2b4f22be79f0c65a3a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function discovery (cyclomatic 14, cognitive 10): discovery has cyclomatic complexity 14 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/lib/reconstruction-reader.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc32b739c8716daf3317f22cd18b3eb63e92f687ad2f6ec9cc37835da4ae001"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function swapRuntimeSwitchPanes (cyclomatic 14, cognitive 10): swapRuntimeSwitchPanes has cyclomatic complexity 14 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/daemon/src/adapters/tmux.ts"},"region":{"startLine":1686}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c1f7d6c5dc4b244f46bb1868e0739f8e80e588fabb314797f5d87d57efa3278"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyWakeResult (cyclomatic 14, cognitive 10): classifyWakeResult has cyclomatic complexity 14 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/daemon/src/domain/queue-wake-ladder.ts"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"26814f49e6ace75a71b566526db284dc1a43b3966fc1f61d7613cd8306ecacdf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordPromptObservation (cyclomatic 14, cognitive 10): recordPromptObservation has cyclomatic complexity 14 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/daemon/src/routes/activity.ts"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff815b91e5f571bc02a00fc33443e6738ed5e2cb4c2b2fd8857dbd54e7035155"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 10): (anonymous) has cyclomatic complexity 14 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/daemon/src/routes/rigs.ts"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d2b201e9eb805af228475cd653c83865564cf6c305717cfe1f8adbf171968d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inferKind (cyclomatic 14, cognitive 9): inferKind 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/ui/src/components/drawer-viewers/FileViewer.tsx"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f413844d23fbb6a93dbaec57878845e2892186a32131721455b2207c938a8da"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 29): (anonymous) has cyclomatic complexity 13 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/daemon/test/workflow-human-destination.test.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9510f88bd7a4087fc8a796b7b3bf05b00dfcab9644e5ff2b98922fbbf70b03b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function receive (cyclomatic 13, cognitive 27): receive has cyclomatic complexity 13 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ed3a157c834158a291f1a4492a73841f9327093560edf68a2e0a5b43355679"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evaluateProtection (cyclomatic 13, cognitive 27): evaluateProtection has cyclomatic complexity 13 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/daemon/src/domain/agent-images/evidence-guard.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d0e691aed33a48228f905b7b885ecd947608208af271275110ea52e2d3575e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readSSEEvents (cyclomatic 13, cognitive 27): readSSEEvents has cyclomatic complexity 13 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/daemon/test/events-route.test.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"0228e8594794435541d38f159b4765f76eb2b6b65afa197afd4778ec0c610822"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 27): (anonymous) has cyclomatic complexity 13 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/daemon/test/packages-routes.test.ts"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cfaae0450be019100844bb16e1d71d008243a5ac36051f7f2deeb78a457c1bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 25): (anonymous) has cyclomatic complexity 13 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/daemon/src/domain/resume-metadata-refresher.ts"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7224f35a8e51878deaf92ae6474359bdd1213780032dfb0c60668cc122beb25"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseTypedQueueScope (cyclomatic 13, cognitive 25): parseTypedQueueScope has cyclomatic complexity 13 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/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"36445477e13612146acf356febd5d5b5270e5fd495ef8cf06a047277d3fb639a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function actionLines (cyclomatic 13, cognitive 25): actionLines has cyclomatic complexity 13 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/tui/src/execution/workflow-model.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"3885192551b6448d98a3b415ab0be9677c48abfe7021f9b5be6c90e45d65f64d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stagePublicSkills (cyclomatic 13, cognitive 25): stagePublicSkills has cyclomatic complexity 13 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":"scripts/mirror-skills.mjs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"975ea3b8f812f0208f3dc53190d35e7d134c141ebcd14784b5605d02490082a8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 24): (anonymous) has cyclomatic complexity 13 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/daemon/src/domain/queue-erasure.ts"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"269cf17893c4344d89288c6c7aa69d9abc6b3c04b0b54a774296ea8bbebf2dd3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function create (cyclomatic 13, cognitive 24): create has cyclomatic complexity 13 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":2417}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb46dd5509ecedb1ca1054fb406f0c6a8ab9b4d9b69d1e68707c7e8d1c041e32"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 24): (anonymous) has cyclomatic complexity 13 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/tui/test/instance-mission-control.test.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"1778f33434ec2c5de33b7033ef84d623bb85750b5efbc7b09f6449111794d173"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadRelayProfiles (cyclomatic 13, cognitive 23): loadRelayProfiles 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/daemon/src/domain/gateway/relay-config.ts"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f213f3d48cbe3cd00cd6c5e3ae56b773684498244516fd70ce49a1f65c21932"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gitState (cyclomatic 13, cognitive 23): gitState 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/daemon/src/domain/skill-catalog.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3303d1621b4bb29133f5b02cb82574a7576958aaa5fceb9faf38a66fcc373c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deliverHeldGroup (cyclomatic 13, cognitive 23): deliverHeldGroup 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/daemon/src/domain/watchdog-policy-engine.ts"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"55297a25700c98238a1c1b8daaff4bccb7669313f0d23149cb7a3c5559eb1b1b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderInline (cyclomatic 13, cognitive 23): renderInline 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/ui/src/components/markdown/MarkdownViewer.tsx"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f322ad79ebd8c0c23cc6cb822cfc02cfb211c75ed399a96589e8b0d6d4e7762"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function discardOnThrow (cyclomatic 13, cognitive 22): discardOnThrow has cyclomatic complexity 13 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/daemon/src/domain/event-bus.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"8533d325f266d527b85408f060d5b0234f53b793228313500c2b2d057c51019c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseEffectiveSettings (cyclomatic 13, cognitive 22): parseEffectiveSettings has cyclomatic complexity 13 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/daemon/src/domain/seat-restart-in-place.ts"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a8ec5cfa68778b13d3c7a417009a99f15ba024f965d17e2bdc9c335b4361e4a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function agentMatches (cyclomatic 13, cognitive 22): agentMatches has cyclomatic complexity 13 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/tui/src/state.ts"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"00498b9ead9b62f51f4c4cd0685132f1b44f94990edb3e7c44cc7f274106027c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ensureVendored (cyclomatic 13, cognitive 21): ensureVendored 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/daemon/src/domain/plugin-vendor-service.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"da03cb444f1e56981b6612f9ed5fb1056de4856b19b2a21f652bcb1885d1da7d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tmuxFormatChange (cyclomatic 13, cognitive 21): tmuxFormatChange 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/daemon/src/domain/session-name.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb5ab0c2c8ac4025ced496bcb4fe681fbf106b01f1fcae918ce8085a52393303"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 21): (anonymous) 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/daemon/src/domain/shadow-capture.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"64849fb00648af81ae7c13588ea34c6153cfb08bec85aafd3937bf225828b948"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function missionAuthoredStatuses (cyclomatic 13, cognitive 21): missionAuthoredStatuses 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/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b902cfa5ca59eb5d396dceb2b25cea08e58e347818b3de71b1455aa82638df"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchQitems (cyclomatic 13, cognitive 21): matchQitems 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/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":1242}}}],"partialFingerprints":{"codehealthFindingId/v1":"25147254db5f88e29d355f06f95b21397981c0cd8f8b1972506edf15f651e16b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 21): (anonymous) 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/daemon/src/routes/slices.ts"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"5edad83b8810d32ba52c50036b8d9e2cd1773cc950de35c2fbac889c513f542f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 21): (anonymous) 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/daemon/test/queue-cross-host-br1.test.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"94025209a6e8379dbf3381e3b0190888b609c92a79ce324b8fac6be75f5e7d2f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 21): (anonymous) 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/daemon/test/tmux-server-two-instances.test.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"0528e22586d9dab93049431bc119a759119f385de108b31ad0c11509e2152969"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 21): (anonymous) 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/test-system/delivery/run.mjs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"30526ae965dc9f7d5eef000585d998c7b84f1fbbf38c9bbcbc82ca4e86a9401c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderDaemonTransportError (cyclomatic 13, cognitive 20): renderDaemonTransportError 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/cli-error.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"043633b31ef93073f9303e824352317d6505a7938191f296d401c33c7b1bd337"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 20): (anonymous) 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/commands/walk.ts"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d453ae92c06e9dc383cd49d5cf573b67e0e963f03f8755b9d56c9b9fb4525d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function expandChangedSurface (cyclomatic 13, cognitive 20): expandChangedSurface 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/release-surface/affected-skills.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33d4584d173733aed0b8f34378ce5b04960450891fc571e8978c973cc729c6a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function usageLines (cyclomatic 13, cognitive 20): usageLines 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/tui/src/usage/usage-model.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"106cebffa207bf14555e28ccd50c00aa5610a9b5ebd3d27ffd46ccc7f37abb79"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveIdentitySource (cyclomatic 13, cognitive 19): resolveIdentitySource 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/commands/whoami.ts"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"2370db43f5ba2776c344533c099b6d0a24afa6373ea8860179356a49d7450873"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 19): (anonymous) 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/test/health.test.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"439731fb09acf379a68ad3b8480e7969c498688c2d7e54f687ae836cf832bdc2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findLatestJsonl (cyclomatic 13, cognitive 19): findLatestJsonl 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/daemon/assets/plugins/openrig-core/skills/claude-compaction-restore/scripts/restore-from-jsonl.mjs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a8e3654eef61bdce522591bca681936a10176552c3832685842f8b1b450a2a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findDirectPluginCopies (cyclomatic 13, cognitive 19): findDirectPluginCopies 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/daemon/src/domain/skill-catalog.ts"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c02ab270155317036f9718c84f3d22da9024720516677aba63cce35dc02a94"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildAuditDependencyGraph (cyclomatic 13, cognitive 19): buildAuditDependencyGraph 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/daemon/src/routes/scope-audit.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b0e627be0671cae6ec6a1fca29cd555f6c1a7b2a1881d1762532a2e93825ab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function expectFor (cyclomatic 13, cognitive 19): expectFor 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/test-system/delivery/cases/d18.mjs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f4378150ef9a0ab52041ca242ebd391e8bfabae3221d3e8d2c7a604bb544c7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 18): (anonymous) 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/commands/restore-packet.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"f87823ae0482fce82881f79c58e72c6ecd88ce9e1020ba616a31e51fec03dd3f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchWithTimeout (cyclomatic 13, cognitive 18): fetchWithTimeout 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/fetch-with-timeout.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2bb6aa841ff17f1bf396095f5b3f01490188a57004913eb4b0d8af602a753d6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function judgeChargeProvenance (cyclomatic 13, cognitive 18): judgeChargeProvenance 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/daemon/src/adapters/pi-readiness.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"a84d8bd2d476266ce752ba7298e5b15f0edd12946b92ac2f3da9494add514f92"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startup (cyclomatic 13, cognitive 18): startup 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/daemon/src/domain/bundle-behaviour.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eeb6b00a171c037db14e1d10c49b13497af2b3af4f4b2d59d99c57e03e53d05"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readLifecycleExecutions (cyclomatic 13, cognitive 18): readLifecycleExecutions 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/daemon/src/domain/execution-view.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7af6cc40b028bf80dc3199094ef8b0373fe69a9fa702c5af8575b8fe3fe5bf9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function planCwdPreparation (cyclomatic 13, cognitive 18): planCwdPreparation 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/daemon/src/domain/seat-cwd-preparation.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae5a1c4ef98445d077a021bc129631a000b70fc2e1b06c0a19072fcb6a1e4f73"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function effortSavedText (cyclomatic 13, cognitive 18): effortSavedText 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/tui/src/render.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cbd66ebb52fc96ed1430e684d0dd5c795b9cf1c5d247d6e79142c3bd74b842f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bundleRoutingSummary (cyclomatic 13, cognitive 17): bundleRoutingSummary 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/commands/bundle.ts"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"66aa3764c15b68d62f28e4227c745ab617a2fcda6061b10dd1427b23c37a6b77"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateSubscriptions (cyclomatic 13, cognitive 17): validateSubscriptions 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/daemon/src/domain/gateway/human-registry.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb0eea82ae0fe6b88f34cd3157756b57660b418b6a5faf80748d5042e3145e9d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkRestorePreconditions (cyclomatic 13, cognitive 17): checkRestorePreconditions 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/daemon/src/domain/restore-check-service.ts"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"f04d0b6998aaddb1414bdbcc02fd921bb919d0fb330720873c85e2accf258d16"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveEscalationReturnRoute (cyclomatic 13, cognitive 17): resolveEscalationReturnRoute 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/daemon/src/domain/return-route.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"405b2b5721f845faa3b7c09d14a524030546574203bfafd28f27ced68d66b992"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findProofPacket (cyclomatic 13, cognitive 17): findProofPacket 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/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":1539}}}],"partialFingerprints":{"codehealthFindingId/v1":"e644f56772caeb9f63506d5a54fffd8d19fc5c6c821e52fd629deb58c350fc40"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractInstallTimeMetadata (cyclomatic 13, cognitive 17): extractInstallTimeMetadata 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/daemon/src/routes/bundles.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24b036e3cb45e6aedfe9fc1c38a3f43123af55017024aa661b0c5e90e120427"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 17): (anonymous) 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/daemon/src/routes/scopes.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a601a2edd0018c2eff79242d843800a00cbb9923e0c9ad843edf5b12ee459d8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readFollowControls (cyclomatic 13, cognitive 17): readFollowControls 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/daemon/src/routes/terminal.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c271f01ff72f516ef91fff85eacd0894c678e2fba574916480d375cecf1d69"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function completeCommand (cyclomatic 13, cognitive 17): completeCommand 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/tui/src/commands/completion.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"be6ca1770f1b49638d7fc47e369f87ed9e865c40fe1160ceae1c956737830f0a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 17): (anonymous) 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/tui/src/navigator.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa79305ae131f1e618c89281a1d36d5a093afc46927780d025c26a0e3368e710"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildLauncherViews (cyclomatic 13, cognitive 17): buildLauncherViews 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/ui/src/components/topology/TerminalLauncher.tsx"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cfdbfaeec254bbce7aa9749c9bd6267cb84849fdb20743d889245ac4cec9ce5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function acquireGateLane (cyclomatic 13, cognitive 17): acquireGateLane 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":"scripts/gate-lane-lock.mjs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c4b36868d7802e2760bc7dd7fe4e4c0d8b86abcbc06f766c20bc45f84f245a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function observedCompaction (cyclomatic 13, cognitive 16): observedCompaction 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ec6bd5e9e323dc8faa13164baea0d53b861c6c32e03e4a5d48364f4c173ebe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function composeMissionReview (cyclomatic 13, cognitive 16): composeMissionReview 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/daemon/src/domain/review/compose.ts"},"region":{"startLine":1297}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9fc734a485037506b6815f72b6d8d328988969c3617931a8549d303edfa99de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function broadcast (cyclomatic 13, cognitive 16): broadcast 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":5047}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c5d3302683b6ca4ac2c9528ef1fc747b88899dfba86731d43e0038456fadca5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function listFeedHostSubscriptions (cyclomatic 13, cognitive 16): listFeedHostSubscriptions 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/daemon/src/domain/user-settings/settings-store.ts"},"region":{"startLine":1505}}}],"partialFingerprints":{"codehealthFindingId/v1":"d27ba7cf3d140693ef22d71ebdf5c5fe2c1151a1e929a698ec027f3938482237"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function grade (cyclomatic 13, cognitive 16): grade 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/daemon/test/helpers/eval-grader.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"de38f056e45aa2800daf5fdb69834cbadf919d781539c403a60fcc1588554650"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runProgram (cyclomatic 13, cognitive 15): runProgram 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/cli-error.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ba1558700827ddc00529257d7b15181edf25375611e3dd25ab716c926c3987"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function printQueueItemResult (cyclomatic 13, cognitive 15): printQueueItemResult 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/commands/queue.ts"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"403ca0f2da9925496ff547fb86d63b8f8699b29fe1af3be5aadcef08422d43ab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 15): (anonymous) 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/commands/seat.ts"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a8960a579b69ebb0643d9da355dd631f1283468117c4764e05f93935aea421f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildDaemonEnv (cyclomatic 13, cognitive 15): buildDaemonEnv 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/daemon-lifecycle.ts"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43c1ad2991ccf33f9a79d87ba7583d3b587a2d25074b0ebced6aa0fe137968c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readCodexPermissionRecord (cyclomatic 13, cognitive 15): readCodexPermissionRecord 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/daemon/src/domain/codex-rebuild-permissions.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b37d15dca1ab80984f3d6e49d6826f2df03930e571864ae970e3a49df4e152a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onPosted (cyclomatic 13, cognitive 15): onPosted 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/daemon/src/domain/gateway/slack/slack-subsystem.ts"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b5354c7b6d9c39a98cc8d357f10510df38475e6dfe8946379a07d95cde17c03"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function due (cyclomatic 13, cognitive 15): due 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/daemon/src/domain/gateway/slack/thread-recovery.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"f876f70e8d7cdcdb74532d198d84c52b96d4da19a3a8897fe2fbcbca15b2e5b1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function searchSeat (cyclomatic 13, cognitive 15): searchSeat 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/daemon/src/domain/history-query.ts"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21985c589dd7dea8ce575989a91446671b1788724f463aabb7b683ef73f8877"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergeManagedBlockText (cyclomatic 13, cognitive 15): mergeManagedBlockText 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/daemon/src/domain/managed-blocks.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a389870e752a7db594f9f54015875cb923bd77b100a3935dc5350dc9000ad1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ensureLocal (cyclomatic 13, cognitive 15): ensureLocal 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/daemon/src/domain/network/network-connector.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fdb31d4635e18b1b85b9410a10dfaf813451e97107e4bdb9c3b26b83012d33f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rollbackToZeroSession (cyclomatic 13, cognitive 15): rollbackToZeroSession 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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":1854}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0455ecd512ccf188d1248a889b6bf9747b84e54e0c9a054a60447f91afa98a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function defaultProbeClaudeResume (cyclomatic 13, cognitive 15): defaultProbeClaudeResume 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/daemon/src/domain/resume-metadata-refresher.ts"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"f04d5dd2ec9c23dad06dd0cd5ffb906246d3ea782fbc56991b8a1287783ac14b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inheritedStartupFileErrors (cyclomatic 13, cognitive 15): inheritedStartupFileErrors 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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":2396}}}],"partialFingerprints":{"codehealthFindingId/v1":"917a4e727bce8e69d74f49a61cc14f5eada7df3856ea0cd8992bc2613a0fd4e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function labels (cyclomatic 13, cognitive 15): labels 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/daemon/src/domain/stream-classification-worker.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a6f3a29cd1a57bcbbb5e80355593b5b8f2e6a0711e6ec8d43d74ba0801c33d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 15): (anonymous) 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/daemon/src/domain/terminal/task-terminal-view.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"570adc04be4d72a5573e5c1b9d97e60b81bf604fa553321fe5e0ddf2523c1ed4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCompareBlock (cyclomatic 13, cognitive 15): parseCompareBlock 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/ui/src/components/markdown/storytelling-primitives.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ded448ce0def368955ef9dc90261e0c7e326d892682320389dcef00a50269c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseArgs (cyclomatic 13, cognitive 15): parseArgs 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/ui/twin/capture/twin-capture.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67929905e4abb291f141f52e4f38428e6e87e135dc8a3c634756e8eca804586"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildSpecConformanceCheck (cyclomatic 13, cognitive 14): buildSpecConformanceCheck 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/commands/doctor.ts"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2fa499b18e78d1e54425b0d863b5a5489625787ba0edab53697703df8ee21c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateSkillFrontmatter (cyclomatic 13, cognitive 14): validateSkillFrontmatter 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/commands/plugin.ts"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"38fcff65531764382624a0b24d7eddc7fe037bdbe08f12fe5328560ab86a9af4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectStagedAtPrompt (cyclomatic 13, cognitive 14): detectStagedAtPrompt 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/commands/send.ts"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e29e064940584bc52e5c644f96cddb7337b847c8b0c84ff3a76bb916fdeddd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveStartupProofEndpoint (cyclomatic 13, cognitive 14): resolveStartupProofEndpoint 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/commands/startup-proof.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ffd84ab49353567669c0f016dbfe01f5564591be9a63144da26752f454b108"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nodeSeat (cyclomatic 13, cognitive 14): nodeSeat 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/mcp-http.ts"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dbaebcfa9a71fd29ccef5ccaaa6d28c87accd5beadbe8030f7b97223f579439"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 14): (anonymous) 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/test/specs.test.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd28fdb1c641dabd1eee5790814b7cf1ce2ddff45fea83e0eff2e8d4888cf056"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveSeatSafeExtraPath (cyclomatic 13, cognitive 14): resolveSeatSafeExtraPath 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/daemon/assets/plugins/openrig-core/skills/claude-compaction-restore/scripts/precompact-hook.mjs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d4bd57d65562a1337b185e043b87e6d988a25e5b0fcbf094d536b10ef3a02b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizePreconditionsBlock (cyclomatic 13, cognitive 14): normalizePreconditionsBlock 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/daemon/src/domain/bundle-types.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a57f3bf6ad7b0632b88b7bae6f4ece9de4248e4bd9babc968cdf81a021b13f8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkSeat (cyclomatic 13, cognitive 14): checkSeat 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/daemon/src/domain/model-divergence/model-divergence-monitor.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa2dc2d225d1908c2a70ecd4dbd939e547f653b62c51889c15dc8cba4d1c9e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 14): (anonymous) 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/daemon/src/domain/network/network-connector.ts"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"575406c5e0ebdbf75bd84db5fcc199b320ac38474d533da2eafdeb6903ebf9df"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function agentsForSlices (cyclomatic 13, cognitive 14): agentsForSlices 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/daemon/src/domain/review/gather.ts"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0cf592689fd1215ff7e403c5c3f33d150fe95d4ff0d85fbd826505491640096"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 14): (anonymous) 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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce584787443514dce0ed14548b3ce303ce6216cc9a5b4f63682ccad32f7e3098"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 13, cognitive 14): constructor 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/daemon/src/domain/stream-classification-worker.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d3a41f839c2ccb12d2947de30f641a6d1c66c2a107ac4466a769a5ebee4eaf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderFollowing (cyclomatic 13, cognitive 14): renderFollowing 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/daemon/src/domain/terminal/terminal-service.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbf0b3bddc18ac9eac50772ce5ecded7fcc0e18eadf44bf9d94b23663e774717"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 14): (anonymous) 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/daemon/src/routes/context-packs.ts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb2e4d3092cef6044a7b87fefeebd73d58c55d6560cf92809f61ef396cf4071"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 14): (anonymous) 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/daemon/src/routes/rig-mode.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"17bc3d9cfc9959de3f58be41e8eb6a05b9ba59dfd15187848cecc2f9e6468d3b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 14): (anonymous) 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/daemon/src/routes/skills.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f2ce45f0e9aaaea775174cbb661a44b634b4e38655022c8f24732f0367da305"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 14): (anonymous) 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/daemon/test/bundle-routes.test.ts"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07512bf9e8cc5816fbea5f909d44a0f280312975d3a54ad0f4f9d0d097ea180"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 14): (anonymous) 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/daemon/test/health-passive-ceremony.test.ts"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23919b39580370dae2081677e790242079a1d7fd5435c9cdcb956b560dd8164"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateScenario (cyclomatic 13, cognitive 14): validateScenario 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/daemon/test/helpers/scenario-schema.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d05edbe7e94ab121d6211c41b9f0697b43dbf83c6016b9e9bfc157baa961b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 14): (anonymous) 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/daemon/test/transcript-silent-change-native.test.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"08353681dfff6fd2338715ab2c76d2e0e8b2e2d073d92cb149888a140acdc563"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 13): (anonymous) 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/commands/agent-image.ts"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1b2c6fc970a5fa2c19f3be2076d338d29817640afdb0c7fdbdde62adaf2cf1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function analyzeNode (cyclomatic 13, cognitive 13): analyzeNode 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/commands/compact-plan.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9187661d0e915abbed28e3370fa9553fd84b4f7d1d2b263e8534fbe4bac3a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 13): (anonymous) 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/commands/discover.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a756d848c25d3fda7bd93b26aebc5f879da7ccfba65e6af68a86f940c69ce56"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildTmuxControlModeCheck (cyclomatic 13, cognitive 13): buildTmuxControlModeCheck 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/commands/doctor.ts"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"45e07717267719852046f6916db6afd79c2dc16e70c7fa79ebbf93e7cfab988d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function serveHttp (cyclomatic 13, cognitive 13): serveHttp 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/commands/mcp.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ad21381cf72315b27be2dc0bf289dce0fcf97f703e69fa78f5de749d5a69f8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 13): (anonymous) 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/commands/ps.ts"},"region":{"startLine":1933}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb848e2249f44925a757c5621bfd9c161db0a7d8a2d76a56b6e98e5e30a9be12"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function wrapSendBody (cyclomatic 13, cognitive 13): wrapSendBody 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/commands/send.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e87d73ef7dad9c2917ad0c51b67ab732a85c53641ae5f8f4b94be871783cf8d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function describeDelivery (cyclomatic 13, cognitive 13): describeDelivery 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/commands/skill.ts"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7af65c0cb028c81dd6ba91eca76f3904916c39d540569d7ab2e69854296d6d8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function c1ArtifactProblems (cyclomatic 13, cognitive 13): c1ArtifactProblems 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/lib/scope/scope-audit.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"703973b5b901a26ba51c8ffc610d7f95fb6477c48e863bf3c98d24dcd0f8dd12"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readClaim (cyclomatic 13, cognitive 13): readClaim 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/lib/scope/slice-claims.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"4acaec9e47462b60bf304482c9cffb38ee983441fb06462ccb19c944af098409"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 13): (anonymous) 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/test/adopt.test.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d3bd1f2126a90ebda37748d4dc15327d7c39434b6999505d87ad8c39cf234b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 13): (anonymous) 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/daemon/src/domain/execution-view.ts"},"region":{"startLine":1268}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e683c861ad70673b64388023f5cfcef72a60747d142a7b8530292c26dad97f3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function initialize (cyclomatic 13, cognitive 13): initialize 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/daemon/src/domain/gateway/slack/state-store.ts"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"67021b887f1935cae738ec1b5a58d085f3c3797f17b3075fa06cd1b0334544c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readEffectiveModel (cyclomatic 13, cognitive 13): readEffectiveModel 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/daemon/src/domain/model-divergence/current-model-reader.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ca74587039fa98153f8ca27947ecc80e86976d2b57b32c05156d641a7a667f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveLaunchDefaultFromMetadata (cyclomatic 13, cognitive 13): resolveLaunchDefaultFromMetadata 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/daemon/src/domain/native-permission-store.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"15be09457b52de1593886f5b84d7e6a3c89b0ea6f7494c8468bb0b5092511a1b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readNativeExecutablePaths (cyclomatic 13, cognitive 13): readNativeExecutablePaths 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/daemon/src/domain/native-process-executable.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c4864e6e6122675443f91389b6b57f1772681c4951712c6e65f0065d85495c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function claudeAdditionValueEnd (cyclomatic 13, cognitive 13): claudeAdditionValueEnd 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/daemon/src/domain/native-process-lineage.ts"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"83daaddcc17b483bcc111fa92dd6ec8679923f953496d049b6a1f80944ee3355"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validRateLimits (cyclomatic 13, cognitive 13): validRateLimits 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/daemon/src/domain/provider/claude-usage-reader.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db29f13937d8112565c7c6342899e6366e8777f43777cb465bf9aa00a6aa9a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function switchOnHome (cyclomatic 13, cognitive 13): switchOnHome 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/daemon/src/domain/provider/provider-service-impl.ts"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca3896b7518bbd9d183545337317cfe5ca04207803d54424893a794e98f55c41"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateRebuildSessionSource (cyclomatic 13, cognitive 13): validateRebuildSessionSource 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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"0238c56d78a321516ca62b0b6a607ff2ab65655911c0b51294ecb6cc66c0c561"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function c1ArtifactProblems (cyclomatic 13, cognitive 13): c1ArtifactProblems 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/daemon/src/domain/scope/scope-audit.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a492967a424dc55bbf32f7afb8c047705df5c4bcf124cdc182da76f72c751b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildRestorePacket (cyclomatic 13, cognitive 13): buildRestorePacket 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/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":2190}}}],"partialFingerprints":{"codehealthFindingId/v1":"64ef32d88e52b8b356455ada330fcf6be38b60d0ca2e32a108a3b2f9391c806a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 13): (anonymous) 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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bcb1275558b6f0d56614ef32ee0865ac1785ddaf7129d00a449ff49d7f2758a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSkillFrontmatter (cyclomatic 13, cognitive 13): parseSkillFrontmatter 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/daemon/src/domain/skill-discovery.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc7fd090762bdb23b61eef6f826ab3e4ee94ab0311c4bdca3e49d829b2fe2cc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function keepRunsOnTheirFile (cyclomatic 13, cognitive 13): keepRunsOnTheirFile 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/daemon/src/domain/workflow-spec-cache.ts"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccbc5f4bb2a57ba7deeec9a2b749fca033cbb557252a9fd3e358ecb27b9e2c81"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 13): (anonymous) 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/daemon/test/kernel-lost-restore-overrides.test.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53e38133b1fffc503d0f1d098234a2fba56bc99286265a9da61907e3b332863"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 13): (anonymous) 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/daemon/test/restore-orchestrator.test.ts"},"region":{"startLine":4223}}}],"partialFingerprints":{"codehealthFindingId/v1":"d36a4cfd3e8f6208c7e7dccf3d3cf9238a37dcf02a1ad83ce53c9f0496d46c07"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readFile (cyclomatic 13, cognitive 13): readFile 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/tui/src/daemon-client.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f3761c33ebc53158ac72f5e11447af71b4452dd03fcff1834a47a22663bc1b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseFilePathArg (cyclomatic 13, cognitive 12): parseFilePathArg 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/lib/file-transfer.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"704c09ef2e9040e2c89ae3c328e6654dfe21fe7bd22e9ed11ea9a8f774baab14"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 12): (anonymous) 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/mcp-server.ts"},"region":{"startLine":2517}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8064d54c35029e584b1039c5353636d432855ea332f759d1956c882d576578a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function warnTmuxDeadline (cyclomatic 13, cognitive 12): warnTmuxDeadline 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/daemon/src/adapters/tmux-exec.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"adaf87192cf5ef4c44158c71bdc0b6027a4d997d00e0dfda44958b331b62c6d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function seatScope (cyclomatic 13, cognitive 12): seatScope 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/daemon/src/adapters/tmux.ts"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b84ec7291c0936131bc99120db379856cfa2786e214a60b3677ac7f02ba0c8f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 12): (anonymous) 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/daemon/src/domain/desired-claude-activity-hooks.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82203542cc23721a1738804f2b35e2019ac27b9c2477d96e027157bc781f698"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getReadModel (cyclomatic 13, cognitive 12): getReadModel 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/daemon/src/domain/provider/provider-service-impl.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb4de29e41861109571cfe614fef533841d1935c2a88fec7a0e999fe3da3998"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 13, cognitive 12): constructor 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"720fbc50683b6f90b42995a36616185fc027df65742f02f7ec89c0f4f4d4e1a8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function armQueueWait (cyclomatic 13, cognitive 12): armQueueWait 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/daemon/src/domain/queue-wait-backoff.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"12aa0da772ffd55efbf667f3d472a56573a031fd88798867f8ead04e52f2e4ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseWake (cyclomatic 13, cognitive 12): parseWake 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/daemon/src/domain/rosters.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04b52fb25d03b0bbf491a87fc4b55486a36bd5147449716fbcbf27021e7b034"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 13, cognitive 12): constructor 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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"9414eedf0ab6269cf4811146b0f10de98d8f6c8087c29348b631fc45a9dd83f8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function owedStartup (cyclomatic 13, cognitive 12): owedStartup 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/daemon/src/domain/startup-orchestrator.ts"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd831c2c7f810337a2cb115b2dab72bc3ed0f356e14c0cdafc4de362a1de325"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function successorBinding (cyclomatic 13, cognitive 12): successorBinding 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/daemon/src/domain/successor-session-launcher.ts"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"772d78aa065793aa5c8cd6ed740041cbeec41969afa7750a2afed9c81479a21f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 12): (anonymous) 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/daemon/src/domain/usage-series.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6046814aabf3734b5bf6b3c5b506a33b3c65da31bda10ab812178a927b5cf0b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function application (cyclomatic 13, cognitive 12): application 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/daemon/src/domain/user-settings/settings-browser.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b5db1f2723a1fda3ab8dcaa3589588369eb455771b09d22d544a962b0e0b1c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rowToInstance (cyclomatic 13, cognitive 12): rowToInstance 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/daemon/src/domain/workflow-instance-store.ts"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bdc814c0260b7ed2e7b5bca061a4e3f3715da6e6493e8f3c6632edba21d8ac3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 12): (anonymous) 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/daemon/src/domain/workflow-runtime.ts"},"region":{"startLine":1452}}}],"partialFingerprints":{"codehealthFindingId/v1":"21346e4c287acaf88f4b67fd119f98321180384f67a0b0efa0ccba95dd827246"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 12): (anonymous) 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/daemon/src/routes/sessions.ts"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"3912f4c212f1ff29936497fe18e442d43af2185a55a4ef5f760aabf5dbda95d7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectedPermissionFacts (cyclomatic 13, cognitive 12): selectedPermissionFacts 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/daemon/src/routes/startup.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"c79f424aba7ea0f43519a3a9754f1dffc7464920b9c118d1b250888763fd5f96"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectedRuntimeHome (cyclomatic 13, cognitive 12): selectedRuntimeHome 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/daemon/src/routes/startup.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e3796f0a3ae6234ed3d444de567da0ff76d7facbd44691c0bee0fc25075d58f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restoreByRigId (cyclomatic 13, cognitive 12): restoreByRigId 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/daemon/src/routes/up.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1851062f6187d52254cfacc6daf9a1bac53214a34048af18c0a00eac3163533"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 12): (anonymous) 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/daemon/test/codex-owned-hook-trust.test.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"05734e26ad0f1d412e40de15c1539548dd153e63ed8bb2ee83d4357fe358ec5f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 12): (anonymous) 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/daemon/test/context-monitor-readiness-race.test.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58ddd818dca2d6aa2999e90fe37943794a6d3638b913bb46c1d134fca82a3a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function capturePaneContent (cyclomatic 13, cognitive 12): capturePaneContent 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/daemon/test/transport-routes.test.ts"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2bdea2be73abb4c2476bca86b0d7645ecd94c853852d1c4a20968be69ba753b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function seatEffort (cyclomatic 13, cognitive 12): seatEffort 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/tui/src/daemon-client.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81e9846328eaf83d249b42ccb3d0e613108baa75989a46427db9aa6a2b7f3da"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 12): (anonymous) 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/tui/src/startup.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"54fce1c451cb92e042c367554f233230f45dca4c1d130e2443a33e404368511d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function AgentImageReviewBody (cyclomatic 13, cognitive 12): AgentImageReviewBody 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/ui/src/components/LibraryReview.tsx"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c3a8469df94d3db210cb4fe98f60b4e2ff912cc7971a896cfb74c3f0272f357"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function AgentsBandView (cyclomatic 13, cognitive 12): AgentsBandView 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/ui/src/components/review/AgentsBandView.tsx"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"2697308d137f06f1d566dacbd1e50432b1de95acc9a48259f93fa1747b493a1b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ExpandedCard (cyclomatic 13, cognitive 12): ExpandedCard 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/ui/src/components/review/NeedsYouAccordion.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"33940d05dd014c6c635b50e8a02e322af5c4e08d9748556e86840c699872f1f1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SkillDetailPage (cyclomatic 13, cognitive 12): SkillDetailPage 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/ui/src/components/specs/SkillDetailPage.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"9327b09ccc3ecd9b6cfd2c2460d97166f4a721c75116d2845033c5ab8da6d3e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function HostBranch (cyclomatic 13, cognitive 12): HostBranch 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/ui/src/components/topology/TopologyTreeView.tsx"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8da278591b4c84ad2527d9fdd885dbd406f72687619fea780a431c64ce062f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleResources (cyclomatic 13, cognitive 11): handleResources 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/commands/ps.ts"},"region":{"startLine":2057}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1abcd6086f02c69a953f8d7c06e7cef6cc771d485c50253d9b6a394dcedcc86"}},{"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/commands/slack.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe188b0712e8a0baa9ac72c9378b06431cde014f39332e25066e59d43b31d86"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectCodexProviderAuth (cyclomatic 13, cognitive 11): selectCodexProviderAuth 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/provider-auth.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac33f9f9887901d3223f1d86817287a95ab3dca70b3613a54e674b44cdd9b8ee"}},{"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/test/export-import.test.ts"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"69364e1a9aa59203ded5698299fc0de532d4876804e682cf497f8ea2e9aa231a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function discoverResumeToken (cyclomatic 13, cognitive 11): discoverResumeToken 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/daemon/src/domain/agent-images/resume-token-discovery.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f1e29d777330f01d5bd65d31bdd574d57f47d6a7dd89b245a6e12f870ec9f14"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectCodexProviderAuth (cyclomatic 13, cognitive 11): selectCodexProviderAuth 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/daemon/src/domain/kernel-boot.ts"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"70dd0f42fb9d31ec86c54b34ff08f8ad16dbcef0534af0f8d2b617b6ec9af1c8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseRunnerPermissionRequest (cyclomatic 13, cognitive 11): parseRunnerPermissionRequest 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/daemon/src/domain/runner-permissions.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00e907b8947f84ede8aa00621c9f4429c04a789832afb2ddf0de01b4ca88e39"}},{"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/daemon/src/routes/attention.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"915089eb4f2e8e6313ac37c87a2825d278010fe789e11fac9c76b25f0a1a1c1f"}},{"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/daemon/src/routes/startup.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f77e27b31a47a41e4f2ebb9a7ef56ccfae0f20914159b608886bc3ce98c329"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 13, cognitive 11): fetch 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/daemon/test/runner-conformance-real-routes.test.ts"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5339794236f0e9c023989c4a8c1cd550bffffc17fb1a97af13a7acb98f35605"}},{"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/tui/src/attention/attention-model.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7300b7b85efe1b652b49c2089de291404904bfb98ada96408b835522cfde7b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fallbackOutcomeFromQueueItem (cyclomatic 13, cognitive 11): fallbackOutcomeFromQueueItem 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/ui/src/components/for-you/FeedCard.tsx"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd09813f9c64614ccd46e18126c4aabb1d79cd539cb40919b30ce61165a9a58"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function attentionItemToFeedCard (cyclomatic 13, cognitive 11): attentionItemToFeedCard 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/ui/src/lib/attention-feed.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee3ecb803f3b991f0d095e1f09104a8794ec5f6d9406bfc9342ca8d20f43c589"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function provenCreateRefusal (cyclomatic 13, cognitive 10): provenCreateRefusal 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/cli/src/commands/queue.ts"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e58071e7c4791eacc34531972463674893bd5744246c903e5dd419b70750af3"}},{"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/cli/src/local-daemon-owner.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"d997fb44ee2b1d7178e1791292b318bad02f97f167f7d9b84a93bc2ec4a57c86"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function execFileSync (cyclomatic 13, cognitive 10): execFileSync 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/cli/test/context-git-shallow.test.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8bd3bd9cc4d9849d8035d8e5ca05a28d9746220794a1934c3eec518744d4e0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderRole (cyclomatic 13, cognitive 10): renderRole 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/daemon/assets/plugins/openrig-core/hooks/scripts/refocus.cjs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fce014c91ecaaa715c5613aa71f9873972602f676bb55cf6d3743e0de26b45b"}},{"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/daemon/src/domain/gateway/slack/slack-subsystem.ts"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db7cdada4d8211430a6d77314af55f82b5b770c7aff92cc1dbb616068264f52"}},{"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/daemon/src/domain/health-context.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"553216b11622306149635c94e4a64683efa673c05dffaf8b809eb2bcc8eed9ad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function claudeCloseAboveStatusLine (cyclomatic 13, cognitive 10): claudeCloseAboveStatusLine 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87e7dd29062c73d179fc6643e6251fa219b57560925a437912ab9c6f3d008da"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function codexFooterSeparator (cyclomatic 13, cognitive 10): codexFooterSeparator 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":1515}}}],"partialFingerprints":{"codehealthFindingId/v1":"8903f31d2185a244a983bd6ce31110debe0a102ef0c576a8f2af504e24beb44e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function admit (cyclomatic 13, cognitive 10): admit 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/daemon/src/domain/working-liveness.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"59210752321f97a6ad021b02b767596694b601e9b07d0682a62c88fc35b10912"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function LaunchRecoveryModal (cyclomatic 13, cognitive 10): LaunchRecoveryModal 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/ui/src/components/LaunchRecoveryModal.tsx"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4edbfffe76790d3379e9cc5d0e4142b58ac5ed81998ecb8ad7405a0307135c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hydratedCardKind (cyclomatic 13, cognitive 10): hydratedCardKind 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/ui/src/components/for-you/Feed.tsx"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ce31fa8e1465aa561dba4580d663100f8567cf852128684abd75f6569295f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rollCallBucket (cyclomatic 13, cognitive 9): rollCallBucket has cyclomatic complexity 13 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/commands/ps.ts"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"6568adaeac0a95d37265703f0be626e262f33b6813f9f2dd702a66dfe765037c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function describeCheckIn (cyclomatic 13, cognitive 9): describeCheckIn has cyclomatic complexity 13 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/daemon/src/domain/connection-contract.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01c9f31eaeee0f762198c23e28cb10fd0e764f21eb92f09bdc50f8d953de484"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 9): (anonymous) has cyclomatic complexity 13 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/daemon/src/domain/gateway/slack/socket-inbound.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"2daf488830e9e7f817ffab5e8097c32e894b2c6677e7f23ce758970b872c3f14"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parkReminderDigestEntry (cyclomatic 13, cognitive 9): parkReminderDigestEntry has cyclomatic complexity 13 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":4348}}}],"partialFingerprints":{"codehealthFindingId/v1":"df53ffddcf42512d3e56efcdd5c9552efe5be9ff608ae4cfaf6d935a106a4652"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deriveRestoreAttemptReceipt (cyclomatic 13, cognitive 9): deriveRestoreAttemptReceipt has cyclomatic complexity 13 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/daemon/src/domain/restore-attempt-receipt.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad36c4ab6710d1d64f35bb1cd37e05910b7117c951c268b5ebec7607e1b5c4d5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function claudeSeatIdle (cyclomatic 13, cognitive 9): claudeSeatIdle has cyclomatic complexity 13 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":1891}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75a27d31d435e5616ddc7dc17bd2c3221bdf776992b96b64b28350eb828855c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function convergeOp (cyclomatic 13, cognitive 9): convergeOp has cyclomatic complexity 13 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/daemon/src/domain/topology-converge.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8af94c821b3840b3a279a34f75aecd785f63188a2df0ee1071f804d8bcdd973"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runBuiltIn (cyclomatic 13, cognitive 9): runBuiltIn has cyclomatic complexity 13 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/daemon/src/domain/view-projector.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"5575dfd671384c9f0d50bdb024f362c22ceb865a58ff59ddef824044fce84a7e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOrigin (cyclomatic 13, cognitive 9): parseOrigin has cyclomatic complexity 13 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/daemon/src/middleware/browser-boundary.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"179569f275b60fc7cfc16560bba03a29bef236d30805e7927d42c8682b9ae124"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stateTone (cyclomatic 13, cognitive 9): stateTone has cyclomatic complexity 13 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/ui/src/components/project/ProjectMetaPrimitives.tsx"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a725a7a0e56fddb0fc7b16c76ba79ca70ff19ca5e4085b2be9b5f5c59298f84"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 54): (anonymous) has cyclomatic complexity 12 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/daemon/test/frontmatter.test.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"5431344dce6bec62e629709f9b2b44f81f037a67991aa7f59c176a90d03cc72e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function removeObsoleteLabRefocusCommands (cyclomatic 12, cognitive 30): removeObsoleteLabRefocusCommands has cyclomatic complexity 12 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/daemon/src/domain/plugin-discovery-service.ts"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"7237145dc6511554c0ed401a80c7641d169fa55cb421a319cdc3f671868f1711"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanSkillRoots (cyclomatic 12, cognitive 29): scanSkillRoots has cyclomatic complexity 12 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/daemon/src/domain/skill-discovery.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b505cd6b159d8678eafa5e000dfcb320574f57d8fc08854b58a802f4e9bcd2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walkSliceLocations (cyclomatic 12, cognitive 29): walkSliceLocations has cyclomatic complexity 12 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/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"8040be66de6b2cabda25828630d7f6029131362f0e5160eb87019a00e6b5522c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 28): (anonymous) has cyclomatic complexity 12 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/daemon/test/terminal-remote-shell-quoting.test.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"67fe2e2bb9776d32ce115beb6ecaae9ab9496e84348085c1bfefcc6eb298ead9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function newestCodexModel (cyclomatic 12, cognitive 27): newestCodexModel has cyclomatic complexity 12 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/daemon/src/domain/model-divergence/effective-model-readers.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"26436915874fcad4bd117a98d717390d03ce2e0a4291e246453da9e780149e19"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function discoverSkillsWithProvenance (cyclomatic 12, cognitive 27): discoverSkillsWithProvenance has cyclomatic complexity 12 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/daemon/src/domain/skill-discovery.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"a204cdfb7ac3eb96b878957cda152bc440cce75d14499d451fe3723f0c040940"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function acquire (cyclomatic 12, cognitive 26): acquire has cyclomatic complexity 12 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/daemon/assets/plugins/openrig-core/hooks/scripts/refocus-state.cjs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67786e30781a6b6d372b9ea071d980fa0a404ca6a6155bc92e9894e00ecfab8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tick (cyclomatic 12, cognitive 26): tick has cyclomatic complexity 12 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/daemon/src/domain/periodic-snapshot-scheduler.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"31642af56a7d656d7a0a51aad2250953ea5538c2e1b7159f93fbd2c2e6be2b3e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanArtifactPools (cyclomatic 12, cognitive 25): scanArtifactPools has cyclomatic complexity 12 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/daemon/src/domain/policies/artifact-pool-helpers.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a54ea8692140286021a3430532f1039800ee3d130fa55a0442e6ddea2e48eb0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cleanup (cyclomatic 12, cognitive 25): cleanup has cyclomatic complexity 12 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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":1859}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe861ecbc58f9e010285771cbf284c845b3d75bc794e1d634d952e4e636bc27"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function peers (cyclomatic 12, cognitive 25): peers has cyclomatic complexity 12 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/daemon/src/domain/seat-restart-in-place.ts"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef86c162dd1054c246254ec3028bf761a76465e121e950daa846461fce0d4eff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 24): (anonymous) has cyclomatic complexity 12 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/commands/config-init-workspace.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"084715acbafcfcef18cc5e6ec94d488d2b726c5db3a019b643b78babe39a0bd5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 24): (anonymous) has cyclomatic complexity 12 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/test/send.test.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b7e6efda026a0cdae4e2210f53accbf5cf360e16b8c46666994c4f4c640280"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeStubScript (cyclomatic 12, cognitive 24): executeStubScript has cyclomatic complexity 12 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/daemon/src/adapters/stub-runner.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"18747e90c8ef85e12d50159082016ebfd68df857fa19651f55291c70521e0230"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 24): (anonymous) has cyclomatic complexity 12 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/daemon/src/domain/rigspec-codec.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c3680779c360d4c14f28c3167ef26256e31a0f48df76b31b46226205114e85a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 24): (anonymous) has cyclomatic complexity 12 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/daemon/test/settings-browser-metadata.test.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"34de7da0757d642c84a2cec8969b81c5fe38982a967c483ac421669a50f56fcc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readFrames (cyclomatic 12, cognitive 24): readFrames has cyclomatic complexity 12 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/daemon/test/view-changed-transient.test.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e92fa4c3dc5fb1df6368c047d6050cda9b34831c8dc16e759c9ce33458ee433"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function wrapContentLines (cyclomatic 12, cognitive 24): wrapContentLines has cyclomatic complexity 12 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/tui/src/render.ts"},"region":{"startLine":1813}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee1d549afbb59fac1dab6daa34946eba7317a6de0f3cb37111abd91a4dd46be4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function wrapText (cyclomatic 12, cognitive 24): wrapText has cyclomatic complexity 12 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/tui/src/scopes/scopes-model.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"f76c8e610ac175160b29e8624decba98fb2cf89915c6879e9045a7de9545b8b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildResourcePool (cyclomatic 12, cognitive 23): buildResourcePool has cyclomatic complexity 12 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/daemon/src/domain/profile-resolver.ts"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"991d23af41619b0fd0f43fad6fdfacb0c6449392fed6f637bef218b47dfc592d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function write (cyclomatic 12, cognitive 23): write has cyclomatic complexity 12 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/daemon/test/pi-runner-pane-compose.test.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eaa964c804b4512c04d438743e21c70a0ffbd11ecb095813a2accb7cab2b91c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function captureSince (cyclomatic 12, cognitive 22): captureSince 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/daemon/test/helpers/eval-rig-session.ts"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"d23c400aa536d6394e3316170371f0340a441c214ee7c21e8b507160e5ee441d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 21): (anonymous) has cyclomatic complexity 12 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/commands/preflight.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"8442d6057419b308d3e0a7fcacdccf8a097d4c7955e29536e56a4eea18b54709"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function proveSeatScope (cyclomatic 12, cognitive 21): proveSeatScope has cyclomatic complexity 12 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/daemon/src/adapters/tmux.ts"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"053a7fe9cd03e0b89f83b485ff85e510a0573276928c353bcf822c653b9757d0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function grepSync (cyclomatic 12, cognitive 21): grepSync has cyclomatic complexity 12 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/daemon/src/domain/transcript-store.ts"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd4344b08932dc83fbbba0d6347d01cee1021fe1e2695045d811a5b0cd51654"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 21): (anonymous) has cyclomatic complexity 12 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":"scripts/pr-scenarios.test.mjs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"b33d79aa0445b933b6ac2283dcd7dd3713926bfc0d94d91ddf2aed0fae7adf2e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyPending (cyclomatic 12, cognitive 20): applyPending 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/decisions/stream-consumer.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"112f1ac3cec29ea20462327c9a5de612bc564e480b2bacc8ecb79912817e1c26"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspectWorkNodeDirs (cyclomatic 12, cognitive 20): inspectWorkNodeDirs 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/daemon/src/domain/current-work.ts"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"4865d3db25544a5dca0deaa5cb04f1464e880a31b2034d874be41e5dcc10d15f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runRead (cyclomatic 12, cognitive 20): runRead 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/daemon/src/domain/provider/usage-windows.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb38259f29f48073265bc678641ccf58aa51af880d04c8e8acbdc01471944adb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function project (cyclomatic 12, cognitive 19): project 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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"d39d152e4b2db394b904b21aab8cf50c5b774b03c75442669eacc8da1544e1ac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function codexTurnOutcome (cyclomatic 12, cognitive 19): codexTurnOutcome 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/daemon/src/domain/seat-effort.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79b6861c4f5585a97f3f95156002cf16016164ceef99a721c4fd7ed8bfdb642"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readScopeIndex (cyclomatic 12, cognitive 19): readScopeIndex 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/daemon/src/domain/terminal/scope-task-terminal-view.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"34543f4433533995e0bccb41603c17281967467bb2d262e3b11340aca6d3d5a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 19): (anonymous) 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/daemon/src/routes/events.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f1afe0fdab0389fef7c9d76ab22cf993ff0dff806e93baaf5b565a7c9993b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 19): (anonymous) 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/daemon/test/terminal-provider-ride.test.ts"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"d30c9c3acf66c2f310d67a33515e16f59158a55b56ed9e550cb6f27eed4c72ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 19): (anonymous) 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/ui/src/hooks/useTopologyActivity.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"4379682464b3cadc1633c6a51df2c291fede9f9fccd75530a068c2a9f7ef45c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveOneUnpaired (cyclomatic 12, cognitive 18): resolveOneUnpaired 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/config-store.ts"},"region":{"startLine":1655}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34e7c7de885c0e04bc8b4effcce3799f978550e448a22e83a772565260750cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolve (cyclomatic 12, cognitive 18): resolve 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/daemon/src/domain/bundle-source-resolver.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b9c6214c7806a2a3c329e361d3ea9aa3050b5934bd5e8cb38c4beb3c093711"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resumedClaudeArguments (cyclomatic 12, cognitive 18): resumedClaudeArguments 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/daemon/src/domain/claude-continuation-launch.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"9127ad22fd7c5494195628cd47fd9481a6022821c39fb866632762e1098b61ae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function launchValidatedSpec (cyclomatic 12, cognitive 18): launchValidatedSpec 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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef98fb87a0caeafc3a40c89a052ca66e56a2a988bcc38ae8fa9c66b6e40db910"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveOneUnpaired (cyclomatic 12, cognitive 18): resolveOneUnpaired 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/daemon/src/domain/user-settings/settings-store.ts"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"45734db14fd1d39e652a51494623225ec47e41aeffc947c40be2ad83206aa2a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkSdlcConventionSections (cyclomatic 12, cognitive 18): checkSdlcConventionSections 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/daemon/src/domain/workspace/workspace-doctor.ts"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"18079b82dfc34ef9b7086d6a2f9acb27b3f69a0f798e409201d1a03b822caeff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walk (cyclomatic 12, cognitive 17): walk 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/daemon/src/domain/bundle-behaviour-inspect.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a0e544508de92236afa888c64c25f2258ca259733984fb652fa004037ebc7f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 17): (anonymous) 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/daemon/src/domain/codex-network-default.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ec0383eae5670b44a2e75c1dcf5be500550b8f8f792329715a1727a303c2f0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 17): (anonymous) 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":4408}}}],"partialFingerprints":{"codehealthFindingId/v1":"c53ffa14fc29db9ad653039a27d9b38c776aff4f218ac882693bc0030be98abc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function projectSliceScope (cyclomatic 12, cognitive 17): projectSliceScope 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/daemon/src/domain/scope/scope-view-projection.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef53e941d5694c7996a4442129325d0f0220aee68f1bc1418381f74beab193b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkRetainedRoutes (cyclomatic 12, cognitive 17): checkRetainedRoutes 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":3069}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c990fecc7e2a67938d325bce92c413e2c50d90a424ff0c59b791dcbd36e142"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compareConversations (cyclomatic 12, cognitive 17): compareConversations 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/daemon/src/domain/shared-conversation.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ebeefa9b0a940cfcdcb797d891f107cc8cb55d69594f0bc39798f9c9079e5ae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectRoleSeat (cyclomatic 12, cognitive 17): selectRoleSeat 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/daemon/src/domain/workflow-role-resolver.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15ec1887e390aea9b152d338d3c55e93c7a47d7f1ccb6cf0e9d4093d1889811"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 17): (anonymous) 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/daemon/src/routes/context-packs.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1f35b9662376d021a3852387e480042aebf180fdbc21599112219d225eac3b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runEvals (cyclomatic 12, cognitive 17): runEvals 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/daemon/test/helpers/eval-runner.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"5890d141fe54db437eb866a76f9c3c3db75fbe27c493c232886ab7a97dec11f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeLintWarnings (cyclomatic 12, cognitive 17): computeLintWarnings 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/ui/src/components/progress/priority-rail-rule.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"f29338eb88c15b3ea238079490fd3ad2470cd86cbea6abcaf7cd3b23fc8977bc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reconcileMissionStatus (cyclomatic 12, cognitive 17): reconcileMissionStatus 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/ui/src/lib/project-mission-state.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad25ea599048fc18c47b737c9fe3486f7fbebe90d02e221d1981f42bf1c90baa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 16): (anonymous) 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/commands/context.ts"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56195b4282cc6ab5fc905b95a6e1f5713b4d07e611a6efb063fa6cfcb022bd4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 16): (anonymous) 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/commands/host.ts"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f73622d72ad9e3f00801f05f533867f5672e2858eb9766b3c0d160bcec7783"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 16): (anonymous) 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/daemon/src/domain/codex-thread-id.ts"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"b790deee6a97c321c7b4508f482dd792c07de13997c966eb959f5cb70dad4ddc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readRowsCooperatively (cyclomatic 12, cognitive 16): readRowsCooperatively 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/daemon/src/domain/execution-candidate-reader.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb6a8eb75c852f745208071bc3663fc198cf3a2751a9d575f7ab418228b170c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function channelContext (cyclomatic 12, cognitive 16): channelContext 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/daemon/src/domain/gateway/slack/inbound-admission.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db892318d939a9e18c2a7fc1827fc75652ae555473b799ab76a149452377bea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function add (cyclomatic 12, cognitive 16): add 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/daemon/src/domain/health-context.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"d082e12a67cf977633382d7097550f3b90d0727b5386a7d57ac2d7373e926253"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readMcpServers (cyclomatic 12, cognitive 16): readMcpServers 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/daemon/src/domain/plugin-discovery-service.ts"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ab07ea25896f3eb175c1610701d56b23aa94d287c23097921b0cc29a4fda19"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordClosureOverdue (cyclomatic 12, cognitive 16): recordClosureOverdue 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":5390}}}],"partialFingerprints":{"codehealthFindingId/v1":"5abb7808a4da866c28d7b8e30547eda0ab51e70b99232b71e00e933fc48265fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function retireDirectPluginCopies (cyclomatic 12, cognitive 16): retireDirectPluginCopies 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/daemon/src/domain/skill-catalog.ts"},"region":{"startLine":1352}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc64adaf5469f02f9cc5906653dd81294f59eefab3307150a480c818353f15a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findNamedSkillsForRuntime (cyclomatic 12, cognitive 16): findNamedSkillsForRuntime 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/daemon/src/domain/skill-discovery.ts"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e842ad21f375a2faeebeaeb4f3351e2c33ef23a07ecd87f4d418905fc4c26b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function status (cyclomatic 12, cognitive 16): status 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/daemon/src/domain/terminal/terminal-service.ts"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36ab8a323cb0770d9fa8e6b751070b4db1628d0d974cfa279ea8095294875e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function enterState (cyclomatic 12, cognitive 16): enterState 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/test-system/delivery/cases/d18.mjs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7bc238e3d1c6c0629adf4ea229ef2c4c8fa134df9949d0ad2581b866d8aa15b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function helpScreen (cyclomatic 12, cognitive 16): helpScreen 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/tui/src/commands/help.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ce23cb137ef400fea3e04ee070cb223af80eef522a8578dc859f08a26c77ce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function BlockRenderer (cyclomatic 12, cognitive 16): BlockRenderer 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/ui/src/components/markdown/MarkdownViewer.tsx"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"32bf216629513c898f51768a0e262a66714b4bcacac33d0ba2aec3479116de11"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 12, cognitive 16): main 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/mirror-skills.mjs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f94d437a283e4592bd3ee9904c775364c3803f1573fdb3fd2167de4ff67b556"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addedLines (cyclomatic 12, cognitive 16): addedLines 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/portability-report.mjs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"16eda229ae158eaac66baab769338408a6477927c8e2264625b4ab8ee93b42fc"}},{"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/cli/src/commands/context.ts"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"bde289539c76e595692ac90a8364d4d121688156487d2c23006f255b06283bfd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderList (cyclomatic 12, cognitive 15): renderList 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/commands/health.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f4e44269bc715138271ca0ba1a9b9d20519ea4434a67a6b8b8b0cb4adea2af"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readHealthEvidence (cyclomatic 12, cognitive 15): readHealthEvidence 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/daemon-lifecycle.ts"},"region":{"startLine":1355}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b21cbab7ec0c7d9f6455524cb706931b8bc13e1398f6371f495a1810b8901b6"}},{"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/cli/src/mcp-server.ts"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4043c0dc511fa04ed4d42daa569d131c46826144c5a05db7a82d6f1e70029fd"}},{"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/daemon/src/domain/gateway/slack/open-asks.ts"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"82818010cd7f0bb78a587398d0c291dd8fa495de319ea54d922906f17688aab8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readProfilesUsingPlugin (cyclomatic 12, cognitive 15): readProfilesUsingPlugin 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/daemon/src/domain/plugin-discovery-service.ts"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a012ce88dbcb2de21be8bd6a9e1ca1da221fc3617282b484726c8911570f6dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gatherWorkflowExceptions (cyclomatic 12, cognitive 15): gatherWorkflowExceptions 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/daemon/src/domain/review/gather.ts"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebca66566b03fe05688935967baa38e5e9f53708a40f0b31b468d813f3503cd6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gatherGitFacts (cyclomatic 12, cognitive 15): gatherGitFacts 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/daemon/src/domain/review/gather.ts"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f99217ac3ccb07f11c06468a15f10ae659d1b93541df24faab36fa8b9ae7cd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateCheckpointHooks (cyclomatic 12, cognitive 15): validateCheckpointHooks 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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0f79e7ed52729712775c4529448e2cebe312550030c270f7f68b7d00fe0b6f"}},{"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/daemon/src/routes/env.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5fd1f4b64bafa3e39c3dcd5e393d3fc1b85679fa7c285d983c26d6cba1ee0ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createAskWithAcceptedRelayRef (cyclomatic 12, cognitive 15): createAskWithAcceptedRelayRef 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/daemon/test/gateway-relay-inbound.test.ts"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"969163f4e1ad210509d739911f8dc72e017c3d0a324106f4688498b1ebbd6bcc"}},{"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/daemon/test/relay-outbound.test.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf748ce5e5483e80f25541933f90f5611d44eaa5095b3c9451b1df70dd9cfd7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recentTargetAction (cyclomatic 12, cognitive 15): recentTargetAction 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/tui/src/render.ts"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"edbff159b3987a162827ab9f4c6bfe0d5475c8fddeccf91c69f863b63e6dbf42"}},{"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/ui/src/components/RigGraph.tsx"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"129d1e080b31e73592aa1239ac7f3acc968a53bbdb7b4b7c51c6baf27892711e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatEventPayload (cyclomatic 12, cognitive 15): formatEventPayload 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/ui/src/lib/format-event-payload.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4870ecf994abbbfc73c5d42254084669d732ea02d6725de71a7f7f0bc432794"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolvePack (cyclomatic 12, cognitive 14): resolvePack 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/commands/context.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eac5c3f1445e878a2370cacbd137897ce427b528b4b1e8f84784429b4a2e9e3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validate (cyclomatic 12, cognitive 14): validate 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/lib/reconstruction-reader.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d3cc594424de951e627d39cda444effb8c2e797d41e0d789265e5ae51c8663"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function endpoint (cyclomatic 12, cognitive 14): endpoint 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/daemon/assets/claude-hook-bridge.cjs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"470bb6369ece6c43f2b5f9d1e6a05e58076832bfc7b7daafd62cb3f41c4becd2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readProfileFingerprint (cyclomatic 12, cognitive 14): readProfileFingerprint 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/daemon/src/domain/codex-member-permissions.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3371561807d3190c5ed695a6181186ad38c400ef2915efc9d847ad97a9562a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertDaemonDown (cyclomatic 12, cognitive 14): assertDaemonDown 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/daemon/src/domain/crash-cart-discovery.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1661a77e30d6ff1e747e5630eff14b668f3c104c52c404761de5aa3303097f3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function boundHealthEvidence (cyclomatic 12, cognitive 14): boundHealthEvidence 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/daemon/src/domain/health-projection.ts"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f46e2f7c7864a5688436f99ea91029c297451c7717503476bf7e6dce8d7c6a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function poll (cyclomatic 12, cognitive 14): poll 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/daemon/src/domain/hook-bridge.ts"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"50c3bfa4402667868dd78e7cb743b0718e30e8c6015618e82355050daf96804b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function withManagedRestoreReads (cyclomatic 12, cognitive 14): withManagedRestoreReads 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/daemon/src/domain/managed-restore-read-access.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa13d89e5e1437aec853c77fbe846ae2c68bd16027fa254c60696775606cb088"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkHostInfraDeclaration (cyclomatic 12, cognitive 14): checkHostInfraDeclaration 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/daemon/src/domain/restore-check-service.ts"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"396078fc19d33cc3d0daf81c371122440dadbf05050f1905efe9f0bad3a228f1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 14): (anonymous) 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/daemon/src/domain/topology/multi-rig-launcher.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"e104cfcd54d5e48e49d4887af45f61493817493e820d3b13df7ca2b2080a448b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderExplorerRestore (cyclomatic 12, cognitive 14): renderExplorerRestore 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/daemon/src/routes/rigs.ts"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"d654d02061947ced5e581f1b2112c6424c4bbf75b052a7bff66f25aeb582866a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 14): (anonymous) 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/daemon/test/restore-orchestrator.test.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"383ce4b8cc2d1266e985a0b09ec90a0b61ccffc03ac1787567512c9862492149"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tmux (cyclomatic 12, cognitive 14): tmux 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/daemon/test/tmux-server-systemd-scope.test.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75288f539a178863ac62de9622c4159a78a2bca17f7b2c1854811af560fdaff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function open (cyclomatic 12, cognitive 14): open 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/tui/src/theme.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eea891abc5c94c80aff6b118588589f97a781822feed349f931d4c4697ccc4c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateManifest (cyclomatic 12, cognitive 13): validateManifest 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/cli/src/commands/plugin.ts"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"c729374bd4a8daa07b5ee20ca6e31fc606dd8dcd027b731e47de6cdef0fc510d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 13): (anonymous) 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/cli/src/commands/usage.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"953dc43cf41a755c65ae9e25baa23f5831ff5115bb9f63e8d8a6af3385fbcfb8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 13): (anonymous) 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/cli/src/commands/workflow.ts"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67cc2af12f71976d65afcd8e22424b79b07b58ac35ccb081f88f8e9ed6e4ea5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shapeProblem (cyclomatic 12, cognitive 13): shapeProblem 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/cli/src/lib/bundle-configuration.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"191c3388b3fe9d4c0c4db8b03fbe3409f76b1dbb917f24b94385ac8963f5d5ba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkReady (cyclomatic 12, cognitive 13): checkReady 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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d926324789e1a83d927b8e914069e99f1852022c83c30055013b8165fb7475"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkTcp (cyclomatic 12, cognitive 13): checkTcp 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/daemon/src/adapters/compose-services-adapter.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e92465d2404f761b5d90b8f4ef2035eb7e730d923a2bca434bec3bbf9d8dd21"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 13): (anonymous) 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/daemon/src/domain/environment-platform.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"41efb24eaf4513fb508cdaec6a36018af96333aa852416a4e1c643fcf79c7915"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 13): (anonymous) 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/daemon/src/domain/gateway/slack/socket-inbound.ts"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07dae133ff4f84487d3daccd6fe26f81c034f7fdf79384de2f5e29e972bde0d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function watchProofSources (cyclomatic 12, cognitive 13): watchProofSources 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/daemon/src/domain/proof/source-watch.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"57de9feb378d0decd5feb7b42391f21d7809e43438fbc61cd2bfecb3202767aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordedProcessStillRunning (cyclomatic 12, cognitive 13): recordedProcessStillRunning 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/daemon/src/domain/reconciler.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"416704dce9543d320d8706a783a9188fce849d6fe7883ad8ca38b571a015b385"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rename (cyclomatic 12, cognitive 13): rename 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/daemon/src/domain/spec-library-service.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd8f25f3a7e69060774bcc6c44925a6695c0b4fa763128a2fd9e6a0feb5a304"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applySelectedHistory (cyclomatic 12, cognitive 13): applySelectedHistory 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/daemon/src/routes/startup.ts"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7143be163c1f0af32f756efc271d5441069a7209665bd8ca4b29dafce214597"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 13): (anonymous) 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/daemon/src/routes/whoami.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"b664476f7d7a689e52a5e32634d8c8f1ba752e6e820bcef56ce79ec6e50a7b98"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 13): (anonymous) 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/daemon/src/routes/workspace.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf4d807a262b3357cd64c6e662c59a8181d986084fd5c5d4ca5e1512108d723c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fixture (cyclomatic 12, cognitive 13): fixture 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/daemon/test/claude-bootstrap-config-home.test.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d657f79256dfbbc0b65d5484dbacb022abef9a8da66c5360df319c3d7314667f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 13): (anonymous) 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/daemon/test/draft-aware-delivery.test.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"49bc64fcd3afa345a643f345396b813ce6178916288b77d37e60eae55823a6cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 13): (anonymous) 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/daemon/test/seat-launch-environment.test.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"d175809d9fa57e64a63beb580d6a08703b47c3c340d8e9165ece24032dae390c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 13): (anonymous) 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/daemon/test/views-routes.test.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a33472e81df65637f18f7a935cd3d4e7e3b45b1cfca52d88b1e12cfa3275c66"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fleetSliceDetail (cyclomatic 12, cognitive 13): fleetSliceDetail 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/tui/src/daemon-client.ts"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99e5aecfe2315712c1ea1d55687b71fcfda9839366e3d3a45caa36b4e33ae2b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 13): (anonymous) 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/tui/src/reading.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9992180d90268c6515349118576867d7526538870df503f1ebd22427c9c403"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function specSourceLines (cyclomatic 12, cognitive 13): specSourceLines 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/tui/src/render.ts"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"61febacc24c8d4f7bb1c530393fc602ae16385f3a636df6c82e5c4abe6af4e19"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function TopologyTerminalView (cyclomatic 12, cognitive 13): TopologyTerminalView 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/ui/src/components/topology/TopologyTerminalView.tsx"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ceedce6d6421b31dfe2b9b883572ff486a4664f077c3c37ad5799fe0c03276"}},{"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":"packages/cli/src/commands/acp.ts"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b015e9f310a8fe3c151a2dee473c460fa0f69333e01ed1ba3cdd1cd9ddaf7df"}},{"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":"packages/cli/src/commands/gateway.ts"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"8413ef76004c38806ea20ea8483eddc1564e7d8b34c44e03e34ca14a2eacc64c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveQueueBody (cyclomatic 12, cognitive 12): resolveQueueBody 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/commands/queue.ts"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a2cef874a18167f5f0ea504a825c601fffd7ddd472a760468848d0ee9aa8c2"}},{"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":"packages/cli/src/commands/queue.ts"},"region":{"startLine":1937}}}],"partialFingerprints":{"codehealthFindingId/v1":"3264eeb42631215ad91ad8390a9bf0c372dd77000419a87720f4edb0bf50f6e6"}},{"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":"packages/cli/src/commands/queue.ts"},"region":{"startLine":2044}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bde69f7a9afadb5f573192880a93ece996e3fa5def97b9dd711edae1bbc59f6"}},{"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":"packages/cli/src/commands/terminal.ts"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"35fd3bb42b6042f1cd8f69a436436484dc42116db402ffe4b5f0b92e6ba8feaa"}},{"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":"packages/cli/src/mcp-server.ts"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"5750bb39434b9ffff202ace9c5454c8f28b7042c6e220a0608c296955cae8fee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runRemoteHttpOp (cyclomatic 12, cognitive 12): runRemoteHttpOp 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/remote-host-ops.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced274f137d47f16abd3fae0e7c30eff3fa942825072b03ad722d18ad0e9f83f"}},{"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":"packages/cli/test/whoami.test.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ec9eed159291d7e9a75a06ffdb69e7a4babb1469e7435d1e19712f4a8db15f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onResize (cyclomatic 12, cognitive 12): onResize 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb7a255110aba756d65bee8ccfcc913d9aa9158f49df3a2a22e6d0b8a79c15d"}},{"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":"packages/daemon/src/domain/classification-attempts.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"7445e0f98d734a895e88946ff8d5dcb2b07d1c4b8984f45107370397504fe893"}},{"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":"packages/daemon/src/domain/gateway/relay-outbound.ts"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"727960cf6cd6b9dc484d54ba47162711cae25c4927d2d5016bd7eb552b8f1f34"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onclose (cyclomatic 12, cognitive 12): onclose 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/daemon/src/domain/gateway/slack/socket-inbound.ts"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f70a297906c4e222af30dfd29c1ce4e2103b7018fc26a58224e062e2baeadf0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deriveNodeLifecycleState (cyclomatic 12, cognitive 12): deriveNodeLifecycleState 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/daemon/src/domain/node-inventory.ts"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"d97b91b20d6010446df1fac28abc644bf2463194dcadee7b6b7760e3c75180fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function claudeAuthReaderEnv (cyclomatic 12, cognitive 12): claudeAuthReaderEnv 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/daemon/src/domain/provider/claude-auth-status-reader.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"a36490393a3dfda00ba0a472afafac2daca7e61c7e023dc5bc3f492adc69af18"}},{"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":"packages/daemon/src/domain/review/gather.ts"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4068f63e65546c705e5e491a57be547dbfd1b2d61d0cd8cd58adc9e2820b368"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stopSeat (cyclomatic 12, cognitive 12): stopSeat 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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":1202}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4972bba4a007e341407998809d57ccc89eebafb6ffec0dd4abed7c80268d2bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readAccountLine (cyclomatic 12, cognitive 12): readAccountLine 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/daemon/src/domain/seat-restart-in-place.ts"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98ce29eb54de5083e72886c651bbaccce4d5e4c16309347fcbab65326529e28"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function boundSessionNameProblem (cyclomatic 12, cognitive 12): boundSessionNameProblem 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/daemon/src/domain/session-name.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4cce8a88980e8e9ad3e45bf1ebb7ac1dbba3670dcbfeb3b9218ea39361bba2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function promptAnswerStaged (cyclomatic 12, cognitive 12): promptAnswerStaged 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"888fb3b200a8e88f66ee9c6182996aa8a4c54ace8583ed873088b17265b16865"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function providerChargeView (cyclomatic 12, cognitive 12): providerChargeView 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/daemon/src/domain/usage-series.ts"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"36641b19f3c132a07750a6cc1fadd6acb257858dac6ddc4ccf77b1c3aa5cfc74"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeRuntimeContext (cyclomatic 12, cognitive 12): computeRuntimeContext 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/daemon/src/domain/whoami-service.ts"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"6606aa24e050480e17b8e91eb046b5f668736435b143845fdcb0911373164c92"}},{"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":"packages/daemon/src/routes/health.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"45454d5a4b2bb789cf16d6ef722a305bba7c54b6ed1d433c78f273e9b90ca372"}},{"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":"packages/daemon/src/routes/hook-bridge.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a62c8000f9c1b03093813584c12698b20f7b351f59a915dfdaab90ec12b6275"}},{"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":"packages/daemon/src/routes/queue.ts"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"c61766bffc01fcf534373d03424aedf84e41af912c7a8b78725665e20e90d160"}},{"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":"packages/daemon/src/routes/rigspec.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e28e7ece0ff2031e7af9ab5d352fd0f718020ca56d6cbf08d0471956aeb235"}},{"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":"packages/daemon/src/routes/skills.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72126d03535213149091bee25fc8148900aa872f5413023595f68ba6b545363"}},{"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":"packages/daemon/test/startup-orchestrator.test.ts"},"region":{"startLine":1864}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b4fb7ec58138856bd024e08616e6974ca40e451f00a2eb5072848aec6c6944"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function probeCrashCart (cyclomatic 12, cognitive 12): probeCrashCart 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/tui/src/crash-cart/from-emit.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49c7665c8d17941abf826c76df92bd00d50a8a16ceb7b781fe23ce2b4604138"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onError (cyclomatic 12, cognitive 12): onError 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/ui/src/components/for-you/FeedCardQuestionAsk.tsx"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b8f3aa007116768d8914b4855f92e3e90e1941e4ead857d44f47e3a3647b2b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function useMissionProgressStatus (cyclomatic 12, cognitive 12): useMissionProgressStatus 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/ui/src/hooks/useMissionProgressStatus.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1ae17e05bff1519712b0fddc7f6eac11a7fc498d39147e744b815c68be77d7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readCmuxSocketControlModeFromText (cyclomatic 12, cognitive 11): readCmuxSocketControlModeFromText 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/cmux-config.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4efe3e8b5df7116184005115b1cb0753f0db621fbb17141b50b912e60c9803e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reconcileRun (cyclomatic 12, cognitive 11): reconcileRun 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/commands/exec.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2365c5892bc9306a1c3968347ec99af3276a15495db82ebb4acb1074d09d67d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function printClaudeAutoMode (cyclomatic 12, cognitive 11): printClaudeAutoMode 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/commands/seat.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e89ebda567ad7245a2fb38fdc9f65d3273b937ef3414e25819a84eaae152a83"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) 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/commands/watchdog.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"c281decb0029df6cd693e2c8b8e807f8ac6d5c57bf72e94503e9e3336beae852"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function boundPeers (cyclomatic 12, cognitive 11): boundPeers 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/commands/whoami.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0e912a493ef1108b79d1c869e6ddf2ba54d9aa47b772b4400b9a43dc5ccf10"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runCrossHostCommand (cyclomatic 12, cognitive 11): runCrossHostCommand 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/cross-host-executor.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"febef5c5eb4f87243f0e2bfa714e22a201616f8b92ede8d18ec0638ac44f5566"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function projectMissionsRoot (cyclomatic 12, cognitive 11): projectMissionsRoot 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/lib/scope/scope-fs.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d70381da1e132e057a45dc13198efc3a7f1560dfff9bace0ec1639a57beeea1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exec (cyclomatic 12, cognitive 11): exec 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/test/setup.test.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"77fa52953ceb8bd15cb4603140b7fe60271eb54fdfbc4268e32cc0b8187ead32"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 12, cognitive 11): constructor 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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa9987d909cfee9fd7c70e2961f630a21c936e6a8ca80afe77ec1f0d8df37050"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeWorkspaceRow (cyclomatic 12, cognitive 11): normalizeWorkspaceRow 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/daemon/src/adapters/cmux-transport.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa01d431dc413a06980c12de72367222fa5db4013032cdcd743dd0a0aeb8455"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function daemonDatabaseWarnings (cyclomatic 12, cognitive 11): daemonDatabaseWarnings 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/daemon/src/daemon-db-path.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"428e4de36003df36ad85d9588932f9315e38837745ec9e59e34558109baca62e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordConsumption (cyclomatic 12, cognitive 11): recordConsumption 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/daemon/src/domain/agent-images/agent-image-library-service.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f61d836953305330c7caadc2c4d842df6925d54097c9f7e4aa601de13d8e5a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function captureClaudeContinuation (cyclomatic 12, cognitive 11): captureClaudeContinuation 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/daemon/src/domain/claude-continuation-launch.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"4139003673926377dd9d63fc3974877204c49950ce8216490047959220d162d4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function apply (cyclomatic 12, cognitive 11): apply 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/daemon/src/domain/gateway/human-operating-modes.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab92a735600f74e3ba5743015b2ad0cc9521eb15a50dd2bfeadcddbac80b7516"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function acknowledge (cyclomatic 12, cognitive 11): acknowledge 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/daemon/src/domain/gateway/slack/inbound.ts"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f53642d6085fde18bc6e78b528093f8eac39218393f4d8b32e38d650c38278"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function projectionIndeterminateReason (cyclomatic 12, cognitive 11): projectionIndeterminateReason 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/daemon/src/domain/health-projection.ts"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa044be4defc8e74edd5990cabbef02eb1b17b735263d769d8a74fdebcdde49"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveMemberConnection (cyclomatic 12, cognitive 11): resolveMemberConnection 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/daemon/src/domain/member-connection.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"0344ecc11e8453175ffdf7df10b472f3fc1304c194e624ca0461a8f604c09b1f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveCodexResumeResolution (cyclomatic 12, cognitive 11): resolveCodexResumeResolution 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/daemon/src/domain/node-inventory.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"c076c0d98e0dddbcf17b85470452bcd988ffd297dfb48e4ff00303c941ac5308"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function install (cyclomatic 12, cognitive 11): install 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/daemon/src/domain/package-install-service.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"6794e5075a117860e564b02841a195d06d012991ef59dbaf755d5fbf25d60a16"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function procRow (cyclomatic 12, cognitive 11): procRow 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/daemon/src/domain/process-table.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4de78e6586dbcde1f547c5b71d51724a5cd76cb892e7eb83947261a09c92a4a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":4460}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a2c64c228942bda75b98b7956e8f5ac39761cf9d689bc374d220cb80fd83501"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function archiveAgedTerminalTransitions (cyclomatic 12, cognitive 11): archiveAgedTerminalTransitions 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/daemon/src/domain/queue-retention.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb6eec3655239b5392b8926ab5dcb09c75adbf8ec81eb71970ac7ea6aab0a59c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 12, cognitive 11): constructor 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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ecbd5d45248eea02e0ca5e2fa8e2a2d88637cb31394fb354aab2718ce03cb22"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) 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/daemon/src/domain/review/compose.ts"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c4fb0cb0ec22846ee2bc0877da5ecddccd2e12bf7c20245e026a74a83ef22b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function forHealth (cyclomatic 12, cognitive 11): forHealth 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/daemon/src/domain/rig-mode/operating-posture.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"758ac2b5e9832f55da451229a2d5aa326289b958b44debcd72d16f80ef998ddc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) 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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"e42edce3668780c702390556732bea7fa399c7538d5e8c9d1f40e7ff17aa96e3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function measureTrialAgreement (cyclomatic 12, cognitive 11): measureTrialAgreement 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/daemon/src/domain/seat-activity-service.ts"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28efe2ace388b8192cea9ce4be73189d0b0e782b0287db0c906a94cd3134672"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveFreshLaunch (cyclomatic 12, cognitive 11): resolveFreshLaunch 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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":1433}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecea5d952100870411bea048c9ffeaa467a98466f990242528fac483f9e0f27d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function permissionStatus (cyclomatic 12, cognitive 11): permissionStatus 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/daemon/src/domain/seat-status-service.ts"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cffb9d125ec4534aa463b8bf84423079730cfe58db734d66de3d52963d3b049"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function admitNative (cyclomatic 12, cognitive 11): admitNative 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":3032}}}],"partialFingerprints":{"codehealthFindingId/v1":"16784ab41ad92e4ecd7fb1e2d5fd646a5b6983fb11d61a0f5f2f3b90e3321f30"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyStartupProof (cyclomatic 12, cognitive 11): verifyStartupProof 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/daemon/src/domain/startup-proof.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"05749eb91a592c48b38a46496d81a6525265414feaa1893ad4a442189374c94c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classify (cyclomatic 12, cognitive 11): classify 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/daemon/src/domain/terminal/rex-transport.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9966f5a44c97f306dbfe3b5e4519d721fef3e7f82355198ea399925016e887d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ensureViewer (cyclomatic 12, cognitive 11): ensureViewer 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/daemon/src/domain/terminal/terminal-service.ts"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ab924e18776859febbde74e097f6c5523d7eb58733696d132785e70d69de0d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function activityPrincipal (cyclomatic 12, cognitive 11): activityPrincipal 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/daemon/src/routes/activity.ts"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a776d941a947fb8f9533d63ec17eaece98050d5b5081e379375dbb2e575975a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveForkSourceNode (cyclomatic 12, cognitive 11): resolveForkSourceNode 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/daemon/src/routes/agent-images.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"e99cbc9afcb8b1f2c59c24a8265c9137f49b3c1fd658f1d25ec4d6ab0937aed5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function provenanceFromRequestBody (cyclomatic 12, cognitive 11): provenanceFromRequestBody 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/daemon/src/routes/bundles.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1dac1e9d657bf7b7eeadafb65b69b50d0d061f5b1ea95debcc3637a9cf59e3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) 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/daemon/src/routes/hosts.ts"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc88ef56783838122866cf2839428a88d1dd5a49df8e7fe9511ed100a283e4ac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) 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/daemon/src/routes/rigs.ts"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9920ded7b418234a938a510910df3e431f525fde15b13dc42a4bdb4f035eef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) 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/daemon/test/bundle-behaviour.test.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cac40c3637b7edfe6f943ccc67d2edaf6b0322ec2e0eaacd20fb9b14d0b2f30"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) 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/daemon/test/claude-auto-startup.test.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a5b9a9d594df6cf0060e5976564b4a84170385741ab8ccebe915f4ea399e1d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) 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/daemon/test/claude-mcp-launch.test.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee70d024b36f311df5508559ac29ac9c1b579570cd8797647838f0b0928a63a8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function makeEntry (cyclomatic 12, cognitive 11): makeEntry 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/daemon/test/context-pack-bundle-assembler.test.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4059db38f1e03f0c2359c46ef083534683f76358931ba1b8bc576b937f46dd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareHermeticEnv (cyclomatic 12, cognitive 11): prepareHermeticEnv 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/daemon/test/helpers/hermetic-env.ts"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"1adfca40522524f1284ac5ae31e30130ae181156e107e8fc7205dc04c07acc48"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createTestApp (cyclomatic 12, cognitive 11): createTestApp 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/daemon/test/helpers/test-app.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"be24ae6f36bf236e903e0fa8ff97a3c68909abb01c7473c7eb374b5d22a07f69"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readCodex (cyclomatic 12, cognitive 11): readCodex 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/daemon/test/helpers/usage-hosts-harness.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b695bba671a1a4d09a0cff5b40b4abc72f70df9b58282a5fc541137397e266b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function relaunchInPane (cyclomatic 12, cognitive 11): relaunchInPane 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/daemon/test/provider-switch-claude-seat.test.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f07c0f8ab0d37a2aa2a73e941fd210afe23342c07ce44ee38907662e67d080"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rig (cyclomatic 12, cognitive 11): rig 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/test-system/delivery/harness/world.mjs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3f3b4ae1f3b494bb411acabd11ff667193dc32d6c2af0dc5d2737a46d81050"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dependsOn (cyclomatic 12, cognitive 11): dependsOn 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/tui/src/attention/source-continuity.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"819186ebab062c949686a6c82e428a3842f6fabca549a2a1468c94e9380f9f63"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function configCategory (cyclomatic 12, cognitive 11): configCategory 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/tui/src/config/config-model.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c6928f80094620ce8e62d55fcb912e7723db7035001bab988133af93583fd1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function usageCost (cyclomatic 12, cognitive 11): usageCost 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/tui/src/daemon-client.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf1624874da5bf90f735445e40be3ccda1998beb1d87f22ef0bed75ae87f4ea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recentLines (cyclomatic 12, cognitive 11): recentLines 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/tui/src/render.ts"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"75bddb2b145cb994dcb31932a135c1da06f5e3cadc4a5d52d08c5c27542af664"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) 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/tui/test/blocker-enrichment.test.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec142a8ccafa58894546650f5af11e2ed2e19990a549e7d2fd56d729d7da349"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function AgentSpecDisplay (cyclomatic 12, cognitive 11): AgentSpecDisplay 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/ui/src/components/AgentSpecDisplay.tsx"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"a35635a2a9f2fd8a573f947c4a90d5a45c9869324369e96685f652d09273f6c6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function PackageDetail (cyclomatic 12, cognitive 11): PackageDetail 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/ui/src/components/PackageDetail.tsx"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aac2b9ce1e2da47e3d6b73b0cb3837cec4edda556eab66ede14a412e9d80105"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deriveEnvState (cyclomatic 12, cognitive 11): deriveEnvState 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/ui/src/components/RigEnvPanel.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8193e2e9df746b8da0552f3be4d53695e80de029322615bcf9f503ae54fd50"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SnapshotPanel (cyclomatic 12, cognitive 11): SnapshotPanel 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/ui/src/components/SnapshotPanel.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"21aadd5ff9951d497fe8acf44a8082e04d9f79733f399be8222ebd1a76a1dd48"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findPluginOnlyPublicSkillDirs (cyclomatic 12, cognitive 11): findPluginOnlyPublicSkillDirs 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":"scripts/generate-context-packs.mjs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c41b7eac267d4a1df6dc9bf91e426d43818c0d3aa7b27c899fb317cded7959d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildWritableHomeCheck (cyclomatic 12, cognitive 10): buildWritableHomeCheck 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/system-preflight.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f0896bf9c6bd322469c7a43edd4a214ebcf3d6e95428a7a26a44dc92e4f6b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveThreadTs (cyclomatic 12, cognitive 10): resolveThreadTs 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/daemon/src/domain/gateway/slack/slack-subsystem.ts"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82f5736ca650f7a289927d9f660255f09ddf37afcd252f8c1952ecd55a40682"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function looksLikeClaudeResumeSelectionPrompt (cyclomatic 12, cognitive 10): looksLikeClaudeResumeSelectionPrompt 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/daemon/src/domain/native-resume-probe.ts"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd1b05600721073f5a5f0051500aaf25ea83621106e09f70092f84aef8a0b93"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applicableVerdict (cyclomatic 12, cognitive 10): applicableVerdict 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/daemon/src/domain/node-inventory.ts"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"98615e21be91548c4c0c1772b5e6933e0bc47c6128696d83ffc14bdf47edf82a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordRelayOwnerNotificationAccepted (cyclomatic 12, cognitive 10): recordRelayOwnerNotificationAccepted 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":4859}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c9d9d79198a2297b3a32d7afa48bc4fe4c853d26ab7aa76d1264966546a1819"}},{"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/daemon/src/domain/queue-stuck-sweep.ts"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"187c220a15e9f43c65f1a1ae2d643640ea3856e9e0b7dae3a60c5c523388f91b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stopAutomaticOccupant (cyclomatic 12, cognitive 10): stopAutomaticOccupant 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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9cf399ce7883f9d7e37a1cc448df443824bedbae270fced83ee8214b02d4f5"}},{"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/daemon/src/domain/resume-metadata-refresher.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"7939470c52f5a45faaf09f8d6ea96e9f27266b764a097636b32969bc6c58afe6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compareFleetRows (cyclomatic 12, cognitive 10): compareFleetRows 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/daemon/src/domain/review/fleet-compose.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16c10106d07eb1160926c4d1799270e2fa31433f75da73840ffb26ad307c2e4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setBinding (cyclomatic 12, cognitive 10): setBinding 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/daemon/src/domain/rig-mode/rig-mode-store.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"539eea0098765132712dd6ac2f5f75176e1f71faaaeb129a88d4ec1d3edca0ad"}},{"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/daemon/src/domain/rig-repository.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"98fc06ca21fecb7d29c054b80b2a0c0cfdeedd579028f5272ddf33e038cdfe62"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function completeClaudeToolBatch (cyclomatic 12, cognitive 10): completeClaudeToolBatch 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/daemon/src/domain/seat-activity-service.ts"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d46a00ffb562bf9f7e933afe4833daa420aaa49656ab068c8936ae93b982034"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setCodexProfile (cyclomatic 12, cognitive 10): setCodexProfile 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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ba6f463d391176cf09256c44289be08e92645582e4f918cc95bed35404cc8f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function alreadyClosedReplay (cyclomatic 12, cognitive 10): alreadyClosedReplay 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/daemon/src/domain/workflow-projector.ts"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b7d93ded85d801c8d306f4549a2299fef3f7c290ee79bb55ba1e6a5c6dbe2e6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function projectEntry (cyclomatic 12, cognitive 10): projectEntry 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/daemon/src/domain/workspace/project-read.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f50250fbf93a0229a827245785500135e7012ef53cfe369a198e36c458195e"}},{"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/daemon/src/routes/scopes.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"665dd2cacaa910383e0773c6c537f411ad2b4ce89f978d018e6c9e4a32236420"}},{"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/daemon/src/routes/telemetry.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"1734211b649d1461acc86acefc7f983edc4f401410b43332532bc9dcb27c5f42"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function statusForOpen (cyclomatic 12, cognitive 10): statusForOpen 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/daemon/src/routes/terminal.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"39dde00620e79112caaa1bc0991239b1b888403c8f2fc9b5a4a7087f742e9e73"}},{"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/daemon/test/helpers/usage-hosts-harness.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"931bde84c0349b9e7388828ca0145d46802f718cc31e30086f190f5f871039de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadScript (cyclomatic 12, cognitive 10): loadScript 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/test-system/delivery/stand-ins/core.mjs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"17399e5fe3e56108d4ff8061b79debd21a68766fde190f327cd18ac8d47bec27"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 9): (anonymous) 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/cli/src/commands/slack.ts"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4917d3fb12b1dc6fd929a16ab9d81782cf97ff1d3b77afab73e78f13da18c1e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 9): (anonymous) 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/cli/src/decisions/stream-consumer.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2cf2c1e4363d3e150ae5c462e4fdd7f79adf49bad404e1060c571d36e22a094"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertTreeSnapshot (cyclomatic 12, cognitive 9): assertTreeSnapshot 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/daemon/specs/agents/shared/skills/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"07659ded482c428476937c45c719bd41f84474502a436cda48a6bdd4266ff767"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 9): (anonymous) 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/daemon/src/domain/continuity-policy-materializer.ts"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"a176dba1a66c317dccdc27151a9ffcdf8caecaa4a03a8f447a97bcbd1558c58e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 9): (anonymous) 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/daemon/src/domain/existing-rig-restore.ts"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"2941d5b2d82b673adc5f5d9d109183983c741d754263637fdd951f39e04cd083"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 9): (anonymous) 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/daemon/src/domain/outbox-handler.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce57bd07f8bd4c24938506e6b2efcc61d9fe4ab18cf14391041032ae62b67c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function usageLevel (cyclomatic 12, cognitive 9): usageLevel 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/daemon/src/domain/provider/usage-windows.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ac648f1b8d3e7597dac06ce90cc3542570b9dcfacb93d060f9c07ca5c81f15"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 9): (anonymous) 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/daemon/src/domain/queue-stuck-sweep.ts"},"region":{"startLine":1404}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0965e085394aaa89f998c5387b41912cef6952161b68b90902f1fb8dc6521a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function qualifiesAsRecent (cyclomatic 12, cognitive 9): qualifiesAsRecent 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/daemon/src/domain/queue-transition-log.ts"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32bcbcfbc2a2798ddc2e7908a7c79be56fa001bd32e844e0386c15f019ee0cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderFrozenSliceHtml (cyclomatic 12, cognitive 9): renderFrozenSliceHtml 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/daemon/src/domain/review/freeze.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f21edc5b35e0ffea8302af326d66f5b6849a521a3d6829f46c9e03dc9579fef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveWakeTarget (cyclomatic 12, cognitive 9): resolveWakeTarget 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/daemon/src/domain/wake-resolver.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d406de11bbd840d80a357ab582ee8d5be26d7be6d03fcb78d522bdab803bfd6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function outcomeSentence (cyclomatic 12, cognitive 9): outcomeSentence 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/ui/src/components/for-you/FeedCard.tsx"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"b64a3f093451e806a5a3f47068093664ac34598c8f0b180f2008e2753bddf659"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function KindFrame (cyclomatic 12, cognitive 9): KindFrame 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/ui/src/components/markdown/kind-frame.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fdd64d9e0abcf8506822489c30f169f96c142a8119596faa7d079bb9e0101de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ArtifactsNavigator (cyclomatic 12, cognitive 9): ArtifactsNavigator 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/ui/src/components/project/ArtifactsNavigator.tsx"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ddbcc68bd9e4bb2032d4baaccd908ee178a5dd5bf6ebb78928b7925aa1ad1bc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function queueKind (cyclomatic 12, cognitive 9): queueKind 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/ui/src/lib/feed-classifier.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e862487fdd09d46e87bf6e89b4dd5dcb4611876c6fc65b7d671e0acbbf54771"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertTreeSnapshot (cyclomatic 12, cognitive 9): assertTreeSnapshot 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":"skills/_canonical/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"e91bf7f7248fdaf9f7c48c9f2bc581f03011b637ed886b8cfa26bc839eb04bf5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 26): (anonymous) 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/daemon/src/routes/bundles.ts"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eade9a626e6ca815d07cd39051e3415707d5cc08276a0f982b7067e0f003c55"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function boldText (cyclomatic 11, cognitive 25): boldText has cyclomatic complexity 11 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/tui/test/pulse-live.test.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e56737ce9703dbb695e59b7a5be568f47f56c56491ece7c80fe7174832ff0f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderTranscript (cyclomatic 11, cognitive 24): renderTranscript has cyclomatic complexity 11 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/commands/transcript.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"9faf97d71c26645ec89cd995cb39653c70ec51dd2222852cc82932edbaf1e4ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 23): (anonymous) 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/daemon/test/bundle-behaviour.test.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e8df23bea9506110338573c782ddc1736dc3ca0bcff0b0f6ea93635e816f29c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runPoll (cyclomatic 11, cognitive 22): runPoll has cyclomatic complexity 11 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/daemon/src/domain/context-monitor.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9031feb093d85ffc2befb409f84d6f2b78ead5e55991f0845979325abfd9a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 22): (anonymous) has cyclomatic complexity 11 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/daemon/test/packages-routes.test.ts"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72945cb53bddc64c0acda6e855af82c5490c9fce636071edf4b7585b26864fc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 22): (anonymous) has cyclomatic complexity 11 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":"scripts/pr-scenarios.test.mjs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3183b9daf1611309648f9655dcbd3b3dd37e29813cee1203bf30f7b7eb90119"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function healthSelectedContext (cyclomatic 11, cognitive 21): healthSelectedContext 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/daemon/src/domain/health-context.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4add05dcc3fb1c3b7b07c41ee7372481e7cf89c6c24731e94d27e37c63a8b92"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reportResumeCommands (cyclomatic 11, cognitive 21): reportResumeCommands 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/daemon/src/domain/terminal/herdr-adapter.ts"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"130dccb56676e0ce1d50fcd93c6574d59a309b69bf5aa880cc6c30344e4bcd26"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runFanOutWhoami (cyclomatic 11, cognitive 20): runFanOutWhoami has cyclomatic complexity 11 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/commands/whoami.ts"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"43cde4b6dd2d37bf473343742223b057807cab5fa871fa2702ebc909a95d2102"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function substitutions (cyclomatic 11, cognitive 20): substitutions has cyclomatic complexity 11 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/daemon/assets/claude-team-permissions.cjs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"495e4a53805a5aa06be5164b90115a7d95fb88cc783d0539be503d123a47136b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 20): (anonymous) has cyclomatic complexity 11 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/tui/test/execution-view.test.ts"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"b277ab3e8b40425f9a533d897d3b4324c8164219ce98876dc89dfb149409f20b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 19): (anonymous) 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/commands/package.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"9553481a454a6fc883115b2c8ba8491483b28729460fc510e99a87c81b885c89"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkGitHubBundleRefs (cyclomatic 11, cognitive 19): checkGitHubBundleRefs 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/lib/bundle-source.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0189e7e53f0877370a70ee960d84b7e8179d36c4acc5dc0d64d12b2ab8fbd1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 19): (anonymous) 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/test/reconcile-session.test.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd3fd09d4b982585f9c7c13dcb5e7b842fbffe61a548bf920e9fb93f2219315"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rekeyCodexHookStateText (cyclomatic 11, cognitive 19): rekeyCodexHookStateText 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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":2638}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed084946cc63d1a36fe0c0e68428eb99d3026136ecaaa82f559ebfec7619055a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function projectEntry (cyclomatic 11, cognitive 19): projectEntry 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/daemon/src/adapters/pi-runtime-adapter.ts"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a668e40f83c55a40c46424a8f5f2c9d3bb7266dbc0fdf57a80c3cc2a8770847"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 19): (anonymous) 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/daemon/src/domain/outbox-handler.ts"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a140a1c5508356964e6bb48a2ca968844149577688ecd7e8f107c65cf9071de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findCredential (cyclomatic 11, cognitive 19): findCredential 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/daemon/src/domain/provider/subscription-move-report.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d276d8979efaa0cec31f3bcbdbc841f28c88112a7bde511e9270788d6dccfc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyRunningSessions (cyclomatic 11, cognitive 19): classifyRunningSessions 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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"e457913971ae6af0eb0f0fee5dcc50c7299f3359c7ce57c13659e22b6e0cb341"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function planSkillSources (cyclomatic 11, cognitive 19): planSkillSources 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":"scripts/mirror-skills.mjs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"6424e73176c1589f8e1faf84125f410c632ebacc4f3451aa103e08c61afe9d00"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderReport (cyclomatic 11, cognitive 19): renderReport 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":"scripts/portability-report.mjs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cab3a7902566e193cf1f824392d85adfb34d07cb81684a50368c87f5b5960d5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 18): (anonymous) 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":"packages/cli/src/commands/seat.ts"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b32f97c441f3c68b2797e9ca749fe16f8712a5020b5dc5f1ed6c78836a6b15"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 18): (anonymous) 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":"packages/cli/src/commands/seat.ts"},"region":{"startLine":1588}}}],"partialFingerprints":{"codehealthFindingId/v1":"5678975a15e6e7aeac59f89812b37fc1c604e5752c5ac627f72184280cac5b57"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanForCredentials (cyclomatic 11, cognitive 18): scanForCredentials 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":"packages/daemon/src/domain/agent-starter-resolver.ts"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa95d48df413906ff74233fa7515bfa18a5ab49a427dcb62d08b3779e81e923"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function acceptedIntegerRange (cyclomatic 11, cognitive 18): acceptedIntegerRange 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":"packages/daemon/src/domain/user-settings/settings-store.ts"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e5450d5e454eb74284d43eb183b0065b958686a64e40d94ad06f03933af341"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 18): (anonymous) 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":"packages/daemon/test/seat-handover-cutover-e2e.test.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e27281b3105e96d78e24fa5ebe51ae936aa05be24f96b81673bec6b23da9025"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startServerInUserScope (cyclomatic 11, cognitive 17): startServerInUserScope 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":"packages/daemon/src/adapters/tmux.ts"},"region":{"startLine":1497}}}],"partialFingerprints":{"codehealthFindingId/v1":"169c4a5b93c19fd2b05f60521637e7d4d643efd5edf64982de0eb66a8db0275e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function routeAgentImages (cyclomatic 11, cognitive 17): routeAgentImages 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":"packages/daemon/src/domain/bundle-agent-images-router.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a22ecb2f1784af45bd414e1268bb7e422e98bf6b58cb42e6bb7bb26d6d8d9cd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildBodyBlocks (cyclomatic 11, cognitive 17): buildBodyBlocks 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":"packages/daemon/src/domain/gateway/slack/message.ts"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bdcd92f664079c21a837973ffd14f77b6f1924bb1734e516fa9f3009ff62cb6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 17): (anonymous) 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":"packages/daemon/src/domain/process-table.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d562fd8a1b2e766677d203b79d6e300725317218553ef158c5fb634b55e86f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 17): (anonymous) 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":"packages/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":1967}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24527af494f941fbb803e884c8dd5769060b440210e9aecb3dd650338a8fcc2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fmList (cyclomatic 11, cognitive 17): fmList 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":"packages/daemon/src/domain/scope/scope-view-projection.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"00be989a04350901d970ff3bdaf315be43ac81876331a41fb92720dbe036f63d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openView (cyclomatic 11, cognitive 17): openView 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":"packages/daemon/src/domain/terminal/cmux-provider-adapter.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"637c554ec2403d20522bd284fca5269e4adb6631ff3006823d6d17b5b5f7a554"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function workSource (cyclomatic 11, cognitive 17): workSource 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":"packages/daemon/src/domain/workspace/project-read.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ef118023e831db206e7581401e3f537eaa544fa52db28c69f48af69d7ee0d45"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 17): (anonymous) 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":"packages/daemon/src/routes/agent-images.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f3b00b835679cf54838b976f0b8bd316879817539c3f83f8c5dc404d4020ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 16): (anonymous) 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/cli/src/commands/bundle.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fac5320f064a5ba50d42469daccd2f9e16853115a96f3cad2946bb71a5414de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function printHuman (cyclomatic 11, cognitive 16): printHuman 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/cli/src/commands/compact-plan.ts"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"04409505388295264df97b818e4765324c9552ddd4f008043cd72cd00960eb1c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 16): (anonymous) 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/cli/src/commands/gateway.ts"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7026c1424c4c9a64b75621e50d21a8dfda38a266fd7d2db97a577d37dfa21e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function emitRecoveredScopeAdvisory (cyclomatic 11, cognitive 16): emitRecoveredScopeAdvisory 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/cli/src/commands/queue.ts"},"region":{"startLine":1539}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0bec27780af43a99fecf01baf03838b41d94646f892934554f38a0354998104"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function provisionClaudeState (cyclomatic 11, cognitive 16): provisionClaudeState 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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":1187}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed2d2adf3404d9b57af548a096d7b08ba902d494fc0296e8bc35f18718a59c3a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function flush (cyclomatic 11, cognitive 16): flush 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/daemon/src/adapters/pi-openrouter-charge.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"1512ef16528600cb5526a2c3c6d58d4c9517e2c45d6e8fb3857f63f658393e8e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recoveryRecipient (cyclomatic 11, cognitive 16): recoveryRecipient 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/daemon/src/domain/compaction-restore-notice.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c0ed7aded680ba46894083fed41ff96fcb5b9f353ee1de32e979a7a570750b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rollupFleet (cyclomatic 11, cognitive 16): rollupFleet 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/daemon/src/domain/mission-control/mission-control-fleet-cli-capability.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"07decc0b6c8c0f60a73bd3bb6cdcdd26963f9d7504169a00c85bfee3bdb597cd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readTailChunked (cyclomatic 11, cognitive 16): readTailChunked 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/daemon/src/domain/transcript-store.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f4724909b93003c788adb28107e892bcff2693fda9b2c377611a7c793089557"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 16): (anonymous) 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/daemon/src/domain/user-settings/settings-browser.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"e736f50be2a4188f66dce7a464d143d310dcb584526c1609d0d3cb4c57ad33b1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fixture (cyclomatic 11, cognitive 16): fixture 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/daemon/test/stopped-seat-restore-contract.test.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc30172eb5a4b767943793a53d98534a20e89ac0c75fae35ef0eb84127e0b1dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scopeName (cyclomatic 11, cognitive 16): scopeName 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/tui/src/health/health-model.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"163c1c9166c329cf635a73302495b18512382768e9561417cf31433e5fdb5201"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeStepDepths (cyclomatic 11, cognitive 16): computeStepDepths 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/ui/src/components/workflow/WorkflowTopologyGraph.tsx"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44ba9a6a27dbfa50f1cf2975b5ef3250f2782044ad74262cbc9810d80a1403a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function logStageDetailErrors (cyclomatic 11, cognitive 15): logStageDetailErrors 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/commands/bootstrap.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbdc20be3a5ee806ea0c267f1f0867eaf2091243819616670cfc4238f367f70c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function legacyJsonFallback (cyclomatic 11, cognitive 15): legacyJsonFallback 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/daemon/src/adapters/cmux-transport.ts"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f3686d45d79e2f3682f3701689ed0bba719d39be19bed49e0a7c47cc74ad8b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tmuxServerArgs (cyclomatic 11, cognitive 15): tmuxServerArgs 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/daemon/src/adapters/tmux-server.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"43419d90818f78a437bde63a64b06753c5a2f5993e2292da089b2bb8d71cb0d9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function routePlugins (cyclomatic 11, cognitive 15): routePlugins 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/daemon/src/domain/bundle-plugins-router.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef24632e85d940ae7fa25923b00473d61f02ce4c9fce6f8771a34175c09b6a5f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function remoteRawRequest (cyclomatic 11, cognitive 15): remoteRawRequest 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/daemon/src/domain/hosts/remote-daemon-http.ts"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"684ac7b74d87ee0ced4449a8512c9f61c1e414a0c2a0a5776408895718dffa23"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function removeBlocksAsWritten (cyclomatic 11, cognitive 15): removeBlocksAsWritten 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/daemon/src/domain/managed-blocks.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"d39506528a4c1795ac607004f3823c376f401e338a1f5aa2a79505d3f05a26c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walkDir (cyclomatic 11, cognitive 15): walkDir 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/daemon/src/domain/progress/progress-indexer.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d32d6131665a23b38d0d66955218468044083cef20d5e866e503d1a28e084c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runRead (cyclomatic 11, cognitive 15): runRead 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/daemon/src/domain/provider/claude-usage-windows.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b90a570d7c5221feff3ed6b64361c4c6439d19389cf39d4dcda003b59e314f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readSuspension (cyclomatic 11, cognitive 15): readSuspension 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/daemon/src/domain/queue-wake-ladder.ts"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"31cdb4aef5f64821c2c8308c370ea850df20617414666a56eb5f3447adbe3379"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseLockedArtifacts (cyclomatic 11, cognitive 15): parseLockedArtifacts 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/daemon/src/domain/review/gather.ts"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a5c96ba89c5604423e84c9de75f5fd3650a52b710332ea1ef4e60213b87c8c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writeInsideSeatStorage (cyclomatic 11, cognitive 15): writeInsideSeatStorage 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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4287c4de35c90ad514d0f4a695cf78c14c99aeb8012999f0d4b9e53cad7f6fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function orientedFromRows (cyclomatic 11, cognitive 15): orientedFromRows 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/daemon/src/domain/startup-proof.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5b7d22ddd4623160cb5956bacce22b994eb589b588fc41ee5fc1bf6e643bc4"}},{"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/daemon/src/domain/workflow-validator.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb9dafc45e0faf3a59c288470b3da3cc9c8c8e1ce2f1a84422d8e61625b9197"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertBindAuthInvariant (cyclomatic 11, cognitive 15): assertBindAuthInvariant 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/daemon/src/middleware/auth-bearer-token.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4abd96a9d54d6f4018e7385afe3fb4c1c49632437e3bf8c41775e6e46875ca9"}},{"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/daemon/src/routes/projects.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e45740b310d64700437469b2fd8e6b48cbbda205e2c65a99e0a7ece7d84a40"}},{"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/daemon/src/startup.ts"},"region":{"startLine":3069}}}],"partialFingerprints":{"codehealthFindingId/v1":"21abdfd9b23d52222ecbc7c07ce628f8c6d923bf9efe9445a66a1ba1ea0d31a7"}},{"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/daemon/test/s03-bound-launch.test.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1c52c1061df8efa4a7df4c17f196fb79bbe0e060fa9dff3516b6467c4879cc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runTmux (cyclomatic 11, cognitive 15): runTmux 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/daemon/test/tmux-batched-capture.test.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"23dedbf8fb7af1c2ba66af54ef9a4223fec998db23f5691d98e87a261732e774"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function FencedBlockRenderer (cyclomatic 11, cognitive 15): FencedBlockRenderer 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/ui/src/components/markdown/blocks.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf5fa189c6b7bb4c2aa5fd4adcd360b7d66ee13d32a4c59e251be7de0fa0f0a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 14): (anonymous) 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/test/setup-output.test.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"3010acd80ec201076a5fa706b896fe85e00ea18b77e2d15c4a1e9e860c72232e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visit (cyclomatic 11, cognitive 14): visit 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/daemon/specs/agents/shared/skills/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b3c348a8b5c83affe33b5ca14dc93121032a53b9fcf6df7b0b401af5f71cd12"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function legacyTails (cyclomatic 11, cognitive 14): legacyTails 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/daemon/specs/agents/shared/skills/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b700dd219f526ccec7700bd7239d5db3e7bc6501e5d5b731f621e674ba06349"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertEntrySnapshot (cyclomatic 11, cognitive 14): assertEntrySnapshot 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/daemon/specs/agents/shared/skills/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c43141dd8a5232e1cd8a4be39fe0546de6bcae666e96487204936a14d9a5f5d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writeSeatRecapAt (cyclomatic 11, cognitive 14): writeSeatRecapAt 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/daemon/src/domain/context-packs/seat-recap-store.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4e887b398e4af4314b4c700f2a00fd4dee705696418d8f025971a999745433"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 14): (anonymous) 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":3220}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f35b35fc38aa9595f87b3413468b4c6397dc7cec6636ff98a2c8771ab6ef919"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function anchored (cyclomatic 11, cognitive 14): anchored 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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1bedc10fefe6be1a89fdd8e98138b89378ec387d0ca3cb4b2ea88dd4bf1331f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readPrimaryFrontmatter (cyclomatic 11, cognitive 14): readPrimaryFrontmatter 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/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b5e666359757f7a2af186b1b7ce40654ecf74b90d54b230c4cda8243ec129bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function endPending (cyclomatic 11, cognitive 14): endPending 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/daemon/src/domain/terminal/herdr-app-provider.ts"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6edeb6a086f83407027547e4011281bda438b6d4b6ab7f23a6b912d1a427268"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function check (cyclomatic 11, cognitive 14): check 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/daemon/src/domain/terminal/rex-adapter.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"a95463b44658bc5b8e4d1878a83a722105fc71c8ea39156854ae0942f8dcca6a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 14): (anonymous) 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/daemon/test/pi-runner-path-native.test.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"0542d54860f8aa13577a56cf37cd1f79bdf98be520ab5c7719097618b7bdc4e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function start (cyclomatic 11, cognitive 14): start 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/daemon/test/startup-orchestrator.test.ts"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"7566c6d157af89209b66a4295cb3600e7817472e84a50ee6c5703d77487a450e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visit (cyclomatic 11, cognitive 14): visit 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":"skills/_canonical/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3fe222ac897f3528713e5a7e407f47e6334f00890edb166c7e7be14bb237f1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function legacyTails (cyclomatic 11, cognitive 14): legacyTails 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":"skills/_canonical/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75ca10a4b1dee68f3ab55c3372bcdf0ef1bfac722625b44687003c48f85755d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertEntrySnapshot (cyclomatic 11, cognitive 14): assertEntrySnapshot 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":"skills/_canonical/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"7921f22b23b6bffc821f89d7a9fb19a593d8c3bdd7a0dd2b7b4c93b4ec366d2a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkAbi (cyclomatic 11, cognitive 13): checkAbi 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/scripts/check-abi.mjs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaaf0d4514f54fc404e0a0600ebfdceccbee5fd443eef37735195831d52fe25d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validatePluginTree (cyclomatic 11, cognitive 13): validatePluginTree 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/commands/plugin.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"3679f93a7a5141dca3c01aab2fea1e40a721a0f187bd1e75eb92a0029adc7d86"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runCrossHostTranscript (cyclomatic 11, cognitive 13): runCrossHostTranscript 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/commands/transcript.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9394812300a82f038ab206e6fd63f5576c5b47450f7745b19d98fd926f63be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkLocalPath (cyclomatic 11, cognitive 13): checkLocalPath 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/lib/file-transfer.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"5961ca80673f422d1bb8a3f76b7bc82360e9cdfa14ebe04e00eaea95666cf4d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseIndexerFrontmatter (cyclomatic 11, cognitive 13): parseIndexerFrontmatter 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/lib/scope/scope-fs.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"113c5f192950d15e507d0cf2d6dc2f1e794c418e299133b3495dd8b6a825623d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function preparePiAccount (cyclomatic 11, cognitive 13): preparePiAccount 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"0920b70992c87e070d83b4094583c1d426694269b81f39c594531df3fc30095d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 13): (anonymous) 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/daemon/src/domain/activity-grants.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"1683c448f57d0947f388adf1a461504d2612d757ac7aad788bccc1be1b1b0e1f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findCompactSessionStart (cyclomatic 11, cognitive 13): findCompactSessionStart 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/daemon/src/domain/agent-activity-store.ts"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"f765cbc9256f3ddef547f7c1fef95005e7fd6274b427ffe7246777e3397b0d41"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveAllowedPath (cyclomatic 11, cognitive 13): resolveAllowedPath 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/daemon/src/domain/files/path-safety.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68df4cd20606407eb0181a69ff58b73ec5289d2c59bc96465765fe0a6b5f4a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function failed (cyclomatic 11, cognitive 13): failed 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/daemon/src/domain/gateway/slack/settled-asks.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e6992c33ae63bb676cf3b58cba8246672309bc96563c624b14f9b2697dfa84"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openOrFocusNodeSurface (cyclomatic 11, cognitive 13): openOrFocusNodeSurface 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/daemon/src/domain/node-cmux-service.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"9572c88e415b0304c7c47080f79a2e662e58ad6e779f2511c10f6d8c9166dd3c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 13): (anonymous) 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/daemon/src/domain/rigspec-exporter.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f7bfc41f7cd722a719a2be5a3d14c3107adb2de5f7c0c2995889435c9c87e6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildResolvedStartupFiles (cyclomatic 11, cognitive 13): buildResolvedStartupFiles 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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":3184}}}],"partialFingerprints":{"codehealthFindingId/v1":"98974e29d38bc9468667b1b58bb125d349b657bfdf51792466d25fc04a8686e4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setPermissionsTo (cyclomatic 11, cognitive 13): setPermissionsTo 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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"0135dc8c3b0731dd200a8ee78a55f6a0e5ace8880758449a8c55aa22f7afdfdd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildTopology (cyclomatic 11, cognitive 13): buildTopology 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/daemon/src/domain/slices/slice-detail-projector.ts"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"6764edb89fcbc9e4ed4fcce1898376c12c91e1e0390cfd65cb0f00c3fa7555aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseFrontmatter (cyclomatic 11, cognitive 13): parseFrontmatter 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/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":1680}}}],"partialFingerprints":{"codehealthFindingId/v1":"c01b12e5270603de26ca46945ccb1275e150b0e0ec8ddbaa8c85ef4877e27afb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractWorkspaceId (cyclomatic 11, cognitive 13): extractWorkspaceId 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/daemon/src/domain/terminal/herdr-adapter.ts"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"2981e8a7fb3627125f2ff8ceb955fa7681120b68a673a756e62c1bf2468aa261"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 13): (anonymous) 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/daemon/src/domain/workflow-runtime.ts"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a048be7e88295dd463af3df4a197af0136c534ff389ce8964ab6b230c79406"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openPipe (cyclomatic 11, cognitive 13): openPipe 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/daemon/src/terminal/TerminalSessionBroker.ts"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d8f7df348c594573fb48dbc7389c3eb4b588b87b8fb6544c764b564e7f5005"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 13): (anonymous) 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/daemon/test/herdr-live-reuse.test.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e107a81b542c7f61f566b8b253f1076195508d62330f9e9797aac9d47f55b565"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 13): (anonymous) 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/daemon/test/tmux-agent-environment.test.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"77107751bac2858bcba78288e8360851fa9f5cd56dbd7276b968b33e0cdcc023"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 13): (anonymous) 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/daemon/test/tmux-exec-deadline.test.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"927c4f22c0e0198fdf88370d6d9c8f6b298802436cb88ea78a19faca9ea1a703"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 13): (anonymous) 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/daemon/test/views-routes.test.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"3038d4ac14e902288f884132126ef34125d18c23657b78cdf89c00176b816f56"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyPromptState (cyclomatic 11, cognitive 13): verifyPromptState 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/test-system/ci/prompt-state.mjs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"de9fb449b6190d0825cd3af3f573b46ca54f41f88b82cfcecac0414f613c6c24"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectRule (cyclomatic 11, cognitive 13): selectRule 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/test-system/delivery/stand-ins/core.mjs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c422892f382551b8b15fc12be63d86695062caa580e5a427121ab23004f57bd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stripFrontmatter (cyclomatic 11, cognitive 13): stripFrontmatter 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/ui/src/components/markdown/MarkdownViewer.tsx"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a13b89d88d44b891f13edde99b0bdd4440f4dabcba6f3dc3144f92d6916cd9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deriveStubAssetsHash (cyclomatic 11, cognitive 13): deriveStubAssetsHash 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":"scripts/testbed-build-inputs.mjs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"741f54dfba636d02601c6634a4cc475eb677a42778b1a8c9545a65da971c99fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 12): (anonymous) 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/commands/host.ts"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e291d852cf05de4c157c68dbee11251fdc1252f2626417153e890e3e6f8220"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 12): (anonymous) 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/commands/plugin.ts"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"b600e44a47ff07f05e873328d759f435156d1a54cd483cfb46b69b2c3b98ea87"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 12): (anonymous) 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/commands/project.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"f50ab23b7a7f9bdc1e3058d170378410cc1eacbdf12329b7b98dd9c4da986879"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validatePermissionPolicyRef (cyclomatic 11, cognitive 12): validatePermissionPolicyRef 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/lib/permission-policy/policy-ref.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"e006c137561f7fe71b5e9a7e2913a40aa69448e824f04bd55fed88bbe9dbe536"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 12): (anonymous) 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/mcp-server.ts"},"region":{"startLine":2681}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c9968e30bef13067e643597a5daf45a8019719a2982bbf4fa579cf62748eea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function guardedInput (cyclomatic 11, cognitive 12): guardedInput 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/daemon/src/adapters/tmux.ts"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"b575115227d7063ea95c9d4eca1b32ed184c7d3175d85227ce5eeb127c5318ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function history (cyclomatic 11, cognitive 12): history 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/daemon/src/domain/chat-repository.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb69d7f43ca863fd046bd2d8966d0b1cfc49713d32a533f62d2fce956cd06db5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 12): (anonymous) 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/daemon/src/domain/classification-sources.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"c872887b9ed90fe51b4c04a072456ee336f36ee811e8203ea1eb9a6947382b64"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 12): (anonymous) 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/daemon/src/domain/crash-cart-probes.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcdf0078771121adca55d24b90c273eb3d01d537b6e7d5bf8c922fbe97d52294"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyPolicy (cyclomatic 11, cognitive 12): applyPolicy 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/daemon/src/domain/install-policy.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"dec774c7eaddd576db0952988c67c0dd83e7596a01ae1cd8800ff6a6c96fb887"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findDescendants (cyclomatic 11, cognitive 12): findDescendants 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/daemon/src/domain/model-divergence/current-generation-record.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56b3b4c3900c07cb44d11cc04dc2f5cc28758d42e7c4fedf26a9a1d767c3fd8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validatePermissionPolicyRef (cyclomatic 11, cognitive 12): validatePermissionPolicyRef 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/daemon/src/domain/permission-policy/policy-ref.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd484839f13e1cac365eca33a14acddd7b2409831032968cd1c2757b4739d1e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 12): (anonymous) 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/daemon/src/domain/provider/subscription-move-report.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"e414567cd7198c5ae818aa36a09a9c5e9fa3736a6e14908b38ae66c237b3d62c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 12): (anonymous) 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/daemon/src/domain/restore-check-service.ts"},"region":{"startLine":1385}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c96b473856fbfab5ac74a715c649ff49454bd0ff65702cf20943e211730b18"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepare (cyclomatic 11, cognitive 12): prepare 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/daemon/src/domain/seat-runtime-switch-service.ts"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"0459dda1eab238739db26b8511e3919c8849ecd57f606dc0e8f8f76e839737d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pollAllRunningTmuxSeats (cyclomatic 11, cognitive 12): pollAllRunningTmuxSeats 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/daemon/src/domain/seat-structural-activity-service.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"541dd682bf7c42d44f05afc886955734517d354f3be1b34aa80f967d064df896"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sliceIdAliases (cyclomatic 11, cognitive 12): sliceIdAliases 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/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"568dd0abc6e4ca0dc2b30a4d4306da2ac89b401f2cf5c27f7fde97a5a6bb9672"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseWorkflowLibraryId (cyclomatic 11, cognitive 12): parseWorkflowLibraryId 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/daemon/src/domain/spec-library-workflow-scanner.ts"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"1922dad590f8878a823f1ddae6e42eea41974e0abd60d75a0c4791f8f3e0e0e0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addRigText (cyclomatic 11, cognitive 12): addRigText 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/daemon/src/domain/workspace/project-registration.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3bcc4935b06660377a5d0e4b5b75b94b2d2d57f07394c99f9d1b1ad5027cf97"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 12): (anonymous) 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/daemon/test/cross-rig-escalation.test.ts"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b58705cd5135c816feb0e3caef5a7acd223f3f687fe961cd7ae41e62392b162"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 12): (anonymous) 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/daemon/test/pi-runner-handshake-native.test.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc2fe1908f492479132a241f30c123906133807240e3d179bc7472cac065f3f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createReservedControlSocket (cyclomatic 11, cognitive 12): createReservedControlSocket 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/tui/src/socket-server.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"18c01128de89e6184888d73468e806788a9411e44632c678e1705c8a66b563ca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchDrill (cyclomatic 11, cognitive 12): fetchDrill 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/ui/src/components/review/TranscriptDrillPanel.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"585ff4623cd445ae7335a27a7a14ee33641985716f91db1643491bc5c9bbd8aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readSelfSeatId (cyclomatic 11, cognitive 11): readSelfSeatId 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/commands/health.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"93519ea801aff71da9b376e13d6a11ffaf0e3be2e15391a380f1a9a22a0db382"}},{"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/cli/src/commands/host.ts"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"e457cbb74690c90967422bf0cc55590f6c68de25d216086f49943f34d62dc507"}},{"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/cli/src/commands/mcp.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d3afb85ae6a1b474c9306812adfb6c4de081aa43fcd0b7c393058d4dca9d94"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function queueHostTarget (cyclomatic 11, cognitive 11): queueHostTarget 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/commands/queue.ts"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3b866db49d20940044d285549d87ddaf1acb9476e4a22f1061c49a5d9d8f36"}},{"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/cli/src/commands/queue.ts"},"region":{"startLine":2266}}}],"partialFingerprints":{"codehealthFindingId/v1":"de894722e4dd36f845a09e8bad9c6f9dcf6ea0649adc6c266b67dfd2b6a65ffd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchSourceTranscriptViaDaemon (cyclomatic 11, cognitive 11): fetchSourceTranscriptViaDaemon 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/commands/restore-packet.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c2439d6577a99e065928dd824ced32ba0571ee4a6e79c5035d95312f7b7ef6"}},{"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/cli/src/commands/seat.ts"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"f428c0836f234518ed82ab815e28e3a5051fbce3d28ad096ed06f3c49d57778e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function describeOpenAsks (cyclomatic 11, cognitive 11): describeOpenAsks 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/commands/slack.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d8564d4b0c1a274dc0ac1d848410c856159ce95f700ec46cf022555dc93c65"}},{"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/cli/src/commands/specs.ts"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"980ac271fdef1c5f5b7ec0a7c0fb0f59549a2bac8b0625cfca358f0f4377ed16"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function set (cyclomatic 11, cognitive 11): set 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/config-store.ts"},"region":{"startLine":1700}}}],"partialFingerprints":{"codehealthFindingId/v1":"b78426bb2241196b1faa60cba9b9f642be079a4cc74404e2d8524672c0f0b80e"}},{"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/cli/src/mcp-server.ts"},"region":{"startLine":2614}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc4bc54dd8e1354fc113978dc31c5ff21f40fa3863496931e74c2a70e9b46da"}},{"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/cli/test/ask.test.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"4949d5e0668e2f3525a3c5e81a86ac26a3c337b0754876c22406d56afd9df0f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exec (cyclomatic 11, cognitive 11): exec 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/test/setup.test.ts"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"b637cce3884f19c71eb79d65626771df33de47d60c6bced577104eec9d82d6ae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateLayout (cyclomatic 11, cognitive 11): validateLayout 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/daemon/scripts/gen-control-plane-json.mjs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"b024a5e2be830d7343e0d80e691aa5edca40e42eb46cfc2dd2d0c6fa027292c8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function systemWorldPlan (cyclomatic 11, cognitive 11): systemWorldPlan 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/daemon/specs/agents/shared/skills/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"45af6361df075e7637bf22ba4f9882a9a0b89bf959e4f5053a403b57e071919c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function transcript (cyclomatic 11, cognitive 11): transcript 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d70614f1c01843464e7fe1df8f48e156dd39c177c1268ea39b756a5f4f42263"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function heartbeat (cyclomatic 11, cognitive 11): heartbeat 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":1535}}}],"partialFingerprints":{"codehealthFindingId/v1":"fec835d8d70983a970413fc860982e3a6a84e168871e7d0bd36cf1c769730627"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fireRestore (cyclomatic 11, cognitive 11): fireRestore 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/daemon/src/adapters/stub-restore.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"709f4128df61214115b203ad05176e1ff36faededeea0b2224aa98bbb450b904"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readSeatProcessLimits (cyclomatic 11, cognitive 11): readSeatProcessLimits 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/daemon/src/adapters/tmux.ts"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de4d92a688ace932ea5c9ca1dcfc2b09b7fe1c6847034047f25e2d2387a52a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function record (cyclomatic 11, cognitive 11): record 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/daemon/src/domain/capture-observer.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c8ce4056538fa57e69109cd63a00e39d52b4c72e43cf18628ea9b010d270e3c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function captureResumeTokenOnAdoption (cyclomatic 11, cognitive 11): captureResumeTokenOnAdoption 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/daemon/src/domain/claim-service.ts"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"13699213016cd331e904de60e5fedb6df3c81e4b69533eccc0b38fbde0540bac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reseedFromLateCompactSignal (cyclomatic 11, cognitive 11): reseedFromLateCompactSignal 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":1914}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ca94ed516af0eaf6407b05ca092597dc20e2729fbf71b806f94aed0ec806a2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function canonicalWorktreeRoot (cyclomatic 11, cognitive 11): canonicalWorktreeRoot 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/daemon/src/domain/claude-git-trust-root.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"327cfb90b4560bf84338c36a9d41f099ab4e43a37681d2cdf31acd1c426ba2f4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function authSwitch (cyclomatic 11, cognitive 11): authSwitch 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/daemon/src/domain/codex-auth.ts"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c3ef8d0507e1637e602234a4ce42b66af0abb7335ad5a5910ab645b7756277"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function describeDefaultReceiver (cyclomatic 11, cognitive 11): describeDefaultReceiver 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/daemon/src/domain/default-receiver.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a9c22344846f33f4f99fb2987ef51741b98142de31b57b1cf206b9505638af"}},{"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/daemon/src/domain/gateway/human-operating-modes.ts"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7a91c215469834307cafc4ddfb232379514a16aea68345c13322dc18b899a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function removeHumanFragment (cyclomatic 11, cognitive 11): removeHumanFragment 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/daemon/src/domain/gateway/human-registry.ts"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab3e03172ee0c0aabcf6a24e42ffee69f6ecfc0a8ab83ac2193bd068dd518df"}},{"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/daemon/src/domain/gateway/slack/message.ts"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad569c19368b6029fa29b2da98009479b4c6eab742abc3ddcf72839fa4b4943"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function defaultReadLocalImage (cyclomatic 11, cognitive 11): defaultReadLocalImage 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/daemon/src/domain/gateway/slack/slack-delivery.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f029a3653c4685f5e0f44e0479d23066cf5b0669482572e6e32ed05607d80ba"}},{"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/daemon/src/domain/guidance-projection.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a4637ee72b21e0028af9adf362a32f9eadf300c031cc4ecbb9f59d65208e0bd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function send (cyclomatic 11, cognitive 11): send 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/daemon/src/domain/mission-control/notification-adapter-ntfy.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"f783361e83c2d7c20f57ff6c6f85e17e03d02315bfba1be7dee91cd1cf4438d6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createAndBindSurface (cyclomatic 11, cognitive 11): createAndBindSurface 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/daemon/src/domain/node-cmux-service.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc2af51862642883091875ef7a3adcdb29e7a55bbd980729dabbe33329accecd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function invalidateRetiringOccupant (cyclomatic 11, cognitive 11): invalidateRetiringOccupant 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/daemon/src/domain/occupant-invalidator.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"831b328520938a5cda42f2d49008acc1e5692396728eb967b406627b7b068059"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readResourcesPlugins (cyclomatic 11, cognitive 11): readResourcesPlugins 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/daemon/src/domain/plugin-discovery-service.ts"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"c892e00d2d43932380f677e183a16d2073ee4fb8db3e06df7263147fc781f67e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fireDeliveryDeferralIfDue (cyclomatic 11, cognitive 11): fireDeliveryDeferralIfDue 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/daemon/src/domain/policies/delivery-deferral.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3b4de9cfa27391edf64e3d0d03114f3d47580c7760acd33751151be9bc85c8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evaluate (cyclomatic 11, cognitive 11): evaluate 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/daemon/src/domain/policies/edge-artifact-required.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"66bd284fa5a3869a1d1ac330837ecb663e6bf1e784e33f610eacb0f439df2475"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function workflowRefFromTags (cyclomatic 11, cognitive 11): workflowRefFromTags 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/daemon/src/domain/review/gather.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"489f5c30439c0b2d6f7bbc640f718aeef9a4e64d7e0c77bd6c8cc0002a6618d7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exportPodAware (cyclomatic 11, cognitive 11): exportPodAware 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/daemon/src/domain/rigspec-exporter.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2c84ad3cdb6e116b73063cddbada9c17072f354c2b253083c85cc240548359"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function seatSkillSelection (cyclomatic 11, cognitive 11): seatSkillSelection 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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":2311}}}],"partialFingerprints":{"codehealthFindingId/v1":"088f5a529427933cc28ab8a5fc68a7588aa566fa475078085e8bc2a997405ad0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseTypingGuardSettings (cyclomatic 11, cognitive 11): parseTypingGuardSettings 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/daemon/src/domain/seat-delivery-guard.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e5f0031079025c61d47fa3e48456372cec7554a3cdc234329c1b8e4302b223b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseHandoverSource (cyclomatic 11, cognitive 11): parseHandoverSource 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/daemon/src/domain/seat-handover-planner.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7acf0062d27d7079d9212ce33d92f0c70ece102ad5040a0bbc2dbd581965d86"}},{"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/daemon/src/domain/session-transport.ts"},"region":{"startLine":3511}}}],"partialFingerprints":{"codehealthFindingId/v1":"3843c4d7c3b55dc1725b93c4e4e0bb592cea250c57a10af263e894a071c40558"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveNextStep (cyclomatic 11, cognitive 11): resolveNextStep 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/daemon/src/domain/workflow-projector.ts"},"region":{"startLine":1611}}}],"partialFingerprints":{"codehealthFindingId/v1":"0efbc7b46ea11fd8a36cdd320735a0f5cc9c6a31265cab256b36dabbf8c74b77"}},{"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/daemon/src/routes/compaction.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1b11cdebe7f525ac70222114bfb7b985b1f69eb528c0b3f42d780de92ac98c"}},{"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/daemon/src/routes/compaction.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab643c0d0505251ead26bba8d48fb979a8a1c4abcf55df3561bfdbd7fa5062fc"}},{"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/daemon/src/routes/projects.ts"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0c850b8789b3ccf9019340261680d3b5bb0ec13df227ba6c4fa3fb8a652961"}},{"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/daemon/src/routes/queue.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"f667feb33acbfc4038204347d66a99a375b9062cd22de348359078e13ee6616f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getStartupContext (cyclomatic 11, cognitive 11): getStartupContext 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/daemon/src/routes/restore-check.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c70bcbdb13df18dd29e6489fe8220272fef53a21ca9af2db046cc5594b20139"}},{"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/daemon/src/routes/startup.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1c3bde8802150bd3b44475c39085bf60225ad1cebb893440bc126536b87000c"}},{"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/daemon/test/environment-startup.test.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6be10affe5d229b48a3ed13d0509d69b857c85ea29751cc7c618a337fe8544"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restoreWithRealSpec (cyclomatic 11, cognitive 11): restoreWithRealSpec 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/daemon/test/restore-claude-activity.test.ts"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f3e7d744c9226f63f05eb91235aa1629c368289300a98a59e5d378ac502c0ea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function seedRigAndSnapshot (cyclomatic 11, cognitive 11): seedRigAndSnapshot 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/daemon/test/restore-orchestrator.test.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd03d52584cb0f32f804588d6184170c6b8b8bd5fd715f87fa331d638b44fa33"}},{"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/daemon/test/slack-api.test.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"739f664956469d4ad8e7af727fe0123e570903ba0a644a726a2f707eb6d23d74"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function laneCell (cyclomatic 11, cognitive 11): laneCell 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/tui/src/pulse/render-pulse.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d14900a0dffb1393c3f6476da7c92f49163e51436628ce2132d05c34815f912"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractAgentPluginIds (cyclomatic 11, cognitive 11): extractAgentPluginIds 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/ui/src/components/LiveNodeDetails.tsx"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f9631d0935e7686eeacb784dea55042cb028b746a6b8ff239501db40c5a7bc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onclose (cyclomatic 11, cognitive 11): onclose 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/ui/src/components/terminal/FocusedTerminal.tsx"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ac542b5ae2097a7d484926f54e7c91f1af5555bf5976ef4b118aed143938c1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function RigBranch (cyclomatic 11, cognitive 11): RigBranch 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/ui/src/components/topology/TopologyTreeView.tsx"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe45f6eddccb0a0ddfae9c7f99b08201a550814e5c2420b77f38d9e7605ae10"}},{"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/ui/test/package-detail.test.tsx"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"717adadff7ccd410f37ba5b43c6c5dbbb6998c7d21e557faf71088f9e2595270"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 11, cognitive 11): main 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/ui/twin/capture/twin-capture.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"30faab1bdcf9376e8f16f11a5390acea845c6da5e03028fa10f9d12ada633110"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function systemWorldPlan (cyclomatic 11, cognitive 11): systemWorldPlan 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":"skills/_canonical/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ea1c65eaa06534623eccd348315fbb267e8b7d63611119d4aeb8549171eac2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function printConnectedAssistants (cyclomatic 11, cognitive 10): printConnectedAssistants 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/commands/ps.ts"},"region":{"startLine":1337}}}],"partialFingerprints":{"codehealthFindingId/v1":"8354acfb3cf7ff6479f7525a2d773eae3ef3ee362e740e272a1db14f385f27c8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mapLegacyStatusToStage (cyclomatic 11, cognitive 10): mapLegacyStatusToStage 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/commands/scope.ts"},"region":{"startLine":1946}}}],"partialFingerprints":{"codehealthFindingId/v1":"a152ddff5d3cfd50279441507b85d743d8fd268ae98e3fceb159fd75c85b756d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onData (cyclomatic 11, cognitive 10): onData 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/commands/start.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c59f8ee8fa3ed871955c194279466d12129d85696f11209b8edf1c8d4b95038"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) 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/lib/bundle-source.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a971606b70304eec1cccaf752e5b07a2cd79f6c77594f0367d90ec73a5f247a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exec (cyclomatic 11, cognitive 10): exec 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/test/setup.test.ts"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b0fe7b759a7d827a63a289fcbd163bd62fbd9bebc3fcb40ceb82534b877de9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) 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/test/start-kernel-evidence.test.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24f83d588eeda164aee01a737f80c1134b60d70b20cfd9bcf0b97773a9e6623"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function describeBashCommand (cyclomatic 11, cognitive 10): describeBashCommand 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/daemon/assets/plugins/openrig-core/hooks/scripts/permission-stop-descriptor.cjs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1cd33a61f0fd3bc363d233f08f66102f0189e689386e89a3900b2bb53935702"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateCompatibilityBlock (cyclomatic 11, cognitive 10): validateCompatibilityBlock 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/daemon/src/domain/bundle-types.ts"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa8b4178c37368cdb47fc7c0dfa5a1bb6e9b105fbae4bc1ae4b3a8e5a5740e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function currentClaudeMcpMenu (cyclomatic 11, cognitive 10): currentClaudeMcpMenu 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/daemon/src/domain/claude-mcp-menu.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ce590eaa2a44a6e68a38e91c3261a342cfcf9c52cbd626801c245beb0d905e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function memberCheckInStatus (cyclomatic 11, cognitive 10): memberCheckInStatus 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/daemon/src/domain/connection-contract.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea4eec2a691d516554a8ce4f80a00d6dd65cff04dcd3a35b3b36b6fb420ab77"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deriveRole (cyclomatic 11, cognitive 10): deriveRole 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/daemon/src/domain/current-work.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"636dea92ab53a77f237f14f3bbded2a487a912d2f3bda77a5d31282bf27f5305"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function defaultLookupQuestionState (cyclomatic 11, cognitive 10): defaultLookupQuestionState 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/daemon/src/domain/gateway/relay-outbound.ts"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb46bee2a0688ab9f14e3011ead9354604738f4531d705d725ce9361542f581"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restoreMethodHolds (cyclomatic 11, cognitive 10): restoreMethodHolds 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/daemon/src/domain/gateway/slack/slack-recovery.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d78cefc31adf80101565d7fd97f43b4264bc13389910be13e1fed2895921aaa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) 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/daemon/src/domain/gateway/slack/slack-subsystem.ts"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91f2db7796561b103b440d2d13fdd6ed5cbb33499ee23441a97239352dc70bc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function launchWanted (cyclomatic 11, cognitive 10): launchWanted 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/daemon/src/domain/hook-bridge.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a565d0c150634890e159c2dd4900ee58979d3ae9c70e3039a8c3d44cef9324"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function aggregateFleetScopes (cyclomatic 11, cognitive 10): aggregateFleetScopes 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/daemon/src/domain/hosts/fleet-scopes.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f762a365a136a5afebab94168a7a4b45843c4f80acbc74eacf563549691f3f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateClosure (cyclomatic 11, cognitive 10): validateClosure 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/daemon/src/domain/hot-potato-enforcer.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1fc8752ffbe9c4c8eb6c4f68e090222a862164224ef555ec5ee0b1246ff247"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decideManagedBlock (cyclomatic 11, cognitive 10): decideManagedBlock 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/daemon/src/domain/managed-block-records.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c56a3c6f076709f7337ea4eb06f7892ec1c592be9efd4c77dbe2f4cfa57be51"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordAnswer (cyclomatic 11, cognitive 10): recordAnswer 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/daemon/src/domain/mission-control/mission-control-write-contract.ts"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"f030c4755eff72d0461890b4663957c39fafc276e3b859508dfeb1fcfeccf2e6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function observeCodexForkProcess (cyclomatic 11, cognitive 10): observeCodexForkProcess 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/daemon/src/domain/native-process-lineage.ts"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff37395bfdd5c5d22c8454fceaacebe5436c82c267b2332f88e349d0ab58d320"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function enroll (cyclomatic 11, cognitive 10): enroll 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/daemon/src/domain/network/network-installations.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"a740bef0cb9ff7763c1f5330c3671215d17905db188420f6a3c522f1f45c67db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mapStatus (cyclomatic 11, cognitive 10): mapStatus 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/daemon/src/domain/node-inventory.ts"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f2950957575854bbbd3c539c2604bd5b07c79559ee83c0d87a763a23837bebc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function takeOverPane (cyclomatic 11, cognitive 10): takeOverPane 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/daemon/src/domain/node-launcher.ts"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43eb1002431e04646b7953694bc9974a6f2780d249eed1f9cfc8d01e10e69fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOpenRouterGeneration (cyclomatic 11, cognitive 10): parseOpenRouterGeneration 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/daemon/src/domain/openrouter-charge.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"4831e0bad5381db8009139e847bba56ccc286acd514d15c64cd93aec4981ae0e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseWake (cyclomatic 11, cognitive 10): parseWake 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/daemon/src/domain/parked-query.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc4abe3a4c73729b72787b20b2c0fe03d9117f783fbf14e8e1a26e205c5b6eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parsePiSessionHeader (cyclomatic 11, cognitive 10): parsePiSessionHeader 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/daemon/src/domain/pi-usage-facts.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd9002d454c16ce8a3efae8b3333649521a5f1f228ef9336e7b2bdff158be0a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function list (cyclomatic 11, cognitive 10): list 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/daemon/src/domain/project-classifier.ts"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"821ccb2b799ba7e941c723379b6c21dcebc8daa0acd024debbf74565f88593c1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rowToProject (cyclomatic 11, cognitive 10): rowToProject 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/daemon/src/domain/project-classifier.ts"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f63a4e106079850a7f273276776acfdddf5d54137873f43c39cd7778c9ad15"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkRestoredGuidance (cyclomatic 11, cognitive 10): checkRestoredGuidance 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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":1783}}}],"partialFingerprints":{"codehealthFindingId/v1":"38acaa124d9941f95aef46e2da4929bf97899e83127dd67e6e1fcaae487ed9fd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) 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/daemon/src/domain/review/gather.ts"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"7481a78899899b723b08e83e00d1a01f7fc73e62b589454529d519bd53b4304d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveEffective (cyclomatic 11, cognitive 10): resolveEffective 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/daemon/src/domain/rig-mode/rig-mode-store.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"f986cf1ada7651cdae4cd543e31d742707dd8c6dec2afeb85a8a7fcf109f531c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function guidanceStatus (cyclomatic 11, cognitive 10): guidanceStatus 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/daemon/src/domain/seat-status-service.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"1abc49c7a754f9c9180319f287ff4087c28159f85d5ca46a4a3e007917e7f28a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runtimeHomeStatus (cyclomatic 11, cognitive 10): runtimeHomeStatus 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/daemon/src/domain/seat-status-service.ts"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"5505d89a7f4a0a93796730f4987351918ed0680addb0498ad93f551ab3811072"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rowToSession (cyclomatic 11, cognitive 10): rowToSession 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/daemon/src/domain/session-registry.ts"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9fcc9fdbc3c7d3375f3e60873ccf7ccff4609f7c90f5a50f3bbaec58b80b04"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function configureShadowCapture (cyclomatic 11, cognitive 10): configureShadowCapture 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/daemon/src/domain/shadow-capture.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade98945c112564519c1e91c1902341df2d8bf41f56a27d974137e60f594779a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractExplicitRailItem (cyclomatic 11, cognitive 10): extractExplicitRailItem 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/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"6edab668616a2d6145c534ca406d3bc3b147d2c732cd63c1407f8fb5ea1fa875"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) 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/daemon/src/domain/terminal/herdr-app-transport.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fcf36831fdb4800aa640b33f3f74f4cd7edbdd1017699147678b89a3e5ae548"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) 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/daemon/src/domain/terminal/herdr-follow-view.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"b43be029c00029f4ca733002ae88302ddf2245667b7b64fd0e7157c838fbf18e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readUsageSeries (cyclomatic 11, cognitive 10): readUsageSeries 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/daemon/src/domain/usage-series.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"171534b6a81da5c230b4497e9df483761251242eea656d01bb443c5be5abd4db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function record (cyclomatic 11, cognitive 10): record 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/daemon/src/domain/watchdog-history-log.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"f07837f7d8250ae684b372462e74ea9bfc44daec57562e21573090b13abfbb4f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) 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/daemon/src/routes/provider.ts"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e56c9f3a6e9311e84b66686c6cba98c9170330f8e1f1e1cb7f4f7dd4157a398"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) 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/daemon/src/routes/seat.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"797c3ba53ec85cfa8f7311bc1263045650871b5244c6164181a13017264d7a69"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) 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/daemon/src/routes/seat.ts"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b6a25fed76df71d02e12310aa9f895e155d04765c5e5f491bae3eb247659b9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) 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/daemon/test/codex-owned-hook-trust.test.ts"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1701c511887899220aa9b3a2782446514e1df491ae6809846601c541ff6b110"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function adapter (cyclomatic 11, cognitive 10): adapter 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/daemon/test/codex-resume-prove.test.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"261bbee1290e55a4b20086e0e2bbc7c90d8819676d635034e524718d10b3a1b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) 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/daemon/test/pi-runner-handshake-native.test.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b0391e14a7680a4fb54e51d68f6ae026a514d0bd2b8efcd7b2a22b28ccb387"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function listProcesses (cyclomatic 11, cognitive 10): listProcesses 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/daemon/test/restore-orchestrator.test.ts"},"region":{"startLine":2088}}}],"partialFingerprints":{"codehealthFindingId/v1":"d276886b8518f2fb7c637ab23b6a7f01c7af5cce11a89c848a7d9f640557609b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function configDetailLines (cyclomatic 11, cognitive 10): configDetailLines 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/tui/src/config/config-model.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac145e5e061f2d662780c22aa9fad5fecef0b6122c43f875b29397e4edae052b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fleetScopes (cyclomatic 11, cognitive 10): fleetScopes 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/tui/src/daemon-client.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f76bde31b985b5660d16cac6045af5ad5d2677072f0f51a69314ef33880a8e3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function groupLines (cyclomatic 11, cognitive 10): groupLines 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/tui/src/usage/usage-hosts-model.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e05e9bc66cc7ba904c315a1eb9822755b7f430d969182bfc58ba7b080dac66"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function AgentSpecReview (cyclomatic 11, cognitive 10): AgentSpecReview 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/ui/src/components/AgentSpecReview.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bdeb7acc6f9552d91c69d36651efc8f5276206999c253a33c0b14f9ae0fd36b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function AgentSpecSection (cyclomatic 11, cognitive 10): AgentSpecSection 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/ui/src/components/LiveNodeDetails.tsx"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77f5a25992819ff05f003d6a13adc597e2739336d8b194f6086c32014e813c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function VellumDestinationCard (cyclomatic 11, cognitive 10): VellumDestinationCard 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/ui/src/components/dashboard/vellum/VellumDestinationCard.tsx"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"e17defd1fa992a62342b60fa5a0cfbce9120c34af73717b1f90c12d4bdfe951f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SpecValidationPanel (cyclomatic 11, cognitive 10): SpecValidationPanel 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/ui/src/components/files/FilesWorkspace.tsx"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d90a1a8003004cbde3b085f1b35494571bbed538d0811e9078f36eaf99f721"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function PluginFileContent (cyclomatic 11, cognitive 10): PluginFileContent 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/ui/src/components/specs/PluginDetailPage.tsx"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef0ce5a8c6141bc45f928ed24cd1983c2e240c23201fb263721586d9bebae040"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SkillFileContent (cyclomatic 11, cognitive 10): SkillFileContent 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/ui/src/components/specs/SkillDetailPage.tsx"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c258f2555bc83054c0b3b2a9416fd4f207d9fae003bd2ef177c213ad9435ecd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function RigGroupNodeInner (cyclomatic 11, cognitive 10): RigGroupNodeInner 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/ui/src/components/topology/RigGroupNode.tsx"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d98829d66243eb12c3fddcf8874164686fd7f8eaa5fa6e1a3932a6e8ac34863"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function CmuxButton (cyclomatic 11, cognitive 10): CmuxButton 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/ui/src/components/topology/TopologyTableView.tsx"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"29de870424d92c7ea4bf8cb4442517afc9b90da33f03c9bc0f8e10be0afb878d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function queueBody (cyclomatic 11, cognitive 10): queueBody 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/ui/src/lib/feed-classifier.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e530542b0f0a0a2e48245f781b37cba60c7e5475bb89339d7a20f001613ce4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) 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/ui/test/live-node-details.test.tsx"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b788d6535421857dfecba1347472900fd8f04d64bb0589077f81933047db98c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function derivePackageArtifacts (cyclomatic 11, cognitive 10): derivePackageArtifacts 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":"scripts/check-substance-gate.mjs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"229214c980cb7bd9b80a297d5a11c3112af5d2b838160094379eb96c9284a22a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateTermRules (cyclomatic 11, cognitive 10): validateTermRules 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":"scripts/leak-guard-rules.mjs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6fefbe7c9cf7d497b47c6ab4254f05e448a66053051f4ae4a8acb302ed95766"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function move (cyclomatic 11, cognitive 9): move 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/daemon/assets/herdr-app/mods/rig-strip/main.js"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd03298f2eb9516996cd1533c781db3566b551b8c125e0a10ec8152182dce26e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveRegistryRoot (cyclomatic 11, cognitive 9): resolveRegistryRoot 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/daemon/src/domain/agent-starter-resolver.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"238929d77dba877a7c10764b83006bf9540c6ded566e5d97709a3709cbd54583"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeCodexTokenCount (cyclomatic 11, cognitive 9): normalizeCodexTokenCount 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/daemon/src/domain/context-usage-store.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fce3d8fd8015637e0965d72cd4f483db5b97983826f2fd089e692c6c3bc1ca1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function expectedConversation (cyclomatic 11, cognitive 9): expectedConversation 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/daemon/src/domain/expected-conversation.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"292173831819bfdd0ef3682b001f29e4be42bb862ca6fa3c2e65834d655acef0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateProcessLimits (cyclomatic 11, cognitive 9): validateProcessLimits 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/daemon/src/domain/process-limits.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"4975f38e7ccb6be4c8d5ef174524984255e8f144cf641c4aec511d17d7ac4035"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function polledBacklogText (cyclomatic 11, cognitive 9): polledBacklogText 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/daemon/src/domain/queue-stuck-sweep.ts"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"56062c9a3b2138fa7122f8a55839aeb9db453b7cb3577534c28c88787b3f62ba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspectCorePlugin (cyclomatic 11, cognitive 9): inspectCorePlugin 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/daemon/src/domain/restore-check-service.ts"},"region":{"startLine":1322}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab1d0827f99ffe1437c779f86dac4bfc696fa817b5d83b64af22b6da6ae8b78"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function persistRigStartupLayers (cyclomatic 11, cognitive 9): persistRigStartupLayers 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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":2367}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d711e9f7469ac0b67d85c2136ba15844603ac6d948d99fed191edeacd8a9f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveTargetPath (cyclomatic 11, cognitive 9): resolveTargetPath 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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":2697}}}],"partialFingerprints":{"codehealthFindingId/v1":"959128f1f56c23698d63a5bb927613f1271704d17c52ae9a4a9b31d22a1aef26"}},{"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/daemon/src/domain/seat-identity-reconciler.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"177c9066797927f20a009ddd6f184cb74caad329d93adb40422b9d4137eb3b88"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startupGateStep (cyclomatic 11, cognitive 9): startupGateStep 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/daemon/src/domain/seat-restart-in-place.ts"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e1b79b415c7a49804bb923a48610496cd08bcb869ad75e8c838d9c07f698858"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nextLaunch (cyclomatic 11, cognitive 9): nextLaunch 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/daemon/src/routes/provider.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ef4e97ac08867fba94c9762b1e0a3fb4cb22d1fadaca71b8a2e89b784fd685"}},{"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/daemon/src/routes/scopes.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f023ad200a0e7fd91653741b82207e092b8ec4405f0fe6142c2f73e3dfc6d69"}},{"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/daemon/src/server.ts"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"b92570e214ababd12b526e18e8914d1186363d786f75d40d606271f5b222d35b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compareBuilds (cyclomatic 11, cognitive 9): compareBuilds 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/tui/src/version-skew.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"dffe0d22f02d51fb1aef097bbae820304066e43c6ad245f93d4fa7fbcce4d656"}},{"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/ui/test/mission-progress-heatmap.test.tsx"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"b967d8e1b0946440e2fd2f44ab7d54bff91602307743948388d3a3b3db69d1cb"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/queue-repository.ts: 6154 lines of code: packages/daemon/src/domain/queue-repository.ts has 6154 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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5729875642420f668c5e3c644fd939416964ae0e57d78c95a7388fe12207978"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/session-transport.ts: 5199 lines of code: packages/daemon/src/domain/session-transport.ts has 5199 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a97ca76d24b2716d98e273fe4550353759c735b20278a0fa9cb5847a724a8a"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/rigspec-instantiator.ts: 3145 lines of code: packages/daemon/src/domain/rigspec-instantiator.ts has 3145 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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c96e49ab188c27c6c51954eb87741c3a6923977cd90d57fc8f0e42626616c1"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/startup.ts: 3063 lines of code: packages/daemon/src/startup.ts has 3063 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/daemon/src/startup.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2394d9a24cea6a62617304ebd76694410d54e00f9d8f09d0887215a130553fa3"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/restore-orchestrator.ts: 3052 lines of code: packages/daemon/src/domain/restore-orchestrator.ts has 3052 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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41fcba510eb420d09affb601ec78981c1eba6e8cfd92a83294f189074ec6875f"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/adapters/codex-runtime-adapter.ts: 2907 lines of code: packages/daemon/src/adapters/codex-runtime-adapter.ts has 2907 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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e0383bc80c74d930749fa8b2ae16539f13199385da4531dd37f060362628850"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/adapters/tmux.ts: 2892 lines of code: packages/daemon/src/adapters/tmux.ts has 2892 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/daemon/src/adapters/tmux.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"470a72dc5c220a863028af6e6daf1ea71bef80ab1a9ab38db4524ac2c3fc7936"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/cli/src/commands/queue.ts: 2636 lines of code: packages/cli/src/commands/queue.ts has 2636 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/commands/queue.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e1cf706d6d9de6d05785dceea6b5da419454d45b9340b56f077faa92f6b906b"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/cli/src/mcp-server.ts: 2610 lines of code: packages/cli/src/mcp-server.ts has 2610 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/mcp-server.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7af07f2865e2dc186edf0b04358ce82709b797591e5c521b19fd89368d5205"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/adapters/pi-runner.ts: 2517 lines of code: packages/daemon/src/adapters/pi-runner.ts has 2517 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ddc2633a0cd3e013fd625695e69d9ce6915fb0f275a656160e717af95911a6e"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/seat-lifecycle-service.ts: 2472 lines of code: packages/daemon/src/domain/seat-lifecycle-service.ts has 2472 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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4833f2e94710f1078221ff68561e69724dbce19f3f41551df34bf4f8088de3e2"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/cli/src/commands/scope.ts: 2318 lines of code: packages/cli/src/commands/scope.ts has 2318 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/commands/scope.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d1dc1a522ee3ca8dbf8f542489c5abbbed69087475680c77d92338b3e723480"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/claude-compaction-enforcer.ts: 2304 lines of code: packages/daemon/src/domain/claude-compaction-enforcer.ts has 2304 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a16e8934e2242c7eeacf451434289dd708208ab627546797663cac14f2cf37"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/seat-handover-service.ts: 2179 lines of code: packages/daemon/src/domain/seat-handover-service.ts has 2179 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/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a787e26d210029fa4558912b864d2946a2afc83803bc42a8dccd790012548fb"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/tui/src/render.ts: 2077 lines of code: packages/tui/src/render.ts has 2077 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/tui/src/render.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"677214bba17d4a02b75f237896001bbd995597b39f04f89749a8d1fc1c9eea50"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/workflow-projector.ts: 2050 lines of code: packages/daemon/src/domain/workflow-projector.ts has 2050 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/daemon/src/domain/workflow-projector.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ff4e5aefecf882832a519d0207b13024f181da53345df88ecf158bfc764d32"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/cli/src/commands/seat.ts: 2005 lines of code: packages/cli/src/commands/seat.ts has 2005 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/commands/seat.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0d44543dff1e865586e9e31ac56393536338df23107a6b19b9f99e06c69275"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/workflow-runtime.ts: 1974 lines of code: packages/daemon/src/domain/workflow-runtime.ts has 1974 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/daemon/src/domain/workflow-runtime.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13601c524a33b8fd779031d2d7313dd09118aae35b8fda31d4327fb6172a0660"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/queue-stuck-sweep.ts: 1957 lines of code: packages/daemon/src/domain/queue-stuck-sweep.ts has 1957 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/daemon/src/domain/queue-stuck-sweep.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c24cdc91a816fd8d555f674ee4dc25ba5256d1a5ebbdee5c2eae41e936ca195"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/node-inventory.ts: 1930 lines of code: packages/daemon/src/domain/node-inventory.ts has 1930 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/daemon/src/domain/node-inventory.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1dae321842379de44dc056135d99a0cad3d74e63b61a2253010de95d46c643a"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/cli/src/commands/ps.ts: 1922 lines of code: packages/cli/src/commands/ps.ts has 1922 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/commands/ps.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"487d9b1981618a3d20af9ced6e626ada92d3a8bd92205b238f98c393ada8c1fd"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/queue-wake-ladder.ts: 1896 lines of code: packages/daemon/src/domain/queue-wake-ladder.ts has 1896 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/daemon/src/domain/queue-wake-ladder.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b0680adc95eb3f440292ef067586f28f047f0a8e9b2677daf64a9dda18e935"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/routes/queue.ts: 1868 lines of code: packages/daemon/src/routes/queue.ts has 1868 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/daemon/src/routes/queue.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"227ae4f30d0483783ee39e6be3a718185c18308755828c9563e15fed9386e873"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/cli/src/config-store.ts: 1773 lines of code: packages/cli/src/config-store.ts has 1773 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/config-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"303064087cc791b287e7d6002fe3ce87675d51f8e96f33f3e3f8beac6e2abfd6"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/restore-check-service.ts: 1766 lines of code: packages/daemon/src/domain/restore-check-service.ts has 1766 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/daemon/src/domain/restore-check-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab5e9be04c0b900b6dfb9cf2c51936691327ade6ccc87e5143c5ed9fea55069"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/types.ts: 1659 lines of code: packages/daemon/src/domain/types.ts has 1659 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/daemon/src/domain/types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0effa8dd2ef32755904a671adb91b32412876f16941009e99c989e7d173a276"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/slices/slice-indexer.ts: 1634 lines of code: packages/daemon/src/domain/slices/slice-indexer.ts has 1634 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/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"429e60ac4937d1aa59de7f81496a7676192e1d76bbea9f376a754c0becda58ea"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/user-settings/settings-store.ts: 1546 lines of code: packages/daemon/src/domain/user-settings/settings-store.ts has 1546 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/daemon/src/domain/user-settings/settings-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df506edd25263ccc04be5e580aa33b442cf88d3b423872b4d76428c29c859cb"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/gateway/slack/slack-subsystem.ts: 1517 lines of code: packages/daemon/src/domain/gateway/slack/slack-subsystem.ts has 1517 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/daemon/src/domain/gateway/slack/slack-subsystem.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b64aa7e000ea2a6d341c1d0ee56303a6f7adaa48e7a1e30c8856935eca16d17"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/cli/src/daemon-lifecycle.ts: 1488 lines of code: packages/cli/src/daemon-lifecycle.ts has 1488 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/daemon-lifecycle.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21c4619ef0dd6f828057095addcc706c41ef25f0ef1c809a1ce3e135ede3904"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/adapters/claude-code-adapter.ts: 1447 lines of code: packages/daemon/src/adapters/claude-code-adapter.ts has 1447 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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41c8df2e5f7393b275998a65d14d483640252eb0eb3a8cc5bf2ff32a2b59543"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/rigspec-schema.ts: 1443 lines of code: packages/daemon/src/domain/rigspec-schema.ts has 1443 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/daemon/src/domain/rigspec-schema.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d9c5f5bbd224ddc55731a16bbbeedc50262410cd53e65bd3b729cf007f437c"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/startup-orchestrator.ts: 1406 lines of code: packages/daemon/src/domain/startup-orchestrator.ts has 1406 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/daemon/src/domain/startup-orchestrator.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"326c02b6c0f9e0f0e2626ab605646a4e45f0726649181bbcb82adfd4fa028008"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/execution-view.ts: 1383 lines of code: packages/daemon/src/domain/execution-view.ts has 1383 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/daemon/src/domain/execution-view.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b669aeaded4fec97b7e81e7c85d720e32cf8bb63e492230f77f74aa7a11d0b"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/skill-catalog.ts: 1343 lines of code: packages/daemon/src/domain/skill-catalog.ts has 1343 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/daemon/src/domain/skill-catalog.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b86a1c9f44464c37e4dbd31bd279017e3a2f8b2d360231b17a95104745438e6"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/ui/src/components/project/ScopePages.tsx: 1334 lines of code: packages/ui/src/components/project/ScopePages.tsx has 1334 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/ui/src/components/project/ScopePages.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af5cfaebe90e10a4e129733af82513eddc0ac7b35ccb9b103718cee68f45fb5e"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/rig-repository.ts: 1310 lines of code: packages/daemon/src/domain/rig-repository.ts has 1310 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/daemon/src/domain/rig-repository.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"002d424a5b1461ff3495641d38241cb0cd689502605e9447a8eaaf7c685079b3"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/review/compose.ts: 1308 lines of code: packages/daemon/src/domain/review/compose.ts has 1308 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/daemon/src/domain/review/compose.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d3ca6eb0509a5d92b66c26acde777446ea3dd0b539f1bdb1c6bb1ea895082e7"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/routes/bundles.ts: 1230 lines of code: packages/daemon/src/routes/bundles.ts has 1230 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/daemon/src/routes/bundles.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a7b39fe41b6388b5136c4ca32a2f06e37c3231c424d8a99bcbbff3112c32b23"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/seat-skill-storage.ts: 1216 lines of code: packages/daemon/src/domain/seat-skill-storage.ts has 1216 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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73093da50f2de14c62704228cb4cc64c0d4d62ce49c948e67beddd7c08d748f2"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/seat-restart-in-place.ts: 1209 lines of code: packages/daemon/src/domain/seat-restart-in-place.ts has 1209 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/daemon/src/domain/seat-restart-in-place.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4d106878f7c67c00d505c5860d46ac8cec92a9cdbf87bd77321d85ab42796f"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/routes/activity.ts: 1208 lines of code: packages/daemon/src/routes/activity.ts has 1208 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/daemon/src/routes/activity.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b70b449d58cd90ca2dbd22fcbe45864176ed83963246e794eb30f8c2194326"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/cli/src/commands/send.ts: 1201 lines of code: packages/cli/src/commands/send.ts has 1201 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/commands/send.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fb9bbafd8a7e772b25b36d3e47f0adf331f85f34e59a847b8f4ec3787fa6e49"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/workflow-spec-cache.ts: 1174 lines of code: packages/daemon/src/domain/workflow-spec-cache.ts has 1174 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/daemon/src/domain/workflow-spec-cache.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c613a49041092302fb833c1de8e86849af23c3dc8cf0229c4c3ad8b6bd2de20b"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/queue-erasure.ts: 1136 lines of code: packages/daemon/src/domain/queue-erasure.ts has 1136 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/daemon/src/domain/queue-erasure.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86212bb74abfbbe1439f4b200e692fb02f4db1c439a61db6025457dd2e5c3ba3"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/gateway/relay-inbound.ts: 1103 lines of code: packages/daemon/src/domain/gateway/relay-inbound.ts has 1103 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/daemon/src/domain/gateway/relay-inbound.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58a16c7d7509bc7dc87c137706fb0d78ab71829e51e3e7f360df87fb9d8ab1f"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/native-resume-probe.ts: 1084 lines of code: packages/daemon/src/domain/native-resume-probe.ts has 1084 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/daemon/src/domain/native-resume-probe.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd1da2189caa4f09904d4320a440cbf83ca0ce4a4c3a8bf1effb086a3691adb9"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/gateway/slack/inbound.ts: 1078 lines of code: packages/daemon/src/domain/gateway/slack/inbound.ts has 1078 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/daemon/src/domain/gateway/slack/inbound.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"268bbb6f4606469b3ea8d314eb2de8c6736b76c03f4ee86b4e78c6f75ed41ecc"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/seat-activity-service.ts: 1070 lines of code: packages/daemon/src/domain/seat-activity-service.ts has 1070 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/daemon/src/domain/seat-activity-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb592c7800dac0707e6c24229ed71163b62e664999710848851491b410617ed7"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/cli/src/commands/host.ts: 1057 lines of code: packages/cli/src/commands/host.ts has 1057 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/commands/host.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55131dae14ccfda786bcf30eb9aa25a29eb84972d4857ebb3e96f57915129873"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/cli/src/commands/workflow.ts: 1053 lines of code: packages/cli/src/commands/workflow.ts has 1053 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/commands/workflow.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7616f7effa176f99c3277466164e810f24db60e5b92aeed3b0f90f0c808c749"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/gateway/human-registry.ts: 1048 lines of code: packages/daemon/src/domain/gateway/human-registry.ts has 1048 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/daemon/src/domain/gateway/human-registry.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5efa74c3e058bdc155ff138284f90f41a98e7b7dd2b1609079896e550c23e4e7"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/native-process-lineage.ts: 1032 lines of code: packages/daemon/src/domain/native-process-lineage.ts has 1032 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/daemon/src/domain/native-process-lineage.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"daa5d7e581c5fa42656ac8ac79b7228fc9ac6d006b39282864d5a16b03917237"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/cli/src/commands/context.ts: 1008 lines of code: packages/cli/src/commands/context.ts has 1008 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/commands/context.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5135a2c961a8087ba563978959a3a24bbf314dfe69ce330654c52cf99741fd5"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/server.ts: 980 lines of code: packages/daemon/src/server.ts has 980 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/daemon/src/server.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a472cd19d3e25d92d1a99add59a82217bffc0d3c8209cadab3766952008f5c9"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/session-registry.ts: 958 lines of code: packages/daemon/src/domain/session-registry.ts has 958 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/daemon/src/domain/session-registry.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"624a381810b2dc23273930b685a1cfa642511c7a9810e7a47af57d82585f8795"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/mission-control/mission-control-write-contract.ts: 954 lines of code: packages/daemon/src/domain/mission-control/mission-control-write-contract.ts has 954 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/daemon/src/domain/mission-control/mission-control-write-contract.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1912424defa3153f5d51c29e9317bbb5752d152996c692cb8a9e7aece0fb8d99"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/watchdog-policy-engine.ts: 951 lines of code: packages/daemon/src/domain/watchdog-policy-engine.ts has 951 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/daemon/src/domain/watchdog-policy-engine.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"224d012a08e03acc917f236c0e9007256eb6d4d3e272031f2f1806a2ca8639a5"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/review/gather.ts: 945 lines of code: packages/daemon/src/domain/review/gather.ts has 945 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/daemon/src/domain/review/gather.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3671547a0b78d586e8a12b1e891cc3d984712181e72d524d97a0a6abd7295b"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/bootstrap-orchestrator.ts: 928 lines of code: packages/daemon/src/domain/bootstrap-orchestrator.ts has 928 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/daemon/src/domain/bootstrap-orchestrator.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e8a32d430c5df20e4b678c07191bfa4d66e2bd73d55660b22a9bd7f1130d0b"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/cli/src/commands/setup.ts: 915 lines of code: packages/cli/src/commands/setup.ts has 915 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/commands/setup.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cbf37d19592e3d4a1f2bc6ff943e5fabf4326bd32cdb1602d8060402bcc8754"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/gateway/relay-outbound.ts: 915 lines of code: packages/daemon/src/domain/gateway/relay-outbound.ts has 915 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/daemon/src/domain/gateway/relay-outbound.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79904bf3c4658c6c9941713d515098e6658f8f3c31f9659d51c0316a27fe0d10"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/tui/src/hydrate.ts: 913 lines of code: packages/tui/src/hydrate.ts has 913 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/tui/src/hydrate.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14672c197977086bfff7e3b181288797cfa26c8c49c6a956802821e3f01f0613"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/cli/src/commands/up.ts: 894 lines of code: packages/cli/src/commands/up.ts has 894 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/commands/up.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b94fa0e467a93654d2ff8ba6325d29c26be122eb478b959a3399725709923f7a"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/rig-lifecycle-service.ts: 892 lines of code: packages/daemon/src/domain/rig-lifecycle-service.ts has 892 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/daemon/src/domain/rig-lifecycle-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"903a14bbdf3ddfc8916ff6b7fb3faf7ca7c6a5f0bf730f1e74291d80454e5606"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/seat-attention-reconciler.ts: 892 lines of code: packages/daemon/src/domain/seat-attention-reconciler.ts has 892 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/daemon/src/domain/seat-attention-reconciler.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ba64e55d5c1d1caabe2e0d002d16ff08d1b159b64c224de5a5188a5e0a9bb9"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/current-work.ts: 884 lines of code: packages/daemon/src/domain/current-work.ts has 884 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/daemon/src/domain/current-work.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1ef15dac7f3f6113a818e89bf44e03295b35773d460da42cc668b5d28727b1"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/routes/sessions.ts: 882 lines of code: packages/daemon/src/routes/sessions.ts has 882 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/daemon/src/routes/sessions.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f07697538395fd022a5d7d9215fd9de47a69fff6fd113d2f0bb8d956d4ad8a54"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/slices/slice-detail-projector.ts: 856 lines of code: packages/daemon/src/domain/slices/slice-detail-projector.ts has 856 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/daemon/src/domain/slices/slice-detail-projector.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af2f86e77eb0d04126a3469049a25a3ea63e7a65010b3fbf2067b17b5153aed"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/watchdog-jobs-repository.ts: 855 lines of code: packages/daemon/src/domain/watchdog-jobs-repository.ts has 855 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/daemon/src/domain/watchdog-jobs-repository.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"403b68664e679744979d3d36bbf5f2f9ffcd41f599d90ef89227d7b518d14fb3"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/claim-service.ts: 850 lines of code: packages/daemon/src/domain/claim-service.ts has 850 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/daemon/src/domain/claim-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"578153e34313e61ac180dc80c29285ed0ccd88586f11650bb0296ddad54860c2"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/seat-runtime-switch-service.ts: 850 lines of code: packages/daemon/src/domain/seat-runtime-switch-service.ts has 850 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/daemon/src/domain/seat-runtime-switch-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33691f43c4fbaf5bebc2a608c1a24b0081245fe7d84625c60266f9eeb75c1efa"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/routes/hosts.ts: 823 lines of code: packages/daemon/src/routes/hosts.ts has 823 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/daemon/src/routes/hosts.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e636471e689401f92518720585b597453dcb4ecc6182f4dd9e3afe9116e4fb79"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/cli/src/lib/scope/scope-fs.ts: 819 lines of code: packages/cli/src/lib/scope/scope-fs.ts has 819 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/lib/scope/scope-fs.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"884a7126f3f07ad18f225c4d07b4d63bf5f18bf3933c2f2861d59393bffd60bd"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/tui/src/execution/execution-model.ts: 819 lines of code: packages/tui/src/execution/execution-model.ts has 819 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/tui/src/execution/execution-model.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"edfe453b57ccf273c99085d55f037e3e2b55ebac2c9ae2ce48a5fb4a0969f70a"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/cli/src/commands/provider.ts: 817 lines of code: packages/cli/src/commands/provider.ts has 817 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/commands/provider.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a6bac367ceacbb706078d9e0d9dda3d478aed41e4e2147c0ecb1efbdaab0060"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/gateway/slack/slack-delivery.ts: 811 lines of code: packages/daemon/src/domain/gateway/slack/slack-delivery.ts has 811 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/daemon/src/domain/gateway/slack/slack-delivery.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df62a4824dd0028480565dacaaa4b900ee84be538d857166982ba5fbe728da85"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/queue-transition-log.ts: 807 lines of code: packages/daemon/src/domain/queue-transition-log.ts has 807 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/daemon/src/domain/queue-transition-log.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd38af497726f84a88839601731b454077e000aa955cf0210e69962ead7ceb2"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/cli/src/commands/gateway.ts: 805 lines of code: packages/cli/src/commands/gateway.ts has 805 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/commands/gateway.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d68b50b8a13ab900973ac97125fa6f67c4560390ecbe0eedc555c8d2b4a64af"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/routes/rigs.ts: 805 lines of code: packages/daemon/src/routes/rigs.ts has 805 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/daemon/src/routes/rigs.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"562d815115a6da8f3a012d4bce2dccb6ab0fd921d0b275685a1765ee41eea1f3"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/tui/src/main.ts: 804 lines of code: packages/tui/src/main.ts has 804 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/tui/src/main.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e66969d907b551642264ef09674cfbf4ae27c1c3f086698658599ef819bcdb1"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/outbox-handler.ts: 776 lines of code: packages/daemon/src/domain/outbox-handler.ts has 776 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/daemon/src/domain/outbox-handler.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5030d239f90ab3fe09af258d092037dc83cd315fb027b3c3b544e6a8f0bf6fa1"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/bundle-types.ts: 750 lines of code: packages/daemon/src/domain/bundle-types.ts has 750 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/daemon/src/domain/bundle-types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1b6a8614013765d5311c0861d5924ba449221d08fa0baf9946fdbfd6208751"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/plugin-discovery-service.ts: 745 lines of code: packages/daemon/src/domain/plugin-discovery-service.ts has 745 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/daemon/src/domain/plugin-discovery-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"441415084c29a58c51ccd9ed4835b154522d617135cc56d87190b1a96e49a97d"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/tui/src/state.ts: 739 lines of code: packages/tui/src/state.ts has 739 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/tui/src/state.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e9480aee9ef152893bddedb01ff49537e953a403d9194d56d1cf9ffd809eb31"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/ui/src/components/for-you/FeedCardQuestionAsk.tsx: 736 lines of code: packages/ui/src/components/for-you/FeedCardQuestionAsk.tsx has 736 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/ui/src/components/for-you/FeedCardQuestionAsk.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b320118673df144228a620fc771e13c60631d62f87e9cc06462a542f4ff6fa95"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/agent-activity-store.ts: 734 lines of code: packages/daemon/src/domain/agent-activity-store.ts has 734 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/daemon/src/domain/agent-activity-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdad48b81ddd6a3044390cc23565e80efce6a767d779f875c53a917efd4a92a6"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/tui/src/types.ts: 725 lines of code: packages/tui/src/types.ts has 725 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/tui/src/types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38e3043a27b7079e89b06ad0300ac4d0c5a96ef721fb4ef13e28726b8046ca3"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/ui/src/components/LiveNodeDetails.tsx: 722 lines of code: packages/ui/src/components/LiveNodeDetails.tsx has 722 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/ui/src/components/LiveNodeDetails.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce96576b14641fc79d187a76a0b31b42c377931835cbfd0810b0479eea38f481"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/routes/seat.ts: 715 lines of code: packages/daemon/src/routes/seat.ts has 715 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/daemon/src/routes/seat.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dffc6f06951c081900ce39e990098ec4ba5556db54d1885e28280445bb7c462"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/ui/src/components/feed/cards/storytelling-cards.tsx: 708 lines of code: packages/ui/src/components/feed/cards/storytelling-cards.tsx has 708 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/ui/src/components/feed/cards/storytelling-cards.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b4ebb2329eb7eb965ac18991df9b6ed2017b3b062011fdaf8dd65ca43bd847d"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/adapters/tmux-control.ts: 703 lines of code: packages/daemon/src/adapters/tmux-control.ts has 703 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/daemon/src/adapters/tmux-control.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ef2712a8dd9bd5cfa81f1a10c791b7e3d28cb28d09d40cc3400dfec05555df"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/terminal/herdr-adapter.ts: 692 lines of code: packages/daemon/src/domain/terminal/herdr-adapter.ts has 692 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/daemon/src/domain/terminal/herdr-adapter.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eccf3199a9604e81b08d5a3da6828b9cc582e0826af895665c0340496e77ce93"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/ui/src/components/lab/VellumBackgroundLab.tsx: 683 lines of code: packages/ui/src/components/lab/VellumBackgroundLab.tsx has 683 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/ui/src/components/lab/VellumBackgroundLab.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61801da87efc968a712370e876e1b0f12f66ddb97fa6ffa8361e5d5296d3deec"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/terminal/TerminalSessionBroker.ts: 675 lines of code: packages/daemon/src/terminal/TerminalSessionBroker.ts has 675 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/daemon/src/terminal/TerminalSessionBroker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea60e4be8c1c1e310c7074a21def9d05573066bd4826a1f13d1928655d8d551a"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/ui/src/components/AppShell.tsx: 675 lines of code: packages/ui/src/components/AppShell.tsx has 675 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/ui/src/components/AppShell.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab75ee6262c9f5e5e1eb533228bbcc8fad8b03e10d12783876448886449180a3"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/ui/src/components/LibraryReview.tsx: 669 lines of code: packages/ui/src/components/LibraryReview.tsx has 669 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/ui/src/components/LibraryReview.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb5e41a4153e5d648d514e54c42a403dd462ae1e147cd1fca1cf41bbfa88e03"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/routes/context-packs.ts: 665 lines of code: packages/daemon/src/routes/context-packs.ts has 665 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/daemon/src/routes/context-packs.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e0a300af8d2ea64c50239ad9a6fbc4de70be37a64c190e013ebe65818727fc"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/ui/src/components/for-you/FeedCard.tsx: 665 lines of code: packages/ui/src/components/for-you/FeedCard.tsx has 665 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/ui/src/components/for-you/FeedCard.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f2b83832a48193efa0d3d7c62cbfb7827487e24328e8726cc24c37c03e5415"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/cli/src/commands/whoami.ts: 661 lines of code: packages/cli/src/commands/whoami.ts has 661 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/commands/whoami.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e59bc24bf7b9d2fb4f24caa7a8866738b6876b3d05c197904d985a1caa90a4"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/terminal/herdr-app-provider.ts: 651 lines of code: packages/daemon/src/domain/terminal/herdr-app-provider.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/daemon/src/domain/terminal/herdr-app-provider.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f797d8e6b008ffbf2dacc9ee284ce1c3e0b41c5597113941984bada5754b96"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/workspace/workspace-doctor.ts: 648 lines of code: packages/daemon/src/domain/workspace/workspace-doctor.ts has 648 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/daemon/src/domain/workspace/workspace-doctor.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae045c4e4cb682f050e5677d58dee0d23c3b2eae84c4b1a3d3f321be4b11a44"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/seat-delivery-guard.ts: 646 lines of code: packages/daemon/src/domain/seat-delivery-guard.ts has 646 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/daemon/src/domain/seat-delivery-guard.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4eafb55744d2ab64233bd4e14aef8453c0a0bd34464a29f300a507865510dc"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/cli/src/commands/doctor.ts: 642 lines of code: packages/cli/src/commands/doctor.ts has 642 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/commands/doctor.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b268a952feff98310673bdf3475e954930440558dba326a91b0413a1ad0fcb"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/seat-identity-reconciler.ts: 638 lines of code: packages/daemon/src/domain/seat-identity-reconciler.ts has 638 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/daemon/src/domain/seat-identity-reconciler.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb3d9785769ced576973708b3bae52968a961f74239884a118fb36eab6d6a61"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/provider/usage-across-hosts.ts: 636 lines of code: packages/daemon/src/domain/provider/usage-across-hosts.ts has 636 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/daemon/src/domain/provider/usage-across-hosts.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a69dcf8575c33382b401dcbbbe97a9b08bcd78cb4f54448bfb5a770380231ae3"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/rig-teardown.ts: 628 lines of code: packages/daemon/src/domain/rig-teardown.ts has 628 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/daemon/src/domain/rig-teardown.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea08eda30c4c030911eba4fcddbe32a71c7b7272ed1b844b1f62715c4be9662"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/successor-session-launcher.ts: 625 lines of code: packages/daemon/src/domain/successor-session-launcher.ts has 625 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/daemon/src/domain/successor-session-launcher.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6809d282f43d3f1889bb0fee6fcc8fa9063f9ee2b4354fa504220717069ba1d6"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/routes/startup.ts: 619 lines of code: packages/daemon/src/routes/startup.ts has 619 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/daemon/src/routes/startup.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91cf63edfb07b86cc908c13e6d58412c4f1f3194d9524f0497b49d9807f9e37"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/profile-resolver.ts: 617 lines of code: packages/daemon/src/domain/profile-resolver.ts has 617 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/daemon/src/domain/profile-resolver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c741be68cdea57e7623c45cae584b3dcd2cee9d2e09914e05776c8f3eebd70c2"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/adapters/pi-runtime-adapter.ts: 608 lines of code: packages/daemon/src/adapters/pi-runtime-adapter.ts has 608 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/daemon/src/adapters/pi-runtime-adapter.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff572779a110add1540c1c1cbdabb9b8cf5c3df1609bd7e2fec188f2d5afb78"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/terminal/terminal-service.ts: 608 lines of code: packages/daemon/src/domain/terminal/terminal-service.ts has 608 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/daemon/src/domain/terminal/terminal-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80ff9980fd644acb5eb77268c9a0bed001ccf5a42c5661561fb5425ae846b83a"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/queue-retention.ts: 607 lines of code: packages/daemon/src/domain/queue-retention.ts has 607 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/daemon/src/domain/queue-retention.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"110c1fec909d9cedcbc638b05dec3dba8dd541ec43c50b3c32f925b4f948f5bf"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/cli/src/commands/slack.ts: 602 lines of code: packages/cli/src/commands/slack.ts has 602 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/commands/slack.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40bdd9aa98c978b98ba18ee98b2890dd4f4117c6a8e0a312cbe4cb3a79ea9ab0"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/cli/src/commands/start.ts: 601 lines of code: packages/cli/src/commands/start.ts has 601 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/commands/start.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72711cfd5cfd4efb7b1c558b3eee221781f83b9cb4cd1bc38e08914b9f609d67"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/gateway/slack/message.ts: 601 lines of code: packages/daemon/src/domain/gateway/slack/message.ts has 601 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/daemon/src/domain/gateway/slack/message.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae106d82f31b4b853d526a530f1d83d86de43b4a378a5f6edb95ec7a74c48d2"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/cli/src/commands/rig-mode.ts: 600 lines of code: packages/cli/src/commands/rig-mode.ts has 600 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/commands/rig-mode.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af3ef6aae825217bc899cdc1486be3228db6228479ba04629316c483c2f6d54c"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/rigspec-preflight.ts: 577 lines of code: packages/daemon/src/domain/rigspec-preflight.ts has 577 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/daemon/src/domain/rigspec-preflight.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"042511174bf689461d9bb5d21c03430780b208bd040ca160b3f0874ad9d2f821"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/cli/src/commands/proof.ts: 571 lines of code: packages/cli/src/commands/proof.ts has 571 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/commands/proof.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bacf1d3065e39514076b0cb63786fa3155a33ebad1f0d777ba5df663dc3cab7d"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/spec-library-workflow-scanner.ts: 565 lines of code: packages/daemon/src/domain/spec-library-workflow-scanner.ts has 565 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/daemon/src/domain/spec-library-workflow-scanner.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0194ab488ec3163dad87eb4b33d93d23937a76fb06eec8417b5857504efb3f0f"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/cli/src/lib/scope/scope-audit.ts: 560 lines of code: packages/cli/src/lib/scope/scope-audit.ts has 560 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/lib/scope/scope-audit.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f6731bb590314f5904d1e8f78b62085a2d9ae54311ef3d9aa6922fe90e2b34"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/resume-metadata-refresher.ts: 560 lines of code: packages/daemon/src/domain/resume-metadata-refresher.ts has 560 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/daemon/src/domain/resume-metadata-refresher.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa3443920a468c2e02c75ef07ab087ae0a64e4a2bc30beed82348b5ca8eac63"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/scope/scope-audit.ts: 560 lines of code: packages/daemon/src/domain/scope/scope-audit.ts has 560 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/daemon/src/domain/scope/scope-audit.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1198a813f75facf8a713239cc774e4438b4bea9f6237493bd8119162d0472439"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/agent-manifest.ts: 559 lines of code: packages/daemon/src/domain/agent-manifest.ts has 559 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/daemon/src/domain/agent-manifest.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba51e0290e7e6e56c406b74d0d63cf8224c36929ebff45e22ef3ce19beb3b3c"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/health-detectors.ts: 558 lines of code: packages/daemon/src/domain/health-detectors.ts has 558 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/daemon/src/domain/health-detectors.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5789d4df12c1a4c7a6b1e7ce85d85db6364c88f4ec5b366eace51c80fdbe5fae"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/ui/src/components/files/FilesWorkspace.tsx: 554 lines of code: packages/ui/src/components/files/FilesWorkspace.tsx has 554 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/ui/src/components/files/FilesWorkspace.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f18aaa8b608ead1219202688649ad2ec541f6b012b2400d6fddfdb4af8b84474"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/workflow-instance-store.ts: 545 lines of code: packages/daemon/src/domain/workflow-instance-store.ts has 545 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/daemon/src/domain/workflow-instance-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d987b54f684984be911af68d9f950e18741c698a02205d4b3514fb58c32e6d4"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/ui/src/routes.tsx: 544 lines of code: packages/ui/src/routes.tsx has 544 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/ui/src/routes.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9791c756d76a6fd0a3f204135f993d7b773c41fc47b57230d294b048f18f1ce5"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/usage-series.ts: 543 lines of code: packages/daemon/src/domain/usage-series.ts has 543 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/daemon/src/domain/usage-series.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d60a6da8ec3092145141f8b258f076d6502027e9062789d08c562c0d31406c0d"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/hook-bridge.ts: 541 lines of code: packages/daemon/src/domain/hook-bridge.ts has 541 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/daemon/src/domain/hook-bridge.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0ca1e7dd4596ecb2c5dc6da32089007f04b32e90e244cb4a0205784c87fc9c4"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/cli/src/commands/exec.ts: 533 lines of code: packages/cli/src/commands/exec.ts has 533 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/commands/exec.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"563a542ac4bca8f971c16c7188937911de16ede2482d236b7a9d47bf74bf9d38"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/cli/src/mcp-http.ts: 532 lines of code: packages/cli/src/mcp-http.ts has 532 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/mcp-http.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1302ab10fe9df6c677dcee16093a93ed11505df65d56acfc2e8e44ee93715508"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/context-usage-store.ts: 532 lines of code: packages/daemon/src/domain/context-usage-store.ts has 532 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/daemon/src/domain/context-usage-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ad422b7579c2ec1bb39d02b43135c1bdfb9d0df8b62dd19659f081dee8819e"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/cli/src/commands/compact-plan.ts: 529 lines of code: packages/cli/src/commands/compact-plan.ts has 529 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/commands/compact-plan.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d80b57e853c249dca5c13691e1fd2b69a4f9006eb72bf8899c4e29a14a366947"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/codex-auth.ts: 522 lines of code: packages/daemon/src/domain/codex-auth.ts has 522 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/daemon/src/domain/codex-auth.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a95494df561e8bf10068ef22ee38cd373014ee504061dc2d8e53ad94986eebf4"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/routes/mission-control.ts: 522 lines of code: packages/daemon/src/routes/mission-control.ts has 522 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/daemon/src/routes/mission-control.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79d1a963b151ae4abe879acfead99761ccdf11f050470997450d33374c00646e"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/context-packs/manifest-parser.ts: 518 lines of code: packages/daemon/src/domain/context-packs/manifest-parser.ts has 518 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/daemon/src/domain/context-packs/manifest-parser.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8abc807825e4bb0650eead9146c4050ee171854d160dbe7ee4a3b08620a27703"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/tui/src/daemon-client.ts: 518 lines of code: packages/tui/src/daemon-client.ts has 518 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/tui/src/daemon-client.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2a8507e1746d4999f99adeb69c079b16df45f72708f0fc246c241be6d873d4"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/ui/src/components/topology/TerminalLauncher.tsx: 517 lines of code: packages/ui/src/components/topology/TerminalLauncher.tsx has 517 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/ui/src/components/topology/TerminalLauncher.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e185b760eb1547d7a7356f51154e4f0dddb3cdd32cc199689e166cec9ffa3209"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/ui/src/components/RigGraph.tsx: 516 lines of code: packages/ui/src/components/RigGraph.tsx has 516 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/ui/src/components/RigGraph.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"99fb162cc11533c2f78a5632ab4d759d8c4c1c86c85588577d35880d68a28040"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/ui/src/components/topology/TopologyTableView.tsx: 516 lines of code: packages/ui/src/components/topology/TopologyTableView.tsx has 516 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/ui/src/components/topology/TopologyTableView.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e9a6e3536d4256e0da20fbf42e45148b6b86199e0e492d5839e7a8c6b0468c"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/routes/workflow.ts: 512 lines of code: packages/daemon/src/routes/workflow.ts has 512 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/daemon/src/routes/workflow.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32b389547d6cdc04dd8a68f676a791fbc1844cbc1d3d3aa92858d9ec6fdb309b"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/cli/src/commands/restore-packet.ts: 510 lines of code: packages/cli/src/commands/restore-packet.ts has 510 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/commands/restore-packet.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6565a08259ac7ad08c4a6b6ab35b190559bfe9dff84c3b4b643bc826fa1d3c92"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/codex-thread-id.ts: 509 lines of code: packages/daemon/src/domain/codex-thread-id.ts has 509 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/daemon/src/domain/codex-thread-id.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed442c61e66cca5407ca141ed5977bdbdaf70eed16b5c5b0d1c04e615dd7dfe"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/gateway/slack/slack-api.ts: 505 lines of code: packages/daemon/src/domain/gateway/slack/slack-api.ts has 505 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/daemon/src/domain/gateway/slack/slack-api.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3598a5c145896fff490625a900fec4441f8951e64a1e29687276a4afc3420076"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/ui/src/components/for-you/Feed.tsx: 504 lines of code: packages/ui/src/components/for-you/Feed.tsx has 504 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/ui/src/components/for-you/Feed.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc5b94e545795298fe63c4a6460b79388f3c79e5133547fb8ebe5f9226fd47ae"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/cli/src/acp/agent-server.ts: 500 lines of code: packages/cli/src/acp/agent-server.ts has 500 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/acp/agent-server.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"18626c378beb6e055c0213d7d05a7dd19d365b97702950586c8ae0ff9aec32c5"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/gateway/slack/socket-inbound.ts: 500 lines of code: packages/daemon/src/domain/gateway/slack/socket-inbound.ts has 500 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/daemon/src/domain/gateway/slack/socket-inbound.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ac3c9667400230e7de9c06da2dd981048735339ed48deee6ba8b6912be6b2c"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/health-projection.ts: 496 lines of code: packages/daemon/src/domain/health-projection.ts has 496 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/daemon/src/domain/health-projection.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8704df6f4459a235285c430c9251341a1e3cb3fa6fb1eb6e85e4b2fd189542"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/index.ts: 496 lines of code: packages/daemon/src/index.ts has 496 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/daemon/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8cc8d014e63060d883c070512b2cfff53cd9c6dd174046b97f78a56e1d9d6b"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/cli/src/lib/work-install.ts: 494 lines of code: packages/cli/src/lib/work-install.ts has 494 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/lib/work-install.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f46e7f6e45137104e7d251539cbdb9a5b59c4754914c816531981572290d7f2"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/cli/src/commands/restore-check.ts: 493 lines of code: packages/cli/src/commands/restore-check.ts has 493 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/commands/restore-check.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"526f1ba5ac385b5b8457c186aa86d2568a4b4ec5c8b03aa93898089042d48169"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/routes/gateway.ts: 491 lines of code: packages/daemon/src/routes/gateway.ts has 491 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/daemon/src/routes/gateway.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a90fedccfc94d392d75cc37c7c8127404aab658de0650538be3d0d321ab284"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/ui/src/components/PackageInstallFlow.tsx: 490 lines of code: packages/ui/src/components/PackageInstallFlow.tsx has 490 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/ui/src/components/PackageInstallFlow.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6a25410e218ed575cf5792ceb1dd5cc7e35baa24a5fde8bad844a0b3081582"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/routes/provider.ts: 487 lines of code: packages/daemon/src/routes/provider.ts has 487 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/daemon/src/routes/provider.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf858213c2c6b0987d68d5123845c810834e9218d53558fbf3259959474d466"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/ui/src/lib/hybrid-layout.ts: 482 lines of code: packages/ui/src/lib/hybrid-layout.ts has 482 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/ui/src/lib/hybrid-layout.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78748ea27e9b7ced3b4e339d32b79d0e4262d411633e17fe5cdc81c25d141e1"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/routes/agent-images.ts: 478 lines of code: packages/daemon/src/routes/agent-images.ts 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":"packages/daemon/src/routes/agent-images.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"522841d5a6861d58c488f039aea7f303bbd5386fc171526f30786852b1466dcd"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/ui/src/components/graphics/RuntimeMark.tsx: 477 lines of code: packages/ui/src/components/graphics/RuntimeMark.tsx has 477 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/ui/src/components/graphics/RuntimeMark.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f6caf6df855717c4acd1886b1cff2788760cbe180f55a11cee496fe81c251a"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/package-manifest.ts: 476 lines of code: packages/daemon/src/domain/package-manifest.ts has 476 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/daemon/src/domain/package-manifest.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"352651a0010abd26d1c5646811ed3b4df5147bb3cac9b8efe52a1e1537e49c70"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/workflow-validator.ts: 475 lines of code: packages/daemon/src/domain/workflow-validator.ts has 475 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/daemon/src/domain/workflow-validator.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2923b395aefbcb53d12503b872154d09f6b551856dff9328bf28d1706e7b39d"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/cli/src/terminal-window.ts: 473 lines of code: packages/cli/src/terminal-window.ts has 473 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/terminal-window.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"462629cbb68d7947f420f0c1600f8b7db2c538e440d8f96dace4649257014626"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/scope/scope-approve.ts: 469 lines of code: packages/daemon/src/domain/scope/scope-approve.ts has 469 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/daemon/src/domain/scope/scope-approve.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb17c4e50215ed8bd31c8109cb9b17e9cfc07b5fe4876d278aaa81f5b8f4858"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/cli/src/commands/heartbeat.ts: 468 lines of code: packages/cli/src/commands/heartbeat.ts has 468 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/commands/heartbeat.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ea810551e5035b162ceb03432d1ecc252c158363ae45ce0ebe0b8724f98ca3"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/context-packs/context-pack-library-service.ts: 465 lines of code: packages/daemon/src/domain/context-packs/context-pack-library-service.ts has 465 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/daemon/src/domain/context-packs/context-pack-library-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd53b638bc6e950d99d0f81c18c5f86a8df9ab6ed896b532b4ed7050ad0cc68b"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/ui/src/components/project/ProjectTreeView.tsx: 464 lines of code: packages/ui/src/components/project/ProjectTreeView.tsx has 464 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/ui/src/components/project/ProjectTreeView.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"520918b1f28f0e527b4055fb1dba3f6f43a47c2b0c97147a5c881cd89edea01e"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/gateway/human-operating-modes.ts: 462 lines of code: packages/daemon/src/domain/gateway/human-operating-modes.ts has 462 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/daemon/src/domain/gateway/human-operating-modes.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e033912051730ab73277bd605a82ebb18d7a562044e26a84f27facc5634091"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/transcript-rotation.ts: 461 lines of code: packages/daemon/src/domain/transcript-rotation.ts has 461 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/daemon/src/domain/transcript-rotation.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"118585d2864e71cc4b03d62b080b051d7731b2c164b8891a54482b4faaa975c8"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/cli/src/host-registry.ts: 459 lines of code: packages/cli/src/host-registry.ts has 459 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/host-registry.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"957373c8d9293fae8baef0c5457073d439fa2c81e9245dd75dfb6ca510ee5070"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/bundle-behaviour.ts: 459 lines of code: packages/daemon/src/domain/bundle-behaviour.ts has 459 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/daemon/src/domain/bundle-behaviour.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b1dcf60d36df03152d5c720d25cddb567e1e2510aee5f6e514367ae05e93bf"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/runner-permissions.ts: 455 lines of code: packages/daemon/src/domain/runner-permissions.ts has 455 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/daemon/src/domain/runner-permissions.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6144281fe8d1e1420077fc716ccf98e911cb2338c16d66fc5f0c07512c97c35a"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/cli/src/commands/health.ts: 453 lines of code: packages/cli/src/commands/health.ts has 453 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/commands/health.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79955abec62dd3727d103a04ebae1b3f8f33e7dcfbcb701acc5eaa4116bab3cf"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/ui/src/components/markdown/MarkdownViewer.tsx: 450 lines of code: packages/ui/src/components/markdown/MarkdownViewer.tsx has 450 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/ui/src/components/markdown/MarkdownViewer.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7cfdacccf7257a16a0f121e92bda8bfb03fbf729184da2bbca3de63132599f0"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/view-projector.ts: 449 lines of code: packages/daemon/src/domain/view-projector.ts has 449 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/daemon/src/domain/view-projector.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12dee4ef7d784fc09d47dc402a4630c74032097942fcf99ae199041332b03fe4"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/ui/src/hooks/useSlices.ts: 445 lines of code: packages/ui/src/hooks/useSlices.ts has 445 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/ui/src/hooks/useSlices.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba0d31c8736c73cf790bac487d705925e74fc83bb5fcbc476d277a6559251d9"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/stream-intake.ts: 444 lines of code: packages/daemon/src/domain/stream-intake.ts has 444 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/daemon/src/domain/stream-intake.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8158617f77ab03be1f2eb622426603ff3c1dfb61ce4a6c54946375e70e291e52"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/cli/src/commands/plugin.ts: 443 lines of code: packages/cli/src/commands/plugin.ts has 443 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/commands/plugin.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b460dfeb2a278c77755088f3ce84398ac50a78bd8aa7de125d244d7dfcb3ad57"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/routes/transport.ts: 443 lines of code: packages/daemon/src/routes/transport.ts has 443 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/daemon/src/routes/transport.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"247084a3ea46d52c104e9905969635eb22ba9f964c6f502d95e341e8b4f3ac1a"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/ui/src/components/topology/ScopePages.tsx: 442 lines of code: packages/ui/src/components/topology/ScopePages.tsx has 442 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/ui/src/components/topology/ScopePages.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59f89c05eb5e1b36807e7de2a127dd8d69432c06345a22036438a80c603dad3"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/routes/slices.ts: 441 lines of code: packages/daemon/src/routes/slices.ts has 441 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/daemon/src/routes/slices.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"257a1cd52e9bb08017e4125490bf094d2d48761b73134f95bde7d38c3dd957aa"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/ui/src/components/terminal/FocusedTerminal.tsx: 438 lines of code: packages/ui/src/components/terminal/FocusedTerminal.tsx has 438 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/ui/src/components/terminal/FocusedTerminal.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b173a5be4a165f07acabb8df9277f713c7244f64b75cca969ebce2252f2b99"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/cli/src/commands/workflow-render.ts: 437 lines of code: packages/cli/src/commands/workflow-render.ts has 437 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/commands/workflow-render.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe10a685fec8a5ae332f513af5481f2ba2e32d9c66aadb0781976f9aa598b4d"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/cli/src/commands/bundle.ts: 435 lines of code: packages/cli/src/commands/bundle.ts has 435 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/commands/bundle.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c01f4ad0dfe807c71a744adc31c29bb910113c3ecd48246e602a990480a7890d"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/gateway/relay-config.ts: 435 lines of code: packages/daemon/src/domain/gateway/relay-config.ts has 435 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/daemon/src/domain/gateway/relay-config.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e479b0afdebe8be320219f2d587d52a9dd3350f4e6392a92273c54b541b82672"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/seat-launch-additions.ts: 434 lines of code: packages/daemon/src/domain/seat-launch-additions.ts has 434 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/daemon/src/domain/seat-launch-additions.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe37e0f3c1aa46f3a593d258cf554c5eb7047849f5057bf2de19a67698a94da"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/cli/src/commands/specs.ts: 433 lines of code: packages/cli/src/commands/specs.ts has 433 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/commands/specs.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ed1df08b7c7ae42d96cdd2ac845e614dbd9600737798c4228a64e366ba1253"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/node-launcher.ts: 433 lines of code: packages/daemon/src/domain/node-launcher.ts has 433 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/daemon/src/domain/node-launcher.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c696be788d2edfeb0d8fad0cd31f6da432c869cdb11df07b490fd0cd9cd48517"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/project-classifier.ts: 432 lines of code: packages/daemon/src/domain/project-classifier.ts has 432 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/daemon/src/domain/project-classifier.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58aab0bb580e4f17c8f2184f715f01df71307d09a4fd2f2d0eb3e04f10d0814c"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/cli/src/client.ts: 430 lines of code: packages/cli/src/client.ts has 430 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/client.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a5392275f355a11926d9f36a6a9d62bd706d54f58d8581fef961e39ad72f68"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/continuity-policy-materializer.ts: 428 lines of code: packages/daemon/src/domain/continuity-policy-materializer.ts has 428 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/daemon/src/domain/continuity-policy-materializer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d63cfdd2e3f839306dfaa6a1a3e3decab01d99d26c7b8b7a42aa94b7eab8f0"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/ui/src/components/specs/SpecsTreeView.tsx: 427 lines of code: packages/ui/src/components/specs/SpecsTreeView.tsx has 427 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/ui/src/components/specs/SpecsTreeView.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4296186bdf01067060d63257ac98bd86fff76a4483ec617349c2d04a6b6a4bf"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/ui/src/components/topology/TopologyTreeView.tsx: 425 lines of code: packages/ui/src/components/topology/TopologyTreeView.tsx has 425 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/ui/src/components/topology/TopologyTreeView.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca3667a6d4a47f93002d517e30a5676ad74077241486dfed389c085116d542d"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/proof/judgments.ts: 424 lines of code: packages/daemon/src/domain/proof/judgments.ts has 424 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/daemon/src/domain/proof/judgments.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c1c6d5137acfc8c33c15a5fdb8474e6a65b397b99a8fbce70d7df9f71c6671"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/gateway/participants.ts: 422 lines of code: packages/daemon/src/domain/gateway/participants.ts has 422 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/daemon/src/domain/gateway/participants.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd064eae0d78dbbded9da7e616db1e03f7e76e6e3293854221d38cbfa6e9e239"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/whoami-service.ts: 419 lines of code: packages/daemon/src/domain/whoami-service.ts has 419 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/daemon/src/domain/whoami-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d2180911d900a4b82950c3bd6572ca86d69089826675034cc54b5d70371d06"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/ui/src/lib/topology-activity.ts: 419 lines of code: packages/ui/src/lib/topology-activity.ts has 419 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/ui/src/lib/topology-activity.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22975960b457b1605e31687a1e3737a3d62d28f79576681d75523792ce314670"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/cli/src/commands/walk.ts: 416 lines of code: packages/cli/src/commands/walk.ts has 416 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/commands/walk.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbbcfafa1ceb5d4843e7fa6f53e1c3648928a162f13523e13c5833905b4821fd"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/adapters/stub-runner.ts: 414 lines of code: packages/daemon/src/adapters/stub-runner.ts has 414 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/daemon/src/adapters/stub-runner.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44332c897862edbf83233733f78516476b1c451d8052173a0c954da9c93e9aae"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/test-system/delivery/cases/d18.mjs: 413 lines of code: packages/test-system/delivery/cases/d18.mjs has 413 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/test-system/delivery/cases/d18.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ee851639eb7b07adef6047cf23d922c9396e262f04d6370eb40e20d1617244"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/classification-attempts.ts: 412 lines of code: packages/daemon/src/domain/classification-attempts.ts has 412 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/daemon/src/domain/classification-attempts.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab6f689a6118a4ba3caab34dc49503af5c445b33d5917d1d967dbc6abbc2204a"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/routes/up.ts: 411 lines of code: packages/daemon/src/routes/up.ts has 411 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/daemon/src/routes/up.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e5f4e111e4de59ccbeb7463aa018b2855710f56c63f0db8941491f8f01af9c0"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/cli/src/commands/launch.ts: 409 lines of code: packages/cli/src/commands/launch.ts has 409 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/commands/launch.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4316b553c3ee84ef424437ec91ee7b36485f7624b16b1230277649f183d72e"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/tui/src/scopes/scopes-model.ts: 409 lines of code: packages/tui/src/scopes/scopes-model.ts has 409 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/tui/src/scopes/scopes-model.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b017f67ad701e327ed8b95374d633d9795e9c320b791ff094b88f9242ab05811"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/classifier-lease-manager.ts: 407 lines of code: packages/daemon/src/domain/classifier-lease-manager.ts has 407 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/daemon/src/domain/classifier-lease-manager.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"770357425190443507ac96d05958f80f43fd1113b596997a0cd4c20b257871fa"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/transcript-store.ts: 407 lines of code: packages/daemon/src/domain/transcript-store.ts has 407 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/daemon/src/domain/transcript-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0875bf1e7b99a7499a62c53cb7a21ed8574a4a854636cbf1488c206d3cd7f467"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/gateway/slack/state-store.ts: 404 lines of code: packages/daemon/src/domain/gateway/slack/state-store.ts has 404 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/daemon/src/domain/gateway/slack/state-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78786185060d5b6717a62132dd03d049553bc316bbe37f51833556d9c3e3a25c"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/claude-managed-launch.ts: 402 lines of code: packages/daemon/src/domain/claude-managed-launch.ts has 402 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/daemon/src/domain/claude-managed-launch.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"411f8ae0778d91f3edc59e5536f3cc53487a7f608cdebf7cea8e71b1e3d0f480"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/daemon/src/domain/policies/parked-owner-consumer.ts: 401 lines of code: packages/daemon/src/domain/policies/parked-owner-consumer.ts 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/daemon/src/domain/policies/parked-owner-consumer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ea6565da8a6771b239f61497f15b1e91815c52882da3991d93a5a63e5218da"}},{"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":"skills/_canonical/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"18c7d9ffd8e035f1328b73b29bc6ad659d9122a481a3d86c9ba513bff4793953"}},{"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/daemon/assets/plugins/openrig-core/skills/claude-compaction-restore/scripts/restore-from-jsonl.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0347c1788efb84a00f92b52d313dff67dddaa26895935f1b1964f122515df7"}},{"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/ui/twin/corrective/fixtures-corrective.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e06e45292f6143553c4a52e8bb99df169d13e0c94d563c6cbe790103619d1dc3"}},{"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/ui/twin/fixtures.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f29b6b2db869dfaeb5568fece49000412df1117430efc9f252fc87a414350f"}},{"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/ui/src/components/mission-control/components/CompactStatusRow.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7e98b885ecdd2d40db803980b564c327f4b795cd9732cdc1374441c950e4aa"}},{"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/ui/twin/capture/twin-capture.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"691db7ea5604c4008f0e2c6e93ba826ee7d19ea1ca62fbf84b2f61c9cbc31fa8"}},{"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/ui/src/components/RigEnvPanel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c8e41d4cd168a1ad3e8bfece8f13918a8ff4cb4da001aac43399525f836b63"}},{"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/ui/twin/fetch-stub.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54cb9c8dd4c444d2fdd99d8bbe0ab5f4f69f1dd08f2fcb32fcd060568de0b614"}},{"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/daemon/assets/herdr-app/mods/rig-strip/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0552043eb092f2e00381ad4ce3b654f982cc1542aba5e983b58e4890ecab8d2b"}},{"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":"skills/_canonical/core/openrig-upgrade/scripts/refresh-managed-plugin.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f8f3c7f84bac9ea51697016684343ff9f99cf5bc20c404e79c2f973e9d63eb"}},{"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":"skills/_canonical/process/systematic-debugging/condition-based-waiting-example.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36dcce0ccd7909d4e5b8f53e85cb577b9b17bf32e2dc902e0451c681c3dfd0d"}},{"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/daemon/scripts/probe-health-calibration.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"176cc1aee64c372fda9d3f186119af10cb702b8926118719a293dff142688e02"}},{"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/daemon/scripts/probe-health-diagnosis.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b2e3e73ea2718fa2549a4d9c3e26b676b595481b56044c4e15ced13bd5eb19"}},{"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/ui/src/components/slices/tabs/DecisionsTab.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e00d7d8f626f09fb72b99e78cdf6f3a3cb5bd045253e0010a2f74a6373f1a3"}},{"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/daemon/scripts/probe-passive-ceremony.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b1273b7f1d69d7caec2bfeaec9903598680ac49652623657d0aebea6ef543d"}},{"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/ui/src/hooks/useContextFleet.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c2594a56db4810d2f5e144d54b1ada09bd5acf9c707819fc5bb0abda7c9641"}},{"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/ui/twin/twin-main.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99a59d6b7c13808a31e632eb8cad81c3f96c36b54c3193057ce70c237c244d0"}},{"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/ui/twin/eventsource-stub.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b606a57cafe40692e82dd4b173dc9e7a089d4c9e1eb866501c996705a26beb6d"}},{"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/ui/src/components/mission-control/hooks/useMissionControlView.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d2edf48467097679fe0e66e43f34daf625805b7ec3aa7776e876d9b82ce9e5f"}},{"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/daemon/scripts/capture-send-header.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6903470ba26c3483b66ec1cdb38e48a296893ae20f6999e14e36ddede22ef571"}},{"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/ui/src/hooks/useProgressTree.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98f06f3b832084f75c7b1880daa12e36c6f4aea43d1f0d5b1cb3ded8883f667"}},{"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/tui/scripts/capture-crash-cart.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"377d9894793f52afa7bca9759cadbd3f3e072f1d0ad1f61dc3436cddbe6e53cb"}},{"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/release-surface/generate.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c3dedc22755cde5568a344f9985095543ba5f202cb97c32442b92eaa21342b"}},{"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/daemon/src/seed.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2e565fa79e2b652cbe234ec4a844de30cc74eaf3e26ba2823b40887a6d294c"}},{"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/ui/src/hooks/useMissionStatuses.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"853d569a7d1ce5a5de6635fb7e7a210085c9e48711b8fdc17334526d6f4fbc12"}},{"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/ui/twin/seed.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"148b3586de929ca80363d66002e86296b6e6d2aed2a85d74afe35356b2f70d07"}},{"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/ui/src/components/NodeDetailPlaceholder.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ffb6d8d9d37b997e3b7bf353b7d2dd8e7e75bec6f9a44f423b0af21860ba263"}},{"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":"skills/_canonical/core/openrig-upgrade/scripts/inspect-upgrade.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e8bfd2a1a92c27eb4c97f8a4cc02fcd1def36b6b6f633862f64bab760b1574"}},{"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/ui/src/hooks/useReviewAgents.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2ff9931148a0cc91c9016d5e43084b72c7b1efd75ac15441f3819bc40e6e5e"}},{"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/ui/src/components/mission-control/hooks/useMissionControlCliCapabilities.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c9489b5cd1d5d703218efa20eb895195600f3d67e012bd677ada3011944401b"}},{"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/ui/src/hooks/useRigEnv.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a36ffcb9288a5c553c85d38eb6cc8a60cdd4d7e8145096c401773d99261299"}},{"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/daemon/scripts/copy-workflow-specs.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb40879231f6dffce71ff052677a5fdb688d4d1b3fa3c36c96bc222589d820aa"}},{"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/ui/src/components/ExpansionOutcome.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"684f51cb9e3f52f9ac6958b3dbfebf0dda36593945995792e8bddae2fe2045dd"}},{"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/daemon/assets/herdr-app/mods/rig-cell-header/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"501208062a2c2b4e5c9c74921453ac38c58bf2ea92a70d3b31937962c534a9f5"}},{"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/daemon/assets/herdr-app/mods/rig-ended/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b466996a74d9550d813869e45f9a924d8157b916f139ab13f3f08eb2dc3cf37"}},{"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/ui/src/components/mission-control/MissionControlSurface.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e55b4232c35071caf5053519cdf22b72d90912bd901e4f70cd226b36f452a6"}},{"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/daemon/assets/herdr-app/mods/rig-pad/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e23ec61847debbe994830a59b49795d01685267a1def4e3a919a99fa542b1b"}},{"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/ui/src/lib/host-label.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68430e444467a901888f01cbb8502c983617a383a10ecb72bc58124ee2cbf1d"}},{"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/ui/twin/corrective/media-webm.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f778e818db9b6391ca187c53ee58b765e61282d5cdef2779da853d49ba2898a"}},{"ruleId":"R5","level":"warning","message":{"text":"Dependency Freshness: 42 outdated package(s); JS/npm CVEs scored in D30"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7de98450603a813bc7a991bc6e60f440c1deac6f9c9bfd4d0da057afed869bcf"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~246 LoC): no import path from any entry point (224 application, 235 tooling, 2399 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/daemon/src/domain/workspace/getting-started-narrative.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ee2bb797dc2443014922ca35f95c63d9c6f822e752b286ab8ad9af3021a477"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~213 LoC): no import path from any entry point (224 application, 235 tooling, 2399 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/ui/src/components/mission-control/components/CompactStatusRow.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed2c15ad59b2a188dd3ffe388cbc87581b2ec10f3e27d3067a98b7e521d23c3a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~197 LoC): no import path from any entry point (224 application, 235 tooling, 2399 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/ui/src/components/RigEnvPanel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"556b0eb4194212a76ea7390c9d7f78d3cf34c11d614f06e8992145c0b64f8cf4"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~136 LoC): no import path from any entry point (224 application, 235 tooling, 2399 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/_canonical/process/systematic-debugging/condition-based-waiting-example.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1053db10c2a07497b2f2aff5b81b2c047f7eaa45e52e0ee6227e0fa54a9a3b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~128 LoC): no import path from any entry point (224 application, 235 tooling, 2399 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/ui/src/components/RigCard.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"837949bc45a45b210317c4e7387b6bbf572c8428186687125deae48308665afa"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~124 LoC): no import path from any entry point (224 application, 235 tooling, 2399 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/daemon/scripts/probe-health-diagnosis.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"479ad67571ae51cd44f82777acf25bee75958d5826876c4d8b7a6e3dd07f3f5a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~117 LoC): no import path from any entry point (224 application, 235 tooling, 2399 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/ui/src/components/slices/tabs/DecisionsTab.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e6ed6822f00da11801a708c988006c86290149cb6c4f7035ada2832513ac87"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~112 LoC): no import path from any entry point (224 application, 235 tooling, 2399 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/daemon/scripts/probe-passive-ceremony.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4844df1bc7dfcffc881209147c192e54f26142d0615ea7aca430b148cdbfb4ac"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~112 LoC): no import path from any entry point (224 application, 235 tooling, 2399 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/ui/src/hooks/useContextFleet.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b52a8456448997ddf41f6a243a0c38b9a2a550f890bf40acb7cd213ab3c888"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~87 LoC): no import path from any entry point (224 application, 235 tooling, 2399 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/ui/src/components/slices/tabs/DocsTab.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a510dcf56f6695e13d976972c58581f697b17c474c92d2c93dcd18a2172d53d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~57 LoC): no import path from any entry point (224 application, 235 tooling, 2399 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/daemon/scripts/capture-send-header.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2acf54fcce1654cfeb24a607bb78a715852ef5b0b788b4a5ec6253ae0dca370c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~52 LoC): no import path from any entry point (224 application, 235 tooling, 2399 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/cli/src/release-surface/generate.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75866e5dc7ed312e13160eb7d9ae6df09d96184674f4dee3dbc6384fa6fc7fa1"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~51 LoC): no import path from any entry point (224 application, 235 tooling, 2399 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (packages/ui/src/components/RigCard.tsx) \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":"packages/ui/src/hooks/useCountUp.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4384662c49308b4f8ffe6a52578dc14ff63639440fe39b238cff29d625d73ccc"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~51 LoC): no import path from any entry point (224 application, 235 tooling, 2399 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/ui/src/hooks/useMissionStatuses.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"126cfc776fe83bb49f413b303569145cc187d58f911bebdd8ae1cf86482dc823"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~42 LoC): no import path from any entry point (224 application, 235 tooling, 2399 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/ui/src/components/NodeDetailPlaceholder.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a9c4f4b7038b0823749de0cfc2e30c3b6b173e8ba7f7ccbc726013c0ed71a1"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~39 LoC): no import path from any entry point (224 application, 235 tooling, 2399 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/ui/src/hooks/useReviewAgents.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b01ae17d477374f03f139f7f0a58c6b0c436a1129a6b5708613162f7e8c189"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~36 LoC): no import path from any entry point (224 application, 235 tooling, 2399 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/ui/src/components/mission-control/hooks/useMissionControlCliCapabilities.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fbf04f1dc36a0291827a67b77cc628897013b664df2e42f9ddc8d8603319925"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~35 LoC): no import path from any entry point (224 application, 235 tooling, 2399 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (packages/ui/src/components/RigEnvPanel.tsx) \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":"packages/ui/src/hooks/useRigEnv.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d7818b26421b454f5d5218073d1a0910e2f760d98c633cc55da57792668608"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~16 LoC): no import path from any entry point (224 application, 235 tooling, 2399 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/ui/src/components/ExpansionOutcome.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5b0a850ceb21dd3824fe26df58fcab4fd730e751fd2c43a259e1152144ff99"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~11 LoC): no import path from any entry point (224 application, 235 tooling, 2399 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/ui/src/components/mission-control/MissionControlSurface.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c89ddfcbee45364afc39b0f8e32ea6bace2fff12e7e0801831388df89ebaf9"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~9 LoC): no import path from any entry point (224 application, 235 tooling, 2399 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/ui/src/lib/host-label.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6261f8dcff3ad2898b64cd876699892bc8b38c4b9f941efe49348732369ee9f2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027setSelfHostId\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/lib/hosts/fanout-contract.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0eb9d4bb3c90a375d1583c185625e68fc8d06c4a5745b8bbad557352fe0f11"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getSelfHostId\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/lib/hosts/fanout-contract.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1fd4441882174a7ef872a208f29612db2e7f55e0d758e52fb33305b9ae087c4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027setSelfHostIdSource\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/lib/hosts/fanout-contract.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9523ac864149e5374e76c2071dc894d39a8b474808d5f41827f20aad567b56f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getSelfHostIdSource\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/lib/hosts/fanout-contract.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa9b1c5661fbe50d63982bb661fb0f1944f9abf417f5e24acb4c93f43304344"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027resolvesToLocalHost\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/lib/hosts/fanout-contract.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea202a1f657726f86e7882da05bb3532a3af45cfff6e88ba4039ecaea377199"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027classifyPermissionPolicyRef\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/lib/permission-policy/policy-ref.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd8f3ad30ddd9dd1246743c5d8c2d5557a7d5aef1575e7fc024dd1912b89efd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027resolvePermissionPolicyRefValue\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/lib/permission-policy/policy-ref.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f2f837a2230490a213bab09acf60c9406e0f3f33fc96ee12add975bc3fceac"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027serializePolicySpec\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/lib/permission-policy/policy-spec.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc19bde27f92304758cb77a91e14e54219cf7499fbdfe0d81f95b3116ae71a59"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027isPlaceholderOnlyBlock\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/lib/scope/scaffold-placeholder.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79a60ed888b85b00f2c379687c91c5355c191e1a41b690ba80151664a5e63f7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027GENERIC_SCAFFOLD_ACCEPTANCE\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/lib/scope/scaffold-placeholder.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8da93a974e91a142795c333daa9af6ad21133f7eeab66d36df9484dd9fdcd7e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027MISSION_BRIEF_HEADERS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/lib/scope/scope-audit.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"33daa40c20452487bebf404c6d70e2a49795c69f088ae8a98eec5a1439953ae2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027joinFrontmatter\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/lib/scope/scope-fs.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"787fe8dcd3e933e6c04452cc7029e9c5e8b228ee7c0c2e137081b2530e540ed7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027renderImplementationPrdTemplate\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/lib/scope/templates.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b962be15aec1b872c285e803041472c851f761430d7e91e00d6ff9ea3fe022"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027loadSkillIndex\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/release-surface/affected-skills.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"d328d15a5f5a031862d3e0ada5fc6eef90e354896d4cc7b3ba3d5f729f68ec43"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027nonInterruptiveArg\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/adapters/non-interruptive.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3b3f20d0367790a8024262c9ea7ae16a5b7f826332abb01582eac38eb24d0d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027OPENROUTER_CHARGE_MAX_POSTS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/adapters/pi-openrouter-charge.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace3bcaa6f238e03ecd68dce64346325428bc55bf44ddf5038ce0e0761c10d5a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027PI_ENV_BASELINE_VARS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/adapters/pi-runner-protocol.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a8e4e412c3dc2d38227cb197164a3cb61e5c680b3a8a6bf91bcffc08239a4d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027PREPARED_MAP_MAX_GROWTH_PERCENT\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"720c81ab159a1c3e53192f5f8a88e52e38f542c67714f6011a2df7d823b0610e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027PREPARED_MAP_MAX_AGE_MS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b40542c522f4b75aeecc716921a14b50f36ae0d96b0827ba7ad914ce8535dcd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027UNREADABLE_POLLS_BEFORE_DELIVERY\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06844e14d4ab0589164b23975c5fc53c4e5fa76e6647a103c9a8e352c208d6d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027SessionOrigin\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/discovery-types.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"76db4eedbcd4a305e64b3289741b3b3bccb2e0a83e0496a198518051e6b19abf"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DEFAULT_BODY_EXCERPT\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/gateway/slack/message.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a217389107c89ae9a84eb2f2e90d219935e4bc91c288bc12dfbff5868d948c2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027resetFleetScopesCacheForTests\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/hosts/fleet-scopes.ts"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"006b7f99849e7bd952033b8dc74e9995886e5312e6ee21d87aba9ac667fd4136"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027loadClaudePermissionModes\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/permission-drift-observer.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f425399ab92bc955c293cbca4cfe00f1375af5adb8f2205d6bcf8d8b9ec4e7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027PARKED_OWNER_IDLE_GRACE_MS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/policies/parked-owner-consumer.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b76863dfbf2f1f9e41873cbebdc081e96167a0ca15131b76a56d93e9e5ae52f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027RESUME_FRESHNESS_THRESHOLD_MS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/restore-plan-preview.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f03fd204ca0482d1649dbbfd1bba7f7f870c85c3a763f67a3b95aafe03390d3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027formatDotId\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/scope/dot-id.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"177007c1aa2b203757d2257a79f7d990250ff346a62740eefc5f6b2855171709"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027sliceIdFromMission\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/scope/dot-id.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ecf7388e0a6f6242b93c388ca44cc04ffc7fa6a0f5d074f72c89118c9891132"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027inferMissionDotId\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/scope/dot-id.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca9316cc22f94a9572f00a22faa9ff01192966712a38b23516a6ac3aa10203b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027nextEscapeBandOrdinal\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/scope/dot-id.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"9235c548ebf2e0c1c1b700195ce28eff30365004637fa8b8df7e52a105ce6cc4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027isConformantDotId\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/scope/dot-id.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac709092eb37e13d13acfcca2a8ca3a5a95237a2d3961836bd7e717b22348ee"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027SLICE_TEMPLATE_KINDS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/scope/types.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f921102ffbc44cb35c3040ed428e6c2d0d0a3edcd55b1c2a570fe7aa40c6628"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027MISSION_TEMPLATE_KINDS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/scope/types.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a59e26898dd55e09086a027e3642345cd20ceb23853da04a96da74b3005d85"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027CLOSE_REASONS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/scope/types.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ff40f5ea82d14ba23998dcc8ac55432fb41fa19311d8833807e4e87c795d7e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027STAGE_VALUES\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/scope/types.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90e5a8305d0a452dc8beddd2a524a553893ae78e18e0d5d564abbf4da154c6a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027TRANSCRIPT_SECRET_PATTERNS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/transcript-redaction.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea726ffc0db6ddae5781c997f81f57a4ab4c46dc8c1816046fb6db4655b4bef9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027SteeringRoutesDeps\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/routes/steering.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"06d86336b0725b97570520dff9dbc4627ae5d20a73109b062ad031014940acad"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027navigatorLabels\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/tui/src/navigator.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa11b4f9d9e8b203e96b1a69cf51eb9b58833bb8919e6621de1e8177ed44c5e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027isGraphStyle\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/tui/src/topology/render-graph.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f6837af42c3f1f9cf99bc4fd1a3750187342741de9e730e522f03ec707eea3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027clawdFounderMark\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/tui/src/topology/runtime-marks.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbf581205079e84044be95b17b169b6b709f4fad9b56ef8609f8f0b275d6fb42"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027NodeSelectionContext\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/AppShell.tsx"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f1d896a1e688c6ac965e3b6774630b17e1dc9f97aba184c2ea2eba8e24b5fec"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027BackLayerContent\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in packages/ui/src/components/dashboard/vellum/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in packages/ui/src/components/dashboard/vellum/index.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/dashboard/vellum/BackLayerContent.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe46998a73f3c75c19a7e964815a70df55fa2a0f62fe788cdacf83a243c26fb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027BackVellumSheet\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in packages/ui/src/components/dashboard/vellum/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in packages/ui/src/components/dashboard/vellum/index.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/dashboard/vellum/BackVellumSheet.tsx"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9acf836aea42661b600a8d765d816a0ad58bf571d14d268bbe45fd8fbbba566"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ToolBadge\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/graphics/RuntimeMark.tsx"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"9285b42244df34aab5e5ff98dab4cc173b676060439a9009f651f8f6518cca1f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027OperatorMoodMark\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/graphics/RuntimeMark.tsx"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"e420d6b33b8bd6b365f3e0f70897fc4ed8f22ded10bba0cc3c88bb602203705e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ActionChecklist\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/markdown/primitives.tsx"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"a47f1863cfdd406ad63385810042c6b55e230bef5bc34f7a9912ffb4839ca26e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027useMissionControlView\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/mission-control/hooks/useMissionControlView.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5c01470eef5c8bea200361c9396a2916abdf629a9717a21c613de7c1c71198"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027primeMissionControlBearerTokenFromUrl\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/mission-control/missionControlAuth.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b20a5548be6078348c94f5956cdd97a676d6ebc7e14dae022c4f85fab8825aa"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027resolveQitem\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/review/review-actions.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"3330183e48988a49c7ad6c872432deccd5bdaa4bec797435d5f1596c2d4fb2de"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027refreeze\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/review/review-actions.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"49859f7d79fc26b5e030dcb0ee433ae7d8c2805901dde960118ff83632ad5df6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027AnyTopologyTab\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/topology/TopologyViewModeTabs.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9c4a7b9a857aab1b7305b6e85df26a63c3ac75115d9bca58377396a1352203"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027useTeardownRig\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/hooks/mutations.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14769f980a094975d91e591a7b8438fe0d61079809176e135666685f4172f94"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027useExpandRig\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/hooks/mutations.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e745e5ddf87f2a490357148b30f2bef824c4627f0c32eeed6fbf3b2bc51fa3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027useRemoveLibrarySpec\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/hooks/mutations.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c2995eee8441c42d57b0abd53353a00b8fcf7dbab7c470d58f326a9d94b97e4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027useRenameLibrarySpec\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/hooks/mutations.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a3f9fd8d5998fc94da1552c51a0e2dd7650cdcb0d46c310ebbb9bb85ff34dd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027useContextPackSync\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/hooks/useContextPackLibrary.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"02cb2dea1b0b89df373d3091b5f1c7578a3e59af1b7b23e50688fd552bd61dcc"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027__test_internals\u0027: Nothing imports THIS copy of \u0027__test_internals\u0027 \u2014 but packages/ui/src/hooks/useTopologyEdgeActivity.ts:163 in the same directory exports that same name, and it is the copy every import site resolves to. Grepping the name therefore finds live callers that do not reach this binding: it is the dead half of a duplicated pair, left behind when the API moved. Delete it here and keep packages/ui/src/hooks/useTopologyEdgeActivity.ts\u0027s, or, if this one is meant to be the survivor, repoint the importers before removing the other."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/hooks/usePrefersReducedMotion.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e11f9659963b8bb30ee507a18dc45650bec9abd5f463c847617add2b658e52"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027useProgressTree\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/hooks/useProgressTree.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d19eb5ea25ad698d133d62ae13d3d490a662e5436dccd12058cc861f05b3d6c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027useReviewAgents\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/hooks/useReview.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"c883c76ff0100e8d58b9c4ee0fd573355083a0dab633024b4cee8fb24c2e59fe"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027useNodeHealth\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/hooks/useSteering.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d3ffff243c543cb15d9224809577efc0b3e2aa7e21a79a3028dab25b6db3b4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027useContextHealth\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/hooks/useSteering.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec299f54006762381daa478f7618eee113247ce4069c150f10570a642cbc464"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027useWorkflowInstance\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/hooks/useWorkflow.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"da9c50a897fbc025e205ea1521fe405b4f114cc6e4cefcd235678accd6bd5c3f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027librarySkillFileHref\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/lib/library-skills-routing.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"7232ba5f62defe6571193766c3cd592b41ed1fc01f4b3eaa9b7f7c7ecb442d3e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027__test_internals\u0027: Nothing imports THIS copy of \u0027__test_internals\u0027 \u2014 but packages/ui/src/lib/hybrid-layout.ts:524 in the same directory exports that same name, and it is the copy every import site resolves to. Grepping the name therefore finds live callers that do not reach this binding: it is the dead half of a duplicated pair, left behind when the API moved. Delete it here and keep packages/ui/src/lib/hybrid-layout.ts\u0027s, or, if this one is meant to be the survivor, repoint the importers before removing the other."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/lib/topology-activity.ts"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0defa503eec69fe40c5acf10c446436b6f535d9e9e22455548650e0fd8bafae"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getTopologyEventStatus\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/lib/topology-events.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f4b05a2c3b3ba793f1e2d755b25ca1a4df57650bc38c5ffc4fc00f502beea5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027__test_internals\u0027: Nothing imports THIS copy of \u0027__test_internals\u0027 \u2014 but packages/ui/src/lib/hybrid-layout.ts:524 in the same directory exports that same name, and it is the copy every import site resolves to. Grepping the name therefore finds live callers that do not reach this binding: it is the dead half of a duplicated pair, left behind when the API moved. Delete it here and keep packages/ui/src/lib/hybrid-layout.ts\u0027s, or, if this one is meant to be the survivor, repoint the importers before removing the other."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/lib/topology-events.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"49044c220083276aff82df2c4f767697a75e7cef700703e1347bcc50a22aef73"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027STATUS_COLORS\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/commands/restore-check.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"822ca740aafea7b8dc5ce99fde9f9ddec81fef5c710039008e17f44bb0258e6e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027mockLifecycleDeps\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/test/config.test.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd52c7c2e34710871d540b75d661689ea244470b612f38503589d65ec831b50"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027d13Child\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/test/cross-host-executor.test.ts"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"615fa9944e9b270892a805b9d18d02154c9044964a1abab52325c4792777a770"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027assertRegularFileSnapshot\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/daemon/specs/agents/shared/skills/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"3393a7c3155dc58a5bb86555e2ff4590044a281e130def41dfc4e19f97e9acf2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private method \u0027readJsonObject\u0027: Nothing in its class calls or references this private method \u2014 no member access, no string key, no decorator, and no test reaches it by name. A private member cannot be called from outside its class, so this is the whole search: remove it, or call it where it was meant to be used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f69af62f16c14509dee7dde0390f920b0bf5fdf6e414266eebf5c2c817a84e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private method \u0027readJsonObjectField\u0027: Nothing in its class calls or references this private method \u2014 no member access, no string key, no decorator, and no test reaches it by name. A private member cannot be called from outside its class, so this is the whole search: remove it, or call it where it was meant to be used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":1769}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a50504140b70d5d1f0159a4fe5a588a2c2386ae6562ddfc4354864c2637c2f9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027VALID_ID_CHARS\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/daemon/src/domain/draft-rig-generator.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"8833561a9d558590da7e8846f17ace05cec106101419451ac666d99f3a2545fe"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027YAML_CATEGORY_MAP\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/daemon/src/domain/profile-resolver.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"b20419a156f9305423849b0a1fd797587f016a5eb832427f598219153c3f7ef5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027readCodexThreadIdFromLogs\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/daemon/src/domain/resume-metadata-refresher.ts"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c26efd1d2112203c04dfc2d14001f83ae1eea9dc306049dcba093e7bad3383"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027EMPTY_FILE\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/daemon/src/domain/terminal/terminal-views-store.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e8e66b21ba48ceb1e1af8610bce7b4825115fd3bdec06190dacf6360ad55fb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027DeleteQuery\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/daemon/src/routes/agent-images.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fce4fb7efbee69fcbbda004e13ce44e559c0520a1bfcfac1b78abd1c6a30339"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027extractManifestForCompatCheck\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/daemon/src/routes/bundles.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc29a3338b0c780f3a86e3ed41a13391b85782e5b28e28442ec90c126a911f6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027realEngineFsOps\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/daemon/src/routes/packages.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"36334c74b90d273578cc6579c144edf2da8737f6de49d69d67a3abe4d801e776"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027createMockFailInstantiator\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/daemon/test/bootstrap-orchestrator.test.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7ee1f57af099eda4fbbac5229fb36bdbdfbc775af9f6a25f42b3fb06c3f22f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027sentinelExists\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/daemon/test/opr-0.4.1.09-bridge-reader.test.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eef782ddc20a15e7bdf50b107b809905aa47915983ba26e4351518532896a1f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027setupBasicRig\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/daemon/test/pod-bundle-assembler.test.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"70606f3b55a5ae739c1d094b44f45eabefea0cb63b1cfa82d3f10eddb9c5610a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027settle\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/daemon/test/qa-send-caller-cancel.test.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"3646eeaa4996a4e50cbc85b86a34b29606eb2507c34f63c54c34f87d5759c4f1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027mockExec\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/daemon/test/services-snapshot-restore.test.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa7806caf281b742b8f7dfa453e4e33349276e03a16f33f0f83336b97dbde7f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027VALID_SPEC\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/daemon/test/up-route.test.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e959bf9c05f189036f19bfb84735169cfe1248353f99ac4db1a8f9aa47804e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027proofText\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/tui/src/execution/execution-model.ts"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8caa80eb6f7d90685e763dcaf7ac244f06aed69ae883d7e70bed91f79cd46e4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027needsLine\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/tui/src/render.ts"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cecb4c993b1e859b0b77ad2f351681e43e7d0f7d09281b3ed0af685f0f657a9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027statusColor\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/ui/src/components/Explorer.tsx"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"063b1a779683a7bb0c1e371dab6738fc9caf2fbd720446e91324f9c33b45b222"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027rigStatusColor\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/ui/src/components/Explorer.tsx"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1bd079f3ee9f4b9d27fe7ec2b5267c5a5cfde530d616de795d13ca4def5c504"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027aggregateStatus\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/ui/src/components/Explorer.tsx"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"0582c97446fc579764a2ddb3d5e44a7d7445884ed8a8d967c0c05d75307b4f67"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027TreeToggle\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/ui/src/components/Explorer.tsx"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"109282d9119ebab0534e63c1097fdd19c145e2214ef11d1ace6bff106fa45741"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027NodeActivityIndicator\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/ui/src/components/Explorer.tsx"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee718b17d78c5bd3f5c3e254a70c180c37bf8850eec1fbbc9342a79aa61931bc"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ExplorerKindIcon\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/ui/src/components/Explorer.tsx"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb00ad095ba844b45cf1b70b37a83728373db856d8d2394af958a36eb9eca1e2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027InstantiateFailure\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/ui/src/components/ImportFlow.tsx"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1f8edda2c0bb581b3530e1c0fa645cc8c44077d1afb0d88d1ab3a4327ea79c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027MinimalLargeBackground\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/ui/src/components/lab/VellumBackgroundLab.tsx"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc5f6ed5cc35600221bbcb9a08d8b3bb95eb0fa5f922799c6b51dd63927503f2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027WorkspaceOverviewPanel\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/ui/src/components/project/ScopePages.tsx"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"77736d8ffba732e9e9128bf6acd36af42fc73c0210b7bd0edd8084a6e30ee838"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027NOT_FOUND\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/ui/test/slice-28-detail-pages.test.tsx"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd15857a6da713e3c8e202aa33d80f1e3bbba60b0672e4073ea5425120c4ab38"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027fileList\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/ui/test/slice-28-index-pages.test.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38976a010b6a2e2fefcf902b5f13476ec7f578de543523befee583983108bbc"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027NOT_FOUND\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/ui/test/slice-28-index-pages.test.tsx"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d6ff1fb570adf09fd56979fe7c6ad492827ffb2ba4471b989fa74b5829c5b66"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027assertRegularFileSnapshot\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":"skills/_canonical/core/openrig-upgrade/scripts/migrate-telemetry-state-0.5.9.mjs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6bdcc5ee2c80febbdb411bc16facbbc315d036fad0ce7fb187d8cc257e2998e"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027@modelcontextprotocol/sdk\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/test-system/ci/mcp-stdio.mjs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"78107581deca84bc87b7d291e9ae55e31719aebbfb502ec988e84b33e481d492"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027commander\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check-first-run-references.test.mjs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e4ef30e8426db2fa6f5169218688048a0745a7ccc870d6ffb98669d20975ed5"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027hono\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/generate-context-packs.test.mjs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72fbfcfeb2a1f5a5a5ff84cf614183e88a826de5994c340e2e01f155a026740"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027typescript\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check-first-run-references.mjs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b839c7f58a38f632f60a7e33982c70cf5ea2d7f1d39de825535942b92e9c8a"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027yaml\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check-first-run-references.mjs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f2855d2559f1ff23cd5c85c4447b294a9a36a1205dd4329112c902ea2a545f1"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027commander\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/community-harness-existing.test.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac9ee9990045ca23271e1e2cbaa69b3cf7a2747ea817ac40fd31a5c790e4bde"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027ws\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/test/browser-boundary-listener.test.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"96edc99d83be61475c4d113177d67a6bc3fe53722fde4e61a3b097412bdc16fb"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027better-sqlite3\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/tui/test/action-auth.test.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"399a2f46cd1407f5aa749b68cb0dccf706382f74451729f54c72666e84379b0f"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027hono\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/tui/test/action-auth.test.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7428dcd6b1622b38ccd24e3e44c35860b45f8b99b08ec827a7d7af8fe5ff59"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@hono/node-ws\u0027: Declared in packages/cli/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/package.json"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"609f12b327d8c0eb4291e1d763485fe0eaa143f7e7e88fa1bfb03a973b5cb7cc"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@xterm/addon-fit\u0027: Declared in packages/ui/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/package.json"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"200e3768ccfa5f2d702e8a162489ddfb001564d49c4254dd328915bbea06392c"}},{"ruleId":"R8","level":"note","message":{"text":"Test-only dependency \u0027@hono/node-server\u0027 in production deps: Only test files import it (first: packages/cli/test/acp-real-queue.test.ts:4) \u2014 move it to devDependencies."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/package.json"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e32d1f78f5da6b11ef0ba026bd6360941d6f2760a8bdb7aa4fa18cd600bce6"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (4 files): packages/daemon/src/adapters/kernel-authority.ts \u2192 packages/daemon/src/domain/claude-compaction-enforcer.ts \u2192 packages/daemon/src/domain/session-transport.ts \u2192 packages/daemon/src/domain/native-resume-probe.ts \u2192 packages/daemon/src/adapters/kernel-authority.ts (one verified cycle inside a mutually-dependent group of 19 files)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/adapters/kernel-authority.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"6072f1b774421bc5bf9c38067bf79b9c08f0dab2ae2ddefb2286d8581a0e715b"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): packages/daemon/src/domain/activity-grants.ts \u2192 packages/daemon/src/domain/session-registry.ts \u2192 packages/daemon/src/domain/activity-grants.ts"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/activity-grants.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"9410f463333c1603e146a9ea8c9b1459d53eaf135d2ed85c6c7135ca4205f2ab"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (3 files): packages/daemon/src/domain/queue-repository.ts \u2192 packages/daemon/src/domain/queue-wake-ladder.ts \u2192 packages/daemon/src/domain/queue-stuck-sweep.ts \u2192 packages/daemon/src/domain/queue-repository.ts (one verified cycle inside a mutually-dependent group of 5 files)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/queue-repository.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"347df79c7b66190196ebb6e0141359beca518742ce9f0399b03e9a7280fc65ba"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (3 files): packages/daemon/src/domain/proof/judgments.ts \u2192 packages/daemon/src/domain/review/compose.ts \u2192 packages/daemon/src/domain/review/types.ts \u2192 packages/daemon/src/domain/proof/judgments.ts"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/proof/judgments.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb5717c71f1b26403fdbc4c866e7783414c40c90d44fc2d31c54136f1f53c68"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): packages/daemon/src/domain/workflow-instance-store.ts \u2192 packages/daemon/src/domain/workflow-scope.ts \u2192 packages/daemon/src/domain/workflow-instance-store.ts"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/workflow-instance-store.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35451b62205707ff28ae27d1a4ce96bc3721a5361ea41afbb9b89f34d885bb4"}},{"ruleId":"S1","level":"note","message":{"text":"No app-layer HTTPS enforcement detected: \u0060server.listen(\u2026)\u0060 serves plain HTTP on a network address, and nothing in its package enforces HTTPS: no TLS served (\u0060https.createServer\u0060, Fastify \u0060https\u0060, Nest \u0060httpsOptions\u0060), no redirect of plain requests to \u0060https://\u0060, no \u0060Strict-Transport-Security\u0060 (helmet sends it by default), and no TLS-terminating proxy configuration committed beside it \u2014 so a browser may talk to it in clear text. (\u22122.0 on this card.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/mcp-http.ts"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb8dfef4465abb4920c1def508be6857a1b37f61c780a2f9c3a38013ceae716f"}},{"ruleId":"S1","level":"note","message":{"text":"No app-layer HTTPS enforcement detected: \u0060serve(\u2026)\u0060 serves plain HTTP on a network address, and nothing in its package enforces HTTPS: no TLS served (\u0060https.createServer\u0060, Fastify \u0060https\u0060, Nest \u0060httpsOptions\u0060), no redirect of plain requests to \u0060https://\u0060, no \u0060Strict-Transport-Security\u0060 (helmet sends it by default), and no TLS-terminating proxy configuration committed beside it \u2014 so a browser may talk to it in clear text. (\u22122.0 on this card.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/index.ts"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31ec1dad7d1d3f709c03ea4cd77330823c22154a193ddc2f5bb5bebb4a43420"}},{"ruleId":"S1","level":"note","message":{"text":"No app-layer HTTPS enforcement detected: \u0060serve(\u2026)\u0060 serves plain HTTP on a network address, and nothing in its package enforces HTTPS: no TLS served (\u0060https.createServer\u0060, Fastify \u0060https\u0060, Nest \u0060httpsOptions\u0060), no redirect of plain requests to \u0060https://\u0060, no \u0060Strict-Transport-Security\u0060 (helmet sends it by default), and no TLS-terminating proxy configuration committed beside it \u2014 so a browser may talk to it in clear text. (\u22122.0 on this card.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/index.ts"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"373f889981f8fbe48f5fdd259ea2c7a69d622cd9cd9ff712308482d6ad186885"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!!value \u0026\u0026 typeof value === \u0022object\u0022 \u0026\u0026 !Array.isArray(value)\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/agent-activity-store.ts, packages/daemon/src/domain/provider/subscription-move-report.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/daemon/src/domain/agent-activity-store.ts"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"367bffc646ffd628262d8d00837dd359b5c1c112c022627a2d1682a2d42fb647"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!!x \u0026\u0026 typeof x === \u0022object\u0022 \u0026\u0026 !Array.isArray(x)\u0060 appears character-identically in 3 files \u2014 packages/cli/src/commands/project-jev.ts, packages/cli/src/commands/stream-outcome.ts, packages/cli/src/decisions/decisions.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/commands/project-jev.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"801c6209d2a74fdf8d38cef024c15386a232f79386762fc37a9c9cea0059d168"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!(error instanceof QueueRepositoryError) || error.code !== \u0022unknown_destination_rig\u0022 || route.humanRouted\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/workflow-exception-escalation.ts, packages/daemon/src/domain/workflow-projector.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/daemon/src/domain/workflow-exception-escalation.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b63a403c3a2cca956cbe143e5cec40f9cb8a4e489a1ac6512502c1391940e58"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!(part in current) || typeof current[part] !== \u0022object\u0022 || current[part] === null\u0060 appears character-identically in 2 files \u2014 packages/cli/src/config-store.ts, packages/daemon/src/domain/user-settings/settings-store.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/config-store.ts"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"048ae44edb92a4c2c12072ebd646e87207748b3728af17741ef0a23b3153b02e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!/^\\d\u002B$/.test(raw.trim()) || typeof coerced !== \u0022number\u0022 || !Number.isInteger(coerced) || coerced \u003C 1 || coerced \u003E 600\u0060 appears character-identically in 2 files \u2014 packages/cli/src/config-store.ts, packages/daemon/src/domain/user-settings/settings-store.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/config-store.ts"},"region":{"startLine":1083}}}],"partialFingerprints":{"codehealthFindingId/v1":"59e4a4bde72d557a2a7ea339e3c94a2ee9a7867dffc875691ec04803ec054cb9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!/^\\d\u002B$/.test(raw.trim()) || typeof coerced !== \u0022number\u0022 || !Number.isSafeInteger(coerced) || coerced \u003C 2000 || coerced \u003E 1_000_000\u0060 appears character-identically in 2 files \u2014 packages/cli/src/config-store.ts, packages/daemon/src/domain/user-settings/settings-store.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/config-store.ts"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd6869354e11b6e74e8034a811c0c1d9e1b62bee3e50c776bef4749dc8c5341"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!/^\\d\u002B$/.test(raw.trim()) || typeof value !== \u0022number\u0022 || !Number.isSafeInteger(value) || value \u003C 0\u0060 appears character-identically in 2 files \u2014 packages/cli/src/config-store.ts, packages/daemon/src/domain/user-settings/settings-store.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/config-store.ts"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae62cdd50ea75c5d07e003f5a624dc08038d1fe2c53a8092247288263b70c47c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!/^\\d\u002B$/.test(raw.trim()) || typeof value !== \u0022number\u0022 || !Number.isSafeInteger(value) || value \u003C 1 || value \u003E 1_000_000\u0060 appears character-identically in 2 files \u2014 packages/cli/src/config-store.ts, packages/daemon/src/domain/user-settings/settings-store.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/config-store.ts"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"d647af04b0e7104ec0f6bc345224024eeb592505d622806c12565fee70ea3be2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!/^\\d\u002B$/.test(raw.trim()) || typeof value !== \u0022number\u0022 || !Number.isSafeInteger(value) || value \u003C 1 || value \u003E 3600\u0060 appears character-identically in 2 files \u2014 packages/cli/src/config-store.ts, packages/daemon/src/domain/user-settings/settings-store.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/config-store.ts"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"f436ab02408e388cbd8d876d397e190cc8cf3ec577734afddd4de5576d0de6cf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!/^\\d\u002B$/.test(raw.trim()) || typeof value !== \u0022number\u0022 || !Number.isSafeInteger(value) || value \u003C 1000 || value \u003E 2000\u0060 appears character-identically in 2 files \u2014 packages/cli/src/config-store.ts, packages/daemon/src/domain/user-settings/settings-store.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/config-store.ts"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"df107641ee8508d70549ee6fa984a0b7262451591336abe888969a8f0845cf8b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Array.isArray(entry) || !requestedPids.has(entry[0])\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/native-process-arguments.ts, packages/daemon/src/domain/native-process-executable.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/daemon/src/domain/native-process-arguments.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eef9fb0696edbc905c82d2721fe1d825cb991fea0d3971107e70fd818a7fcf7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isInteger(limit) || limit \u003C 1 || limit \u003E 100\u0060 appears character-identically in 2 files \u2014 packages/cli/src/commands/project-worker.ts, packages/cli/src/commands/project.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/commands/project-worker.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"03cb2c0d22043973f5c33c784df6e3651ebc6e56923bfe5c754a5c0ad16b1cd3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isInteger(limit) || limit \u003C 1 || limit \u003E 200\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/health-detectors.ts, packages/daemon/src/routes/provider.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/daemon/src/domain/health-detectors.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7082f94020433e10eea54e5c6122f64f4eb3161f553ea6e228e6a24515740b6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isSafeInteger(chars) || chars \u003C 1 || chars \u003E Number.MAX_SAFE_INTEGER - overhead\u0060 appears character-identically in 2 files \u2014 docs/reference/community-harness-examples/dsh/openrig-dsh-runner.mjs, packages/daemon/src/adapters/pi-runner.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":"docs/reference/community-harness-examples/dsh/openrig-dsh-runner.mjs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a28b8944368cc4174222232bf0fae897c58f4e2b05f3257cc87fc02c7793cd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!baseUrl \u0026\u0026 typeof parsed.baseUrl === \u0022string\u0022\u0060 appears character-identically in 3 files \u2014 packages/daemon/assets/claude-hook-bridge.cjs, packages/daemon/src/adapters/pi-runner.ts, packages/daemon/src/adapters/stub-runner.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/daemon/assets/claude-hook-bridge.cjs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd4ab92f03e40119fade8023fc1629e3898717d7a8b1c4368f96b06f15a6f5d9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!body || typeof body !== \u0022object\u0022 || Array.isArray(body)\u0060 appears character-identically in 2 files \u2014 packages/cli/src/commands/queue.ts, packages/daemon/src/routes/sessions.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/commands/queue.ts"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f0dc3c70a2b0aca0ab926c4089c3b2db99147a109038ef8a1a1974148bb63f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!buffer.startsWith(\u0022: runner-frame-chars=\u0022) || !buffer.includes(\u0022\\n\u0022)\u0060 appears character-identically in 2 files \u2014 docs/reference/community-harness-examples/dsh/openrig-dsh-runner.mjs, packages/daemon/src/adapters/pi-runner.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":"docs/reference/community-harness-examples/dsh/openrig-dsh-runner.mjs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2df54598f71114e3d604811a3fc51e8de1243c61e33b1a1f5faf52f59e86a6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!data || typeof data !== \u0022object\u0022 || Array.isArray(data)\u0060 appears character-identically in 3 files \u2014 packages/daemon/src/domain/gateway/slack/state-store.ts, packages/daemon/src/domain/rig-mode/operating-posture.ts, packages/tui/src/daemon-client.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/daemon/src/domain/gateway/slack/state-store.ts"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9edd1250d354d0a77e9752926fa988ea0a62695eaa1bbed065978a645cde25"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!doc || typeof doc !== \u0022object\u0022 || Array.isArray(doc)\u0060 appears character-identically in 3 files \u2014 packages/daemon/src/domain/community-harness-launch-result.ts, packages/daemon/src/domain/community-harness-presets.ts, packages/daemon/src/domain/health-context.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/daemon/src/domain/community-harness-launch-result.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d9bbffcbddebd31eb10519e8e77f14ea69a2b20d37610d7a0acbfbf250fb6f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!endpoint || typeof fetch !== \u0022function\u0022\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/adapters/pi-runner.ts, packages/daemon/src/adapters/stub-runner.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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":2399}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce014e0e9aa88d07e3685549f6e993073a7e76460ad430bfd41e5ec69e7a20e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!entry || typeof entry !== \u0022object\u0022 || Array.isArray(entry)\u0060 appears character-identically in 9 files \u2014 packages/cli/src/lib/context-install.ts, packages/daemon/src/domain/agent-manifest.ts, packages/daemon/src/domain/bundle-content-routing.ts, packages/daemon/src/domain/bundle-types.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/lib/context-install.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"d000d53395a3cd49cd4d66980742e1e107a9c0bc73d700f6035a74c84c720a23"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!entry.isFile() || !entry.name.endsWith(\u0022.md\u0022)\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/slices/slice-detail-projector.ts, packages/daemon/src/domain/workspace/frontmatter-validator.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/daemon/src/domain/slices/slice-detail-projector.ts"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bca9895534fd09f2e345de064af324f2b2130d1f442136d4294e0e01eaebdb6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!f || typeof f !== \u0022object\u0022 || Array.isArray(f)\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/agent-images/manifest-parser.ts, packages/daemon/src/domain/context-packs/manifest-parser.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/daemon/src/domain/agent-images/manifest-parser.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"7485b6e2a6813052dd556f87943ba816be484401a22e107b6505d2b0471344e5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!fs.existsSync(manifestPath) || !fs.statSync(manifestPath).isFile()\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/bundle-carried-context-pack.ts, packages/daemon/src/domain/bundle-carried-project.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/daemon/src/domain/bundle-carried-context-pack.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"5275dc68e17102152a7e03c546ea6f02ac7fe8baa24c95414e281887aecfe400"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!inHerdrPane(env) \u0026\u0026 (env[\u0022TERM_PROGRAM\u0022] === \u0022rex\u0022 || (env[\u0022TERM_PROGRAM\u0022] !== \u0022herdr\u0022 \u0026\u0026 !!env[\u0022REX_SESSION\u0022] \u0026\u0026 !!env[\u0022REX_BLOCK\u0022] \u0026\u0026 !!e\u2026\u0060 appears character-identically in 2 files \u2014 packages/cli/src/terminal-window.ts, packages/tui/src/terminals/open-window.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/terminal-window.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe7a4e1091b2c423b42a64186b64542c5f1e22c06c14d611091e2a0d529ad15d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!isPlainObject(group) || !Array.isArray(group[\u0022hooks\u0022])\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/claude-activity-hooks.ts, packages/daemon/src/domain/claude-owned-settings.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/daemon/src/domain/claude-activity-hooks.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"e347033fb222a4a33c3aa1865fc9f5bcd6961e5330083cbd0f9fb4a0f508c326"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!isRecord(message) || typeof message.id !== \u0022number\u0022 || \u0022method\u0022 in message\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/codex-network-default.ts, packages/daemon/src/domain/provider/codex-usage-reader.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/daemon/src/domain/codex-network-default.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7bd14dccf50245d5572c0446bcf7f7d304db8350e6d8845588bf38ba87a2e3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!isRemote \u0026\u0026 !workspace.isLoading \u0026\u0026 workspace.name === null\u0060 appears character-identically in 2 files \u2014 packages/ui/src/components/project/ProjectTreeView.tsx, packages/ui/src/components/project/ScopePages.tsx. 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/ui/src/components/project/ProjectTreeView.tsx"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c56bf2998b9361971ba6ce8993aa8003f7199a833b60c3c13425044e5b48c8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!key?.startsWith(\u0022--\u0022) || value === undefined\u0060 appears character-identically in 3 files \u2014 packages/daemon/scripts/gen-control-plane-json.mjs, scripts/check-internal-leak-guard.mjs, scripts/check-substance-gate.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/daemon/scripts/gen-control-plane-json.mjs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad89844cc971a7406809702dbebbc7850d087c15454952ffe8eee5fa9248e7d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!m || Number.isNaN(start) || start \u003C 0 || start \u003E= size || end \u003C start\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/routes/files.ts, packages/daemon/src/routes/slices.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/daemon/src/routes/files.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"29fbfb79859fc49f77688c62318f22619a0da85e3b722db6e06dbbff3ad0dd53"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!manifest || typeof manifest !== \u0022object\u0022 || Array.isArray(manifest)\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/bundle-carried-project.ts, packages/daemon/src/domain/seat-skill-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":"packages/daemon/src/domain/bundle-carried-project.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"95599e8c2c0bb83e0a02a5f8a6be3804886e5e15d18a22a119512563d2d095b8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!member || typeof member !== \u0022object\u0022 || Array.isArray(member)\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/rig-expansion-service.ts, packages/daemon/src/routes/rigs.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/daemon/src/domain/rig-expansion-service.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"83607edcc39b5cd1a96ba9a9ce07c1538bcde7a6659c7d93e2a1fe31d143c78f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!obj[\u0022name\u0022] || typeof obj[\u0022name\u0022] !== \u0022string\u0022\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/agent-manifest.ts, packages/daemon/src/domain/rigspec-schema.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/daemon/src/domain/agent-manifest.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2cf16f7312c1e1bea4f79107c92295d08d197b6717db40b2b7a9c88df117bbf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!obj[\u0022version\u0022] || typeof obj[\u0022version\u0022] !== \u0022string\u0022\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/agent-manifest.ts, packages/daemon/src/domain/rigspec-schema.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/daemon/src/domain/agent-manifest.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e39665d722da5f67a3134a88258e5a0f83af3d1921f4f0d9e2e5f47ea6600fb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!parsed || typeof parsed !== \u0022object\u0022 || Array.isArray(parsed)\u0060 appears character-identically in 13 files \u2014 packages/cli/src/acp/json-rpc-stdio.ts, packages/cli/src/cmux-config.ts, packages/cli/src/commands/rig.ts, packages/cli/src/commands/whoami.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/acp/json-rpc-stdio.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"69be52061cb762213e74c9df5f4c85e1eda154176456631b1dad7e8a23ab86e0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!raw || typeof raw !== \u0022object\u0022 || Array.isArray(raw)\u0060 appears character-identically in 12 files \u2014 packages/daemon/src/domain/bundle-types.ts, packages/daemon/src/domain/gateway/connections-projection.ts, packages/daemon/src/domain/provider/claude-usage-reader.ts, packages/daemon/src/domain/runner-channel.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/daemon/src/domain/bundle-types.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"b52c6262f11b7f09891b52f8fc816bf812656040eee002aac94342a9612c51f5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!removed.ok \u0026\u0026 removed.code !== \u0022session_not_found\u0022\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/adapters/tmux.ts, packages/daemon/src/domain/seat-runtime-switch-service.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/daemon/src/adapters/tmux.ts"},"region":{"startLine":1308}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e01b9f41c8faefa724da01fb6af3f0b00866df379ed39928610659b18cf1fc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!resources || typeof resources !== \u0022object\u0022\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/plugin-discovery-service.ts, packages/ui/src/components/LiveNodeDetails.tsx. 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/daemon/src/domain/plugin-discovery-service.ts"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"77960180a370951755644797da1095a02b1709c02b5dca57f7679920b66fb059"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!s || typeof s !== \u0022object\u0022 || Array.isArray(s)\u0060 appears character-identically in 3 files \u2014 packages/daemon/src/domain/bundle-content-routing.ts, packages/daemon/src/domain/bundle-types.ts, packages/daemon/src/routes/bundles.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/daemon/src/domain/bundle-content-routing.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c8d420d7550333266dd8a3da1d5ad05a7a3fd8a2b537862daf31514c5f72bf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!selectionKnown || mission.isLoading || brief.isLoading\u0060 appears character-identically in 2 files \u2014 packages/ui/src/components/project/SteeringTab.tsx, packages/ui/src/components/project/WorkspacePortfolioPanel.tsx. 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/ui/src/components/project/SteeringTab.tsx"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"d223e20bb6823b8f558e8d4b2545f4cc3734f02f33468e00dd238d69f7e4aa85"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!source || typeof source !== \u0022object\u0022 || Array.isArray(source)\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/agent-manifest.ts, packages/daemon/src/domain/bundle-types.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/daemon/src/domain/agent-manifest.ts"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef12c56b273ad9528924800b7c30d91ae6b70a658547e0036d96cebfc01f5883"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!t.startsWith(\u0022workflow:\u0022) \u0026\u0026 !t.startsWith(\u0022instance:\u0022)\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/workflow-projector.ts, packages/daemon/src/domain/workflow-runtime.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/daemon/src/domain/workflow-projector.ts"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c548e532e9cc6315c8e14af1cffe651270f30b15e4b66b215a57c1dcdb6e23"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!task || task.destinationSession !== binding.seat\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/environment-artifacts.ts, packages/daemon/src/domain/environment-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/daemon/src/domain/environment-artifacts.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"d480eb81c39d32f6a7cb6ebd70f2ba3411646ecc0909a9aa103457783978b8f1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!textResult.ok \u0026\u0026 textResult.code === \u0022launch_path_too_long\u0022 \u0026\u0026 authority \u0026\u0026 command !== originalCommand\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/adapters/pi-resume.ts, packages/daemon/src/adapters/pi-runtime-adapter.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/daemon/src/adapters/pi-resume.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"327afd7fa2cedb86ff994b29688106025856c0f661bcd8fe9b5c40be565870ba"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!textResult.ok \u0026\u0026 textResult.code === \u0022launch_path_too_long\u0022 \u0026\u0026 originalCommand !== fallback \u0026\u0026 accountHome === undefined\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/adapters/pi-resume.ts, packages/daemon/src/adapters/pi-runtime-adapter.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/daemon/src/adapters/pi-resume.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e51c3ec3030fde8540c00d2f769630ed94b2b8c4063a46e8c79075f653db019"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!token \u0026\u0026 typeof parsed.token === \u0022string\u0022\u0060 appears character-identically in 3 files \u2014 packages/daemon/assets/claude-hook-bridge.cjs, packages/daemon/src/adapters/pi-runner.ts, packages/daemon/src/adapters/stub-runner.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/daemon/assets/claude-hook-bridge.cjs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aeb86c0c408739107ba83592e2b9064fccf9e9c8511ba865cf8d088a78530c9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!value || typeof value !== \u0022object\u0022 || Array.isArray(value)\u0060 appears character-identically in 14 files \u2014 packages/cli/src/commands/queue.ts, packages/cli/src/lib/bundle-source.ts, packages/daemon/assets/claude-statusline-context.cjs, packages/daemon/src/domain/expected-conversation.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/commands/queue.ts"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f902fad2dde5a21ebdd01314e041417eed15ccbcb729aac14659b5928e3744"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060\u0022isSymbolicLink\u0022 in entry \u0026\u0026 typeof entry.isSymbolicLink === \u0022function\u0022 \u0026\u0026 entry.isSymbolicLink()\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/bundle-archive.ts, packages/daemon/src/routes/bundles.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/daemon/src/domain/bundle-archive.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a9c14f5567ead082419c55c93076c562213ae31b316457b67de7af6b5cb90c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060\u0022recoveryPending\u0022 in result \u0026\u0026 result.recoveryPending\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/routes/provider.ts, packages/daemon/src/routes/seat.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/daemon/src/routes/provider.ts"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d5e5cf86804174fd4b701436a65e209ee3396a4dc29c263672bfdce289d44b8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(value.startsWith(\u0027\u0022\u0027) \u0026\u0026 value.endsWith(\u0027\u0022\u0027)) || (value.startsWith(\u0022\u0027\u0022) \u0026\u0026 value.endsWith(\u0022\u0027\u0022))\u0060 appears character-identically in 3 files \u2014 packages/cli/src/lib/scope/scope-fs.ts, packages/daemon/src/domain/slices/slice-indexer.ts, packages/daemon/src/routes/missions.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/lib/scope/scope-fs.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed2ba789a4c563f3cf6ef33635b0a6f4fec9e17d0b051aa3d6f95d187703ebc7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060CLEARABLE_FIELDS.has(key) \u0026\u0026 value === \u0022\u0022\u0060 appears character-identically in 2 files \u2014 packages/cli/src/host-registry.ts, packages/daemon/src/domain/hosts/hosts-registry-writer.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/host-registry.ts"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c545b5a65da210ed694bb955159fa8ca413d5717c128bc93040b2f8f575b9eb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060HUMAN_SEAT_SESSION_REF_PATTERN.test(sessionRef) || VIRTUAL_DOMAIN_SESSION_REF_PATTERN.test(sessionRef)\u0060 appears character-identically in 3 files \u2014 packages/cli/src/session-name.ts, packages/daemon/src/domain/session-name.ts, packages/ui/src/lib/session-name.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/session-name.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"543491f81a5b9b0588bb0a5d522d1d2c521303c6524919dcc51d6f14fb4b0591"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number.isInteger(pid) \u0026\u0026 pid \u003E 0 \u0026\u0026 pid \u003C= 2147483647\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/native-process-arguments.ts, packages/daemon/src/domain/native-process-executable.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/daemon/src/domain/native-process-arguments.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3fb6cdb952ef3d5a1fcf50885f45612bf7f8be2a7169717c28c9c634a70becf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number.isNaN(port) || port \u003C 0 || port \u003E 65535\u0060 appears character-identically in 2 files \u2014 packages/cli/src/config-store.ts, packages/daemon/src/domain/user-settings/settings-store.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/config-store.ts"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4cffe04edfc4b785a5d2ff8b16a304b77a88a38eac483f2f0a2e1f44913a7d5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number.isSafeInteger(measured) \u0026\u0026 measured! \u003E 0\u0060 appears character-identically in 2 files \u2014 packages/cli/src/terminal-window-rex.ts, packages/cli/src/terminal-window.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/terminal-window-rex.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a4fd1d3af10c9a7476c521daa07581565a11e236970b7db81c440d98a2854c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Object.hasOwn(rule, \u0022ruleContent\u0022) \u0026\u0026 typeof rule.ruleContent !== \u0022string\u0022\u0060 appears character-identically in 2 files \u2014 packages/daemon/assets/plugins/openrig-core/hooks/scripts/permission-stop-descriptor.cjs, packages/daemon/src/domain/permission-stop-observation.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/daemon/assets/plugins/openrig-core/hooks/scripts/permission-stop-descriptor.cjs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c163b6773e36e21c94c028bc78d32a31be9e27276ce2a8ca4537d1294af5101"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060activity?.state === \u0022unknown\u0022 \u0026\u0026 activity.reason === \u0022usage_limit\u0022 \u0026\u0026 activity.rawEvent === \u0022at_limit\u0022 \u0026\u0026 activity.evidenceSource === \u0022runti\u2026\u0060 appears character-identically in 2 files \u2014 packages/cli/src/commands/ps.ts, packages/ui/src/lib/activity-visuals.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/commands/ps.ts"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"672990ea411d3ebd671864f7eca4a627523641061b744549005555a5ff6c111f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060actual !== \u0022missing\u0022 \u0026\u0026 actual !== \u0022directory\u0022\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/instance-initialization.ts, packages/daemon/src/domain/workspace/default-workspace-scaffold.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/daemon/src/domain/instance-initialization.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"3243be99325d93496acc37ce34fb0667ebeadc3082b9663ffacb751574bee57c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060at === -1 \u0026\u0026 LEGACY_FLAT_SESSION_PATTERN.test(raw)\u0060 appears character-identically in 3 files \u2014 packages/cli/src/session-name.ts, packages/daemon/src/domain/session-name.ts, packages/ui/src/lib/session-name.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/session-name.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"d142d89c2574d545d12a8d25ecb5ef3416e9d9a3bb1823c1f31f47e469728970"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060availability !== \u0022known\u0022 || typeof percent !== \u0022number\u0022\u0060 appears character-identically in 2 files \u2014 packages/ui/src/components/ContextUsageRing.tsx, packages/ui/src/hooks/useContextFleet.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/ui/src/components/ContextUsageRing.tsx"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa2b5e4eb4ea30e942bf3abab4fdc4bae9f391878f0e9ea0cf3053f2e8b3f58e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060b !== null \u0026\u0026 !isPristineScaffoldSection(b)\u0060 appears character-identically in 2 files \u2014 packages/cli/src/lib/scope/scaffold-placeholder.ts, packages/daemon/src/domain/scope/scaffold-placeholder.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/lib/scope/scaffold-placeholder.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad8172fd2d75ef22f051235a422df50631a7bbb7fbdd16e5481b6efc8c9a09fe"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060b.role === \u0022primary\u0022 \u0026\u0026 b.kind === \u0022slack\u0022\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/gateway/slack/open-asks.ts, packages/daemon/src/routes/gateway.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/daemon/src/domain/gateway/slack/open-asks.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d1d294566ee361f27a8467bea57abe4e894f522150d0d8738849460da86600"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060before.has(parent) \u0026\u0026 !after.has(parent)\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/project-lifecycle-compiler.ts, packages/daemon/src/domain/workflow-reconciliation.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/daemon/src/domain/project-lifecycle-compiler.ts"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf69db87eccc2fd00479905ea97980389ec1eb943c51a36e607b5b186a0aeec"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060beforeNativeDispatch \u0026\u0026 !beforeNativeDispatch()\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/adapters/claude-resume.ts, packages/daemon/src/adapters/codex-resume.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/daemon/src/adapters/claude-resume.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"4253b3320bc7880344afde8d1aedcc43dabf33c1c00c70e9641442cb079ea818"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060body === null || typeof body !== \u0022object\u0022 || Array.isArray(body)\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/openrouter-charge.ts, packages/daemon/src/routes/activity.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/daemon/src/domain/openrouter-charge.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e570154c68afa9deb5be83236760f5644a08e03af53881f8a233ffa3b793b93"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060body[\u0022clearAccountHome\u0022] !== undefined \u0026\u0026 typeof body[\u0022clearAccountHome\u0022] !== \u0022boolean\u0022\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/routes/provider.ts, packages/daemon/src/routes/seat.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/daemon/src/routes/provider.ts"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb1172663000fd7739ffc22b0d540990ae4d19a6e3179064b87a566b6b29f3e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bound.chars !== undefined \u0026\u0026 data.length !== bound.chars\u0060 appears character-identically in 2 files \u2014 docs/reference/community-harness-examples/dsh/openrig-dsh-runner.mjs, packages/daemon/src/adapters/pi-runner.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":"docs/reference/community-harness-examples/dsh/openrig-dsh-runner.mjs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"31bf8a8cbf0b4e8cabbdd1755723bdd5e796e2ecc2253717b033ba3deae4e8c9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060builtinName === \u0022yolo\u0022 || builtinName === \u0022auto\u0022\u0060 appears character-identically in 2 files \u2014 packages/cli/src/lib/permission-policy/policy-ref.ts, packages/daemon/src/domain/permission-policy/policy-ref.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/lib/permission-policy/policy-ref.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a353cf97674eb911f4546e62da4d99ebe329bba20e804ca26237ede977402f2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060c.estimateForChargedUsd !== null \u0026\u0026 c.estimateForChargedUsd !== undefined\u0060 appears character-identically in 2 files \u2014 packages/cli/src/commands/usage.ts, packages/tui/src/cost/cost-model.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/commands/usage.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d6216cd794f528dc2f0f5cd613854643fea274c5bc168bc089e388d8d52216"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060c.req.query(\u0022afterSortKey\u0022) || undefined\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/routes/projects.ts, packages/daemon/src/routes/stream.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/daemon/src/routes/projects.ts"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f9cd0d67c17ea13ce099edf5d96a7aea66efdc336150c6c6c041999fe4b54c9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060c.req.query(\u0022sourceSession\u0022) || undefined\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/routes/queue.ts, packages/daemon/src/routes/stream.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/daemon/src/routes/queue.ts"},"region":{"startLine":1561}}}],"partialFingerprints":{"codehealthFindingId/v1":"16aa7a94a49710e8f9c9eec4a1fad61653df0dafbf1f50a252c3fbe1a40e0ce4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060c[\u0022source\u0022] === \u0022default_login\u0022 \u0026\u0026 c[\u0022homeNote\u0022]\u0060 appears character-identically in 2 files \u2014 packages/cli/src/commands/provider.ts, packages/tui/src/usage/usage-model.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/commands/provider.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e411b7b107a884c42c3ae749603e0c2c1617a33cb577c22149a6d323dcc55b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060canFallBack \u0026\u0026 (code === \u0022EACCES\u0022 || code === \u0022EPERM\u0022 || code === \u0022EBUSY\u0022)\u0060 appears character-identically in 2 files \u2014 packages/cli/src/atomic-text-write.ts, packages/daemon/src/domain/user-settings/settings-store.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/atomic-text-write.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d2bbd25ac5c0cca0d1d411c7cf92e3bca11f859f226f7d5b6a68f218f1f433"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060changes[\u0022id\u0022] !== undefined \u0026\u0026 changes[\u0022id\u0022] !== id\u0060 appears character-identically in 2 files \u2014 packages/cli/src/host-registry.ts, packages/daemon/src/domain/hosts/hosts-registry-writer.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/host-registry.ts"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1118f0979f7c763dc519af469e04c666dd59d9cf61967c7d717192b3d53db0d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060child.exitCode !== null || child.signalCode !== null\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/adapters/bounded-probe-exec.ts, packages/daemon/src/domain/codex-network-default.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/daemon/src/adapters/bounded-probe-exec.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2787695b936a6f58d649254b8af59f3c718503bc623fcc334d62d263dde8bd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060complete \u0026\u0026 seatSkillsRoot \u0026\u0026 entry.category === \u0022skill\u0022\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/adapters/claude-code-adapter.ts, packages/daemon/src/adapters/codex-runtime-adapter.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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a2540a4dcab34d8e9ec7f5613838a29e2e51d139b7c0871382baaad1f1c841"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060context.usedTokens !== undefined \u0026\u0026 context.windowTokens !== undefined\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/agent-activity-store.ts, packages/daemon/src/domain/context-usage-store.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/daemon/src/domain/agent-activity-store.ts"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"06261794907ca12b722284a75f1d979999367247be81ab9a745edacfdf7959b3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060converged.kind !== \u0022add_member\u0022 || !converged.supported\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/routes/agent-images.ts, packages/daemon/src/routes/rigs.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/daemon/src/routes/agent-images.ts"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7533555cad721b65e9a83dedf720699a86a3d513c8271586a596332661411a1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060crlf \u0026\u0026 raw.startsWith(\u0022\\r\\n\u0022, bodyStart)\u0060 appears character-identically in 2 files \u2014 packages/cli/src/lib/frontmatter.ts, packages/daemon/src/domain/frontmatter.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/lib/frontmatter.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"873d1df7536b35ee167c58b9715a122910a8c40d3554903ddf466671d3b82cc7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060current == null || typeof current !== \u0022object\u0022\u0060 appears character-identically in 2 files \u2014 packages/cli/src/config-store.ts, packages/daemon/src/domain/user-settings/settings-store.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/config-store.ts"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa38096ba5ab4b431063ec6caeea4cb85fad57aa41ebe34bda267090a5bd4a2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060currentSpec \u0026\u0026 readmeContentStr !== null\u0060 appears character-identically in 2 files \u2014 packages/cli/src/lib/scope/scope-audit.ts, packages/daemon/src/domain/scope/scope-audit.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/lib/scope/scope-audit.ts"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce14139885558ba4f48ea05f5d36d39d23ad3d2afd3f8d19fe97d8678ccc9f3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cursor !== undefined \u0026\u0026 typeof cursor !== \u0022string\u0022\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/gateway/slack/channel-recovery.ts, packages/daemon/src/domain/gateway/slack/thread-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/daemon/src/domain/gateway/slack/channel-recovery.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"55715c12a239a256e08769f898e946f6a17207f0064ec5ecf9b3d1d33d724c09"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060data \u0026\u0026 typeof data === \u0022object\u0022 \u0026\u0026 \u0022unavailable\u0022 in (data as Record\u003Cstring, unknown\u003E)\u0060 appears character-identically in 2 files \u2014 packages/ui/src/components/files/FilesWorkspace.tsx, packages/ui/src/components/project/ArtifactsNavigator.tsx. 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/ui/src/components/files/FilesWorkspace.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"752121772a5c61fcf3afa6e1d834b3cdaf4340feed8e67e995e2041af3b5d02f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060data.contextAvailability === \u0022known\u0022 \u0026\u0026 typeof data.contextUsedPercentage === \u0022number\u0022\u0060 appears character-identically in 2 files \u2014 packages/ui/src/components/RigNode.tsx, packages/ui/src/components/topology/HybridTopologyNodes.tsx. 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/ui/src/components/RigNode.tsx"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"641601f245d6b33fbf3ce955735f8b87898c4de58d837ef54a470ced3a0a5b82"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060data.warnings \u0026\u0026 data.warnings.length \u003E 0\u0060 appears character-identically in 3 files \u2014 packages/cli/src/commands/expand.ts, packages/cli/src/commands/import.ts, packages/cli/src/commands/rig.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/commands/expand.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7596719f88a19709c0d2316f943b8f58e4feb189651c4240f2d3110c3697c8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060e.category === \u0022runtime_resource\u0022 \u0026\u0026 e.resourceType === \u0022claude_activity_hooks\u0022\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/adapters/claude-code-adapter.ts, packages/daemon/src/domain/restore-orchestrator.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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12aee638aa390510b6dc57417325e782369d05f28fd7f92ba7f0d61e685f0a3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entry.category !== \u0022skill\u0022 || entry.classification !== \u0022operator_conflict\u0022\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/rigspec-instantiator.ts, packages/daemon/src/domain/runtime-switch-materials.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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":2725}}}],"partialFingerprints":{"codehealthFindingId/v1":"0579edef1eeac1bd81957942c2f731b6d787bb5a6feb805b8ec0ee909ef573de"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entry.category === \u0022guidance\u0022 \u0026\u0026 entry.mergeStrategy === \u0022managed_block\u0022\u0060 appears character-identically in 6 files \u2014 packages/daemon/src/adapters/claude-code-adapter.ts, packages/daemon/src/adapters/codex-runtime-adapter.ts, packages/daemon/src/adapters/pi-runtime-adapter.ts, packages/daemon/src/adapters/stub-runtime-adapter.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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"a26a81f2e49b5a7c8fb4b947e8ec35b20d0ffe4f00767a201ded7a0ce6606ea4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entry.category === \u0022skill\u0022 \u0026\u0026 binding.seatSkillsRoot \u0026\u0026 !binding.seatSkillsRefused\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/adapters/claude-code-adapter.ts, packages/daemon/src/adapters/codex-runtime-adapter.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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb140277a40f7502d486a81e436d7ebffe11c90be379a570e03008b890275337"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entry.deliveryState === \u0022retained\u0022 || entry.deliveryState === \u0022retired\u0022\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/draft-aware-delivery.ts, packages/daemon/src/domain/seat-skill-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":"packages/daemon/src/domain/draft-aware-delivery.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"71faf4fe229ee406ed12af1e8c98492bf1fc24f37c2f3b61e4d69c2938467261"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entry.frame.sequence === frame.sequence \u0026\u0026 entry.frame.requestId !== frame.requestId\u0060 appears character-identically in 2 files \u2014 docs/reference/community-harness-examples/dsh/openrig-dsh-runner.mjs, packages/daemon/src/adapters/pi-runner.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":"docs/reference/community-harness-examples/dsh/openrig-dsh-runner.mjs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b49bd7bba9816373c10a1b37f7fb16c8ebecb7ecec0839409f8f04a89202e41"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entry.isFile() || entry.isSymbolicLink()\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/routes/bundles.ts, scripts/check-internal-leak-guard.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/daemon/src/routes/bundles.ts"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c024748f367f57b8b46db421b50e59fb1cac6a662d534e3ecbe0b73466ce3a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060env.OPENRIG_ACTIVITY_HOOK_TOKEN?.trim() || null\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/adapters/pi-runner.ts, packages/daemon/src/adapters/stub-runner.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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":2006}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c31ba11b70674593b8290eb2ac0461dddf6bbf3042b7fa2ad6f260b78a35bb5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060env[\u0022HERDR_ENV\u0022] === \u00221\u0022 \u0026\u0026 !!env[\u0022HERDR_PANE_ID\u0022] \u0026\u0026 !!env[\u0022HERDR_SOCKET_PATH\u0022]\u0060 appears character-identically in 2 files \u2014 packages/cli/src/terminal-window.ts, packages/tui/src/terminals/open-window.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/terminal-window.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"431cbf52b8f21c6bdb7bbdd227b2d0d3c654f6e92cd0b3c3e021e2ef46e070bf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err instanceof Error \u0026\u0026 /no such table/i.test(err.message)\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/review/gather.ts, packages/daemon/src/domain/workflow-frontier-guard.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/daemon/src/domain/review/gather.ts"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"4040713384b08c47cc99e9e1279e3ebfa1b02320aabd008142c212d1170bafe7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err.code === \u0022not_a_file\u0022 || err.code === \u0022not_a_directory\u0022\u0060 appears character-identically in 3 files \u2014 packages/daemon/src/routes/files.ts, packages/daemon/src/routes/plugins.ts, packages/daemon/src/routes/skills.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/daemon/src/routes/files.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9e96a7a1117e1c86c104784f68f86e74d3c5f4c4fd1c690e1948545f1f2a4b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err.code === \u0022path_invalid\u0022 || err.code === \u0022path_escape\u0022\u0060 appears character-identically in 3 files \u2014 packages/daemon/src/routes/files.ts, packages/daemon/src/routes/plugins.ts, packages/daemon/src/routes/skills.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/daemon/src/routes/files.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14d55a33c5e72a0290608b512ec3eadc6105d67bcaff6e98857c5969f9c110a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060error instanceof DeliveryGuardError \u0026\u0026 error.inputReadFailure\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/adapters/tmux.ts, packages/daemon/src/domain/session-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/daemon/src/adapters/tmux.ts"},"region":{"startLine":1379}}}],"partialFingerprints":{"codehealthFindingId/v1":"d99b85ea43909272dd634ed00c91191dca2d1c12679161b20ccd03ecc6070b5a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060error instanceof EnvironmentError \u0026\u0026 error.code === \u0022environment_file_missing\u0022\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/environment-platform.ts, packages/daemon/src/domain/environment-startup.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/daemon/src/domain/environment-platform.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"e152a874b485bc9304365f76608953231820c3a73f668b30730a518b1f206c58"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ev.type === \u0022key\u0022 \u0026\u0026 (ev.key === \u0022up\u0022 || ev.key === \u0022down\u0022)\u0060 appears character-identically in 2 files \u2014 packages/tui/src/crash-cart/restore-scroll.ts, packages/tui/src/main.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/tui/src/crash-cart/restore-scroll.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2950f91f38c4eba8e83231685407b929a8270f06f37a2f93f337b1c6f78ee2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060existing \u0026\u0026 existing.manifestHash !== resolved.manifestHash\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/package-install-service.ts, packages/daemon/src/routes/packages.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/daemon/src/domain/package-install-service.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"0821da70d1adc96934e8faa6259c6331e4d939f9e390597c9dab24ce196e225b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060existing \u0026\u0026 process.platform !== \u0022win32\u0022\u0060 appears character-identically in 2 files \u2014 packages/cli/src/atomic-text-write.ts, packages/daemon/src/domain/user-settings/settings-store.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/atomic-text-write.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd1aad3f5519e720e6462ee0391001efce72e31c807adfcc0480e854b6fbe8e2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060expectedPlan !== undefined \u0026\u0026 expectedPlan !== planId\u0060 appears character-identically in 2 files \u2014 packages/cli/src/terminal-window-rex.ts, packages/cli/src/terminal-window.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/terminal-window-rex.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a2dc7e52e57f1a58e343b5ede3a93d7f070f566b84cc2d69a93e6e6508aac5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fence.marker === marker \u0026\u0026 length \u003E= fence.length \u0026\u0026 /^[ \\t\\r]*$/.test(line.slice(fenceMatch[0].length))\u0060 appears character-identically in 2 files \u2014 packages/daemon/assets/plugins/openrig-core/skills/loading-addressable-markdown/scripts/resolve-markdown.mjs, packages/daemon/src/domain/markdown-address.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/daemon/assets/plugins/openrig-core/skills/loading-addressable-markdown/scripts/resolve-markdown.mjs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"204b5ea4fed866a017140047bd3568f4d007801d947a2ccb32ed755943c7e794"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fileVal !== undefined \u0026\u0026 fileVal !== null \u0026\u0026 fileVal !== \u0022\u0022\u0060 appears character-identically in 2 files \u2014 packages/cli/src/config-store.ts, packages/daemon/src/domain/user-settings/settings-store.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/config-store.ts"},"region":{"startLine":1674}}}],"partialFingerprints":{"codehealthFindingId/v1":"8050472242f22f10554ae629eef48efe9aeacf3e952aed9501c0becfb1878dba"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060filesAllowed \u0026\u0026 mission.data \u0026\u0026 \u0022missionPath\u0022 in mission.data\u0060 appears character-identically in 2 files \u2014 packages/ui/src/components/project/SteeringTab.tsx, packages/ui/src/components/project/WorkspacePortfolioPanel.tsx. 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/ui/src/components/project/SteeringTab.tsx"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69112c03da3c6918adbba09d98dd1f7536a383c210bfc1ea3a36e4a075bd425"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060firstString(env.OPENRIG_HOME, env.RIGGED_HOME) || path.join(os.homedir(), \u0022.openrig\u0022)\u0060 appears character-identically in 2 files \u2014 packages/daemon/assets/plugins/openrig-core/hooks/scripts/activity-relay.cjs, packages/daemon/assets/plugins/openrig-core/hooks/scripts/compaction-restore-bridge.cjs. 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/daemon/assets/plugins/openrig-core/hooks/scripts/activity-relay.cjs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"146de0a51e2a161e980dae4f15ac2796a3d8d322ca2b2b77af0db03e563ae3f5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060found.ok \u0026\u0026 found.preset.protocol === \u0022pi-rpc\u0022\u0060 appears character-identically in 3 files \u2014 packages/daemon/src/adapters/community-harness-runtime-adapter.ts, packages/daemon/src/domain/community-harness-presets.ts, packages/daemon/src/routes/activity.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/daemon/src/adapters/community-harness-runtime-adapter.ts"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"f70a8bfd6f7a674d50868948ee1d2cd89e7dc7ecba95e3cb1ceaed22fded3329"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060guard \u0026\u0026 !guard.ownsLifecycle(input.nodeId)\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/rigspec-instantiator.ts, packages/daemon/src/domain/startup-orchestrator.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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":2500}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f034cb3d8deceffeb684d114a7bca4ec9eb0ba38e33da0700c262f5fae60140"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060hasEnv \u0026\u0026 (typeof bearerEnv !== \u0022string\u0022 || bearerEnv.trim() === \u0022\u0022)\u0060 appears character-identically in 2 files \u2014 packages/cli/src/host-registry.ts, packages/daemon/src/domain/hosts/hosts-registry-reader.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/host-registry.ts"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca620df1183d61e515739290a4d5ba17abf457a52e615d8ccf3aa2ee5d0d0e0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060hasFile \u0026\u0026 (typeof bearerFile !== \u0022string\u0022 || bearerFile.trim() === \u0022\u0022)\u0060 appears character-identically in 2 files \u2014 packages/cli/src/host-registry.ts, packages/daemon/src/domain/hosts/hosts-registry-reader.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/host-registry.ts"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f896885409f64219ebeba5d6453cb299096ad808b49722663572ff6c9d56abd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060health.status === 200 \u0026\u0026 typeof health.data?.selfHostId === \u0022string\u0022 \u0026\u0026 health.data.selfHostId.trim()\u0060 appears character-identically in 2 files \u2014 packages/cli/src/commands/queue.ts, packages/cli/src/commands/whoami.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/commands/queue.ts"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce46112b1505f19f8374d260a20981c007e1251af48d1c745fb67d45c82d9daf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060hostToken === undefined || hostToken === null || hostToken === \u0022\u0022\u0060 appears character-identically in 2 files \u2014 packages/cli/src/lib/hosts/fanout-contract.ts, packages/daemon/src/domain/hosts/fanout-contract.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/lib/hosts/fanout-contract.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf169d19d806c06803cc0cfc0906395fc45a3363162bf6396eab4b80375dedc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060hostsData?.ownName \u0026\u0026 hostsData.ownName.trim() !== \u0022\u0022\u0060 appears character-identically in 2 files \u2014 packages/ui/src/components/project/ProjectTreeView.tsx, packages/ui/src/components/topology/ScopePages.tsx. 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/ui/src/components/project/ProjectTreeView.tsx"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"89afa212760dab4fb1cce08e42e400b0748d9e649edfe22b332139ab7175c681"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i.state === \u0022withdrawn\u0022 || i.state === \u0022rejected\u0022\u0060 appears character-identically in 2 files \u2014 packages/tui/src/execution/execution-model.ts, packages/tui/src/scopes/scopes-model.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/tui/src/execution/execution-model.ts"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"783c48adf3f5f9a09a1f07332bdc76a718354535ba19704a18770e024a803b0f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060id[\u0022source\u0022] !== \u0022unresolved\u0022 \u0026\u0026 id[\u0022orgId\u0022]\u0060 appears character-identically in 2 files \u2014 packages/cli/src/commands/provider.ts, packages/tui/src/usage/usage-model.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/commands/provider.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"e34406c8f75b5ebb05d658ffcf479711f6918e3a94e57336d12344de963061b8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060identity \u0026\u0026 opts.cache.isPinnedByUnfinishedWork(identity.name, identity.version)\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/spec-library-workflow-scanner.ts, packages/daemon/src/domain/workflow-spec-unregister.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/daemon/src/domain/spec-library-workflow-scanner.ts"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca3b1f7d08efd30989e06f406673f41f8c2e0d286ce1ecea4256ed2b569fb5d1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060indent \u003C= open.indent \u0026\u0026 (LIST_ITEM_START.test(line) || open.afterBlank)\u0060 appears character-identically in 2 files \u2014 packages/cli/src/lib/scope/scope-audit.ts, packages/daemon/src/domain/scope/scope-audit.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/lib/scope/scope-audit.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c43485da0b8e05b2d551dff6457a9eafda1804e7d6cad4ceb94804ad1dd534"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060input.identityProvenance === \u0022principal:v1\u0022 \u0026\u0026 !principal\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/outbox-handler.ts, packages/daemon/src/domain/queue-transition-log.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/daemon/src/domain/outbox-handler.ts"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"689d909b9736908031db3a5f5af664d855460a19eba77cb8c6b3ce7c9d1eb13e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060input.missionNotesResolution === null \u0026\u0026 missionIsActive(parseStatusFromFrontmatter(input.readmeFrontmatterRaw))\u0060 appears character-identically in 2 files \u2014 packages/cli/src/lib/scope/scope-audit.ts, packages/daemon/src/domain/scope/scope-audit.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/lib/scope/scope-audit.ts"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"4049b559f77fea6c5ea3d71305edf7cb06208ad93264f0975302ef5a4bddf500"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060input.nodeFileName === \u0022SPEC.md\u0022 || (input.nodeFileName === undefined \u0026\u0026 frontmatterIntent)\u0060 appears character-identically in 2 files \u2014 packages/cli/src/lib/scope/scope-audit.ts, packages/daemon/src/domain/scope/scope-audit.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/lib/scope/scope-audit.ts"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5d9b63af6ba337c9990c60aa1e13f571a43884adbe9f440f92797bdd4850b2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060input.proofFileExists === true \u0026\u0026 input.proofDirExists === true \u0026\u0026 input.proofDirHasEntries === true\u0060 appears character-identically in 2 files \u2014 packages/cli/src/lib/scope/scope-audit.ts, packages/daemon/src/domain/scope/scope-audit.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/lib/scope/scope-audit.ts"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac09948488043a83d6a00463dfeffd8bb82cc6c3fe8298f01e2e537c79a7d78e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060instance.deadline.state !== \u0022healthy\u0022 \u0026\u0026 instance.deadline.evidence\u0060 appears character-identically in 2 files \u2014 packages/ui/src/components/workflow/WorkflowInstancePage.tsx, packages/ui/src/components/workflow/WorkflowInstancesBand.tsx. 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/ui/src/components/workflow/WorkflowInstancePage.tsx"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"9adade6baaa249b40ec22e6bf9705eb0136ea9d3778fb558323dc8ce3724470a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060instance.status !== \u0022active\u0022 \u0026\u0026 instance.status !== \u0022waiting\u0022\u0060 appears character-identically in 3 files \u2014 packages/daemon/src/domain/workflow-deadline.ts, packages/daemon/src/domain/workflow-projector.ts, packages/daemon/src/domain/workflow-runtime.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/daemon/src/domain/workflow-deadline.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"a331ec5bde029bfd10a49231dca7d125c1675c5c80a2bae845bcda481b67373b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isPristineScaffoldSection(prdBody) \u0026\u0026 readmeContentStr !== null\u0060 appears character-identically in 2 files \u2014 packages/cli/src/lib/scope/scope-audit.ts, packages/daemon/src/domain/scope/scope-audit.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/lib/scope/scope-audit.ts"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c77aab0b4dbbc8bd6d5c658f26c9a0a5400cff819c49741ad45074bc8b42cc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060key === \u0022health.context_pressure.warning_percent\u0022 || key === \u0022health.context_pressure.critical_percent\u0022\u0060 appears character-identically in 2 files \u2014 packages/cli/src/config-store.ts, packages/daemon/src/domain/user-settings/settings-store.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/config-store.ts"},"region":{"startLine":1630}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf940ae494518cc6e68af6f43aa667b7bf34b2b3eba426910502ae8ecd0be456"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060landed.reason === \u0022inflight\u0022 || landed.reason === \u0022inactive\u0022\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/gateway/slack/channel-recovery.ts, packages/daemon/src/domain/gateway/slack/thread-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/daemon/src/domain/gateway/slack/channel-recovery.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"248344a501e47b7525ad8a31a370dc983a29efba4255814611b5450a8fc6fe52"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060launchWrapper \u0026\u0026 !isLaunchWrapperRuntime(row.runtime)\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/node-inventory.ts, packages/daemon/src/domain/rig-repository.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/daemon/src/domain/node-inventory.ts"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"651b2c8c4b76aed7b10fa8e13ad8f2110d12b51b1edd8e70b8130fd5a4f8c94c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060legacyDefault !== null \u0026\u0026 fileVal === legacyDefault\u0060 appears character-identically in 2 files \u2014 packages/cli/src/config-store.ts, packages/daemon/src/domain/user-settings/settings-store.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/config-store.ts"},"region":{"startLine":1676}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b3a1ac840b722c6f3ec921daad2f8f09a3367cb2bf68d15943f4a08aeebc3a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060legacyValue !== undefined \u0026\u0026 legacyValue !== \u0022\u0022\u0060 appears character-identically in 2 files \u2014 packages/cli/src/openrig-compat.ts, packages/daemon/src/openrig-compat.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/openrig-compat.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb266f89dadcac1171f6ac5619abec5bb07f0b67e1c35e87a298d39d4195238"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lines.length \u003E 0 \u0026\u0026 lines[lines.length - 1] === \u0022\u0022\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/transcript-store.ts, packages/daemon/src/terminal/TerminalSessionBroker.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/daemon/src/domain/transcript-store.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba2dff13ef3f32e66d6589bd3ec5f18ccd8ca032fa27c9bdd647eb1930cfff7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lp === \u0022floor\u0022 || lp === \u0022full_bypass\u0022 || lp === \u0022auto\u0022\u0060 appears character-identically in 2 files \u2014 packages/cli/src/lib/permission-policy/policy-ref.ts, packages/daemon/src/domain/permission-policy/policy-ref.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/lib/permission-policy/policy-ref.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4231bfcd444bf128af8b5666318fdf17c49456b6e4faf7106979be0d3652326"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060m \u0026\u0026 !isScaffoldPlaceholderText(m[1]!.trim())\u0060 appears character-identically in 2 files \u2014 packages/cli/src/lib/scope/scaffold-placeholder.ts, packages/daemon/src/domain/scope/scaffold-placeholder.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/lib/scope/scaffold-placeholder.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1dad8635b1ebc479976fc46789ec64bdb5549f3fc64a839ed8c6bfe3562000"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060marker \u0026\u0026 (marker[1]![0] !== \u0022\u0060\u0022 || !marker[2]!.includes(\u0022\u0060\u0022))\u0060 appears character-identically in 2 files \u2014 packages/cli/src/lib/scope/logical-checkbox.ts, packages/daemon/src/domain/scope/logical-checkbox.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/lib/scope/logical-checkbox.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"e800e8365fbcb10696a5ef1273a83751eeff7b5314463707f0b935951cf77c1e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060marker \u0026\u0026 marker[1]![0] === fence.marker \u0026\u0026 marker[1]!.length \u003E= fence.length \u0026\u0026 /^[ \\t]*$/.test(marker[2]!)\u0060 appears character-identically in 2 files \u2014 packages/cli/src/lib/scope/logical-checkbox.ts, packages/daemon/src/domain/scope/logical-checkbox.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/lib/scope/logical-checkbox.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"680ec606715062dde9e93fc6085dbbc02b78a937cd4c552b57ee4e9f4c56a758"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060marker === fence.marker \u0026\u0026 length \u003E= fence.length \u0026\u0026 /^[ \\t\\r]*$/.test(tail)\u0060 appears character-identically in 2 files \u2014 packages/cli/src/lib/scope/progress-edit.ts, packages/daemon/src/domain/progress/progress-indexer.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/lib/scope/progress-edit.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e4a8bad61f5c7f5899ac41efb792c8caa8910a3a523d80ebadf5a229b8da14a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060mode === \u0022human-led\u0022 || mode === \u0022delegated\u0022\u0060 appears character-identically in 3 files \u2014 packages/cli/src/commands/rig-mode.ts, packages/daemon/src/domain/rig-mode/rig-mode-store.ts, packages/daemon/src/routes/rig-mode.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/commands/rig-mode.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc92d59284cd929b8302a8792f0565ed552e7c7d5a42d79fe59edd6b30d91275"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060n.canonicalSessionName \u0026\u0026 n.sessionStatus === \u0022running\u0022\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/routes/rigs.ts, packages/daemon/src/routes/up.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/daemon/src/routes/rigs.ts"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4ad9e7b64952f8ccfd62403b92650a70d4706172b0dff8c2f9e37737941d1d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060n.status === \u0022failed\u0022 || n.status === \u0022awaiting-decision\u0022\u0060 appears character-identically in 2 files \u2014 packages/cli/src/commands/start.ts, packages/cli/src/commands/up.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/commands/start.ts"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6fa8d988b2114206a1b0174489184d37beb525a9c24df41e7abc32d563caca"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060next !== undefined \u0026\u0026 !next.startsWith(\u0022--\u0022)\u0060 appears character-identically in 2 files \u2014 packages/cli/src/release-surface/generate.ts, packages/ui/twin/capture/twin-capture.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/release-surface/generate.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"19dbf4f822711a635b6ed736aaaaa18b1c24af7488741f4d76a64be954c7bc75"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node === null || typeof node !== \u0022object\u0022 || Array.isArray(node)\u0060 appears character-identically in 2 files \u2014 packages/cli/src/commands/up.ts, packages/daemon/src/domain/user-settings/settings-store.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/commands/up.ts"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e0958d02ca0522748d9e8fd3e9a30594c69975be05e50500a4e1799fae20e4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.packageRefs \u0026\u0026 node.packageRefs.length \u003E 0\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/rigspec-codec.ts, packages/daemon/src/domain/rigspec-exporter.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/daemon/src/domain/rigspec-codec.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f0b2c02eb7dea4b9c22106bd01beaf27e6c493162a0553243251ce19b4b2ac"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.runtime === \u0022claude-code\u0022 || node.runtime === \u0022codex\u0022\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/restore-orchestrator.ts, packages/daemon/src/domain/rig-teardown.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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":1553}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f9b652c113b39bb19c19f8844d48841e4a6f5ed317721c285e71da06ead02b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.sessionStatus === \u0022running\u0022 \u0026\u0026 node.startupStatus === \u0022ready\u0022\u0060 appears character-identically in 2 files \u2014 packages/cli/src/commands/compact-plan.ts, packages/daemon/src/domain/restore-check-service.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/commands/compact-plan.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"d23476255cec6fa9532a15ec2d2b36f5341752856abf772140b624221b4e0db6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.type === \u0022podGroup\u0022 || node.type === \u0022group\u0022\u0060 appears character-identically in 3 files \u2014 packages/ui/src/components/RigGraph.tsx, packages/ui/src/components/topology/HostMultiRigGraph.tsx, packages/ui/src/lib/hybrid-layout.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/ui/src/components/RigGraph.tsx"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f37280d30f462ef3add577564403a7d89d777e27ba27d4476225da386a0fe3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060nodes.status !== 200 || !Array.isArray(nodes.data)\u0060 appears character-identically in 2 files \u2014 packages/cli/src/commands/context.ts, packages/cli/src/mcp-http.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/commands/context.ts"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"294a09eabc8326cb9ab4f306551edfcee9a203e336de68b916bb94dcc8bf241c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060normalized === \u0022closed\u0022 || normalized.startsWith(\u0022closed-\u0022)\u0060 appears character-identically in 2 files \u2014 packages/ui/src/components/project/MissionProgressHeatmap.tsx, packages/ui/src/components/project/ProjectMetaPrimitives.tsx. 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/ui/src/components/project/MissionProgressHeatmap.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4958a33f29bf80f74a0665c70057d692c76b93ac5e779611abaa5e7110c22a7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060normalized.includes(\u0022done\u0022) || normalized.includes(\u0022ship\u0022) || normalized.includes(\u0022close\u0022) || normalized.includes(\u0022proven\u0022) || normalized.in\u2026\u0060 appears character-identically in 2 files \u2014 packages/cli/src/lib/scope/scope-audit.ts, packages/daemon/src/domain/scope/scope-audit.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/lib/scope/scope-audit.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"a363555ed23fbeebf45a620438456e02b8399c863f095882904a3a5a1a299238"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060notes !== undefined \u0026\u0026 typeof notes !== \u0022string\u0022\u0060 appears character-identically in 2 files \u2014 packages/cli/src/host-registry.ts, packages/daemon/src/domain/hosts/hosts-registry-reader.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/host-registry.ts"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"af5d595457d33e741d81e36b7fa18c2fc394fbe639aa104ff07edc14d4de9eed"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060obj == null || typeof obj !== \u0022object\u0022 || Object.keys(obj).length \u003E 0\u0060 appears character-identically in 2 files \u2014 packages/cli/src/config-store.ts, packages/daemon/src/domain/user-settings/settings-store.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/config-store.ts"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5c1142888ce9b34710a09a0a4906e30d814aea5118cd916be5319ea6b05dad"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060opened.length \u003E 0 || view.opened.length === 0\u0060 appears character-identically in 4 files \u2014 packages/daemon/src/domain/terminal/cmux-provider-adapter.ts, packages/daemon/src/domain/terminal/herdr-adapter.ts, packages/daemon/src/domain/terminal/herdr-app-provider.ts, packages/daemon/src/domain/terminal/rex-adapter.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/daemon/src/domain/terminal/cmux-provider-adapter.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"478f62641d607aa489c7ea230ce2a9ab55bf2de2a4a1d9f639b0d1288f06703f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060opts.beforeNativeDispatch \u0026\u0026 !opts.beforeNativeDispatch()\u0060 appears character-identically in 4 files \u2014 packages/daemon/src/adapters/claude-code-adapter.ts, packages/daemon/src/adapters/codex-runtime-adapter.ts, packages/daemon/src/adapters/pi-runtime-adapter.ts, packages/daemon/src/domain/environment-startup.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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b8f08315822b274f051d7853b2c942fd3ee9cdf42c9edc7f4d80f5c97be2e5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060p \u0026\u0026 typeof p === \u0022object\u0022 \u0026\u0026 typeof (p as Record\u003Cstring, unknown\u003E).id === \u0022string\u0022\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/plugin-discovery-service.ts, packages/ui/src/components/LiveNodeDetails.tsx. 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/daemon/src/domain/plugin-discovery-service.ts"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"995e125ca531c78b0810b66e5501b6a212f3d9827c5368169e9c14880692797d"}},{"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 12 files \u2014 packages/cli/src/lib/scope/scope-audit.ts, packages/cli/src/lib/scope/scope-fs.ts, packages/daemon/assets/plugins/openrig-core/hooks/scripts/activity-relay.cjs, packages/daemon/assets/plugins/openrig-core/hooks/scripts/compaction-restore-bridge.cjs. 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/lib/scope/scope-audit.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"449f0527f27f4059bfd0eede16bcd3ce13c5ee82c8a73f51d0769c17aba11103"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parsed === null || typeof parsed !== \u0022object\u0022\u0060 appears character-identically in 2 files \u2014 packages/cli/src/host-registry.ts, packages/daemon/src/domain/hosts/hosts-registry-reader.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/host-registry.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91adb5dfdbd6be1e6fc42e7beab7bda6fde05fa517bea2938b79bb8eef397e5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parsed === null || typeof parsed !== \u0022object\u0022 || Array.isArray(parsed)\u0060 appears character-identically in 5 files \u2014 packages/cli/src/commands/up.ts, packages/daemon/src/adapters/pi-runner.ts, packages/daemon/src/domain/model-divergence/effective-model-readers.ts, packages/daemon/src/domain/policies/artifact-pool-helpers.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/commands/up.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65c984b44ed329358299f5054498f6f969ce3af05263b84ed14b7fdb476001f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060path.split(/[\\\\/]/).includes(\u0022..\u0022) || path.startsWith(\u0022/\u0022)\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/agent-images/manifest-parser.ts, packages/daemon/src/domain/context-packs/manifest-parser.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/daemon/src/domain/agent-images/manifest-parser.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"808d09f3b025c858d0f7ee4dc942840102ec256e08d721868708e412eeb6699d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060phase === \u0022attempted\u0022 || phase === \u0022written\u0022 || (phase !== \u0022not_reached\u0022 \u0026\u0026 enter.data?.[\u0022sent\u0022] !== false \u0026\u0026 (reason === \u0022submit_failed\u0022 ||\u2026\u0060 appears character-identically in 2 files \u2014 packages/cli/src/commands/send.ts, packages/cli/src/commands/walk.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/commands/send.ts"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b25795d281aa156eadb6873b3c9d77c078bcb0c5bab2f97bc7fedc49091410e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060preview.status \u003E= 400 || !(\u0022composed\u0022 in preview.data)\u0060 appears character-identically in 2 files \u2014 packages/cli/src/terminal-window-rex.ts, packages/cli/src/terminal-window.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/terminal-window-rex.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f920a3120e486f78915b78bc6035c204f701af329cc3f8ad50f87026ebac23"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060primaryValue !== undefined \u0026\u0026 primaryValue !== \u0022\u0022\u0060 appears character-identically in 2 files \u2014 packages/cli/src/openrig-compat.ts, packages/daemon/src/openrig-compat.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/openrig-compat.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ff81b87fe35a5189bff9f5c2ea9d5ad02fa2510a7c8c05ed920f87b3048081"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060probe.code === \u0022returned_to_shell\u0022 || probe.code === \u0022awaiting_runtime\u0022\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/adapters/codex-resume.ts, packages/daemon/src/adapters/codex-runtime-adapter.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/daemon/src/adapters/codex-resume.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7893d1e638b43d52234eabecac8aca72666b4cc25112211741b1bc7344d99a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.env[\u0022TMUX\u0022] \u0026\u0026 process.env[\u0022TMUX_PANE\u0022]\u0060 appears character-identically in 2 files \u2014 packages/cli/src/terminal-window.ts, packages/tui/src/terminals/open-window.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/terminal-window.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"97eab98684b9c0b0e884b1824479e03f8bda4e1695576f1d810bb63bd0972384"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060quiet \u0026\u0026 (quiet.state === \u0022held\u0022 || quiet.state === \u0022released\u0022)\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/queue-stuck-sweep.ts, packages/daemon/src/domain/queue-wake-ladder.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/daemon/src/domain/queue-stuck-sweep.ts"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c52773778119a0ab51eedd2ad99680b385c4b3e9b3d0a211aaeb9dd74702b07"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060r.json.has_more !== undefined \u0026\u0026 typeof r.json.has_more !== \u0022boolean\u0022\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/gateway/slack/channel-recovery.ts, packages/daemon/src/domain/gateway/slack/thread-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/daemon/src/domain/gateway/slack/channel-recovery.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"e835b8e95bab07a1cd6f82fa432221edff4c75152ecb1e9bcf9fd5bd54939eec"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060r.json.has_more === true || (typeof cursor === \u0022string\u0022 \u0026\u0026 cursor.length \u003E 0)\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/gateway/slack/channel-recovery.ts, packages/daemon/src/domain/gateway/slack/thread-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/daemon/src/domain/gateway/slack/channel-recovery.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6b3f4f5f8e142da2cbd80c538c5c1ef155191127e87d5b9760540612f82c7e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060r.json.has_more === undefined \u0026\u0026 cursor === undefined\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/gateway/slack/channel-recovery.ts, packages/daemon/src/domain/gateway/slack/thread-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/daemon/src/domain/gateway/slack/channel-recovery.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d02be391c6c609526832e343efb47671988f612505f519e7ac5b49ce5272d3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060r.status === \u0022active\u0022 || r.status === \u0022waiting\u0022\u0060 appears character-identically in 2 files \u2014 packages/ui/src/components/workflow/WorkflowInstancesBand.tsx, packages/ui/src/components/workflow/WorkflowsPage.tsx. 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/ui/src/components/workflow/WorkflowInstancesBand.tsx"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c718fc712c2892cfdb49a21bfc4f9836a97ca54fa10c9bbea4eb330337c9182"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060raw \u0026\u0026 typeof raw === \u0022object\u0022 \u0026\u0026 !Array.isArray(raw)\u0060 appears character-identically in 3 files \u2014 packages/daemon/src/routes/provider.ts, packages/daemon/src/routes/rigspec.ts, packages/daemon/src/routes/terminal.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/daemon/src/routes/provider.ts"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"304fb9744f63cd84354331cdd266ceda13fbce39e919ce27d6544007e8c157d3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060raw \u0026\u0026 typeof raw === \u0022object\u0022 \u0026\u0026 Array.isArray((raw as Record\u003Cstring, unknown\u003E).pods)\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/spec-validation-service.ts, packages/daemon/src/routes/rigspec.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/daemon/src/domain/spec-validation-service.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"e328d41fd8e6c8c01ad16403770932af4d3d1bef3c7aeaeb50ceb61848a624a0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060raw === null || typeof raw !== \u0022object\u0022 || Array.isArray(raw)\u0060 appears character-identically in 7 files \u2014 packages/daemon/src/domain/bundle-types.ts, packages/daemon/src/domain/pi-usage-entries-store.ts, packages/daemon/src/domain/rigspec-schema.ts, packages/daemon/src/domain/seat-env.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/daemon/src/domain/bundle-types.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f028516383c3d0eeb88bf3104cce6ec34714a5be57252996cf5e577fe45a39"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rawEdges !== undefined \u0026\u0026 rawEdges !== null \u0026\u0026 !Array.isArray(rawEdges)\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/rigspec-instantiator.ts, packages/daemon/src/routes/rigs.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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"be87ac454e1e20e84b6b10ea8b0b7acade09862bd528bc86d17c78dca421a212"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060readmeBody !== null \u0026\u0026 !isPristineScaffoldSection(readmeBody)\u0060 appears character-identically in 3 files \u2014 packages/cli/src/lib/scope/scope-audit.ts, packages/daemon/src/domain/review/compose.ts, packages/daemon/src/domain/scope/scope-audit.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/lib/scope/scope-audit.ts"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3f73af739e298ff60f5ccfb73e5a5cfa756f0a601288ab8709138b6ab78db5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060record === null || typeof record !== \u0022object\u0022 || Array.isArray(record)\u0060 appears character-identically in 3 files \u2014 packages/cli/src/restore-packet/claude-transcript-parser.ts, packages/cli/src/restore-packet/codex-jsonl-parser.ts, packages/cli/src/restore-packet/runtime-detect.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/restore-packet/claude-transcript-parser.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e5f685e9aabd807962bb09a1f28265e6cd71c8bc8ea2e8b2b888154f5c2322"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060relPath.split(/[\\\\/]/).includes(\u0022..\u0022) || relPath.startsWith(\u0022/\u0022)\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/agent-images/agent-image-library-service.ts, packages/daemon/src/domain/context-packs/context-pack-library-service.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/daemon/src/domain/agent-images/agent-image-library-service.ts"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"671ec405479775dfee7f8ff4e411cca42f47646821a62ed3c1ca9ba84cbf0a0c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060requiresOpenAiAuth !== false || typeof envKey !== \u0022string\u0022 || !/^[A-Za-z_][A-Za-z0-9_]*$/.test(envKey)\u0060 appears character-identically in 2 files \u2014 packages/cli/src/provider-auth.ts, packages/daemon/src/domain/kernel-boot.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/provider-auth.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"a20f94054fb6d362ad77065e02399c6bedb163a7a26627b5d4d844fa0fe46403"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060res.status === 401 || res.status === 403\u0060 appears character-identically in 6 files \u2014 packages/daemon/src/domain/feed/attention-aggregator.ts, packages/daemon/src/domain/hosts/fleet-scopes.ts, packages/daemon/src/domain/provider/usage-across-hosts.ts, packages/daemon/src/domain/review/fleet-compose.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/daemon/src/domain/feed/attention-aggregator.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e5817440c3355e0e2c28927c72161b937d369349c668a7499c48311ba3f06ce"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060res.status \u003E= 400 || !Array.isArray(res.data)\u0060 appears character-identically in 2 files \u2014 packages/cli/src/commands/watchdog.ts, packages/cli/src/seat-attention.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/commands/watchdog.ts"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e379be924ab68f88c0bbe515b6ae267f3c338d215f573c684357a3b6fae8787"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060resolution.kind === \u0022resolved\u0022 \u0026\u0026 typeof resolution.session.resumeToken === \u0022string\u0022 \u0026\u0026 resolution.session.resumeToken.length \u003E 0\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/node-inventory.ts, packages/daemon/src/domain/rig-repository.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/daemon/src/domain/node-inventory.ts"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ed3fa9b9bca041b4fdb857775f3183f0e16c41765cf5549e65af2b8ee7cd75"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result.inputPhase === \u0022not_reached\u0022 || result.sent === false\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/pi-compaction-service.ts, packages/daemon/src/domain/session-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/daemon/src/domain/pi-compaction-service.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"591fbdad577f861e1d452b2a539edf9a1642e935de152bc0857882b6f87367ef"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result.ok \u0026\u0026 result.outcome !== \u0022retained\u0022\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/pi-compaction-service.ts, packages/daemon/src/domain/session-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/daemon/src/domain/pi-compaction-service.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"b719a785a3edf492a80132862f9d78d2af97a804ce749b4c6db843dbe74249c8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result.sent === false || result.inputPhase === \u0022not_reached\u0022\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/session-transport.ts, packages/daemon/src/domain/watchdog-delivery-receipts.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/daemon/src/domain/session-transport.ts"},"region":{"startLine":2898}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a6a85824473ac92a31bef7138e42c5785b6147562804f6ebf9c2baa364300f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result.stderr || result.stdout || \u0022unknown error\u0022\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/adapters/stub-compaction.ts, packages/daemon/src/adapters/stub-restore.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/daemon/src/adapters/stub-compaction.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc20acb0e4b73e2ba2213895a9733dbd4cf00f7e8e7fe38e3ab2206e651a44b0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060role === \u0022architect\u0022 || role === \u0022lead\u0022 || role === \u0022orchestrator\u0022\u0060 appears character-identically in 2 files \u2014 packages/ui/src/components/RigNode.tsx, packages/ui/src/components/topology/HybridTopologyNodes.tsx. 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/ui/src/components/RigNode.tsx"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"967908ca6220da5b2d1c6c4aebb0d29021c4af126c2cde806caa9afddbf0bf07"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060runtime !== \u0022claude\u0022 \u0026\u0026 runtime !== \u0022codex\u0022\u0060 appears character-identically in 2 files \u2014 packages/cli/src/commands/ask.ts, packages/daemon/src/routes/context-packs.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/commands/ask.ts"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc2d01c0b39794b866d02815a0da63e3ebc30cd5425bc2a4ed9b243a23d98f1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060runtime !== \u0022claude-code\u0022 \u0026\u0026 runtime !== \u0022codex\u0022\u0060 appears character-identically in 4 files \u2014 packages/daemon/src/domain/agent-images/resume-token-discovery.ts, packages/daemon/src/domain/native-permission-store.ts, packages/daemon/src/domain/permission-account.ts, packages/daemon/src/domain/seat-cwd-preparation.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/daemon/src/domain/agent-images/resume-token-discovery.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6abfc4ed54363b6334f0bd082c63c0642adf24011c9006413b0970a68e4de49"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060runtime !== \u0022codex\u0022 \u0026\u0026 runtime !== \u0022claude-code\u0022\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/native-permission-selection.ts, packages/daemon/src/domain/session-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/daemon/src/domain/native-permission-selection.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"70df3f924a8e9806e26138af03ebcf2cac9786799334ada9e4e4749f9a778318"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060runtime === \u0022claude-code\u0022 || runtime === \u0022codex\u0022\u0060 appears character-identically in 3 files \u2014 packages/daemon/src/domain/bundle-behaviour.ts, packages/daemon/src/domain/profile-resolver.ts, packages/daemon/src/domain/session-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/daemon/src/domain/bundle-behaviour.ts"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a642c611958463aada336382443457454c4fa51d9dfd6f890590a429b921e90"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060runtime === \u0022codex\u0022 || runtime === \u0022claude-code\u0022\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/queue-wake-ladder.ts, packages/daemon/src/routes/activity.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/daemon/src/domain/queue-wake-ladder.ts"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"65669df5173f9857fffe20bf1e2204b2e8e837501659a7b45c7b6af75a9710a3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060s.status === \u0022failed\u0022 || s.status === \u0022blocked\u0022\u0060 appears character-identically in 4 files \u2014 packages/daemon/src/routes/bootstrap-failure-response.ts, packages/daemon/src/routes/bootstrap.ts, packages/daemon/src/routes/bundles.ts, packages/daemon/src/routes/up.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/daemon/src/routes/bootstrap-failure-response.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e0953e45917faac467b712ef2b9797bb5f060d95b17824cb4439f063f11f77b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060scope.type === \u0022mission\u0022 || scope.type === \u0022slice\u0022\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/health-passive-ceremony.ts, packages/daemon/src/domain/rig-mode/operating-posture.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/daemon/src/domain/health-passive-ceremony.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae15673205be8e4886f3b3bae25a0ba7d25ecff4f7c0b260106b6d6139dcc01"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060seatSkillsRoot \u0026\u0026 entry.category === \u0022plugin\u0022 \u0026\u0026 file.split(/[\\\\/]/)[0] === \u0022skills\u0022\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/adapters/claude-code-adapter.ts, packages/daemon/src/adapters/codex-runtime-adapter.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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b346ef2a8732be18c079adffa0d40ca2e04c581da0b49b4863b794cda4f268c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060seatSkillsRoot \u0026\u0026 entry.category === \u0022skill\u0022\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/adapters/claude-code-adapter.ts, packages/daemon/src/adapters/codex-runtime-adapter.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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b99d708401c618a0464667c0103887249179020a312f923802749fcc8186130"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060seatToken \u0026\u0026 !staged.includes(seatToken.step)\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/adapters/claude-code-adapter.ts, packages/daemon/src/adapters/claude-resume.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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"522def29cd6154ec5c774d78e97572b81d36429697d73c97acac44d29bc28a2c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060seatToken \u0026\u0026 staged.includes(seatToken.step)\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/adapters/claude-code-adapter.ts, packages/daemon/src/adapters/claude-resume.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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"34874935274e2c5d6fa758e753b2bcb235b81b5fb6fdd424a992fb8a9d99300e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060segment.length === 0 || segment === \u0022.\u0022 || segment === \u0022..\u0022\u0060 appears character-identically in 2 files \u2014 packages/cli/src/lib/work-install.ts, packages/daemon/src/routes/context-packs.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/lib/work-install.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31143aa89bacf425274312c5b3d0f3e58be352890f1abe7adec9afe2f9f0236"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060selectedHost !== \u0022local\u0022 \u0026\u0026 (resolution.kind === \u0022ambiguous\u0022 || (resolution.kind === \u0022resolved\u0022 \u0026\u0026 resolution.byName))\u0060 appears character-identically in 2 files \u2014 packages/cli/src/commands/add.ts, packages/cli/src/commands/edge.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/commands/add.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc6d45db344cd39defdde6d99a66186cd387ee8f036c7e5443e92828e6be1532"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060senderParts.length === 3 \u0026\u0026 senderParts[2]\u0060 appears character-identically in 2 files \u2014 packages/cli/src/commands/send.ts, packages/daemon/src/lib/pane-envelope.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/commands/send.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43d0779bc9e112ca14d7270983ce9f5c9c6ba9d54596ceeddd026a6655d5c19"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060slice.dependsOn !== undefined \u0026\u0026 !Array.isArray(slice.dependsOn)\u0060 appears character-identically in 2 files \u2014 packages/cli/src/lib/scope/scope-audit.ts, packages/daemon/src/domain/scope/scope-audit.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/lib/scope/scope-audit.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"e203e266fa7ddf0b3ab186ee3d679e12a0e3051a1d7ecacccec5a0519b402d79"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060snap.queueCoverage === \u0022partial\u0022 || snap.queueCoverage === \u0022unavailable\u0022\u0060 appears character-identically in 2 files \u2014 packages/tui/src/pulse/pulse-model.ts, packages/tui/src/render.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/tui/src/pulse/pulse-model.ts"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a36a9816d01d433917c17b2ee4f7fbaa75c5abc2fb233c4f0f5d80f29a9686"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060snapshot.nodeOrigin != null \u0026\u0026 snapshot.nodeLaunchPosture != null\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/node-inventory.ts, packages/daemon/src/domain/permission-policy/persisted-restore-posture.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/daemon/src/domain/node-inventory.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38f5072869c16fdc2070b7c0829792ba70797ae37cabcff22410b090205d294"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060snapshot.rigOrigin != null \u0026\u0026 snapshot.rigLaunchPosture != null\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/node-inventory.ts, packages/daemon/src/domain/permission-policy/persisted-restore-posture.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/daemon/src/domain/node-inventory.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"b31f746902cc4850271098fbf74b7f9da17705edce75f878e31bf22175006bf6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060source.state === \u0022done\u0022 || source.state === \u0022handed-off\u0022\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/mission-control/mission-control-write-contract.ts, packages/daemon/src/routes/queue.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/daemon/src/domain/mission-control/mission-control-write-contract.ts"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04b350800f18f1c5b716f6f33d85d18cb613634d56a9c6adb9137b7a89a0390"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060sourceAbs !== bundleRootResolved \u0026\u0026 !sourceAbs.startsWith(bundleRootResolved \u002B nodePath.sep)\u0060 appears character-identically in 5 files \u2014 packages/daemon/src/domain/bundle-agent-images-router.ts, packages/daemon/src/domain/bundle-context-packs-router.ts, packages/daemon/src/domain/bundle-plugins-router.ts, packages/daemon/src/domain/bundle-skills-router.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/daemon/src/domain/bundle-agent-images-router.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc16f87aadc51a9be850c74eaddf8380165b75a33e7db13070e3a8beae9f275"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060src[\u0022kind\u0022] !== \u0022local\u0022 || typeof src[\u0022path\u0022] !== \u0022string\u0022 || !src[\u0022path\u0022]\u0060 appears character-identically in 3 files \u2014 packages/daemon/src/domain/bundle-content-routing.ts, packages/daemon/src/domain/bundle-types.ts, packages/daemon/src/routes/bundles.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/daemon/src/domain/bundle-content-routing.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb384e03036e6982b6197d716d7ac319bd7405ced16dfd0fc4d334761956d04"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060stage === \u0022completed\u0022 || stage === \u0022rejected\u0022\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/outbox-handler.ts, packages/daemon/src/domain/runner-channel.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/daemon/src/domain/outbox-handler.ts"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f70190f58e4f5ea822e9cde7aee59678b0aeef4a46f77f6c1a81155857be9ac"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060staged.uid !== existing.uid || staged.gid !== existing.gid\u0060 appears character-identically in 2 files \u2014 packages/cli/src/atomic-text-write.ts, packages/daemon/src/domain/user-settings/settings-store.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/atomic-text-write.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"56936101f2e229c0b462255c44d81cd9ff5780e06e75e6b7f037fe4f8ba29ddc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060stat.isSymbolicLink() || !stat.isDirectory()\u0060 appears character-identically in 3 files \u2014 packages/cli/src/lib/context-install.ts, packages/daemon/src/domain/context-packs/context-pack-library-service.ts, packages/daemon/src/domain/context-packs/seat-recap-store.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/lib/context-install.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"729cdfafe2ce7bd67e18140fbb1d8da3558175cf5483b6838ecf8675c6a91404"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060status === \u0022down\u0022 || status === \u0022partial\u0022\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/rig-status-compose.ts, packages/ui/src/components/KernelStatusCard.tsx. 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/daemon/src/domain/rig-status-compose.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a555dd75f0d22072a49b0c6bb7c22aa53d85996d8421c2dbccf65aecfc8825"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060status.state !== \u0022running\u0022 || status.healthy === false\u0060 appears character-identically in 2 files \u2014 packages/cli/src/commands/whoami.ts, packages/cli/src/lib/bundle-source.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/commands/whoami.ts"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"d19fc90f8bf04b9cfa03d60010f9bc9824b13f1a006174beb20e562238214fb1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060status.state === \u0022running\u0022 \u0026\u0026 status.port !== undefined\u0060 appears character-identically in 2 files \u2014 packages/cli/src/commands/queue.ts, packages/cli/src/commands/send.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/commands/queue.ts"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"819ba09f306adddece59958fcc11cdf05c6aa27296f3ac11087a129856c0150e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060status.state === \u0022stopped\u0022 || status.state === \u0022stale\u0022\u0060 appears character-identically in 3 files \u2014 packages/cli/src/commands/queue.ts, packages/cli/src/commands/status.ts, packages/cli/src/daemon-reachability.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/commands/queue.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f8dbf89fa19d358813a2e66dd485d9a0758c3875d0074f801a49374d8f36a0b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060statusRequiresProof(status) || hasProofPacket\u0060 appears character-identically in 2 files \u2014 packages/cli/src/lib/scope/scope-audit.ts, packages/daemon/src/domain/scope/scope-audit.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/lib/scope/scope-audit.ts"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d08a2c29f799dfdfa0687a609052006a1dcf077c72da7c68bb3ec4114ab7711"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060targetAbs !== targetRootResolved \u0026\u0026 !targetAbs.startsWith(targetRootResolved \u002B nodePath.sep)\u0060 appears character-identically in 5 files \u2014 packages/daemon/src/domain/bundle-agent-images-router.ts, packages/daemon/src/domain/bundle-context-packs-router.ts, packages/daemon/src/domain/bundle-plugins-router.ts, packages/daemon/src/domain/bundle-skills-router.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/daemon/src/domain/bundle-agent-images-router.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a3a22e3acf6861dd92887b2ecfe74b115125c164599457038c285729433f78"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.fs.exists(dest) \u0026\u0026 hashContent(content) === hashContent(this.fs.readFile(dest))\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/adapters/claude-code-adapter.ts, packages/daemon/src/adapters/codex-runtime-adapter.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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dde341f8dfb8890fe7a97171a6cf807a23efa6666c2adabc9e450ea12ad6ccf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.fs.exists(destFile) \u0026\u0026 hashContent(content) === hashContent(this.fs.readFile(destFile))\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/adapters/claude-code-adapter.ts, packages/daemon/src/adapters/codex-runtime-adapter.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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9facaf3c8005560570b99be3bb9739eaffee621251cb1bad38bb2e02aa7da92"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.fs.exists(skillsDir) \u0026\u0026 this.fs.listFiles\u0060 appears character-identically in 3 files \u2014 packages/daemon/src/adapters/claude-code-adapter.ts, packages/daemon/src/adapters/codex-runtime-adapter.ts, packages/daemon/src/adapters/pi-runtime-adapter.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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdcb651462045ec942292e87b27dae5e196207960c2b1602c1f07b3b19a79a9a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.timer \u0026\u0026 typeof this.timer === \u0022object\u0022 \u0026\u0026 \u0022unref\u0022 in this.timer\u0060 appears character-identically in 4 files \u2014 packages/daemon/src/domain/context-monitor.ts, packages/daemon/src/domain/seat-activity-service.ts, packages/daemon/src/domain/seat-identity-reconciler.ts, packages/daemon/src/domain/seat-structural-activity-service.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/daemon/src/domain/context-monitor.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"25fc8c81f84006268419044fb4c4f714fadc576bd24373110adb6489cfb1840d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060trimmed.startsWith(\u0022[\u0022) \u0026\u0026 trimmed.endsWith(\u0022]\u0022)\u0060 appears character-identically in 3 files \u2014 packages/cli/src/client.ts, packages/daemon/src/adapters/daemon-url.ts, packages/daemon/src/domain/daemon-url.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/client.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de7ff1c01ac30ca45a1b828c4d001b9853a5120641c4fa3a4c7ce80cf403625"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ts.isStringLiteral(node) || ts.isNoSubstitutionTemplateLiteral(node)\u0060 appears character-identically in 2 files \u2014 packages/cli/src/release-surface/extract-surface.ts, scripts/check-first-run-references.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/release-surface/extract-surface.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b89116727c233a4e73e26b82737714296402003cb7da06a5daed4a0b15281be"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof coerced !== \u0022number\u0022 || !Number.isInteger(coerced)\u0060 appears character-identically in 2 files \u2014 packages/cli/src/config-store.ts, packages/daemon/src/domain/user-settings/settings-store.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/config-store.ts"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8440f21a0297983b02b83c83a0472d81a37bd4441074d12ff9941b5f4124055"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof coerced !== \u0022number\u0022 || !Number.isInteger(coerced) || coerced \u003C 1\u0060 appears character-identically in 2 files \u2014 packages/cli/src/config-store.ts, packages/daemon/src/domain/user-settings/settings-store.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/config-store.ts"},"region":{"startLine":1182}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cfd147dbae2e6ce0f261949f83391261583b2564762604b3f67fd347df11947"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof coerced !== \u0022number\u0022 || !Number.isInteger(coerced) || coerced \u003C 60\u0060 appears character-identically in 2 files \u2014 packages/cli/src/config-store.ts, packages/daemon/src/domain/user-settings/settings-store.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/config-store.ts"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a0aa3e54cd3600710ea08ad6ac3669d0ccbfd243524e6b177fd2dd15dad50a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof diagnostic.enforcement.effective === \u0022object\u0022 \u0026\u0026 diagnostic.enforcement.effective !== null\u0060 appears character-identically in 2 files \u2014 packages/cli/src/front-door.ts, packages/daemon/src/domain/permission-drift.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/front-door.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"e562d10c2c3dc6222160e4d08a263b0c1ed5a82e122a1ba6fefd4dc5f92154f2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof entry === \u0022string\u0022 \u0026\u0026 entry.trim().length \u003E 0\u0060 appears character-identically in 2 files \u2014 packages/cli/src/commands/up.ts, packages/daemon/src/domain/rig-repository.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/commands/up.ts"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5dbd829a62c911725bf9b465bb3cbb598d8ed2bfb65559caf1b08dbf25f3b69"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof env.CODEX_HOME === \u0022string\u0022 \u0026\u0026 env.CODEX_HOME.length \u003E 0\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/codex-auth.ts, packages/daemon/src/domain/provider/codex-auth-reader.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/daemon/src/domain/codex-auth.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"692172b5f9b9e5ce9e61c1e601015273c4e649f7d5df196602f0e4842ec2f3a2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof env.HOME === \u0022string\u0022 \u0026\u0026 env.HOME.length \u003E 0\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/codex-auth.ts, packages/daemon/src/domain/provider/codex-auth-reader.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/daemon/src/domain/codex-auth.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d31343540b8bcf9b937c232c03d0a585c9bf2d9d3c8298b1af5cac33f71b23f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof estimatedTokensRaw === \u0022number\u0022 \u0026\u0026 Number.isFinite(estimatedTokensRaw)\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/agent-images/manifest-parser.ts, packages/daemon/src/domain/context-packs/manifest-parser.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/daemon/src/domain/agent-images/manifest-parser.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"9393e377381a4ede8114bbe6d9d629bab09bf8da5b34d3c82a29caaaaf17c79e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof fm[f] !== \u0022string\u0022 || (fm[f] as string).trim().length === 0\u0060 appears character-identically in 2 files \u2014 packages/cli/src/lib/scope/scope-audit.ts, packages/daemon/src/domain/scope/scope-audit.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/lib/scope/scope-audit.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"688d4b975952a65ed17eb1fb343a10fe5077adf7cc6b209342f5ae8207a3f235"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof hostId !== \u0022string\u0022 || hostId.trim() === \u0022\u0022\u0060 appears character-identically in 3 files \u2014 packages/cli/src/host-registry.ts, packages/daemon/src/domain/hosts/hosts-registry-reader.ts, packages/daemon/src/domain/seat-identity-reconciler.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/host-registry.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58ee5e0b4c322efa215f4b4008af83580227e4942324d772ef042e86b8549a6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof id !== \u0022string\u0022 || id.trim() === \u0022\u0022\u0060 appears character-identically in 3 files \u2014 packages/cli/src/host-registry.ts, packages/daemon/src/domain/hosts/hosts-registry-reader.ts, packages/daemon/src/domain/project-lifecycle-compiler.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/host-registry.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"745334c3a0d6603b610d14037bc4ba92fcbffdf5858cc8b928e2ade4b2ddf309"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof injected === \u0022string\u0022 \u0026\u0026 injected.trim().length \u003E 0\u0060 appears character-identically in 3 files \u2014 packages/daemon/assets/plugins/openrig-core/hooks/scripts/compaction-restore-bridge.cjs, packages/daemon/assets/plugins/openrig-core/skills/claude-compaction-restore/scripts/restore-from-jsonl.mjs, packages/daemon/src/adapters/stub-runner.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/daemon/assets/plugins/openrig-core/hooks/scripts/compaction-restore-bridge.cjs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0733a8931b7c7abf9ddeaa7663c7e7389acb499026edff08b665e22fe0bfbc7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof input.readmeContent === \u0022string\u0022 \u0026\u0026 !frontmatterIntent \u0026\u0026 !hasH2(input.readmeContent, \u0022Intent\u0022)\u0060 appears character-identically in 2 files \u2014 packages/cli/src/lib/scope/scope-audit.ts, packages/daemon/src/domain/scope/scope-audit.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/lib/scope/scope-audit.ts"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad4c392426755a5a557a4072b87d29251a5afd9f4d8077e1ccb417301b51e2ad"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof name !== \u0022string\u0022 || name.length === 0\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/agent-images/manifest-parser.ts, packages/daemon/src/domain/context-packs/manifest-parser.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/daemon/src/domain/agent-images/manifest-parser.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"041f4b8772b9c92bbd57133a6baef6f6d8712c0624115b53742bd703db03fac9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof name !== \u0022string\u0022 || name.trim().length === 0\u0060 appears character-identically in 2 files \u2014 packages/cli/src/commands/plugin.ts, packages/daemon/src/routes/spec-library.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/commands/plugin.ts"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"b47ca1c8405334b4961745b1cde491957f05ad556baeebae7177017253914dff"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof parsed !== \u0022object\u0022 || parsed === null || Array.isArray(parsed)\u0060 appears character-identically in 5 files \u2014 packages/daemon/src/adapters/claude-code-adapter.ts, packages/daemon/src/adapters/pi-runner-protocol.ts, packages/daemon/src/adapters/stub-runner-protocol.ts, packages/daemon/src/domain/permission-drift.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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"60f9c767a5695468b28f92821c5b4cf654eaa306c86fa59ed68028642bf4970e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof parsed === \u0022object\u0022 \u0026\u0026 parsed !== null \u0026\u0026 !Array.isArray(parsed)\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/adapters/claude-code-adapter.ts, packages/daemon/src/adapters/codex-runtime-adapter.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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"1989e44a0933866c52211ddf456c8097a349c99cdc9b1e1af18b8892d1e39958"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof parsedFrontmatter.intent === \u0022string\u0022 \u0026\u0026 parsedFrontmatter.intent.trim().length \u003E 0\u0060 appears character-identically in 2 files \u2014 packages/cli/src/lib/scope/scope-audit.ts, packages/daemon/src/domain/scope/scope-audit.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/lib/scope/scope-audit.ts"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f72353223bf6b0ba6d7e494af188197e710496c6a77c7bc677e1f4e19157b9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof path !== \u0022string\u0022 || path.length === 0\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/agent-images/manifest-parser.ts, packages/daemon/src/domain/context-packs/manifest-parser.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/daemon/src/domain/agent-images/manifest-parser.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf48aa8d013be7683c0f9359f6876b756f6415ec9f38ef8c2cc618599bc54fc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof payload.qitemId === \u0022string\u0022 \u0026\u0026 payload.qitemId.length \u003E 0\u0060 appears character-identically in 2 files \u2014 packages/ui/src/components/feed/cards/storytelling-cards.tsx, packages/ui/src/lib/attention-feed.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/ui/src/components/feed/cards/storytelling-cards.tsx"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"49307e97df9551a71bc6dc39fead268cb8a627d66b5747ca2ce971b893b99e70"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof payload.qitem_id === \u0022string\u0022 \u0026\u0026 payload.qitem_id.length \u003E 0\u0060 appears character-identically in 2 files \u2014 packages/ui/src/components/feed/cards/storytelling-cards.tsx, packages/ui/src/lib/attention-feed.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/ui/src/components/feed/cards/storytelling-cards.tsx"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"d65a7cf2b1cde9f73ea980b413c589d4515348cdbcc708a85fd1eebda0edc376"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof providerId !== \u0022string\u0022 || !providers || typeof providers !== \u0022object\u0022 || !Object.hasOwn(providers, providerId)\u0060 appears character-identically in 2 files \u2014 packages/cli/src/provider-auth.ts, packages/daemon/src/domain/kernel-boot.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/provider-auth.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe774ebc050002223be4ad0dc8c075361a52212e8a406424eb8de670208ecb2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof raw === \u0022string\u0022 \u0026\u0026 parseDotId(raw) !== null\u0060 appears character-identically in 2 files \u2014 packages/cli/src/lib/scope/dot-id.ts, packages/daemon/src/domain/scope/dot-id.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/lib/scope/dot-id.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b35a398c074e038a19b000baf0ee79840a11d674d231edbf207742b859cfdb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof role !== \u0022string\u0022 || role.length === 0\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/agent-images/manifest-parser.ts, packages/daemon/src/domain/context-packs/manifest-parser.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/daemon/src/domain/agent-images/manifest-parser.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd60784ec55369afcbec1ad57e856d7cb2ffbb45913186152e0787042c899f65"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof target !== \u0022string\u0022 || target.trim() === \u0022\u0022\u0060 appears character-identically in 2 files \u2014 packages/cli/src/host-registry.ts, packages/daemon/src/domain/hosts/hosts-registry-reader.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/host-registry.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5037c5981d18ec30cbdcdadf892e7892c70bd94b8717f3c5fba0c08a4ef083"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof transport !== \u0022string\u0022 || !KNOWN_TRANSPORTS.has(transport)\u0060 appears character-identically in 2 files \u2014 packages/cli/src/host-registry.ts, packages/daemon/src/domain/hosts/hosts-registry-reader.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/host-registry.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"595c08eb05562516dfe0ebd644d7cd3089a6dd256b0b6bfea8cbc96a1d8e3013"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof url !== \u0022string\u0022 || url.trim() === \u0022\u0022\u0060 appears character-identically in 2 files \u2014 packages/cli/src/host-registry.ts, packages/daemon/src/domain/hosts/hosts-registry-reader.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/host-registry.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4180961bac750fa168f5512a004cddf9bf6c22205998a042841b3a7d656d6e3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof v === \u0022number\u0022 \u0026\u0026 Number.isFinite(v)\u0060 appears character-identically in 5 files \u2014 packages/daemon/src/domain/openrouter-charge.ts, packages/daemon/src/domain/pi-usage-entries-store.ts, packages/daemon/src/domain/pi-usage-facts.ts, packages/daemon/src/domain/provider/usage-across-hosts.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/daemon/src/domain/openrouter-charge.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"f092c272da4d03e53ab59d0813907260fe08ff23821bc5aa1b05a795b771deae"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof v === \u0022number\u0022 \u0026\u0026 Number.isFinite(v) \u0026\u0026 v \u003E= 0 \u0026\u0026 v \u003C= 1\u0060 appears character-identically in 2 files \u2014 packages/cli/src/commands/project-jev.ts, packages/cli/src/decisions/decisions.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/commands/project-jev.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"4943550b463e98721f5392f19fd174529ef1eb9fee2193c19e1b245e259ef0db"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof v === \u0022number\u0022 || typeof v === \u0022boolean\u0022\u0060 appears character-identically in 2 files \u2014 packages/ui/src/components/markdown/storytelling-primitives.ts, packages/ui/src/lib/format-event-payload.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/ui/src/components/markdown/storytelling-primitives.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e8a5b12b9e80592a0e19c713930bbe140694747799a8acf41a08956cbb9fe0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof v === \u0022object\u0022 \u0026\u0026 v !== null \u0026\u0026 !Array.isArray(v)\u0060 appears character-identically in 7 files \u2014 packages/cli/src/lib/bundle-configuration.ts, packages/cli/src/queue-receipt.ts, packages/daemon/src/domain/claude-activity-hooks.ts, packages/daemon/src/domain/gateway/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/lib/bundle-configuration.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb541e877b829d053c45d97d1f8043b2c908953c013e9cdf1df0ffe79e3d86c0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof v === \u0022string\u0022 \u0026\u0026 v.trim() !== \u0022\u0022\u0060 appears character-identically in 2 files \u2014 packages/cli/src/host-selection.ts, packages/daemon/src/domain/spec-live-conformance.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/host-selection.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"8477fc92611b7ca5846d316ca28a259e900a64b1446d6c13e202504cdc33e607"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof v === \u0022string\u0022 \u0026\u0026 v.trim().length \u003E 0\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/gateway/relay-outbound.ts, packages/ui/src/lib/format-event-payload.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/daemon/src/domain/gateway/relay-outbound.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"00528f0643b12fc21698fb2a918c02c00662cf37e71060f4ef069cacaa17f7f6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0022string\u0022 || !/^\\d{1,12}\\.\\d{1,6}$/.test(value)\u0060 appears character-identically in 2 files \u2014 packages/cli/src/commands/slack.ts, packages/daemon/src/domain/gateway/slack/state-store.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/commands/slack.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"d42f3fc40df52cec4d120da57d5aab941f9ecc1b99eedf1452795781f20eb570"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0022string\u0022 || !isSliceDotId(value)\u0060 appears character-identically in 2 files \u2014 packages/cli/src/lib/scope/scope-audit.ts, packages/daemon/src/domain/scope/scope-audit.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/lib/scope/scope-audit.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"a01615205b1e8e2aa21d6d5c8f9e3d8b4ff0ab3ed45073208eee7e4e50df9eac"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0022string\u0022 || !value || /^[\u002B-]/.test(value)\u0060 appears character-identically in 3 files \u2014 packages/cli/src/config-store.ts, packages/daemon/src/domain/user-settings/settings-store.ts, packages/tui/src/time.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/config-store.ts"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6cd8a6704f147de2bdda85074df62205a274818286a7335b028c0049e7e1f40"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0022string\u0022 || !value.trim()\u0060 appears character-identically in 5 files \u2014 packages/daemon/src/domain/current-work.ts, packages/daemon/src/domain/rig-mode/operating-posture.ts, packages/daemon/src/domain/rosters.ts, packages/daemon/src/domain/stream-classification-worker.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/daemon/src/domain/current-work.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a9825427872a45a0ef3a0022a8f9015040227509ad41f36c901d28e00a2dad"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0022string\u0022 || (value !== \u0022\u0022 \u0026\u0026 !/^[^@\\s]\u002B@[^@\\s]\u002B$/.test(value))\u0060 appears character-identically in 2 files \u2014 packages/cli/src/config-store.ts, packages/daemon/src/domain/user-settings/settings-store.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/config-store.ts"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"795f3059d89461d838622ca89803d986f8143cd254432ca169ce561e2a3a0e58"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0022string\u0022 || value === \u0022\u0022\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/claude-seat-token.ts, scripts/leak-guard-rules.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/daemon/src/domain/claude-seat-token.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a77aaf8c0bfd044e23e8e2b5d3731e89a4856a4caa7378d9cd3fb56fc8417b5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0022string\u0022 || value.length === 0\u0060 appears character-identically in 3 files \u2014 packages/daemon/src/domain/queue-transition-log.ts, packages/daemon/src/domain/workflow-spec-cache.ts, packages/ui/src/hooks/useActivityFeed.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/daemon/src/domain/queue-transition-log.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac73f748242864f3bd306c21d156e0c638f67817f93202c16af3e391ebe42f0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0022string\u0022 || value.trim() === \u0022\u0022\u0060 appears character-identically in 3 files \u2014 packages/daemon/src/domain/classification-attempts.ts, packages/daemon/src/domain/project-lifecycle-compiler.ts, packages/daemon/src/domain/rigspec-schema.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/daemon/src/domain/classification-attempts.ts"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b2c378ac15eba36f43003591fc055d6cc2e95738c38b5e594b9ff40282cdec"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0022string\u0022 || value.trim().length === 0\u0060 appears character-identically in 3 files \u2014 packages/cli/src/commands/proof.ts, packages/cli/src/lib/permission-policy/policy-ref.ts, packages/daemon/src/domain/permission-policy/policy-ref.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/commands/proof.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e17f8ae738b21d1da7a1535f6f482b3b4ff1a4426ed9f8a9661f6547940639f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0022object\u0022 \u0026\u0026 value !== null \u0026\u0026 !Array.isArray(value)\u0060 appears character-identically in 19 files \u2014 packages/cli/src/commands/plugin.ts, packages/cli/src/commands/watchdog.ts, packages/cli/src/queue-artifact.ts, packages/daemon/src/adapters/claude-code-adapter.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/commands/plugin.ts"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0bc828b346308b311762f20ae3284b08156faea55c2bc0ef1876b3604aebf6d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0022string\u0022 \u0026\u0026 value.length \u003E 0\u0060 appears character-identically in 11 files \u2014 packages/cli/src/commands/ask.ts, packages/daemon/src/domain/agent-images/evidence-guard.ts, packages/daemon/src/domain/node-launcher.ts, packages/daemon/src/domain/provider/claude-auth-status-reader.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/commands/ask.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d20463923f77afecc1145a0d452f647c5d1ad0278b4154b2494172c21e8a6b9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0022string\u0022 \u0026\u0026 value.trim()\u0060 appears character-identically in 7 files \u2014 docs/reference/runner-conformance/check-runner.mjs, packages/cli/src/lib/reconstruction-reader.ts, packages/daemon/src/domain/agent-manifest.ts, packages/daemon/src/domain/execution-view.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":"docs/reference/runner-conformance/check-runner.mjs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"7441aa37e0c1d1ec971a2d29c6e9b7ba7fb97551cb1095cefcbfed7bcfbe4a87"}},{"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/mcp-http.ts, packages/daemon/src/domain/provider/subscription-move-report.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/mcp-http.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"137daa368794f9aee7083a3cd99314ca12bc1f44075866d7d45275bdb866ae18"}},{"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/ui/src/components/SeatOverviewSecondary.tsx, packages/ui/src/components/SeatOverviewTable.tsx. 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/ui/src/components/SeatOverviewSecondary.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa90baff2cec9046593f7d4c54279c127655b9cfaf048ce0bdc5d462d50a241"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0022string\u0022 \u0026\u0026 value.trim().length \u003E 0\u0060 appears character-identically in 8 files \u2014 packages/cli/src/commands/startup-proof.ts, packages/daemon/assets/plugins/openrig-core/hooks/scripts/activity-relay.cjs, packages/daemon/assets/plugins/openrig-core/hooks/scripts/compaction-restore-bridge.cjs, packages/daemon/src/domain/gateway/participants.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/commands/startup-proof.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d9f4e228c732332bd71f2c9268bc49fc32fe1db9e35e84eeab9c233a85664d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof window === \u0022undefined\u0022 || typeof window.matchMedia !== \u0022function\u0022\u0060 appears character-identically in 3 files \u2014 packages/ui/src/components/ThemeProvider.tsx, packages/ui/src/hooks/usePrefersReducedMotion.ts, packages/ui/src/lib/theme.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/ui/src/components/ThemeProvider.tsx"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c70b0a46605295c3645e6392e9e3a34e268a019e9aa2ca4bf35dc9f1704213"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060url.protocol !== \u0022https:\u0022 \u0026\u0026 url.protocol !== \u0022http:\u0022\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/network/network-bindings.ts, packages/daemon/src/domain/network/network-installations.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/daemon/src/domain/network/network-bindings.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b08b07776642ab3ee8b93084a532f36640bf8a0a7cbccaa09ead39a8383cf0e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060usage?.availability === \u0022known\u0022 \u0026\u0026 typeof usage.usedPercentage === \u0022number\u0022\u0060 appears character-identically in 2 files \u2014 packages/ui/src/components/topology/TopologyTableView.tsx, packages/ui/src/components/topology/TopologyTerminalView.tsx. 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/ui/src/components/topology/TopologyTableView.tsx"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0edb08d089ef200c8f1b26fe345973a8e87b58cf38509cdb78ff477bb756ead"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060user !== undefined \u0026\u0026 (typeof user !== \u0022string\u0022 || user.trim() === \u0022\u0022)\u0060 appears character-identically in 2 files \u2014 packages/cli/src/host-registry.ts, packages/daemon/src/domain/hosts/hosts-registry-reader.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/host-registry.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"5366dcb00d97337cb6dcd60e5448858e5f56e027acce1a5649ec111b453724fa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060v !== null \u0026\u0026 typeof v === \u0022object\u0022 \u0026\u0026 !Array.isArray(v)\u0060 appears character-identically in 3 files \u2014 packages/daemon/src/domain/bundle-behaviour.ts, packages/daemon/src/domain/provider/claude-token-usage.ts, packages/tui/src/execution/workflow-model.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/daemon/src/domain/bundle-behaviour.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a0473cb2ede4d7a0414702ad9ebcf11c9b3bea2d955feabc58286d792a260b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060v === null || v === undefined || v === \u0022\u0022\u0060 appears character-identically in 2 files \u2014 packages/tui/src/cost/cost-model.ts, packages/tui/src/usage/usage-model.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/tui/src/cost/cost-model.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"987efa73a2b00c73db99674c1116e1ed85309f3e91bc7fcbb84462bbf3dd6b27"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060val !== \u0022off\u0022 \u0026\u0026 val !== \u0022queue.worker\u0022 \u0026\u0026 !/^[a-zA-Z0-9\\-_.]\u002B@[a-zA-Z0-9\\-_.]\u002B$/.test(val)\u0060 appears character-identically in 2 files \u2014 packages/cli/src/config-store.ts, packages/daemon/src/domain/user-settings/settings-store.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/config-store.ts"},"region":{"startLine":1235}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f5646710804ff1c78e237b6666222380eaca735c4d6911906c31f98d0a3aec1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value != null \u0026\u0026 typeof value === \u0022object\u0022 \u0026\u0026 !Array.isArray(value)\u0060 appears character-identically in 3 files \u2014 packages/daemon/src/domain/execution-view.ts, packages/daemon/src/domain/lifecycle-manifest.ts, packages/tui/src/execution/execution-model.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/daemon/src/domain/execution-view.ts"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b0aa5b37893a9d10ede5534b028daa56975f2fb8265613b41e6d0c117fe0b28"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value !== null \u0026\u0026 typeof value === \u0022object\u0022\u0060 appears character-identically in 3 files \u2014 packages/daemon/assets/plugins/openrig-core/hooks/scripts/codex-hook-trust.cjs, packages/daemon/src/adapters/pi-openrouter-charge.ts, packages/ui/twin/capture/payload-diff.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/daemon/assets/plugins/openrig-core/hooks/scripts/codex-hook-trust.cjs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b15f707c8dadad991a0c68cec3d7acb6b2af61d13dfe1ff97f9946fe6a4eb5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value !== null \u0026\u0026 typeof value === \u0022object\u0022 \u0026\u0026 !Array.isArray(value)\u0060 appears character-identically in 13 files \u2014 packages/cli/src/lib/reconstruction-reader.ts, packages/cli/src/lib/scope/scope-fs.ts, packages/cli/src/lib/work-install.ts, packages/daemon/scripts/gen-control-plane-json.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/lib/reconstruction-reader.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"740ad2d8736a1e0b091e105ddebaf94ab9b8110b158840661582c559ef05b996"}},{"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 3 files \u2014 packages/cli/src/lib/scope/capability-delta.ts, packages/daemon/src/domain/workflow-reconciliation.ts, packages/daemon/src/routes/seat.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/lib/scope/capability-delta.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"d634fd00326b25faff5e74a453e691675538d778c132a7ce0055d5ab5d5646d1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value \u0026\u0026 typeof value === \u0022object\u0022 \u0026\u0026 !Object.isFrozen(value)\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/capture-observer.ts, packages/daemon/src/domain/stream-classification-worker.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/daemon/src/domain/capture-observer.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c94cb165190bd3ff3a2ba373387fdb32d0fac9e4354ba3436f4dfdf97be165"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value === null || typeof value !== \u0022object\u0022\u0060 appears character-identically in 3 files \u2014 packages/cli/src/lib/reconstruction-reader.ts, packages/daemon/src/adapters/codex-runtime-adapter.ts, scripts/testbed-manifest.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/lib/reconstruction-reader.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d05cb1d69ce8f108c31f6ea97ea1926f14b4343f6634569d176e5edeffc58ed"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value === null || typeof value !== \u0022object\u0022 || Array.isArray(value)\u0060 appears character-identically in 6 files \u2014 packages/daemon/assets/plugins/openrig-core/hooks/scripts/permission-stop-descriptor.cjs, packages/daemon/src/adapters/codex-runtime-adapter.ts, packages/daemon/src/domain/claude-auto-mode.ts, packages/daemon/src/domain/claude-permission-rules.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/daemon/assets/plugins/openrig-core/hooks/scripts/permission-stop-descriptor.cjs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"86efa1bb37739e182bcdb84416cb7c43b6eb17ed202f4e17905ee0ae0c8fa696"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060verdict.state === \u0022healthy\u0022 || !verdict.evidence\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/workflow-boot-sweep.ts, packages/daemon/src/domain/workflow-exception.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/daemon/src/domain/workflow-boot-sweep.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"a656471c6f47dd2815dc7ddbc3bedad80663c3b734470f57a4dd53bb9c7e8f18"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060versionRaw === undefined || versionRaw === null\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/agent-images/manifest-parser.ts, packages/daemon/src/domain/context-packs/manifest-parser.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/daemon/src/domain/agent-images/manifest-parser.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57c0b3ff4bc7ef0bfdb94a8445f61bbd8fc21e39e215316445df234febcd477"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060visualBody !== null \u0026\u0026 !/\\bN\\/A\\b/i.test(visualBody)\u0060 appears character-identically in 2 files \u2014 packages/cli/src/lib/scope/scope-audit.ts, packages/daemon/src/domain/scope/scope-audit.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/lib/scope/scope-audit.ts"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"719bed45a71ab79096f299a2dc0594d178210e8b2971ff43b177172b0746800b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060x \u0026\u0026 typeof x === \u0022object\u0022 \u0026\u0026 !Array.isArray(x)\u0060 appears character-identically in 2 files \u2014 packages/daemon/src/domain/environment-artifacts.ts, packages/daemon/src/domain/environment-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/daemon/src/domain/environment-artifacts.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"694af8a78a2ced4ad7def39299ea00027f6190ecb09bed52985c7e42b3fd8528"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060canonicalJson\u0060 is exported, takes a document from its caller (line 24) and hands it to \u0060sortValue\u0060, which calls itself at line 9 (\u0060sortValue\u0060) with a piece of \u0060value\u0060 (and at line 13) \u2014 and nowhere in \u0060sortValue\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: \u0060JSON.parse\u0060 accepts any depth, so a 100,000-byte body \u2014 inside Express\u0027s default 100kb limit \u2014 parses to 50,000 levels, and a walk like this one throws \u0060RangeError: Maximum call stack size exceeded\u0060 long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any \u0060try\u0060 \u2014 an event handler, a timer, a promise nobody awaits \u2014 takes the Node process down with every other request in flight. Thread a depth argument through \u0060sortValue\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/twin/capture/payload-diff.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a72ebbae2e3b7bb29f5fab14fb6c1d6d644442e66cea03f8b9b0b5a5414cd3"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060diffPaths\u0060 is exported and takes \u0060before: unknown\u0060 from its caller, and it calls itself at line 42 (\u0060diffPaths\u0060) with a piece of \u0060before\u0060 \u2014 and nowhere in \u0060diffPaths\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: \u0060JSON.parse\u0060 accepts any depth, so a 100,000-byte body \u2014 inside Express\u0027s default 100kb limit \u2014 parses to 50,000 levels, and a walk like this one throws \u0060RangeError: Maximum call stack size exceeded\u0060 long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any \u0060try\u0060 \u2014 an event handler, a timer, a promise nobody awaits \u2014 takes the Node process down with every other request in flight. Thread a depth argument through \u0060diffPaths\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/twin/capture/payload-diff.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb945ef925f5e57a6d6f515a45da1d20becd71a70dc56bf3a23bac61fd5751e"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060healthHash\u0060 is exported, takes a document from its caller (line 27) and hands it to \u0060stable\u0060, which calls itself at line 28 (\u0060stable\u0060) with a piece of \u0060v\u0060 (and at line 29) \u2014 and nowhere in \u0060stable\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: \u0060JSON.parse\u0060 accepts any depth, so a 100,000-byte body \u2014 inside Express\u0027s default 100kb limit \u2014 parses to 50,000 levels, and a walk like this one throws \u0060RangeError: Maximum call stack size exceeded\u0060 long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any \u0060try\u0060 \u2014 an event handler, a timer, a promise nobody awaits \u2014 takes the Node process down with every other request in flight. Thread a depth argument through \u0060stable\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/health-policy.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a72c360b0f0ab7cd2cee98c6b4f39a4f8c6d8e1e6eb7d9fb4a62843f3322caf"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060settingsBrowser\u0060 is exported, takes a document from its caller (line 117) and hands it to \u0060policyLeaves\u0060, which calls itself at line 265 (\u0060policyLeaves\u0060) with a piece of \u0060value\u0060 \u2014 and nowhere in \u0060policyLeaves\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: \u0060JSON.parse\u0060 accepts any depth, so a 100,000-byte body \u2014 inside Express\u0027s default 100kb limit \u2014 parses to 50,000 levels, and a walk like this one throws \u0060RangeError: Maximum call stack size exceeded\u0060 long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any \u0060try\u0060 \u2014 an event handler, a timer, a promise nobody awaits \u2014 takes the Node process down with every other request in flight. Thread a depth argument through \u0060policyLeaves\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/user-settings/settings-browser.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d81f368159936306753b3d66c03b1f12863a5efe80327f48ebbd3ee9777e285"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060deriveRigLayout\u0060 is exported, takes a document from its caller (line 157) and hands it to \u0060findParent\u0060, which calls itself at line 72 (\u0060findParent\u0060) with a piece of \u0060node\u0060 \u2014 and nowhere in \u0060findParent\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: \u0060JSON.parse\u0060 accepts any depth, so a 100,000-byte body \u2014 inside Express\u0027s default 100kb limit \u2014 parses to 50,000 levels, and a walk like this one throws \u0060RangeError: Maximum call stack size exceeded\u0060 long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any \u0060try\u0060 \u2014 an event handler, a timer, a promise nobody awaits \u2014 takes the Node process down with every other request in flight. Thread a depth argument through \u0060findParent\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/terminal/herdr-app-layout.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5525ee017efcee7948ab1e306b13b3f2c003d9b20c667ae55ad3b6bcbd5bc4e"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060referencedTerminals\u0060 is exported, takes a document from its caller (line 81) and hands it to \u0060walk\u0060, which calls itself at line 87 (\u0060walk\u0060) with a piece of \u0060n\u0060 (and at line 89) \u2014 and nowhere in \u0060walk\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: \u0060JSON.parse\u0060 accepts any depth, so a 100,000-byte body \u2014 inside Express\u0027s default 100kb limit \u2014 parses to 50,000 levels, and a walk like this one throws \u0060RangeError: Maximum call stack size exceeded\u0060 long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any \u0060try\u0060 \u2014 an event handler, a timer, a promise nobody awaits \u2014 takes the Node process down with every other request in flight. Thread a depth argument through \u0060walk\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/terminal/herdr-app-layout.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced3eb4866b34816e5a82faabd7b5b34a6d851aaad385a3e3c30faffbeefee92"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060findNode\u0060 is exported and takes \u0060node: unknown\u0060 from its caller, and it calls itself at line 164 (\u0060findNode\u0060) with a piece of \u0060node\u0060 \u2014 and nowhere in \u0060findNode\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: \u0060JSON.parse\u0060 accepts any depth, so a 100,000-byte body \u2014 inside Express\u0027s default 100kb limit \u2014 parses to 50,000 levels, and a walk like this one throws \u0060RangeError: Maximum call stack size exceeded\u0060 long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any \u0060try\u0060 \u2014 an event handler, a timer, a promise nobody awaits \u2014 takes the Node process down with every other request in flight. Thread a depth argument through \u0060findNode\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/terminal/herdr-app-state.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c8ffde78344e4c6c3695e420c7fc937cab64dce680ec1e89f6df8d8624c3f1f"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060findCredential\u0060 is exported and takes \u0060value: unknown\u0060 from its caller, and it calls itself at line 78 (\u0060findCredential\u0060) with a piece of \u0060value\u0060 (and at line 87) \u2014 and nowhere in \u0060findCredential\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: \u0060JSON.parse\u0060 accepts any depth, so a 100,000-byte body \u2014 inside Express\u0027s default 100kb limit \u2014 parses to 50,000 levels, and a walk like this one throws \u0060RangeError: Maximum call stack size exceeded\u0060 long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any \u0060try\u0060 \u2014 an event handler, a timer, a promise nobody awaits \u2014 takes the Node process down with every other request in flight. Thread a depth argument through \u0060findCredential\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/provider/subscription-move-report.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3acd762ccb30ad9c5071ea7b427ca8a754653852fdad08da595b984104e1d29"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060canonicalV0\u0060 is exported and takes \u0060value: Json\u0060 from its caller, and it calls itself at line 121 (\u0060canonicalV0\u0060) with a piece of \u0060value\u0060 (and at line 122) \u2014 and nowhere in \u0060canonicalV0\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: \u0060JSON.parse\u0060 accepts any depth, so a 100,000-byte body \u2014 inside Express\u0027s default 100kb limit \u2014 parses to 50,000 levels, and a walk like this one throws \u0060RangeError: Maximum call stack size exceeded\u0060 long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any \u0060try\u0060 \u2014 an event handler, a timer, a promise nobody awaits \u2014 takes the Node process down with every other request in flight. Thread a depth argument through \u0060canonicalV0\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/cli/src/lib/reconstruction-reader.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e9d1aaed435a0d5b9e2cfe06e122c1a79870e4c567eaa0ab11620139eef3a74"}},{"ruleId":"X2","level":"note","message":{"text":"Not all async functions that make a request accept an AbortSignal: Only 24/97 async functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http) accept an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up \u2014 a page navigated away from, an unmounted component, a timed-out job. Take a \u0060signal\u0060 (or an options object that carries one) 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":"bd89d014f84408f7063269aa5892ba3df7c9af3e981ecfb0752c5731bc62d406"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchAgentImages: \u0060fetchAgentImages\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/ui/src/hooks/useAgentImageLibrary.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"476bd697f1318372bf21b1fb9a1098243062f5975fb9a6e4dc02f30ac1d6fcde"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchAgentImagePreview: \u0060fetchAgentImagePreview\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/ui/src/hooks/useAgentImageLibrary.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f436d0c067cbfcfd0ea96d6f0d856a6290b07282c52634cc153e78813c6e08"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchArchived: \u0060fetchArchived\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/ui/src/hooks/useArchivedRigs.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be78074ad8f9df63383d284685607fd0181cadd584d1975dafd2ce3cb84934e"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchAttentionItems: \u0060fetchAttentionItems\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/ui/src/hooks/useAttentionItems.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"8975f14f7c794c89925c3fdfbeedcb108fba708becc35555ad5686fed2afb481"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchAggregatedAttention: \u0060fetchAggregatedAttention\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/ui/src/hooks/useAttentionItems.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5bc7dc15c7ce68a62c0b3e6e9ffc16d2934d7ddd5c51b17eda7f0ef173515e"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchFleet: \u0060fetchFleet\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/ui/src/hooks/useContextFleet.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"213ef55a5cff57fae884284cdc98996d9946b56c688e64542783402bc90f614d"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchContextPacks: \u0060fetchContextPacks\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/ui/src/hooks/useContextPackLibrary.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c03d17be22cb986e4e9f9f0ceabff766a364f1705bd4bbbf7ce758ccdabd0f"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchContextPackPreview: \u0060fetchContextPackPreview\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/ui/src/hooks/useContextPackLibrary.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"91dcdaa9644ed713df85405fd69173d36a44c075f10715d91c950b68c23c4e7d"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchDaemonHealth: \u0060fetchDaemonHealth\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/ui/src/hooks/useDaemonHealth.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"acdfc847d29b65ea872caf8de761879abb3bc3fe245c0d3b6cf6b13335a3e175"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchDaemonVersion: \u0060fetchDaemonVersion\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/ui/src/hooks/useDaemonVersion.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf6a23433c10ab2e6be2cde878eca2b1f3710333c56c7265252eb3e50d45737"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: queryFn: \u0060queryFn\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/ui/src/hooks/useDiscovery.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7cfb3f6663d426836baca0b17bb6afddb7db486d63adfe201bab18d47d30a5e"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchRoots: \u0060fetchRoots\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/ui/src/hooks/useFiles.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"5226792c277a792d091199baed032e03200655de5a95302190fa9936c8770494"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchList: \u0060fetchList\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/ui/src/hooks/useFiles.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"4862ebd4e5893bf8409fea12615aabe5ddd427cb04991baf0e05e867f1ff37c8"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchRead: \u0060fetchRead\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/ui/src/hooks/useFiles.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"559a5491beb98c56acbfcece6f0cb205fadadb3cc37c891d2f2a3c7b226b9566"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchFleet: \u0060fetchFleet\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/ui/src/hooks/useFleet.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"5928e53b50a8a80c7d64236ead686be031c02146a9749033d37b4cf7095fb918"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchHosts: \u0060fetchHosts\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/ui/src/hooks/useHosts.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04685f5a31f27c0e857ed1f13cc9620e12414c0e500e8de9a166bc1f24a78bd"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: queryFn: \u0060queryFn\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/ui/src/hooks/useHosts.ts"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba342c88f11a95db52448e738dde5f108ffc1f92adff70a858d7737b6e310c9"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchKernelStatus: \u0060fetchKernelStatus\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/ui/src/hooks/useKernelStatus.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8447ec5deee0b2947c9b5dc4de286617528740960da0bca098f3bcea904f4e"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchLaunchPlan: \u0060fetchLaunchPlan\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/ui/src/hooks/useLaunchPlan.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"9286daeab92883d8737c42a397c774563383c8f5ab676a44ca15744c7f708c2f"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchLibrarySkills: \u0060fetchLibrarySkills\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/ui/src/hooks/useLibrarySkills.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"537ba69401fe8a78aa0b9bd1280ac19879396acca977694c56516033b269ce59"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: queryFn: \u0060queryFn\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/ui/src/hooks/useMissionStatuses.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd3dbb092db23956ab8125f1348fb4a1148480666b396f77415218cebd0186d"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: queryFn: \u0060queryFn\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/ui/src/hooks/useNeedsInputSeats.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb5590ce5948ab2250e4a41a783f9830c7301764264ac6097c152d0890f0008"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchNodeDetail: \u0060fetchNodeDetail\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/ui/src/hooks/useNodeDetail.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"6625f995d5dff6bbd4b91e11ada4060bf25dd4f00e970fb81cc3a2a6a3f70691"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchNodeInventory: \u0060fetchNodeInventory\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/ui/src/hooks/useNodeInventory.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"5068c6c794f1ed0e6722a10c41a6199cce200a668d3c142e69139acd0047f8dc"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchNodePreview: \u0060fetchNodePreview\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/ui/src/hooks/useNodePreview.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"6730458ec0e3b83de038c397db9adba7a9a76c460bebdb222634b09160ad3baf"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchSessionPreview: \u0060fetchSessionPreview\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/ui/src/hooks/useNodePreview.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ae67075db94303f889290ccf34259b1438996557dcc607dc1988af45c27f7f"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: queryFn: \u0060queryFn\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/ui/src/hooks/usePackageDetail.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ffb1536e9007e42bb82bdb720683cf01cdffeccd2a03ebdbcda7cbcfa2ad74c"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: queryFn: \u0060queryFn\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/ui/src/hooks/usePackageDetail.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb57e0f1723fd4e9bd49304f05930e71e6f7f1e6b02f21aee3c3434b4c7e877b"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: queryFn: \u0060queryFn\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/ui/src/hooks/usePackageDetail.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"382d595ebdf0957b49bc846d9bc02ee4f0ca19d04b30b4226343e30f1f0c77a3"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchPackageSummaries: \u0060fetchPackageSummaries\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/ui/src/hooks/usePackages.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda17d379780f9f2a9d3b21515a44413adc91e166fae95c6e7dddbeb39ffd86c"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchList: \u0060fetchList\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/ui/src/hooks/usePluginFiles.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f489ceb0de7c7ecd81eaeb2fb19933f8dbb2820f3a4159b6fb893647304e8a9"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchRead: \u0060fetchRead\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/ui/src/hooks/usePluginFiles.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c9d029e51929c4f6c9d7e9c6949a13a3cc9f6f05933023e9649b7ca30b912f"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchPlugins: \u0060fetchPlugins\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/ui/src/hooks/usePlugins.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7aac310aa1b5fc5215a2a6aa80b96ba312a738c9f8ec0486ed529863b2d5548"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchPlugin: \u0060fetchPlugin\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/ui/src/hooks/usePlugins.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d17b2c17e6f9c9dc3d3b26e0d96ab356ed1d0a05d8db6d1c2aee7a510dc03d"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchPluginUsedBy: \u0060fetchPluginUsedBy\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/ui/src/hooks/usePlugins.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba959bbac55a9503d55f69cbb3f4577b266a68b3cb6013f6fa256c79cb8dab79"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchProgressTree: \u0060fetchProgressTree\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/ui/src/hooks/useProgressTree.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbbd64848eca8ab03f11c06e6dd0c3d0247d281873a9db4afd2d08ee7ea3113e"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchReviewAgents: \u0060fetchReviewAgents\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/ui/src/hooks/useReviewAgents.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"e10de5115abe54176a9a388ab2eb60947fabd29023659b262159d966a93015bf"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchChatHistory: \u0060fetchChatHistory\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/ui/src/hooks/useRigChat.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbdd606812d87a9c317a8b26bd851903ee28c229de7a3ae874e8924fb33dc61d"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: sendChatMessage: \u0060sendChatMessage\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/ui/src/hooks/useRigChat.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"825d04c5aa54e87fe68a8dc6662d3bc616c0e6e5b764553de2c7a7c5b5f1beaf"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchRigEnv: \u0060fetchRigEnv\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/ui/src/hooks/useRigEnv.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2e3988bf7ce58c1b52b3ba89f8f40120b189bf7d068fb4ae943ca2f9e9aac5"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchGraph: \u0060fetchGraph\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/ui/src/hooks/useRigGraph.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"967bb5f3c99defb8612c2c82b0b4bc5f270a61d3dd717f44c56c513baddd0e8b"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchRigStatus: \u0060fetchRigStatus\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/ui/src/hooks/useRigStatus.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"440247afefd53b96a8573e1a55681b3a583f7439d280a849b139cd549d04a855"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: queryFn: \u0060queryFn\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/ui/src/hooks/useScopeAudit.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"172f57fe9b6c372b8fc68c280335a2b81061b9abcc9ee6c480532db61de80902"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchSettings: \u0060fetchSettings\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/ui/src/hooks/useSettings.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"68605185d8f499b106c615d881fc1585b3eb9fd893e653079602ca25f46d5cbd"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchList: \u0060fetchList\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/ui/src/hooks/useSkillFiles.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"737baba31eacaf0631d56327874a7cc851b0ced0faf944e41e6200ed0e1205ca"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchRead: \u0060fetchRead\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/ui/src/hooks/useSkillFiles.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d40b96fb13bd2a10b9a1fc6ebf9fda61a5019392bdf7ae76545c289f836f88"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchSliceDoc: \u0060fetchSliceDoc\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/ui/src/hooks/useSlices.ts"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ea9bbce336da59eed1a54782d5e9dffa8aab2a976df67e787aad925449283a"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchQueueItem: \u0060fetchQueueItem\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/ui/src/hooks/useSlices.ts"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d627d5b3f36fa638cff925d0fa9a7cc18423adf1896512e402d0fb9f0c5c50"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchSnapshots: \u0060fetchSnapshots\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/ui/src/hooks/useSnapshots.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e93378af8846fd56606c41edad750f63fb8725cbccd122102f07b1e43fe323c"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchSteering: \u0060fetchSteering\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/ui/src/hooks/useSteering.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e96a8242f43413d1b36206a668d3a5e8ac246855548fae9a1e2046b5551e91"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchNodeHealth: \u0060fetchNodeHealth\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/ui/src/hooks/useSteering.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bd74a95ce832e21a6995969da6d32add2c7e1e6eedc6be013ac55ef97cddf1e"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchContextHealth: \u0060fetchContextHealth\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/ui/src/hooks/useSteering.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e9e4c8a83e8642d7e9a3111f6ab76d1a302ef4b3c17b76fb23c16d2f999f09"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchSpecReview: \u0060fetchSpecReview\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/ui/src/hooks/useSteering.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3a0fc3a87c37f532b9112635624364d35ebad67a3f805b5cb11d5a1b4ef653"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchTerminalViews: \u0060fetchTerminalViews\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/ui/src/hooks/useTerminalViews.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d50b16a9d15d7aa7e6a22dc01dccd7442b37fad4a35ca4a47c93c8aa753e8a"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchJson: \u0060fetchJson\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/ui/src/hooks/useWorkflow.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdba74c6a3d494a812e2e318db29f6ffc2a9d92714cfe5323b495463dc8104dc"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchWorkspace: \u0060fetchWorkspace\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/ui/src/hooks/useWorkspace.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6263a641c7e2f4bcbeb278277e713bf9a185ca644944ede97b9983f4f5c4af5"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchCmux: \u0060fetchCmux\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/ui/src/components/SystemPanel.tsx"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"d07a1cb341748bdb24f80af53a7753fc6a04f965a28e3ac353ba7231aa044761"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: postResume: \u0060postResume\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/ui/src/components/workflow/WorkflowInstancePage.tsx"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f556d2d2075257310029d8c1be4c2c313efe10b49dee6f86c99cb3e02fb5b79"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchGraph: \u0060fetchGraph\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/ui/src/components/topology/HostMultiRigGraph.tsx"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b4f05dd3d016051ab7ae882b2368d0cba74a9d8581cff6776202d3dedb9d74"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: queryFn: \u0060queryFn\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/ui/src/components/topology/TerminalLauncher.tsx"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd8d638356b6693fac63a394d1ddf04438ee99e8f7e561e9c43fb3a66c28bb9"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchNodeInventory: \u0060fetchNodeInventory\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/ui/src/components/topology/TopologyTableView.tsx"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"0550c96e34df15f75cfd18b0fafdcfd268924bbe8e02e6792f8fc51f9b3e15fa"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchHealth: \u0060fetchHealth\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/ui/src/components/system/SettingsSystemStatusPanel.tsx"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"a198cab9272893be08c25be55d3e22e064af55159a530cf88fe3d840a76dc383"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchCmux: \u0060fetchCmux\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/ui/src/components/system/SettingsSystemStatusPanel.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbee11ce6580cf098b7b46073d2d4febc847403fef3abe9cd603dedade6d3187"}},{"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/ui/src/components/review/review-actions.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7456b14245fc6ca57c42a002dc0482fba87d3173b6eff00aa93b433a9f587d1"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchDrill: \u0060fetchDrill\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/ui/src/components/review/TranscriptDrillPanel.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"63db98388a5bf95dce222c6fa00859da10f3cf6b97225a27bb333b782ebd5be4"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: postAction: \u0060postAction\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/ui/src/components/mission-control/hooks/useMissionControlAction.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"96dab28e0011a97fb248609db1756b431eeb98969cff9e869dcdf80ee556f177"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchAudit: \u0060fetchAudit\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/ui/src/components/mission-control/hooks/useMissionControlAudit.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5792fbd14daff5679722408dee1a5a0a667ed70b11ec71aca23e5246f73a71f"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchCliCapabilities: \u0060fetchCliCapabilities\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/ui/src/components/mission-control/hooks/useMissionControlCliCapabilities.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b59f676f2a00b58ea4d9395ad4faf88d982c67a0d1e694a95bf39c5b02342f"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchDestinations: \u0060fetchDestinations\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/ui/src/components/mission-control/hooks/useMissionControlDestinations.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"03604b9c2cc93123ecf7a6f3c7a335501b9e53935a48441c5bda8489d960c715"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchView: \u0060fetchView\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/ui/src/components/mission-control/hooks/useMissionControlView.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b2242526a0f1ae88531e8ae7c7bcf0d78d67077369c1798381be83e2fb517e"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: queryFn: \u0060queryFn\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/ui/src/components/for-you/FeedCardQuestionAsk.tsx"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7cc05e418d43d12e41b1d0894f90a3e79c5a520cfe20c8b21af72d41a6d2189"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchTextOrThrow: \u0060fetchTextOrThrow\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/commands/context.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"c802d41d1939b3ac0741e970c47e96119bdbe0b5023e2ae6d0434ca2268a2c49"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: inspectListener: \u0060inspectListener\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/commands/destroy.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"336cf3b935454061419e3e039fd83c557ae4fa6b10fe10271bf2b24f1efda1a7"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060sessionName\u0060 is text this program did not author, and it is written into the text of an element through markup this function returns with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/routes/compaction.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"366730bfb326e6fed3087fee3950edc66d89b06a9093c2bec5421b40444dfb5e"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060code\u0060 is text this program did not author, and it is written into the text of an element through markup this function returns with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/routes/hosts.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c56027c712c2d96906d63f3a859b5f58e1730b8a19b5ff697a799d555348341"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060JSON.stringify(deps.terminalBearerToken)\u0060 is text this program did not author, and it is written into a script or style context through markup built here with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. A script or style context needs its own escaping (or a JSON serialiser that escapes \u0060\u003C\u0060); better, pass the value through a data attribute."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/server.ts"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"db2940f81e7dfc2dcaebaee6ae06fc730c0b4dda854c43b78f65e4d96f8980e3"}},{"ruleId":"X25","level":"warning","message":{"text":"Option is kept and never read: \u0060NodeLauncher\u0060 accepts \u0060deps.defaultSilenceWindowSeconds\u0060 from the caller and keeps it in \u0060this.defaultSilenceWindowSeconds\u0060 on line 154, where only it can read the value \u2014 but nothing ever reads \u0060this.defaultSilenceWindowSeconds\u0060. Setting \u0060deps.defaultSilenceWindowSeconds\u0060 therefore changes nothing: every caller gets the same behaviour whatever they pass, and nothing reports that the option was ignored. Read \u0060this.defaultSilenceWindowSeconds\u0060 where the behaviour it configures is decided \u2014 or, if the behaviour genuinely is fixed, remove \u0060deps.defaultSilenceWindowSeconds\u0060 from the accepted options so callers stop setting a knob that does nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/node-launcher.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac31e6ff85adf7d2e464004f4203f6c5ef4c6f8f1ebc1dbfc6c3016b3ad5f1e"}},{"ruleId":"X25","level":"warning","message":{"text":"Option is kept and never read: \u0060SuccessorSessionLauncher\u0060 accepts \u0060opts.newId\u0060 from the caller and keeps it in \u0060this.newId\u0060 on line 189, where only it can read the value \u2014 but nothing ever reads \u0060this.newId\u0060. Setting \u0060opts.newId\u0060 therefore changes nothing: every caller gets the same behaviour whatever they pass, and nothing reports that the option was ignored. Read \u0060this.newId\u0060 where the behaviour it configures is decided \u2014 or, if the behaviour genuinely is fixed, remove \u0060opts.newId\u0060 from the accepted options so callers stop setting a knob that does nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/successor-session-launcher.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1b5eaaf06fd2abdbf14c74ce624ae20d950e45d21a1b86c1e06a8a1c60bc82"}},{"ruleId":"X25","level":"warning","message":{"text":"Option is kept and never read: \u0060WhoamiService\u0060 accepts \u0060deps.sessionRegistry\u0060 from the caller and keeps it in \u0060this.sessionRegistry\u0060 on line 163, where only it can read the value \u2014 but nothing ever reads \u0060this.sessionRegistry\u0060. Setting \u0060deps.sessionRegistry\u0060 therefore changes nothing: every caller gets the same behaviour whatever they pass, and nothing reports that the option was ignored. Read \u0060this.sessionRegistry\u0060 where the behaviour it configures is decided \u2014 or, if the behaviour genuinely is fixed, remove \u0060deps.sessionRegistry\u0060 from the accepted options so callers stop setting a knob that does nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/whoami-service.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"a852d1eb5322dcdba6e545837f3dec93a9e1e6d8e40996c3641256b020d233a2"}},{"ruleId":"X29","level":"warning","message":{"text":"Per-element action decided by a fixed element: This loop runs once per element of \u0060ids\u0060, and the statement it guards acts on the element it is on \u2014 \u0060id\u0060. The test deciding whether that statement runs does not: \u0060result.ok\u0060 reads \u0060ids[0]\u0060, a subscript that does not move, so whatever it answers for that one element it answers for ALL of them. One \u0060if\u0060 names the same collection at two different subscripts \u2014 the fixed one at line 2890, which is the contradiction: either the test was meant to be per-element, in which case every element that differs from the fixed one is handled wrongly and all in the same direction, or it really is one answer for the whole collection, in which case it is being re-asked on every pass and belongs above the loop. The \u0060if\u0060 is in the wrong place under both readings. Give the test the loop variable, or hoist it out."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/session-transport.ts"},"region":{"startLine":2894}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2f32e5f9b1afdb2d667fdfe321cbb1e77d3c17d000fbea2accc20e0d8e4362"}},{"ruleId":"X29","level":"warning","message":{"text":"Per-element action decided by a fixed element: This loop runs once per element of \u0060ids\u0060, and the statement it guards acts on the element it is on \u2014 \u0060id\u0060. The test deciding whether that statement runs does not: \u0060result.outcome === \u0022rendered-unconfirmed\u0022 || (opts?.verify \u0026\u0026 result.verified...\u0060 reads \u0060ids[0]\u0060, a subscript that does not move, so whatever it answers for that one element it answers for ALL of them. One \u0060if\u0060 names the same collection at two different subscripts \u2014 the fixed one at line 2890, which is the contradiction: either the test was meant to be per-element, in which case every element that differs from the fixed one is handled wrongly and all in the same direction, or it really is one answer for the whole collection, in which case it is being re-asked on every pass and belongs above the loop. The \u0060if\u0060 is in the wrong place under both readings. Give the test the loop variable, or hoist it out."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/session-transport.ts"},"region":{"startLine":2895}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdfaef27c8e7bd5cb2ce4e1e4292d84f58930fbe57a6d3820f390abd3e7661fa"}},{"ruleId":"X29","level":"warning","message":{"text":"Per-element action decided by a fixed element: This loop runs once per element of \u0060ids\u0060, and the statement it guards acts on the element it is on \u2014 \u0060id\u0060. The test deciding whether that statement runs does not: \u0060result.inputPhase === \u0022attempted\u0022 || result.inputPhase === \u0022written\u0022\u0060 reads \u0060ids[0]\u0060, a subscript that does not move, so whatever it answers for that one element it answers for ALL of them. One \u0060if\u0060 names the same collection at two different subscripts \u2014 the fixed one at line 2890, which is the contradiction: either the test was meant to be per-element, in which case every element that differs from the fixed one is handled wrongly and all in the same direction, or it really is one answer for the whole collection, in which case it is being re-asked on every pass and belongs above the loop. The \u0060if\u0060 is in the wrong place under both readings. Give the test the loop variable, or hoist it out."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/session-transport.ts"},"region":{"startLine":2897}}}],"partialFingerprints":{"codehealthFindingId/v1":"13cf534aa49ae786d15d83e7440cbe22257e7311fe310e3c237984224a4e760a"}},{"ruleId":"X29","level":"warning","message":{"text":"Per-element action decided by a fixed element: This loop runs once per element of \u0060ids\u0060, and the statement it guards acts on the element it is on \u2014 \u0060id\u0060. The test deciding whether that statement runs does not: \u0060result.sent === false || result.inputPhase === \u0022not_reached\u0022\u0060 reads \u0060ids[0]\u0060, a subscript that does not move, so whatever it answers for that one element it answers for ALL of them. One \u0060if\u0060 names the same collection at two different subscripts \u2014 the fixed one at line 2890, which is the contradiction: either the test was meant to be per-element, in which case every element that differs from the fixed one is handled wrongly and all in the same direction, or it really is one answer for the whole collection, in which case it is being re-asked on every pass and belongs above the loop. The \u0060if\u0060 is in the wrong place under both readings. Give the test the loop variable, or hoist it out."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/domain/session-transport.ts"},"region":{"startLine":2898}}}],"partialFingerprints":{"codehealthFindingId/v1":"68168333c6dcaa52d3dd6541813095d0a4eb6b544d215629a2f444c4722fde11"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/_canonical/core/openrig-upgrade/scripts/inspect-upgrade.mjs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f240df1518cb413b0ff9cbfe1d1fc9ded8fd41077a0ba24296357841c4b407"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/ui/twin/fetch-stub.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6f76b72df7b8867419aabde161b30c2972a1218e0c770c68d05184bdf84f98"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/ui/twin/twin-main.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af96b71a250d0404757683416a5756c8909febfd60862480131b1448783c207"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/ui/src/lib/copy-text.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"64928747ff95f48e97edc350a1c8234d3a825163b7d7fe96107ff0e9de810e63"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/ui/src/lib/theme.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f69624ec6f7866e4d72d29d89b9807f7926766f143815f9a208d2e85c0dd53"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/ui/src/lib/theme.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"45caf6e31717f1476ccc661ab0c653ea8531148e0af1cf0b82fafdde441f627b"}},{"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/ui/src/lib/topology-events.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef0214b1eb124394a9c52e17bbe3a10046c13f95ccda6a484dbfa18c75dd4d8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/ui/src/hooks/launchRigCmux.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"630fc3dcdee4ef0aef233d4dded8b91abf2a0c11503229fb582bf20c8e007088"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/ui/src/hooks/useCompletedMissions.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0468bb0a4bad34343d9f0052b0320651e8bfdd2308d05fcbc621213114b34ef"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/ui/src/hooks/useDismissedCardIds.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff285657d69f1e2b89d87ddf82fafe9996a0397a8a6bcacc9c1bb52334cbee8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/ui/src/hooks/useDismissedSeqs.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ada7f0bc3af53f5aa4b109a0d6df8591a7fe5e7be9a2476d66c8bb4e626fa7c"}},{"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/ui/src/hooks/useNeedsInputSeats.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"a27a2faa1091b576a8195233564cffb320924e55b4f563b527d7337e7e95cc7c"}},{"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/ui/src/hooks/useWorkflowSse.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87ae44ca0b71cca6874c759ae04ecb5aec224737a98b54b9df732a5a300229d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/ui/src/components/LiveNodeDetails.tsx"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"387d7ecba4dbd9ed91704b5798710bf500fff112d69bcab2a87f5d609455a2d2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/ui/src/components/NodeDetailPlaceholder.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7a21a2c23e847f718dd181756a22cfcd5fee472ec320b7d688911d3fd26c95"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/ui/src/components/RigNode.tsx"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd5776ff96618ac7ade300e88638f6b9a22dbfae3b2c749f11aac4c24fa46bb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/ui/src/components/UiMaintenanceNotice.tsx"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a45b05f5681622a3e01f297ec89478721c7551a51bc360005fa2ee7b09575a3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/ui/src/components/terminal/FocusedTerminal.tsx"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ffeb3bce5711e78c12a872d46e2bf554c524f5c08d2cf845fa726229e26962"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/ui/src/components/review/review-actions.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e74f8ac9b0054da79f986ba2229bb99eb75560117627b8c7559c6e464cc2a99"}},{"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/ui/src/components/review/SliceReviewTab.tsx"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db24165bd4164924bf078c5bd1a970ddbfee0f02e25a290a4c808eb950a42a6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/ui/src/components/dashboard/HostConfigCard.tsx"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea5a5b003098628420de39440e2adbcd82c742cbcf92ce7fe3efaa9bc7d4fd2a"}},{"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/tui/src/daemon-client.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b73b8970026ecdac9531b464bd74b7fda3d208fe4e025f19ffb3fd131ef20d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/tui/src/hydrate.ts"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"6099635e9cdbdf5179230e68d2884fb48bee4c6b3d9dee0e706a8341362e9535"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/tui/src/live-events.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2964a3aad285b13ec20f02aa81df35ecd8375de4923040b9c54a355a0ee43c3"}},{"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/tui/src/live-events.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"deeaabd2951105f8e2011f4c6054044267b3ede9348fed4cb01a4517489e8235"}},{"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/tui/src/live-events.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"b569db5279071cf116fe2f56da1777bd3f0cf3a8e7251953ee9d6b75b2b977f9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/tui/src/main.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"944175caa5b15aaec569cbf9ce7846cd2d0b433312ec1a88c98bab55fc1478c1"}},{"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/tui/src/main.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ae52811cbf592888b0e28830eddf6d904a73a390885d01bf4801e78701ff1e"}},{"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/tui/src/page-read.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc8713609fedcf4c0c94a9924d75e507e961fb7695b478e058907d44ba05d99e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/tui/src/print-for-copy.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc11bb04c84414be2e65b546b85408fe5487125bd8cbe09df0bf042ab610ec2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/tui/src/print-for-copy.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa094feb84f145721d2e1207e4c3d00b4948f3a1746e9cd538253584237dfe99"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/tui/src/print-for-copy.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc71543b903a6ef454b38828c09c6f9c7a764d4fd4ba1b1fa10754b5d1f26f1"}},{"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/tui/src/startup.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c56125bd499149d31078868c24b9f9113a9e2d8935ab0f5c2f1ea43b7fc6dfe"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/tui/src/terminals/terminal-model.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"936b71a5205c4167ec12d9dbb838a7822da7ecdd68836e15b6e0e1424207b09a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/daemon-db-path.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3dfa73a107e4b0685268cb0538f92b9aaf11d547211a147dc287e121f118ae5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/daemon-shutdown.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"476eeee834a8582c43ab8d2d8d3883cdc54b412347b2d792693fcd6366d1b9b2"}},{"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/daemon/src/server.ts"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"daca622e88979c6fdb9548cf52b181dff78ae95a85ff49b228ecbad2f14baeb8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/startup.ts"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"081ad866e25a77f2ae8dc5fad236cd86e4c636d8280d0b595339b469f1dd9a0c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/startup.ts"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b65538bf5057121112e8519e66aca66f2ce1eea26d4541c69aaee5f8d0f5c3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/startup.ts"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef44637f0f60ad6d005d01ddfe088ad0896813c133eba3b5d924d50560116c4b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/startup.ts"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9a5ca6c0201b61b092d9661742c6b1237db10bafca0fa32f7e93aa15e567bc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/startup.ts"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b84d70dc345e41d32b9009be4b61713daa830ec8f401b43fb9e5824e183515d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/startup.ts"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1b7915d9b71547861b8f023a1571a9e800ac172ef190d1c4c4b26febfcda9d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/startup.ts"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ab5090c1df46911d125d7a3dfd59284fc90b932188ec52cd80068e3f0db987c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/startup.ts"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"245b391a81ffcb11ec0f9e9f4c0ddc1db40b9ecc224493105678ac9b1da82a4a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/startup.ts"},"region":{"startLine":1236}}}],"partialFingerprints":{"codehealthFindingId/v1":"32b84bd5d3ccb475e442992414dc46024551a857a14eff4a65c6d48ebb5268b6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/startup.ts"},"region":{"startLine":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd0b0aeb436c32ff1b04d90dd41bcc61fdd158fe2fa7f8c6679c9ae031a87fb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/startup.ts"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"dece97b53e3a1a6b27ea9e016a042d9bc5a3fa5ba353e4eb67e938487f736352"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/startup.ts"},"region":{"startLine":1412}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6099fc89085ce6fac8873bb9cfee1454a4a4c87aef709eadba3432d8573174c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/startup.ts"},"region":{"startLine":1417}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf038ac5d4fc1f044090e7e351aafbf7412a577134211f815264a46326faaf4"}},{"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/daemon/src/startup.ts"},"region":{"startLine":1745}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d017b7b92ef4f0bb02078f0bcc7713730c830df96fae4851686bce57790571"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/startup.ts"},"region":{"startLine":1832}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcddc640047360e48e7b15aa49932bee3bc7a76252e1144c87615acdb4893887"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/startup.ts"},"region":{"startLine":1892}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b71f268ed87de1986debb5bac5a6c44724f150057fe33bf43647459953caaf7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/startup.ts"},"region":{"startLine":1910}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac8ae24940883cb6c00674b335eff3230a522af179f0c63f463cf96a1ccfe958"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/startup.ts"},"region":{"startLine":1921}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f45c88a768c583737578ed55e92b367dd745d912a0d7db59c7e491e4e00415e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/startup.ts"},"region":{"startLine":2027}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e527fbe094968b2f94ab1099199cad7328d839cbd4c9b5951fe9762294e12a7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/startup.ts"},"region":{"startLine":2169}}}],"partialFingerprints":{"codehealthFindingId/v1":"d80c266f0bf275507057cb88bb6cc6de8f53ad84de8e4a3dffa370b3c10e371b"}},{"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/daemon/src/startup.ts"},"region":{"startLine":3035}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc790138457f17e3321a13acd163113b5ce922b2aa21a7c07d51f3c726d77352"}},{"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/daemon/src/startup.ts"},"region":{"startLine":3072}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e55a0322bed25f3448e5be74180f99ca6ea849d70b43055cc5410be6483634e"}},{"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/daemon/src/startup.ts"},"region":{"startLine":3081}}}],"partialFingerprints":{"codehealthFindingId/v1":"3099988dd0c2791b623e447a0624638cc259e3cf858b1e941f792b85d94d5e58"}},{"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/daemon/src/startup.ts"},"region":{"startLine":3083}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c26fdeaeffc6059882bb644efe25496ee1a9397f5e0998f27a008fe1e79221"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/startup.ts"},"region":{"startLine":3084}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e619b9e50864f137b461c7525b18925616b850eb2391da687f451e0f2b8973"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/terminal/TerminalSessionBroker.ts"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48a85ce8fec692862c448aad2a195ac2008eb934ce994d416a2a0bb53fc64c0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/terminal/TerminalSessionBroker.ts"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3781f1b54bfd04402a1c1295392319af63269d56754ccd1489cb82203f30a28"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/terminal/TerminalSessionBroker.ts"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"d129ff5d2b974c688b51b457ab4019258858be68ed17fe3d84f7e8cb5962176b"}},{"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/daemon/src/terminal/TerminalSessionBroker.ts"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba686a37d0cc76b8cd4a66a94452cfbb7346f16c0fe651c1db4af45b5e77e58"}},{"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/daemon/src/terminal/TerminalSessionBroker.ts"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aec6b74d312ecd656fb0fefb9c5d2ea7dacf1bf1d6632847ea197392fe0055e"}},{"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/daemon/src/terminal/TerminalSessionBroker.ts"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"377a89aeaa55b713ba25f32e895089f89be47fbc33629af2916ab969c48f7289"}},{"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/daemon/src/terminal/TerminalSessionBroker.ts"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d3aef5f9c1f0ea5e31526c7132e1124721290a6acf9b26e287e5e5b48257ff"}},{"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/daemon/src/terminal/TerminalSessionBroker.ts"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"80177ffc869a356977b5f0edbf8511cffd792f4d836bcabbbebebb337501cde0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/terminal/TerminalSessionBroker.ts"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f3ae98ee7bd76ea7618aa4713bdd2704c0da76de0c1ff3c5b9bed579adf58f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/terminal/TerminalSessionBroker.ts"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"213dfdac5b872aa5824de4eca68041c4ecd54e6aea71c41aa3a7de09759f6ad7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/terminal/TerminalSessionBroker.ts"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"297ce5f85b5d511055dce79b2ed6c0b8e231e8e26d0d58090dd3e295ca9c3cc5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/terminal/TerminalSessionBroker.ts"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d842fe81a81e0d974b40414305111539930edd09916b29bc5ddb542b2083cf"}},{"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/daemon/src/terminal/TerminalSessionBroker.ts"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d38c3e46b1eba17c1f7970ca99d4e3de4ba887d2c69c6268dd6407fa8991f5b"}},{"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/daemon/src/terminal/TerminalSessionBroker.ts"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f8500ceb2c12c9c18051d1e08644da2016fc2c344e0a8278e1d5ebdd895e99"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/terminal/TerminalSessionBroker.ts"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"835ff7115a0a31b28fb2feb8a7ebb09d7e9e35887d706c5d77f1e8e8fbbdc1d1"}},{"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/daemon/src/terminal/TerminalSessionBroker.ts"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad175dc4447c3f2ac3f2461b9f20b84b841b7e88193fee774933717fc678896"}},{"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/daemon/src/terminal/window-pin.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a1726487b8ae012721348fc591ba4615c1797f42195333edd421b5d606809e"}},{"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/daemon/src/terminal/window-pin.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"220ea0a76ce2960cdc13cee34b0ee27446f4facf2fd7f6c44f7d63e8fc14bb97"}},{"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/daemon/src/terminal/window-pin.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"b807925cc9227dc44cabab7fa57e539a41ca1e123689fbcb9ad546e5e112f57a"}},{"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/daemon/src/terminal/window-pin.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c0b0c1ea94524240e71c23cf68ded22a2c0a7f80227ea8e76b11626b5e878f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/routes/activity.ts"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"43960f88b8a364bba4de004d3d27d798aa257ccc6e72b0d91078ca3510125a06"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/routes/activity.ts"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"075cc71c2b6614342205399e9c900c46a6a0909eb5b85b7ac080270c0781d804"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/routes/activity.ts"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3187dc8db96e29e061d0112649d0976accbc82e434c2f8dcd203a3abd817e03"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/routes/activity.ts"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb20b550b248fc669fa6ced96eb0d6afca6ec5cb033b0ba43babca32327af48"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/routes/activity.ts"},"region":{"startLine":1240}}}],"partialFingerprints":{"codehealthFindingId/v1":"971b115ec6f07a939f97d841e3b1d26937c25a6e07f3590205223f9ec1307715"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/routes/attention.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"59dc468ac4493af17e0f24dab36c846fff7931fc458e9e4a0f092903ef73244b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/routes/attention.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f2cf8ae398817529e2da3204878bdc8e322efca62e852aefa6c75a3f381ce3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/routes/bundles.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c9bd3aebf2af80eed55a3bff543507179b5871a008669f4f4abac05041db9b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/routes/bundles.ts"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa27c38f903412ab18137a7f214403e346aa9428bd261b4686436884d4dd96f"}},{"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/daemon/src/routes/bundles.ts"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"fecb65359002b36433e901be64e1203b9ce6333ebfdfbfd0b0257de368ceb856"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/routes/bundles.ts"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c7a82d73e59cc2ce6d17db48ef5772c48728c317556d52c5912063886f8e2cf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/routes/bundles.ts"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"672d69c2f1a4031b0e9486216fb87f6bf357ed0e551abee0a69a7344ee686e06"}},{"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/daemon/src/routes/chat.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"35fff9617f5c2248b5544fb28aa005d257b55b3635ef2f6982679e6efda3d04c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/routes/config.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c6ae4f9af62ebc056221ec38d40b315774b5963b377c36a52414ab9fec05f5a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/routes/config.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"02bf0841110e80472091c8d146d9f1ea88f3aa1fb1d5eaca0ea85d1ca8ba3737"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/routes/crash-cart.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"52cc5c0c0dd88fbbc7519daa99e5696f0d9db40141211774f0a6978e9b9a25c8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/routes/env.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d8fb50310c02fde2c9cc56f5ba05591ff83fd32377dfcaac756c593ce84ca2f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/routes/env.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24cac1373d4411d2090fff1e0c8a481fbfd7e2ba1201809bc0c1beeb99f88df"}},{"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/daemon/src/routes/events.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"783b347aa3e84cda24e2a43a223ebb3def96c2c0591db88c916e6f04ca088568"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/routes/files.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa1be18266485e8822582c79bac0c201edc2b664a3526f518eb8c60372f3bc3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/routes/gateway.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"840a1c99f075a7d033e0bbe3af1115bf2fb923d3ece2790d6a4df7820acedcfc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/routes/hosts.ts"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c6bb0e1cdd2b864cbd1a5fc5adf0a23dc810748ec93730e1a93591a9df37a6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/routes/hosts.ts"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdd35e48ac1f83a4620871c6c3bf10386a56de5e7bf69312d130f8c9a40999c2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/routes/hosts.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"e364be236254e51ffdb9a9d1380f1ac8c433f263331282006fcf3dcd85350883"}},{"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/daemon/src/routes/hosts.ts"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2f104f051b2c2860a907ad501453f123bf6f327513ec7fcf151516427f6724"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/routes/hosts.ts"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"a01f03c520d86445300d97ddf4b0c43f13459faa894b3466d7da49badd8557c6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/routes/hosts.ts"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"c929d410d7d3b0b5fa1b6cb9f0b68ae382453069536fbe0cbf566818fe35564b"}},{"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/daemon/src/routes/hosts.ts"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c3e3197e4af98a5fc84f30a130435215336c73d530a3902754e47868cae7fc"}},{"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/daemon/src/routes/mission-control.ts"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab65cb7b5981790097b9b8a9e4dd1e22ab2a4abfe911734a49bf8e5d81e94c97"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/routes/plugins.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"80391b437941cad505e5cf6fe3353cbb587f2f5fac6962db0c2db51b651a2a0f"}},{"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/daemon/src/routes/projects.ts"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"be12ccc6f20ccf6bc9743bb3d3e5b5480f290716cadabae0a2b9f28a23e42c65"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/routes/proof.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"521706990d203800a8f0ea32bfef812117ac6e790b985f5da57b1180233fac11"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/routes/queue.ts"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a87f23f80c0f631d5c06f47fb3331997b4782f7325c3ea02e8d8e207172683d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/routes/queue.ts"},"region":{"startLine":1431}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d56c2ed5eea5ac62aa5fad9e01110ff89fb43b2f5bc4864a534b2ce79d783e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/routes/queue.ts"},"region":{"startLine":1473}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0349023f6264fcb9a867b2f2db43f1ea11da62b163c36b64a2b86bf6315e879"}},{"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/daemon/src/routes/queue.ts"},"region":{"startLine":1751}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf830e758aee6470f104295fe627622780842cad189555230f99ec14f41c6246"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/routes/rig-cmux.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"743e17e4106569bfa7a3511cd6121bcf1647b9157a49ba82642de9e6d9f93684"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/routes/sessions.ts"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5aeec715f99bfeceaa1bf54eddd348b3071faedc0e6fd330cf5771e2f5b7f52"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/routes/skills.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f7bb81e5e5051a8bb71bdef954e0138b05eed9c74f18cc1bd9a48147ea452d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/routes/snapshots.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d6b4aeafb5178f7c1986b832b96594281b1d4ae3d47fcb5dde651b913fa246"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/routes/stream.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75f0e76fd19085b7e63ba8bbecfb8d59eed639716f3df4c50c74f326c1de6d8"}},{"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/daemon/src/routes/stream.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"4368e51a7a15053f9ab9d9caf13f805f7ae42ef7b252c5d60937ac589d62ddb2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/routes/terminal-ws.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"307517768ff02478165030f4676bae15cade2495ddb0de38021b5811128643d1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/routes/terminal-ws.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1bec092e58a08e507ad49dfe2c36c58a43cf2c2636dc2f4662df577bb045c5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/routes/terminal-ws.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ccf637db360b6808c11b46ee5625db3f4322a0127f1bd09f714a2602c67881c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/routes/terminal-ws.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b0e0028810f483ebffde575693df07101d040527145db4d873debc2354ead4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/routes/terminal.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbfbef1144e96d58cf575ec2922cbe81c33dfc7a48e21371571e58d8c9aeb315"}},{"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/daemon/src/routes/views.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"42fd99a74fcfcde00e970faac48ac5e09413742daa7bb03fff4ba81d5ef7d737"}},{"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/daemon/src/routes/views.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"383a63661af6d148438ae8b110689f8109a2fa12dbae38e63fb2bcc336577d5d"}},{"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/daemon/src/routes/watchdog.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e8730850e7d86f0d9ef0629818ac67700d7f7cce2732c526b242bf6cb42525"}},{"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/daemon/src/routes/workflow.ts"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4be5978a5c04069f06548aae16cc9d9ee069db3e12012157431012394f888c6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/middleware/browser-boundary.ts"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe8f9bb730ad2fbc2f8f58bfca6c85fbafd1c3de902d756f3139c43b1cea3c8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/active-lens-store.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"c83007bd1483356af78e24cb079cfee91e65dd11c7ce0e77a6a32c1fa3448e99"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/active-lens-store.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"0988032eaac4ebab4bd51a4062e10ac181d0c91e7e0e6bb29d6c04fd17574397"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/activity-endpoint.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a81eccfce1242ffcb87e5371ce3cd7dddc492d0b4fc7a328d29ae5c489ea69"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/activity-endpoint.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb90f7d6cadb2c1e1a746361a58dceb99a7b6e18d228b99acf291bb5ea6352b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/activity-endpoint.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"3448fcc7950e0628d94583014c2f9148b8da77ebf068b55fb52055254aeb4768"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/activity-endpoint.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"766f493ca0775114a5383069ca4483dc4740d7c82cf47839aecd1d06f7fddd3f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/activity-grants.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d0ecce1445ac5b3de7aed9eda8bfc292ab85a868103a5efa00167f79a1375e8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/activity-grants.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"2efe0500e7fd53d9c433d1542e4be6959fcd0ecdc9d17cc12575573c9662b80b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/agent-activity-store.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"86489aa8693fba9b916f4f6be22f0a59f7708653543597688e8c4d5f31517147"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/agent-activity-store.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f4ca01e4ca7fc2786f2dd5e13d9cc43f3aa93f41d9ca35eba97cefdce9aba1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/bootstrap-orchestrator.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"96a7157c65add046cd559a89512196fc6c3ebf4863fd3d1bdcab741c714c36fd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/bootstrap-orchestrator.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"75fcb644f92be7765cef284122ad957d471e68516cd1db6d1f0fbd1ffebf0f2c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/bootstrap-orchestrator.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ebe097662ca61e0851023d0054b449c7519163ba7a383886194a8764e5d03b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/bootstrap-orchestrator.ts"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ca300797d5859fa064e54b8d25fad34b538a28574e0cd4a974f94b6d519b8f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/bundle-audit.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a4b35af6cf0046d94f7a6a6a355349c121b57ba48feada440005df75f560d82"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/bundle-behaviour.ts"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"85be014c878846b358d40af40c5ceccdf94648ea5730fc99b163b2209d46f80b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/bundle-content-routing.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d072cde470cd82454fbb28be1bc2240d5623e50a060f77cbc4ff23383b0ea1b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/bundle-source-resolver.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"064d5cc07c99e8fce07071d7869b852318860c5a8ce54388ac86013f6fca1768"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/bundle-source-resolver.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"b601a9ffd5d0defdc60863fedcf610ab62d5e6dd1eac23a81ee9712f0aa94444"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/claim-service.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82122f2d549dc6ad3e9a05374ea2f9f36e8f18dafbabb23a31443d18d2039a1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/claim-service.ts"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ccfd573e04259387ac6c3109f9677e1d301830d5235d93b5e4d63ec04837433"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/claim-service.ts"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9819f279f4cccc8e2e5b51c80705bbb7130d9d947e5f86c73f1d8064a81eaa"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/claim-service.ts"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62851e72f6a829a93216e1841a696f9c5b5e2e70657cdbc4920ccc6fca1d111"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/claim-service.ts"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed2153a1ed4d4631ab106208c2ccb5cf006b8a444b77c7227c02bd834739dc4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/claim-service.ts"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d187c51a8015f8e9b7d023a413a380bb82dd9d15c16d9f0381a1f05f63649e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/claim-service.ts"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"e35a38f09fc9d52d73fad3c57f1794a306b4f461aa73fa2b191aa46648c6a946"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/claim-service.ts"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c7a900b8a092ae392329bc840f0dd6d302bdbba35bdee337c4c2991b6520f34"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/claim-service.ts"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f2fb1ed4f52b702af315933e996eac63184382c7429dcca00a6c56a77e4c29"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/claim-service.ts"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"95de63d40266df4f01b2aa138bc1b206032d2bb9cc86ae2918128a4dd5af029d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/claim-service.ts"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c973a4f64ef88022a8cbc95a6079e3c88a360b87b9529becc4265befb3b610a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/claim-service.ts"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08b0324a4990cf3fd735575dd2ef4c2c7f440d0daecac39106e6c4cc19f31bb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/claim-service.ts"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db4c966de16638e2ced68c487a405d6610b40979488ebe8f1525cdd202aa6fc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"03cb9b457bf912cca55a4f59a48285fa6d790d2e6e3c26ed25d4ce854e53bcf9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":1671}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5ab86dd291cc27324f66acd33bf8d08ce2f9f42be7ff9a98f08993bda813bf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":1956}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ca2ed61714db2f14734f501832de0b7bae3e03bc5d43d565b9ee01798abb5f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":2086}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b7b099d4841a7c43c111b341ac10e3b96572dade486ed617d44da3fc32924c"}},{"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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":2128}}}],"partialFingerprints":{"codehealthFindingId/v1":"967bb5426aacbc6a1af02c3d00224ae0a17c284154f8b86e499be1a5d23620e4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":2269}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f7ea9a325b5b972d268c6e0fceaa3c20679c3b4c13b6f607f17e614a80b915"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/claude-continuation-launch.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e013ff657499bdfebf4eb605aceb29b6ad18f3b1a32a1aa0a0242a3c1b23e3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/claude-continuation-launch.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"433544b42759e510378e1eeecf346c054fabe2375d4b4c207b5184e9da90b050"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/claude-credential-precedence.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4072db4b2a20634d3f49b20ce430c74b5b55855d291894fdb63fbb4af3f805"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/claude-managed-launch.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"6442333c940b73622581ee0240c711095a4eb4167d0de30127372a5166be621c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/claude-managed-launch.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"700cce51df63370658d3f193651cecdf1886533d311effe60e18e574d9679076"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/claude-managed-launch.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6549da422fb89a7547bdae3e33e9f09d43462d4091e63cf78750ab78ad176b7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/claude-managed-launch.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"525e4978bb759254076afe5efcd33b0710fae16a12ef88ac5fd4cbdaaa3ea025"}},{"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/daemon/src/domain/claude-managed-launch.ts"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6966ad25f349fc63ae183910f7cf949d182ec29501a50b503c10246e130989b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/claude-owned-settings.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"097bf8705c47a6f6249f06786dc56ce3d84e461f59e52e59f60337c0e375a008"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/codex-auth.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6bf264f25f0a77194d784257e9c17c6fdf2b6d629e03949ddd9d5779702d2c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/codex-auth.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf85ff7b70f30d308fef363e3d44c45fc114b553cd40174e40d53333b32401dc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/codex-auth.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e13682c81b70ddbfa323370fdcc985cefe58dec51238c5d5ff2045f8c6fbdd1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/codex-auth.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"eade718ef2c1b8ab1091490188bc30be00ce37251b27fa2b75b595dca1abf42e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/codex-auth.ts"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"664831edf6a05d226bcb358fb638f9f721bf910e4746fe3f48565338818ed0ab"}},{"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/daemon/src/domain/codex-member-permissions.ts"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"d99d8e0f664881c17921468569d91e0311b6d5dfe9272811164d4b0ef1845986"}},{"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/daemon/src/domain/codex-network-default.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39ca0a94859354c8bce86074d0044c0302920cdbb2b5087c1df7e71f75d68e2"}},{"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/daemon/src/domain/codex-network-default.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f5e06d8d1be91cdaadd527275917edc652beeebb05007ada51f559c5cc984c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/context-monitor.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2721f92471e9e3415a871feb2e3f8c6bd697d9030a5e2c2b53cfff6d4cf9f9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/context-monitor.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"245fc5a3451a8a279b3261a51a2a9027c091927651f1b80816179bb0147f2bd0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/context-monitor.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e25578d3ccc3bba75210ef74f9c5ea7df963009461e817746e23b5bc90af4f9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/context-monitor.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"3438ac1918062885a47f026ab9f5a1f46e6a7ae5512a1ceba40bf16b689c306f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/context-monitor.ts"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fbdfffd1cdd2cad57e834f72f812baa57e440b4f7fde5e6e15a15c33bf03a6f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/context-usage-store.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a7fc06eaa05fdde897d441c06c9baf9b73c3f3eadeff4bbf77f482c3cb5e850"}},{"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/daemon/src/domain/context-usage-store.ts"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"7284d900d44d746c92da6f212c22504c67e7b084da287c3e94dc2322f3f73547"}},{"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/daemon/src/domain/context-usage-store.ts"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7818500f405b1d426f21a345f13987f68f791c1ec13abe0402ce745afbe2334"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/current-work.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e2bd5fb6c53110d5a0f4b9b3f3c22d314e8e7b3dc95a4ecb7f9706a06100af"}},{"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/daemon/src/domain/current-work.ts"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7bb68568c4353b945dd01e168fffb54da42a00fcaf07995292e58f35336933"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/current-work.ts"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"516dfa26f269ea88088de7a057d2ea03d0544693c21f2a3f00860ebedac7fd39"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/current-work.ts"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"1758325ca3423766183ebb21ae12d345b5ab3c67b4920a1aafe35edb43cd3858"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/desired-claude-activity-hooks.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"32cac59b18320b357bc4839f164145429e9bdb94ae9e58f28bc2e7f3f9a3bb3e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/desired-claude-activity-hooks.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b1044c9291a19a47ee5194f53c922fbddcb0563f29bf9e02e7858f203eec3a7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/event-loop-monitor.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"15992bdbce7939d7280a651388b79f815c16b7441644deb0a8b38673f21d61ed"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/execution-view.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"560aa24291e0370032ef18689888c7671ebd9a7efa6a8256c5db78c88d7bb2cd"}},{"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/daemon/src/domain/execution-view.ts"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f6ba70394776a7ec349f8cc865e4389f7fcc7003315437b921cb075619cf20"}},{"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/daemon/src/domain/execution-view.ts"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d40dc35a411d2036cff818e3655f7cc02fa246a604a0e9dc7d70a8b0ed4a0e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/execution-view.ts"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd655ef175eb0418e5c28cdb9b144b66a5329c5b5ff4174ba9250f83056a024"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/execution-view.ts"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"146bcb556dc5a140d898b529a5f7273bd24dbb43b5e9fec98e27e3b51157730b"}},{"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/daemon/src/domain/fresh-occupant-relation.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4375244c30736104024a136309b55b740596d5c94681d7d2d81f335d283a1e5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/health-passive-ceremony.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5c7b856849449b32fd385399eb7dd5a20cc287dfe81b7e354b2fef5be5ecb0"}},{"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/daemon/src/domain/health-passive-ceremony.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a785fd2be1a0f02fff986e649d8c69bff1c1db28384255069ebd2c23795e397"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/health-passive-ceremony.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"bccafbaff2371553eaaf6a4b52b8605ca669321dff58d99a554eb5cb298b3296"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/hook-bridge.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"791b5cb4494829a993ac6bb25a59322d33d05b8a60f17cefa63afb40f445745e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/hook-bridge.ts"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"214d03bd91d44a3c2b1714f66c161737e3b25c25163a4edc24f6192cc71cce81"}},{"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/daemon/src/domain/hosted-wake.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6cf60ffaf56013945536106acc04c1108cbfc4bb8496490cd6526599fd95687"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/install-engine.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e4ff0299811e3533e993d783b83ad694415e530a46d1b5ea920adad250d2d8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/install-engine.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"bafcc2c87a39f30e2af305d1b5da8d4f7faf8fa15e880ff86e3be8d55172697b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/kernel-boot-tracker.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"9adfdd48ff4c29f417847f00d984798c41496a23a667e5da91f5b26b79a8fb36"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/kernel-boot.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"de13fd30e6b82355fee6605b9dfa4b56218b5b1ef294d10b96987746fcd63ce4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/kernel-boot.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"e047302921cd853fd281973b56201aabfc9b338c30ddbbba6c167620f7f40278"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/kernel-hook-review.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb2799d77cf59e3ece0524dda46010c7892d0530057580da762980c04a51d8f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/lifecycle-obligations.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50b36fea5e2730af82c4d6006f6d9f365eab528d44f2e9d6dda524414fca89b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/managed-block-records.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e872f66450f877e83f1f9d91290d554c340a146a9d1e0789997fac3710ada46"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/managed-block-records.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f99a8c09a3ef7a0f59746e0ed4b8118db15cf6fc761912ce6902065365c0d3b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/native-permission-store.ts"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"2332c50db929e1bf8cd1bc6ca8ee12f80ed90e971b7ac64199882fa1ce8cac03"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/native-process-arguments.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b4f20c9a3e775fa16a752ffd0971a9480d6619875bdf984fbc80ffaaf54850c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/native-process-arguments.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"3692191cdc444f619cb3b97aee877ae0cd6324108ee8d749c732a999e01b6177"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/native-process-executable.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"439eafc71d6e4666ba5475bb852857681ccef5a0e5b63197b8c233b1268c12b3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/native-resume-probe-evidence.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"459d4f455b9ad3f6e9363494c34e6d888d43d1db2a51da6161f773a1ea1606dd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/node-inventory.ts"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0a27f568af8ecb3eaf5b4b3b4808fe2db15e29a5a88183c7dfc7e8b2c87244"}},{"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/daemon/src/domain/node-inventory.ts"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44135bb8692316f151f751d011356707ffe64483b0b340e7e11c254bb589a00"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/node-inventory.ts"},"region":{"startLine":1181}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe0e415ffd1498c762da1b690b62fb39d3093cbe702decd3bd37bd8f29d677d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/node-inventory.ts"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb8aa1c97c035fffc8c002c4e6f30f005046066ac2127b4b33fa9ee9d4f53b3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/node-inventory.ts"},"region":{"startLine":1367}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa0586cab2a1fd2e790d7b9fb11bfd4e1cdb3438a8f25305ddc70b3e464caee"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/node-launcher.ts"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"be5a793e7643d54f1ba920f821e11a1aeca52b8c62619c2241feccaf454ef030"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/outbox-handler.ts"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f1c74ed19c2807c11f520f99d64a653419a5d0a1c66a86c23cba1d9d2117bca"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/periodic-snapshot-scheduler.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7be8c3912fc0b7fe24af09023d673784cfc815eda5f3434c19d847efaec1dcc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/periodic-snapshot-scheduler.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"20daa1624199ea9607a506622e242a9c708a4d85e45428c51035946ea099d784"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/periodic-snapshot-scheduler.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96339ff4c3eb105ae9eaad5432f6448b709e0d354de066b457f0b96e46eed65"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/permission-account.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f746c86b94bfd415e507ce250546b85015e093fe2099951b27b89c75437755"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/permission-account.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"555e75cfdef4f0ef0e0bf1db5cc3abb820007e725b908471e2a64579a0b23d50"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/permission-account.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"601cb0ccfb061bfb53d96d1ccd0931fc0bb13560b61742e9b03a3dfd57dfc915"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/permission-account.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba1b929804eb9e2b11b62a743a92c31a0ccc988d0420a25c3a02e2924ee57c4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/permission-drift-observer.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d636bcbac420b8d554bb01031f36701dfaa157fb0a542b5d15e46ecba0b7d8"}},{"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/daemon/src/domain/pi-compaction-service.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"25690c6ae59c608bd8d0716aa898d91346009331937b3ed445380e5360bae2de"}},{"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/daemon/src/domain/pi-compaction-service.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"2470f9047771c4dcf3e9fdc041e72d12d0f613d1640550f3d5cbbcd252c7ebe9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/plugin-discovery-service.ts"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c5c96a46225976bb3835790bc995a80e62a8201d01b24cf320eb3fbc0f9970"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/plugin-discovery-service.ts"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4ef1b2b5964bf6cd1e50f7fb1e04fd0622f8207bf24629b0aaacdc2d96349a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/queue-erasure.ts"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"46bcd26f4fae52c5f08fa414aa2512454188cf10bf59380b1997b014e7e086d0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/queue-stuck-sweep.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"29db9927e6d67716acb6dbfe9f46163f34e4b632f29bd6cb6b9c7ca8ec02929f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/queue-stuck-sweep.ts"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c8c6cc12ae24bbddf85172589a7bd76203c2c0c1a29cb666839e753186d235"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/queue-stuck-sweep.ts"},"region":{"startLine":1320}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec342dec0de4464851f6963fd55aad1c33d198069a0594c0d1b0261f5cf38d0f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/queue-stuck-sweep.ts"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d6585838dec04fa4a49114c679de5b8722542bdc6a1c3091437f795e5f37cb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/queue-stuck-sweep.ts"},"region":{"startLine":1651}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c67818daaef32c34fab73b8a6a6383bcce258a5abd3666771dcd0535a4a5da"}},{"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/daemon/src/domain/queue-stuck-sweep.ts"},"region":{"startLine":1974}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce1b0b2b6fc1e9aa56143a18fb11530c7a65f5a83600c16984f8ef3461afc17"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/queue-transition-log.ts"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cdbb078798b0c2279ae46741c35cbddc35ee7807d2b0168b1ec25a25e45347d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/queue-waiting.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97b7c7f28f8b80107349504aa7bfb3d62f832db6f5f99af3e0cdaaedee57952"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/queue-waiting.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd10eccad995b2eed697177634072532dfb31e77578f05743efecaad6d57e5d6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/queue-waiting.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed561f5f1699cfd533bd73850d5f2fcc5bb2d8d008b62fe67a99358601c30ff0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/queue-wake-ladder.ts"},"region":{"startLine":1393}}}],"partialFingerprints":{"codehealthFindingId/v1":"987c38ab89426d6e1057528b28efe3f8b78e8e5feebb837cc2333533ffc72a6f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/queue-wake-ladder.ts"},"region":{"startLine":1415}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ef8b4c78634a7009273a6d7f0449e82906788de4ce146504f31270aa1e9751"}},{"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/daemon/src/domain/queue-wake-ladder.ts"},"region":{"startLine":1964}}}],"partialFingerprints":{"codehealthFindingId/v1":"47177a78809b3b1158e2a82a0034026c338afd1f1fcdf4e42743d1dbb9c21028"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/refocus-record.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"238aecc9d1779a51c19fe44099eeadd88f5297224b1bb49c14a80a52f6c38070"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/restore-guidance.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"5340d9ed61eae6f2e3fbadbe19a086278431f07c7249fa6e47e93010fcfb96ff"}},{"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/daemon/src/domain/restore-guidance.ts"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"349e5808cd854f474fa2d37b1cd800b5d61490635dd0826bb1b2fd25b32f1c97"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e3314b673103d9db6163d22d3388100188bae2d2911ef375cba141933c1c6bc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":1184}}}],"partialFingerprints":{"codehealthFindingId/v1":"d82484505e89ed08392372a0b5299ff411e8844212cd1875d6531ac95a0e7871"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":1769}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbbab7c763c39dcef235ebaae11c3cbd5d930be0627c1937a4a927a4581c6bae"}},{"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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":1840}}}],"partialFingerprints":{"codehealthFindingId/v1":"97aa28c2e518747b796bd4e2d47195c2ab5f56fe7ca74f5cf53e361a1addbbc3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":1868}}}],"partialFingerprints":{"codehealthFindingId/v1":"690e4cf263d0ebf18824e9166b90934e15a61af7292222acb6fa3ca65beafc6a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":1873}}}],"partialFingerprints":{"codehealthFindingId/v1":"3abbfbea75d486871cd2cf75737d3b0a69579cdec48e46897703af75c2c86052"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":1922}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c73207a964263140eeae23d8668114b5b03ba0f4b6ce1f9483c939f201d9392"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":2167}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c4626026d0668d3e0a6ee24d527e3e6483db8ace03a808989e0efba8d4e58aa"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":2210}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b4b0acfd25682a15da3054953e41a718e8081168644f1cc04e9a6f8a44ce6b5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":2224}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a712de6aa2e15186022b48150eae57f1b3535e789bed259ae7c74dc351b5cc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":3008}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed03d2b848e02a8b71062f00c6ad4e1f7dff6d7d03082c8808a7b592aee7484"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/resume-metadata-refresher.ts"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd3321a36b23b4b947bf3cd8d35dfec1df8970869742aed73743ce2c8b65c711"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/rig-lifecycle-service.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a26ba87a07d0f05e289ad29d5161d6ba950bd0d6dd14ff7e5deeac38093cec"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/rig-repository.ts"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc62198874ccec998e996fa1bcc5c2519a2f9039747fd5bab48f201520a4133f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/rig-repository.ts"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f09a6f43a70b8c8067786025d591c74322e0ded09e2681a3860c7d3dc0800de"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/rig-repository.ts"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"070bd67ee002dee4af471530b16a6559784a896260ef710989aee16698b814f6"}},{"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/daemon/src/domain/rig-teardown.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5971a0d26d9dc2532ab6c0f794e00640d6b1cfc23ebd9b8bab6fff1434abbc"}},{"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/daemon/src/domain/rig-teardown.ts"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac72be1209d66f895b9405baba7df690bf6dbc8fbc9e9c34b46023bb72316d1a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/rig-teardown.ts"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a69270a98cdf4e7958eb2f13d39b5783146d8470488bcc08ded161ee7964b69"}},{"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/daemon/src/domain/rig-teardown.ts"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"254b630fa84c0e615b65c11bbe09bfd30e472a04de8088b417915373f78df1eb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/rig-teardown.ts"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"1747e1428b131b5a54f86177f8e289f72dd8012b816da6bbecb888defd23eff9"}},{"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/daemon/src/domain/rig-teardown.ts"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"aec68764c76f8da325c5cd01b3bad8d7b65667613ab6873eedae507f363ee081"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/rig-teardown.ts"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7b0377e3e2ce3ae472798ad32d039edbf7a3342fd6c319a05e17d230d91727"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/rigspec-exporter.ts"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"45403709298cfdbd8bec769b5ea7ac4d7b0e2acfa868bbe46040d4d2f2973742"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"18bbccc5d34daac2ef891b2f57e6238abb50140aa75e8bca62e9ad91e85b724d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"07c17e753614a8d5e95f89916817335ae88158fcb6eae395a5e25c8da974eac1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":1447}}}],"partialFingerprints":{"codehealthFindingId/v1":"f960ee44d01a411e8e470c862b6b03f7163d0088c8a196ceb3d0968e54f909d5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":1824}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbff2866a0e586d748e8ad0a3a9c4040394e8d1fd3713855067e0ee0331d1cde"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":1836}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b3f17c32be8ce2dfd65d97942fd9b72d578926df9879429a6515369eb73e1f"}},{"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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":1866}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca2d2dfd52f920d96bf705b056a486257f4400f450624f81e5224e80513a47b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":1918}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f09157ccb481b6372582db2208006387b1f1379108fcf6b3ac5e449fb0614a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":1940}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ccd2e1ec768de3d0e77b7584a65b759f2b6847847dcac87930aa3fcb2155443"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":2474}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e49ef557b941dfa5a42b9d9d34a053644edef6dc260714c635cfe19f12ed315"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":2668}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf19abecfaf49339e914c708504d15f684904c1146f43b4b3ce3f19762534a0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":3023}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee2ee2616040f96c57e5fd34940a793ce37dd36b7bfb8b01f0f70292ab820b15"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":3028}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9841daf6d2134da5797a367089e16f0294d09f7aae31f6011964bae686d9d0b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/rigspec-instantiator.ts"},"region":{"startLine":3140}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc1fabe40ac8d972144a138316187581428765963628d0d722bef05f1b428993"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/runner-grant-launch.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9220768f26529a4c373792dc93d31bd6c09da87622360436097b8f999fe68fd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/runner-grant-launch.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"adaa6f10ae230bcfa21c8b625dd608d3a5353849f820b23d1f787d50d7e5c798"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-activity-service.ts"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"1744aa32a1f51b9bb1ef5250374e37bce54933494f216eb7ff14e1b4162c6a17"}},{"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/daemon/src/domain/seat-activity-service.ts"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"f569b735f0515cba44f29c63caa6fdb138f06725837827265ec3ebed393e4acb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-attention-reconciler.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a6e77816433da3727fb856f20e6ba838727005fac1ee6ab1b8cd3dea2c14c9b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-attention-reconciler.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e6799c63c4de8bd30d3019e74fbc6ca8518b953e73afea6394fe98bbe8ea7e4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-attention-reconciler.ts"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab56362d7ab2b1584a1d66a892d12292cf95f9767a0d94bccb06a3d9a4e740d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-attention-reconciler.ts"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"099d640e608fea91495b0cad7cb74b8d7c06c8abe6bdc326655f4615dd8f87e4"}},{"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/daemon/src/domain/seat-attention-reconciler.ts"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cfe5e767663537a714be79fec1a7864cff82013edaaca27f036175f4686baa7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-delivery-guard.ts"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41f63e5c8fc3f1b6694d1f92c0ca0b75f872e635a7a1a56645ae585c1db6954"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-delivery-guard.ts"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf138d7e1c557c06ff4440d9e7d1e0cbdc92d5af5d183c3375ddc8e387f02ce"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee1d1765076b8ac49359f25867c927788d9d3ba3765dbe4cdf311d73339d2ba0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"865110655093fddf84a96918c070f4e99b4f68d96a8ff959b6f8df53edb1f2e7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":1528}}}],"partialFingerprints":{"codehealthFindingId/v1":"736ab13618bd30ea18591cba16758944933986342245c442d4e6448727dd201b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":1571}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd338b497388d219f40ecdeddc991eded84eb80cdab9d110cd87e854e20bbcf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":1572}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1de8b32ed582509d1e423bae3932c3f4ecf4fd7b6face18d2636fbc03d21ebf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":1588}}}],"partialFingerprints":{"codehealthFindingId/v1":"080b18d6b859ac0eaa5ebc1e7d951c05e4a5102437756251a8b6b8fd13b8c439"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-identity-reconciler.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"78506de597665a684133196cc05657bd0c055b2ae58cbd77f8a1ba657c083af0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-identity-reconciler.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"26cf922c25ad19c2855f26746951440a99e00d7c909bbfee0a3f84972754ca12"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-identity-reconciler.ts"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"25212d53b572bbe940208cab261f7215f82f2abdba26f549a77a6f9af0c3b5f5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-identity-store.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e97378d53476759f1ca8ed83546db80e14cbe3e1432b77dc0d4bd85e5c158a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-identity-store.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f8abf12006857a5164576c4bc9b2fee29511fef3725b0cd11f7efdfeb6a30f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-identity-store.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"37da7ad16f87897f82a775b974606db2554793c0983f39f67da17459a429b0be"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-launch-additions.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0100aa8f4d7ca4931f3a875e332d64350effc47066cbf4d2919d22f1372b30"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-launch-additions.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e19a3cb9194fc522e7ead7e9ca64eefeaf0de54d17ba30e0d73f1eb245bcb6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-launch-additions.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a93c13b6a745458ee7d72b0a492d4aadf5172cb837a22bb06a8bdec4618b23"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-launch-additions.ts"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3fd8944b27eeac8488362ee4ce61a9ff140555a374d3de43e7bb97785012bfe"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-launch-additions.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c5ace77b5ad8bcdc2239d7d8ac759e799c1fb4dd20af4710f2b1803d2237db1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-launch-additions.ts"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f4c38fdacc3ca58175dd958135d162e32229fbf2d63f0eaeb90a418f6e7192"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-launch-environment.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"f24a348634148f575a42759b0a9541579eebee62fa089b3149cc9d559e6d0582"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-launch-environment.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1aa5eb02074e5cef2a71333db8c904d644ff9a00772d1f3a8c726a35bc85e29"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":1186}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58c673debc2e372ea77d6407e8ea60774308819d01f145facce702527310135"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-lifecycle-service.ts"},"region":{"startLine":1730}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e1aa012eabb70ec06f64a45a7245b8972840944893b659d0d25aea49d84756"}},{"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/daemon/src/domain/seat-restart-in-place.ts"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"733e18e1ae43b21ea7a09866ab26500316de59c68ade30ad6b70b3a40afbf9ba"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-restart-in-place.ts"},"region":{"startLine":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"343fe2f1c0fb933180f5a5e33ed1cb0a3af49abe0d28daad5e3920cafa3341d3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-restart-in-place.ts"},"region":{"startLine":1272}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef6b19bce158849db7a0918fe7635e39e69bdf1bbe3cfdf606a10977046b2d9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-runtime-home.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"3454c8e009c25583d45566e20d49f41ac445515d9d2c0907eb2b904abb790f04"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-runtime-home.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ea8785c82d71425435997d495cb5260608e5172554964a58cfcff4b0d2c7e8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-runtime-switch-service.ts"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0e49d4cfc2e6ea49aaeb43f2ed9aff7776ff35160a39309128ee67e767cf2a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-runtime-switch-service.ts"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"864a0f94439e339cbdfcac28ae965844da17921633a7c3717e8004b8a5714e2e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-runtime-switch-service.ts"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d30a14028a5004c6133cfdce129b289379fc071f2f0acca42fdd1f8442fea7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-runtime-switch-service.ts"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"3602057e3cdc6bc5f9740f574d6b54d2c31128393a08b2ce04fe2ea45ec949c2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-runtime-switch-service.ts"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5007f048c4b7deec3c9c4b99eb2157210718eb36c39c954fcb991d0b14d0105"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-skill-apply.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05985967cf7006baecf140e5a92bf8b0e25c2ee48ce06fb739ccc185c27f60e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-skill-apply.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"15864b3c35b7cd01f7ccab8f598fc765e3286f0ae4011a037b26650dd1e994ed"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-skill-apply.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6f1472089eb0ae92403e62fd0f72494a343b4ff44e7967cf8cef35b55c7a98"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-skill-apply.ts"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"11204d6dcd1467cf17ab734974df41340ee8660a7eb207e5e3c3916615eb7ec7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"4865b19123518f4ab2e713c4e2e504395cf2615d1018911da11bf3bcef6d693e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"a29e35f9848293433805b99df27b603805e301f45dd4564ecf8e52f22906e4df"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f94eef906cfa7ab27833c4c80d4c290b49d3de2cd165b1beeb708c87729f2c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f5bbf3242fba4d03a07d43a96b16ed327d35db73a6f583da17284bd285f574"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9121f20ba1042b5d1ac3589303311683fcb7d9326021e4500b84ef84104782c"}},{"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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb01cfa15f608228101cdb51a2dfe3b22fa69fd7392154943b9b5f185a5c5b6e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ddd0692ef3dcbcfa4d2ecd4efabf1674dc208e170dc7e772f375ddd100a103"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a045b5b968c8a8ab2d4ed4f9961bd9c74cd56c6b6c92c48b5a84dfb44c1c30b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f8cb307df86014d283bf89e9fbfce3d60761e320b2322679af0f897915a1fb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"6efdc07d367af409f61d06afd118a2bc4565648d0a7b0f4117b32f989fff7b37"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c2d778f58957e5760404855f1aa1cd6b0054022069edce2c31f84765eac9bb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"409e7a8fca18a3129d5d9ef4c333063742f96277e92623967fa659453d048a83"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"76aac4cb0c24a880de961231ece9005c9078ceafbc02ff1f5ed79ced735c5435"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b71cdc185f78760aba4603a9c0abc10f0af81e89486469ce9cbc1cb4a0c536"}},{"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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"5198ddfbb5900c8bcbe62228b285d00f7d68c233c0fd03e7bb2296b7ff865a7e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d67844c209a5776ccbdb05e505ba53b0c1eac75d81b6f425ad6239eac2b51bb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":1213}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd71f8dec8c2655de80d4ccbc42fd68e6192d0e6fcec63603309f370c7cfaf68"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4bdee9409057d0856ad306a32ce4146169aaca4890b5d00aade2d16b3f579c"}},{"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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":1236}}}],"partialFingerprints":{"codehealthFindingId/v1":"7151f6563cd81bd3416cbb0b7daa2fc582cfcc2b8233c1cd34d4eba69ce5ed23"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"c493f2bb2ce1b34d2d271e539a99dc7ddb855d61f4f5005a60fbe7bc01f70105"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-status-service.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"543e4ea8afde908fafb98ae0206e25a8bcfa84736127abd401f1fb90c65f5750"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-status-service.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef022174c29dba23b94b74a17d019e895e57d2c4a536eb3aa86fe73a7f98107"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/seat-structural-activity-service.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"48bbd158bb3dc01c13987fb967e10644b2491a3609691ca3c08adc8b8a6a51a8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/self-attach-service.ts"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"e39426d1a482d102f5b6e5fe4560ab5269f609022e35e31e2280a743a2dc40f4"}},{"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/daemon/src/domain/session-jsonl.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"1394dff7672a0a7a73d13b6931d06b955f6b171ec4f17a62a8feacb8d0cdffb6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/session-registry.ts"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"0037b76dc438b37681581024b31cf6be271f85f55251dd51b9ff71bc554024c4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/session-registry.ts"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41ccf4612eceeeba9534cb808d4012bf56fd543a8ae36cd9db4349bab06d9bb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"b63615e6688de75424874ba29086a4099bbdecc086d0868fe2d8002601ac26a3"}},{"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/daemon/src/domain/session-transport.ts"},"region":{"startLine":3101}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02b7df342a2816311a8bf3453622e2e4723805b494c7ebb0c8e9c0ab2b6995b"}},{"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/daemon/src/domain/session-transport.ts"},"region":{"startLine":3216}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c70810c59371013417e330447e3075c4e01f209b9cd5b18d290a014c49316df"}},{"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/daemon/src/domain/session-transport.ts"},"region":{"startLine":3272}}}],"partialFingerprints":{"codehealthFindingId/v1":"0087376cf990a6075ab7ccd7a00a6ca8f0ee1b334b4b869b8774d11410fea501"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":3634}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e451b59126905846956f1809b4d9bafaddb806c18c5d57a9e1aceaff4497d3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":3693}}}],"partialFingerprints":{"codehealthFindingId/v1":"56582735914b8354fb33a241d7e93bfbbabd1874e1a003cb221d82054688dbec"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":4083}}}],"partialFingerprints":{"codehealthFindingId/v1":"61342fde366553b0e573c3b6fe03ba54ba0b764e837923aa9675d69c381db2b8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":4156}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad307ee9e8efd94c2e4cbe36f4f45fd4af8d668033d3080d7d3ad14b43d12929"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":4243}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c772518d4a07215481455567bf2f3b8cdfc3c9c308f168ebfdcd5d15cfbc9c9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":4495}}}],"partialFingerprints":{"codehealthFindingId/v1":"075dff84e23e78074a064aa1e630eb82837f3acc5e3d5dcd63caf09b46efb2b4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":4693}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb379c311515ca199f68c651ae75a01d2b1b9be477a3781d02018ad53ae063c1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/session-transport.ts"},"region":{"startLine":4727}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b74269c88904c6994fbf07d5bd33a2dda134ffb2f97d2ed1c0328611313ab11"}},{"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/daemon/src/domain/session-transport.ts"},"region":{"startLine":4888}}}],"partialFingerprints":{"codehealthFindingId/v1":"7089d5ff659390fb40948cbe65c8fee53fbbe36befbcb7002b3c4d83b5b6f514"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/shadow-capture.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9101eecfda59f5636e5cee3130024942673932000ec2d3a656fbe94af1c789d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/skill-audit.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e78f98a5e98902c044b06ceee7734c318870eb6a165dd6eb60fe45526df715"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/skill-audit.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"781d370e83fdf9e3113daf6fdc54262ef8e8fcb70b64bb68d5e078572d916e80"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/skill-audit.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c756fa023eb73dd9cac9d7c00b230a50868e50207d0d47a65a0cd77b7112ab"}},{"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/daemon/src/domain/skill-audit.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d4c041878db6fafdfab94f88b059bc5c87f4564ee7281c805afea250581b31"}},{"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/daemon/src/domain/skill-audit.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a69e03c5ead5b0bbcb30e1a805ade402e4e8a88dfd01d2ccd386bab911a73fa"}},{"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/daemon/src/domain/skill-audit.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d22b89f38087cd05b54cc735cc644ccaf3b2ef8e655ac99cdd22899588e6f0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/skill-catalog.ts"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd8a4e694ca956322558198eee0959075bbf5e8020b867a93d77d68805e05d7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/skill-catalog.ts"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc461b7cd8315a3773d8df2bbe0572ae2b4ea5ab569cf75a7f2200038232fad1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/skill-catalog.ts"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d56fd79ab575afe0f79ebee3ec8f0c8b04bbce198b082d883eccc8128b5cdf4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/skill-catalog.ts"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c3cf0c39bab465b24d0735f2ae6ea6f9c93a7b88dbb9a1560117e8c452de8dc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/skill-catalog.ts"},"region":{"startLine":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b618f6d36a38f90bad5d0c01bf6996ec23fcab58a491323709ac2a8faf83ef"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/skill-catalog.ts"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de4af5194931bd6c839844120140818672a767605adb5c50fbb282b404bd205"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/skill-catalog.ts"},"region":{"startLine":1404}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae7fc531c7b98ab2a84fd9b28850ad424f73aff9fe9c4266eef0b68b03ad144d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/skill-catalog.ts"},"region":{"startLine":1410}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6ff9a027be43c7e13ed8348a8b888d999e4a0d5b4368681a5043e39d70b3f6"}},{"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/daemon/src/domain/skill-discovery.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"59373663a11715c3fa95b5f52025e7c84b85d579a542d39348d163ea0e65e8f3"}},{"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/daemon/src/domain/skill-discovery.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"575df13be293c5dd020b0abe0d8e9ced639ce99909473d2aff09f9945aa55654"}},{"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/daemon/src/domain/skill-discovery.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad478ae5e708144dd587b5917bc02cb04e4c92cc28d23ed50f5800d8bed7b7fa"}},{"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/daemon/src/domain/skill-discovery.ts"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa2013b02cf4ae99b39af2cf2fb5aacb44c6d12877a6b62c29069047d4ff1776"}},{"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/daemon/src/domain/skill-discovery.ts"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"555a4e3e64e44913d90535602fed19a3ee330dbac1323416dd6e82d40f4db0f3"}},{"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/daemon/src/domain/skill-discovery.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f2c34f665b0aaf42e11bec42c3a267870bde308be704ed3ece1d11b6fdf491"}},{"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/daemon/src/domain/skill-library-discovery.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89f7f978d8af715be873903c7f22b07b33c31088fe2a561359f19787c8708ab"}},{"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/daemon/src/domain/slow-op-recorder.ts"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd65035ccbc608d22cbe3dfd7cd4298347fdba3e2899d49f25fee0394ef0e584"}},{"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/daemon/src/domain/slow-op-recorder.ts"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1b64291019c3a4a6d7ffcd2ed2e6e3c8969db7ca623045697a3a83b49e7eff"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/slow-op-recorder.ts"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b8f1962e05d1eb8c7b6fe9c1d39591ba4f1e25be8403a04c58255c8eca5eaa"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/snapshot-capture.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5766bd747c4c12abeff26762082594e761d58f31afab024ac4899897ff90418"}},{"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/daemon/src/domain/snapshot-repository.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"010d964a948019eed47d466fdc0746e8eadf07e7de812d6b5a560e7a8fbfab4e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/startup-orchestrator.ts"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ca28e07152db3da9908c97cdc437f67f1abc84d3cbda8a299a1919cc8ac41f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/startup-orchestrator.ts"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"da2612effa29c270421bcf706a39520be11b28e275551b79a02b27282976c547"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/startup-orchestrator.ts"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ef9c07795f9d55d7a68537f39d6381f65992aa1f46fee8cb40b39608ca9731f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/startup-orchestrator.ts"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01b2b4b839f39ef912f808b35514705fc5cd1fadccb4858e0d9997b34d83bf8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/startup-orchestrator.ts"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f8cc85b1a5aa90803f21c614a3dc15bee54e8dc7ec9356a37cc054e775da53"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/startup-orchestrator.ts"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb8afcedeb575f54e6fe6c4a00300ca2bda408d6a7f116c378cfc3698868ca6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/startup-orchestrator.ts"},"region":{"startLine":1239}}}],"partialFingerprints":{"codehealthFindingId/v1":"1065f4f36c8f1c46b098d48ab2ce723f77458c2e5a8648fa3b650cfb85459823"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/startup-orchestrator.ts"},"region":{"startLine":1311}}}],"partialFingerprints":{"codehealthFindingId/v1":"a924a6b5767a0a66feb9439b00b4e538d344eb52d4b05ff98a43aa05b90088b4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/startup-phase-timing.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f6c60b352933dceb8d2daf3509993b6e83b635d9171ca557253ef1be8c3e46"}},{"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/daemon/src/domain/startup-proof.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"edd55424380bd14ee1903d252035cf3f92e20f548cc2ec9a0b305ec09900238f"}},{"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/daemon/src/domain/startup-submission-evidence.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"21dd441ee7f600816500b3080cf49c41921458f4bce9418012c109f2c3fd82a3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/stream-intake.ts"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be7b6f1612a06cb31c0b687d08f63496ce1660a44c6d4762d305e0235560d84"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/stream-subscriptions.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c30c80daca35596a7a2a4031b1db4c0e2d9a50bab664fbb3a04d2b12c894901"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/sync-site-wrap.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5fc686a554a6fa1bb8e74bf02f622fbf486fedca10550176d0c8690ce4578a6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/sync-site-wrap.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"8efdbb7dbcaf13e064b5ae09e861d20ac7257f550f12860f7f8e6427ebfa7f01"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/tmux-discovery-scanner.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"9113122dacddcd4d989c1753787aa598bb204a3d420297023f544f519923ec47"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/tmux-discovery-scanner.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a2077882020fc5181b3ffff1ff6fccfd530a24f70c61cbed9a2da65e82c81f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/tmux-server-selection.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"26502890285df38d1b3e9ce0ed8351b84b13a053d74847eb7107cbd4f8482654"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/tmux-server-selection.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"609a14cbca1af7c2524cf375aec259f85dcf11993e75320790770d7784c0b198"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/transcript-rotation.ts"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed02f59bc3c8d3df5a47919f28815c5ef93e1e065e85eb827a028f1b74289075"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/up-command-router.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"23282e885f902f72b1ff2e8d4916132a7363394f3a74a9fa06756a7cb013c0b0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/up-command-router.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ccab7eee48f4bf7427c3e2a67cc0656a07daca701e2204864d0abd1d1a831fc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/view-event-bridge.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"0943c97f368a05cbb69162d79daf01ea9e4b7bafdc07b8a07c789f30d43ac09d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/watchdog-scheduler.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc805d8522b109c873c865ae7f4236f6a1f625d881c20fdbc5c7ebb201e9e0b"}},{"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/daemon/src/domain/workflow-runtime.ts"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"3084f7187975d1aa7b75ad2162258ad11d014576bbdb6386bf48c355b1140f36"}},{"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/daemon/src/domain/workspace/frontmatter-validator.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ff4c40e0a246eb58b13be6524b972905e27df58b8ba50f14c84794e9baff9b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/workspace/project-registration.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"31390fcc5d15a7490099a38e873ab76d0516bcb8ef6274e5fa13f50dc07b7d15"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/workspace/project-registration.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"206038a94b0bdb6399e6b954659029b5ed3cb85fedc55fa1c4cb6551713b2920"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/workspace/project-registration.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"293564b8affd430ebacff178c180f6f7a44ec05e2dda79876761b8fe50a4ad9c"}},{"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/daemon/src/domain/workspace/workspace-doctor.ts"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe3fc892744200c37c767305dbac77b4c82b16cb736142d14bcd2522f695bd7d"}},{"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/daemon/src/domain/workspace/workspace-doctor.ts"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f3a46501928f20fe194123f10fd21ffb374258cc59765327fd6bcb6102bb84"}},{"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/daemon/src/domain/workspace/workspace-doctor.ts"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf2bff06d57002780347f9a04197236f2b6d482e4345c8187f48a7804a823d4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/workflow/slice-workflow-binding.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"e972e5f8d0e3bb23ab3823994785674e4dbd2eb5a190ffab0de29505716a4e40"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/workflow/slice-workflow-binding.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"1435a61dd49c330c5da6415d922d72cc778faa6d2de8daec02f937cd31febf9a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/workflow/slice-workflow-binding.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a916998fba5318704e9dcdec85c6ac7adf182428ec33380f02372b524c9ffc6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/user-settings/settings-store.ts"},"region":{"startLine":1430}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb7e344c90c946ac2f6a6ac533d7d7470d24fb32d7ace350ec22f3313b6e4b6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/terminal/herdr-adapter.ts"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c93682861f020abe7c24680a300f885c4c5db55303364801f89a05f7d484b7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/terminal/herdr-adapter.ts"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc53b53c4878564f4bb2b98cc7ebb8efbfb7c21a8b6cd7b772627c59a1057fc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/terminal/herdr-app-install.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e330bca3ca5b058f769ddb9ab0d1d5d02f2385fbaed145581f272907d15532"}},{"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/daemon/src/domain/terminal/herdr-app-provider.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d26c5d277dd788a0d94e1c9309bbd0cb2ceb23f84beba6bf8043bba4077e99"}},{"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/daemon/src/domain/terminal/herdr-app-provider.ts"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"983325b110d9e0ccec760e05daaa0a8271e6048a7db33003a2b4cdd41468d328"}},{"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/daemon/src/domain/terminal/herdr-app-provider.ts"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b90d455b0edc5ac60df7fa1345e788bdf45365337333b90cf73fa031f366460"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/terminal/herdr-app-state.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"957745d94a6f8cbba0e1bfc4d0e06ff5d81196715a76e55aec6e93cf275e5701"}},{"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/daemon/src/domain/terminal/herdr-follow-view.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d2e74e2da8ba00067114f7cfe87941f04a233c54f8d5711e3b8924219a889df"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/terminal/herdr-follow-view.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a702cce2dc80f2d1dcc3186e65e5e5592fea416519fb63d6b36e50669a487f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/terminal/herdr-follow-view.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"897c8555b37ee3957371f6e7070943e006531eb264a25cd11c58641a544be73f"}},{"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/daemon/src/domain/terminal/herdr-transport.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"8198be1f0529aff7ac3bec79f800013a2bca6ba1b2a1e6e5d98c84e29096a318"}},{"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/daemon/src/domain/terminal/herdr-viewer.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d25b8615f632d21437ba4302ce1274b33accc1f87a5b951ab8080a31c1caae"}},{"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/daemon/src/domain/terminal/herdr-viewer.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2875011755bee9a34d98bab3b0fb422d7f705b681d6e038d1e4fc4cac182a6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/terminal/herdr-viewer.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a79a6b2145cb8d152d7e455c565752b677d1996c9cf3867cd6dbec17228ce4"}},{"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/daemon/src/domain/terminal/herdr-viewer.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"726f7250f38280ff8435ce3f9b27597e218176545b8a1a35071af48e816ec3a0"}},{"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/daemon/src/domain/terminal/rex-adapter.ts"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"153c63dcaa072cdd69b5b0b8fe9dfa954a53db01f181a27ad981308ae0fedae3"}},{"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/daemon/src/domain/terminal/rex-agent-status.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c0e93bb43eae3053b7160ddd9c952831b100b53b583dd7643ccfcd8762e33e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/terminal/rex-transport.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"f12e38e79fcfc2370b62dd2e431a5ce54375cc407182139ea3faca4cf1593650"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/terminal/rex-transport.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc56dc80c2d76baf4febca0b3ef3c1a2d5648bab7d45ec237f13c6f69e613b9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/terminal/scope-task-terminal-view.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"460871a5e6964b453773257c42ab733735d2eb22304c657262b38516222d4101"}},{"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/daemon/src/domain/terminal/terminal-following.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e9b77796cd2adbf94246f355e8c8b796b6d4829e821de4a54f8ddb632698c2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/terminal/terminal-following.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f0fb5d7c48d76650a7e4b2f22446642562b043e32f5a5f54ecd01e11a52191"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/terminal/terminal-service.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeaa72be3e189b657075d7f74c8888b31c956a5072e820973679e20a8cf7d5c0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/terminal/terminal-service.ts"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a809b6d9583af835f9531244b27bf666252be7f9ea3d41de0a3e9f95e7fb6b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/steering/steering-composer.ts"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"969591d4fad6639a3d95059d4f61fd8f2b486943a0f03ad28277c754417ab870"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/slices/slice-detail-projector.ts"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"b562fac106009496d6611a7a9ca3bd382574ff7245527ac5f35a4f04c3402ada"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/slices/slice-detail-projector.ts"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f4765d04dbb6b2c338bb17ebefa525e46eec2aecd30a9f35de725d0c1acd185"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/slices/slice-detail-projector.ts"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"31bb3275dfb40d9de7117f53e6fe371b5ed3d9527a433c8113505b8a142f71d2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/slices/slice-detail-projector.ts"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"4527e148625b2b00f80bca027d15ce281a6e2d3ab876f0a9ce608923a4f19231"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/slices/slice-detail-projector.ts"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d0f1d21bddd9bcedaeb4717e3ee41faf7af2c431a794d746f71eb1948f63c6"}},{"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/daemon/src/domain/slices/slice-detail-projector.ts"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94300f032d4eff4859012aa7b47d6a6b42df250809345700873120c334b86b8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/slices/slice-detail-projector.ts"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"8976a978a69be21c5ee0a38ce465636e7a4f1e7f7de30b4bc927c2fe1c08c1fe"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/slices/slice-detail-projector.ts"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed8dc976cd62da1d9349fcf49d24141f8a583c6c834214da94d658da665007ef"}},{"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/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e4629b4798bfab29f3aa4c204d6b4907e1f42b969d33435f2a425f593357a0b"}},{"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/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d2ea799044e59711aec4b8880a5a43a8752709b7853be836aeeb063c6b5418"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d96945372c32c0f6f5b25711690e0d66e8ee389d3c630a6a1b71bcfb040c7ad"}},{"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/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":1517}}}],"partialFingerprints":{"codehealthFindingId/v1":"832b4b5f02b83cf057943756a791a14cb16427d037ea8940c96272a391b1effe"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":1573}}}],"partialFingerprints":{"codehealthFindingId/v1":"e449cacdc985e45a3348af90944b4cc07e5a964ff741521322af24009c783750"}},{"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/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":1594}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94bdf6135ed647b8bf05a4035855e673db7b9ba847cb6cdf74dab30dd2fc833"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":1642}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c3619f797cc24528f9b2ee45c8dda20c714e879d3c8bbf637daba7b81dd737"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":1655}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c6eb55e33a52fd4a746529e0cf699d0db4b2cdc6d55b7b095070a43671a637"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/scope/node-file.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9689a7492d8186d71ce191b8ef95cf300efa2fa88958f83aff4182e15a4150"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/review/gather.ts"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a23be3fafbb04979c2c132754d7c9c2f4f3903e6e211f9b0b7494961235dc8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/review/gather.ts"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe41f43e4dfd14e2477b032f37ef79767924db78a75c227268030da02fbcbd8c"}},{"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/daemon/src/domain/provider/claude-auth-status-reader.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe3041199db8e53adfd9c75778264002c237ed373d243701934bc560d227589"}},{"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/daemon/src/domain/provider/claude-auth-status-reader.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4bbc56c9d6855ae8323a9135b1207b34eeac2ebb8ff06558de206cdb0ad12a3"}},{"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/daemon/src/domain/provider/claude-token-usage.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"5325acc165c49c9ae89563ef55f0441ba98b7b7af33d97528ea1d16d7baaa5cd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/provider/claude-token-usage.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"73718df5c02726e7e45d130f15f38b6d63318c22b811fc1e55a73bf3b6de097b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/provider/claude-usage-reader.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"9674726cf304af27720ad4fc3eeb391208c07d1d996f85fc00c08e715a3ade02"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/provider/claude-usage-windows.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c990e1c90e026fa03635ac25861c8e07dde60cd402fdee82d3ae391ba67386a"}},{"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/daemon/src/domain/provider/codex-usage-reader.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbce6a0eb5011a8338c06fef1a452d2899df1f4d621c208a286e71a3e02b7684"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/provider/provider-service-impl.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"d42bdbe71e523f7a9649646df0ea32f414016752de88a943a7e773909cdf3783"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/provider/usage-windows.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"718b9a5f2c7932aff785ec2389d16c8c65429353e0c87862f93c5b4d801fd3bd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/provider/usage-windows.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"512636e16ea674112b54a26c1bfba356018a477224cfd574856851d99f4bfce2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/proof/judgments.ts"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de0281354368c1aa91b73491e469d38537466481cdb8c1f9e1afd0a6d7adbc7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/proof/source-watch.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"765e26d1ecfe2ac862b1ca93a191694c7c9dff3ad5d435dd4ae32ed146e1e42c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/proof/source-watch.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"751ad1f169bf9514c678d688127c05d370493f6808605258491c2067a4b0faeb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/proof/source-watch.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"b992a994289d47a222ddbebb079567cad7bfbb148d4070b3dd58028339b2d0c9"}},{"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/daemon/src/domain/progress/progress-indexer.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef8a327171ade4cd918135980fc71039de9c98e27e0cc2c4e731e6466aa615f2"}},{"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/daemon/src/domain/policies/artifact-pool-helpers.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"558152fa190824cf261fd769e57280a85692d5ff2921d513ba3d658afac68834"}},{"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/daemon/src/domain/policies/artifact-pool-helpers.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fcbdeee4f4f604e91de929b85b673704fe48669eb5bab6984f9f85f9acf9dd1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/policies/delivery-digest-flush.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ffbbdfb5ca43db5fdd189aa92567a0aeeb28d32694d569f47b4f9bf0c6ba9b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/policies/parked-owner-consumer.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2e69877cf82dec0824bc2cacb52d35da7ff95bb5ff643715860059a230ab47"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/policies/parked-owner-consumer.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"740c9b592df6af0574fb17a7274e7606346efa1ba2781dd4d915ca49b0fad4dd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/policies/parked-owner-consumer.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"595f4d3b4be40caefdc2c3d5344eabad3260e3804faaed6dbd2dbb9b80e567b5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/policies/parked-owner-consumer.ts"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d38e6aab46a35ee10207727aacca94a828d0dcfbd61be128253e6bd85fe16d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/policies/parked-owner-consumer.ts"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba5e7ac64deb9ee7010fda3ee50ffede6136ae275522c7c212aae00151d8a70"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/policies/parked-owner-consumer.ts"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"5827c1e28ad0624c8a06e430ad66f053c4b341a83dd7c51983d48f9eb6853115"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/policies/parked-owner-consumer.ts"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe7cd85a4c7c94d06a26a04cf7ba8ad0873f31662c35a7f24ded43a9e760f346"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/policies/parked-owner-consumer.ts"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec5dc7c20f3c03d95f230ba3044a2c6d0a364c4c6cb83edf9aed7faa99e7337"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/policies/parked-owner-consumer.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c6d4d72ddb2496aeefd41d7c108848b658e9c7ef8c153dec6eef3719162603"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/policies/quiet-release.ts"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"3374dfac06a962b88e47ce3cb820ee02c32d424403e515bd1f1788a08789b7c2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/permission-policy/persisted-restore-posture.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7dc6fd8a7ff3cbb8dba848ed6fbd6d45695ec75910ff49947105fdf279e5226"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/permission-policy/policy-ref.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"05cac7e428353dbf5454c9ec80d345d2c1ea0fa6a3b974754ee3905c0652ea9e"}},{"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/daemon/src/domain/network/hub-client.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f50c1d0476562e2fff45032bcdd68701d843c63b40618e9e062110cf3d290b"}},{"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/daemon/src/domain/network/hub-client.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"f937292027c24dd6df8ad54ac2013f1c85b22987ca28885326d618bf204fb96e"}},{"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/daemon/src/domain/network/hub-client.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"a42ffb7ca66b95cbb231a0c3899944c33e3de648a5599fa9a6d12ecb6427438d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/network/network-installations.ts"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf5c9198de3a2d512c80662e55ae77b0955d8f83b1bf7bfcd798f7f8fd24f42"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/model-divergence/current-model-reader.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f7c4a190e1160dc7bc658549783edfdc3cdcc44e8a435c27a6f1697b2a9314"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/model-divergence/effective-model-readers.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f11ed3f2e59244cd796ac2f89d94acd53d200bd77ecfd801c523caa9a18e4a7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/model-divergence/effective-model-readers.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"148a5e8ef94b60d04210c9975a15587908c55adc584a0477fa2cfcd3af093eec"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/model-divergence/effective-model-readers.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"d52e86232f1308070e18d058ac8426a730ef6c41d478d11b6bdd18f8afce5980"}},{"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/daemon/src/domain/model-divergence/effective-model-readers.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b328bf2bf001eac54ba0832e53cc87ef6bd60502bd1499f1072ac47e2c0d5c0"}},{"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/daemon/src/domain/mission-control/notification-adapter-ntfy.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ad3d8ab154b1b6facc67de50c4ccb5a3a254355ef01402b8975c896e7a7a16"}},{"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/daemon/src/domain/mission-control/notification-adapter-webhook.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"924e51ec5f6cdbd997a1eb373028da4c1fb4dafa3044f7adfc9e48888a8995f9"}},{"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/daemon/src/domain/hosts/remote-daemon-http.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"7551b21353f597c1c21e8498e44da4859d9913091bf1e84c3074dc7816b1a2ad"}},{"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/daemon/src/domain/hosts/remote-daemon-http.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ce421513a09e2e257c77c7aa4e4edad27c75e4bc52b2ec79ac469ddb181ed4"}},{"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/daemon/src/domain/hosts/remote-daemon-http.ts"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d286287d37b7753fa797eff6550d5f8e6910c14f3f4ffb792b9e1dcaf0cf2a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/gateway/gateway-process.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c99bf5bff7543c7daf2f31cdb8a6949a24c62fdb88e6f8bd52c2196b2a5344"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/gateway/gateway-subsystem.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"0603847e40e7ba3573e6fcfe5387f140135d1e90525463fd0102b74db9fac64f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/gateway/gateway-subsystem.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0a85419ac92f1bdbe2bdb1c8b52a58dbf0ff97a20e1f8021dc456f0e5ec942"}},{"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/daemon/src/domain/gateway/relay-outbound.ts"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae5fe6d6a6eaf78c7d04c02aaeaa090cfa790d589233798d0080d938f5d9d43"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/gateway/transport.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"e92014ae38b1b78bf0e2d07523799eb5b0fdee923ac55623be9648c0c656b566"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/gateway/slack/outbound-driver.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b99315da203625bdfc60b0efbbcc50a83b1919a1ec0eb37b9d2bb97ba92235"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/gateway/slack/secrets.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"424ae26a32552a37367104d9e518a6a1d9a59fe54d41d7d8b530bad058c77fbd"}},{"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/daemon/src/domain/gateway/slack/slack-api.ts"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"758e85cad1b2112d15256b826612807c9e3688a062679e55ae91ebf594240683"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/gateway/slack/slack-recovery.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac8cd359ea72de83f6780f9c3972917edf0bd84c9ac29b38126e259369ac5a3f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/gateway/slack/slack-recovery.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b90d5aa57b7337f28896941b42612f4b4963f3e12223d1ef3095b97e668794e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/gateway/slack/slack-recovery.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7690e690264feae9663762cdab24056e3739292554fc286d249cc1023e59b0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/gateway/slack/slack-subsystem.ts"},"region":{"startLine":1535}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c3e48c75de61213b0ace446b47d07d670e4b76db1421784f8383d71d477f7f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/gateway/slack/socket-inbound.ts"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ba665e99fc572a977c9c449436fef9b43dea82327cf30764e101b51b3480b0"}},{"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/daemon/src/domain/gateway/slack/socket-inbound.ts"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"1441663333492f3b4d0f11d03b1f7469a991812120184aad5c36f16d24650382"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/gateway/slack/socket-inbound.ts"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5be40c89302654207e5ff738ecb1fe1a6b30d716412ddf376d7adb94edd3c7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/gateway/slack/socket-inbound.ts"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe3ef59646a19be0d002e772b272269aa2c480beb01554a85ccaa484cb6b29a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/files/file-write-service.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58ccae5d89c45d6980f1402b88df5df3b9c94adb687671767841b0c7109e236"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/files/file-write-service.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"875c269352788581e8dfd7cf7ad6d3079abef624ec49053a20f46723aafccb78"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/files/file-write-service.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d51482db4a24b0d4223622c55c3de34c40272791ea9836f344f4f6dd0a7700"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/files/file-write-service.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d137c4bec570d901b191389e175050008290c6540fdaad69891bbe7ba3d0d47"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/files/file-write-service.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca91dfc8717e5c2559d0d7d6b36a9afe52d8108cde9c7af5626040e973d9449b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/files/file-write-service.ts"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55bab49f32a0e20e831f61c773c06b5c623886ca2b368426aa3d719f91e8081"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/files/file-write-service.ts"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"877cd04ffee821f455342c4962b86e0b88fa867de47d89d3c5adbbe7e142923e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/files/file-write-service.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e27dc61848355f3e6a21b57a601d12a73b35694b8854f5efd5830835717be7a"}},{"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/daemon/src/domain/context-packs/context-pack-library-service.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"4198c4062f71d37e2f466717dfcdf9dc23333bd789ec7de7b9a7f377bd464bd7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/context-packs/context-pack-library-service.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3aa8c5d5f1688f2329e77ab39c06c112f273956aaf31d184da0a32fb954254"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/context-packs/context-pack-library-service.ts"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6625d6b2303ee45f54053b5b807f00417f811f0064390224353b4d7b339e6e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/context-packs/profile-source-resolver.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"92e5090348291d589ba8533f5acde8a347e57a4b07e07ca72db594ddd648c136"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/context-packs/profile-source-resolver.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"31030cd49f53456335d1707e22a888f461c6b45ef38e144653c07f9e1b928a8d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/context-packs/profile-source-resolver.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ba31af3d449d1eb674e3294fd0ec56331eca74f6479c13d19719d36e334373"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/context-packs/seat-recap-store.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"253d6f3d1a62f88c308aba06de067da1e51763e341ce6a0b21431d12c24538b2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/context-packs/seat-recap-store.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb4c15cfc2bee62d49121423e11d872bc2877a5604a46a77aa60d59c816829c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/context-packs/seat-recap-store.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d191cefb8f1633e36d5ecab5903aa2e17a2573ab2fe2842a9cda52c87549041"}},{"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/daemon/src/domain/agent-images/agent-image-library-service.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"c473d177a0ddf9a4e1ec71203e234f34b0cef9eb3070cb605cdc97b99d95498c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/agent-images/agent-image-library-service.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a828d4417bdc5e985cdee6c287baa56df4a74e7b973b68badf158a3ed9948c2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/agent-images/agent-image-library-service.ts"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a64c79b355d4f5522e480f8b434c0a298dfd6dfbc6c99085a567b1283a9b862"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/agent-images/agent-image-library-service.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee6b2d4c22727c6fb94b55f903fa23e01a4d871540ce65aa6d2b232e64518e22"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/domain/agent-images/agent-image-library-service.ts"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1160155517472d1f0560dfa7b2d42fdde637692f92f9e3d38103ff829b3482"}},{"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/daemon/src/domain/agent-images/evidence-guard.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe6649f53c471774fcdde797965796878b9bd2e132f0b06ac0b41a17e34dfc83"}},{"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/daemon/src/domain/agent-images/evidence-guard.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d345787f52fe240f4066e61c3c8236ca73509dfc7f7e5272330f0837af916db"}},{"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/daemon/src/domain/agent-images/evidence-guard.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"103c3da89d4864bc5a52d6b96edcabfada1e07651cedb4fba553dffc33afaab3"}},{"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/daemon/src/domain/agent-images/evidence-guard.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"28967d6670ee6a46a17bb16914de9808349528e0ffc07055ff93a20a6b9af37d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/adapters/bounded-probe-exec.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8331966b637702bcdec07acf79f1b86788695ce41365610866ade45ca485444"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"6478438efc28c2795fc2eb93408a32a2f14e66826297d3cc33062cd23c660478"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"b16fdcfc37c20845170d0da6688235b459282c8323111830a1bd3165959e5ecd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b9655c2fd47a7c4b84941bb705ce826aa96a2b9fc7f6d9b46fced0723a4d4c"}},{"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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":1293}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e24924d37677b7443bd811f9c4d353ac6840286e968e9c683174cccd8b42799"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":1389}}}],"partialFingerprints":{"codehealthFindingId/v1":"d646771c31d00f976584ced1a3242483ae00573a598d3f2274e84b1781bd87da"}},{"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/daemon/src/adapters/claude-code-adapter.ts"},"region":{"startLine":1518}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e1f0a3e14055e782932473f32e30a7668e864bf25f856fe338b49e0cbc338b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/adapters/cmux.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e37d9b4e639d1f64789391bd324434edf244e23c5d22d2e7273f652ee766600"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/adapters/cmux.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba573275ceeaf26b75c26f563d60c615215f0b9ac9faf6e7e8d5304a334f80c"}},{"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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c085cbfbe52614efe28eaa7fc188a05a229cf0bf50dcd26f06dcf1b6e18804"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":1780}}}],"partialFingerprints":{"codehealthFindingId/v1":"70095351f7fad3480d635f92991419fe14835a772474ee042ffb7043e3a94ed8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/adapters/community-harness-runtime-adapter.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac2f411afd4fa34c8843b3cdafb8ed0deb2468e9bdd6186cad12e3fb74e7b223"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/adapters/community-harness-runtime-adapter.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"1903db98218d6dc5397dcc62bce4cc71bd89aecdfde9ad7a5cec67272505d0dc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/adapters/community-harness-runtime-adapter.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"6489710e44c636971099d1583cee1355ff6e8a1b41883117dcce10d237acdab1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/adapters/compose-services-adapter.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b3f8403f69b1859015013f1b74ece0b723fc99a12196919513aea4ddb395d46"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/adapters/compose-services-adapter.ts"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fcf41868353558322ebda95cf58443552765a01670cc1db8fa73e184e0cd304"}},{"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/daemon/src/adapters/pi-openrouter-charge.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"0faf92675a3de7ed47fe2465b85a26fb3e0f1d038d37873c9d5008b31e7b28f3"}},{"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/daemon/src/adapters/pi-openrouter-charge.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a3c79087d7ce90af33fed90e4f578761d484de265cb957e91ea64b8f6a09393"}},{"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/daemon/src/adapters/pi-openrouter-charge.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"591ef4e156dd2a6919f0bdefb7b71585bc956b762bd7f67b4d8a2ba6ed8f3bf2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/adapters/pi-resume.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"67014972bf82a38bc15e8cad37132408af06ff6429feaf07f4988f962173680b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/adapters/pi-resume.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9c52e714ecf4304784896247ac2d70a3e7eb3ec2917991b019ff087c7b496c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/adapters/pi-resume.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"c49534f3d3857094db9eb22f21a668e75c7d1951a45086ad7f4d6132999daf90"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/adapters/pi-resume.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"c750987d49be7855330a60b0c4f11dc29d5773c2b9b9ac03329a442c10327308"}},{"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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c416a678e0bb64f0248ccbb8ff94ecbe0ed3127b5e1e61d0c85f52a078e402"}},{"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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9520469fa7321c786ce92adb88d5710f3d5fda17e7469ee3e5da67260d496f"}},{"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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":1487}}}],"partialFingerprints":{"codehealthFindingId/v1":"eccb32e9ad9f2b92af2c9cad3f993df2031b6923437345930b00b087126eceb5"}},{"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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":1857}}}],"partialFingerprints":{"codehealthFindingId/v1":"4208eb06c435c7dc6d4483c6654f4b48e66d2dcf7e95f025c6c407d874d1fb55"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":2017}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5334fd816d7f9ce09067dbd70fcd58d5d45f936b6cf7c768741de56f6c57fa6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":2040}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e71a9b6253fe8c08f82f6eb5058debab4a208a94ee8e902bb5c1cc03a8593a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":2043}}}],"partialFingerprints":{"codehealthFindingId/v1":"afaf86153a65f034d0595a09869be6e8f4cc71eda3f7b9a0a61a07e20da49a90"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":2164}}}],"partialFingerprints":{"codehealthFindingId/v1":"29bcb3c0f20006ef10b0906878077fc525c0d5c92c2b5f6343423ee06b7b41de"}},{"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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":2225}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40bdbbbd61fc2ae704da92c29ac05890af737825eb929e7805c0d5ce9e54ed6"}},{"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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":2229}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b0073ff538dc7dbb38a7bebec8cc303522b3c22d7468310d04f05f3ecd4a8c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":2230}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea20282205dac7b28d85a4c5b42da6ef18b61637aa538a569de0e0b32f80e574"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":2246}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c0ef704c3bbed88c1301c37e9d719aacdc12fe56fb577cd47c8c4ef2fb9c9e8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":2349}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bcf1b40aa3364f41b00ac921e0414637ef2769cefca7eb0d948244d7a92a154"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":2439}}}],"partialFingerprints":{"codehealthFindingId/v1":"608e4351d3cbf832a3fb585e4c4eb735dde1fe42f1c9ce1dea6a97934f70abec"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":2457}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e4320295d255b1bc7cc51132ac2d918951566bc11d73d68360217a69646067c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":2517}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32e7a6cdc0316f22194b002252df6a2c750440b31bf5214c4280d8160763ee9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/adapters/pi-runtime-adapter.ts"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa4f7d1028a424e26e1b2d89687b01a03cbb8a8ec7bfc8b62b40952bc5f9360"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/adapters/pi-runtime-adapter.ts"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ea7e9f01ff428d166cc131785ae4ff7f3a313df6e388ebe2c1a69b3689fb7d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/adapters/pi-runtime-adapter.ts"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"888b23c0022c4349916473c3702b7d3f74581b89a5f7cd11ac482cbd791baa01"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/adapters/preflight-exec.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c52551be4cd8385351d26d4f1c1abe6f08c812c28b037599dfa5cb723ff7a6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/adapters/replace-file.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f5a48d086377fb87c68bfe7cf537ac5f1e9db13f909c1a4a9dcabbfccf6d4d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/adapters/stub-restore.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"26437eb4256a1006b0e0856f471cb190dce940eaf69f6c01aa9ab69883012748"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/adapters/stub-runner.ts"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d6dd1f2fdf286ba7d55dd76ce672903672bc1ca1e6897ff0f008e03885e04fb"}},{"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/daemon/src/adapters/stub-runner.ts"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e57a4e66457873169d74becdef266efab89e42f403baba58acd83d205b4659"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/adapters/stub-runner.ts"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"7412bd4c58e20db9dddc0d5dd5405dcc2c5f1bedcb91af3d2fb2c221f5528a8f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/adapters/stub-runner.ts"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcba05fad730a61510f917a154561d64ad8d3cff93919306e6f08904d7676a3f"}},{"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/daemon/src/adapters/tmux-control.ts"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"7001a10d26afbbe2a0be0e1fdda3303dd545a39a9ce062ccb1e976da37134e9f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/adapters/tmux-exec.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8c44125dc2361a08663af91c0a9962de7794033899c908ea7a85f7da569066"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/adapters/tmux.ts"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"890b1f83e52084352b8a8aa17162447263aa2a98db401b9d0873da2ca5de9e1d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/adapters/tmux.ts"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43ec95777814f9546a13a2758597181c60293be4c710de418d5cc72ef728a7a"}},{"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/daemon/src/adapters/tmux.ts"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a56133afbcfe4be7e43649ebb3fa9098ad3235e7e3568843e856d80bac3f84"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/adapters/tmux.ts"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed210964bdb94fd8b0370437cad961b77b342aea3fd12af4152155c52d4f7026"}},{"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/daemon/src/adapters/tmux.ts"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"57762cc92c6faecf8b44e303dc18869bb8c03178f2fb287a7e0f90c2fb7f8b79"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/adapters/tmux.ts"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a64ffad8627534ba057ae02655dbeec849efdde8d05aabfac32b2b07c8a48d"}},{"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/daemon/src/adapters/tmux.ts"},"region":{"startLine":1436}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ad3bcdd31766b0d003b1cc0221070038a4dbd6c8571b520204dcf189dc0503"}},{"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/daemon/src/adapters/tmux.ts"},"region":{"startLine":1440}}}],"partialFingerprints":{"codehealthFindingId/v1":"02330fb07f1361392de44aefdef016ff3807fc251d02c1c9edb5a89cc1361fc9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/adapters/tmux.ts"},"region":{"startLine":1674}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ddafbe1933a8284c2ab0ced7fcbb754797cddd459a84deeda36d42b1f20fc13"}},{"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/daemon/src/adapters/tmux.ts"},"region":{"startLine":1805}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0388e3742d1916ce4419032ae71d85dcb1b4ca9d9272aafdfae95e47b5ddeb4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/adapters/tmux.ts"},"region":{"startLine":1953}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdd2d7b4b7967243edb093a7f56bf1196801337096d7e38f4636a19afbe1f832"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/adapters/tmux.ts"},"region":{"startLine":1960}}}],"partialFingerprints":{"codehealthFindingId/v1":"f508bfd2089f55caa9ba281bd6c4b75218a5b0973314c82b064f3bfdd95c9060"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/adapters/tmux.ts"},"region":{"startLine":2024}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b974250c02d70c6780aa0ee873b089d9bb15b3baa114f0229b9a801e13e5d9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/src/adapters/tmux.ts"},"region":{"startLine":2035}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ee685d8c674b824eb3793f7467c5dc1e5357706c40fdccfb10689105400025"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/assets/claude-hook-bridge.cjs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"904c8b52a6a5c50c3da149c570b3887a3b8536514ee87335ff76d2371bc16433"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/assets/claude-hook-bridge.cjs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a0de069da1034f0fb9483ef9ad706c2e201bca33996f8dc1ce0569b9047bad"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/assets/claude-statusline-context.cjs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"809256823903f07e769fd5454493dede5bbbdecd860894793d9edea991a6af88"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/assets/claude-team-permissions.cjs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4d0801adeeafc5f8fca5c562c80f6933791c9a7e813b3a4190f21892f75ee3"}},{"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/daemon/assets/pi-account-lock.cjs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5370c8450012badfa5c90fe522a4bf023847645a8631ce4be901acbdc4f047"}},{"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/daemon/assets/plugins/openrig-core/skills/openrig-operating-model/scripts/compose.py"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6352b8c5885963227b102ab98a52aeebddb9d18c000c77624d203b2e52f6d89"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/assets/plugins/openrig-core/skills/claude-compaction-restore/scripts/precompact-hook.mjs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"c63e2226ab1fa256e5bbd5047ca6434bc5ffb811aeea88eaf686304e23080eaa"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/assets/plugins/openrig-core/skills/claude-compaction-restore/scripts/restore-from-jsonl.mjs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb84c4147b456080c23269454993e170e454414c3489b321aaf1bb6c30e54d7a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/assets/plugins/openrig-core/skills/claude-compaction-restore/scripts/restore-from-jsonl.mjs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03b81316fe6154772ebccb76b6a11900dc365da37e3fa2cd673f60b45173887"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/assets/plugins/openrig-core/hooks/scripts/activity-relay.cjs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"0edb156cade3a7706da3df2f8ae949e94df33993463736f0728ee837a31a74a2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/assets/plugins/openrig-core/hooks/scripts/activity-relay.cjs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d8b0c41307804b322e54cf2fd890a6e34d46d2ae15b3dbe0ed24f0dbafc85b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/assets/plugins/openrig-core/hooks/scripts/activity-relay.cjs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"af70a98792363cc59190f759bb2cd0cfcf30cf35d4fe96311c928874c79ad8f3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/assets/plugins/openrig-core/hooks/scripts/activity-relay.cjs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"80fbf84db484747472f4e76fd28b32bdbe997776e7c19aa4ddd5f8bad19f02df"}},{"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/daemon/assets/plugins/openrig-core/hooks/scripts/activity-relay.cjs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d845bd1acc25d564ee6b8dbf1f7c9fcc5053df6d33139177d26a6101b89d5e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/assets/plugins/openrig-core/hooks/scripts/compaction-restore-bridge.cjs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8142035b830427c731e8a0360994f3eae031d39ccd1fdecd2f7de3ee0e6b1e3"}},{"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/daemon/assets/plugins/openrig-core/hooks/scripts/compaction-restore-bridge.cjs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e274a22bcd183fa55c0a885a623911241d85e68f50f670f8162f76a380b6d4c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/assets/plugins/openrig-core/hooks/scripts/refocus-state.cjs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"8752f24edd9c637767de194819b66efcb8cf56f01da79bfb1f4081c0233b0c2d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/assets/plugins/openrig-core/hooks/scripts/refocus-state.cjs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"61597536a2a4b6016e428202acae80050e3ce8450b44d0278d5ba4503500369f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/assets/plugins/openrig-core/hooks/scripts/refocus.cjs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b9cd18b3363246bb7a9cfe403c16b22c6682f2af06407020cc4bb142b9c22d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/assets/plugins/openrig-core/hooks/scripts/refocus.cjs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a4ce73594d47f13ce463f4fb05a56b3f6265a8887c5010bc53891766d00e8f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/assets/plugins/openrig-core/hooks/scripts/refocus.cjs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd395af3154e4292e1e5d88fc0a67e49772890a63d017972172b60fd866a7de"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/assets/plugins/openrig-core/hooks/scripts/refocus.cjs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b92394249e859012da3d3ec8f854f7d4cae825352b2f73f15af5832d3beb41"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/assets/plugins/openrig-core/hooks/scripts/refocus.cjs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf99a5bd64fcb5817ac30548fa1459bf276f4aca383b6341c612f14b2d39927"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/assets/plugins/openrig-core/hooks/scripts/refocus.cjs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28b093d823ac82b90ae39f5cba23f929c72758f3912536b610b6cde5c7cfd8f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/assets/plugins/openrig-core/hooks/scripts/refocus.cjs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"63edb94de1366542947d899ed195e18431006dddb067d870be69301ad9ddc64c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/assets/plugins/openrig-core/hooks/scripts/refocus.cjs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b117e5897232815a73471740ad1ff0d9169dfc6eac14224791c7f39e0d9c69"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon/assets/plugins/openrig-core/hooks/scripts/refocus.cjs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"b38f75e03de4e92e8ddce5e2c66fa4d4ee2f82888ceab07144cb556c56a2fde4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/ask-wake.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a2402dc61dd4287148fcbd5d15e1c8f9cf7421c8640591aa19e05086e683ca"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/atomic-text-write.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd455a90c52ef0ca74e654d5e39e53a8e02855a935386dacf25f0d58d9265e4c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/atomic-text-write.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84fc69e945440a53754f4b5fa424484cdcf9b13df601664afa990d25d05e108"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/client.ts"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31bdf74faa7072f23bc978af514be4e7b93468227ea3bcad719c857afb013b8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon-lifecycle-status.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"c405536dc9f8e8f8e45e53803512d8cff2d39216cf9b81c1f7045483a717421e"}},{"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/daemon-lifecycle.ts"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc66bf220cd91671b408df1c5d1e48f4721e4dc814af08996ccf8bdf9496ade"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon-lifecycle.ts"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfbd657c509b7c727ea4432e69924064e3fed68c45127468ac6c52cd6c4bf1d1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon-lifecycle.ts"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cda64bbc1862d9bd5efec6b71c439f8b6cfc3af39ed92df12096e3a838282d6"}},{"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/daemon-lifecycle.ts"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"8371c91f2b02e63e2c28844240ee3b59f418f4fb9efdc801ce6f7189ae7f4471"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon-lifecycle.ts"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb3739cc5b1b1854820e6053a276b499850c2ee2d96c0b07ead1639473d1844"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon-lifecycle.ts"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdbbab1ece205981e4ec4b1b78bbd6d0da48b24d680584b74302a081eff108b1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon-lifecycle.ts"},"region":{"startLine":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"df3ef10e147ea6a527e122d9babd468c4157e07a9ff6d43d02915676e19b57d9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/daemon-lifecycle.ts"},"region":{"startLine":1378}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ca41447dc8c26f2a2f92c149cd848de740c7f043ef2b6fb4417bde2ba407aa"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/host-bindings.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bbbe5ef4595c6eff985b2c924adfd26b0484251f425ce3810f6e036b16b169f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/host-bindings.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b211f5766f2b128e3ad25d3e15e5acf48f4b40edbd43ca72a378626fae214a8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/local-db.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ff6d74151d8474bb39dc9bbe3f45d65d3cf53ec363c783aac419fcc14f5007"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/local-reading.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8abab713e7ec42bcf9bf4afa22c43d355178c18095ed5c03064cb90aadd337"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/mcp-http.ts"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b8c330ee79b329a7a6bf3a6d10d0c102ec0f1306a37b3cd5aa5c5598be65e6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/mcp-http.ts"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d33b9f73b529588af09430883e854873851c8535a89548e65693f0135a60904"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/mcp-server.ts"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"e91563cfe7d1ce248c2b8b5d212662843d67cfd44f8c0607bb10a1d6d5b0970e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/terminal-window-rex.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e1ae0fc07ae660e8e555f6f02d092fb71b737fa166924c23e7813a76ca5a7f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/terminal-window-rex.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"688d6237e035f7225ee369dc0f1608550c6be4d781ac7bef44d97ef8c3256366"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/terminal-window.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf969d3589c2590766ac9b9e42e46f29dc39663c6c8065607b4a0912e233bc64"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/terminal-window.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d7cdcc0bae331931676d8b3f04e85894a4e4b1a0cd651e0601a27024762fa4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/terminal-window.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd0e7f719b6ee2188deb27822ba682af24ccf2db89fd08cc284cd8d67732a5b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/terminal-window.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"1321ce0bd1ea7cd2ef96352f743e17a9ac5b7c680282e14f1bb4e7ff20448bad"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/terminal-window.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a01278682596cc98b2c1d55dfb07b18fb35d3fa6dce4b98c8c0fd80c18e4c2"}},{"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/terminal-window.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d425ae24989b2504ab450d739dfb0586252b4dc6115c8c413a014ed63620a53"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/terminal-window.ts"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"762a51c8a6cbef4b898b698caa395b5cd2f877c4caeabbfad0d7ae44f7aa61dc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/tmux-attachment.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a257445f7c0bb62681242a296f6119d42010d1b7f333b29bca557e26a96d34"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/tmux-health.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"436dccd1b92cc1699613d889617b1e3b651ffe462797bfb0e975453892ecd202"}},{"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/restore-packet/claude-transcript-parser.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c858bab1ceadc0ac185f8dc77beb2d39ec08ca84284e10571c83c5b48de5795"}},{"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/restore-packet/codex-jsonl-parser.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"e864fe3c2538591af89c65aefdc0b2ca3093cebaeaddcedfaa571ed2c75f404f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/restore-packet/packet-writer.ts"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e18ae6ab2cfdd4f6b5660c5bc380dfb9cbc51b510639cee53bb848d7cceff3"}},{"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/restore-packet/runtime-detect.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"d26e1004299fcf1160b6e0efce8afbaba54572aa5055a992c2fb452c00c6624e"}},{"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/release-surface/affected-skills.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"a82127dde7c4d7a7fa8d04933a29f1792aaa5a42f99a0c702916702abc592235"}},{"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/lib/walk-consumption.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"cccb83eece35bdb7f4263ab6bba44ac97c2af426efe2d6fdbbd768f343b6653b"}},{"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/lib/scope/capability-delta.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"80544cf58908c2044e5e8626c318c2a7eb0ee1c843abc251c843c6d10be6776c"}},{"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/lib/scope/capability-delta.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a1bea36721c662649d91fbb15b5a64fec0091d46a8528acd6fdae30d7b515b"}},{"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/lib/scope/capability-delta.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"19129f9ed4c6bd6d647e8574441ea0dd276bcabb56b4c1c1bbca2ceaf35d524d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/lib/scope/scope-fs.ts"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"98021d07b330ef7044110bb17b67afdffe7281c384a70fc2bb9e1ce341e0bb42"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/lib/scope/scope-fs.ts"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7043b7119c1f69370be2a0d85f558e7a63de60b8640249fa6e3d93157ff59dc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/lib/scope/scope-fs.ts"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fcf220a57c51de265e694812ac0695edf2cd8537953ba158052c690c689fdeb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/lib/permission-policy/policy-ref.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b08bfd2447f28d40530984a08dad0445a7cf1b17ddc9cf38abd35fbf690242"}},{"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/decisions/decisions.ts"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a6c71f74c2551bc271fb761320e6e1cb7579b38d8573381c8dc1818762a92e"}},{"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/commands/acp.ts"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee8c69a7217c14286ef36feaa5cc16fd0fe3c48e83f4853f95afe116cd1d943"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/commands/attach.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2042728ccef225249605b43751dc8a806b43411a819c888b874d692a69bbaa7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/commands/chatroom.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"edebb2a7c7b518655626e91feb9517b02716cab52c57aecfafd76414b6a85cb2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/commands/daemon.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"6314476d0b598ff80e513b501af126dcd6689af34b9ab9ed789cfd269201a802"}},{"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/commands/doctor.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"37123cadcdca73f725e8e790b24a794353468ffcd711499c692d73a304b06647"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/commands/doctor.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"90555f64c429648bf0d63891a982bdcaa88d81913781c85425206a91e12755b3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/commands/doctor.ts"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"eda1eb19f53ed59665b1563b4497648cb99e4549a9986fc63e6e0e2cbbc0c77d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/commands/doctor.ts"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"c00d82cdf17314a93c07e8256429769a23d15e051b9297e62ea721254080e0f2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/commands/doctor.ts"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0edfb466cc0942ae0e9dfbe80a636c3d1da92afaec38b63569fc47f2376e14e"}},{"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/commands/down.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"705d5ea68ce368456e3188d2744692aa056c7d33fb50ba8de8b9c5c2bfcf63fb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/commands/down.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4875328c5d1a9696a61890e576e368fc54ebdec8974cdefb32b9952cb7fad65"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/commands/exec.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa60e08fd86fa4319b18306dd8c0ffc8ceec6e73f934db917a705f2b6a9919f4"}},{"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/commands/exec.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"b997e4a118648a143339af5a98d52f547cc6003156bfe2f1943f76a3a316533d"}},{"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/commands/exec.ts"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd589a78275eb3b855a05f172f18ee5379970ab3b47e4cbf3c28aaae19ce3465"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/commands/export.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa0f0d20ffe758c43a549b8361d396e7f06de86ba1b30b7fcc799c03f7a072a"}},{"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/commands/heartbeat.ts"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bfd1cde606385a569bd6179abfcd179267421234d699f111bdd81e0980a356b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/commands/host.ts"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f1079c31232834bda91c94a9c2eca2c68fe26e30526186342535a44d8faab02"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/commands/host.ts"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"a54bff9b3665faed6ddecb3a3cd8db397e80a334f83b9ab2433e68fe650912d3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/commands/import.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"233aa28e8ad136bf0733c7bbe072ffbe700847e5ef6e734f03f0ebd2647e132e"}},{"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/commands/project-jev.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"e34db2154e85cc01b7038e0f8eb6a3be1d3d722f237197e540c91ce23893b119"}},{"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/commands/project-jev.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd34983689000cdd0afabd912f56bb65db1a1ae0dfe5a5080ec74673e24411f6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/commands/project-worker.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"b39dcc47ac249f574039c576097b089124def0789b83a6322dfe5a1ebb392af2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/commands/queue.ts"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce470e01e9cab537aaa36c9462dbc0303f3c323d2033e83847b36c8ed7ce0e13"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/commands/queue.ts"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"b88f0a2f4d88e6a3871824595af0f4b72357f9823f472c14ac856d3ce2a3fd7a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/commands/queue.ts"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e059722824ea35ce93a46fd116b6526127ac88400a1074cb081ce3edcfd019"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/commands/queue.ts"},"region":{"startLine":2547}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2066b8886b59210baaaa063292525aac029026ea9f1d8a5d1f0fdc02fa22872"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/commands/setup.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c46ee39381bbabc4d7f8a5a0cd6a8fb18d2cddc88c9a574810a19e4ab20463"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/commands/slack.ts"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"30936bd5f75254336336cf7a8714cff10bba272c3ebe64bf13f92d91b87dce52"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/commands/start.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"b92c48b6f30606ce7540ac3d867cea180df7c3842814ea67feb389f20d0b57bf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/commands/start.ts"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"42bd4007faa8ee26349f66a89a0f6376bf5d42e0d80e6595b25d899843d92f53"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/commands/start.ts"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ce4a218bcc44ef7ea3fffa5bcbea445bd92e3440d4e0e49899c9e2e662491f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/commands/start.ts"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"621e977c4b8a0573d0851bb745a46c3a96a89cf0b8fded47a06f445355a9b3b0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/commands/startup-proof.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb066294653dc9c7a212b8f4ddf943cc70dafefbd812ce6c307b526582491a0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/commands/status.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"3801149bcdfcf3e51aabda388afc5da9adc24cefa5efaafdfa338748ab223eef"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/commands/status.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c32a27da2eaee25d569832b5fd5e7f3bf23ac11da85788fbc0df2eb30f14fba"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/commands/stream.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a34b35f7108ba439dac3215fabf3a3cce0b88a1fcd26a50a017a5c84f4d461c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/commands/up.ts"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"d40e830876a450e7dbc6ddf3d2c0408f77beab56ecf4ffe243656cce2ee7a148"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/commands/up.ts"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"9344241fe2aa0755148f526ac8b0ec4cebab726748a36cb33141d8ce306d8c90"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/commands/whoami.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cac3d9ff7c64137c7f4fe9640318a1fb0bfcebd2707bb9801d8455b1bc95a7b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/commands/whoami.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cef7b1592b181008d201164b539c5a89e092eb0ac418726bded47fea4c1b923"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/commands/whoami.ts"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa84f282e06c73a094505da43fc42975a74ea86529e715b532c58cdbf2126713"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/commands/whoami.ts"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e2d5fb386baf268b8d538b3ecc9151d8ce4594564a87aed6980db70885de38"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/commands/whoami.ts"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6cc6943d0f8906f61f4a11c12fafea89691391d517933d8158465edfc475031"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/commands/workflow-follow.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1c260be79c1e440f4bbdb1b786e28cef2c64ba26be7ffe7c1dcbe5654f6810"}},{"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/commands/workflow-follow.ts"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c6f1226420bff823c57a797cc2a06f5a76a21ab36508a0c43ed258080dc1022"}},{"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/acp/connector.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"046f1226d8acf19dcd8e22d704875b5902bcb0c780169970c6c19bdae3555e88"}},{"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/acp/connector.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c4edf4a2d37f1de50ceeac9d0414d24dd91673977bc29892d5b781215dff420"}},{"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/acp/connector.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7000cd029be5bacd46ed8681cd8afd89634cb6f3042bf84e0ac13cffc1b3a8"}},{"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/acp/connector.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd2d9789ab317e44b0a435c457f11ec6781932e8ec6eef488634438a65db229"}},{"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/acp/connector.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f131e57930ade95169eda487ee3fb272ae7a4139030e36c404d9faad9c603fd"}},{"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/acp/connector.ts"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"682d830a6c90c1a3a761d058cbe451814be8ac48627f5b9b1b9a1ad43969ada8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/acp/run-processes.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"7623d2c17fb9886c6f462087feeeddacefec5cc34bd51d20dc16d38b3d7bbf15"}},{"ruleId":"X5","level":"note","message":{"text":"Null assertions (\u0060!\u0060) override strict null checking: ~7.0 \u0060!\u0060 null assertions per 1k TypeScript source lines \u2014 2629 assertion(s) across the 373590 source line(s) of the 1523 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/daemon/src/domain/session-transport.ts (158), packages/daemon/src/domain/native-resume-probe.ts (42), packages/daemon/src/domain/queue-repository.ts (41). 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 JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/daemon/src/adapters/pi-runner.ts"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12706d17fe78d8759f3778c4913fb1e6fe8bd03a29cbabfb3b36192fc24e71f"}},{"ruleId":"X7","level":"note","message":{"text":"Pending state with no failure state: The view draws \u0060Loading messages...\u0060 under \u0060isLoading\u0060, but \u0060isLoading\u0060 is settled by a load that can fail and the component draws no failure state, so a failed load is shown as \u0022not yet\u0022 for ever, or as the loaded state over its initial value. Give the component a failure state and draw it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/RigChatPanel.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d2b5c09db8d6d766b4452990c8e85f5ba883b3529c8d7583bfab5ab07cf4b0"}},{"ruleId":"X7","level":"note","message":{"text":"Pending state with no failure state: The view draws \u0060Loading steering\u2026\u0060 under \u0060! selectionKnown || mission . isLoading || brief . isLoading\u0060, but \u0060selectionKnown\u0060 is settled by a load that can fail and the component draws no failure state, so a failed load is shown as \u0022not yet\u0022 for ever, or as the loaded state over its initial value. Give the component a failure state and draw it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/ui/src/components/project/WorkspacePortfolioPanel.tsx"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b7fcf405f0a3878c77def4c3964415a45ed562715098c2e2f752f31c974b0e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060seatRuntimeHome\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/daemon/src/domain/seat-runtime-home.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90761ea57f192b0cd077cc0ce50f03210d148ec6cea62519cb73c434bd7b4e7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readTailLines\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/daemon/src/domain/model-divergence/effective-model-readers.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e22464eb2191805e2d5cd2092b9e6cc59ae583ba574d3b49c7bcb6f1a9cf248"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060listNativeProcesses\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/daemon/src/domain/native-process-lineage.ts"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"331c072876b4b80f5e3411a5d6b74b820aab5f3ed92fd886337e96f470f4cdd3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060defaultListProcesses\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/daemon/src/domain/resume-metadata-refresher.ts"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f54e4a47356de6997b61d243cffd9926e6f52f8f75198e7ca200d488243c6a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060standing\u0060 swallows every exception into \u0060return \u0022unverified\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/daemon/src/domain/runner-channel.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c50a70eaae800b4b7fd57baf8f8002f83a2cc989a54a40f214df47458545d18"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060dirs\u0060 (in \u0060listSeatSkillRoots\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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b4eb7648a4a819a9c91f160701df00f28eb754f4ee18be63ba25c6c2419f25"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060migrateLegacyProjectSkills\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/daemon/src/domain/seat-skill-storage.ts"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"3070922706d8e6b78a19ffdde0c038610adbd579dc93b3bf3863950dbddd5b59"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060present\u0060 (in \u0060seatLaunchAdditionsAt\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/daemon/src/domain/seat-launch-additions.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd2c3f17b7e646743d4af7971cdcf75888f483fa52aaa2c756ed14e20f32cf3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060tmuxServerArgs\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/daemon/src/adapters/tmux-server.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f85288f42d9d78e3c8ed9e389f1b59c8666983dacca999b5a0c66e91c63c61"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readAll\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/daemon/src/domain/gateway/slack/state-store.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"f573456eb1e6c687133d72d290c2cf25752ed5e0b64e9b41571fc81a498f56f9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readAll\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/daemon/src/domain/gateway/slack/state-store.ts"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12a737ed267db1898b74e5fc8b69b505d1a9f3518f3abed3ff6aa0116effeee"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060sweepSeconds\u0060 swallows every exception into \u0060return 300\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/daemon/src/domain/queue-waiting.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22cceca4bb166b6376b0a092341549f73868ce8b9392555cd44d9bc6dae5b70"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060catalogEntries\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/daemon/src/domain/workspace/project-catalog.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6461acd8167a5479e4e315ca993777dca0658b09e420c86a0907b5f929fe007"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060listSliceFiles\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/daemon/src/domain/slices/slice-indexer.ts"},"region":{"startLine":1672}}}],"partialFingerprints":{"codehealthFindingId/v1":"de3efda80dac77d0936d9cec570b2b5391cb26e3cdb07f838297f6b137ef7487"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060listCommunityHarnessPresets\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/daemon/src/domain/community-harness-presets.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a3acd34733d3b9e9d30155d602346af1dba1397078995f094049a5dd68f139"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060startedWithoutRequired\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/daemon/src/domain/node-inventory.ts"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c8626c9862f4693182bedec8cf38884942bbaa920fe139543a14c3fc45a8865"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readAt\u0060 (in \u0060advancePromptRefusals\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":"packages/daemon/src/domain/queue-wake-ladder.ts"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"923e22fb7801caa22de78074ece6f3e73f143f755cda5cf35178c828c11d833c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060defaultHostedMembers\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/daemon/src/domain/queue-repository.ts"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"d687782fdcec9687b7062227cabb83feb042d0011dac39131df1938c5e91bc67"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060verifyCheckpoint\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/daemon/src/domain/environment-lifecycle.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"f517ab9b8c03689fd5e9ebc8f026256bfe59fdf4330dd772cad95a61edc6138a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060safeReadFile\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/daemon/src/domain/startup-orchestrator.ts"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"d30a9f09f5cc10751a8d72d4b5231bfa5a6d7306210ab7d1d47f4be5eece8ac5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060dirExists\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/daemon/src/adapters/tmux.ts"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b4207dc654342d7865f80d270e2ccfd0c4ddfb91342f8d9155334b70ecad89"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060complete\u0060 (in \u0060mapReady\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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":1681}}}],"partialFingerprints":{"codehealthFindingId/v1":"74080122f502ea62fa796c96462e7ab3bb9fe4e72b5e70cd42b1574f7c92cc34"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060inputBoxStatus\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":"packages/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":1984}}}],"partialFingerprints":{"codehealthFindingId/v1":"55390c2d1a1a1541877eb5faaceaef510004a1a9b920cf4f42469a809b57095e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060completedSkippedMap\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/daemon/src/domain/claude-compaction-enforcer.ts"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"73601ce4a9e7f51c6e36e305961f77ca3e99a432554b6fbb4fb67bb453b3ecb3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getDaemonStatus\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/daemon-lifecycle.ts"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b5dce56b02f7c6fbdb0365655f3dd290c41f5f6dba81058cf5fa9d033dc90e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060personRegistrationOffer\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/person-registration-offer.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6044963c2bf950452ef218924f92661eca661e2c39a466b84c8e85252ca4a1b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readSelectedHost\u0060 swallows every exception into \u0060return \u0022local\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/host-selection.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2d1dab7901d8aa0cc49cc4c123d85f752c9c851c5852cd6e75a92a2e7c8a2b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readOwnHostName\u0060 swallows every exception into \u0060return \u0022localhost\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/host-selection.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"294d3ea96120a6cf47b7405ecf0b8358182e6c9bc2a633fb349f856f1c4915b6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060realDeps.fileSize\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/commands/daemon.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a3402bc24a0bfaa0942ee94bd2520d579bd0668bae879baaefd055caddce41"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060realDeps.listDir\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/commands/daemon.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"a598e535c1b746db4df0dcaa3d6c451181659d077aaa5732366789216099c1aa"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060whoamiPeersBound\u0060 swallows every exception into \u0060return 8\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/commands/whoami.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ae4cd8f0855cd42e51dcdcddf839ec90de68ae091d3e59af8e22ad8999131a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getCliVersion\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":"packages/cli/src/commands/bundle.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d790d1e9ea64b1dffa5d3f2b117664148fb855d8e7e72448f5036b77489f9c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060parseYamlSafely\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/lib/scope/scope-fs.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d97ca73254c75904aeb40986d973eb14d370d79200f217c948846c962833de4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readFrontmatter\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/lib/scope/scope-fs.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fbd1cc457fd3de11f4cae95d6fe1cce03541612fc27ec5f15f3acbd678e6a5e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readPresence\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/mcp-presence.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"b06cc798160400916929d9505229984fb35a1d0dfb71b2a0696fe8ba3d982f0d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060runSetup\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/commands/setup.ts"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06a2138ed1a29527d2236ec0f214de460b73aa40dc0d968012e576227bc7f67"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060capabilityDeltaExpiryFindings\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/lib/scope/capability-delta.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"9625fd29be21c2c799148020799f650258dda9cccdedf4bf61778c45a0e376d9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060selectableApps\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/terminal-window-rex.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cdddab7f8ff00333829df67eb353fe6fefa2c2593f3d95edd5ece931caa50e4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060parseJson\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/daemon/assets/plugins/openrig-core/hooks/scripts/activity-relay.cjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec82e81982aea7da2941cead5f2079d62bfe11c326c1966b82291c01a4290639"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060uid\u0060 swallows every exception into \u0060return \u0022user\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/daemon/assets/plugins/openrig-core/hooks/scripts/activity-relay.cjs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"3494064a40c40bb861e56c8e5e9e8a1d645cbd48ccab9731f075a60d9383860e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060interpreterAvailable\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/daemon/assets/plugins/openrig-core/hooks/scripts/activity-relay.cjs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"b220927ba3de854264d5af39570f93c43fc1cee7cdb5a9be7b2716607ae20806"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060parseJson\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/daemon/assets/plugins/openrig-core/hooks/scripts/compaction-restore-bridge.cjs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ccb04cbc5f1b494c92bbb335a754be79b7cbee0c1868fdd6bbe270c649a8cc0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readConfiguredContent\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/daemon/assets/plugins/openrig-core/hooks/scripts/refocus.cjs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"a93003a6f4dfa7e6312a87dc0b19a725a909df4c51d1f71b8b0862ad2d1552e8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readClaudeCompactionMessage\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/daemon/assets/plugins/openrig-core/skills/claude-compaction-restore/scripts/precompact-hook.mjs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb3376092fff9bd569e59d5187c50bfe09409b904f04d6fe2a6e1d7ce24f82e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060deriveRelayEvents\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/daemon/src/domain/claude-activity-hooks.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"017c4602a4ec9b99d84d9027f4657b27efea8a2d4519b7f0fc7fd15b922accbd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060resolveCodexGitAddDirs\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/daemon/src/domain/codex-git-add-dirs.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fdfe4580fb35398f275180f4131a47fa16f8f919663117c450b4e0247c2e99a"}},{"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/daemon/src/adapters/codex-runtime-adapter.ts"},"region":{"startLine":1764}}}],"partialFingerprints":{"codehealthFindingId/v1":"483068e4b91fe34201e26b13b7e288356394aeed25cdf248ace5b83af1dd126f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readSafe\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/daemon/src/adapters/pi-resume.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f2bfb10b740a5b4ad65187f0e9fa6769a527cefd78e1116b8dbec1b161cfbb"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060accountHome\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/daemon/src/domain/codex-auth.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da483f8e6e5b106100a3bbffc66a0f92c3ddde6f2a28fc978f324fd4a6f23cd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060countProfiles\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/daemon/src/domain/codex-auth.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"740fe5fee4bd09a3c79a460117dd3f51b43c1eaf030d14b8adb49a816d4dbe5c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060authList\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/daemon/src/domain/codex-auth.ts"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a65711617adce0344dbc30e43e494a9645d23878505b5e73efe1940455aaad"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060rawRegistryLines\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/daemon/src/domain/codex-auth.ts"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d3b9fa76d0594360fbcc45393d099a7ef3c6758d3fe2299ce3d07db4458372e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getLogFiles\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/daemon/src/domain/history-query.ts"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3b52122e2cdcde38a9548f3d7c7d796c9acf742644bb666291b7031b0fa6006"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060pluginsRouterFsOps.isDirectory\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/daemon/src/domain/bundle-content-routing.ts"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb3088678e3d6bf4b3dfe3d3f5e1486d7088a59fe9662323f886f37291c25ed"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060contextPacksRouterFsOps.isDirectory\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/daemon/src/domain/bundle-content-routing.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d2b06d195833635deefbfe298cc6ebb2b37277754c9e0e90a1f4633a954206"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060agentImagesRouterFsOps.isDirectory\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/daemon/src/domain/bundle-content-routing.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"25cdfae3e377beec5f860a41f11d7d840f94cc75b4ca3f9d537c3abee05aae84"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060materializeBuiltinPolicyReference\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/daemon/src/domain/builtin-policy-reference.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"9448ce331984f2ef42ed080ce814e0701298c7fbe77a44f1de7c942c5316200f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060listRecapChain\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/daemon/src/domain/context-packs/seat-recap-store.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe7791221868e13e4fd2092f470c8e56e0cd329dc4e1ec74d0e2ad645fe274a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060safeReaddir\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/daemon/src/domain/session-enricher.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd6538dc6e9d1aadf71ffd3ae3ffdab52d29d8f63585e915c0be9b1aac38abc9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readMissionSlices\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/daemon/src/domain/execution-view.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a0b10e33ee8a1fff459b487b25bfb12a165db3436e281119dc1b8c6e30e470b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060parseJsonRecord\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/daemon/src/domain/execution-view.ts"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ab69a693b24943658873cc70d71b213b77aae24e80a06d27de96afc086731b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060parseJsonStringList\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/daemon/src/domain/execution-view.ts"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"5acbee6b7224e13ceab3f9e68bd78a647c14f6399b7a2ece5504a79ea1ef3707"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060releasedSeats\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/daemon/src/domain/seat-identity-reconciler.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"3878584800c2b734c598b61735291c654c2e0ef02c0ec56da5aeca2ba7f7f059"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060keptGuidanceNotes\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/daemon/src/domain/restore-orchestrator.ts"},"region":{"startLine":1833}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8fa21502dd2618f6fd56f70caf5a761ccb31615ac271d48f382b14237d9d149"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060computeAgents\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/daemon/src/domain/kernel-boot-tracker.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c3fa541cf37e6c45cf5363c20238bce33940dea53f0d9e2819607822626296d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readSelectedProviders\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/daemon/src/domain/kernel-boot.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"960b08ee046f6155ff8a728336ada4b979e28035c4e37ef4456fb4a91fd1b229"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060select\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/daemon/src/domain/model-divergence/current-model-reader.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6cade1f2bf0bf17c9434039c8b0a3c87fb8435393d3a004dde290688b5bbbc7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060safeReaddir\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/daemon/src/domain/plugin-discovery-service.ts"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bda84e3c69e99b4e8669d0f510059d1056970af73ff15ea8ea66c6b660afd48"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060extractHookIdentities\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/daemon/src/domain/plugin-discovery-service.ts"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e616ae42144a2fcc67a574a1c211d27307c84c5835f02f4b1697ce75570aa07"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060runDeliveryDigestFlush\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":"packages/daemon/src/domain/policies/delivery-digest-flush.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b0eaedb83fddd24ef522d778f06241aff38a3ee641efca7d79c349673a5760"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060parseList\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/daemon/src/domain/seat-handover-attempts.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"c47aeb87fd3105bed777c04cacd0f62010d8c2e48fbf3fef8a7eac859cbe100a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060startupTextFiles\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/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":1327}}}],"partialFingerprints":{"codehealthFindingId/v1":"93b8a7490cbcb356c60d55b925f462adf77fc41891adc0a2331f2e300369466a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060captureDepartingContext\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/daemon/src/domain/seat-handover-service.ts"},"region":{"startLine":1598}}}],"partialFingerprints":{"codehealthFindingId/v1":"396d2e7d73626c0e3176a354c768ff19157a78423fd5a0babb000aba5abf7996"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060accountHome\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/daemon/src/domain/provider/codex-auth-reader.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d17ab6f3f8010317909585d933d2cb9163cc37722731dc21bd82133b9da061"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readProofArtifacts\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/daemon/src/domain/review/proof-io.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"553509ef7765b6afa10f00ded18a8bd1f82f096faaa5bc001e94404926e6dfcf"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060parseFrontmatter\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/daemon/src/domain/review/gather.ts"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"296b3f9c883eb2783245d52173db64e33541f935b7de215040d8777ec5e9ed83"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060attentionForTag\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":"packages/daemon/src/domain/review/gather.ts"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e9c135865c52ec425d09807557d388bd77d8af93543d9bf5baf73fe8383d3e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060overdueWork\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/daemon/src/domain/review/gather.ts"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bfa35ec670b99901138714648cd14460523723019e4eaa5771dee46829bf6ea"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060launchedClaudeCwds\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/daemon/src/domain/rig-teardown.ts"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"622bd01a2d50309e22bd8098992e1f8110a73673e4f44fa54723cee51f74ed15"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060parseFrontmatter\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/daemon/src/domain/scope/scope-approve.ts"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2c4040673b11006abc230289df16f58c321636724b36343a043cb71ee179ac"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060hashSkillFolder\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/daemon/src/domain/skill-audit.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"37e30f3970ce705910b65950d4acac4c78a91eb52b00db6ce1fa10c61831d8fc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060listBundledSkillSources\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/daemon/src/domain/skill-audit.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb63dfcd51bc10133137572c22696ef870f38d8dfd521f05da8c6463be193073"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060listFilesRecursive\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/daemon/src/domain/skill-audit.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"f85dafabeb25889356839173c0150ef5eb480950c87f71ab431c6b00c0093540"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060matchBundledSource\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/daemon/src/domain/skill-audit.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc7b92ec179c72b24442182d92d9f22e004892993e14725beaa3b10f72b3cdb2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060safeReaddir\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/daemon/src/domain/skill-library-discovery.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"66fa15fce8d32aea9a47291588d250c022bd421faab00823b1c0807abfdf72b0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060buildDecisions\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/daemon/src/domain/slices/slice-detail-projector.ts"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc2a6963f69330cbf836ffc1e5cdaab24672f49a54c244bc395986721dd6ffde"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060scanWorkflowSpecs\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/daemon/src/domain/spec-library-workflow-scanner.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"12320578036eb1a4614dbba41c0c053570d3e20585bc5acaef52ea4884ec650a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060probeHost\u0060 (in \u0060hostsRoutes\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":"packages/daemon/src/routes/hosts.ts"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"49221dec278feb7e6cb6ce57b0ae3f7907fd0750d1a13b8876b59ba8e120d2e8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readNodeFrontmatter\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/daemon/src/routes/scope-audit.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b78bd2942f63e544311b16e960f943c0f85f5c453f6fd5008ecb7d9ec80985"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060makeFakeClaude.read\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/daemon/test/helpers/fake-claude-usage.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"23501262b0c7967fd4a949139fb6ada3e68408d063deb781ba6500000fcce5b9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060makeFakeCodex.spawns\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/daemon/test/helpers/fake-codex-usage.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda6af10d0504ba9213e86eecf910dccd848366747929940ccfb98e4468bff64"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060programProcess\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/test-system/delivery/harness/world.mjs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7d7cf49a82d5bbf60aa9f57d4f576d3088449b4644215d3ea23575003df284"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060processesOf\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/test-system/delivery/harness/world.mjs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d2e0049b3e31aff64222c9938db6f0deb6f4bda5734e20e63ad7723a1cfa4de"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060deliveryEvents\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/test-system/delivery/harness/evidence.mjs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c9486512448c3434fde66ad650bc4071302e8e7f3d59558043a36b7d16f1a18"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060formatEventPayload\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/ui/src/lib/format-event-payload.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57d75d80bb538234919c40d2045fe35185bcf5d4262cda3c5f5127814e9044c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060snapshotProcesses\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":"scripts/gate-lane.mjs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"239938b2de185657e0d27261e0fd1686d09804bb7eeaf61358e2ebe0fb74360b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060fromPkg\u0060 (in \u0060resolveVersion\u0060) swallows every exception into \u0060return \u00220.0.0-dev\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":"scripts/generate-context-packs.mjs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdf469985a2fbfd10f76a0f242a9c0ad20e807e5a9bff1342b57c94d66f9bab7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readFrontmatter\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":"scripts/generate-context-packs.mjs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"554318651105574f5ddc90e1b16a3b37b0ebf5b3ba6cb60312924727bd07753d"}}],"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-125","guid":"98717707-96bf-ca5b-9568-8d1d257574c1","name":"CWE-125","shortDescription":{"text":"CWE-125"},"helpUri":"https://cwe.mitre.org/data/definitions/125.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-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-209","guid":"da28ecd2-f5c1-7852-ac41-a93b2d668c73","name":"Generation of Error Message Containing Sensitive Information","shortDescription":{"text":"Generation of Error Message Containing Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/209.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-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-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"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/"}]}],"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":95,"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."]}]}