{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D7","name":"Architectural Integrity","shortDescription":{"text":"Architectural Integrity"},"helpUri":"https://codehealth.canine.dev/dimensions/D7"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"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":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D22","name":"Internal API Consistency","shortDescription":{"text":"Internal API Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D22"},{"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":"D25","name":"ADR Conformance","shortDescription":{"text":"ADR Conformance"},"helpUri":"https://codehealth.canine.dev/dimensions/D25"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"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":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"AXS1","name":"Runtime exposed surface","shortDescription":{"text":"Runtime exposed surface"},"helpUri":"https://codehealth.canine.dev/dimensions/AXS1"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"ES1","name":"Fold determinism","shortDescription":{"text":"Fold determinism"},"helpUri":"https://codehealth.canine.dev/dimensions/ES1"},{"id":"ES2","name":"Immutable events","shortDescription":{"text":"Immutable events"},"helpUri":"https://codehealth.canine.dev/dimensions/ES2"},{"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":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P5","name":"DR \u0026 Backup","shortDescription":{"text":"DR \u0026 Backup"},"helpUri":"https://codehealth.canine.dev/dimensions/P5"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"P7","name":"Outbound HTTP resilience","shortDescription":{"text":"Outbound HTTP resilience"},"helpUri":"https://codehealth.canine.dev/dimensions/P7"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R11","name":"Import Boundaries","shortDescription":{"text":"Import Boundaries"},"helpUri":"https://codehealth.canine.dev/dimensions/R11"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R5","name":"Dependency Freshness","shortDescription":{"text":"Dependency Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/R5"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"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":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"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":"production-replay.verifyProductionBindings (cyclomatic 99): production-replay.verifyProductionBindings has cyclomatic complexity 99 (threshold 15). Of this number, 94 points are the body\u0027s own statements and 5 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/flywheel/src/production-replay.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"7123341009bf32c654d86dc6f8fffcbf8d79602950e35435fe64276a23be547c"}},{"ruleId":"D1","level":"warning","message":{"text":"ArcPlanArchive.load (cyclomatic 98): ArcPlanArchive.load has cyclomatic complexity 98 (threshold 15). Of this number, 89 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/arc-agi-3/src/plan-archive.ts"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d18c7f47a54d4aeb477019dd1e0c2d69307572b8af536cf1a82d861455f035"}},{"ruleId":"D1","level":"warning","message":{"text":"checkpoint.validateSupervisorState (cyclomatic 95): checkpoint.validateSupervisorState has cyclomatic complexity 95 (threshold 15). Of this number, 94 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/arc-agi-3/src/checkpoint.ts"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"982ece662fe687b255b5a2fac7f7e203bb2980b4d62d23b23cf54e503e17dfd2"}},{"ruleId":"D1","level":"warning","message":{"text":"field-memory.parseRecord (cyclomatic 87): field-memory.parseRecord has cyclomatic complexity 87 (threshold 15). Of this number, 37 points are the body\u0027s own statements and 50 belong to 13 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/field-memory/src/field-memory.ts"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"639ab677f1c7a56a2eefa8aa30cd1aff485eeb5a8c2b6e7cfb25faa54b271058"}},{"ruleId":"D1","level":"warning","message":{"text":"production-run.runProductionFlywheel (cyclomatic 87): production-run.runProductionFlywheel has cyclomatic complexity 87 (threshold 15). Of this number, 86 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/flywheel/src/production-run.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a6c6056a1def86d06aec0a05e391bd223e3819e013753c856024f389afa1fc"}},{"ruleId":"D1","level":"warning","message":{"text":"receipts.validateTransitionReceiptSchema (cyclomatic 74): receipts.validateTransitionReceiptSchema has cyclomatic complexity 74 (threshold 15). Of this number, 72 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/arc-agi-3/src/receipts.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"500a88f96967c313252e5a4521c99e505813f2d6bea10d064a6f716c56f47533"}},{"ruleId":"D1","level":"warning","message":{"text":"sim.runSim (cyclomatic 70): sim.runSim has cyclomatic complexity 70 (threshold 15). To reduce it, separate the cases: extract each independent 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 (sim.runSim::applyFold) 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/radio/src/sim.ts"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab0a89b494fe6671035d748deee6702f5d7b3761e8343a4f0c0e34ea44f63da1"}},{"ruleId":"D1","level":"warning","message":{"text":"Vm::builtin (cyclomatic 69): Vm::builtin has cyclomatic complexity 69 (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/oo-agents/crate/src/lib.rs"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f35be6e7fd70649a582c76cade6a96faa2a98e4179ac04092d2d43636502815"}},{"ruleId":"D1","level":"warning","message":{"text":"belief-graph.validateBeliefGraphSnapshot (cyclomatic 67): belief-graph.validateBeliefGraphSnapshot has cyclomatic complexity 67 (threshold 15). Of this number, 65 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/arc-agi-3/src/belief-graph.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e1214fcd0710f2fb7f916d6f94eb20a00fb27843eb52d1b3e1ca1a20f82654"}},{"ruleId":"D1","level":"warning","message":{"text":"safety-ast.analyzeSurfaceSource::visit (cyclomatic 66): safety-ast.analyzeSurfaceSource::visit 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/darwin-mode/src/safety-ast.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"c678cb69e348cd886bfbc4353121369e345356229d51065ba3fc52082fc8775c"}},{"ruleId":"D1","level":"warning","message":{"text":"checkpoint.validateCheckpointCrossFields (cyclomatic 64): checkpoint.validateCheckpointCrossFields has cyclomatic complexity 64 (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/arc-agi-3/src/checkpoint.ts"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e9c4f06ab2c0ef573fceebb7d0e28e8882a56cd9d6151f6b33ebf53a3c8a8f5"}},{"ruleId":"D1","level":"warning","message":{"text":"meta-proxy-service.enableMetaProxyService (cyclomatic 64): meta-proxy-service.enableMetaProxyService has cyclomatic complexity 64 (threshold 15). 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/meta-proxy-service.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"767305b0bd23bf6ff2feee1ecdb747816a7fff360c6b686332c6c01a6c448363"}},{"ruleId":"D1","level":"warning","message":{"text":"evolve.evolve (cyclomatic 57): evolve.evolve has cyclomatic complexity 57 (threshold 15). Of this number, 50 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/darwin-mode/src/evolve.ts"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9933537f3156270f7f7f1fd8e04ff4d51655c6d9efe08669590a9020b68b4b"}},{"ruleId":"D1","level":"warning","message":{"text":"multigeneration-proof.verifyMultiGenerationEvidence (cyclomatic 57): multigeneration-proof.verifyMultiGenerationEvidence has cyclomatic complexity 57 (threshold 15). 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flywheel/src/multigeneration-proof.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff579d2cb09cb15cf4de915c9d48505e49e2b1a7327748a129a0516e94f1564"}},{"ruleId":"D1","level":"warning","message":{"text":"supervisor.commitTypedSupervisorDirective (cyclomatic 56): supervisor.commitTypedSupervisorDirective has cyclomatic complexity 56 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3/src/supervisor.ts"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d1ff4a8a4cf35e96e1f4aa01eea739d9995bea4b616f1018b31cc22b87da23"}},{"ruleId":"D1","level":"warning","message":{"text":"claim-gate.preregistrationValid (cyclomatic 54): claim-gate.preregistrationValid has cyclomatic complexity 54 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/avo/src/claim-gate.ts"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"589cc32303dde101dee776d5972840cd271411d7ef3947ffafab1329404ccd80"}},{"ruleId":"D1","level":"warning","message":{"text":"checkpoint.validateCheckpointSchema (cyclomatic 52): checkpoint.validateCheckpointSchema has cyclomatic complexity 52 (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/arc-agi-3/src/checkpoint.ts"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e2d62209a9750c103f70e19df180765995cb8c50834797fd0691c9741e5f29"}},{"ruleId":"D1","level":"warning","message":{"text":"GovernedVariationOperator.run (cyclomatic 51): GovernedVariationOperator.run has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/avo/src/operator.ts"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f3dce13885a2bdae3c49f7ac2679f0fc2273fb642dfa886504f7e3464bd767"}},{"ruleId":"D1","level":"warning","message":{"text":"meta-proxy.metaProxyCmd (cyclomatic 51): meta-proxy.metaProxyCmd has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ffb322cb86db001141d9be26b6dad56fe348f2a0a936fdc497f139e9573ed5"}},{"ruleId":"D1","level":"warning","message":{"text":"index.renderScaffold (cyclomatic 50): index.renderScaffold has cyclomatic complexity 50 (threshold 15). Of this number, 46 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/create-agent-harness/src/index.ts"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f097f223aa3a7ce755326ee6f9fe4851f9f2b58465221d3b53913d906d9d5d"}},{"ruleId":"D1","level":"warning","message":{"text":"canonical.validateExpectation (cyclomatic 49): canonical.validateExpectation has cyclomatic complexity 49 (threshold 15). Of this number, 47 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/arc-agi-3/src/canonical.ts"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7264f73ca33f093f42c8b6e2cfca4b3577dec73e963c64692b1d54ff6214587"}},{"ruleId":"D1","level":"warning","message":{"text":"official-factory.createOfficialArcControllerFactory (cyclomatic 48): official-factory.createOfficialArcControllerFactory has cyclomatic complexity 48 (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 (official-factory.createOfficialArcControllerFactory::captureAvoExecution) 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/arc-agi-3-chatgpt/src/official-factory.ts"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b50b9c6177f2e1484bc75b423ea82e64ca6b539e1c670f84e57208a5ac767a"}},{"ruleId":"D1","level":"warning","message":{"text":"replay.verifyReplayBundle (cyclomatic 48): replay.verifyReplayBundle has cyclomatic complexity 48 (threshold 15). Of this number, 46 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/flywheel/src/replay.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"30cb4205e4730f13d7db6b79ae657b774ee05813266fbf7811f1c0ac49a33240"}},{"ruleId":"D1","level":"warning","message":{"text":"meta-proxy-service.disableMetaProxyService (cyclomatic 45): meta-proxy-service.disableMetaProxyService 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/create-agent-harness/src/meta-proxy-service.ts"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"75abb928101e09e24c978edb8caa171f27a2439bccec83c35a3cc3107f079993"}},{"ruleId":"D1","level":"warning","message":{"text":"production-gate.validateProductionManifest (cyclomatic 45): production-gate.validateProductionManifest has cyclomatic complexity 45 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flywheel/src/production-gate.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa20090ae2e776729595207f5f8eb6d740c30c859ca79e60a49afc287c1ab55"}},{"ruleId":"D1","level":"warning","message":{"text":"completion.verifyCompletionCertificate (cyclomatic 45): completion.verifyCompletionCertificate 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/horizon/src/completion.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"7823cd21be796e1cab25a29ad38f74c5617a33d94d810d18f00eb57e50f20694"}},{"ruleId":"D1","level":"warning","message":{"text":"Vm::eval (cyclomatic 45): Vm::eval has cyclomatic complexity 45 (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/oo-agents/crate/src/lib.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b5174616933d85242de4f112772b8ea3ff040cd479ef75062218ed70d19b56"}},{"ruleId":"D1","level":"warning","message":{"text":"EvidenceBackedMemory.commit (cyclomatic 44): EvidenceBackedMemory.commit 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, 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/arc-agi-3/src/memory.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"32657f45e917ecb768c01706dfc811a3bcaa2354aeac9e59ee8b73cccff54eb8"}},{"ruleId":"D1","level":"warning","message":{"text":"ArcPlanArchive.addCandidates (cyclomatic 44): ArcPlanArchive.addCandidates 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/arc-agi-3/src/plan-archive.ts"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef98a2e5e2bb10c68a354395b21d903cc3122808a1e239ed88dedb53d17bb908"}},{"ruleId":"D1","level":"warning","message":{"text":"ArcAvoLoop.#verifyCheckpointBindings (cyclomatic 44): ArcAvoLoop.#verifyCheckpointBindings has cyclomatic complexity 44 (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/arc-agi-3/src/avo-loop.ts"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"69706a81d5484f76c4456679d550a3ee1f85c91aad5fcbc830882e5e4b4d49b4"}},{"ruleId":"D1","level":"warning","message":{"text":"memory.validateStoredRule (cyclomatic 43): memory.validateStoredRule has cyclomatic complexity 43 (threshold 15). 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, 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/arc-agi-3/src/memory.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6bd491da42d09e490548c29e33e1f478a15a1bbe7a5699f9904b6544852c7c1"}},{"ruleId":"D1","level":"warning","message":{"text":"engine.runContrastive (cyclomatic 43): engine.runContrastive has cyclomatic complexity 43 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 25 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/darwin-mode/src/contrastive/engine.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e641e2db281ae736f3ac56dbc72cff1f1f40dfbdadd82d8f0b19888c7251896"}},{"ruleId":"D1","level":"warning","message":{"text":"numeric-evolve.evolveNumeric (cyclomatic 42): numeric-evolve.evolveNumeric has cyclomatic complexity 42 (threshold 15). Of this number, 39 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/darwin-mode/src/numeric-evolve.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"057f9e4fb86229446166a5f04eecefe678fa09e57c94deec65c5be33070ffd42"}},{"ruleId":"D1","level":"warning","message":{"text":"production-gate.createProductionManifest (cyclomatic 42): production-gate.createProductionManifest has cyclomatic complexity 42 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 10 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/flywheel/src/production-gate.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"a630ddc5d5c26f3e99b4642264b6fc1115fdd9889015dffc84777ce82025b423"}},{"ruleId":"D1","level":"warning","message":{"text":"k3rs::json::value (cyclomatic 41): k3rs::json::value has cyclomatic complexity 41 (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":"kimi-k3-harness/crates/k3rs/src/json.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f589a458924caea36e2a2ad3dd5b59c1bc5f180e4c1510081e2a39b0f55345"}},{"ruleId":"D1","level":"warning","message":{"text":"checkpoint.validateCheckpointBeliefHistory (cyclomatic 40): checkpoint.validateCheckpointBeliefHistory has cyclomatic complexity 40 (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/arc-agi-3/src/checkpoint.ts"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a462540e1e1e6ece0a6b184cfaecd4fad635b39ab101ac93d3872b8d6be9e32"}},{"ruleId":"D1","level":"warning","message":{"text":"claim-gate.verifyEvidenceBundle (cyclomatic 39): claim-gate.verifyEvidenceBundle 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/avo/src/claim-gate.ts"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e395743d4acc9b2d39043f58e838d91a2f2e295672ad992e20c0db8c153d93"}},{"ruleId":"D1","level":"warning","message":{"text":"protocol.runProtocol (cyclomatic 38): protocol.runProtocol has cyclomatic complexity 38 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 16 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/radio/src/protocol.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3c6d773196ee75efaee3a345d666a54321eb314fecf9ba99539bad3625cc4b"}},{"ruleId":"D1","level":"warning","message":{"text":"mock-target.exampleAgentTarget (cyclomatic 38): mock-target.exampleAgentTarget 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 one function literal inside it that branches (line 48). 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/redblue/src/mock-target.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5665e820cebe4c417f0833e31a9da5c3c7425313d142de0f9bb48ac48303c28"}},{"ruleId":"D1","level":"warning","message":{"text":"cost-pareto.html.render (cyclomatic 36): cost-pareto.html.render has cyclomatic complexity 36 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 11 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":"apps/web-ui/public/cost-pareto.html"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"720cdadc4483078a54581b9a273b7f9c4d65cf94d14d0365d24c835999ab22dd"}},{"ruleId":"D1","level":"warning","message":{"text":"operator.snapshotAgentJson (cyclomatic 36): operator.snapshotAgentJson has cyclomatic complexity 36 (threshold 15). Of this number, 32 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/avo/src/operator.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e603ba2b55f8df1e726009035aa0ab0e8dbb034f4105ff6981108e2bbb2766"}},{"ruleId":"D1","level":"warning","message":{"text":"verify.verifyFileMap (cyclomatic 35): verify.verifyFileMap has cyclomatic complexity 35 (threshold 15). Of this number, 30 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":"apps/web-ui/src/generator/verify.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"91354a89680f37538835354c681c53728c382e8dabbb33e0f73b37d7d6a1fd5e"}},{"ruleId":"D1","level":"warning","message":{"text":"claim-gate.parseManifest (cyclomatic 35): claim-gate.parseManifest 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, 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/avo/src/claim-gate.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34ef8ebcb6341b8b67bfd501d003b77ebd6617cbd5bbce4c607adb33d75c5a3"}},{"ruleId":"D1","level":"warning","message":{"text":"memory.retrieveContrastiveExperiences (cyclomatic 35): memory.retrieveContrastiveExperiences 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/darwin-mode/src/contrastive/memory.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62217e1dc5168d4844cbb50a493b8db8b424be29a4a94b13f5575a4b7ea028e"}},{"ruleId":"D1","level":"warning","message":{"text":"FieldMemory.choose (cyclomatic 34): FieldMemory.choose has cyclomatic complexity 34 (threshold 15). Of this number, 32 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/field-memory/src/field-memory.ts"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"670b13b71839ed30dde85d22a5c82b28ccb9e1f8edd519121e10a3f9dd612b46"}},{"ruleId":"D1","level":"warning","message":{"text":"subcommands.doctor (cyclomatic 33): subcommands.doctor has cyclomatic complexity 33 (threshold 15). 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, 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/create-agent-harness/src/subcommands.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2a0c6eff1374c7ae78a49accc9a6232c0a41d487ee0ae0d8f31b293c0cf383f"}},{"ruleId":"D1","level":"warning","message":{"text":"run.runFlywheelGenerations (cyclomatic 33): run.runFlywheelGenerations 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/flywheel/src/run.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"23520deae4720008584ba0c95b7b8a4855a009b683cc674a1c4c22cab450eb35"}},{"ruleId":"D1","level":"warning","message":{"text":"BridgeService.dispatch (cyclomatic 33): BridgeService.dispatch 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/arc-agi-3/python/bridge.py"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db42fd3537717f397f205bbfa6ff4927c788da1834fd8069b2ca29d0e9e7269"}},{"ruleId":"D1","level":"warning","message":{"text":"FileBudgetLimiter.readState (cyclomatic 32): FileBudgetLimiter.readState 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/flywheel/src/budget.ts"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa33258e829c188a7dd59d162b40afc42c2edef9a4be4dd3a3a183e37d8a24e"}},{"ruleId":"D1","level":"warning","message":{"text":"ooa_cell_vm::jval (cyclomatic 32): ooa_cell_vm::jval has cyclomatic complexity 32 (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/oo-agents/crate/src/lib.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d148c06238576647b5e7a78301ec4940ff0584d251c4ade7366c0fde60f5cea"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.parseArguments (cyclomatic 31): cli.parseArguments 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/arc-agi-3-bench/src/cli.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"00fb22ac9f5e69daac6876bc3495ceb92716d8d3f6311cec16b61684904cdd19"}},{"ruleId":"D1","level":"warning","message":{"text":"receipts.validateReceiptContinuation (cyclomatic 31): receipts.validateReceiptContinuation 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/arc-agi-3/src/receipts.ts"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"891c1132cb74b72b14a78bd8a1f2a2955f403fdd623b6905428dbec69d791ce3"}},{"ruleId":"D1","level":"warning","message":{"text":"index.parseArgs (cyclomatic 31): index.parseArgs 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/create-agent-harness/src/index.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"d82409a86c2b5d31891529a3eea23a543ef6e42ceede7bd1c1899626c776de5a"}},{"ruleId":"D1","level":"warning","message":{"text":"mcp-scan.scanMcp (cyclomatic 31): mcp-scan.scanMcp has cyclomatic complexity 31 (threshold 15). Of this number, 29 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/create-agent-harness/src/mcp-scan.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"208bf15bdaeb3269d4c7c8f24df2be1c41c3ea41f2f2f3593bff052b0fff71fb"}},{"ruleId":"D1","level":"warning","message":{"text":"schema.validate (cyclomatic 31): schema.validate 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/oo-agents/src/schema.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31b9c33b0d9421775568f6c8c341bee19382c20d06be64f6d8c62271310dea1"}},{"ruleId":"D1","level":"warning","message":{"text":"h1-submit.gatedSubmit (cyclomatic 31): h1-submit.gatedSubmit 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/redblue/src/integrations/h1-submit.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3f5c92b06cb864cb2882e7872f8337ea6972ff7071b9dbd07d94b730feb1d05"}},{"ruleId":"D1","level":"warning","message":{"text":"ooa_cell_vm::lex (cyclomatic 31): ooa_cell_vm::lex has cyclomatic complexity 31 (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/oo-agents/crate/src/lib.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"56acb909e128fe27d869688a211931692b452e5346bac3bb5aedaf2a7f2bdc8a"}},{"ruleId":"D1","level":"warning","message":{"text":"ArcAvoLoop.#stepCritical (cyclomatic 30): ArcAvoLoop.#stepCritical 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/arc-agi-3/src/avo-loop.ts"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a354ddbd72bff6c54d9c94b34debd34a302f6163abc830aa37efdc574522f5"}},{"ruleId":"D1","level":"warning","message":{"text":"index.main (cyclomatic 30): index.main 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/create-agent-harness/src/index.ts"},"region":{"startLine":1113}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb085e842bebe502982828afed06fc2b3ce63afb16853ab33553088809c3a68"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.main (cyclomatic 30): cli.main has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/src/cli.ts"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e2367ca0c280da2b7250fcfa6ea5b4cc6758b5d137ae32a598ccdb040521b1d"}},{"ruleId":"D1","level":"warning","message":{"text":"FieldMemory.update (cyclomatic 30): FieldMemory.update has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 7 of the 30 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 834, 964). 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/field-memory/src/field-memory.ts"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"2226ef01b8ab6a1d92f724fd79b83e8121ce20900528d5983fa2689d7c7773c1"}},{"ruleId":"D1","level":"warning","message":{"text":"production-gate.productionDecision (cyclomatic 30): production-gate.productionDecision 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/flywheel/src/production-gate.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"e216e685a8978df67423fad47460bb3e8b71229edd6993bc8a9dd6ae93abd0e3"}},{"ruleId":"D1","level":"warning","message":{"text":"audit-cmd.auditCmd (cyclomatic 29): audit-cmd.auditCmd 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/create-agent-harness/src/audit-cmd.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af167bb5c94b8929a93766f9c9d2ba1cb4219b3112b5533746f8e3d69103bc9"}},{"ruleId":"D1","level":"warning","message":{"text":"mock-target.alwaysVulnerableFixture (cyclomatic 28): mock-target.alwaysVulnerableFixture 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 211). 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/redblue/src/mock-target.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"6583e1f81c6f8c2877b70d455aa4438963c700169ffa342e91b7a464897f4751"}},{"ruleId":"D1","level":"warning","message":{"text":"model-driver.validateModelTurnResponse (cyclomatic 27): model-driver.validateModelTurnResponse 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/arc-agi-3-bench/src/model-driver.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35c71010b2e868012ce6265327f36763fe1ef5b791129f37eccc8cfc0c71388"}},{"ruleId":"D1","level":"warning","message":{"text":"EvidenceBackedMemory.query (cyclomatic 27): EvidenceBackedMemory.query has cyclomatic complexity 27 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 12 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/arc-agi-3/src/memory.ts"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"62207968f660b9d2ea5bc3a6104ac7ff805125094977daf9f3ddfa59644cfd95"}},{"ruleId":"D1","level":"warning","message":{"text":"supervisor.detect (cyclomatic 27): supervisor.detect has cyclomatic complexity 27 (threshold 15). 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: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3/src/supervisor.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ae10d689486f7d023fa56de7c7a1d5685a5958189b4be0c8edda8291f7d41e"}},{"ruleId":"D1","level":"warning","message":{"text":"repo-scorecard.scoreRepoCmd (cyclomatic 27): repo-scorecard.scoreRepoCmd 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/create-agent-harness/src/repo-scorecard.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"271ea2ee14b280adc66eaafaa5d264f9eaea8c71da4bf888d533e84578ff39b2"}},{"ruleId":"D1","level":"warning","message":{"text":"index.runMetaHarnessSubcommand (cyclomatic 27): index.runMetaHarnessSubcommand has cyclomatic complexity 27 (threshold 15). 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/create-agent-harness/src/index.ts"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"3580ab04d399f6efe65e8916fca37df75fe70efe9789cad3a7254c316fef45df"}},{"ruleId":"D1","level":"warning","message":{"text":"analyze-repo.analyzeRepoCmd (cyclomatic 27): analyze-repo.analyzeRepoCmd 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/create-agent-harness/src/analyze-repo.ts"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8fb800ecc5be3853ff68a4c1645b1b2e1c96da2cc35314590c35510a15d326e"}},{"ruleId":"D1","level":"warning","message":{"text":"EvidenceRetrodictiveWorldModel.load (cyclomatic 26): EvidenceRetrodictiveWorldModel.load 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/arc-agi-3/src/world-model.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"1117f79253d2866aa27e25a8d6b3531daf822c8b8e863acafd6e3bd9792409ad"}},{"ruleId":"D1","level":"warning","message":{"text":"generated-mcp.startMcp::handle (cyclomatic 26): generated-mcp.startMcp::handle 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/create-agent-harness/assets/generated-mcp.mjs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8c600ce4f2184aa220fde8507175f265dddd5871af23f86998b0aa621bfb532"}},{"ruleId":"D1","level":"warning","message":{"text":"genome.genomeCmd (cyclomatic 26): genome.genomeCmd 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/create-agent-harness/src/genome.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"957ace1e8123d58e86cda71b727a827c0c9adc98845e761a12937745124aa988"}},{"ruleId":"D1","level":"warning","message":{"text":"score.scoreCmd (cyclomatic 26): score.scoreCmd 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/create-agent-harness/src/score.ts"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"afeeb7729c154dd89f8a14ebca846305e58037c7bea3c5b047fa9910cafa756c"}},{"ruleId":"D1","level":"warning","message":{"text":"threat-model.threatModelCmd (cyclomatic 26): threat-model.threatModelCmd 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/create-agent-harness/src/threat-model.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"df00b231bc122d196c79414c85c60c2050b1e3a65e4c8b856746ea6fc8231ae0"}},{"ruleId":"D1","level":"warning","message":{"text":"ArcEpisodeStore.loadAvoCheckpoint (cyclomatic 25): ArcEpisodeStore.loadAvoCheckpoint 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/arc-agi-3-chatgpt/src/store.ts"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e31337e16c38c7e11fb93a9981ffbb739d6cc3b8250e5308c43b7594ffb69e8"}},{"ruleId":"D1","level":"warning","message":{"text":"official-factory.journalEvidence (cyclomatic 25): official-factory.journalEvidence 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/arc-agi-3-chatgpt/src/official-factory.ts"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e35d27161aa2c784d78e1247766f358495f5d818bd22ca22e86804ae8851f82"}},{"ruleId":"D1","level":"warning","message":{"text":"official-factory.createOfficialArcControllerFactory::captureAvoExecution (cyclomatic 25): official-factory.createOfficialArcControllerFactory::captureAvoExecution 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. This shape REPEATS in the file: one other method here (official-factory.createOfficialArcControllerFactory) 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/arc-agi-3-chatgpt/src/official-factory.ts"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4569b5d34d288823b76aaef4fffebc6acd474a0acfd67a291ef416a130d552c"}},{"ruleId":"D1","level":"warning","message":{"text":"canonical.snapshotArcJson::clone (cyclomatic 25): canonical.snapshotArcJson::clone 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/arc-agi-3/src/canonical.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1d2f0b3951de734a8563ca0f2a483bb8c0c25b48bf4314fafabe90c8948e9d"}},{"ruleId":"D1","level":"warning","message":{"text":"EvidenceBackedMemory.load (cyclomatic 25): EvidenceBackedMemory.load 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/arc-agi-3/src/memory.ts"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c59be844021182ed708fe1ca400d2a6a88e6bdab8b6f60ff552568e79d57d3"}},{"ruleId":"D1","level":"warning","message":{"text":"ArcController.resume (cyclomatic 25): ArcController.resume 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 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/arc-agi-3/src/controller.ts"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"68930f1bed195388987b7772e243e40aaa8731c046efdeb8846eb76f5e5d4172"}},{"ruleId":"D1","level":"warning","message":{"text":"host-config.hostConfigFiles (cyclomatic 25): host-config.hostConfigFiles has cyclomatic complexity 25 (threshold 15). Of this number, 22 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/create-agent-harness/src/host-config.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"598f9e594e2c264ec962ed2c01425f746a330fa05796d88672f309593deaafc7"}},{"ruleId":"D1","level":"warning","message":{"text":"analyze4.main (cyclomatic 25): analyze4.main 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":"docs/research/retort-placement/analyze4.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b3425dbabb515c4f93175f7e34e9bedc5f7de644184d8c10595900ce91076a"}},{"ruleId":"D1","level":"warning","message":{"text":"scaffold.hostFiles (cyclomatic 24): scaffold.hostFiles 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web-ui/src/generator/scaffold.ts"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f18727aecd12860b0dd1dd46ac263017256fe279f76646d86213fb76a32be91"}},{"ruleId":"D1","level":"warning","message":{"text":"claim-gate.armMetricsValid (cyclomatic 24): claim-gate.armMetricsValid 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. This is NOT this file\u0027s highest cyclomatic complexity: claim-gate.graderValid (cyclomatic 32) 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/avo/src/claim-gate.ts"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"30810f68662762953a827dafde1da24402a8de4de6525a8fa5b86cd8e365b5a1"}},{"ruleId":"D1","level":"warning","message":{"text":"claim-gate.evaluateReleaseClaimGate (cyclomatic 24): claim-gate.evaluateReleaseClaimGate 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. This is NOT this file\u0027s highest cyclomatic complexity: claim-gate.graderValid (cyclomatic 32) 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/avo/src/claim-gate.ts"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52426eea73bb7fc4e6205ebff44fddd6a05a6f3fee57f5e6b6ced3f992f2e5d"}},{"ruleId":"D1","level":"warning","message":{"text":"validation.snapshot::visit (cyclomatic 24): validation.snapshot::visit 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/darwin-mode/src/contrastive/validation.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4053e511422b73cdf5cca9c87806b5d76421e17ce32e4c6b2c58faccfcd1b9a"}},{"ruleId":"D1","level":"warning","message":{"text":"checkpoint.assertJsonPayload (cyclomatic 23): checkpoint.assertJsonPayload 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/arc-agi-3/src/checkpoint.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df7a6cd8fd0e07fdbb1ffac5154b45f9c6e10244164ca6f87e96ea4eacd0686"}},{"ruleId":"D1","level":"warning","message":{"text":"ArcAvoLoop.#persistRuleEvidence (cyclomatic 23): ArcAvoLoop.#persistRuleEvidence 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/arc-agi-3/src/avo-loop.ts"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"530aad9d58a2c86ab92e4801c7443dfd40fcf2b74e07f74ea2566d4c8234ffd4"}},{"ruleId":"D1","level":"warning","message":{"text":"repo-scorecard.buildRepoScorecard (cyclomatic 23): repo-scorecard.buildRepoScorecard 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/create-agent-harness/src/repo-scorecard.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"f46a6a7820e258decb408ccae7be834cf5a8fbe4623531e1902be21fb2a61e27"}},{"ruleId":"D1","level":"warning","message":{"text":"real-evolve.evolveDetectorsReal (cyclomatic 23): real-evolve.evolveDetectorsReal has cyclomatic complexity 23 (threshold 15). Of this number, 13 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/darwin-mode/src/security/real-evolve.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3dbf118c9837c8b839482d3c30a251e756c61822e5cb1ae66bc4861c381a26c"}},{"ruleId":"D1","level":"warning","message":{"text":"confirmation.confirmContrastive::execute (cyclomatic 23): confirmation.confirmContrastive::execute 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 (confirmation.confirmContrastive) 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/darwin-mode/src/contrastive/confirmation.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"9652609365b742cc9709ea70a7c3cd92535293a82720c77cf9a4212308bad3d1"}},{"ruleId":"D1","level":"warning","message":{"text":"RuVectorFieldStorage.constructor (cyclomatic 23): RuVectorFieldStorage.constructor 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/field-memory/src/ruvector-storage.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2cb9d4c3301a9b4e040387afe33839221b22c8ae17f0e268b22cd02790ddc13"}},{"ruleId":"D1","level":"warning","message":{"text":"session.parseLog (cyclomatic 23): session.parseLog 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/kernel-js/src/session.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d45fa7751002290e6e952dc1b64d526d439227facd9ba7cd92439864f2b4fe2"}},{"ruleId":"D1","level":"warning","message":{"text":"analyze3.main (cyclomatic 23): analyze3.main 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":"docs/research/retort-placement/analyze3.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2fa07f097ff43ba5691e85cfac1895da35110d241db70918b211c45df49536"}},{"ruleId":"D1","level":"warning","message":{"text":"HarnessBuilder.HarnessBuilder (cyclomatic 22): HarnessBuilder.HarnessBuilder has cyclomatic complexity 22 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 5 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":"apps/web-ui/src/components/HarnessBuilder.tsx"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e90e2cf8303d9d2e48d4b8dd82d050bbd62b95aa02e9069fbcf7226261cb48"}},{"ruleId":"D1","level":"warning","message":{"text":"ArcEpisodeStore.resumePersisted (cyclomatic 22): ArcEpisodeStore.resumePersisted 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 939, 991). 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/arc-agi-3-chatgpt/src/store.ts"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae64f14ce25d568f5fff87c861a7e953e3fd6715aec74c6926e5d73ccb63c80"}},{"ruleId":"D1","level":"warning","message":{"text":"ArcEpisodeStore.resumeAvoPersisted (cyclomatic 22): ArcEpisodeStore.resumeAvoPersisted has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 3 of the 22 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 1090, a function literal at line 1133, closeRecord, \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/arc-agi-3-chatgpt/src/store.ts"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"f90d251e95a28d2f12a77f85d605d20a43dd119015874224ee653188a12f9623"}},{"ruleId":"D1","level":"warning","message":{"text":"canonical.validateArcAction (cyclomatic 22): canonical.validateArcAction 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/arc-agi-3/src/canonical.ts"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b522b40bf49efebc991e6d2b30f0a993c533408ed06b5b1886f5f4a179cee71"}},{"ruleId":"D1","level":"warning","message":{"text":"oia-manifest.oiaManifestCmd (cyclomatic 22): oia-manifest.oiaManifestCmd 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/create-agent-harness/src/oia-manifest.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"110627d3afcf10f4c904de2da5d3167291b102600c489d3af90516c8205ebc63"}},{"ruleId":"D1","level":"warning","message":{"text":"bridge._observation (cyclomatic 22): bridge._observation 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/arc-agi-3/python/bridge.py"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aeea0a9e4066f9e85e3a2ca9ad2c6e8fcc93b4868dd5b7a0e3eb5c0d1c266ea"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::primary (cyclomatic 22): Parser::primary 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/oo-agents/crate/src/lib.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6aabff38a3bad80c4fa2cda9995169bf8be0d0af27f43b27776c19efd968687"}},{"ruleId":"D1","level":"warning","message":{"text":"lib.runSeed (cyclomatic 21): lib.runSeed has cyclomatic complexity 21 (threshold 15). 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":"experiments/router-calibration-loop/lib.mjs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f85655408a4886170e72e14dbada52ab9627fc6dfa9636295d9f415274d3fa1"}},{"ruleId":"D1","level":"warning","message":{"text":"ArcEpisodeStore.loadCheckpoint (cyclomatic 21): ArcEpisodeStore.loadCheckpoint 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/arc-agi-3-chatgpt/src/store.ts"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"af1a7fd210a500115f20e6a68c2a3a1d4c7c8126a80b6f9e12c0ff34e79b1596"}},{"ruleId":"D1","level":"warning","message":{"text":"server.createArcMcpRuntime.server (cyclomatic 21): server.createArcMcpRuntime.server 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/arc-agi-3-chatgpt/src/server.ts"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"3540afdeec989e600db592dde18810effc6203b7678da146df808768271dfca9"}},{"ruleId":"D1","level":"warning","message":{"text":"ArcController.commitDirectiveCriticalSection (cyclomatic 21): ArcController.commitDirectiveCriticalSection 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/arc-agi-3/src/controller.ts"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e7e1bdcc0700afcf45cc30fb1d1528dfdda425603a0144a90d270ef91bbc32"}},{"ruleId":"D1","level":"warning","message":{"text":"federate.federateDispatch (cyclomatic 21): federate.federateDispatch 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/create-agent-harness/src/federate.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"349144c73424ecafaa4a7ce9af570ca662e64519bb79809118c83af741806675"}},{"ruleId":"D1","level":"warning","message":{"text":"upgrade.applyPlan (cyclomatic 21): upgrade.applyPlan 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/create-agent-harness/src/upgrade.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b0b329e89cc5eff6fb293cbe0719c944929dd2d0da0082d96cf186e8f7d353d"}},{"ruleId":"D1","level":"warning","message":{"text":"scorer.scoreVariant (cyclomatic 21): scorer.scoreVariant 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/darwin-mode/src/scorer.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fabc824b693ceaa1009c684bb8e211e786521336947d0a90253e10b8c563b44"}},{"ruleId":"D1","level":"warning","message":{"text":"FannSurrogate.fit (cyclomatic 21): FannSurrogate.fit 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, 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/darwin-mode/src/fann-surrogate.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d3b6b89ea6499f868995d18bd44c7758ec749afcc4094a2be68c620233414e"}},{"ruleId":"D1","level":"warning","message":{"text":"validation.validateDocument (cyclomatic 21): validation.validateDocument has cyclomatic complexity 21 (threshold 15). Of this number, 18 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/darwin-mode/src/contrastive/validation.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"441195dc8e806bd47c1856b643e3dd144bfae077c78b6797085d222fabc790a0"}},{"ruleId":"D1","level":"warning","message":{"text":"loader.parseYaml (cyclomatic 21): loader.parseYaml has cyclomatic complexity 21 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 10 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/redblue/src/config/loader.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"1033e355f630d19fde9882733afd2cf0b691abb2974dd5ed7c8fe8c1127e1f75"}},{"ruleId":"D1","level":"warning","message":{"text":"HackerOneClient.weaknessesFull (cyclomatic 21): HackerOneClient.weaknessesFull 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/redblue/src/integrations/hackerone.ts"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ceeeee3bbd74aa21022d2c6e8840da070067d80d46f98d70f931bb1f17adbfa"}},{"ruleId":"D1","level":"warning","message":{"text":"HackerOneClient.probeWriteScope (cyclomatic 21): HackerOneClient.probeWriteScope 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/redblue/src/integrations/hackerone.ts"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf93d6342444af2032305741574d7d47b25d6ffdf1cd602f2d5aeb79657fbf57"}},{"ruleId":"D1","level":"warning","message":{"text":"reward-hack.toolResponses (cyclomatic 21): reward-hack.toolResponses 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/weight-eft/src/reward-hack.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc14c792535f85e26a08804310cc233b54b18a93c5094ef09bd8c50e9e7af48"}},{"ruleId":"D1","level":"warning","message":{"text":"Vm::exec (cyclomatic 21): Vm::exec has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/oo-agents/crate/src/lib.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eeb8d59745a0746931ab826a0d9fa8ffc252e5f2c3fe9733bf9c4265ef2f64e"}},{"ruleId":"D1","level":"warning","message":{"text":"ooa_cell_vm::to_json (cyclomatic 21): ooa_cell_vm::to_json 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/oo-agents/crate/src/lib.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3670b7ada8c1794d4a38963cbf6c2732405dda83859d8a549d88ef1fac3de0"}},{"ruleId":"D1","level":"warning","message":{"text":"RepoImporter.RepoImporter (cyclomatic 20): RepoImporter.RepoImporter has cyclomatic complexity 20 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 10 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":"apps/web-ui/src/components/RepoImporter.tsx"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9258a8de6eb005f36df7c624925f705cfb650568e213dfea139a0658f07f656"}},{"ruleId":"D1","level":"warning","message":{"text":"model-driver.assertPlainJson (cyclomatic 20): model-driver.assertPlainJson 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/arc-agi-3-bench/src/model-driver.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f2d7616138af1ef690aa95fd02b9665e1c30dd66ac9d058aadae0bd72607b45"}},{"ruleId":"D1","level":"warning","message":{"text":"canonical.validateExactArcObservation (cyclomatic 20): canonical.validateExactArcObservation 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/arc-agi-3/src/canonical.ts"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5964b2b4a8a7d6f1759734911a2cbe6c6ea5c0ec2d532c3295135d14bd2c02c"}},{"ruleId":"D1","level":"warning","message":{"text":"ArcPlanArchive.select (cyclomatic 20): ArcPlanArchive.select has cyclomatic complexity 20 (threshold 15). 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3/src/plan-archive.ts"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed9ba58947198261dab3f7cca4b657ae317b572bf22b2e63278b757e6137ea5"}},{"ruleId":"D1","level":"warning","message":{"text":"PythonArcBridge.#disposeAfterQueue (cyclomatic 20): PythonArcBridge.#disposeAfterQueue 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/arc-agi-3/src/python-bridge.ts"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee50c4bd53173d8ba7226529d327eb779ad035826d76af4e41ea215d3fe66e0"}},{"ruleId":"D1","level":"warning","message":{"text":"meta-proxy-service.parseManagerState (cyclomatic 20): meta-proxy-service.parseManagerState 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/create-agent-harness/src/meta-proxy-service.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d93f70ae5dfd630c1c08efbcf4d13cf8fafab9f6430efe02185303a633e3d1"}},{"ruleId":"D1","level":"warning","message":{"text":"confirmation.confirmContrastive (cyclomatic 20): confirmation.confirmContrastive 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 (confirmation.confirmContrastive::execute) 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/darwin-mode/src/contrastive/confirmation.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac47751bd5ad9e786813043fd3557ac2a87714c225ae1b9ecb4b333ace5e05b8"}},{"ruleId":"D1","level":"warning","message":{"text":"FieldMemory.importState (cyclomatic 20): FieldMemory.importState 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/field-memory/src/field-memory.ts"},"region":{"startLine":1220}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e67b38b8c6919c153f1e85789697a04ff124c725499ec772e43d7f77757a58d"}},{"ruleId":"D1","level":"warning","message":{"text":"export.exportTrainingData (cyclomatic 20): export.exportTrainingData 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/weight-eft/src/export.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bfd0b1f5a498b524d415eae4de06aa05497c823246df1b9a97928c82accaf23"}},{"ruleId":"D1","level":"warning","message":{"text":"bridge._grid_frame (cyclomatic 20): bridge._grid_frame 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/arc-agi-3/python/bridge.py"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"0122ce1ec8dabf871ff68bea1dbc7f27a3141689c0e8fec04719c11555610bfd"}},{"ruleId":"D1","level":"warning","message":{"text":"horizon_core::split_segments (cyclomatic 20): horizon_core::split_segments 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/horizon/crate/src/lib.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6fbd8ddf1a10d003f69f71bcbb1e80d89086a3cc7609765618cd2ec3008d023"}},{"ruleId":"D1","level":"warning","message":{"text":"make-charts.chart7 (cyclomatic 19): make-charts.chart7 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":"docs/research/cheap-vs-frontier/make-charts.mjs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d59bd2e68207ab74e3b446d165551cf2d6a001e7f74bc7f883c9b7f3ea00795"}},{"ruleId":"D1","level":"warning","message":{"text":"receipts.reconcileTransitionReceipts (cyclomatic 19): receipts.reconcileTransitionReceipts 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/arc-agi-3/src/receipts.ts"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"910ec8e2ab816cdd9fb9db7a81ea9c6b5f6a42d7cf969292a6f63003b9919213"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.dispatch (cyclomatic 19): cli.dispatch 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/avo/src/cli.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae1829f3114dc734bbdd384da78f1c0c2905df1b026fc555061292952666c2e5"}},{"ruleId":"D1","level":"warning","message":{"text":"compare-cmd.formatReport (cyclomatic 19): compare-cmd.formatReport 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/create-agent-harness/src/compare-cmd.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd8e85e3ada201c625ad1d41d036ba610c47a845c4d5639e57201eecf1017202"}},{"ruleId":"D1","level":"warning","message":{"text":"witness-client.verifyWitness (cyclomatic 19): witness-client.verifyWitness 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/create-agent-harness/src/witness-client.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e03314a9b1bef75429090c6312d3b0fa260f199ed2dc5c91b41a6b56c0395c"}},{"ruleId":"D1","level":"warning","message":{"text":"upgrade-cmd.upgradeCmd (cyclomatic 19): upgrade-cmd.upgradeCmd 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/create-agent-harness/src/upgrade-cmd.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"6880aed68543bf60d05bb98442834d99b9a4ac34f3886dad7e7dc51b1671b635"}},{"ruleId":"D1","level":"warning","message":{"text":"normalizer.canonValue (cyclomatic 19): normalizer.canonValue 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/evals-extract/src/normalizer.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ae33c4a4d8721bb580ced5108887666d6a7d63b77764a6933b98d02f5a3649"}},{"ruleId":"D1","level":"warning","message":{"text":"evaluator.clampLever (cyclomatic 19): evaluator.clampLever has cyclomatic complexity 19 (threshold 15). 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, 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/evals-sql/src/evaluator.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7e180552a3ec76e3bfd0910dbc52b9c99c0dd9cd3bdbb7933a032af246ea36"}},{"ruleId":"D1","level":"warning","message":{"text":"sim.runSim::applyFold (cyclomatic 19): sim.runSim::applyFold 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 (sim.runSim) 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/radio/src/sim.ts"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea3df78c9353d7da8ca87c437b89871fb1b19f7c8d3076aceca03f47ed84434"}},{"ruleId":"D1","level":"warning","message":{"text":"k3rs::model::kda_layer (cyclomatic 19): k3rs::model::kda_layer has cyclomatic complexity 19 (threshold 15). 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":"kimi-k3-harness/crates/k3rs/src/model.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"4433d95570bc280e2ba06dff25381ed5df33de6421375341f1b2ec75736e41d3"}},{"ruleId":"D1","level":"warning","message":{"text":"CatalogPicker.CatalogPicker (cyclomatic 18): CatalogPicker.CatalogPicker has cyclomatic complexity 18 (threshold 15). 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, 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":"apps/web-ui/src/components/CatalogPicker.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b1607dfc06c596616a1a7e5890c9d2bd68939d9d12fedbac42ab9f35d759a7"}},{"ruleId":"D1","level":"warning","message":{"text":"report.buildBenchmarkReport (cyclomatic 18): report.buildBenchmarkReport 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 2 function literals inside it that branch (lines 102, 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/arc-agi-3-bench/src/report.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"929543a4f45359aa1b3117367363ca563ae42291c5c7419bf1096fd02eedd00e"}},{"ruleId":"D1","level":"warning","message":{"text":"ArcEpisodeStore.saveAvoCheckpoint (cyclomatic 18): ArcEpisodeStore.saveAvoCheckpoint has cyclomatic complexity 18 (threshold 15). 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 602, 640). 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/arc-agi-3-chatgpt/src/store.ts"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"777408cb6724ad5b829e6588c621348df8ed129078c9bc3fa6f5965acafa34be"}},{"ruleId":"D1","level":"warning","message":{"text":"ArcController.actCriticalSection (cyclomatic 18): ArcController.actCriticalSection 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/arc-agi-3/src/controller.ts"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1112e22b4d51b5745b3ded841f441b640014760bbfe0f7e92ce02661186855"}},{"ruleId":"D1","level":"warning","message":{"text":"avo-config.resolveFeatures (cyclomatic 18): avo-config.resolveFeatures 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/arc-agi-3/src/avo-config.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"d840b570ba45293f3bf8a41d06b79e3e5d8034e618cb497bf6ae6aad3965d912"}},{"ruleId":"D1","level":"warning","message":{"text":"python-bridge.parseObservation (cyclomatic 18): python-bridge.parseObservation 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/arc-agi-3/src/python-bridge.ts"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c8af454a03717c41aa555c94ba26d0b82cda7237fbbcf11179f835b8684788"}},{"ruleId":"D1","level":"warning","message":{"text":"SemanticSupervisor.observe (cyclomatic 18): SemanticSupervisor.observe 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, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/avo/src/supervisor.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcf9e452d3b153ea15b4ba95adb092027422c866761e1d4fcf22c1e32b0dc16e"}},{"ruleId":"D1","level":"warning","message":{"text":"field-memory-scaffold.integrateFieldMemory (cyclomatic 18): field-memory-scaffold.integrateFieldMemory has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/field-memory-scaffold.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ccf53f7cf042788f588cd5a440124fe636288d3f4aefa4aa5b0645823b96551"}},{"ruleId":"D1","level":"warning","message":{"text":"analyze-repo.analyzeFiles (cyclomatic 18): analyze-repo.analyzeFiles 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/create-agent-harness/src/analyze-repo.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b885027471b8a5d6e314e216b0232651fabcbb6a115fcf3b900f6ebd821dfee"}},{"ruleId":"D1","level":"warning","message":{"text":"threat-model.buildThreatModel (cyclomatic 18): threat-model.buildThreatModel 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/create-agent-harness/src/threat-model.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b966586e422b0e6b3839e2ccfcaefc483424a3fc6b5c2802084a0c46ff19ed4"}},{"ruleId":"D1","level":"warning","message":{"text":"metric.analyzeTranscript (cyclomatic 18): metric.analyzeTranscript 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/darwin-mode/src/gepa/metric.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ceff377f54d4aae360162680d79788039d79b3488e797658e7f96ec227c5b6"}},{"ruleId":"D1","level":"warning","message":{"text":"metric.classifyFailure (cyclomatic 18): metric.classifyFailure 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/darwin-mode/src/gepa/metric.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"6883b82a8173f7db52516ed4a6d554814f51548a8efd1e39b3175624995831f6"}},{"ruleId":"D1","level":"warning","message":{"text":"loop.gepaOptimize (cyclomatic 18): loop.gepaOptimize 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/darwin-mode/src/gepa/loop.ts"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"782c73f6503c07f4a5c38b021b54360929f690161fa19579410d2c4f7773135f"}},{"ruleId":"D1","level":"warning","message":{"text":"normalizer.parseKeywordArgs (cyclomatic 18): normalizer.parseKeywordArgs 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/evals-toolcall/src/normalizer.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bec9b3607b0c62268d9e7706179e233e984c85f29f5f392ecade8adffdabf95"}},{"ruleId":"D1","level":"warning","message":{"text":"evaluator.makeToolcallEvaluator.evaluate (cyclomatic 18): evaluator.makeToolcallEvaluator.evaluate 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/evals-toolcall/src/evaluator.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"faadc5b3346b92b828341d2272e590244bfd159103cb004f80990db7db657f5e"}},{"ruleId":"D1","level":"warning","message":{"text":"validate-bundle.validateLineageCommit (cyclomatic 18): validate-bundle.validateLineageCommit 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/flywheel/src/validate-bundle.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"173d656eee11c978546427c60144c03e4d4e426b3475a916e75715065b259937"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::bin (cyclomatic 18): Parser::bin has cyclomatic complexity 18 (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/oo-agents/crate/src/lib.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"d95ddfacd2f381d860cd961f81375b25eca9fd9a695fe15a80a9bd24771d08cf"}},{"ruleId":"D1","level":"warning","message":{"text":"repo.analyzeFiles (cyclomatic 17): repo.analyzeFiles 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":"apps/web-ui/src/generator/repo.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee236f7109fc6e12ba92262fe6f7578dbfb8a7857c9d990a4412e7cde1e86856"}},{"ruleId":"D1","level":"warning","message":{"text":"make-scaffold-chart.curveSvg (cyclomatic 17): make-scaffold-chart.curveSvg 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, 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":"docs/research/scaffolding/make-scaffold-chart.mjs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ccf4b7d74eb1f6a989139b0e0c6a0cea52e3b28ba4a19f2d6b8ffa297ebc5b"}},{"ruleId":"D1","level":"warning","message":{"text":"canonical.validateFrame (cyclomatic 17): canonical.validateFrame 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/arc-agi-3/src/canonical.ts"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"6014da942703fc9cf288a4d72f2881ef22d57662e7d26a671fd201848c1293a8"}},{"ruleId":"D1","level":"warning","message":{"text":"swebench.evaluateShipGate (cyclomatic 17): swebench.evaluateShipGate 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/avo/src/swebench.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b800b25a6558490806deb1fac691117560db7c149021aae8986df0d498e9e7"}},{"ruleId":"D1","level":"warning","message":{"text":"claim-gate.validateClaimSurfaces (cyclomatic 17): claim-gate.validateClaimSurfaces 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: claim-gate.graderValid (cyclomatic 32) 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/avo/src/claim-gate.ts"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05d4481c56fc839d4100faaeb8db65412da39485bda6205e94a0b27654e2ade"}},{"ruleId":"D1","level":"warning","message":{"text":"operator.assertVariationAction (cyclomatic 17): operator.assertVariationAction has cyclomatic complexity 17 (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/avo/src/operator.ts"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef19ae3c8a0a887e32cfadfc379e44f20a94017ad8aaed00c99851f650c2936"}},{"ruleId":"D1","level":"warning","message":{"text":"diag.buildSupportBundle (cyclomatic 17): diag.buildSupportBundle 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/create-agent-harness/src/diag.ts"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ccf00962a76d73400770f636e3abb7b3792c1711c31d2b4f126deb5908a4b85"}},{"ruleId":"D1","level":"warning","message":{"text":"normalizer.normalizeAnswer (cyclomatic 17): normalizer.normalizeAnswer 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/evals-math/src/normalizer.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"200074fc69e2a2bcee13f78a6fa35830d630f51d8c81c73de9eefe8d0b68072a"}},{"ruleId":"D1","level":"warning","message":{"text":"EscalationScheduler.run (cyclomatic 17): EscalationScheduler.run 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/projects/src/scheduler.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"786c086b2dce95435fd71948fa6ff9de1fa2c664fbf1c37d2e920aaf67e039a4"}},{"ruleId":"D1","level":"warning","message":{"text":"chatCompletions.makeChatCompletions.postChatCompletions (cyclomatic 17): chatCompletions.makeChatCompletions.postChatCompletions 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":"services/apicompletions/src/routes/chatCompletions.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b5bacfeceead92d28e19e388947f5201b7d6004f439de094bee00367b5aa03"}},{"ruleId":"D1","level":"warning","message":{"text":"chatCompletions.streamResponse (cyclomatic 17): chatCompletions.streamResponse 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":"services/apicompletions/src/routes/chatCompletions.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4a730f9902ba581137a84ec4dfd956a2ad2d095535aecc7d567dc2966d0f76"}},{"ruleId":"D1","level":"warning","message":{"text":"messages.makeMessages.postMessages (cyclomatic 17): messages.makeMessages.postMessages 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":"services/apicompletions/src/routes/messages.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7f1d76fbf005a5ec2331f62246c2ee981e671a08a85052ae30ed6391cb3567"}},{"ruleId":"D1","level":"warning","message":{"text":"cost-pareto.html.renderCalc (cyclomatic 16): cost-pareto.html.renderCalc 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, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web-ui/public/cost-pareto.html"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d69214bdf1abfbdc0ff4457787496f5b46e76a2ada25c2e42ce58c28422d00"}},{"ruleId":"D1","level":"warning","message":{"text":"verify.mcpServerPresent (cyclomatic 16): verify.mcpServerPresent 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":"apps/web-ui/src/generator/verify.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be76ad27ea363e17392a4f359b88576de3fbcc25c8b9c2108d242fe0efa1aa0"}},{"ruleId":"D1","level":"warning","message":{"text":"BenchmarkPlanner.propose (cyclomatic 16): BenchmarkPlanner.propose has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3-bench/src/bench-planner.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"d55f5cca9544999f8735fe23b4089dee982a133c74936920bf9eb2f3a615a773"}},{"ruleId":"D1","level":"warning","message":{"text":"auth.authenticate (cyclomatic 16): auth.authenticate 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/arc-agi-3-chatgpt/src/auth.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c607078fcb5eb907e84421a0ec47737c4dcfe5166d1a36a9ab64c4e8c61b52"}},{"ruleId":"D1","level":"warning","message":{"text":"official-factory.scorecardRuns (cyclomatic 16): official-factory.scorecardRuns 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/arc-agi-3-chatgpt/src/official-factory.ts"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"095b70353aece9425056557bc9e4497a20bb9b5c3a10fca254514ea83ec79888"}},{"ruleId":"D1","level":"warning","message":{"text":"canonical.toSafeJson (cyclomatic 16): canonical.toSafeJson 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/arc-agi-3/src/canonical.ts"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c2c5dd03d274b30063b70fd24059e12a6d7ef0c3f204984289ae9f680f1210d"}},{"ruleId":"D1","level":"warning","message":{"text":"canonical.validateExactGridFrame (cyclomatic 16): canonical.validateExactGridFrame 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, 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/arc-agi-3/src/canonical.ts"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaaf66d3a5818f0c3a3dc8995365add403da99ecc78f4fd8daadb48c4764f689"}},{"ruleId":"D1","level":"warning","message":{"text":"receipts.verifyTransitionReceipts (cyclomatic 16): receipts.verifyTransitionReceipts 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, 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/arc-agi-3/src/receipts.ts"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3600fa9df56bd2f6f497a295a28d57029ccdcc369b849c24fff150b7b631dd"}},{"ruleId":"D1","level":"warning","message":{"text":"learn.parseLearnArgs (cyclomatic 16): learn.parseLearnArgs 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/create-agent-harness/src/learn.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"357d9e4ea2055ef4e9abce4f7f64d7ca66b4ba3806ca58c2f60ceaf00857946a"}},{"ruleId":"D1","level":"warning","message":{"text":"wizard.runWizard (cyclomatic 16): wizard.runWizard 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/create-agent-harness/src/wizard.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe0a55a40aac89f0c5a49a04ec84de277ca0ff49f63379e5aae8ec5bf0806475"}},{"ruleId":"D1","level":"warning","message":{"text":"score.scoreMcpSafety (cyclomatic 16): score.scoreMcpSafety 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/create-agent-harness/src/score.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2e85e524b20b7ff723ac9121d09381521d6a4e27fc6bdabe62750e191324eb5"}},{"ruleId":"D1","level":"warning","message":{"text":"safety.inspectVariant (cyclomatic 16): safety.inspectVariant 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/darwin-mode/src/safety.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e0cee1ebf990a773554d40dafa1c43db31ce260824b4cd90e998e4d73b9f43c"}},{"ruleId":"D1","level":"warning","message":{"text":"classifier.heuristicClassifier (cyclomatic 16): classifier.heuristicClassifier 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/evals-toolcall/src/classifier.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa4dff5acc6431a77f0a0ac356aac3bc876693a3bdc26c211e89a216a3e4dadb"}},{"ruleId":"D1","level":"warning","message":{"text":"gate.meetsPromotionRule (cyclomatic 16): gate.meetsPromotionRule 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/flywheel/src/gate.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc3756e2cdc0f86ba4beada9eef8578556117f916f5c9a8bbe8f1c4116f7cc48"}},{"ruleId":"D1","level":"warning","message":{"text":"reward-hack.detectRewardHack (cyclomatic 16): reward-hack.detectRewardHack 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/weight-eft/src/reward-hack.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ffd32b87b183f635b2df5502140e9d6d481eca0a7a3b0be91b61615101ae22"}},{"ruleId":"D1","level":"warning","message":{"text":"inflight.streamInflight (cyclomatic 16): inflight.streamInflight 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":"services/apicompletions/src/midstream/inflight.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"b64ecc664e4f387a7be4e0641eda8beb5d2cf402e0fa12a3e582c39fbc3b395f"}},{"ruleId":"D1","level":"warning","message":{"text":"analyze2.main (cyclomatic 16): analyze2.main 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/research/retort-placement/analyze2.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"628f0a2cfa3e7dcc20b6a9ed4614032dddce52cd954ff825e39ce1be5527a9a1"}},{"ruleId":"D1","level":"warning","message":{"text":"Genome::mutate (cyclomatic 16): Genome::mutate has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/poker-darwin/src/darwin.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"174a032c5c0d3392f61af3ab60709275ef4e70f8d935d799debff589675e8068"}},{"ruleId":"D1","level":"warning","message":{"text":"k3rs::main (cyclomatic 16): k3rs::main 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":"kimi-k3-harness/crates/k3rs/src/main.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"7040fb5def2354e1b2f3070a3c1331e224c4f736c1eeee19b8347a936263fd24"}},{"ruleId":"D1","level":"warning","message":{"text":"k3rs::model::decoder_layer (cyclomatic 16): k3rs::model::decoder_layer has cyclomatic complexity 16 (threshold 15). 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":"kimi-k3-harness/crates/k3rs/src/model.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"387b0ba083ef291da4ed24c9d0ca233fb53d002b85ffcc53991301b39fbe27b5"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::stmt (cyclomatic 16): Parser::stmt 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/oo-agents/crate/src/lib.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a21ed5981d97554b0466d1f47737bf57a551349168c65d7a0430dc940f746d5"}},{"ruleId":"D2","level":"warning","message":{"text":"sim.runSim (cognitive 191): sim.runSim has cognitive complexity 191 (threshold 15). Drivers by points: if/else 60 (158 pts), loops 29 (77 pts), boolean chains 20, ternaries 5 (10 pts) (nesting depth added 151). 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 (sim.runSim::applyFold) 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/radio/src/sim.ts"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8d3a321fc00092ac6cad1a9f72e0a2f0d9a074996e268160310511576aeae3"}},{"ruleId":"D2","level":"warning","message":{"text":"meta-proxy-service.enableMetaProxyService (cognitive 146): meta-proxy-service.enableMetaProxyService has cognitive complexity 146 (threshold 15). Drivers by points: if/else 29 (102 pts), ternaries 7 (22 pts), boolean chains 21, loops 1 (nesting depth added 88). Of this number, 145 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/create-agent-harness/src/meta-proxy-service.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a6e4487cd4e37e7f5667b0cdb77fddd7d9cb2dc0e9ba88060034c1ab8cbe0a5"}},{"ruleId":"D2","level":"warning","message":{"text":"checkpoint.validateSupervisorState (cognitive 126): checkpoint.validateSupervisorState has cognitive complexity 126 (threshold 15). Drivers by points: if/else 40 (78 pts), boolean chains 33, loops 7 (10 pts), ternaries 3 (5 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/arc-agi-3/src/checkpoint.ts"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a40bf4ca988eccebe6b15cbb4fdfda752266b51eabe025c6e89cff11dbb433d"}},{"ruleId":"D2","level":"warning","message":{"text":"evolve.evolve (cognitive 125): evolve.evolve has cognitive complexity 125 (threshold 15). Drivers by points: if/else 22 (55 pts), ternaries 14 (46 pts), loops 6 (15 pts), boolean chains 9 (nesting depth added 74). Of this number, 100 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/darwin-mode/src/evolve.ts"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a3fe0991ae1cb1cd0c21fde6cc96e63f8e0a8804adc18f2d6c5721b0e9ceae0"}},{"ruleId":"D2","level":"warning","message":{"text":"production-run.runProductionFlywheel (cognitive 124): production-run.runProductionFlywheel has cognitive complexity 124 (threshold 15). Drivers by points: ternaries 18 (50 pts), if/else 20 (40 pts), boolean chains 21, loops 4 (7 pts), error handling 2 (6 pts) (nesting depth added 59). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flywheel/src/production-run.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f1db933793d05bcea9d8e601edf78f968916c9e222ac687d4ada3edf7c8d2f"}},{"ruleId":"D2","level":"warning","message":{"text":"Vm::builtin (cognitive 98): Vm::builtin has cognitive complexity 98 (threshold 15). Drivers by points: match/switch 25 (54 pts), if/else 15 (34 pts), loops 3 (9 pts), boolean chains 1 (nesting depth added 54). 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/oo-agents/crate/src/lib.rs"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"917c24d9b06be5153fa4dbe7ce4037f81d5c881428f1bb540c3cc2d28681f275"}},{"ruleId":"D2","level":"warning","message":{"text":"meta-proxy.metaProxyCmd (cognitive 92): meta-proxy.metaProxyCmd has cognitive complexity 92 (threshold 15). Drivers by points: ternaries 24 (60 pts), if/else 20 (28 pts), boolean chains 4 (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"0733cda9502d495881644823001bd3a001f0222e7835edd05b694381dca97ba4"}},{"ruleId":"D2","level":"warning","message":{"text":"numeric-evolve.evolveNumeric (cognitive 90): numeric-evolve.evolveNumeric has cognitive complexity 90 (threshold 15). Drivers by points: if/else 20 (44 pts), ternaries 7 (19 pts), loops 7 (17 pts), boolean chains 6, error handling 1 (4 pts) (nesting depth added 49). Of this number, 86 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/darwin-mode/src/numeric-evolve.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f67fd19796c0e871425faaa97130682fb8f3483bdb48a2c93a7678eb0cf1101"}},{"ruleId":"D2","level":"warning","message":{"text":"field-memory.parseRecord (cognitive 90): field-memory.parseRecord has cognitive complexity 90 (threshold 15). Drivers by points: if/else 57 (64 pts), boolean chains 20, loops 5 (6 pts) (nesting depth added 8). Of this number, 40 points are the body\u0027s own statements and 50 belong to 13 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/field-memory/src/field-memory.ts"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"a189df018f3d448380931d6343b3de3896e4e4c47367d10ceabd324f0a8a1955"}},{"ruleId":"D2","level":"warning","message":{"text":"GovernedVariationOperator.run (cognitive 88): GovernedVariationOperator.run has cognitive complexity 88 (threshold 15). Drivers by points: if/else 30 (59 pts), boolean chains 14, ternaries 4 (8 pts), error handling 1 (5 pts), loops 2 (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/avo/src/operator.ts"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c4bf7d72fc07df7c8099f31e07eb2adf081996fa0107e75389a8c3194eb3a7"}},{"ruleId":"D2","level":"warning","message":{"text":"production-replay.verifyProductionBindings (cognitive 87): production-replay.verifyProductionBindings has cognitive complexity 87 (threshold 15). Drivers by points: if/else 30 (56 pts), boolean chains 27, loops 3, error handling 1 (nesting depth added 26). Of this number, 85 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/flywheel/src/production-replay.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b0aecc20faf8990540f6e5dc4ec6653272f5a2c92f01e0a0f1ad7bff53d4bd7"}},{"ruleId":"D2","level":"warning","message":{"text":"multigeneration-proof.verifyMultiGenerationEvidence (cognitive 86): multigeneration-proof.verifyMultiGenerationEvidence has cognitive complexity 86 (threshold 15). Drivers by points: if/else 33 (60 pts), boolean chains 14, ternaries 3 (6 pts), loops 3 (5 pts), error handling 1 (nesting depth added 32). 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/flywheel/src/multigeneration-proof.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd31f9f64eb4c6041ef8468db75219e37931eaf8596e1211ace1756e52c18741"}},{"ruleId":"D2","level":"warning","message":{"text":"index.renderScaffold (cognitive 83): index.renderScaffold has cognitive complexity 83 (threshold 15). Drivers by points: if/else 25 (47 pts), error handling 5 (13 pts), loops 5 (12 pts), boolean chains 10, ternaries 1 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/index.ts"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a68e794201304e2464c045f65723966a396b7e94acdfa5ec4ca315725b6c0e2"}},{"ruleId":"D2","level":"warning","message":{"text":"completion.verifyCompletionCertificate (cognitive 83): completion.verifyCompletionCertificate has cognitive complexity 83 (threshold 15). Drivers by points: if/else 27 (63 pts), boolean chains 9, loops 5 (6 pts), ternaries 1 (3 pts), error handling 1 (2 pts) (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/horizon/src/completion.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"741d42e38071bebeebffe6aee4ee34c3b085fd6c011cc5ea8adede2d825ccd67"}},{"ruleId":"D2","level":"warning","message":{"text":"meta-proxy-service.disableMetaProxyService (cognitive 82): meta-proxy-service.disableMetaProxyService has cognitive complexity 82 (threshold 15). Drivers by points: if/else 18 (42 pts), ternaries 10 (29 pts), boolean chains 11 (nesting depth added 43). 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/create-agent-harness/src/meta-proxy-service.ts"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"7781a2994831e0f1e7e9eae8a2a60318e63abaa8fb7853abcf150ea99660ff73"}},{"ruleId":"D2","level":"warning","message":{"text":"replay.verifyReplayBundle (cognitive 74): replay.verifyReplayBundle has cognitive complexity 74 (threshold 15). Drivers by points: if/else 23 (46 pts), boolean chains 12, loops 4 (7 pts), ternaries 4 (7 pts), error handling 1 (2 pts) (nesting depth added 30). Of this number, 72 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/flywheel/src/replay.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"152174dcbdfeeaf82acf5f22f299fcf8e6da1eb16fa384fbe541114a06cb666c"}},{"ruleId":"D2","level":"warning","message":{"text":"ArcPlanArchive.load (cognitive 73): ArcPlanArchive.load has cognitive complexity 73 (threshold 15). Drivers by points: if/else 17 (28 pts), boolean chains 21, loops 9 (12 pts), error handling 5 (8 pts), ternaries 2 (4 pts) (nesting depth added 19). Of this number, 67 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/arc-agi-3/src/plan-archive.ts"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee52f380c3d2ddda4e9f2fcd78ed2109aa3071a1fae6761caeae43656a44e67a"}},{"ruleId":"D2","level":"warning","message":{"text":"ArcPlanArchive.addCandidates (cognitive 72): ArcPlanArchive.addCandidates has cognitive complexity 72 (threshold 15). Drivers by points: if/else 22 (46 pts), boolean chains 13, loops 5 (8 pts), ternaries 2 (4 pts), error handling 1 (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/arc-agi-3/src/plan-archive.ts"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa6a0997e441ddb6c79ac1297084ab0c4777dccc8ba48b2152fbcc54b602da6"}},{"ruleId":"D2","level":"warning","message":{"text":"safety-ast.analyzeSurfaceSource::visit (cognitive 70): safety-ast.analyzeSurfaceSource::visit has cognitive complexity 70 (threshold 15). Drivers by points: if/else 20 (45 pts), boolean chains 15, loops 4 (8 pts), match/switch 1, ternaries 1 (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/darwin-mode/src/safety-ast.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac66aa1f4785619a25af979177f39d513152e6c2fe7dbb20ce3053c1cd050bdf"}},{"ruleId":"D2","level":"warning","message":{"text":"run.runFlywheelGenerations (cognitive 63): run.runFlywheelGenerations has cognitive complexity 63 (threshold 15). Drivers by points: ternaries 13 (36 pts), if/else 8 (11 pts), loops 4 (7 pts), boolean chains 6, error handling 1 (3 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flywheel/src/run.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"17cac82c2de9e2a5b3c2a83efb2beb3f874cd0a4552db2b53f1c64b0330002a9"}},{"ruleId":"D2","level":"warning","message":{"text":"verify.verifyFileMap (cognitive 60): verify.verifyFileMap has cognitive complexity 60 (threshold 15). Drivers by points: if/else 26 (37 pts), boolean chains 13, error handling 4 (7 pts), ternaries 3 (nesting depth added 14). Of this number, 56 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":"apps/web-ui/src/generator/verify.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"49578b5de344ef8d67602617fc1f3b2004a855b14418cca854010a8f2670d574"}},{"ruleId":"D2","level":"warning","message":{"text":"official-factory.createOfficialArcControllerFactory (cognitive 59): official-factory.createOfficialArcControllerFactory has cognitive complexity 59 (threshold 15). Drivers by points: boolean chains 32, if/else 19 (20 pts), ternaries 5, error handling 1, loops 1 (nesting depth added 1). Of this number, 38 points are the body\u0027s own statements and 21 belong to 14 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/arc-agi-3-chatgpt/src/official-factory.ts"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef5cc98010f45da8f95f18d71747a0749ca456e3bb9ce6bdfd8a7555939c0e7"}},{"ruleId":"D2","level":"warning","message":{"text":"k3rs::json::value (cognitive 56): k3rs::json::value has cognitive complexity 56 (threshold 15). Drivers by points: if/else 11 (21 pts), match/switch 6 (17 pts), loops 5 (13 pts), boolean chains 5 (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":"kimi-k3-harness/crates/k3rs/src/json.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"c53254dc3e0cbfeaedd6d9964741a4f80d5d52cae27650eaaad45ab9bfef3dc4"}},{"ruleId":"D2","level":"warning","message":{"text":"ooa_cell_vm::lex (cognitive 54): ooa_cell_vm::lex has cognitive complexity 54 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 6 (18 pts), match/switch 4 (14 pts), boolean chains 4 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/oo-agents/crate/src/lib.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18f3871add32a4371ae96ad386a959164698a6137fce05e4835eaf11c510ab6"}},{"ruleId":"D2","level":"warning","message":{"text":"BridgeService.dispatch (cognitive 53): BridgeService.dispatch has cognitive complexity 53 (threshold 15). Drivers by points: if/else 22 (37 pts), boolean chains 7, error handling 1 (4 pts), loops 1 (3 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/arc-agi-3/python/bridge.py"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff98c56f161cf9a086a8b1e0e117c6ce8894cf7314ec3f4e4b42c828ac8b5c0"}},{"ruleId":"D2","level":"warning","message":{"text":"FieldMemory.choose (cognitive 52): FieldMemory.choose has cognitive complexity 52 (threshold 15). Drivers by points: if/else 13 (27 pts), loops 5 (10 pts), boolean chains 9, ternaries 4 (6 pts) (nesting depth added 21). Of this number, 50 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/field-memory/src/field-memory.ts"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d3941c2fefaf964c32599e9f4841784b4aabd5a960eb4ed00f740a4c3f1b0a"}},{"ruleId":"D2","level":"warning","message":{"text":"schema.validate (cognitive 52): schema.validate has cognitive complexity 52 (threshold 15). Drivers by points: if/else 13 (34 pts), loops 3 (8 pts), boolean chains 5, ternaries 2 (4 pts), match/switch 1 (nesting depth added 28). 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/oo-agents/src/schema.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"d47b7d29f5aaad4ca8af0f65ad9e1b150f1453bb74821910c4505754d98ec5d1"}},{"ruleId":"D2","level":"warning","message":{"text":"claim-gate.verifyEvidenceBundle (cognitive 51): claim-gate.verifyEvidenceBundle has cognitive complexity 51 (threshold 15). Drivers by points: if/else 23 (43 pts), boolean chains 6, loops 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/avo/src/claim-gate.ts"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"bde745eb597787c0557acfd47f9e654753ef51c1fd97892d261e5e7a8fc572a5"}},{"ruleId":"D2","level":"warning","message":{"text":"belief-graph.validateBeliefGraphSnapshot (cognitive 46): belief-graph.validateBeliefGraphSnapshot has cognitive complexity 46 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 16, loops 4 (7 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/arc-agi-3/src/belief-graph.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"9866b6bad75586c8b3047fcdfbd283fec234caa85de5bb937c5ea1786bdb9309"}},{"ruleId":"D2","level":"warning","message":{"text":"checkpoint.validateCheckpointCrossFields (cognitive 46): checkpoint.validateCheckpointCrossFields has cognitive complexity 46 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 14, ternaries 3 (9 pts), loops 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3/src/checkpoint.ts"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41dc3509dd6fa6d956806a374b7f642d030f9390a563f3ff8bf8b73c2e08d74"}},{"ruleId":"D2","level":"warning","message":{"text":"ArcAvoLoop.#stepCritical (cognitive 46): ArcAvoLoop.#stepCritical has cognitive complexity 46 (threshold 15). Drivers by points: if/else 12 (24 pts), ternaries 7 (13 pts), boolean chains 4, error handling 2 (3 pts), loops 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3/src/avo-loop.ts"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"59fc765615c90018861dfaa2e057cd849a8aae4f0880e1aa01a6dae8225b1d9c"}},{"ruleId":"D2","level":"warning","message":{"text":"repo-scorecard.scoreRepoCmd (cognitive 44): repo-scorecard.scoreRepoCmd has cognitive complexity 44 (threshold 15). Drivers by points: ternaries 9 (20 pts), if/else 9 (15 pts), boolean chains 5, error handling 2 (3 pts), loops 1 (nesting depth added 18). Of this number, 40 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/create-agent-harness/src/repo-scorecard.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2bba30f1ae6beca40f619d57fe064c81885717269008c04f0e0319dabe9479"}},{"ruleId":"D2","level":"warning","message":{"text":"receipts.validateTransitionReceiptSchema (cognitive 43): receipts.validateTransitionReceiptSchema has cognitive complexity 43 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 19, loops 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3/src/receipts.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b5a3931fc47b73f45a444538881a4d8b2902bed71c0bd5790372b6bb532ff3"}},{"ruleId":"D2","level":"warning","message":{"text":"canonical.validateExpectation (cognitive 42): canonical.validateExpectation has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 17, 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/arc-agi-3/src/canonical.ts"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"67920a7087e631ff3637a1856a59ddd1eb83276948b5cab0c68f056b7df1c4b9"}},{"ruleId":"D2","level":"warning","message":{"text":"lib.runSeed (cognitive 41): lib.runSeed has cognitive complexity 41 (threshold 15). Drivers by points: loops 13 (22 pts), ternaries 4 (12 pts), if/else 2 (6 pts), boolean chains 1 (nesting depth added 21). 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":"experiments/router-calibration-loop/lib.mjs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"405fc5a2c8f1cd80ce849e179898eb5364adc43dbb8db729e23306f4945064b3"}},{"ruleId":"D2","level":"warning","message":{"text":"engine.runContrastive (cognitive 41): engine.runContrastive has cognitive complexity 41 (threshold 15). Drivers by points: if/else 18 (20 pts), boolean chains 10, ternaries 4 (6 pts), error handling 4, loops 1 (nesting depth added 4). Most of this is not in the body itself: 13 of the 41 points are its own statements and the rest belongs to 8 function items inside it that branch (invoke, consider, a function literal at line 70, \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/darwin-mode/src/contrastive/engine.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba4afdad2d3ef8523c7a2d99d2d289cee23613798cc97b4dd8c8b4845485eba"}},{"ruleId":"D2","level":"warning","message":{"text":"audit-cmd.auditCmd (cognitive 40): audit-cmd.auditCmd has cognitive complexity 40 (threshold 15). Drivers by points: if/else 16 (24 pts), ternaries 5 (7 pts), error handling 4 (6 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/create-agent-harness/src/audit-cmd.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3db91fed9204869648ca88bf3ae3f39e42206515589396bc57c244854cade5"}},{"ruleId":"D2","level":"warning","message":{"text":"index.main (cognitive 39): index.main has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (22 pts), ternaries 4 (7 pts), loops 3 (5 pts), boolean chains 4, 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/create-agent-harness/src/index.ts"},"region":{"startLine":1113}}}],"partialFingerprints":{"codehealthFindingId/v1":"7502b09ccf8b53c078ab9980673fcf13e61fc2e02c78895d514f6d783ca41a81"}},{"ruleId":"D2","level":"warning","message":{"text":"reward-hack.toolResponses (cognitive 39): reward-hack.toolResponses has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (27 pts), loops 4 (7 pts), boolean chains 5 (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/weight-eft/src/reward-hack.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ea265548bf997da3ac441afe5ecb8b822e2f649a8de31cd75493bb5c4ce34b"}},{"ruleId":"D2","level":"warning","message":{"text":"cost-pareto.html.render (cognitive 38): cost-pareto.html.render has cognitive complexity 38 (threshold 15). Drivers by points: ternaries 9 (19 pts), if/else 8 (11 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 14). Of this number, 32 points are the body\u0027s own statements and 6 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":"apps/web-ui/public/cost-pareto.html"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"63db8505e465f125b294bee9ad158a8528631604b52d4f5d4af2aa420c0294e7"}},{"ruleId":"D2","level":"warning","message":{"text":"supervisor.commitTypedSupervisorDirective (cognitive 38): supervisor.commitTypedSupervisorDirective has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 16, loops 1 (2 pts), ternaries 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/arc-agi-3/src/supervisor.ts"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e5205a8761d661e0f82e4975febb8ee572b57b49928b1d4f9160707911f01f"}},{"ruleId":"D2","level":"warning","message":{"text":"memory.retrieveContrastiveExperiences (cognitive 38): memory.retrieveContrastiveExperiences has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 10, loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 14). 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/darwin-mode/src/contrastive/memory.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"052dd4fc33f3a27967cf2c710e64d5854ecd5a434987c1d43894f8096aa4cea7"}},{"ruleId":"D2","level":"warning","message":{"text":"sim.runSim::applyFold (cognitive 38): sim.runSim::applyFold has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (24 pts), ternaries 2 (7 pts), boolean chains 4, loops 2 (3 pts) (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: one other method here (sim.runSim) 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/radio/src/sim.ts"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"308e9f6d110153b46ec312405b7b47e40bb0a02c152b65aec7418b1e21823fbd"}},{"ruleId":"D2","level":"warning","message":{"text":"k3rs::model::kda_layer (cognitive 38): k3rs::model::kda_layer has cognitive complexity 38 (threshold 15). Drivers by points: loops 16 (35 pts), if/else 2, boolean chains 1 (nesting depth added 19). 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":"kimi-k3-harness/crates/k3rs/src/model.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"23bc24487a819140f924de6d4767b76cd73852019c038cd753ac940da3df3176"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::primary (cognitive 38): Parser::primary has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 3 (10 pts), match/switch 2 (5 pts) (nesting depth added 25). 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/oo-agents/crate/src/lib.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb6ee281ab0fed4320062105467aeaf6e9fee7f251f30890344700237b01767e"}},{"ruleId":"D2","level":"warning","message":{"text":"ooa_cell_vm::jval (cognitive 38): ooa_cell_vm::jval has cognitive complexity 38 (threshold 15). Drivers by points: match/switch 6 (17 pts), loops 5 (12 pts), if/else 3 (7 pts), boolean chains 2 (nesting depth added 22). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/oo-agents/crate/src/lib.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3daa9912b9c266cf623f920c4423a606ae3307b789171917b1e302ef791fda4"}},{"ruleId":"D2","level":"warning","message":{"text":"genome.genomeCmd (cognitive 37): genome.genomeCmd has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (16 pts), ternaries 3 (10 pts), boolean chains 8, 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/create-agent-harness/src/genome.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"624f5855837854f8d1b86b52bcbe8bb467f2a3122e66dc65e193ded64d0e901f"}},{"ruleId":"D2","level":"warning","message":{"text":"index.parseArgs (cognitive 37): index.parseArgs has cognitive complexity 37 (threshold 15). Drivers by points: if/else 20 (24 pts), boolean chains 8, loops 2 (5 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/create-agent-harness/src/index.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"039606db24d6bc36a67a26f2454510bc22d85cd668f28ab968d27d526ea76473"}},{"ruleId":"D2","level":"warning","message":{"text":"score.scoreCmd (cognitive 37): score.scoreCmd has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (16 pts), ternaries 3 (10 pts), boolean chains 8, 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/create-agent-harness/src/score.ts"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"441232e4f37d6ca6fb358d48bf8f54a9f6ad05ace8d4b06eca5627228e9f89de"}},{"ruleId":"D2","level":"warning","message":{"text":"threat-model.threatModelCmd (cognitive 37): threat-model.threatModelCmd has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (16 pts), ternaries 3 (10 pts), boolean chains 8, 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/create-agent-harness/src/threat-model.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"582619db0e135460b09c263579b18d7dc40e2e562bbdfdfe1ca020f0a386ef88"}},{"ruleId":"D2","level":"warning","message":{"text":"EscalationScheduler.run (cognitive 37): EscalationScheduler.run has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (31 pts), boolean chains 3, loops 2 (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/projects/src/scheduler.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c558c86290be15edd1f173269813078d9d2bc3b5fdf581c1650279f1a7eb17"}},{"ruleId":"D2","level":"warning","message":{"text":"h1-submit.gatedSubmit (cognitive 37): h1-submit.gatedSubmit has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (19 pts), ternaries 9 (13 pts), boolean chains 4, 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, 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/redblue/src/integrations/h1-submit.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e73f108628145df60587386b4d90fdece3115e001e064840ccec87fca1b4448"}},{"ruleId":"D2","level":"warning","message":{"text":"Vm::eval (cognitive 37): Vm::eval has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (20 pts), match/switch 5 (9 pts), loops 4 (8 pts) (nesting depth added 19). 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/oo-agents/crate/src/lib.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"3795b527be09bb6dcd2b6b31be5771e20d7fc4e9e02f10d9af5a63e9ceed5606"}},{"ruleId":"D2","level":"warning","message":{"text":"checkpoint.validateCheckpointSchema (cognitive 36): checkpoint.validateCheckpointSchema has cognitive complexity 36 (threshold 15). Drivers by points: if/else 20, boolean chains 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/arc-agi-3/src/checkpoint.ts"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01d01c9636d8e59c9a5a633ed85dde8f798d7f1bbaff6861c774ac644d96fb3"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp-scan.scanMcp (cognitive 36): mcp-scan.scanMcp has cognitive complexity 36 (threshold 15). Drivers by points: if/else 17 (27 pts), boolean chains 8, loops 1 (nesting depth added 10). 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/create-agent-harness/src/mcp-scan.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c1f3672e6c647c783b913012011e8fa2c67b281224fce957427e9f3747a7dd"}},{"ruleId":"D2","level":"warning","message":{"text":"EvidenceBackedMemory.commit (cognitive 35): EvidenceBackedMemory.commit has cognitive complexity 35 (threshold 15). Drivers by points: boolean chains 18, if/else 14 (15 pts), loops 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/arc-agi-3/src/memory.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5180805b8d9aa02dc8b555e707b42f385ca5a1228f75759dd57b8a873bf6a90"}},{"ruleId":"D2","level":"warning","message":{"text":"subcommands.doctor (cognitive 35): subcommands.doctor has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 10, error handling 4 (8 pts), ternaries 1 (nesting depth added 7). Of this number, 33 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/subcommands.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34515d3eb12354f926de95be9232ee441231c60e12d201fa027c3dd1ed1cb27"}},{"ruleId":"D2","level":"warning","message":{"text":"metric.analyzeTranscript (cognitive 35): metric.analyzeTranscript has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (31 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/darwin-mode/src/gepa/metric.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5daac1ff88c0cff5f2e1d3cadecbff25f9b396514d0d9664936e0e4c0415684"}},{"ruleId":"D2","level":"warning","message":{"text":"evaluator.makeToolcallEvaluator.evaluate (cognitive 35): evaluator.makeToolcallEvaluator.evaluate has cognitive complexity 35 (threshold 15). Drivers by points: ternaries 6 (16 pts), if/else 4 (10 pts), loops 3 (6 pts), boolean chains 3 (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/evals-toolcall/src/evaluator.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"300f5ced20a122ed767340e472fa2c944758ce19c0ed7c0f5908ef1b789d5f52"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::postfix (cognitive 35): Parser::postfix has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 3 (11 pts), loops 2 (6 pts) (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/oo-agents/crate/src/lib.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5dea7b29f492ab2f6410c03fe2dd56321690558c22a441cd97ee33039720589"}},{"ruleId":"D2","level":"warning","message":{"text":"operator.snapshotAgentJson (cognitive 34): operator.snapshotAgentJson has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (23 pts), boolean chains 8, 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/avo/src/operator.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ddc647290f4bac58f45247190c934bad8255df58d64266e6de27c90987e2bf"}},{"ruleId":"D2","level":"warning","message":{"text":"upgrade.applyPlan (cognitive 34): upgrade.applyPlan has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 5, loops 5, ternaries 1 (4 pts), error handling 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/create-agent-harness/src/upgrade.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd1b41a99f16090892c4ca64b2f1cf7ee0dbac70837d225a90c190ce5f0c733"}},{"ruleId":"D2","level":"warning","message":{"text":"session.parseLog (cognitive 34): session.parseLog has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (28 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/kernel-js/src/session.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"693de136c999e98944baaaf56e3c93bc2ecd61f89d5cc5cbb29b340a829cf68c"}},{"ruleId":"D2","level":"warning","message":{"text":"k3rs::model::mla_layer (cognitive 34): k3rs::model::mla_layer has cognitive complexity 34 (threshold 15). Drivers by points: loops 10 (28 pts), if/else 2 (6 pts) (nesting depth added 22). 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":"kimi-k3-harness/crates/k3rs/src/model.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a1375b63b0ea8e44e98da57a20fc91369269652614169174d7edef617d6ba2"}},{"ruleId":"D2","level":"warning","message":{"text":"generated-runtime.integrateGeneratedRuntime (cognitive 33): generated-runtime.integrateGeneratedRuntime has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 2 (5 pts), boolean chains 3 (nesting depth added 17). 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, 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/create-agent-harness/src/generated-runtime.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"737a31b38b2dc5394685f68d489823382f0a68c4f4f87308e9f78b1c0af20d00"}},{"ruleId":"D2","level":"warning","message":{"text":"normalizer.canonValue (cognitive 33): normalizer.canonValue has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (17 pts), ternaries 4 (12 pts), boolean chains 3, match/switch 1 (nesting depth added 18). 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/evals-extract/src/normalizer.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"de80d4afbaf4b045fbb09206133130e19de7f088368350883b7b534c80f7b801"}},{"ruleId":"D2","level":"warning","message":{"text":"analyze4.main (cognitive 33): analyze4.main has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 8 (14 pts), loops 7 (9 pts), if/else 5 (6 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":"docs/research/retort-placement/analyze4.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b65f1a50cad1e43f433b01c35741d91dfc106c692f886bded427a768b8add68"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.dispatch (cognitive 32): cli.dispatch has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 5 (13 pts), if/else 6 (12 pts), error handling 2 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 16). 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/avo/src/cli.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa165f99e4033d394db4a8bd34a3bbda0c62213256c26942d66980218664ffd"}},{"ruleId":"D2","level":"warning","message":{"text":"agentic.runRepo (cognitive 32): agentic.runRepo has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 5 (14 pts), loops 2 (3 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/darwin-mode/src/security/agentic.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"12302e9b986215d966365cada85180d94e5f584de581aab466c8a1cbe0d38e35"}},{"ruleId":"D2","level":"warning","message":{"text":"production-gate.createProductionManifest (cognitive 32): production-gate.createProductionManifest has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 11, loops 2 (3 pts), ternaries 3 (nesting depth added 5). Of this number, 26 points are the body\u0027s own statements and 6 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/flywheel/src/production-gate.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e138dff1a5e42c9cba3c4b8e20f9f8a8f65de6a7fa4208b96eddb0afc5b0d34"}},{"ruleId":"D2","level":"warning","message":{"text":"reward-hack.detectRewardHack (cognitive 32): reward-hack.detectRewardHack has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 6 (12 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/weight-eft/src/reward-hack.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c4d40f2a9eaed4c0e3c60d42f2c19aba2199831ab92fd050be4c7a94875096"}},{"ruleId":"D2","level":"warning","message":{"text":"export.exportTrainingData (cognitive 32): export.exportTrainingData has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 6, boolean chains 2, ternaries 1 (2 pts) (nesting depth added 11). 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/weight-eft/src/export.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"b593f88fafaf62b250bd06fff29c916f54d616e26a3ff16db6b8bc360234a1b7"}},{"ruleId":"D2","level":"warning","message":{"text":"ArcEpisodeStore.resumePersisted (cognitive 31): ArcEpisodeStore.resumePersisted has cognitive complexity 31 (threshold 15). Drivers by points: if/else 18 (26 pts), error handling 3 (5 pts) (nesting depth added 10). Most of this is not in the body itself: 3 of the 31 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 939, 991). 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/arc-agi-3-chatgpt/src/store.ts"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"9639972b37d29e9ed8947861220cbf020ac4abede7e48c826d2433b7f7437b9e"}},{"ruleId":"D2","level":"warning","message":{"text":"ArcAvoLoop.#persistRuleEvidence (cognitive 31): ArcAvoLoop.#persistRuleEvidence has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 6 (14 pts), if/else 6 (8 pts), loops 4 (5 pts), boolean chains 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3/src/avo-loop.ts"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15b80e1b43250cf43013042f00c537be977fb13d41c5f89356acacd037f685d"}},{"ruleId":"D2","level":"warning","message":{"text":"analyze3.main (cognitive 31): analyze3.main has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 8 (10 pts), ternaries 4 (8 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":"docs/research/retort-placement/analyze3.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"81620e531cc53d38aed2b5ff78cd6f8c9b1ad3a8e89b6bf66e09e389f190a8a3"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.parseArguments (cognitive 30): cli.parseArguments has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 6, ternaries 6, match/switch 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/arc-agi-3-bench/src/cli.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"d72f3834dd07a1c3122f559fa26e7ede0eb2cbcc4442881e69f74cb8881207eb"}},{"ruleId":"D2","level":"warning","message":{"text":"canonical.containsRawGameIdentityKey (cognitive 30): canonical.containsRawGameIdentityKey has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (20 pts), error handling 2 (5 pts), loops 2 (3 pts), boolean chains 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/arc-agi-3/src/canonical.ts"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eafe6004e590bbeed67bb4c504084ec29905d1532b8897c67f316cd2b67d62b"}},{"ruleId":"D2","level":"warning","message":{"text":"checkpoint.assertJsonPayload (cognitive 30): checkpoint.assertJsonPayload has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 8, loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3/src/checkpoint.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba49477cc12361c735369ce5c3560c8ab07be4665e6af0851b168261a4d2de1"}},{"ruleId":"D2","level":"warning","message":{"text":"analyze-repo.analyzeRepoCmd (cognitive 30): analyze-repo.analyzeRepoCmd has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 10, loops 2 (3 pts), ternaries 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/create-agent-harness/src/analyze-repo.ts"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"c426652b231bbec1f5bcb15d8cf856cf6f59d68cc320ef4515d70ce18b20a5d3"}},{"ruleId":"D2","level":"warning","message":{"text":"compare-cmd.formatReport (cognitive 30): compare-cmd.formatReport has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (25 pts), ternaries 4, 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/create-agent-harness/src/compare-cmd.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"8961733889fb7fcd128e662c4fd7e836d108e2e3dae8ad0ffd9a5dc392ac3da5"}},{"ruleId":"D2","level":"warning","message":{"text":"loader.parseYaml (cognitive 30): loader.parseYaml has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 10). Of this number, 21 points are the body\u0027s own statements and 9 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/redblue/src/config/loader.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"737db17840180b37c320c75979d5c148b7830fc6b19d347e5dbb47ca451ca2b3"}},{"ruleId":"D2","level":"warning","message":{"text":"canonical.snapshotArcJson::clone (cognitive 29): canonical.snapshotArcJson::clone has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 9, 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/arc-agi-3/src/canonical.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"c87623b86e02efb976d07802c16f6765e3c96a9383fc91588a4f9186e18a32da"}},{"ruleId":"D2","level":"warning","message":{"text":"meta-proxy-service.parseManagerState (cognitive 29): meta-proxy-service.parseManagerState has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 6 (13 pts), if/else 8 (11 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/create-agent-harness/src/meta-proxy-service.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d865ad31624729a84e015ee3dcf2c55f7eae3ea39e24fdafb28c2a73f504997"}},{"ruleId":"D2","level":"warning","message":{"text":"safety.inspectVariant (cognitive 29): safety.inspectVariant has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 4 (7 pts), error handling 3 (5 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/darwin-mode/src/safety.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"0019af8cb5b25dea71d868e3c898e30910000edcf40ea50c6f566fb587592b69"}},{"ruleId":"D2","level":"warning","message":{"text":"clade.cladeOutcomesAll (cognitive 29): clade.cladeOutcomesAll has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 4 (6 pts) (nesting depth added 13). Of this number, 18 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/darwin-mode/src/clade.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"adfe3f6269d65917bc6d38811fc60198bab98a7f18de7019750358f706ecff61"}},{"ruleId":"D2","level":"warning","message":{"text":"validation.snapshot::visit (cognitive 29): validation.snapshot::visit has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 5, 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/darwin-mode/src/contrastive/validation.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b2dd02eb51a93130a40acc562c55e2bff501dcdbc8c01b6d176a7b48f2b0ab3"}},{"ruleId":"D2","level":"warning","message":{"text":"FieldMemory.update (cognitive 29): FieldMemory.update has cognitive complexity 29 (threshold 15). Drivers by points: if/else 19 (20 pts), boolean chains 5, ternaries 2, error handling 1, loops 1 (nesting depth added 1). 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 834, 964). 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/field-memory/src/field-memory.ts"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"e35d271a07cc27998ddeb00d823d9d75954981564240d7d81f7264f36d682117"}},{"ruleId":"D2","level":"warning","message":{"text":"HackerOneClient.weaknessesFull (cognitive 29): HackerOneClient.weaknessesFull has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 6, loops 2 (3 pts), ternaries 1 (2 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/redblue/src/integrations/hackerone.ts"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a03dd2c6c98e5926ed628f338d803ca11a0c5b4247c9975674470fcd823218b"}},{"ruleId":"D2","level":"warning","message":{"text":"ArcEpisodeStore.resumeAvoPersisted (cognitive 28): ArcEpisodeStore.resumeAvoPersisted has cognitive complexity 28 (threshold 15). Drivers by points: if/else 17 (23 pts), error handling 4 (5 pts) (nesting depth added 7). Most of this is not in the body itself: 2 of the 28 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 1090, a function literal at line 1133, restore, \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/arc-agi-3-chatgpt/src/store.ts"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6b5b1fa7c25f9661caaa2fd50454579758e0993892d497e5e762f4f241e75a"}},{"ruleId":"D2","level":"warning","message":{"text":"server.createArcMcpRuntime.server (cognitive 28): server.createArcMcpRuntime.server has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 5 (12 pts), if/else 10 (11 pts), boolean chains 3, error handling 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3-chatgpt/src/server.ts"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"9509af6a6788f02c0742d12d9390d3b7ef9e3943e6882b42d65726269e24e9bb"}},{"ruleId":"D2","level":"warning","message":{"text":"ArcAvoLoop.#verifyCheckpointBindings (cognitive 28): ArcAvoLoop.#verifyCheckpointBindings has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 8, 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/arc-agi-3/src/avo-loop.ts"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba4984d7d179ae2a4bbff9151713028719e6d74004164956af74c73e860d76a"}},{"ruleId":"D2","level":"warning","message":{"text":"index.runMetaHarnessSubcommand (cognitive 28): index.runMetaHarnessSubcommand has cognitive complexity 28 (threshold 15). Drivers by points: loops 10 (20 pts), if/else 3 (6 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/create-agent-harness/src/index.ts"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c4952ab2d1cdcc3ec30a66d58d61eed5aff675c28e6b28515c9702e96a86ee4"}},{"ruleId":"D2","level":"warning","message":{"text":"FannSurrogate.fit (cognitive 28): FannSurrogate.fit has cognitive complexity 28 (threshold 15). Drivers by points: loops 7 (13 pts), if/else 7 (9 pts), boolean chains 5, error handling 1 (nesting depth added 8). 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, 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/darwin-mode/src/fann-surrogate.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0198cbcf423338361dfec38d3f45b9b720fc0f4f58d34dd11ae076ec3fbc595"}},{"ruleId":"D2","level":"warning","message":{"text":"protocol.runProtocol::runExecute (cognitive 28): protocol.runProtocol::runExecute has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 4 (7 pts), boolean chains 2, ternaries 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. This shape REPEATS in the file: one other method here (protocol.runProtocol) 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/radio/src/protocol.ts"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"c763debeeee933435266b7b93950f2150eb1728c687efdf87ec7c2dd6ab87344"}},{"ruleId":"D2","level":"warning","message":{"text":"protocol.runProtocol (cognitive 28): protocol.runProtocol has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 14 (20 pts), ternaries 9 (12 pts), boolean chains 3 (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. This shape REPEATS in the file: one other method here (protocol.runProtocol::runExecute) 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/radio/src/protocol.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a32d9ca971a8e33baf7ba171e497e58f504e9bed691e36c2522a31cf15efd7"}},{"ruleId":"D2","level":"warning","message":{"text":"ruflo_kernel::session::validate_log (cognitive 28): ruflo_kernel::session::validate_log has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (21 pts), match/switch 2 (6 pts), loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/kernel/src/session.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"247814f0e4a5ab392af036e75c85496b2cb205b60df2c258c39bd94567c3787f"}},{"ruleId":"D2","level":"warning","message":{"text":"horizon_core::extract_substitutions (cognitive 28): horizon_core::extract_substitutions has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (7 pts), match/switch 1 (4 pts), boolean chains 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/horizon/crate/src/lib.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c570af03a1293b2719edfcfab33f7001b3daef7de1c5a1cb4ae16bc5aae90f"}},{"ruleId":"D2","level":"warning","message":{"text":"Vm::exec (cognitive 28): Vm::exec has cognitive complexity 28 (threshold 15). Drivers by points: loops 5 (12 pts), match/switch 6 (10 pts), if/else 3 (6 pts) (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/oo-agents/crate/src/lib.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc6f3b68593606b639778eb76e54d8907f4557209f81eae2bb84f3d023536f2"}},{"ruleId":"D2","level":"warning","message":{"text":"claim-gate.parseManifest (cognitive 27): claim-gate.parseManifest has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 8, 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/avo/src/claim-gate.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"0860968ad208730cd23ed4e82811628a95c87d7d49d05877dce620305933b264"}},{"ruleId":"D2","level":"warning","message":{"text":"meta-proxy.installAndActivateMetaProxy (cognitive 27): meta-proxy.installAndActivateMetaProxy has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 3 (10 pts), error handling 2 (4 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/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"1802a5301cfa46817ae48a7903f6e6716a82eed2a0764075cc08771f1904e316"}},{"ruleId":"D2","level":"warning","message":{"text":"diag.buildSupportBundle (cognitive 27): diag.buildSupportBundle has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (8 pts), error handling 3 (6 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/create-agent-harness/src/diag.ts"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"af31c1c4fe6d677358e938aed50afffe23383a535b271f499f2423e05e6e5a53"}},{"ruleId":"D2","level":"warning","message":{"text":"federate.federateDispatch (cognitive 27): federate.federateDispatch has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 1 (3 pts), boolean chains 1, match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/federate.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7d67739d859b57d0d6243d9acffe596d9e85a73d46e99903b8fb8a8503f94b"}},{"ruleId":"D2","level":"warning","message":{"text":"oia-manifest.oiaManifestCmd (cognitive 27): oia-manifest.oiaManifestCmd has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 5, error handling 3 (5 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/create-agent-harness/src/oia-manifest.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49b612e0c60ac13e79d758633f74c567fb23ab67f09766c85ff77bf27e8dbae"}},{"ruleId":"D2","level":"warning","message":{"text":"swarm.runSwarm (cognitive 27): swarm.runSwarm has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 4 (7 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/darwin-mode/src/security/swarm.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2705b57f603c9cf2de7ae8d23c1f945d2e762cda6b9885466aea3842c17c343"}},{"ruleId":"D2","level":"warning","message":{"text":"loop.gepaOptimize (cognitive 27): loop.gepaOptimize has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 4 (10 pts), boolean chains 6, if/else 3 (6 pts), loops 2 (3 pts), error handling 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/darwin-mode/src/gepa/loop.ts"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c20301766446b4a2e084caa26d91394881ef73881571d9698b1ab9aeb1ac93"}},{"ruleId":"D2","level":"warning","message":{"text":"LongHorizonDriver.runLoop (cognitive 27): LongHorizonDriver.runLoop has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 6 (14 pts), if/else 4 (11 pts), boolean chains 1, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/horizon/src/driver.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc0952181508dc4d3a34a35e24a5ccaf51183627ebc3e0cb29ef4ddf766234c"}},{"ruleId":"D2","level":"warning","message":{"text":"ooa_cell_vm::to_json (cognitive 27): ooa_cell_vm::to_json has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 3 (6 pts), match/switch 2 (4 pts), boolean chains 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/oo-agents/crate/src/lib.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"0795d61b039d98e6cfa0a78ac87157c67135ddbff2d2a5501b520e1edd28cb34"}},{"ruleId":"D2","level":"warning","message":{"text":"model-driver.validateModelTurnResponse (cognitive 26): model-driver.validateModelTurnResponse has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 9 (10 pts), if/else 7 (9 pts), boolean chains 7 (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/arc-agi-3-bench/src/model-driver.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"83af2d3486be8577da6033383b25cd222a9245b2efa85d6dfc9a3e2533a22bec"}},{"ruleId":"D2","level":"warning","message":{"text":"official-factory.journalEvidence (cognitive 26): official-factory.journalEvidence has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 5, error handling 2 (3 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/arc-agi-3-chatgpt/src/official-factory.ts"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"0689dc7f8cd9239d208e9a4cbd0ac0605ff5b8f69dc107b74032f8fb32ec0d55"}},{"ruleId":"D2","level":"warning","message":{"text":"receipts.validateReceiptContinuation (cognitive 26): receipts.validateReceiptContinuation has cognitive complexity 26 (threshold 15). Drivers by points: if/else 18 (19 pts), boolean chains 7 (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/arc-agi-3/src/receipts.ts"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e4ac8404b248544799064defca28a9e5e0ec0690f41f2e588597f5e201e8011"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.main (cognitive 26): cli.main has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 13, if/else 7 (8 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/darwin-mode/src/cli.ts"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c5b02ade5939a9b6ce305e714712b49c546d966deeb444629895c5657a81d6"}},{"ruleId":"D2","level":"warning","message":{"text":"poker_darwin::cfr::cfr_rec (cognitive 26): poker_darwin::cfr::cfr_rec has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 4 (8 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":"crates/poker-darwin/src/cfr.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"72fead6aa7b1005e5abbfe6fd4ff6679e6950ec78e8e8358201559f4908f03d5"}},{"ruleId":"D2","level":"warning","message":{"text":"from-mcp-scan.deriveBadgesFromMcpScan (cognitive 25): from-mcp-scan.deriveBadgesFromMcpScan has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 1 (2 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/agntcy/src/identity/from-mcp-scan.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb6c1ba88b5191c160ee68fad6a88392bb221aa70eed42170e80162376ec67b"}},{"ruleId":"D2","level":"warning","message":{"text":"canonical.toSafeJson (cognitive 25): canonical.toSafeJson has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2 (4 pts), boolean chains 2, ternaries 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/arc-agi-3/src/canonical.ts"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"baf2b0ec97ac78538603b44f4a162826fbf1ac67dce0f055432fef26afe1e98c"}},{"ruleId":"D2","level":"warning","message":{"text":"EvidenceBackedMemory.query (cognitive 25): EvidenceBackedMemory.query has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 10, ternaries 2 (nesting depth added 5). Most of this is not in the body itself: 10 of the 25 points are its own statements and the rest belongs to one function literal inside it that branches (line 388). 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/arc-agi-3/src/memory.ts"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"748cab7fa2860c835480862d95d2305942dce66b4684db27edd7f0ee75ecd78a"}},{"ruleId":"D2","level":"warning","message":{"text":"wizard.runWizard (cognitive 25): wizard.runWizard has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 3, loops 3, ternaries 1 (nesting depth added 10). 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/create-agent-harness/src/wizard.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"37fbcc5aa07c3b4023a09afbafd447aeceddf22eaa1eb844e273b20605b8edc0"}},{"ruleId":"D2","level":"warning","message":{"text":"normalizer.extractJsonObject (cognitive 25): normalizer.extractJsonObject has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (15 pts), error handling 1 (4 pts), ternaries 1 (4 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/evals-toolcall/src/normalizer.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"19681c36e85b07caa7f2f85b8bd2d76976864cbe7b52ce967418ea6e8299f29e"}},{"ruleId":"D2","level":"warning","message":{"text":"normalizer.canonValue (cognitive 25): normalizer.canonValue has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (22 pts), ternaries 1 (2 pts), match/switch 1 (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/evals-toolcall/src/normalizer.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"15613a464797f31aefe90ac7a0abd5a5a989ed3a5d715be06be343c564a5570d"}},{"ruleId":"D2","level":"warning","message":{"text":"bridge._grid_frame (cognitive 25): bridge._grid_frame has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 6, loops 2 (3 pts), error handling 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/arc-agi-3/python/bridge.py"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"a534f00d4653fab23565086684fc8529cb185a6ab358e00aac66a0c53f81fb0b"}},{"ruleId":"D2","level":"warning","message":{"text":"k3rs::model::decoder_layer (cognitive 25): k3rs::model::decoder_layer has cognitive complexity 25 (threshold 15). Drivers by points: loops 10 (17 pts), if/else 8 (nesting depth added 7). 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":"kimi-k3-harness/crates/k3rs/src/model.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c8500acc788c1c03ed59d14e525ed24cb43e5294eb617f19c37f96f75c2cb8"}},{"ruleId":"D2","level":"warning","message":{"text":"k3rs::ops::matmul_mxfp4 (cognitive 25): k3rs::ops::matmul_mxfp4 has cognitive complexity 25 (threshold 15). Drivers by points: loops 7 (18 pts), if/else 3 (7 pts) (nesting depth added 15). 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":"kimi-k3-harness/crates/k3rs/src/ops.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c11e1c62163fd83ddd8ac3a42c7675f60dc239f1751cbaee7503de3f1902a45"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::stmt (cognitive 25): Parser::stmt has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 4 (6 pts) (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/oo-agents/crate/src/lib.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd194747c921130be7de60da4a988b8da8ef8f83f55919661a199acb9b6bcbc"}},{"ruleId":"D2","level":"warning","message":{"text":"startMcp::handle (cognitive 25): startMcp::handle has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 8, ternaries 2 (4 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/create-agent-harness/assets/generated-mcp.mjs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"a386851d5bdbd6fa97e75ea63daec83597cc4b6389c5d6d077e3f8a31569dbd5"}},{"ruleId":"D2","level":"warning","message":{"text":"model-driver.assertPlainJson (cognitive 24): model-driver.assertPlainJson has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 5, loops 2 (3 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/arc-agi-3-bench/src/model-driver.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66005f9d7400b36bdc704fabd374f03ffa338027c1a809d952b657bfae3da9a"}},{"ruleId":"D2","level":"warning","message":{"text":"supervisor.detect (cognitive 24): supervisor.detect has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9, ternaries 8 (9 pts), boolean chains 5, loops 1 (nesting depth added 1). 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, 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/arc-agi-3/src/supervisor.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8383cc32f3db569d8ab14443086b2db64c8cf5bee10d1494100684298a6320f"}},{"ruleId":"D2","level":"warning","message":{"text":"ArcController.actCriticalSection (cognitive 24): ArcController.actCriticalSection has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 6 (12 pts), if/else 6 (7 pts), error handling 3, 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/arc-agi-3/src/controller.ts"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e690645c4100d9e403bf2fabe8bda575912039b259d30f37a19b72c8b8feba2"}},{"ruleId":"D2","level":"warning","message":{"text":"ArcController.commitDirectiveCriticalSection (cognitive 24): ArcController.commitDirectiveCriticalSection has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 6, loops 3 (4 pts), error handling 1 (nesting depth added 5). 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/arc-agi-3/src/controller.ts"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"f313c8d3271915248a57d870901ec9e8c3b246a445ae28e78b0319ee6984a1dc"}},{"ruleId":"D2","level":"warning","message":{"text":"field-memory-scaffold.integrateFieldMemory (cognitive 24): field-memory-scaffold.integrateFieldMemory has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (17 pts), loops 2 (3 pts), boolean chains 2, error handling 1, ternaries 1 (nesting depth added 6). 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/create-agent-harness/src/field-memory-scaffold.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"87970dfb1eab03b44ef5c4714ef40f1c47a0e4c124b6fbe512833c0b1c5acfec"}},{"ruleId":"D2","level":"warning","message":{"text":"validate.runPathGuard::walk (cognitive 24): validate.runPathGuard::walk has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (8 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/create-agent-harness/src/validate.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"a48260ba08e02de89e8210aeca678803b7776d7f7d98c9deafcfcb51f359fd40"}},{"ruleId":"D2","level":"warning","message":{"text":"validation.validateDocument (cognitive 24): validation.validateDocument has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 5, loops 2 (nesting depth added 6). Of this number, 21 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/darwin-mode/src/contrastive/validation.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"3707503d54cfb5c255398c453bd28982be0c8f05c1e6938f9c8a24ab695b5911"}},{"ruleId":"D2","level":"warning","message":{"text":"normalizer.parseKeywordArgs (cognitive 24): normalizer.parseKeywordArgs has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 4, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/evals-toolcall/src/normalizer.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"7683ac2679d68ccc89ad68e060fc15acb8e207ceab7fa5c4bb7ac427e0474237"}},{"ruleId":"D2","level":"warning","message":{"text":"production-gate.validateProductionManifest (cognitive 24): production-gate.validateProductionManifest has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 8, loops 3 (4 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/flywheel/src/production-gate.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda4cde09a0eb4824342d7ff3994f6911fa7c6a4628d05528848c16a4178dd0f"}},{"ruleId":"D2","level":"warning","message":{"text":"chatCompletions.streamResponse (cognitive 24): chatCompletions.streamResponse has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (18 pts), ternaries 2 (4 pts), error handling 1, loops 1 (nesting depth added 8). 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":"services/apicompletions/src/routes/chatCompletions.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e4349cb6c0970acd3bce28d368597654bcc026327ce77ed17fd4045bd17ba47"}},{"ruleId":"D2","level":"warning","message":{"text":"bridge._observation (cognitive 24): bridge._observation has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 6, loops 2, ternaries 2, error handling 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3/python/bridge.py"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6958660893462fc2830e89cd2eb6fd2bf7b3c51ab72f06dd7129282fd8fdf7e"}},{"ruleId":"D2","level":"warning","message":{"text":"scaffold.hostFiles (cognitive 23): scaffold.hostFiles has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 8 (17 pts), boolean chains 3, if/else 1 (2 pts), match/switch 1 (nesting depth added 10). Of this number, 16 points are the body\u0027s own statements and 7 belong to one function literal inside it that branches. 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":"apps/web-ui/src/generator/scaffold.ts"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f290b1d5a066b03fe5e3f6a9a0567561506db013676bcb33b834dab36af39d8"}},{"ruleId":"D2","level":"warning","message":{"text":"EvidenceBackedMemory.load (cognitive 23): EvidenceBackedMemory.load has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 6, loops 2 (3 pts), 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/arc-agi-3/src/memory.ts"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a11ae0013cdc4338d8a6697033b29c431e9dbc51027d749f19131d02a6fd99d"}},{"ruleId":"D2","level":"warning","message":{"text":"ArcController.resume (cognitive 23): ArcController.resume has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 6, error handling 3, loops 2 (nesting depth added 1). None of this is in the body itself: all 23 points belong 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/arc-agi-3/src/controller.ts"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad51bf68d517b250d79a0074dcde332a36e813f36dcad0959dce9c6769d4b95"}},{"ruleId":"D2","level":"warning","message":{"text":"ArcPlanArchive.select (cognitive 23): ArcPlanArchive.select has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 6 (11 pts), if/else 6, boolean chains 4, loops 2 (nesting depth added 5). Of this number, 18 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/arc-agi-3/src/plan-archive.ts"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1282f43f6b010fc6ee22b5e7401f188136a588a950c976c6d922ee5406a439"}},{"ruleId":"D2","level":"warning","message":{"text":"cascade.runCascade (cognitive 23): cascade.runCascade has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 3, loops 1, ternaries 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/aws-finops/src/cascade.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f2e55f8bd99d29871b6656f488d0350dc07b3c0a7c84943471863e43d427ce0"}},{"ruleId":"D2","level":"warning","message":{"text":"upgrade-cmd.upgradeCmd (cognitive 23): upgrade-cmd.upgradeCmd has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (12 pts), ternaries 4 (6 pts), error handling 2 (3 pts), loops 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/create-agent-harness/src/upgrade-cmd.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec0cbab60e14848a32c7613e0d35c9ac9dc2045bc95565fbd65a1b8f40b00b5"}},{"ruleId":"D2","level":"warning","message":{"text":"index.installMd (cognitive 23): index.installMd has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (23 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/host-prime-agent/src/index.ts"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c335b7469afa76d5d4feaa9b6ddd0ba8a5c49b6903734d02dd780cd0ede39a"}},{"ruleId":"D2","level":"warning","message":{"text":"horizon_core::halt_reduce (cognitive 23): horizon_core::halt_reduce has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (20 pts), match/switch 2 (3 pts) (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/horizon/crate/src/lib.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93659cb1c70340a1ef8575dd4b53a8a4002733c858aae34f81274e42edec008"}},{"ruleId":"D2","level":"warning","message":{"text":"make-scaffold-chart.curveSvg (cognitive 22): make-scaffold-chart.curveSvg has cognitive complexity 22 (threshold 15). Drivers by points: loops 7 (9 pts), if/else 2 (6 pts), boolean chains 5, ternaries 1 (2 pts) (nesting depth added 7). Of this number, 20 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into 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/research/scaffolding/make-scaffold-chart.mjs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"13692da757e557525e228f5f6ca6695a26bc8a26c7da01e46f8bee7a74fee7a8"}},{"ruleId":"D2","level":"warning","message":{"text":"project.projectToOasf (cognitive 22): project.projectToOasf has cognitive complexity 22 (threshold 15). Drivers by points: if/else 18 (20 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/agntcy/src/oasf/project.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"eccef4348a22934bcf1b009d01f5f2518d9b94de3dadf4adaf5061549990937c"}},{"ruleId":"D2","level":"warning","message":{"text":"auth.authenticate (cognitive 22): auth.authenticate has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (18 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/arc-agi-3-chatgpt/src/auth.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"29244d7ec8a689964d83318031578590076d2a09c6ff8b6734dbaa8661d6ef4d"}},{"ruleId":"D2","level":"warning","message":{"text":"claim-gate.evaluateReleaseClaimGate (cognitive 22): claim-gate.evaluateReleaseClaimGate has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 10, if/else 9, 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/avo/src/claim-gate.ts"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0814204b05efa2e7c88cb9dca5848bbe9c3fda8d9ec9028341394e0bda0ef2"}},{"ruleId":"D2","level":"warning","message":{"text":"host-config.hostConfigFiles (cognitive 22): host-config.hostConfigFiles has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 8 (18 pts), if/else 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 11). Of this number, 15 points are the body\u0027s own statements and 7 belong to one function literal inside it that branches. 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/create-agent-harness/src/host-config.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ef26edee1dd33b92f8fc78f48bbf1d3826958612f71ab8c3eabed009594294b"}},{"ruleId":"D2","level":"warning","message":{"text":"repo_profiler.resolveTooling (cognitive 22): repo_profiler.resolveTooling has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 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/darwin-mode/src/repo_profiler.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"684900d719637701fa7c6a4b13e0f51f8e11317fcabd35b1d20d18d68c2a1089"}},{"ruleId":"D2","level":"warning","message":{"text":"SemgrepDetectorOracle.run (cognitive 22): SemgrepDetectorOracle.run has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 6 (15 pts), if/else 3 (4 pts), boolean chains 2, error handling 1 (nesting depth added 10). Of this number, 20 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/src/security/semgrep-oracle.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"b55ed0e0f8ab7aecb006954d042f887b4645abad58b62f4e275da1803fbfba7f"}},{"ruleId":"D2","level":"warning","message":{"text":"classifier.heuristicClassifier (cognitive 22): classifier.heuristicClassifier has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (18 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/evals-math/src/classifier.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f31bbe0268705613a9bb95191e4fe65681db21fd0eee737bef8b8373353b509"}},{"ruleId":"D2","level":"warning","message":{"text":"classifier.heuristicClassifier (cognitive 22): classifier.heuristicClassifier has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (18 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/evals-sql/src/classifier.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d066fe9d6df6ac7182c9fb7fab6749ba68742dbd7cabda0fdaeedd664395b40"}},{"ruleId":"D2","level":"warning","message":{"text":"classifier.heuristicClassifier (cognitive 22): classifier.heuristicClassifier has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/evals-toolcall/src/classifier.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa81d328b128dc944f8714b1874b3da783c671a54fab15e5884482fa6ef7f738"}},{"ruleId":"D2","level":"warning","message":{"text":"FileBudgetLimiter.readState (cognitive 22): FileBudgetLimiter.readState has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 8, error handling 1 (2 pts), 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/flywheel/src/budget.ts"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"d39779980e506b88dd859ae72a5dee616c07e846b6b40434ed9a34bdb6a7b103"}},{"ruleId":"D2","level":"warning","message":{"text":"taint.taintScan (cognitive 22): taint.taintScan has cognitive complexity 22 (threshold 15). Drivers by points: loops 4 (12 pts), if/else 3 (7 pts), ternaries 1 (3 pts) (nesting depth added 14). 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/projects/src/taint.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"754830af3f7059efb99de82399f48b59ac2dfb4701ef1994eb6494ee691f7e57"}},{"ruleId":"D2","level":"warning","message":{"text":"mock-target.exampleAgentTarget (cognitive 22): mock-target.exampleAgentTarget has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 7 (nesting depth added 4). None of this is in the body itself: all 22 points belong to one function literal inside it that branches (line 48). 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/redblue/src/mock-target.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9bf8d4a028b4b72e907a1308489f46539a4e288d116d41040e4dce8a84b6241"}},{"ruleId":"D2","level":"warning","message":{"text":"HackerOneClient.programScope (cognitive 22): HackerOneClient.programScope has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (2 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/redblue/src/integrations/hackerone.ts"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"e40b03ba1a2a945516031ec40e1ed07faaa5888b244ad182eb0a287ea23cf710"}},{"ruleId":"D2","level":"warning","message":{"text":"index.cmdHackerOne (cognitive 22): index.cmdHackerOne has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 4 (10 pts), if/else 5 (7 pts), loops 2 (4 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/redblue/src/cli/index.ts"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"1147b2da069e4a5150cc4d4a9046804354f84d727d9189490b3917bc7d1a7191"}},{"ruleId":"D2","level":"warning","message":{"text":"inflight.streamInflight (cognitive 22): inflight.streamInflight has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 3 (5 pts), loops 2, boolean chains 1 (nesting depth added 7). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"services/apicompletions/src/midstream/inflight.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb21825d6daba6cb6bdd6f989fd30ed54d25da4426e0e6c22f660697a934e02c"}},{"ruleId":"D2","level":"warning","message":{"text":"k3rs::ops::shortconv (cognitive 22): k3rs::ops::shortconv has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (9 pts), match/switch 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kimi-k3-harness/crates/k3rs/src/ops.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f5ea1dec1d6cc75d02e25231cac80dfe253e754aefcf24916296b40e7d9a76a"}},{"ruleId":"D2","level":"warning","message":{"text":"horizon_core::to_json (cognitive 22): horizon_core::to_json has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (4 pts), boolean chains 1, match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/horizon/crate/src/lib.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc4b6683d50fc96b8bb9d5cd182d8d880049340357758890a97829664c165d44"}},{"ruleId":"D2","level":"warning","message":{"text":"make-charts.chart7 (cognitive 21): make-charts.chart7 has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (6 pts), ternaries 2 (6 pts), loops 4 (5 pts), boolean chains 3, 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":"docs/research/cheap-vs-frontier/make-charts.mjs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"e33dd7cb55a857a736e975dda0f0de9a3cd3e120b95c58db5b81e076cb3815a6"}},{"ruleId":"D2","level":"warning","message":{"text":"rvf-cow-bench.main (cognitive 21): rvf-cow-bench.main has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (10 pts), ternaries 3 (7 pts), if/else 1 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/ruvector-applications/rvf-cow-bench.js"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"4febf2c1d4222bd404e0c020460fbb51613ba0e23112373386fe087130b6345d"}},{"ruleId":"D2","level":"warning","message":{"text":"RepositoryEnvironmentAdapter.execute (cognitive 21): RepositoryEnvironmentAdapter.execute has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (12 pts), ternaries 2 (4 pts), error handling 1 (2 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/avo/src/repository.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"94303baab487f01299894cafb75250d56f5a1015080f4984a33ed46027c5fb11"}},{"ruleId":"D2","level":"warning","message":{"text":"confirmation.confirmContrastive (cognitive 21): confirmation.confirmContrastive has cognitive complexity 21 (threshold 15). Drivers by points: if/else 21 (23 pts), boolean chains 10, ternaries 5 (8 pts), error handling 4, loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This shape REPEATS in the file: one other method here (confirmation.confirmContrastive::execute) 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/darwin-mode/src/contrastive/confirmation.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"eddd3e7eb60663602c9e9193ecca9f48eda28efc2eb4190da0404c187fdca790"}},{"ruleId":"D2","level":"warning","message":{"text":"normalizer.parseCall (cognitive 21): normalizer.parseCall has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 3 (6 pts), error handling 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/evals-toolcall/src/normalizer.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae9ae8be9717fe327e8d2b68b9ede06ea41b56f19b954c438e5be97d2a9d6467"}},{"ruleId":"D2","level":"warning","message":{"text":"chatCompletions.makeChatCompletions.postChatCompletions (cognitive 21): chatCompletions.makeChatCompletions.postChatCompletions has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (13 pts), ternaries 4 (7 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":"services/apicompletions/src/routes/chatCompletions.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c47e51be851eb9e974967a4ba67ee11dc970881552f2c5ed2a5e0df3dc0b160"}},{"ruleId":"D2","level":"warning","message":{"text":"messages.makeMessages.postMessages (cognitive 21): messages.makeMessages.postMessages has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (13 pts), ternaries 4 (7 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":"services/apicompletions/src/routes/messages.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f415f07623e2b58b3b24484fa19edaf9ee28466e27169e7935607bf856edc4"}},{"ruleId":"D2","level":"warning","message":{"text":"analyze2.main (cognitive 21): analyze2.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 4 (5 pts), ternaries 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":"docs/research/retort-placement/analyze2.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"b087144b2f8f65c88d076943ee173a47768f84262dc99a392ec42666f52a4b9c"}},{"ruleId":"D2","level":"warning","message":{"text":"k3rs::main (cognitive 21): k3rs::main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (6 pts), match/switch 3 (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":"kimi-k3-harness/crates/k3rs/src/main.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"11261fb471cc59082eab0748388b607e7f8f7005238953f01bf4c0d2b2a0fa67"}},{"ruleId":"D2","level":"warning","message":{"text":"avo-config.resolveFeatures (cognitive 20): avo-config.resolveFeatures has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 7, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3/src/avo-config.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"b403cd3ce85eb15a6a18b38097caf99f539a7d202fa95856de4f9092b1cf50de"}},{"ruleId":"D2","level":"warning","message":{"text":"claim-gate.validateClaimSurfaces (cognitive 20): claim-gate.validateClaimSurfaces has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (5 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/avo/src/claim-gate.ts"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd586d3cf67b4d763e7e1d5e41a72aa661eb4ea6d06f72af574ffc616b9c851"}},{"ruleId":"D2","level":"warning","message":{"text":"claim-gate.preregistrationValid (cognitive 20): claim-gate.preregistrationValid has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 9, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/avo/src/claim-gate.ts"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c32ed39cc2a0057b7edee470010e7ddd6d263dcf24e40742487c838a48771a8"}},{"ruleId":"D2","level":"warning","message":{"text":"score.scoreMcpSafety (cognitive 20): score.scoreMcpSafety has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 5 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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/create-agent-harness/src/score.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab43e7092a1a0aaabca5331ed217abfbf1e5069f72fd8a96885c890e559be7be"}},{"ruleId":"D2","level":"warning","message":{"text":"confirmation.confirmContrastive::execute (cognitive 20): confirmation.confirmContrastive::execute has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 4, ternaries 2 (4 pts), error handling 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. This shape REPEATS in the file: one other method here (confirmation.confirmContrastive) 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/darwin-mode/src/contrastive/confirmation.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a447d207e6bce02561771e8be5171f0298e3e4fb5922a3072ef168b471b41f9"}},{"ruleId":"D2","level":"warning","message":{"text":"evaluator.makeExtractEvaluator.evaluate (cognitive 20): evaluator.makeExtractEvaluator.evaluate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (9 pts), ternaries 2 (5 pts), boolean chains 3, 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/evals-extract/src/evaluator.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"927daadba8e3c62918af7c15761a8264a76da2fce6e1fcb449478d62633872fc"}},{"ruleId":"D2","level":"warning","message":{"text":"classifier.heuristicClassifier (cognitive 20): classifier.heuristicClassifier has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/evals-hle/src/classifier.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae95d559b317ea7b566a68f6a4209b6cc336be3cc88cfbb1c4cfa311f8b980c"}},{"ruleId":"D2","level":"warning","message":{"text":"FieldMemory.importState (cognitive 20): FieldMemory.importState has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16 (17 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/field-memory/src/field-memory.ts"},"region":{"startLine":1220}}}],"partialFingerprints":{"codehealthFindingId/v1":"a54491570f1e9ab54c36f5e9293797697f99d88acdb6092a97f2b1558764f80c"}},{"ruleId":"D2","level":"warning","message":{"text":"RuVectorFieldStorage.constructor (cognitive 20): RuVectorFieldStorage.constructor has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (14 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/field-memory/src/ruvector-storage.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8dcf7e309857e25f258d55d26ccdfe2c99714efbbf29b22ede4fe62c0929793"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.trainCmd (cognitive 20): cli.trainCmd has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 5 (11 pts), if/else 5 (7 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/weight-eft/src/cli.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"e154f94cad65f2d385a8f179a22f48ee121d51fac0cf89571a04b3732c494d00"}},{"ruleId":"D2","level":"warning","message":{"text":"ruflo_kernel::hooks::matcher_matches (cognitive 20): ruflo_kernel::hooks::matcher_matches has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 3, match/switch 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":"crates/kernel/src/hooks.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"0807481a1f8144b65bbc9b8992933ee4f26875592fa55e058742018a0326564b"}},{"ruleId":"D2","level":"warning","message":{"text":"HarnessBuilder.HarnessBuilder (cognitive 19): HarnessBuilder.HarnessBuilder has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 11, boolean chains 7, if/else 1. Of this number, 15 points are the body\u0027s own statements and 4 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":"apps/web-ui/src/components/HarnessBuilder.tsx"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"e117dbe61b7d31ed406992138b6eba430044af4c13a774f635a2420d89b307dc"}},{"ruleId":"D2","level":"warning","message":{"text":"RepoImporter.RepoImporter (cognitive 19): RepoImporter.RepoImporter has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 5 (7 pts), boolean chains 6, if/else 4, error handling 2 (nesting depth added 2). Of this number, 10 points are the body\u0027s own statements and 9 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":"apps/web-ui/src/components/RepoImporter.tsx"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"632468c58b07333ced25bfadf1c4e4903bcc6c20aa7ca88372ae41aa886690c7"}},{"ruleId":"D2","level":"warning","message":{"text":"official-factory.scorecardRuns (cognitive 19): official-factory.scorecardRuns has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 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/arc-agi-3-chatgpt/src/official-factory.ts"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"cefcc1fb721630602ea643dc863d3374e3d2e2ea88b9c83c220d265f74c8e20d"}},{"ruleId":"D2","level":"warning","message":{"text":"EvidenceRetrodictiveWorldModel.load (cognitive 19): EvidenceRetrodictiveWorldModel.load has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 6, loops 2, 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/arc-agi-3/src/world-model.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"a059445a12a8a060cbd64fee997d8825b0749b6bf2f1aa985bc1c84e8a6cc2a9"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticSupervisor.observe (cognitive 19): SemanticSupervisor.observe has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 4, loops 2, ternaries 2 (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: 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/avo/src/supervisor.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56e5fe756688661d6d435de2e693b9b4b11c488c39c460d84803ad600433dcd"}},{"ruleId":"D2","level":"warning","message":{"text":"secrets.check (cognitive 19): secrets.check has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 4, 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/create-agent-harness/src/secrets.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"763ccb675a323e874f0a4010f836eb6712c61cbc9e97715cf10aa52d4e21499e"}},{"ruleId":"D2","level":"warning","message":{"text":"mcp-cmd.mcpLs (cognitive 19): mcp-cmd.mcpLs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 3 (7 pts), loops 2 (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/create-agent-harness/src/mcp-cmd.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"a758810382cdeb112e05b16455d41781199724e518318c7804b5af59f31a25a1"}},{"ruleId":"D2","level":"warning","message":{"text":"evaluator.makeHleEvaluator.evaluate (cognitive 19): evaluator.makeHleEvaluator.evaluate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), ternaries 2 (5 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/evals-hle/src/evaluator.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab75873b3a4334a98a331240ee16b1ae7f0fa9bdbc10b5c66938b638251c19d6"}},{"ruleId":"D2","level":"warning","message":{"text":"evaluator.makeMathEvaluator.evaluate (cognitive 19): evaluator.makeMathEvaluator.evaluate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), ternaries 2 (5 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/evals-math/src/evaluator.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd89ccc7cb0a9bc0e612fcf0bd58bdf4441057aebccc4c40daceb12ee87e517"}},{"ruleId":"D2","level":"warning","message":{"text":"evaluator.makeSqlEvaluator.evaluate (cognitive 19): evaluator.makeSqlEvaluator.evaluate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), ternaries 2 (5 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/evals-sql/src/evaluator.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b37ff2feece7352c0ebeb0091ee95323530b2244a6e00e8431a47667254e5c4"}},{"ruleId":"D2","level":"warning","message":{"text":"Agent.manifest (cognitive 19): Agent.manifest has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/oo-agents/src/agent.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa9618289e73468008c283653031846c9df0a2139ffc522ff2bb73cdeb78a444"}},{"ruleId":"D2","level":"warning","message":{"text":"sim.makeTask (cognitive 19): sim.makeTask has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (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/radio/src/sim.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"236470a80d6906671ec8083efa563e691e121c2938eca0fd21b3de10cdc02675"}},{"ruleId":"D2","level":"warning","message":{"text":"ruflo_kernel::autonomous::validate_autonomous (cognitive 19): ruflo_kernel::autonomous::validate_autonomous has cognitive complexity 19 (threshold 15). Drivers by points: if/else 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":"crates/kernel/src/autonomous.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"40cd9819dea4c1bdf15b7ad016adb7d6f1c5307f3f764ff00f68f182fd7b8386"}},{"ruleId":"D2","level":"warning","message":{"text":"verify.mcpServerPresent (cognitive 18): verify.mcpServerPresent has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 4, 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":"apps/web-ui/src/generator/verify.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7bbc44e3af6c221d24b1e23954ce1489caeb9c9fd07407eb66a8daf7b3d9fd4"}},{"ruleId":"D2","level":"warning","message":{"text":"compile.compileObjectiveToEnvelope (cognitive 18): compile.compileObjectiveToEnvelope has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/agntcy/src/casa/compile.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d3fd5bb587d00baa17ed5dd2937d593784385899276a2906ba8bd53423d2aee"}},{"ruleId":"D2","level":"warning","message":{"text":"stats.signFlipPValue (cognitive 18): stats.signFlipPValue has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 3 (6 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 7). 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/arc-agi-3-bench/src/stats.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"3527030bbc7c2af05b5963ab58eb72234dcefec095b9afc71acc33986d8a972c"}},{"ruleId":"D2","level":"warning","message":{"text":"tools.registerActorTools (cognitive 18): tools.registerActorTools has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), error handling 2 (6 pts), ternaries 3 (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 5 function literals inside it that branch (lines 500, 327, 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/arc-agi-3-chatgpt/src/tools.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3cd7fa129d74e08677561ae4b58e9bddf3c669e3b0d6829355e48e60fab4d4"}},{"ruleId":"D2","level":"warning","message":{"text":"memory.validateStoredRule (cognitive 18): memory.validateStoredRule 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/arc-agi-3/src/memory.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e4fb6daff550bc1ddfd336e8d99bb38a97e90ff71e9114ee09a8657ba38ca2"}},{"ruleId":"D2","level":"warning","message":{"text":"checkpoint.validateCheckpointBeliefHistory (cognitive 18): checkpoint.validateCheckpointBeliefHistory has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 6, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3/src/checkpoint.ts"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff78f55945e28a7cb540e7d63cd9cc26e9e8a87fdb311c2755fe3d148f951e1f"}},{"ruleId":"D2","level":"warning","message":{"text":"gen-templates.uiCatalogTs (cognitive 18): gen-templates.uiCatalogTs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 4 (7 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/create-agent-harness/scripts/gen-templates.mjs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a8cd432b444e5d68ed26a175c6ee35b6bcb10132ef867158521d66f3075d3d"}},{"ruleId":"D2","level":"warning","message":{"text":"analyze-repo.analyzeFiles (cognitive 18): analyze-repo.analyzeFiles has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9, boolean chains 5, ternaries 2 (3 pts), 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/create-agent-harness/src/analyze-repo.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab1a552fca1f0c4e4d219f1cf93a8b1dde6e42918e128ac18e9519b9c08fdef6"}},{"ruleId":"D2","level":"warning","message":{"text":"witness-client.verifyWitness (cognitive 18): witness-client.verifyWitness has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (12 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/witness-client.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"921321d34759f19997cfdf937f80fb529fce592503391ac9cedfdf7f5fd7fcf2"}},{"ruleId":"D2","level":"warning","message":{"text":"sbom-cmd.packagesFromLock (cognitive 18): sbom-cmd.packagesFromLock has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, ternaries 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/sbom-cmd.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0347ac910258b47b069f7cf9e0f3688a3d4ee6fd2ac4475cb1a318c2c90bfab"}},{"ruleId":"D2","level":"warning","message":{"text":"classifier.heuristicClassifier (cognitive 18): classifier.heuristicClassifier has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/evals-extract/src/classifier.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"e61a17224179ebb87cba92459b16fe05550fc50de0998834d22d2bd46de7bc1d"}},{"ruleId":"D2","level":"warning","message":{"text":"normalizer.normalizeAnswer (cognitive 18): normalizer.normalizeAnswer has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 2 (3 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/evals-math/src/normalizer.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b62cb7b9bdf452031a03e65337925a57f8c6a3908853bb1c39145f3aa16e181"}},{"ruleId":"D2","level":"warning","message":{"text":"verifier.makeVerifier.verify (cognitive 18): verifier.makeVerifier.verify has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 6 (12 pts), if/else 5, 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/evals-sql/src/verifier.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d9dfca2c7ecd3df8c0404d429409395dc8bb386e96473b7fb339d5da088f42"}},{"ruleId":"D2","level":"warning","message":{"text":"production-gate.productionDecision (cognitive 18): production-gate.productionDecision has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 8, if/else 7, 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/flywheel/src/production-gate.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b8f78ef46058f615872c809be4022555871499d2168e4f8e977bb6bccbf165"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.reportCmd (cognitive 18): cli.reportCmd has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 7 (13 pts), loops 2 (3 pts), 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/turn-credit/src/cli.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"d64c4ac30dd70c2b7405c8e5736b8d11d8f9d1b2d46fc0581535975a32a188d9"}},{"ruleId":"D2","level":"warning","message":{"text":"index.validateVerticalManifest (cognitive 18): index.validateVerticalManifest has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, 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/vertical-base/src/index.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"35833cb1c91e20f25ec6462fbf6e7444ac7295870aded874333c89d4eed80626"}},{"ruleId":"D2","level":"warning","message":{"text":"safety.detectConcepts (cognitive 18): safety.detectConcepts has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (3 pts), ternaries 1 (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/workspace-lens/src/safety.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3dbe3b50097424583839b3828acbb9933b027c372c401a212ef564a881185dc"}},{"ruleId":"D2","level":"warning","message":{"text":"k3rs::ops::kda_step_scratch (cognitive 18): k3rs::ops::kda_step_scratch has cognitive complexity 18 (threshold 15). Drivers by points: loops 8 (12 pts), if/else 3 (6 pts) (nesting depth added 7). 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":"kimi-k3-harness/crates/k3rs/src/ops.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"a933874d6d6f9d6e178def668e2c1245c43c6c7bdf5c0e3b78050b9befd0125c"}},{"ruleId":"D2","level":"warning","message":{"text":"k3rs::ops::router (cognitive 18): k3rs::ops::router has cognitive complexity 18 (threshold 15). Drivers by points: loops 7 (11 pts), if/else 3 (6 pts), boolean chains 1 (nesting depth added 7). 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":"kimi-k3-harness/crates/k3rs/src/ops.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"c073dc31021690d181d7bf08944b4f48656c47234afd45fecb4d02e6e57a41ce"}},{"ruleId":"D2","level":"warning","message":{"text":"horizon_core::classify_command (cognitive 18): horizon_core::classify_command has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 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/horizon/crate/src/lib.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"58097cb6461496055edca157f640b5c595e588ea3a2ef855c35dfafd59441ae1"}},{"ruleId":"D2","level":"warning","message":{"text":"make-charts.chart6 (cognitive 17): make-charts.chart6 has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (6 pts), loops 4 (5 pts), boolean chains 3, 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":"docs/research/cheap-vs-frontier/make-charts.mjs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a56269fe839e558a52a218a5c2dd1e681804038193b8a5ae4ad82faac34291"}},{"ruleId":"D2","level":"warning","message":{"text":"arc-widget.html.window.addEventListener(\u0022message\u0022) (cognitive 17): arc-widget.html.window.addEventListener(\u0022message\u0022) has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 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, 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/arc-agi-3-chatgpt/public/arc-widget.html"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc660946a4f375ece4c69508ef1cc4c5e218d21aa388a8a5d18481296ad5ef7"}},{"ruleId":"D2","level":"warning","message":{"text":"canonical.validateFrame (cognitive 17): canonical.validateFrame has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 5, 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/arc-agi-3/src/canonical.ts"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"413c66d25e2d627aa59097b37048ca962fe4b773a5b5c3a36a6e1f7a9b8e75d8"}},{"ruleId":"D2","level":"warning","message":{"text":"canonical.validateExactArcObservation (cognitive 17): canonical.validateExactArcObservation has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 6, 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/arc-agi-3/src/canonical.ts"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"06519a439ef03681ddfd6dfb571a45f0a1b191ca6d51d9a7a183bf0e344d9d18"}},{"ruleId":"D2","level":"warning","message":{"text":"BeliefGraph.componentSize (cognitive 17): BeliefGraph.componentSize has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 6 (8 pts) (nesting depth added 7). 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/arc-agi-3/src/belief-graph.ts"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ed80f6e0192c61c2e9336ba22513be78096f64cb582bf081027863ca072f10a"}},{"ruleId":"D2","level":"warning","message":{"text":"PythonArcBridge.#onStdout (cognitive 17): PythonArcBridge.#onStdout has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 1, 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/arc-agi-3/src/python-bridge.ts"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f0e9db032d3fcf7e254bc43a5cea59e92e24de461cca9787e24910b3e14de7"}},{"ruleId":"D2","level":"warning","message":{"text":"PythonArcBridge.#disposeAfterQueue (cognitive 17): PythonArcBridge.#disposeAfterQueue has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), error handling 3 (4 pts), boolean chains 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/arc-agi-3/src/python-bridge.ts"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7d1f6de6782d66c915a69d3540e6ecaa428cce4c29d6ad356f2cdd3989eec4"}},{"ruleId":"D2","level":"warning","message":{"text":"analyze-repo.inventory (cognitive 17): analyze-repo.inventory has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), error handling 2 (4 pts), loops 2, 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/create-agent-harness/src/analyze-repo.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"73de54266eb57ec1a66acf9b7647baa1d2cdfeddfbbaf516f85c8f788ab01168"}},{"ruleId":"D2","level":"warning","message":{"text":"validate.runMcpCheck (cognitive 17): validate.runMcpCheck has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 4 (7 pts), boolean chains 1, 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/create-agent-harness/src/validate.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"f959a9162e22100d8ffbc9e298c0322377d4974fa0e486aad9bcbbd8cc8ddc42"}},{"ruleId":"D2","level":"warning","message":{"text":"plugin-init-cmd.pluginInitCmd (cognitive 17): plugin-init-cmd.pluginInitCmd has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (7 pts), ternaries 3 (4 pts), loops 2 (3 pts), boolean chains 2, error handling 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/plugin-init-cmd.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"a995fbda1c9a1a031b60b306e46118e7a6356d3877bad25d7f9ee0c6e3fb1f6c"}},{"ruleId":"D2","level":"warning","message":{"text":"scorer.scoreVariant (cognitive 17): scorer.scoreVariant has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 11 (13 pts), boolean chains 4 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/src/scorer.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da97aef4b57fe29564e8d2bf8ec919390ac8a015c20b3e88da459ba71d6ea8f"}},{"ruleId":"D2","level":"warning","message":{"text":"real-evolve.evolveDetectorsReal::score (cognitive 17): real-evolve.evolveDetectorsReal::score has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 2 (6 pts), loops 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/darwin-mode/src/security/real-evolve.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cda1801b348e5b771a86d1185fc1b41da17b8bacb97762ba074b3c243244000"}},{"ruleId":"D2","level":"warning","message":{"text":"metric.classifyFailure (cognitive 17): metric.classifyFailure has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, if/else 7, ternaries 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/darwin-mode/src/gepa/metric.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"03855487b961b8b210b9cd13d65ea8271eb16c0d5ee86ee6d062d8093501fa92"}},{"ruleId":"D2","level":"warning","message":{"text":"field-memory.rebuildPublishedEmbedding (cognitive 17): field-memory.rebuildPublishedEmbedding has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (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/field-memory/src/field-memory.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc32eaef58d934dabca6187c9d3e2724ceab212656949c346c0513b6f4cc460"}},{"ruleId":"D2","level":"warning","message":{"text":"validate-bundle.validateLineageCommit (cognitive 17): validate-bundle.validateLineageCommit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (13 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/flywheel/src/validate-bundle.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c5375d10c0581c6ffe0ab26b66503ffe52d2dd4b411a14f3de5db5902206770"}},{"ruleId":"D2","level":"warning","message":{"text":"review-context.verifyIndependentReviewPacket (cognitive 17): review-context.verifyIndependentReviewPacket has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (9 pts), ternaries 3 (5 pts), loops 2, error handling 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flywheel/src/review-context.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ffeb8b4b61f7031e35aca9a7dc5d55cdbd011f9b38314e7a5a84e9dfdfa408"}},{"ruleId":"D2","level":"warning","message":{"text":"discovery.runDiscovery (cognitive 17): discovery.runDiscovery has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4, boolean chains 1, ternaries 1 (nesting depth added 5). Of this number, 13 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/projects/src/discovery.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d58dda69e115ef224cf2d2ba5343b5708f67cc5506805ea56d27b8a8566aca"}},{"ruleId":"D2","level":"warning","message":{"text":"mock-target.alwaysVulnerableFixture (cognitive 17): mock-target.alwaysVulnerableFixture has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 9, if/else 8. None of this is in the body itself: all 17 points belong to one function literal inside it that branches (line 211). 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/redblue/src/mock-target.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dac43e2da126a9e53ea1a9cdaebe2783f87fd78eb5216744301aba6e1e8c9d9"}},{"ruleId":"D2","level":"warning","message":{"text":"report.renderMarkdown (cognitive 17): report.renderMarkdown 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/redblue/src/reports/report.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"208389877d69fcf9e9348885e8ce73544640369e888d1d14054667a4505f186d"}},{"ruleId":"D2","level":"warning","message":{"text":"completions.makeCompletions.postCompletions (cognitive 17): completions.makeCompletions.postCompletions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (9 pts), ternaries 2 (5 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":"services/apicompletions/src/routes/completions.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f47ad7e16ebfa6589d1d74b9695384ce0fd58a65cb91013dde4f1a5fadcb9e"}},{"ruleId":"D2","level":"warning","message":{"text":"bridge.main (cognitive 17): bridge.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), error handling 3 (5 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/arc-agi-3/python/bridge.py"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"abccf3a02594f2878a4972cf5b4b8dee7190b85063ef0974913039735dbe2fdc"}},{"ruleId":"D2","level":"warning","message":{"text":"poker_darwin::cfr::prepare_node (cognitive 17): poker_darwin::cfr::prepare_node has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 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":"crates/poker-darwin/src/cfr.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"8414f324fbc66ae9deeedef292229382e3784ade2dba79a9677c6b0fc74a8068"}},{"ruleId":"D2","level":"warning","message":{"text":"horizon_core::split_segments (cognitive 17): horizon_core::split_segments has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 4, match/switch 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/horizon/crate/src/lib.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe59b6c245c11fbaaeeef7de22d49887bc30a352e352c9c8562a28d106098b4"}},{"ruleId":"D2","level":"warning","message":{"text":"repo.analyzeFiles (cognitive 16): repo.analyzeFiles has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 5, error handling 1, ternaries 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":"apps/web-ui/src/generator/repo.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"aafb39da497cdb48b6b261b6a1679a13b44a42cb4608e60acaa3a7838e011ddd"}},{"ruleId":"D2","level":"warning","message":{"text":"BenchmarkPlanner.propose (cognitive 16): BenchmarkPlanner.propose has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 5 (6 pts), boolean chains 5, if/else 5 (nesting depth added 1). 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: 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/arc-agi-3-bench/src/bench-planner.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"5965124f47073b2f45f8b5c796b8161c78e831977d36e9fe23bd29df3cae3aff"}},{"ruleId":"D2","level":"warning","message":{"text":"runner.runEpisode (cognitive 16): runner.runEpisode has cognitive complexity 16 (threshold 15). Drivers by points: error handling 4 (6 pts), if/else 3 (5 pts), boolean chains 2, ternaries 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3-bench/src/runner.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd5aabf13bf8a561590aa774b5236956e6132050823cedb33f6d9fc39ec9b12"}},{"ruleId":"D2","level":"warning","message":{"text":"ArcController.assertActionLegalAgainst (cognitive 16): ArcController.assertActionLegalAgainst 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/arc-agi-3/src/controller.ts"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"93276f95ba7ee3ba431f23b104a1dae990826f4f825a33e79963f2795c018b68"}},{"ruleId":"D2","level":"warning","message":{"text":"meta-proxy.uninstallMetaProxy (cognitive 16): meta-proxy.uninstallMetaProxy has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), error handling 1 (3 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc29b109c2d8250589b0c0b75a99d63d66693422637269b2c16c1062f7d677e2"}},{"ruleId":"D2","level":"warning","message":{"text":"meta-proxy.replaceEffectiveMetaProxy (cognitive 16): meta-proxy.replaceEffectiveMetaProxy has cognitive complexity 16 (threshold 15). Drivers by points: error handling 3 (5 pts), if/else 3 (5 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/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"18914d5c64bfd9e27b8bc24f6eff0bf577e24367c0255cb24828433e1ce17621"}},{"ruleId":"D2","level":"warning","message":{"text":"evolve.evolve (cognitive 16): evolve.evolve has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 3 (4 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/darwin-mode/src/security/evolve.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8983ad896ce08818315a4e1d05a1840e5abc9e7fa9fe9b98e59f999214c7e58"}},{"ruleId":"D2","level":"warning","message":{"text":"normalizer.extractJsonSpan (cognitive 16): normalizer.extractJsonSpan has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 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/evals-extract/src/normalizer.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"938539cfa30a69b9dbbe2ee480c2fda509d0d8c8e60386fb8706ce2c4fe25e9d"}},{"ruleId":"D2","level":"warning","message":{"text":"field-memory.countScalars (cognitive 16): field-memory.countScalars has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (7 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/field-memory/src/field-memory.ts"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f52a08e48cd02e6b1b9e2c9e45b73eebe8464aa7c04e249d9874fa8c091df28"}},{"ruleId":"D2","level":"warning","message":{"text":"index.cliConfigYaml (cognitive 16): index.cliConfigYaml has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 3 (11 pts), loops 2 (3 pts), if/else 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/host-hermes/src/index.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f40fefaa5c5b106fd6d10286a2cfadde1a717578bafb26ed655b604877197c7"}},{"ruleId":"D2","level":"warning","message":{"text":"capability.probe (cognitive 16): capability.probe has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), error handling 2 (4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/jujutsu/src/capability.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b18342067513af357cda1754693c5fa784eff3a03f43a4825fa9726ba02613"}},{"ruleId":"D2","level":"warning","message":{"text":"memory-rvf.createRvfBackend.insertBatch (cognitive 16): memory-rvf.createRvfBackend.insertBatch has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 4, error handling 1 (2 pts) (nesting depth added 3). 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, 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/kernel-js/src/memory-rvf.ts"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d28efc1dfcf7f208c65a4eb87a919ed4d9de5b5621cf9f46e69f7faa9a801dd"}},{"ruleId":"D2","level":"warning","message":{"text":"judge.extractJson (cognitive 16): judge.extractJson has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), 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/redblue/src/judges/judge.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"27725f786385915c51ad34bebb14d3f9e8796762b23cd0042fbbf8d19fbd2a99"}},{"ruleId":"D2","level":"warning","message":{"text":"HackerOneClient.probeWriteScope (cognitive 16): HackerOneClient.probeWriteScope has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 5, error handling 1, ternaries 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/redblue/src/integrations/hackerone.ts"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c2c04feb3b79217e960f9446151c08ae8eeae6715f58bb7faebfca23918b29"}},{"ruleId":"D2","level":"warning","message":{"text":"train.solve (cognitive 16): train.solve has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (8 pts), if/else 2 (6 pts), boolean chains 2 (nesting depth added 8). 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, 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/router/src/train.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df3af799ea922ebfab5c8470cd7c3154217db11068d890455fc49ee8a847ec9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: official-factory.createOfficialArcControllerFactory: FunctionTooLong \u2014 createOfficialArcControllerFactory runs 508 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 408 over it, 5.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/arc-agi-3-chatgpt/src/official-factory.ts"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be76761389721cb865b63cf6e9d4cfaa5c0d4a75edab46ef4139db52f8a38d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: HarnessBuilder.HarnessBuilder: FunctionTooLong \u2014 HarnessBuilder runs 321 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 221 over it, 3.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":"apps/web-ui/src/components/HarnessBuilder.tsx"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"d296a0d17d6d3f8880065ddc41a46a2e9801e23b4e7ae90ca746ea3675541849"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sim.runSim: FunctionTooLong \u2014 runSim runs 280 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 180 over it, 2.80\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values 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/radio/src/sim.ts"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"d22d88fda34531ed3f5b2a73ef714c97ef918760e6e92137f11e4f5e6bb0344a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: field-memory.parseRecord: FunctionTooLong \u2014 parseRecord runs 235 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 135 over it, 2.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/field-memory/src/field-memory.ts"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18590bf44feae9196e3bdf13b88dc616a5acf129b52ca793e4758b94997d417"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ArcController: ClassTooLong \u2014 926 significant lines (blank, comment-only and punctuation-only lines excluded), 49 methods. The bar is 400 significant lines; this is 526 over it, 2.32\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/arc-agi-3/src/controller.ts"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a3a6f8402713b08500c8264bebdb92bfeacd8a57b2ca0aa9a6c6fe94f48031"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/controller.ts: FileTooLong \u2014 1155 significant lines (blank, comment-only and punctuation-only lines excluded), about 80% of them inside a single declaration: ArcController (281-1500). The bar is 500 significant lines; this is 655 over it, 2.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/arc-agi-3/src/controller.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d814268f94c6018942c46c1e336563e56942f96749301c14c65b2a36abbcfc93"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: evolve.evolve: FunctionTooLong \u2014 evolve runs 230 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 130 over it, 2.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/darwin-mode/src/evolve.ts"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae06dd8a9c9bb70737e973d08af7e4c0aed35105204798bab47f96cf2fb9fba4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArcPlanArchive.load: MethodTooLong \u2014 load 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/arc-agi-3/src/plan-archive.ts"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"88706d1121323b1c46a22a3e2ff1c240bdd64dc0bd0822c584c7446b3298dda8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: tools.registerActorTools: FunctionTooLong \u2014 registerActorTools runs 220 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 120 over it, 2.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/arc-agi-3-chatgpt/src/tools.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"9414bd337ef9e0096adc7f817c8870c550514e4f1513b6485545d18d4282d228"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ArcEpisodeStore: ClassTooLong \u2014 872 significant lines (blank, comment-only and punctuation-only lines excluded), 31 methods. The bar is 400 significant lines; this is 472 over it, 2.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/arc-agi-3-chatgpt/src/store.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4878c9223fc9e83d03539e6e86e4eaa077351695790468e079d059a3b8d05ac"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/store.ts: FileTooLong \u2014 1032 significant lines (blank, comment-only and punctuation-only lines excluded), about 84% of them inside a single declaration: ArcEpisodeStore (216-1322). The bar is 500 significant lines; this is 532 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/arc-agi-3-chatgpt/src/store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aaff4ca3b140883bcc93aac7f503acbb0927c40016e33dcc9d23b85c9bc7518"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: checkpoint.validateSupervisorState: FunctionTooLong \u2014 validateSupervisorState runs 204 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 104 over it, 2.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/arc-agi-3/src/checkpoint.ts"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c78a4d17cd936243ef629d6889c510631def417b21180cc4b0456da17f4bf98"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/field-memory.ts: FileTooLong \u2014 991 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 491 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/field-memory/src/field-memory.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c61502d19733de010c4042d2206b5a94d3579eb8b08014d8bd1e4160f991df"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/official-factory.ts: FileTooLong \u2014 987 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 487 over it, 1.97\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/arc-agi-3-chatgpt/src/official-factory.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4907da097c696b0c9b1098142f7a922c5cdfbd217eb7ec1d1cb1920f9f2a5dcd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GovernedVariationOperator.run: MethodTooLong \u2014 run 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/avo/src/operator.ts"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85a998c306fd748bf2ea54bd8003adf13bafb4c22ce2072d19ac8b5c2373576"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/checkpoint.ts: FileTooLong \u2014 896 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 396 over it, 1.79\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/arc-agi-3/src/checkpoint.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29587f9c0ec7ed679e494921676002f5264b966305fdd26e143c4cbea3bca2c3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: RepoImporter.RepoImporter: FunctionTooLong \u2014 RepoImporter 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":"apps/web-ui/src/components/RepoImporter.tsx"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2baa8a9a668d3548fe5ff114e7d4ff166a4174a05e205a32b3ae03f94fe800a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FieldMemory.update: MethodTooLong \u2014 update 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/field-memory/src/field-memory.ts"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4efe81de84f212a2d96886bab04a94b3c9ef0cd3a42c41cb6f432f31ba8762"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/plan-archive.ts: FileTooLong \u2014 831 significant lines (blank, comment-only and punctuation-only lines excluded), about 66% of them inside a single declaration: ArcPlanArchive (364-1060). The bar is 500 significant lines; this is 331 over it, 1.66\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/arc-agi-3/src/plan-archive.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b51fcd543d5df92c16c2d4dce8e10598b2b35ac14bd24d389cc60360e304d4c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ArcController: TooManyMethods \u2014 49 methods. The bar is 30 methods; this is 19 over it, 1.63\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/arc-agi-3/src/controller.ts"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"30259d33703ad72a689c262af876398c939d66b3039d9c2f9d0b63ace051a92a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: server.createArcMcpRuntime: FunctionTooLong \u2014 createArcMcpRuntime 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/arc-agi-3-chatgpt/src/server.ts"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb38d559ca2ba7d00b23474b3383fb133ef07de11721176d2fa3774069361f5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArcController.actCriticalSection: MethodTooLong \u2014 actCriticalSection 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/arc-agi-3/src/controller.ts"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"753440d6f55c7957aa1ae905d3de87475c5da59ec0c8f5655044ade2ac826875"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: meta-proxy-service.enableMetaProxyService: FunctionTooLong \u2014 enableMetaProxyService 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/create-agent-harness/src/meta-proxy-service.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b14d8352333f47c9b2df92f4f375368f008b3fb7eed930a0f67449632db0413"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: production-run.runProductionFlywheel: FunctionTooLong \u2014 runProductionFlywheel 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/flywheel/src/production-run.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"193be7a0563777b37e175855dd647d730eacd452bf08014ca897b49fe1a7e14a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/index.ts: FileTooLong \u2014 732 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 232 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/create-agent-harness/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7ca3ad4728ec262fbca270811b8b5956a96cf8b36a6be5c748882000ba60ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: OnboardingModal.OnboardingModal: FunctionTooLong \u2014 OnboardingModal 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":"apps/web-ui/src/components/OnboardingModal.tsx"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf015f0590bbd6d9c69464d077d46374f091d8a96fe9851a878348e56949e7ec"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ArcPlanArchive: ClassTooLong \u2014 550 significant lines (blank, comment-only and punctuation-only lines excluded), 11 methods. The bar is 400 significant lines; this is 150 over it, 1.38\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/arc-agi-3/src/plan-archive.ts"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e861fcad71847dacd4bbb03b7dc210c86316029fb27a80c98234e6e9c0c3e61"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: python/bridge.py: FileTooLong \u2014 684 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 184 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/arc-agi-3/python/bridge.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61dd3682055a410de938e68db50d5f59a6796c9586f3eb90ef79e25fd186503"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/python-bridge.ts: FileTooLong \u2014 681 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 181 over it, 1.36\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3/src/python-bridge.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9dc9b38f60faa0dbfe184b940a3951a2425682ba1fc38246b7a16eb444946b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ArcAvoLoop: ClassTooLong \u2014 542 significant lines (blank, comment-only and punctuation-only lines excluded), 23 methods. The bar is 400 significant lines; this is 142 over it, 1.36\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/arc-agi-3/src/avo-loop.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad4ea510fe0f55a81848bc635709edfdfe976f94113fcfb0d2b0592405cb197"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: numeric-evolve.evolveNumeric: FunctionTooLong \u2014 evolveNumeric 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/darwin-mode/src/numeric-evolve.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"535ebdc3937feccf5c840ac963a009637e4a613a8a50d7b2804b32b3bacaa25f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: engine.runContrastive: FunctionTooLong \u2014 runContrastive 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/darwin-mode/src/contrastive/engine.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a56e9c9a11873d1e1bb64a039ba642793712af6271706af4de64cb79422d050"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: run.runFlywheelGenerations: FunctionTooLong \u2014 runFlywheelGenerations 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/flywheel/src/run.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"72015b76ecb902c2615d632bfd80ef73718ef56b192e8649007f8539d1f81a93"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/avo-loop.ts: FileTooLong \u2014 642 significant lines (blank, comment-only and punctuation-only lines excluded), about 84% of them inside a single declaration: ArcAvoLoop (123-836). The bar is 500 significant lines; this is 142 over it, 1.28\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/arc-agi-3/src/avo-loop.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d8397886da238016bace74a9d6b94bca712b63424be8b5d03b617b36d2c555"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/canonical.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/arc-agi-3/src/canonical.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd34146cc9729f54d78d46726372ac87a51532fbea287ee6e80b8b7b489cd84"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: memory-rvf.createRvfBackend: FunctionTooLong \u2014 createRvfBackend 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/kernel-js/src/memory-rvf.ts"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"b99ef32ae9236ce3711d2be2dfd408c3ad844f4d453a0fd0251d719d9c15466c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/meta-proxy.ts: FileTooLong \u2014 634 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 134 over it, 1.27\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/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a9787ecd55e0eae0858b3f815b5b466f26d51ef51fbd21b63d9888f7dcc1aef"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: runner.runEpisode: FunctionTooLong \u2014 runEpisode 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/arc-agi-3-bench/src/runner.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"63467e0823a130b3c724deed5bcd2d631945c79063089ab54e978441719a16b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/operator.ts: FileTooLong \u2014 622 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 122 over it, 1.24\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/avo/src/operator.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a16879047efa22da0c50cf7e7db81bd4dfa78724b3ffca70a381916cfd9751"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 618 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 118 over it, 1.24\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/horizon/crate/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f74e642fd882fdca10c268ae16d5350d742a5cfc981a3d223a9a28fcd21eafd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArcPlanArchive.addCandidates: MethodTooLong \u2014 addCandidates 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/arc-agi-3/src/plan-archive.ts"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"6574767e4e8823fadfdb8435527ecaed23cd7589883628f5901223185f459a53"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArcAvoLoop.#stepCritical: MethodTooLong \u2014 #stepCritical 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/arc-agi-3/src/avo-loop.ts"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7615de6a90db71298ba21ea7b5a9be1df3d8b3ca8a6ace2243538fe4603a590"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: h1-submit.gatedSubmit: FunctionTooLong \u2014 gatedSubmit 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/redblue/src/integrations/h1-submit.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac539c606836fceef778161c4cf28e86c256045ebdb0a33da11f4662efe4beb4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/tools.ts: FileTooLong \u2014 583 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 83 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/arc-agi-3-chatgpt/src/tools.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00df2b253397bb8094fdc2da491bad134cf22501069277e026db3d9ecf80fda6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/claim-gate.ts: FileTooLong \u2014 579 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 79 over it, 1.16\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/avo/src/claim-gate.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"056c3b8c98449c6a36de93cc8c536bca85370dc543babda5954da7e3f6260a42"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/meta-proxy-service.ts: FileTooLong \u2014 576 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 76 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/create-agent-harness/src/meta-proxy-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3cd14dd46aef6e2b79ad91bdfcb2b29404d84b9cf8b5e97d510c939b2d7f17f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: audit-cmd.auditCmd: FunctionTooLong \u2014 auditCmd 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/create-agent-harness/src/audit-cmd.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"350f37dabc3e1f45d568619f1647f518b71a5fb2f72cf8c487286d9e4720bd67"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: blue.basePatchFor: FunctionTooLong \u2014 basePatchFor 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/redblue/src/actors/blue.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"44920969cd7c33916a72f4d1bf8057c1f9628ee134a876b53befabc5d483a88b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/model.rs: FileTooLong \u2014 566 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 66 over it, 1.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kimi-k3-harness/crates/k3rs/src/model.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b8f7d3f7448ec697c5ca58272a27c211ea214eda123c1884489b573206eca9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: host-config.hostConfigFiles: FunctionTooLong \u2014 hostConfigFiles 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/create-agent-harness/src/host-config.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"31abe2f83d8756c0194a8778e27324b6f978e6e549de75302c2e16c0d6982f34"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FieldMemory.choose: MethodTooLong \u2014 choose 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/field-memory/src/field-memory.ts"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7171965145b91b11a68cf165d7667ec0bb51a289407881166c66acd6157a779"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: multigeneration-proof.verifyMultiGenerationEvidence: FunctionTooLong \u2014 verifyMultiGenerationEvidence 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/flywheel/src/multigeneration-proof.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"f90e1229670af374db265cb815a64f13dc90c407394c707dcde084b35c8ffb22"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: scaffold.hostFiles: FunctionTooLong \u2014 hostFiles 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":"apps/web-ui/src/generator/scaffold.ts"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"897a3f1a50282c7edafbaae743c9ed2abc906c7021a762801580cae1d0fa3fee"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: poker_darwin::darwin::evolve: FunctionTooLong \u2014 poker_darwin::darwin::evolve runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"crates/poker-darwin/src/darwin.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"26694bb5b4d9b2749e5fb5e0bac1c7632e0354badbd18a661eba0e56087c159d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: safety-ast.analyzeSurfaceSource: FunctionTooLong \u2014 analyzeSurfaceSource 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/darwin-mode/src/safety-ast.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aeb56cc1ff4ed65ba2873b754a1e5b9ae4ace45a62c0202c9e99bbd1d055126"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArcEpisodeStore.saveAvoCheckpoint: MethodTooLong \u2014 saveAvoCheckpoint 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/arc-agi-3-chatgpt/src/store.ts"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc73ee324e7b26a94930f8c4be3f5f3decef92913cbb0b286b191ecd59582596"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArcEpisodeStore.resumeAvoPersisted: MethodTooLong \u2014 resumeAvoPersisted 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/arc-agi-3-chatgpt/src/store.ts"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7434d8201b56c3dc9ad0e413c81ab6aac77678a1b548f2361e74199e1f9473c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: checkpoint.validateCheckpointCrossFields: FunctionTooLong \u2014 validateCheckpointCrossFields 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/arc-agi-3/src/checkpoint.ts"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"6962c95dac8c37a2f6e3e19277ebb8c6a9c616a91d0ce9a4a0329c527f6d4021"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: k3rs::json::value: FunctionTooLong \u2014 k3rs::json::value runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"kimi-k3-harness/crates/k3rs/src/json.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"76096878f6fce7b5c95762e07cdfe5a8d19ad41e57ba8d513639dae5b9b2889c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: report.buildBenchmarkReport: FunctionTooLong \u2014 buildBenchmarkReport 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/arc-agi-3-bench/src/report.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"b059eef9a2be0df373a0374c2adf6f54a496ef4da2b3f600fa297aae0334495d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: meta-proxy.metaProxyCmd: FunctionTooLong \u2014 metaProxyCmd 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/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f3a336bb0d3fcf27648cc096f0f5eb4b6d1b7ffc816ab8226cf7b6f94d7575"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: confirmation.confirmContrastive: FunctionTooLong \u2014 confirmContrastive 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/darwin-mode/src/contrastive/confirmation.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"856772c9a271f8e62d85537a4cceafe3654267066c11f282eefacc33b198a3f5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: App.App: FunctionTooLong \u2014 App 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":"apps/web-ui/src/App.tsx"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"9284d108ed4798a06a5080197e9073ee0e36a7ca8601df2d450c34d4a4878360"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: supervisor.commitTypedSupervisorDirective: FunctionTooLong \u2014 commitTypedSupervisorDirective runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.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/arc-agi-3/src/supervisor.ts"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"edfbbf017085e6bbbf78064ead3c253be66d7235559fdd04ae152c6b62f4dc43"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: completion.verifyCompletionCertificate: FunctionTooLong \u2014 verifyCompletionCertificate runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.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/horizon/src/completion.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6930d37cabfb45111add6e0e9e353dfa12a0caed7aa350e5089a2295b962f3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ArcEpisodeStore: 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/arc-agi-3-chatgpt/src/store.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dcfc8aeee6eaac5c8e60ea841feba689576590a09c79dfacfe4d7f284e0f0b0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: k3rs::model::kda_layer: FunctionTooLong \u2014 k3rs::model::kda_layer runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"kimi-k3-harness/crates/k3rs/src/model.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"beaae5a04d9b1a8567abec1173269d963a51d1cc9874aae820fa9bbfa4431774"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: real-evolve.evolveDetectorsReal: FunctionTooLong \u2014 evolveDetectorsReal 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/darwin-mode/src/security/real-evolve.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7f509406c01110f7ad9b134a2cc8d837779b531745c92a33fd3401d13cec68"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FieldMemory: ClassTooLong \u2014 408 significant lines (blank, comment-only and punctuation-only lines excluded), 8 methods. The bar is 400 significant lines; this is 8 over it, 1.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/field-memory/src/field-memory.ts"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7098ea6f56dfec013e1c22b5b5480f9975b8da45d0d9b3a799f5ae30fce583c"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 23 shared lines): docs/research/retort-placement/analyze2.py:65-162 | docs/research/retort-placement/analyze3.py:85-185 | docs/research/retort-placement/analyze4.py:105-195 \u2014 These 3 members are variants of one another: a block of 23 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/retort-placement/analyze2.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d2f1022671ebb5e17fe5dd5cf2de544b7714b21166eb7a4034de92c23bcaac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): packages/horizon/crate/src/lib.rs:97-136 | packages/oo-agents/crate/src/lib.rs:61-114 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/horizon/crate/src/lib.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"638944b50a13f0546f3d616608c59f31a98dbf159bd1621c0c995b179328e832"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): kimi-k3-harness/crates/k3rs/src/avx2.rs:70-91 | kimi-k3-harness/crates/k3rs/src/avx2.rs:96-121 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kimi-k3-harness/crates/k3rs/src/avx2.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"d348c83e0eb9863110b32c3d3f6e48808cba52a4b90e97eaa8fc4b61571ece2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): docs/research/retort-placement/analyze3.py:68-81 | docs/research/retort-placement/analyze4.py:70-83 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/retort-placement/analyze3.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a68465941329d90c39f394b26e2bef3e065f5415cf5b1efe48ba39eff8dd8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): docs/research/retort-placement/harvest2.py:52-62 | docs/research/retort-placement/harvest3.py:56-72 | docs/research/retort-placement/harvest4.py:58-74 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/retort-placement/harvest2.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"f922b29c1927ac89ac85e1cd7a2265cd0a115277a3f976b69c4414779668e768"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): docs/research/retort-placement/harvest2.py:25-48 | docs/research/retort-placement/harvest3.py:25-52 | docs/research/retort-placement/harvest4.py:25-54 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/retort-placement/harvest2.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"735aaa51b684fccda3bbb659f4be4887d06615451ad9eda8e48c363ecbcbdc80"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): kimi-k3-harness/crates/k3-kernel-bench/src/lib.rs:69-89 | kimi-k3-harness/crates/k3-kernel-bench/src/lib.rs:125-143 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kimi-k3-harness/crates/k3-kernel-bench/src/lib.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c9ae435cbaec836db3b7a30a0abc65f244e0e55f152126f58c6a15b6adc4e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): docs/research/retort-placement/analyze2.py:30-34 | docs/research/retort-placement/analyze3.py:33-37 | docs/research/retort-placement/analyze4.py:35-39 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/retort-placement/analyze2.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"65064eabcc1e55a5e9be6452a82854163e4de42ead6d58125c109e0a4327216d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): docs/research/retort-placement/analyze2.py:51-53 | docs/research/retort-placement/analyze3.py:54-56 | docs/research/retort-placement/analyze4.py:56-58 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/retort-placement/analyze2.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1104775b47b349af02ae04c1d8492ef36e6a6d00bacfebc5c1139453e8c4d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/kernel-napi/src/lib.rs:13-20 | crates/kernel-wasm/src/lib.rs:16-23 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/kernel-napi/src/lib.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"742f406b4eda38d07208ba555a8b2ed317d36f0b7813435796e5f02be7916afb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/kernel-wasm/src/lib.rs:38-43 | crates/kernel-wasm/src/lib.rs:57-63 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/kernel-wasm/src/lib.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b57690cc12fbb23c00bfaed9cbd5d6299982f069e22420ed5f6ecbadea28eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): docs/research/retort-placement/analyze2.py:68-79 | docs/research/retort-placement/analyze3.py:87-97 \u2014 before extracting anything, compare \u0060docs/research/retort-placement/analyze2.py\u0060 and \u0060docs/research/retort-placement/analyze3.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 67 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/retort-placement/analyze2.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"59fbb86d36796d41c7071c4511f1a58c5764b8be05b18526ac4e8e26bc3dd364"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u201310 lines \u00D7 3): docs/research/retort-placement/analyze2.py:123-132 | docs/research/retort-placement/analyze3.py:152-161 | docs/research/retort-placement/analyze4.py:169-171 \u2014 before extracting anything, compare \u0060docs/research/retort-placement/analyze2.py\u0060 and \u0060docs/research/retort-placement/analyze3.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 67 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060docs/research/retort-placement/analyze4.py:169\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060docs/research/retort-placement/analyze2.py:121\u0060 calls \u0060list\u0060, \u0060is_dominated\u0060 and \u0060docs/research/retort-placement/analyze4.py:168\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/retort-placement/analyze2.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c349d8e7c87968196020c23ad33e4b7ee6fe1c3b0ef2ee0b3f44cfc7bee303b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): docs/research/retort-placement/analyze2.py:39-47 | docs/research/retort-placement/analyze3.py:42-50 | docs/research/retort-placement/analyze4.py:44-52 \u2014 before extracting anything, compare \u0060docs/research/retort-placement/analyze2.py\u0060 and \u0060docs/research/retort-placement/analyze3.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 67 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/retort-placement/analyze2.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4458cb225c4d4472616c943b15ed867d72e480d1d4ad51a7eefba3dec1f5e9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 3): docs/research/retort-placement/analyze2.py:74-81 | docs/research/retort-placement/analyze3.py:93-99 | docs/research/retort-placement/analyze4.py:113-119 \u2014 before extracting anything, compare \u0060docs/research/retort-placement/analyze2.py\u0060 and \u0060docs/research/retort-placement/analyze3.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 67 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/retort-placement/analyze2.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ac0c69ba8ee26f6b8b817977d30aadd66d1a1fb1da36823647b54719bf86b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): docs/research/retort-placement/analyze2.py:106-118 | docs/research/retort-placement/analyze3.py:135-147 | docs/research/retort-placement/analyze4.py:154-166 \u2014 before extracting anything, compare \u0060docs/research/retort-placement/analyze2.py\u0060 and \u0060docs/research/retort-placement/analyze3.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 67 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/retort-placement/analyze2.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4bbd030c9b60e7ab1c4f79cc9ae443232ce55d51905276529e2993850b52d5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): docs/research/retort-placement/analyze3.py:68-76 | docs/research/retort-placement/analyze4.py:70-78 \u2014 before extracting anything, compare \u0060docs/research/retort-placement/analyze3.py\u0060 and \u0060docs/research/retort-placement/analyze4.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/retort-placement/analyze3.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"73259cea76eadb8cc001eb93f1325b82978aad64d7633b453b55fae8e2876b69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): docs/research/retort-placement/analyze2.py:144-153 | docs/research/retort-placement/analyze3.py:72-81 | docs/research/retort-placement/analyze4.py:74-83 \u2014 before extracting anything, compare \u0060docs/research/retort-placement/analyze2.py\u0060 and \u0060docs/research/retort-placement/analyze3.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 67 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/retort-placement/analyze2.py"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f5768ff3a14e8b393452e3f166ee1af897b2d0968e8f8689fdf91013b8b5e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): docs/research/retort-placement/harvest2.py:25-35 | docs/research/retort-placement/harvest3.py:25-35 | docs/research/retort-placement/harvest4.py:25-35 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060docs/research/retort-placement/harvest3.py:36\u0060 calls \u0060get\u0060 and \u0060docs/research/retort-placement/harvest2.py:36\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/retort-placement/harvest2.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"4904a8343544f209a26701d580bc2e4b819c4896d624b0fb70caab7b24dfac46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): docs/research/retort-placement/analyze2.py:57-61 | docs/research/retort-placement/analyze3.py:60-64 | docs/research/retort-placement/analyze4.py:62-66 \u2014 before extracting anything, compare \u0060docs/research/retort-placement/analyze2.py\u0060 and \u0060docs/research/retort-placement/analyze3.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 67 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/retort-placement/analyze2.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"4672dcea78222a1569df405ad0d363a851fd8ed0fdbb2fa4e1fdc2bef761db3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): docs/research/retort-placement/harvest2.py:56-61 | docs/research/retort-placement/harvest3.py:60-65 | docs/research/retort-placement/harvest4.py:62-67 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/retort-placement/harvest2.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"790b52848795648b94a50cece181ac7efbba8a8df76365bcb425faa9462c90b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): packages/horizon/crate/src/lib.rs:113-128 | packages/oo-agents/crate/src/lib.rs:91-106 \u2014 before extracting anything, compare \u0060packages/horizon/crate/src/lib.rs\u0060 and \u0060packages/oo-agents/crate/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packages/horizon/crate/src/lib.rs:113\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/horizon/crate/src/lib.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f2ea8cedc2a3e0508fbd81e521207a78ea2fb4aa590b1b74527c9cb2794481"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): packages/horizon/crate/src/lib.rs:98-111 | packages/oo-agents/crate/src/lib.rs:62-75 \u2014 before extracting anything, compare \u0060packages/horizon/crate/src/lib.rs\u0060 and \u0060packages/oo-agents/crate/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packages/horizon/crate/src/lib.rs:98\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/horizon/crate/src/lib.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01dbfc5e6ec45b2dca503e16210f8cb64d192027b223bdf31ff838d5691c810"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): packages/horizon/crate/src/lib.rs:139-152 | packages/oo-agents/crate/src/lib.rs:77-90 \u2014 before extracting anything, compare \u0060packages/horizon/crate/src/lib.rs\u0060 and \u0060packages/oo-agents/crate/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/horizon/crate/src/lib.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"5611da3ca0267645bf2a7464a446f3ef2dfa093d64acfc0734942ff33b0863bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/kernel/src/dispatch.rs:63-74 | crates/kernel/src/dispatch.rs:98-108 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/kernel/src/dispatch.rs:63\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/kernel/src/dispatch.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc2ec62ef7ed43ec9f7b3111e75563b819786c48f0b41d83d38aab4eef4c740f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): packages/oo-agents/crate/src/lib.rs:632-643 | packages/oo-agents/crate/src/lib.rs:669-680 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packages/oo-agents/crate/src/lib.rs:632\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/oo-agents/crate/src/lib.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"042683abdf728fb90ddb67756ab46e190eeba5afec506e469aad38cb7ee6115e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): kimi-k3-harness/crates/k3rs/src/ops.rs:280-289 | kimi-k3-harness/crates/k3rs/src/ops.rs:299-308 \u2014 both copies are in the same file, so extract the block 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":"kimi-k3-harness/crates/k3rs/src/ops.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfcc1167a3d3f6abf0c3c1858b820c1745f915230f97c87aba8fd7f8abc8ee6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): kimi-k3-harness/crates/k3rs/src/ops.rs:130-138 | kimi-k3-harness/crates/k3rs/src/ops.rs:142-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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kimi-k3-harness/crates/k3rs/src/ops.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5bf2d09d2d84f736b43936ddb08fec145346a64dae6abc5b9230e4cb2b8bc00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): kimi-k3-harness/crates/k3rs/src/avx2.rs:71-78 | kimi-k3-harness/crates/k3rs/src/avx2.rs:97-104 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060kimi-k3-harness/crates/k3rs/src/avx2.rs:71\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060row\u0060 to \u0060\u0026[f32]\u0060 in one and \u0060\u0026[u16]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kimi-k3-harness/crates/k3rs/src/avx2.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de20e630117c28dce8bcd1babab720ba834f2c2979680529a3fc0ad90ed81b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): kimi-k3-harness/crates/k3rs/src/json.rs:144-156 | packages/oo-agents/crate/src/lib.rs:153-163 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060kimi-k3-harness/crates/k3rs/src/json.rs:144\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kimi-k3-harness/crates/k3rs/src/json.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"da31590f311ecc5f35a879a34fe9567fbf246d70fba03ecae4bc2f00dd4b0eee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): kimi-k3-harness/crates/k3rs/src/ops.rs:326-332 | kimi-k3-harness/crates/k3rs/src/ops.rs:372-378 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060kimi-k3-harness/crates/k3rs/src/ops.rs:326\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kimi-k3-harness/crates/k3rs/src/ops.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a3c774a2a10166b9c29bf09cdf6a80517f3b7b36af4f914183968fcc251e6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): kimi-k3-harness/crates/k3rs/src/json.rs:70-74 | packages/oo-agents/crate/src/lib.rs:123-127 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kimi-k3-harness/crates/k3rs/src/json.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31d390ed59a7ebb82e2935458cf437fff563b260c123e381a3c3c1a044d4c7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): packages/horizon/crate/src/lib.rs:917-922 | packages/oo-agents/crate/src/lib.rs:1390-1395 \u2014 before extracting anything, compare \u0060packages/horizon/crate/src/lib.rs\u0060 and \u0060packages/oo-agents/crate/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/horizon/crate/src/lib.rs"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"3206790dfa2416842be1a86f59abdc45130022d5994817fd040c430d5cd4499c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): packages/horizon/crate/src/lib.rs:205-216 | packages/horizon/crate/src/lib.rs:230-241 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packages/horizon/crate/src/lib.rs:205\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/horizon/crate/src/lib.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2569d000e203d4529bcf767b09a9be567adf5fa83dd57e2f6caca313464d23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): kimi-k3-harness/crates/k3rs/src/json.rs:159-165 | packages/oo-agents/crate/src/lib.rs:166-172 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060kimi-k3-harness/crates/k3rs/src/json.rs:159\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kimi-k3-harness/crates/k3rs/src/json.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c901436954f386a2661a1cce1aebd7d767c40e4fdfcb02313fd148cbd7ce6f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 2\u002B corresponding lines): scripts/generate-readme-visuals.py:21-22 | scripts/generate-readme-visuals.py:26-27 | scripts/generate-readme-visuals.py:31-32 | scripts/generate-readme-visuals.py:36-37 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/generate-readme-visuals.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb50de10c01ac4fecefaffde7968a6678cf05b37484023c2bc716d8b0d011e36"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project metaharness: metaharness has instability 0.88 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b95c0dd3f4b61177fa6bcc916a49c2159972de56076cc4d81f59025d057e3221"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: @metaharness/turn-credit: @metaharness/turn-credit: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"2b920b21210c8559d1a7af41f95ecbb3e50d3323d551d7c5361c0d93739ff423"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: @metaharness/vertical-base: @metaharness/vertical-base: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6009d9e0c377727e008b8d193babe95ed2fe089ff32b36cc627ca7e620529347"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: @metaharness/workspace-lens: @metaharness/workspace-lens: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8048834a32b5221aa0fbfa2624df48db5af1091ab1ececc8df8d0b4bd592aef0"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: @metaharness/darwin: @metaharness/darwin: abstractness 0.09, instability 0.00, distance 0.91 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9a125d173c2c1c60e3e88cfdb76a68f718a2dfdcb004f1cbae5ae113ed55a111"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: @metaharness/weight-eft: @metaharness/weight-eft: abstractness 0.14, instability 0.00, distance 0.86 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"64e4a20d68f2f2ecca5cec997146cdb3e7f79f29272e7621bffda7fc182c5960"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: @metaharness/flywheel: @metaharness/flywheel: abstractness 0.17, instability 0.00, distance 0.83 \u2014 zone of pain \u2014 concrete and depended on by 8 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5bd89e39db49ed26ae28580f4a2d4a892bcce053e9e7df9c7a6f9a5e033a01fc"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: @metaharness/redblue: @metaharness/redblue: abstractness 0.19, instability 0.00, distance 0.81 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e3d30c063459aa9aff96f329694cfef43a4ef53d971920713551decc9dc250c6"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: @metaharness/radio: @metaharness/radio: abstractness 0.20, instability 0.00, distance 0.80 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"44d7738af59bd6be90aba28a59f5a4da744a5b338f5a9baee54c243dd007151f"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: @metaharness/horizon: @metaharness/horizon: abstractness 0.23, instability 0.00, distance 0.77 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a400d5e534d93e050783ea2850b6d22024664a415a74104cd062aa7957154830"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: @metaharness/harness: @metaharness/harness: abstractness 0.25, instability 0.00, distance 0.75 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"23c43951e1f69704f77bfe72a5b027a8057f228dc3df72ff62331dad1e3ff73a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: RuvSecurityMemory (LCOM4 4): RuvSecurityMemory\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/src/security/memory.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d020562817c6abf982fe65348d67d3295f3f5d49c13ff5f999989a4f2dbfdf5"}},{"ruleId":"D8","level":"warning","message":{"text":"Coverage not measured \u2014 JavaScript/TypeScript suite: Coverage NOT MEASURED: the JavaScript/TypeScript half could not be measured \u2014 the repository root runs vitest but declares no coverage provider, so the suite can run and still produce no lcov \u2014 add \u0060@vitest/coverage-v8\u0060 (or \u0060@vitest/coverage-istanbul\u0060) as a devDependency. Coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository\u0027s maintainers can perform; once it passes, the real number is measured on the next scan."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"62e63e619c28f057e129f2997c965d32a457366a9ce18ca019ffb6bdfba85c99"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: (skipped: no Directory server reachable at ${TEST_SERVER_ADDRESS} \u2014 run docker compose up in agntcy/dir\u0027s install/docker/ to exercise this test live): Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/agntcy/src/oasf/__tests__/publish.test.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac19a8eda217a31b616e5d119f04d18e5f70591a28a171eaa72560c532201f90"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: serializes concurrent callers so only one request is in flight: 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, 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/arc-agi-3/__tests__/python-bridge.test.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1964b03529f1d3e9e6b98e8d3254f086e0741615a83e357766ea2707559dbdc"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: the repository rootpackages/darwin-mode/__tests__/security/real-loop.test.ts::real semgrep as the in-loop judge does NOT promote a candidate equal to the incumbent (no improvement): Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"93670cdee5f81855e30c1bab5a9142860747ca473d03043d653dccd2e01366e0"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: the repository rootpackages/darwin-mode/__tests__/security/real-loop.test.ts::real semgrep as the in-loop judge promotes a broader rule over a narrower incumbent (statistically, zero FP): Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8f16404bc8bf80098b6c933db8df0286dcdaa8f795673346b6a5269b48feef32"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: the repository rootpackages/darwin-mode/__tests__/security/semgrep-oracle.test.ts::real semgrep on the labeled fixture is reproducible across runs (deterministic findings for a fixed version): Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fe79b606e1c05bc2e227478696261b46f05569442fbe21a7ec0fb2f4595533f2"}},{"ruleId":"D13","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":"156b02f49a7af1653f6070c01156ce2e249f1590fa13689b82059b4b9cd2f1d4"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","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":"48215f3c4ed123c298013c6db6eb8d579742bb6f5a0af340e07a755dbdcae7da"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","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":"355c11686283d6dd5c4a76579c43a11f3460913e754bd5f48601d0fdc61e0552"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","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":"2db81fb23f32794d5e66f85f2e835a21b024e5c853a482dab380813d6f772929"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","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":"089a00e651c48fbed9d0f3b9c4870244869b663f2eaf217fc0245f90c19dc1e5"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/create-agent-harness/src/index.ts: packages/create-agent-harness/src/index.ts changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in index.renderScaffold at line 681. 2 of those changes were fix/bug commits, and the other 8 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:18:43 -05:00\u0027 --until=\u00272026-11-11 17:18:43 -05:00\u0027 --full-history --no-merges -- packages/create-agent-harness/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/create-agent-harness/src/index.ts"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e3ee95a4f53b3ee873f69d9ba38f17eefdda1f908a5cb4b62785c27806d82f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/flywheel/src/replay.ts: packages/flywheel/src/replay.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in replay.verifyReplayBundle at line 96. 1 of those changes was a fix/bug commit, and the other 3 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:18:43 -05:00\u0027 --until=\u00272026-11-11 17:18:43 -05:00\u0027 --full-history --no-merges -- packages/flywheel/src/replay.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flywheel/src/replay.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc3fa855a582e13760f19d3bbfaa426cf5cef6276a6425bc4e450b99162494f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/avo/src/operator.ts: packages/avo/src/operator.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in GovernedVariationOperator.run at line 421. 1 of those changes was a fix/bug commit, and the other 2 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:18:43 -05:00\u0027 --until=\u00272026-11-11 17:18:43 -05:00\u0027 --full-history --no-merges -- packages/avo/src/operator.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/avo/src/operator.ts"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade55eaa22897f0b75062cb55114f4a994a6b599df590ca7d699666770e38bda"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/flywheel/src/run.ts: packages/flywheel/src/run.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in run.runFlywheelGenerations at line 91. 2 of those changes were fix/bug commits, and the other 2 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:18:43 -05:00\u0027 --until=\u00272026-11-11 17:18:43 -05:00\u0027 --full-history --no-merges -- packages/flywheel/src/run.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flywheel/src/run.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4ad13e392f185ebe95495d46d9156c191efaeda089d937a877badbe3c28294"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/create-agent-harness/src/subcommands.ts: packages/create-agent-harness/src/subcommands.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in subcommands.doctor at line 84. 3 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:18:43 -05:00\u0027 --until=\u00272026-11-11 17:18:43 -05:00\u0027 --full-history --no-merges -- packages/create-agent-harness/src/subcommands.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/subcommands.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7d8a57a6bc4ef04fbdd1b4d7417d3617bb9a267f49b1c74ea125d18043595e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/darwin-mode/src/cli.ts: packages/darwin-mode/src/cli.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in cli.main at line 286. 1 of those changes was a fix/bug commit, and the other 3 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:18:43 -05:00\u0027 --until=\u00272026-11-11 17:18:43 -05:00\u0027 --full-history --no-merges -- packages/darwin-mode/src/cli.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/src/cli.ts"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8487df5a67017d19b4d168c8450e8670a35302038b8ce97548310df6a20589"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/flywheel/src/multigeneration-proof.ts: packages/flywheel/src/multigeneration-proof.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in multigeneration-proof.verifyMultiGenerationEvidence at line 276. 1 of those changes was a fix/bug commit, and the other 1 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:18:43 -05:00\u0027 --until=\u00272026-11-11 17:18:43 -05:00\u0027 --full-history --no-merges -- packages/flywheel/src/multigeneration-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/flywheel/src/multigeneration-proof.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"8babdd8441ff88ccc4db3521ba569167a55f594e8ded90bab3fef13c8e6765a2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/create-agent-harness/src/mcp-scan.ts: packages/create-agent-harness/src/mcp-scan.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in mcp-scan.scanMcp 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:18:43 -05:00\u0027 --until=\u00272026-11-11 17:18:43 -05:00\u0027 --full-history --no-merges -- packages/create-agent-harness/src/mcp-scan.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/mcp-scan.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b210df7c8d4593be393ccd5a58375f81cd5e1622c6d5f2bd30a29561627607"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/redblue/src/mock-target.ts: packages/redblue/src/mock-target.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in mock-target.exampleAgentTarget at line 47. 1 of those changes was a fix/bug commit, and the other 1 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:18:43 -05:00\u0027 --until=\u00272026-11-11 17:18:43 -05:00\u0027 --full-history --no-merges -- packages/redblue/src/mock-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/redblue/src/mock-target.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fbb8f4c7b524bf435089688af618b58ad4d35d713d07cfdb42ed77b3dcca2d7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/create-agent-harness/src/host-config.ts: packages/create-agent-harness/src/host-config.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in host-config.hostConfigFiles at line 109. 2 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:18:43 -05:00\u0027 --until=\u00272026-11-11 17:18:43 -05:00\u0027 --full-history --no-merges -- packages/create-agent-harness/src/host-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/create-agent-harness/src/host-config.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b0aa6d1141285932b09d08fa4d2f9004e1eaecc798fb3afd9aee0ea423dd8bd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/web-ui/src/generator/scaffold.ts: apps/web-ui/src/generator/scaffold.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in scaffold.hostFiles at line 275. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:18:43 -05:00\u0027 --until=\u00272026-11-11 17:18:43 -05:00\u0027 --full-history --no-merges -- apps/web-ui/src/generator/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":"apps/web-ui/src/generator/scaffold.ts"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb1951d7583125dc6d0f362a14534e0a071f6df60bbc41dd4a935f5ec2fca9e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/create-agent-harness/src/upgrade-cmd.ts: packages/create-agent-harness/src/upgrade-cmd.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in upgrade-cmd.upgradeCmd 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:18:43 -05:00\u0027 --until=\u00272026-11-11 17:18:43 -05:00\u0027 --full-history --no-merges -- packages/create-agent-harness/src/upgrade-cmd.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/upgrade-cmd.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"a571a8cec4441278823545f140ebbb85caaaad91f3765c0ff9e2906307f407b8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/create-agent-harness/src/repo-scorecard.ts: packages/create-agent-harness/src/repo-scorecard.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in repo-scorecard.buildRepoScorecard 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:18:43 -05:00\u0027 --until=\u00272026-11-11 17:18:43 -05:00\u0027 --full-history --no-merges -- packages/create-agent-harness/src/repo-scorecard.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/repo-scorecard.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed7180b2c59c7fbe907318e10e49a0d2d40659c9a34a2c9d051a8105f2402052"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/create-agent-harness/src/threat-model.ts: packages/create-agent-harness/src/threat-model.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in threat-model.buildThreatModel 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:18:43 -05:00\u0027 --until=\u00272026-11-11 17:18:43 -05:00\u0027 --full-history --no-merges -- packages/create-agent-harness/src/threat-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/create-agent-harness/src/threat-model.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"61edff4c8329fd32a948face7fa5c0b9dffc584d2fb5e6b03417ab91710a9f9a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/create-agent-harness/src/analyze-repo.ts: packages/create-agent-harness/src/analyze-repo.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in analyze-repo.analyzeFiles at line 162. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:18:43 -05:00\u0027 --until=\u00272026-11-11 17:18:43 -05:00\u0027 --full-history --no-merges -- packages/create-agent-harness/src/analyze-repo.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/analyze-repo.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9fddab76fae621ed094f9affe57b073baab8453d95e53878efcff031571c5c5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: scripts/dream-release.mjs: scripts/dream-release.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 1 (its worst body is dream-release.run 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(agntcy, agent-harness-generator): install without the Buf registry; scaffold across filesystems; ADR-356 residuals (#490)\u201D; \u201Cfix(release): build and verify wasm in Release; pin wasm tools to crates.io (unblocks horizon 0.2.2) (#486)\u201D; \u201Cfix(release): wait out npm staged publish and CDN-cached 404s before byte verification (#472)\u201D; \u201Cfix(release): correct provenance metadata for Dream 0.4.19 (#427)\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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 17:18:43 -05:00\u0027 --until=\u00272026-11-11 17:18:43 -05:00\u0027 --full-history --no-merges -- scripts/dream-release.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/dream-release.mjs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"224fabf108634c65c9a9b07f67a192859a499e30f0ca45def9c653665d5be841"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(impl): admin.initializeApp(); return admin.firestore() as unknown as FirestoreLike. \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":"services/apicompletions/src/firestore/client.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"8374e81d6bc67e3d33cfe55c224030afb13b2b7ec38311b1b5eb9f756fd0dad1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(impl): hydrate from env \u002B Firestore tier_config. Skeleton returns static defaults. \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":"services/apicompletions/src/config/index.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada59b00cf1a4e43a66dc88fcb64533a7bb26e5bab881f15737d10e2238ef7ec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // present-path is left as a clearly-marked TODO. What ships here is the part that \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/darwin-mode/src/security/codeql-oracle.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"e347806c3c0cafbf54a754ee2f16ff187ea0ff40159761dfed604e1d3e79328f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Tier 3 #10): implement the present-path:"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/src/security/codeql-oracle.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d1cf86ed4a43c4cac2def615c0472b1e6c79d2d713e2abffc58e07ce492d70"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(agntcy-identity-signing): once a \u0060witnessSign\u0060 binding is added to \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/agntcy/src/identity/sign.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e363474d9fdb87f61d91c7b47df17706d8557ed1e267293726d67de14e96ad9"}},{"ruleId":"D20","level":"note","message":{"text":"ADR declares no status: \u0060docs/adrs/ADR-271-avo-receipts-as-flywheel-gate-evidence.md\u0060 declares no status, while 249 of the 249 other records in \u0060docs/adrs\u0060 do, so a reader cannot tell whether this decision is in force. Add a \u0060Status:\u0060 line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adrs/ADR-271-avo-receipts-as-flywheel-gate-evidence.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb2f955ff15f971bdd17604542930c0b01b19a0e1796ccd54e6abb4361b42dd"}},{"ruleId":"D20","level":"note","message":{"text":"ADR superseded but its status says otherwise: docs/adrs/ADR-108-darwin-evolution-series-synthesis.md:3 says \u0022Accepted (synthesis / index)\u0022, but docs/adrs/ADR-035-product-naming.md supersedes it. Two records now claim the same ground; mark this one \u0022Superseded by\u0022 its successor."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adrs/ADR-108-darwin-evolution-series-synthesis.md"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b8392c11f5305c2a383deeb94a0c103431b0bba43a1eb08fdcb2108a0ac9c6"}},{"ruleId":"D20","level":"note","message":{"text":"ADR superseded but its status says otherwise: docs/adrs/ADR-118-darwin-swe-suite-generalizes.md:3 says \u0022Accepted (measured) \u2014 generalization of ADR-117\u0022, but docs/adrs/ADR-035-product-naming.md supersedes it. Two records now claim the same ground; mark this one \u0022Superseded by\u0022 its successor."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adrs/ADR-118-darwin-swe-suite-generalizes.md"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b146d7a51b7e4dce201985fb20c008323f6f1d1b55812711ab273a2c883790"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060callLLM\u0060 spells \u0060LLM\u0060 where 14 names in the project spell it \u0060Llm\u0060: 14 of 15 names in project agent-harness-generator spell the token \u0060Llm\u0060 (14 of 15; unit: names in project agent-harness-generator containing \u0060Llm\u0060). Peers: run-cognition.mkLlm (packages/darwin-mode/bench/cognition/run-cognition.mjs:72); solve-gaia.mkLlm (packages/darwin-mode/bench/gaia/solve-gaia.mjs:77); probe.mkLlm (packages/darwin-mode/bench/orchestration/probe.mjs:55); probe.mockLlm (packages/darwin-mode/bench/orchestration/probe.mjs:75); h1-pilot.mkLlm (packages/darwin-mode/bench/ruvector/h1-pilot.mjs:255). Rename to \u0060callLlm\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/ruvector/h3-code-localize.mjs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"79945f3cde70d4c5095f698ff06d4e75c810dce657e9290c08cf9762df6fdef0"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u00223. MCP risk model\u0022 repeats the code it sits on: 3 of its 3 words (mcp, risk, model) are already in \u0060out.push(\u00273. MCP risk model\u0027);\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/create-agent-harness/src/genome.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb581e13e2303405e95fa922ac31a30eae29e81a6621bc79b507e94afaebcda"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u00226. Recommended harness plan\u0022 repeats the code it sits on: 3 of its 3 words (recommended, harness, plan) are already in \u0060out.push(\u00276. Recommended harness plan\u0027);\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/create-agent-harness/src/genome.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ad6d0d3f599d3ae5917e5799c1dc462d5a0cff8dc9ae0712f0725d7568dc5d"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Detect tests: any of __tests__/ tests/ test/.\u0022 repeats the code it sits on: 3 of its 3 words (detect, tests, test) are already in \u0060const testsDetected = testCoverage.score \u003E 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/create-agent-harness/src/score.ts"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"c372ee35a8d1698318da405a5002016ca10a06053e37e200bca3ebd9102a454d"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Fixture: a details map from an array of [gold, failureClass, thrash, cost] tuples.\u0022 repeats the code it sits on: 8 of its 10 words (details, map, array, gold, failure, class, thrash, cost) are already in \u0060const mkDetails = (rows: Array\u003C[boolean, number, number?, number?]\u003E) =\u003E Object.fromEntries(rows.map(([gold, fc, thrash,  \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/darwin-mode/__tests__/gepa-promotion.test.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f2b63c2667848e21cb484b3da915b50ab4bddad46125d5cec0d0152bdb4a3b8"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022strategy -\u003E Set(niche)\u0022 repeats the code it sits on: 3 of its 3 words (strategy, set, niche) are already in \u0060const strategyNiche = new Map();\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/darwin-mode/bench/ablation/poincare-vs-euclidean.mjs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"2971e68ded48341905ee776e7bc62ace79c59bd7bcaa56ffe7e10a29848d4d3d"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Replace delta table\u0022 repeats the code it sits on: 3 of its 3 words (replace, delta, table) are already in \u0060updated = replaceTableBody(updated, \u0027\u0394_dense (pp) [95% CI]\u0027, deltaRows);\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/darwin-mode/bench/ruvector/finalize-h3-results.mjs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"847cb84cd576eeff6c1dc4018d532e601e546f666d07373254e7f298b8cda743"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Replace gap table\u0022 repeats the code it sits on: 3 of its 3 words (replace, gap, table) are already in \u0060updated = replaceTableBody(updated, \u0027Gap@base (pp)\u0027, gapRows);\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/darwin-mode/bench/ruvector/finalize-h3-results.mjs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e4ac5bc02b8b5e7246de509ec43b472bfc1e8076e4c9f9a5f7f4dec910b7ef"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Replace cost table\u0022 repeats the code it sits on: 3 of its 3 words (replace, cost, table) are already in \u0060updated = replaceTableBody(updated, \u0027$ total (50 tasks\u0027, [...costRows, costTableTotal]);\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/darwin-mode/bench/ruvector/finalize-h3-results.mjs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"a886c27272c1d6bc333694babc94988042927f63670ea8a771eeb492cf7e3247"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Create graph node with label \u0027Document\u0027\u0022 repeats the code it sits on: 4 of its 5 words (create, node, label, document) are already in \u0060await this.db.createNode({\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/darwin-mode/bench/ruvector/memory-layer.mjs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1689fe7992bcb80c4bf9ec6553c97f19a5f792cf8989f8a4b18b4f37dd8e01f"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022next=stop forces continue_fable false\u0022 repeats the code it sits on: 5 of its 6 words (next, stop, continue, fable, false) are already in \u0060assert.equal(parseContinuation(\u0027{\u0022continue_fable\u0022:true,\u0022next\u0022:\u0022stop\u0022}\u0027).continue_fable, false);\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/darwin-mode/bench/swebench/output-modes.test.mjs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ff47e0ddafb2dd75cf8018ae298178fda2f8f627dcd5f9ea58d28fd45fba25"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Reproduced under repro-test/fuzz when the pipeline includes them.\u0022 repeats the code it sits on: 6 of its 6 words (reproduced, repro, test, fuzz, pipeline, includes) are already in \u0060if (genome.validationPipeline.includes(\u0027repro-test\u0027) || genome.fuzzBudgetSeconds \u003E= 30) reproduced \u002B= 1;\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/darwin-mode/src/security/swarm.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3bdfc545cc1f1aef42457fe69106307755b8293892efc8d5099ffdfe691fae"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022(a) Repeated identical retrieval/memory/tool spans.\u0022 repeats the code it sits on: 5 of its 6 words (repeated, retrieval, memory, tool, spans) are already in \u0060const repeatKinds = new Set\u003CSpanKind\u003E([\u0027retrieval\u0027, \u0027memory\u0027, \u0027tool\u0027]);\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/projects/src/trace.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bbf13670bc5e5dcd058f1f297150a703e944e0b4e4bef2ca5029ddcb2d142e9"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Probe cargo-audit\u0022 repeats the code it sits on: 3 of its 3 words (probe, cargo, audit) are already in \u0060const probe = await execFile(process.platform === \u0027win32\u0027 ? \u0027cmd.exe\u0027 : \u0027cargo\u0027,\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":"scripts/audit-deps.mjs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"0807fc1f9ca05687b3039cd7e3cdc83e21142cb6bbd42c554e579e4a47ae406d"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Insert after .claude/settings.json.tmpl\u0022 repeats the code it sits on: 4 of its 5 words (claude, settings, json, tmpl) are already in \u0060const idx = m.files.findIndex((f) =\u003E f.src === \u0027.claude/settings.json.tmpl\u0027);\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":"scripts/propagate-plugin-manifest.mjs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca36450eb04469655f20b795531a2dd6884d031ee0a783e3897194cb88c17e2c"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u00225. git commit \u002B tag\u0022 repeats the code it sits on: 3 of its 3 words (git, commit, tag) are already in \u0060log(\u0027STEP\u0027, \u00605/5  git commit \u002B tag v${newVersion}\u0060);\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":"scripts/release.mjs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f14a865a250bba4e8160acb987599f78ea11f6c3e8594c222f34d7b2ec73b4"}},{"ruleId":"D25","level":"note","message":{"text":"ADR not followed: ADR-248: @metaharness/turn-credit \u2014 offline recursive turn-level credit assignment (AgentOPSD): docs/adrs/ADR-248-turn-credit.md:46 rules out \u0060toQualityLabels\u0060 in Adapters, but production code uses it: packages/turn-credit/src/adapters.ts:77. Remove the use, or supersede the record if the decision changed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adrs/ADR-248-turn-credit.md"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"50fd5f92ba1b369c54c65aa314299ca735e4140a8a7dd09ca9dd0da3301e55bf"}},{"ruleId":"D25","level":"note","message":{"text":"ADR not followed: ADR-248: @metaharness/turn-credit \u2014 offline recursive turn-level credit assignment (AgentOPSD): docs/adrs/ADR-248-turn-credit.md:46 rules out \u0060toMemoryFeedback\u0060 in Adapters, but production code uses it: packages/turn-credit/src/adapters.ts:90. Remove the use, or supersede the record if the decision changed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adrs/ADR-248-turn-credit.md"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb147843354d4e13d3700188c604a2d3d2236428eb9f92cd1f5a97ac703e4ce"}},{"ruleId":"D25","level":"note","message":{"text":"ADR not followed: ADR-279: Wiring \u0060withSequentialEvidence\u0060 into the flywheel\u0027s live promotion path (and its replay): docs/adrs/ADR-279-flywheel-sequential-evidence-wiring.md:69 rules out \u0060meetsPromotionRule\u0060, but production code uses it: packages/flywheel/src/gate.ts:52, packages/flywheel/src/gate.ts:98, packages/flywheel/src/index.ts:10, packages/flywheel/src/production-gate.ts:4, packages/flywheel/src/production-gate.ts:126 (\u002B41 more). Remove the use, or supersede the record if the decision changed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/adrs/ADR-279-flywheel-sequential-evidence-wiring.md"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"d774b6eeabc772bc6b432a78ef4f9a2ea6e9b5f5952e3a0eecb161f32c7156c3"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060packages/darwin-mode\u0060 (37987 LoC, 481 module-visible types across 34 directories) overshoots its size bounds. 3 of 58 build unit(s) (Cargo, Python, npm) overshoot their size bounds, lowering Project Cohesion to 9.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/darwin-mode/package.json"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df79246ad49e3cf729387b129a5e18c86b810fa72696ec4d291bda9e54dca107"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060packages/create-agent-harness\u0060 (11546 LoC, 127 module-visible types across 3 directories) overshoots its size bounds. 3 of 58 build unit(s) (Cargo, Python, npm) overshoot their size bounds, lowering Project Cohesion to 9.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/create-agent-harness/package.json"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"97173a36fb69a030cbe6f7afd1f11c4480f6551e0e157d273bd2f9ed422cdc01"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060(repository root)\u0060 (11081 LoC, 70 module-visible types across 17 directories) overshoots its size bounds. 3 of 58 build unit(s) (Cargo, Python, npm) overshoot their size bounds, lowering Project Cohesion to 9.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":"d4a05ed5e5f4cb75b02255f15d1f521425e1ff11632267aaca5ef81b35dc18e1"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"b79614e974f974b1b8f5bf36d9e294b963b23ef4626925717ea7b77d366613f6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"317467ed0208af9badb8f573b42af69b856cdfc1c4a6347a5e819e0ea5431cc7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"103f24fdb634e5c8c49f282c2ea40ae19e72a6093c7eedc9527a893a426b4c42"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8af93b54d7b6d09176d9c9016e65470b9e3497c2e30cd6af0b8b0a89230292a4"},"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":"08ff2cedaf268ae816214f7e683a6fec8546cf57561b384e3fde7f514b23ae32"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"0d1ecfd488eb674a579d98bef94f6d639b8b514215998ab3416b65b74e4844ce"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"b36d27e4e8b05905e85d3a531ec2e9374e40f26f21abd2036f9e8e12993ddf90"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"34866f99336d7a1b774a72e62660a86e238d440d9970924b4ab5222b067294da"},"taxa":[{"id":"CWE-95","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":"5645f1d00961c919257280f99e9366206d7898213f54617681bb7b74d7289e4f"},"taxa":[{"id":"CWE-95","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":"f84d22196ebe0b55c2eb958fa2bc2978349acf5a85aa1e241a22fab9b94602f0"},"taxa":[{"id":"CWE-95","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":"ee0919bd04593b2bb949e662ab75c0b9f6bfeb514b6572e330686ac3ada8087b"},"taxa":[{"id":"CWE-95","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":"7aefb83e535a0d5ad6d41d1b90a4432f4ea3d840f393c78bd0a30f1563fd209d"},"taxa":[{"id":"CWE-95","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":"887842cce0a6cc77deef4803bd938fb91b80dad35917a65f124c0bdf53d73c9e"},"taxa":[{"id":"CWE-95","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":"1422013c2471e456a2f065b517005044badfb9b3f21e75b77f99d63ef58a5627"},"taxa":[{"id":"CWE-95","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":"0a59ba4056d2688c0f944d261be804cd3be0b88d8183716109e6074aa08622eb"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"908247c78607592976468ccecffa7cd73328e9d8258c03d77e71af892387740f"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"ac6a9540e4b7e509caa75613b35c37a9964dcfbfb6202877ebd3941a1fd2cd80"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"8750074d2e20406a4b90093c70a4940c4512a95b88c1d3eed37c4040efe3573d"},"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":"6d30b6ee1cde7d5a3d56947042a12994b8d10370b96d420497c426569cd60083"},"taxa":[{"id":"CWE-918","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"a025f06028b0c29369328c0f34b87171ba3b63f822454ae99ce07e9a65bc3038"},"taxa":[{"id":"CWE-1321","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":"eb29fee900ef430e45b516fdb1b64f1174d6466a39f45272f4ba80bffaa277e9"},"taxa":[{"id":"CWE-1321","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":"e0c763b9d3b7f79251f38fc8fb2f10d4caec1beca2520d2cb5a7b7d28a37438d"},"taxa":[{"id":"CWE-918","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"7c17a9611e5ba2b0bc5de435a962fcdb8729e5b7ab9146d26fca92a5e64a20ef"},"taxa":[{"id":"CWE-1321","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9aaba7398615928f56ecb2a7faa7af28b4d6e9f90589bb8f2397abeb41fe2386"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"093666b7acca4a6ab8adb3b6de814c4b294a1ed64645a3341f297d93eecc2123"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"51ce72744abe74eee8e473017a2437cc5f345fc15eb3672994fa0ddb30dc462e"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"7f8b5bd96e7ed9b497e04fc2d0f1b882f8d7946f54bc8afad088c493feda80bd"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"564948b401bc61a55d664212e4b0b7b7bb0f39be19fd516c37454b8bfb62f000"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"eadbc8ef651cfeb54ed312154155630225508f9156a4f3d0f1f03050a69edbb3"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"1e666ebf19ec2dbfed892636a938c9564685a9006d704b8cb5b17044c1b8a681"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"3b24403cf8a5da82996d362ae0dd0fac3887873c59863c2306c79d0c5f7a6da8"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"d08f2f7535207326a6e183b985f48ff27ad59dad65e6f4f0927f542177153e76"},"taxa":[{"id":"CWE-345","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"01fa0b83aaee9e09008c70739690beb842c6791c098fe742622ab79455199dbd"},"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":"0c499b19ed728a334d4f505c664e4f9df82858a04650e4a52c6bea724ca95a04"},"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":"24c5eee51a67a2fe7e063171de7db9ef42a19eec6f405271c75211d3e6ef71ff"},"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":"2663fcffcbf7cbc316417caa6914c38d616809c5fb1a080cf4b895f1a301a892"},"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":"1efad6170212ec0239e2cf744e79735909655809548ec1052b6a57ede4473c75"},"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":"010d0fb723c0fb3d45b1f83f75c5286e48f2a204c8264ba9342752fd8ba6fb1a"},"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":"869609bb02c3fd3dde2e98c73e6851155e9b2e7ad383d805b69f3a64bbc61403"},"taxa":[{"id":"CWE-117","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09: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":"cfcb735a8d7744cd7d5ff991f3d42c8562b853dde000481925c3276510a47e58"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4f248695afc489eac2ff650692ddcb5233926c0e4caa125f605498bb2e550f9c"},"taxa":[{"id":"CWE-327","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":"6b4a5240def533040434b5c963849c12ef2664d91ca35e9bbb0eac8812d22c3f"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"06eba209fd94c482231f35eb28d8d4ab83dcab1340230402c0f2bd2a8aa92e83"},"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":"56de0be9272f04c2bc1476badcc140f160910c018c5d80ebccbbb7f7b629121d"},"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":"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":"6bedbe438d527a5951b12a18c44043f74178c8e953ed1713bdd127d9e1b30133"},"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":"671e82c0e35521a667b8b416ce4aadca2a5833e7f97350b72b194251f65d11d8"},"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":"bf1bf56889efa19ab8250d75cdc9f188b12b1c03ae6da6ac8e0c61ec78e10480"},"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":"0ddf4ad5565e0bcaadd58c52aa15e765b1a4de3ff2539b96d6b0638e3eb15785"},"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":"dd3ce6265c844012550ce6546c93867f2d4ec3ee7eb8f32b460113e51e3ac85c"},"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":"4efe269eb771e2932331251774cd875c5b558ed3c66f9b9407d20e5ae0f97b83"},"taxa":[{"id":"CWE-95","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":"46c8bc5207beae357582a0514f31dc1407a8fa2f34f9e3e08042fcde3047849f"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"34cbcccf89ba12ef3f2d1760fd2d77c8b530fa337c2766c2a7514a2bf97b5876"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1a5eeaf27c980f6e74341d3537fbb7d72ebf5ef0a20ba6079b27076ec1dc8aff"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"f7eac638d2225b4ecaaf2b45ff3fa3c2fe643ad7824ecd02955afff878894497"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"53ec5c1686d8922d325f89236ccbb363d0742b48c3c9335605f3e4b649204e9e"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"e95852cd388c96f24de4c2686b2cd75322abd846d9f7fe508958518ab0b9b9ea"},"properties":{"dependency":{"package":"@hono/node-server","version":"2.1.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"medium","fixedVersion":"2.1.6","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":"16bd6c04e6a88f19defdb625db0c886702f487ef63deb78d527e2b7041bd8a52"},"properties":{"dependency":{"package":"hono","version":"4.13.13","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"medium","fixedVersion":"4.13.16","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":"c2f0bb3147525f54df915afaeef3ac6e35c7f1bddceaabececf80e070fef490f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"57494f1b3befc75de558ec06fe7898e1d6df32ed3ca275047e0cdc12730929c4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ac3190dc9b3a664a22a2a897881735b9df4a19e1a9474cf78f0b0d9e80942cc3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d445d721dd167549a1381ec463ff80a93bd837f85237d441bb0a727e89b2224e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"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":"09a5e636e02556c69a81298fb69b79ff92f4c9f2f3bd7db1a4e3827c994c5328"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"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":"be75da1e6e1605df59564c75e2ac11ac7eff5a6fa86a82b7a20de266580ea611"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D44","level":"warning","message":{"text":"End-of-life runtime: Rust 1.88: rust-toolchain.toml declares Rust 1.88 as this project\u0027s toolchain file, and Rust 1.88, superseded by 1.89 on 2025-08-07 (the Rust project patches only the current stable). An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2025-08-07 is present and unfixable without moving off it. This is a migration rather than an upgrade: there is no newer release of a runtime that has ended."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust-toolchain.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"476678a1ee3431d0d7d6fee2467e49852f5ae540b5afab9dd2c9822ddc2f8ee5"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Ccanvas\u003E without a text alternative: A \u003Ccanvas\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3-chatgpt/public/arc-widget.html"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"a19549a3ddd49ff2de76aa8068bddf46b675575c6a4bf71c6abb66af627b9f83"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no for 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 for=\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":"apps/web-ui/public/cost-pareto.html"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"1775d96f2d404ff01f27d2f3b1f5b427bc2938c66a2cda1c7a1683e4bd774707"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web-ui/public/cost-pareto.html"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2495e2dac174e2f0ba329594d0c850ea7ff791e296250685e0b3071cc036a7"}},{"ruleId":"AC3","level":"error","message":{"text":"Document without a \u003Ctitle\u003E: A page with no \u003Ctitle\u003E gives no name in the tab, history or screen-reader page list. Add a descriptive \u003Ctitle\u003E in \u003Chead\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3-chatgpt/public/arc-widget.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b1c5e6bc026dd9b55420bf87d1e88fe0b09f17f42b1b01b038226fb5cf1d0a8"}},{"ruleId":"AC4","level":"warning","message":{"text":"Anchor without href: An \u003Ca\u003E with no href, role or tabindex isn\u0027t focusable or keyboard-activatable. Give it a real href, or use a \u003Cbutton\u003E for an action."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web-ui/public/cost-pareto.html"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"586325bcfef6462d78af7404a1062ecc6bce7b976722d3156ac93944ee80935e"}},{"ruleId":"AC4","level":"warning","message":{"text":"Anchor without href: An \u003Ca\u003E with no href, role or tabindex isn\u0027t focusable or keyboard-activatable. Give it a real href, or use a \u003Cbutton\u003E for an action."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web-ui/public/cost-pareto.html"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"317e4bd57cbb8dccd6dac7727240512f511132dbedf8e717da2c57d6b6cbd7c1"}},{"ruleId":"AC4","level":"warning","message":{"text":"Anchor without href: An \u003Ca\u003E with no href, role or tabindex isn\u0027t focusable or keyboard-activatable. Give it a real href, or use a \u003Cbutton\u003E for an action."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web-ui/public/cost-pareto.html"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"c69ccd358f3bcba6316ea6b02c0994ca87a7ad818f24a763c88ec6d04ec84b57"}},{"ruleId":"AC4","level":"warning","message":{"text":"Anchor without href: An \u003Ca\u003E with no href, role or tabindex isn\u0027t focusable or keyboard-activatable. Give it a real href, or use a \u003Cbutton\u003E for an action."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web-ui/public/cost-pareto.html"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"050d9fea452a351c9a1155ca0c1dcd16e848a2e316f9e0a289d09ba78117e3a8"}},{"ruleId":"AC4","level":"warning","message":{"text":"Anchor without href: An \u003Ca\u003E with no href, role or tabindex isn\u0027t focusable or keyboard-activatable. Give it a real href, or use a \u003Cbutton\u003E for an action."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web-ui/public/cost-pareto.html"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"3293a94d23012471bf09dcd992b30052682130d5fb0412bff356e26a7f55e585"}},{"ruleId":"AC4","level":"warning","message":{"text":"Anchor without href: An \u003Ca\u003E with no href, role or tabindex isn\u0027t focusable or keyboard-activatable. Give it a real href, or use a \u003Cbutton\u003E for an action."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web-ui/public/cost-pareto.html"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e267fb600098defd0ad51f4aa5bd01b44d27a99ef87971ece5b577985a2e29"}},{"ruleId":"AC4","level":"warning","message":{"text":"Anchor without href: An \u003Ca\u003E with no href, role or tabindex isn\u0027t focusable or keyboard-activatable. Give it a real href, or use a \u003Cbutton\u003E for an action."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web-ui/public/cost-pareto.html"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"06faa4d80a17c321cc30b661187c182a73aacc16d69388e85973c8efd2d70246"}},{"ruleId":"AC4","level":"warning","message":{"text":"Anchor without href: An \u003Ca\u003E with no href, role or tabindex isn\u0027t focusable or keyboard-activatable. Give it a real href, or use a \u003Cbutton\u003E for an action."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web-ui/public/cost-pareto.html"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2ad690388818e4f73ec2122e4c1856b1865e052890f672ac5867e5caf76901"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a \u003Cspan\u003E nested inside \u003Cbutton\u003E: This \u003Cspan\u003E carries its own click handler, but it sits inside a \u003Cbutton\u003E that performs a different action. A keyboard user reaches the \u003Cbutton\u003E and activating it runs the \u003Cbutton\u003E\u0027s handler, never this one, so this action has no keyboard path at all. Role and tabindex cannot supply one: HTML forbids a \u003Cbutton\u003E from containing interactive content or any descendant with a tabindex, so the browser will not put this element in the tab order however it is marked up. Move it out of the \u003Cbutton\u003E and make it a sibling \u003Cbutton\u003E, so each action has its own control."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web-ui/src/components/CatalogPicker.tsx"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"90fc3da2ac9accb32cff81b58ce38744a76562bb7e747278a177f1d43525a4bb"}},{"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":"apps/web-ui/src/components/OnboardingModal.tsx"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"7229d1a15efe15cc8b7a8da0653bb9273527bc9e198e988fd235f2f799b627e1"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.calcpanel\u0060 moves (\u0060transition: transform .25s\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web-ui/public/cost-pareto.html"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffde3b9bea64513034f393ab17d2349b74286f08c5b9ce0af1afd7381e10a562"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.book\u0060 moves (\u0060transition: transform .25s\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web-ui/public/cost-pareto.html"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"939afde234e854be32b82e2cde7dfb8256094a089d1726e5bef0dcb2466f3946"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.bookmain section\u0060 moves (\u0060animation: fadein .4s ease both\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web-ui/public/cost-pareto.html"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b33bca89e58c6bdd5d8e439c6f72d365c940ae1beaca121ef226ee33e798afd"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.anim-bar\u0060 moves (\u0060animation: growbar 1s ease both\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web-ui/public/cost-pareto.html"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dae915312dc5bc1ed69ed246b1d48547cf2d51f7a83651765ef1cd1647d376e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.wcard\u0060 moves (\u0060transition: transform .3s\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web-ui/public/cost-pareto.html"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18fcd7c0669a97993875b023a6db8d4bc4860ca119988441ba4efa31e8d5c54"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Ccircle\u003E moves \u2014 its inline style sets \u0060animation: fadein .5s 1.2s both\u0060 \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web-ui/public/cost-pareto.html"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"519c6e3da01ce7db2c9f6118df92d6c8fdcd22209ab285dcb9b19dd56dd241b2"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Ccircle\u003E moves \u2014 its inline style sets \u0060animation: fadein .5s 1.4s both\u0060 \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web-ui/public/cost-pareto.html"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"174ce58d1caef6ec8f76e0496094d53789a758f4fa4311c3c738c8494b71b1e4"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Ccircle\u003E moves \u2014 its inline style sets \u0060animation: fadein .5s 1.6s both\u0060 \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web-ui/public/cost-pareto.html"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"840b553fad2d03aaabaccf9d7acda4f388cf57e3ad6b6d8f7fdd40864b3636e2"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.input\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web-ui/src/index.css"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb04a4f45e5136648d76a5c20452495a24fe94af7321032f08bb72734093919"}},{"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/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a299b8fb085a5e371e4cea3340eb0dd11406b32a962d2d862dc16b9426f4e07"}},{"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/agntcy/src/oasf/__tests__/publish.test.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"c48d22f803f8e659d8fb53f19f85880fe78990567893caf6cf51cf6707c8a911"}},{"ruleId":"IC1","level":"note","message":{"text":"Empty method body: \u0060flushDurableFacts\u0060 has an empty body \u2014 confirm it\u0027s an intentional no-op and not an unfinished method."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/horizon/scripts/demo.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"2573fe7ee47dc16d58d51f77e7551384c5a155478756bcc2b3a0b44edb561fba"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: packages/agntcy/README.md names Node.js 22, but the repository declares engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20\u0060, engines \u0060\u003E=20\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20\u0060, engines \u0060\u003E=20\u0060, engines \u0060\u003E=20\u0060, engines \u0060\u003E=20\u0060, engines \u0060\u003E=20\u0060, engines \u0060\u003E=20\u0060, engines \u0060\u003E=20\u0060, engines \u0060\u003E=20\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20\u0060, engines \u0060\u003E=20\u0060, engines \u0060\u003E=20\u0060, engines \u0060\u003E=20\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20.0.0\u0060, engines \u0060\u003E=20\u0060, pinned 20. 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":"packages/agntcy/README.md"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe4e2760b5f815780763d0ce12679b67026d233a6491eea954a1c67a5f63303"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/research/cheap-vs-frontier/SELF-LEARNING-RAG-SOTA.md names ReAct 41, but the manifest declares \u0060react\u0060 ^18.3.1. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/cheap-vs-frontier/SELF-LEARNING-RAG-SOTA.md"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"0303325891a7d6fad539a4b23580979123f84d5728cb80a2c251042fa54bb941"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 1/51 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060.\u0060, \u0060crates/poker-darwin\u0060, \u0060examples-packages/claude-code\u0060, \u0060examples-packages/codex\u0060, \u0060examples-packages/coding\u0060 and 45 more."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P4","level":"note","message":{"text":"No rollback/health safety: Deployment is orchestrated by compose, and the service already exposes health probe endpoints (healthz/livez/readyz or a container healthcheck), but no compose service declares a \u0060healthcheck:\u0060 that uses them and nothing pins a previous image to fall back to \u2014 so a release that starts but does not serve looks healthy, and reversing it is a manual step."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/dream-release.yml"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6bab8a28a2145f47e5a4e6683cda39d2ba0296c723238e8057da979ae1c706"}},{"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":"services/apicompletions/src/providers/openrouter.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"986e6a1b31bae404402fedf41c90023412f33a01c5044a53ca52b4a51865b7e4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060dispatch\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/avo/src/cli.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"50f816960f5b92535f7e433836ce3b022013414a4fd96d0d7fd38a3230d703c4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060dispatch\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/avo/src/cli.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a541db4849f29c7d5cf009191e668ef3fe219a683c8da4475a72d6f4d0b6d4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\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/avo/src/memory.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"82fdac6df624f87c77ba9c420ad7205e7c089f9943ffc61f59a39aa3e56ff691"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060fork\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/avo/src/repository.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"80ee6f50d3150c53ca72bf071a12de9026b2c837c92ca4628a8ee13044b13fad"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060analyzeRepoCmd\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/analyze-repo.ts"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"91658243c4fc055b9dbdbb506706eb079ffa485c600244ec417ce704c896fd16"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060statSync\u0060 in \u0060analyzeRepoCmd\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/analyze-repo.ts"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d20fdc86545b241e149825ec625154c7f6978b040b456926a079876d1612c67"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060analyzeRepoCmd\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/analyze-repo.ts"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d4effab286ed8f236e7488389e339630a87781bc39293a861451f4dab96df6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060analyzeRepoCmd\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/analyze-repo.ts"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"4314bed78c9593bf57da5b8c51a74149dc2c2d4726d0a85ef9fff862b78b39f4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060auditCmd\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/audit-cmd.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a23757624c571f367eafa1f94b5c04a9cb07d36a821861d9e38cc4ee7f4170"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060auditCmd\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/audit-cmd.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca763d043a8edbe4ad7bbe45cd596cb96ff8f1d509e7206fdd529984c4b801b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readManifest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/compare-cmd.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"1662ccdb84b433a0802bc864c65220e491765c0cee9a64432ab9a3c23da43b8c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060buildDiagReport\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/diag.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"944552ed4b0d54bcdf9b6d546d91d890fa3bc3f3a18068e21e42af93def60882"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060buildSupportBundle\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/diag.ts"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fbc92e2f0a79e285033a5b5664d11904cb8d6d62fb1b704b5f7aa87a2c2e13d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060buildSupportBundle\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/diag.ts"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"216e32f9a58e32214764c51c38cb38f5a0ac7b9bb409d6dda1251d3e5a0e96fb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060buildSupportBundle\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/diag.ts"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd6c2af1c9bb9df080376883d03aedae6711dc75a88ac52fc62ad147a068581f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060buildSupportBundle\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/diag.ts"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"795111a78b5b6c6d0cae9e861fcbaaac47ab365c1c4cb3b9c0f561ad322dd0aa"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060buildSupportBundle\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/diag.ts"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"af3b132ec78c4b446a6a242d94a4136d2642c37c0493555bd82eb420f81ba3a3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readdirSync\u0060 in \u0060buildSupportBundle\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/diag.ts"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac639d43ff1dcda810bf8b4179a0e7469dca6b318c40446c9209b56d4aa4686"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060planEject\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/eject.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"260ae6adff2cccda55023f409bc4b6a4e83a059121da9b86d6135310965f8f88"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060planEject\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/eject.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ed19b4313595928a11b4da2adaebd02cbcc03254cf1c0b1306e778f7269f7f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060planEject\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/eject.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f6a78dd462e2dfa251eca21399c73aeeaecc9b6ae442d39431e35d35d293f5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060planEject\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/eject.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"be86ab9a991f5b5800f4bbec2fd39e9983ea4d584a4e1e3e7fa5b4e7b6af12fc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060planEject\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/eject.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"9496e09555f285fb6c64be3e1f6eb57b9b8adb27d75670d9a39a49c01eb766d3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060applyEject\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/eject.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"914b381ec05f3a43c36b994135db72a30ea36c27b4ea079311e3c887b0206308"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060buildExportedConfig\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/export-config.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"648cd1ea3d5a4936f4ef2bba0bbfa639c9375d8bdd7c7ede829cbad0a87fa9d8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060buildExportedConfig\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/export-config.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d87b9e05fc4bcbff29561dec584b29e23fccc0ca9edbd02826a611bc603449"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060buildExportedConfig\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/export-config.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f99402799ebac0e05afb62c34efc932bd2ee5b87bb39a64cff5263ed669e2c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060buildExportedConfig\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/export-config.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ceec6d47084d7d3aff393a05eb7f62690a22029910a9a0b133333fe531ec09"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060exportConfigCmd\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/export-config.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"54cc3e1bfecf03135ac4e964edad80638ab35a12c9bb7702990a0e0c96affcd4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060loadState\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/federate.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bde5b116fc14e8b8412c04fab72f84a56743d4cd29c2ddcf6b6c3e5fc74ce19"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060genomeCmd\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/genome.ts"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"629fca2db2edebfa937cdc7aae4f0dec4a5839110d56d1c99cdc6a30a8a61c68"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060statSync\u0060 in \u0060genomeCmd\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/genome.ts"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e47b5bfcae1e7d0f100e247960140772546a85b295758d302baf6bf09515e78"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060genomeCmd\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/genome.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"a95a14f2e55e79b846f2e31e93c69e600c19b10f8a486d6cd2918163614df5cc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060renderScaffold\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/index.ts"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"212ce3bb12b96ca184e8da7a981ff2d85be00e1d0a8df5200a007693ae147e3b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060scaffold\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/index.ts"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"434929fc2933d572bb8b463a038edb57718850fb98021313206b37cb08a1fe10"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdtempSync\u0060 in \u0060runMetaHarnessSubcommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/index.ts"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"b533e3ae848d33db66d31204d1dfad652b02a34aaf044c8e33506993b29c3b8e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060spawnSync\u0060 in \u0060runMetaHarnessSubcommand\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/index.ts"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"674b23093d8a751f913ae529ad879aaede958c0fda66dcb28eaa0509883a3ae4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060runLearn\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/learn.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"47755f5c5056fd49b628e661470eed7db9b9b9d05884d348f61207af711b5836"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060runLearn\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/learn.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"464f4cf94b7575626bdac68ac021e48db9403db16e4acca6360b6a2c04fdae3f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060spawnSync\u0060 in \u0060runLearn\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/learn.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"2819d2c6a95d4cebbc50fd46d53c0fff5b398d1ef8ce86d34c01bc21d1d7e5ca"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readMcpConfig\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/mcp-cmd.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"1652a87f11bb69c13cc27cb23a16ff70df98646ef1947276931455aed8e8971f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readClaims\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/mcp-cmd.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce52cdb0e9d9dcc1ff7c2d40dd6a6048917cca9f140dc4234edc5e12dfa8b9aa"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060uninstallMetaProxy\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"66661d231c7a06680813afea8d8026ea31ab98a62407c8b5320c459d902d82cc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060installMetaProxy\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"07680a666134cd2e3d784ec0e3313b3aad5449afd0bfa537937d6d377427131b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdtempSync\u0060 in \u0060installMetaProxy\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6389f168bfe24a0391e5a72a087f0c8271bc7e21720895ac0d8f8427466f25"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060installMetaProxy\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f0e3730d347475b2c0bae39095ba7c7a5546094d316cf8f4c872c572dc9463"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060installMetaProxy\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec7dccc9319673f74f546fe8f554fe17e1c08e18ac1c3b4ef470257df49e921f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060installMetaProxy\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e120bd825d32577dac454f7e3a1b33f5d60a42f95088968f1cc67ed5a3b4a5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060renameSync\u0060 in \u0060installMetaProxy\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c16f57a4e5a5b374792d85ddfe8c275ea2df83b200f44cf11e4dda56339d42e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060chmodSync\u0060 in \u0060installMetaProxy\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bfb99a5fa90058f9b16da8659e2e02e08da37c7860bd5b6f5392635a945cd11"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060installMetaProxy\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b9d9098c3421ac94e5d07a68469a62d17fcda757d4bb8f572171cbb31a9d3db"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060installMetaProxy\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b4cddc44f2bf62c2483f3c888402be9cd7082dbf94a4cf7220e599f82a366b3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060replaceEffectiveMetaProxy\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c0dc1f9551cfa490128ee50fe0f1698e8f316474e50fbf1ccb0059478fe7c0f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060installAndActivateMetaProxy\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"697ee9d783168b01d48482b41dfbd2ed8e322b59d4107b8144907e4cced23e08"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060installAndActivateMetaProxy\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51a0376229f417562369100822c1c96e4da17a7af91526d3b48785c81600584"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060installAndActivateMetaProxy\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d5b06e4e6cc4027244b1ce05f031d114fee7d7981a29d44d04d1b46716486a5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060copyFileSync\u0060 in \u0060installAndActivateMetaProxy\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d475a75f76969e7fe1df5b4cd88ac8d6e4b48e4fccca27429e911e06319898c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060installAndActivateMetaProxy\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2b46c35b87c6735c14b3d693dbf39d205a22b9c1e736ae462e03b1b0f14d3d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060copyFileSync\u0060 in \u0060installAndActivateMetaProxy\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7fe9c6bb84606edd23599e044a3f5607ea2bc87692002b1188bed795aa3e109"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060installAndActivateMetaProxy\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ac612e94594bc2c939cd975de2059d6d593b3baad84d9a6d2b12848e75e8fe"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060installAndActivateMetaProxy\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"09eaabdf63e2d13be7fa0d7bcc8a4c439faac1b57f60657a91fba3489cbd96af"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060installAndActivateMetaProxy\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e24cf0e63f208e5b993e5c333d46ee7a75362eb1365defe0b809c5e7968480"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060installAndActivateMetaProxy\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8a183fad64e6806e50071ea974a11884d7eff1db035adc0da120b5927d65c5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060renameSync\u0060 in \u0060installAndActivateMetaProxy\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"78430dbfc37a8476e7f2c4caf94b43226b4af0a046b2019f360a1403d8e71bbe"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060installAndActivateMetaProxy\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f98ba29fc32f1c3848fea39ad5b99e54286ee2bf383e08a82a4d571ab4829e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060installAndActivateMetaProxy\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c5c8d0389e720cd94a2673f7e725ec415b139cdbbe8760771957c66f337ec3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060renameSync\u0060 in \u0060installAndActivateMetaProxy\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb741497571583fbf5f585a165d0d457f9933d4cc4793660b72dce45b2d180b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060installAndActivateMetaProxy\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f99fd188cf620b18a01113f42375bd0710ba55d6f4ef0f1ebbe2cb5a62ab637"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060installAndActivateMetaProxy\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"fffb01ada2017084c95c7c2d0a208cd296b2251dbe0e3b791ca694ad13c1c132"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060spawnSync\u0060 in \u0060runThroughMetaProxy\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea3efe72b9c3ea2447d4af595237676f5a11516cce80b7b109d162280b9ec5a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060spawnSync\u0060 in \u0060metaProxyCmd\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a9a5295017019252e4992e7f9e90857a71040f79eca0d0aa04b9c4ae9eb4540"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060oiaManifestCmd\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/oia-manifest.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e90a4422c2cc26fb76eddd00d972b61a95c7ca79aeaa28391836dfa45e76b1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060statSync\u0060 in \u0060oiaManifestCmd\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/oia-manifest.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"477237a9abdedfbc28b5eaca2ebc9fa753da2ac69843a5dfe9f0ba0812d20014"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060oiaManifestCmd\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/oia-manifest.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"629d292d807e3d99359116fbe3bb2155a635a6007b181d849a7aa6e76fe76bd7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060oiaManifestCmd\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/oia-manifest.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"183cbe0e47a71f76e754420be7ad5de20e0e88946d7a7d3b324abe61d416ec80"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060oiaManifestCmd\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/oia-manifest.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"749ca34d4b5d3e7f319525ee2847423fc8b833de645e864ede1c16a7ae737adc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060oiaManifestCmd\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/oia-manifest.ts"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"7287663b9ded19c1cc67a389e97df9096b45a9203583885607dca5c5f84f774b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060oiaManifestCmd\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/oia-manifest.ts"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3917d566c638fecdc717298e6f140a2340b264632399bcd5d870b88a18075ec"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060pluginInitCmd\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/plugin-init-cmd.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7780bf65e4d7705454f8ccaf617154c5daf3d2123ef0efd988ab39df2bd3a25"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060pluginInitCmd\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/plugin-init-cmd.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b36b8372208e5ff6e9ff01072d6115d738b3bd068b91b90191db4a1ff3e167a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060pluginInitCmd\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/plugin-init-cmd.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdfa695c91f5442d188661cec3938399fd547d4378b4c0f6edb36c55cb7a2be0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060publishHarness\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/publish.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"893197b09016a3166b02cc7546732988579c9b85b093ecfecddd6cf668fcbb83"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060sbomCmd\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/sbom-cmd.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"be360985c2a8dcfe2ea8e93791b5959e71f038c4ddf018e4b5f650fd7e35053d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060sbomCmd\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/sbom-cmd.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a28c2e724036f3a1abb2e53bd55168dfcf66d30385f7de87618ea78033429ac"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060scoreCmd\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/score.ts"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d84e70f6592568173a7479fe34add9083b3bfd0383050d210d7b069a971fb2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060statSync\u0060 in \u0060scoreCmd\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/score.ts"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f062a78c9ce3742bf902049a085253dddc2cc89b9d30d9968e2ad2e5f896656"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060scoreCmd\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/score.ts"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"27979dbdc0f5299b51dacb92124bb1aba9dde6d45892610d637386b8efe2ece1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060doctor\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/subcommands.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c50f9e065892708c4e2b5524c006681972c7d18901062538be84a3ea75f0e8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060doctor\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/subcommands.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82a808aeea3589217dec998fa91d48e4510095c19d0ed46d290cc3536d65c9e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060doctor\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/subcommands.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd43d29c141f5611ac5d720c2a7217985c4e9d099babbbb5fe522a7750076db"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060doctor\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/subcommands.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca070a105897e1a05be7bd948a1e6ed5eb456dfda35a97993151a9f229be96d8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060doctor\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/subcommands.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f90b098b056e2a06a378d8f40c0ed1fe6893fcd771c342faad1a16f81a15bb4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060doctor\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/subcommands.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"63af0010fc9bda97246204b57a3d3d526d9ba4a0f5924b83ebfa65f6b75ae7e5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060doctor\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/subcommands.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30412f54c951f61e1aeff40662251f937fe6b73b7952fd576e2ff6fab3aa7bc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060doctor\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/subcommands.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d85cc7b1512b845d70f8dcaaf8458b8dc1fb42244264ca66324a93ad4d924a6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060doctor\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/subcommands.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ef379793bc6c1527c2c6d472f409d2a2e1c2dbd2ef4516ef5a70d505f6f08d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060doctor\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/subcommands.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"556683a27b882cacdadc5e16f3341861e98064ba5d77bdfc7b8ca27eda4c881a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060doctor\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/subcommands.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"522ba02a7a8ac3677b2c35d3403dd1c48b93f20cbb53b6940b725e9b2598ecd4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060doctor\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/subcommands.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdefa551778ced775d1aeec42139a9fe8ae0e8a13cdd3c0bb8195335f960fd4c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060doctor\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/subcommands.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb549383e775792b55bc2f080c262ec10eb6a570c31e7e95ea6d9c091435f4c7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060doctor\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/subcommands.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9104934386067724e7422adc98a49c2d2e73d07bdc934187d1cfb5321fc6ed1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060doctor\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/subcommands.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d1185372c291843f2e5e65db1705c1e9a12d6c7fdbd36dadc17cd9b463d22d6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060doctor\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/subcommands.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeed99a7137c9756f9cdc54296987cc7bdb792478be2676ab9dad47a4b5e895d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060doctor\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/subcommands.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f156ad9ad233203f3de22cf1e4e4d4690c8a9c77bbea66a77f73a51c7f15489"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060sign\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/subcommands.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f512ea837afa0de26b6f6008ef74fbad941a31cea85ef3332fbf32c717c0f4d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060threatModelCmd\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/threat-model.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac59a8368caf7f18184de5dbb02983859040504fee1d9b0fbbaef0313b9633c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060statSync\u0060 in \u0060threatModelCmd\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/threat-model.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4681e1782e8eac020e5c6eb5c3244123b091dc1dd0b71d1fa594ca77196c678"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060threatModelCmd\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/threat-model.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad2ee9426b0294b283eb2de4cd7fdc82dd3c2078e09ffa4358c60ea39241ca2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060upgradeCmd\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/upgrade-cmd.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c8c056f3a5aeec2ea42470d61d2dc6fc4260c6fa1cf204038b685518e17376f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060upgradeCmd\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/upgrade-cmd.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d26ed43b6381d72f075779ef1a579003bd8c9aff12008242e8b7495937255c0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060planUpgrade\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/upgrade.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"a348b4c98c60e844860d7ea159e017e8e7697abecf53631ac05e9fe6660697aa"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060planUpgrade\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/upgrade.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"26871615fa5dc44417c4e2148f807df00e46f190c3c77657d13ee30f630bf807"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060planUpgrade\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/upgrade.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"271b9ad37c5716dc38b3d44e2c9ea0573aaaf50b12239fb61c8b91bca1b734a6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060lstatSync\u0060 in \u0060applyPlan\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/upgrade.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e649c752c2b9c46799819dd2232aa1dcc44ba6ded1aed3a7181046d7b320bd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060applyPlan\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/upgrade.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"1006c912d703b14b8969e5dd80412dd924aec722c728561277be3c30d45ba87b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060runVerify\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/validate.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b546cc9ff8a855d531f89c94ebec8993520cacfded1a80bdee0d294651c827a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060runMcpCheck\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/validate.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"180976d4f41102b6e40c4a5f35ea35e3b1ec6c6d327c1b57859ed7f3d53da0b7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060runOiaManifest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/validate.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"e662881b2cf575422d15088de34a17f88218361f39f563c7fe94e06ca21ab8bf"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060runOiaManifest\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/validate.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"9edb08fc1adf6ec646d8722435adf4e17ce1ed96e70e87071aa788471287b655"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060runDiag\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/validate.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"4552547d38f2dba4f64408cf96cba1328df0e9788843f08cf736904c5a73a7f5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readAndVerify\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/witness-client.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ddb5ada05b64e094a0fe990108dfc0805125feb679cb259ee48476c52914a5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060writeAtomic\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/writer.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f871e17d9867b789a401f444df777de6471cf4e62912c822b22d4ce1beeb025"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060writeAtomic\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/writer.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6dc6ef4b61c3ee73c4d42bcd4dbe7d1ee04e7e31d27b8d4c01ec03777f69b00"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/ruvector/h3-code-gate.mjs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"215c2a9346f85e84e40bbeb5776c3576054429e87aeca85f340084332c7db171"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/ruvector/h3-code-gate.mjs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a9b15a7d8c43ca1b84d761e3c9a3d3fe39e40d34252036697e49252fadf7a86"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/ruvector/h3-code-gate.mjs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"a441de090373799accc55d717a94625b0fe1f56609c42aaa57f0234c1703da0d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/ruvector/h3-code-gate.mjs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"157243940c030a5490d36d50b92ee552132c2cf81c1fd36ebcb44c3c389eb638"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060_ensureStoreNpm\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/ruvector/memory-layer.mjs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"f85cc7d37a41d0e345717c0cbf9c000bc8fd4a8f8a4ef6fd8c6b922ac4caf769"}},{"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/darwin-mode/bench/ruvector/ruvector-eval.mjs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e51f9240ed35ac98119e0a8cc1921ba4ead7728915a076109f31f9ed1c2318"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/ruvector/ruvector-eval.mjs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"613aacc7027b62dfea91087d72dc8b1e5a2a6459ef97baa6d0712a501cd9dd86"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/ruvector/ruvector-eval.mjs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8897956f4a71aaec46b8e457c383c118c457ed024120d42669a479004583b85"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/ruvector/ruvector-eval.mjs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74cd2de038fb21c6ff34606bcccca2de08ca0715dda7958e2075352164ed351"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/ruvector/warmup-epoch.mjs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba1b56a75bc64b320671c4c3d6f986fd869c2aac46124b6e9339ad94ca6ecdb"}},{"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/darwin-mode/bench/ruvector/warmup-epoch.mjs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"66943aa91f73854e26716203f8353c9c94ff09cdd1cce46fa23217ebb78aeaf0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/ruvector/warmup-epoch.mjs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aab59424d93bda194ee687873651007d1625035d0e95a39781f3f588d88e744"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060runSweBenchTask\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/swe-bench-runner.mjs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"09fe0db1c578205e44b4f13a6ddc46aa959147ae9ceae54f6182d034ac480cbe"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdtempSync\u0060 in \u0060runSweBenchTask\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/swe-bench-runner.mjs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"8902732d39c8487b8a08d802adf3b05ccb56654d5da1642ffe3e905aba815c31"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readdirSync\u0060 in \u0060runSweBenchTask\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/swe-bench-runner.mjs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44f6c30d445680d2ac5b7742e9e27a2fafc2a5ce5cd0f1d2b0fedd1238fb962"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdtempSync\u0060 in \u0060runSweBenchTask\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/swe-bench-runner.mjs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead2a89e2ba140ab542b5ad6499b143c3ed1cca5fd33a73e1ca5226f4cc32d1c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060runSweBenchTask\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/swe-bench-runner.mjs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"208c6622958c1fafd1c8475bbf1c5b25535764fe32d462f2deb0dc4b917fecba"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdtempSync\u0060 in \u0060runSweBenchTask\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/swe-bench-runner.mjs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b89b2c0db56a95515b5c396d5389b29a869e02c9813efff3f399a2b98fbac51"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060callback to selected.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/darwin-mode/bench/swe-bench-runner.mjs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b2077a93d514ccc8638fb34fb63b81d803e6c64470a58b042e7dd53289d5555"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060runSweBenchTask\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/swe-bench-runner.mjs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"5944713ddf1a996ac0da2766013ec6475253d1eb1787776e0cb5c33b3e5d3f95"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060runSweBenchTask\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/swe-bench-runner.mjs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c608fb84b178e8fadd260cec1521e76194a1aa319cae77f0c90305cf5eb924"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060runSweBenchTask\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/swe-bench-runner.mjs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a42b780c9098ac5bf90e4246614d4908db3fc0c0070cdb8325d01e98274fe5c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\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/darwin-mode/bench/swebench/evolve-config.mjs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"702e13a3ec95c80e177a617bc1ea363b4ef3a500930bb8ad6ff990f92cb188fb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\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/darwin-mode/bench/swebench/evolve-config.mjs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"d760372894667caaa79ee81dbf46e7bf13148d43c76e5a6e575d6b40b83e1d63"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\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/darwin-mode/bench/swebench/evolve-perinstance.mjs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a439f513326c65f754d05f0f4e942caa3ada0b693f7e739322ea589e059561f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\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/darwin-mode/bench/swebench/evolve-perinstance.mjs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ac74ed2fde0fca7ab9c9bb61824f0ef0d1704814c98d5e802ed30b3788d85f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060openBase\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/swebench/gepa/branch-memory.mjs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba06ed41f2e0dc4cd134161208fa2d10b7d658ab2022280120c561369045f69d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdtempSync\u0060 in \u0060solveViaClaudeP\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/swebench/handoff-solver.mjs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"f21878895b3ce4800881b77d29a027adf05aa7baec61c160bfc277fd0aa32ad9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060solveViaClaudeP\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/swebench/handoff-solver.mjs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3714d6a11b3d56ae4049582025f2807a2887d9ef6a888381af248b77ed40420"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdtempSync\u0060 in \u0060gradePredictions\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/swebench/swebench-grade.mjs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e010c9bc2d3e4140db4b34f8397f12a28314f92b98f567ba85bf5cb2c8a24774"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060gradePredictions\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/swebench/swebench-grade.mjs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"088343bb0ab6420ac0c8e16010c62a2e69684349af01f2e5bcd26d7689a2e97f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060spawnSync\u0060 in \u0060gradePredictions\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/swebench/swebench-grade.mjs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"5effc605c5f47224b4edf8a5cca0f0a7127ec2f422e91e34e4163899d71f2516"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readdirSync\u0060 in \u0060gradePredictions\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/swebench/swebench-grade.mjs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"71bb4577c2125f2781e9b37b8c40e0d6c85331f533155835c8334a0bac3787a3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060gradePredictions\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/swebench/swebench-grade.mjs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"b232b10a077d89d848b623f1d7909a2e9e4114d3f5d7dc40ced1fab606eae138"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060gradePredictions\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/swebench/swebench-grade.mjs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"4170646cd070f4083fac7ddc8b8db77d0d2974a85d8d5cab06b341d2cbb86c23"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdtempSync\u0060 in \u0060runSolver\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/swebench/swebench-solver-cli.mjs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21b38f0a34eb5d3dedb524467786d4197a03309ea4e5afa77d7c83aaa57c96f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060runSolver\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/swebench/swebench-solver-cli.mjs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad5dd97c827d5d5a0b2457596d0fd8e2ce72c65d84e71a603e2ca7e954e61677"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060spawnSync\u0060 in \u0060runSolver\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/swebench/swebench-solver-cli.mjs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc406acf40d1ca6eead0bdc01caf0a5586f6d3e4912324a01f4d8f1c703bb8d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060runSolver\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/swebench/swebench-solver-cli.mjs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"3813501dc0de623dd901bbb8c528851e4da6838e218cd9de374e63e8d4edbb9e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060runSolver\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/swebench/swebench-solver-cli.mjs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db352b0deaa327216182b8a8e7fab1cb91a2717f57ada09f8c6f3c9daa64485"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060runSolver\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/swebench/swebench-solver-cli.mjs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a26835ed30c064634a087cbb563fedad6cf62d9abbbb86745f89c7caae504fe"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060runSolver\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/swebench/swebench-solver-cli.mjs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf5fd137de2920d0100ac55cf98a0b8bd8c4b6c73ed10415b4486ffa49552f73"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060runSolver\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/swebench/swebench-solver-cli.mjs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b0a17b69ef96602432b00b8908d00f191ac0d5cb0e31a10d0f7aa4d5d92c36"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060spawnIsolatedDriver\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/src/tier2-sandbox.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e7bb0935023a22d00d5e373c1f3f11bb9df035ce1914c92754659a6f33af7d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060realpathSync\u0060 in \u0060spawnIsolatedDriver\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/src/tier2-sandbox.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"792de8d8b64f58efef0258e58e707d918102e8c6aca2d2f66c8dd9f716a1d1fc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060realpathSync\u0060 in \u0060spawnIsolatedDriver\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/src/tier2-sandbox.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f03973313d011855e8b81200838c7e0417c7a66096003cb967af39c89bf86ab"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\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/flywheel/src/cli.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"0962bcc7bc14ea2453a97cdb72c54ff4d67836176e281070f4cfd89c2c5b62ea"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060load\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/horizon/src/core.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f4bbdd69200cb78a252ee3cbfa09aed328fd3662989f9df43dac3099a8ad6a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdtempSync\u0060 in \u0060createRvfBackend\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/kernel-js/src/memory-rvf.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"d901e24c57dfaab6dd139d1a1072ab3765bd293caaa1505d74a415d8dfc65466"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060createRvfBackend\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/kernel-js/src/memory-rvf.ts"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"afce8b8943b6cbc8633d852db6425c3e9e83d5e5b4aca47c14f6f602590e4cdc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060openOrCreate\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/kernel-js/src/memory-rvf.ts"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde09696e482127f811d7acad88c9830aa57309038e902a2981f327469e3a859"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060get\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/kernel-js/src/memory-rvf.ts"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4be8e1136b3a99821ba1227eba2b90ede288919d2e9e641bca744f586c4425"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readdirSync\u0060 in \u0060listNamespaces\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/kernel-js/src/memory-rvf.ts"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"845edabf5b53b41cbf8781d5d1a3575fe7b57b653b60278fd85b2e36fcc57841"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060close\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/kernel-js/src/memory-rvf.ts"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"e746de2b02ed13aa124fe4048e1b066588362e21b5130aea1940ead7f76742f1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060open\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/kernel-js/src/session.ts"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"281bb98e418b584668c7b8032e4b608c24db358f1450d4df4e97285e801b4589"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060validate\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/kernel-js/src/session.ts"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e2d23f888825459be6921f3becb05f5f4ee72f4889276ab9f02744eec61ce9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readAll\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/kernel-js/src/trajectory.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b44cb06ee6c57fc7bddf7429d739a50f23f4e1b673381191db58e0a50b041e7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060rotateIfLarger\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/kernel-js/src/trajectory.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e728ebbf23f3df55b890829d39cb9761ac7d277cfff33349a6842628e7a4b238"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060size\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/kernel-js/src/trajectory.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"8103db2e61f1d787e2e570a03c100c1228d27b515a7d5afa4c970fe4a5c4384b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060load\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/oo-agents/src/vm.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f279adc97f9914e22ac93f00c3aa7d16d73fa143e240774ff925a7e2e6d7a6f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060cmdInit\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/redblue/src/cli/index.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"8578d6d71f0c597f01cc48e8e2be703f0777af800c48f9a8ad0e7a2c19c2309e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060cmdRun\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/redblue/src/cli/index.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"612163d76d9148de7f9c356edfe19dd3baa57ab4e342619c0f8dc44ebeed4fcd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060cmdRun\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/redblue/src/cli/index.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"1433fc991471cf458fddb22dadda3d334f046576e0edf17cf0e62ba00a00384d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060cmdReport\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/redblue/src/cli/index.ts"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff8a7210c13ef63bc62b8b0158faf15b21faf590561d40aa4cb8a8bb0bf628ed"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060cmdReport\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/redblue/src/cli/index.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"550d4240df96e706522f73df1fb2c2d712dfdc12804f0fa9ba48323a32992d98"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060cmdHackerOneSubmit\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/redblue/src/cli/index.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fdc7f1758133cc253df66c1a8007c11f48372c465583db38d84edb335680292"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060cmdHackerOneSubmit\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/redblue/src/cli/index.ts"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"557fd63367823a4a8b76a697638f6105b00b264c18a2eec9d9575cc802de440b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\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":"scripts/bench-baseline.mjs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc88ff891ba08bd09354fde28e0279bdbcc6613d223c36eb1aa0ed9cc279d3c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\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":"scripts/bench-baseline.mjs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"660c69e70343272a7185fe077f43c29de8b21a6e6019f7245e657cf13a409f36"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readNpmLock\u0060 blocks the event loop until it finishes \u2014 a 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/sbom.mjs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b149f794a74fb2090f40cf32920f6689cf6068dd24dff4f7dc4263516a53a0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readExtraNpmLocks\u0060 blocks the event loop until it finishes \u2014 a 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/sbom.mjs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"97df44f6bb6ecf94a8ee72ff8eed0d3ede6bcd6a20ec6d4d63a19dad16a6f3b1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readCargoLock\u0060 blocks the event loop until it finishes \u2014 a 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/sbom.mjs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c276288feb5a0872433b10fcdf307bd31112e12549fa8ea350ca47f8d5ccdd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 30 sibling directories (95 clone groups): 95 duplicated blocks under packages/ have copies in at least two of the sibling directories agntcy, arc-agi-3, arc-agi-3-chatgpt, avo, create-agent-harness, darwin-mode (\u002B24 more sibling(s) not listed) \u2014 78 of them are reported below, and 17 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 95 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 95 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 95 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/evals-hle/src/evaluator.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd8a83c27774b5ac752c296fd6e3537fa39679d5a4bb7713069b5399aaaef56"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 36 sibling directories (19 clone groups): 19 of the duplicated blocks reported below have copies in at least two of the sibling directories claude-code, codex, coding, copilot, devops, education (\u002B30 more sibling(s) not listed) under examples-packages/. That concentration is one structural fact, not 19 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 19 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":"examples-packages/example-ads/bin/scaffold.mjs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"aead4d51d8148455e813e937baa9f6616d36deacd763cda63426e1ae89ba6a4b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 6 sibling directories (15 clone groups): 15 duplicated blocks under the repository root have copies in at least two of the sibling directories apps, experiments, kimi-k3-harness, packages, scripts, services \u2014 11 of them are reported below, and 4 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 15 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 15 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 15 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":"apps/web-ui/src/generator/scaffold.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"73da513b7ea0f0b23764ee3289f36b1639c9da612c5f9df3bbb0b8d14f0e9937"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 4 sibling directories (7 clone groups): 7 duplicated blocks under experiments/ have copies in at least two of the sibling directories credit-feedback, router-calibration-loop, signal-flywheel, turn-credit-acceptance \u2014 6 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 7 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 7 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 7 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/credit-feedback/lib.mjs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69d132a160497645c4767c41ad9ba30e5478efa2afc2a874cbcd4cc7c4b2d04"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (176 matched lines \u00D7 2 locations): services/apicompletions/src/routes/chatCompletions.ts:41 \u00B7 services/apicompletions/src/routes/messages.ts:53 \u2014 the two spans are one implementation copied and then locally edited \u2014 1210 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":"services/apicompletions/src/routes/chatCompletions.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7bc8baad81b38218c332a214b092ae74fd1d263fa403da7d47e43dff3fcdf9"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (114 identical lines \u00D7 2 files): packages/evals-hle/src/evaluator.ts:7 \u00B7 packages/evals-math/src/evaluator.ts:7 \u2014 these 2 files are line-for-line copies of one another \u2014 114 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/evals-hle/src/evaluator.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcba6f84ab09b14f90422187cce5bf83b3f5e631efaa2fc79dafe7db515fec7f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (103 matched lines \u00D7 2 locations): apps/web-ui/src/generator/scaffold.ts:195 \u00B7 packages/create-agent-harness/src/host-config.ts:62 \u2014 the two spans are one implementation copied and then locally edited \u2014 856 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":"apps/web-ui/src/generator/scaffold.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd6ad32c9b47fa3b70be06b2d44ccbebd6fc10edd459c1b56788e2644e93397"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (78 identical lines \u00D7 2 files): packages/evals-hle/src/genome.ts:14 \u00B7 packages/evals-math/src/genome.ts:16 \u2014 these 2 files are line-for-line copies of one another \u2014 78 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/evals-hle/src/genome.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"677e74065598ff12dd0b389e1e0f9be85356f35e472582a78c395a5e70d38488"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (77 lines \u00D7 3 locations): packages/evals-hle/src/evaluator.ts:79 \u00B7 packages/evals-math/src/evaluator.ts:79 \u00B7 packages/evals-sql/src/evaluator.ts:82 \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/evals-hle/src/evaluator.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cfa28ecb512377f1688909ee430ac10de4c4c1da7183bd157697b36c4b85820"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (69 matched lines \u00D7 2 locations): experiments/credit-feedback/lib.mjs:28 \u00B7 experiments/turn-credit-acceptance/lib.mjs:27 \u2014 the two spans are one implementation copied and then locally edited \u2014 527 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":"experiments/credit-feedback/lib.mjs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa7244fe50ccffc1a084966129dc9a002cf9309fce3becc88e6a9353cdbf3ea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (67 matched lines \u00D7 2 locations): packages/darwin-mode/src/archive.ts:40 \u00B7 packages/darwin-mode/src/numeric-archive.ts:17 \u2014 the two spans are one implementation copied and then locally edited \u2014 546 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/darwin-mode/src/archive.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"955e1554a1945fb586dbdc807740a15ff3fdd811a517cf60753d99e78e4615e4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (60 lines \u00D7 18 locations): examples-packages/example-ads/bin/scaffold.mjs:16 \u00B7 examples-packages/example-aws/bin/scaffold.mjs:16 \u00B7 examples-packages/example-azure/bin/scaffold.mjs:16 \u00B7 examples-packages/example-bio/bin/scaffold.mjs:16 \u00B7 \u002B14 more site(s) not listed \u2014 the 18 copies are spread across 18 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 18 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":"examples-packages/example-ads/bin/scaffold.mjs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"41dcf18d9aab54774d20d28d727e7dbbfd69d1b1c17f839941f93434b73a56ba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (60 lines \u00D7 4 locations): packages/evals-extract/src/data.ts:36 \u00B7 packages/evals-hle/src/data.ts:32 \u00B7 packages/evals-math/src/data.ts:31 \u00B7 packages/evals-sql/src/data.ts:34 \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/evals-extract/src/data.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"e842acc8793e6e82ea371118be49cc87d3b61c6600a94ebf2d1e3c25c452d6a4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (59 matched lines \u00D7 2 locations): apps/web-ui/src/generator/repo.ts:233 \u00B7 packages/create-agent-harness/src/analyze-repo.ts:163 \u2014 the two spans are one implementation copied and then locally edited \u2014 706 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":"apps/web-ui/src/generator/repo.ts"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e2c17af2e06701ea060c684be52d6c8ce81264d65c6a956b44dbf8eea3a39ac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (59 matched lines \u00D7 2 locations): kimi-k3-harness/scripts/flywheel-evolve.mjs:39 \u00B7 packages/radio/scripts/flywheel-radio.mjs:89 \u2014 the two spans are one implementation copied and then locally edited \u2014 561 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":"kimi-k3-harness/scripts/flywheel-evolve.mjs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e5710ccdbf356fe78187de1992daad0608dbd7522f1dab4d0b18c10985e100"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (53 lines \u00D7 2 locations): packages/evals-hle/src/leakage.ts:20 \u00B7 packages/evals-math/src/leakage.ts:20 \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/evals-hle/src/leakage.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d912f6a6568ddb6631c7de5c8806a4ff61f51f48ae11521d06ec40739cce43"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (52 lines \u00D7 5 locations): packages/evals-extract/src/data.ts:36 \u00B7 packages/evals-hle/src/data.ts:32 \u00B7 packages/evals-math/src/data.ts:31 \u00B7 packages/evals-servedmodel/src/data.ts:25 \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/evals-extract/src/data.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe3b593ed6bb2981a057d2d3e7a788d5489e0cae904d66a3b4330142612fd51a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (52 lines \u00D7 2 locations): packages/evals-hle/src/data.ts:49 \u00B7 packages/evals-toolcall/src/data.ts:57 \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/evals-hle/src/data.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"4155a6e15cc1a90622063a1dbafc0bbbf7bd28bf18cc615556d23a91411a023b"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (52 identical lines \u00D7 2 files): packages/evals-hle/src/score.ts:11 \u00B7 packages/evals-math/src/score.ts:11 \u2014 these 2 files are line-for-line copies of one another \u2014 52 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/evals-hle/src/score.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"2857c213eddfdeb7516d25dfc9d61e1ea5ee6b394f53b170140f79994dc85009"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (51 lines \u00D7 5 locations): packages/evals-extract/src/leakage.ts:24 \u00B7 packages/evals-hle/src/leakage.ts:24 \u00B7 packages/evals-math/src/leakage.ts:24 \u00B7 packages/evals-sql/src/leakage.ts:24 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 5 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 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/evals-extract/src/leakage.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f721f2b41a2946042b2005840779b1c66b4edf8768d8713244ed9f9efd2293"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (50 lines \u00D7 2 locations): packages/darwin-mode/src/openrouter-mutator.ts:66 \u00B7 packages/darwin-mode/src/requesty-mutator.ts:58 \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/darwin-mode/src/openrouter-mutator.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dac009be91fed50ca238f83fbc8d3f5308919838abd1a2d7ed7281c1890759d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (48 lines \u00D7 4 locations): packages/evals-extract/src/evaluator.ts:125 \u00B7 packages/evals-hle/src/evaluator.ts:112 \u00B7 packages/evals-math/src/evaluator.ts:112 \u00B7 packages/evals-sql/src/evaluator.ts:115 \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/evals-extract/src/evaluator.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"0603bd7bad610dd8eed65c4b1e487f35149ffe32cd6ae612a397ac9f21669ca1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (48 lines \u00D7 3 locations): packages/evals-extract/src/genome.ts:15 \u00B7 packages/evals-hle/src/genome.ts:13 \u00B7 packages/evals-math/src/genome.ts:15 \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/evals-extract/src/genome.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"156a5858f51ed04df234146ab0246c53b743a8567faf26b54091e982dc0caed5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (47 lines \u00D7 2 locations): packages/evals-hle/src/verifier.ts:10 \u00B7 packages/evals-math/src/verifier.ts:11 \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/evals-hle/src/verifier.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b3c3cebc44695b8a56fb1f351950b40819f9dfdb8c994b8b3ed2e7b96727345"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (47 lines \u00D7 2 locations): packages/evals-sql/src/genome.ts:17 \u00B7 packages/evals-toolcall/src/genome.ts:19 \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/evals-sql/src/genome.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead2c5c898f24272c93c604c9265af29d4e38a6e0eb5a56e60eed97ae80f9763"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (42 lines \u00D7 5 locations): packages/evals-extract/src/score.ts:38 \u00B7 packages/evals-hle/src/score.ts:38 \u00B7 packages/evals-math/src/score.ts:38 \u00B7 packages/evals-sql/src/score.ts:38 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 5 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 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/evals-extract/src/score.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d4af8728fcdf964c557e7563905b5b05f8d98d395ce9cc5477f5eaafa709c8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2 locations): packages/create-agent-harness/src/genome.ts:197 \u00B7 packages/create-agent-harness/src/threat-model.ts:209 \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/create-agent-harness/src/genome.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"69781038c82f6f0190d6b8b96846c5b3778070cf480087dfc17346c6235f427a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (38 matched lines \u00D7 2 locations): packages/darwin-mode/src/refine-mutator.ts:31 \u00B7 packages/darwin-mode/src/ruvllm-mutator.ts:26 \u2014 the two spans are one implementation copied and then locally edited \u2014 265 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/darwin-mode/src/refine-mutator.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd945707f18f5d40dba90437fa922dd7ed3d848b38cbb2ea31aef1d4b5c07b17"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (38 matched lines \u00D7 2 locations): packages/evals-hle/src/normalizer.ts:9 \u00B7 packages/evals-math/src/normalizer.ts:10 \u2014 the two spans are one implementation copied and then locally edited \u2014 366 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/evals-hle/src/normalizer.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"629f3e806829e5376ef217ff6c054516c87895ba5abc8f25c95c04a689544d4d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (38 matched lines \u00D7 2 locations): packages/redblue/src/cli/index.ts:502 \u00B7 packages/weight-eft/src/cli.ts:176 \u2014 the two spans are one implementation copied and then locally edited \u2014 236 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/redblue/src/cli/index.ts"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d51062dca031ff464f131b40be37210593701a257d54f71c4bf17b675219715"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2 locations): apps/web-ui/src/generator/render.ts:19 \u00B7 packages/create-agent-harness/src/renderer.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":"apps/web-ui/src/generator/render.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8637af9e9ab22cd6b48ec7ff5ef505014c01349977e4f22398c67ad83a8f9be"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 5 locations): packages/evals-extract/src/calibration.ts:10 \u00B7 packages/evals-hle/src/calibration.ts:10 \u00B7 packages/evals-math/src/calibration.ts:10 \u00B7 packages/evals-sql/src/calibration.ts:10 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 5 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 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/evals-extract/src/calibration.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"803a5c51ebc515f9a7a8d27af471b5c323129834fdb2147ad32763582218bf92"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 5 locations): packages/evals-extract/src/gate.ts:26 \u00B7 packages/evals-hle/src/gate.ts:29 \u00B7 packages/evals-math/src/gate.ts:29 \u00B7 packages/evals-sql/src/gate.ts:30 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 5 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 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/evals-extract/src/gate.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae67d503fcdb218ec30956841282e59c3525740cb93cb7bc157befaf3744e897"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2 locations): packages/evals-math/src/verifier.ts:31 \u00B7 packages/evals-toolcall/src/verifier.ts:41 \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/evals-math/src/verifier.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4a50ec455bf17dd0d36559e43e5174213be5e238e9f452f3bdba0ebd4dc7232"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (31 matched lines \u00D7 2 locations): packages/horizon/src/core.ts:15 \u00B7 packages/oo-agents/src/vm.ts:34 \u2014 the two spans are one implementation copied and then locally edited \u2014 248 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/horizon/src/core.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f332a82b04e15b4b488004bd6516e8669b2838a76d1c2807c70a599ace66943"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 6 locations): packages/evals-extract/src/evaluator.ts:125 \u00B7 packages/evals-hle/src/evaluator.ts:112 \u00B7 packages/evals-math/src/evaluator.ts:112 \u00B7 packages/evals-servedmodel/src/evaluator.ts:48 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 copies are spread across 6 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/evals-extract/src/evaluator.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6afa82bf127f774cc9e9b4c6aaf24a0610b2b77ec58c140831c38080eafcfc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 5 locations): packages/evals-extract/src/routing.ts:11 \u00B7 packages/evals-hle/src/routing.ts:10 \u00B7 packages/evals-math/src/routing.ts:10 \u00B7 packages/evals-sql/src/routing.ts:11 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 5 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/evals-extract/src/routing.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5d61a0048928c961c88a6412f1944a308834f3309c736709c50eabda21ea81"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 5 locations): packages/evals-extract/src/genome.ts:90 \u00B7 packages/evals-hle/src/genome.ts:88 \u00B7 packages/evals-math/src/genome.ts:93 \u00B7 packages/evals-sql/src/genome.ts:97 \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/evals-extract/src/genome.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba90b34a108f95c211b92e0f443226340b57ac8871170dd5ffa780a79e900fc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (23 matched lines \u00D7 2 locations): examples-packages/devops/bin/scaffold.mjs:2 \u00B7 examples-packages/sales/bin/scaffold.mjs:2 \u2014 the two spans are one implementation copied and then locally edited \u2014 118 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":"examples-packages/devops/bin/scaffold.mjs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6c24ecb68a74d484a0ce66cb28f154c65b73e23b49f1c70dccaa12fb22c922"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 3 locations): examples-packages/coding/bin/scaffold.mjs:5 \u00B7 examples-packages/github-actions/bin/scaffold.mjs:5 \u00B7 examples-packages/opencode/bin/scaffold.mjs:5 \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":"examples-packages/coding/bin/scaffold.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3030903e3d8097d20f6ee717f0cbc187d15ff3f684bcabb6a85a994a2fe612"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): examples-packages/education/bin/scaffold.mjs:5 \u00B7 examples-packages/legal/bin/scaffold.mjs: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":"examples-packages/education/bin/scaffold.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d69560097104c6ab880821f010bf999951c1915c0bcf2d6f7950cdde3917f5d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): packages/oo-agents/src/pod.ts:74 \u00B7 packages/radio/src/sim.ts:338 \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/oo-agents/src/pod.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ed528774e836d046e9207ee06960e69f8652bc42c7f587c4c23713e2a94009"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): examples-packages/repo-maintainer/bin/scaffold.mjs:5 \u00B7 examples-packages/trading/bin/scaffold.mjs: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":"examples-packages/repo-maintainer/bin/scaffold.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"c011d3b6089716e6551ff2e394f8c6264f9f8b6d71f8a52851e71cd8d625242e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): packages/arc-agi-3-chatgpt/src/store.ts:552 \u00B7 packages/arc-agi-3-chatgpt/src/store.ts:637 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3-chatgpt/src/store.ts"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"1842342d3ec6ab1cf51f4dda866a8b1959e23d1ec8620a90c93d6be94255a7a3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): packages/arc-agi-3/src/avo-loop.ts:69 \u00B7 packages/arc-agi-3/src/plan-archive.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/arc-agi-3/src/avo-loop.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a22289c2bd94aa561eca315d33823851e151f29e2a9de788a92c0f540192342"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (20 matched lines \u00D7 2 locations): packages/arc-agi-3-chatgpt/src/store.ts:1097 \u00B7 packages/arc-agi-3-chatgpt/src/store.ts:1145 \u2014 the two spans are one implementation copied and then locally edited \u2014 126 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/arc-agi-3-chatgpt/src/store.ts"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"868a86a8ba025594a36740e206731255b989ec7b0492b5072ac701e264edee6c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): packages/darwin-mode/src/openrouter-mutator.ts:21 \u00B7 packages/darwin-mode/src/requesty-mutator.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/darwin-mode/src/openrouter-mutator.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"819de5ea026d0f0358ed8fa3c0b1131c3072d2966458a775e63240615eff0c47"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): packages/darwin-mode/src/security/codeql-oracle.ts:46 \u00B7 packages/darwin-mode/src/security/semgrep-oracle.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/darwin-mode/src/security/codeql-oracle.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"70db45dd8a8d0d109f5020a357c50dc33c4a50a6059498575bffb045c46a6a24"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (20 matched lines \u00D7 2 locations): packages/field-memory/src/ruvector-storage.ts:171 \u00B7 packages/field-memory/src/storage.ts:49 \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/field-memory/src/ruvector-storage.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e99f3e4ce59047ee145d8b7cecd263d75606733b02015acb19fd1b204ac27a4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3 locations): examples-packages/claude-code/bin/scaffold.mjs:5 \u00B7 examples-packages/hermes/bin/scaffold.mjs:5 \u00B7 examples-packages/research/bin/scaffold.mjs:5 \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":"examples-packages/claude-code/bin/scaffold.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a067eb0fb32b5559d3917af127e551666796543d4e13f075a0dbbe2915226ff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (19 matched lines \u00D7 2 locations): examples-packages/rvm/bin/scaffold.mjs:2 \u00B7 examples-packages/sales/bin/scaffold.mjs:2 \u2014 the two spans are one implementation copied and then locally edited \u2014 105 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":"examples-packages/rvm/bin/scaffold.mjs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"807bf4d569a3a8ce3e7f4420bef02ced9b078dc7ad81d3c734aacaddfa267b2e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): packages/arc-agi-3-chatgpt/src/store.ts:989 \u00B7 packages/arc-agi-3-chatgpt/src/store.ts:1131 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3-chatgpt/src/store.ts"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"132dffe33f6ea92276d0fe4d413d8815a725a2f111362ef03b367dcd75c3bc42"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): packages/arc-agi-3-chatgpt/src/store.ts:734 \u00B7 packages/arc-agi-3-chatgpt/src/store.ts:813 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3-chatgpt/src/store.ts"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c507b10886e778a7463b18c4a65fb524118a7b0d6175955a5cd7620e430a9a4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): packages/field-memory/src/field-memory.ts:481 \u00B7 packages/field-memory/src/field-memory.ts:523 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/field-memory/src/field-memory.ts"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"d80dfe00b641c573d743a86995e6578b7e0738d8926b26f35650f3523905ae68"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): examples-packages/openclaw/bin/scaffold.mjs:2 \u00B7 examples-packages/support/bin/scaffold.mjs:2 \u2014 the two spans are one implementation copied and then locally edited \u2014 158 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":"examples-packages/openclaw/bin/scaffold.mjs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5fe75af010992e676901193283cfacaaa5e4f555f244a6526111b1da975722"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): packages/create-agent-harness/src/meta-proxy-service.ts:737 \u00B7 packages/create-agent-harness/src/meta-proxy-service.ts:782 \u2014 both copies are in the same file, so extract the block 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/create-agent-harness/src/meta-proxy-service.ts"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c668f7e056fa475f9e6b4f3c39d0f295e44e715df28159d5ea024f0d1c0993a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): packages/create-agent-harness/src/score.ts:468 \u00B7 packages/create-agent-harness/src/threat-model.ts:251 \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/create-agent-harness/src/score.ts"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4be25baa1af1ebb80ed35eaefde3e8131333ea66b054f3cca20f8987ed4c4c5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): packages/darwin-mode/src/archive.ts:204 \u00B7 packages/darwin-mode/src/numeric-archive.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/darwin-mode/src/archive.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3889152d1f255881789c54258a237d2b75f173e5591cab7267b4c20c7b98697"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): packages/darwin-mode/src/archive.ts:276 \u00B7 packages/darwin-mode/src/numeric-archive.ts:105 \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/darwin-mode/src/archive.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdef49e694c9dc8badef2d2c17777fcd9fb0e1d14d9df5d7558c56fab18d56b2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): packages/darwin-mode/src/sandbox.ts:90 \u00B7 packages/darwin-mode/src/tier2-sandbox.ts:203 \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/darwin-mode/src/sandbox.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d2a1d9d88725f7963eaf660191a0397972a2b8233a190fa86b66649fbfe745"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): packages/darwin-mode/src/security/corpus.ts:83 \u00B7 packages/darwin-mode/src/security/corpus.ts:112 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/src/security/corpus.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"37eeb66e298f2b47b04d087aea2f99a1515f0b8cdd8ee59db02b072845ebc629"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): packages/darwin-mode/src/security/util.ts:17 \u00B7 packages/projects/src/core.ts:71 \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/darwin-mode/src/security/util.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1fda1afbc0e78695adcf5d0c41b44451403fe6bae34a7504f521995e818151"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): packages/evals-extract/src/normalizer.ts:29 \u00B7 packages/evals-toolcall/src/normalizer.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/evals-extract/src/normalizer.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e863d6631e45e4a466fda1bd5ba1ba291cdc2b98e0f0f25269eea4dd932ad9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): packages/arc-agi-3/src/belief-graph.ts:47 \u00B7 packages/arc-agi-3/src/world-model.ts:37 \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/arc-agi-3/src/belief-graph.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ad079e41a95155817f747cb3deb41524ee0acfc6715530586719d85233b431"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): packages/darwin-mode/src/cli.ts:43 \u00B7 packages/darwin-mode/src/cli.ts:117 \u2014 the two spans are one implementation copied and then locally edited \u2014 187 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/darwin-mode/src/cli.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"9155a2432c028ba18c34a41b0a89ad3953eb87c8594677b89e4e6212d499c738"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/arc-agi-3-chatgpt/src/store.ts:577 \u00B7 packages/arc-agi-3-chatgpt/src/store.ts:706 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3-chatgpt/src/store.ts"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f00f62b39c7c271c528c3542e6e011d6700561ed2f8131ad88a2b9d6418e3f4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/arc-agi-3-chatgpt/src/store.ts:772 \u00B7 packages/arc-agi-3-chatgpt/src/store.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/arc-agi-3-chatgpt/src/store.ts"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d91e7111a2c18ec18d6d07757ebaee4a4113edd42e01e2cb3c8ba12624bd44"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/arc-agi-3/src/canonical.ts:744 \u00B7 packages/arc-agi-3/src/plan-archive.ts:195 \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/arc-agi-3/src/canonical.ts"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2441d8e841e0960f192787278f2f457397f5ab7eb2172f3d4e6799307f4a36"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4 locations): packages/evals-extract/src/genome.ts:148 \u00B7 packages/evals-hle/src/genome.ts:146 \u00B7 packages/evals-math/src/genome.ts:151 \u00B7 packages/evals-sql/src/genome.ts:157 \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/evals-extract/src/genome.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aaa40da2c87a5b259ecdf3c4fd361616e3d71b7a6007ca76079fb1cd4f12d63"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): packages/host-openclaw/src/index.ts:160 \u00B7 packages/host-rvm/src/index.ts:191 \u2014 the two spans are one implementation copied and then locally edited \u2014 131 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/host-openclaw/src/index.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"c93e6fde66ac21f493978658068d36f1dde4fe8e1eb37483b25a6111ddeaa888"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3 locations): services/apicompletions/src/routes/chatCompletions.ts:61 \u00B7 services/apicompletions/src/routes/completions.ts:31 \u00B7 services/apicompletions/src/routes/messages.ts:70 \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":"services/apicompletions/src/routes/chatCompletions.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"14354b188f82a2775703fa262f2fb7599e5fc32e7366722750439e4cf96ef9f7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): examples-packages/sales/bin/scaffold.mjs:8 \u00B7 examples-packages/support/bin/scaffold.mjs:11 \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":"examples-packages/sales/bin/scaffold.mjs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef88da616b8d902e695a62578ce67b2dddd0b4799ca447a37edb400c05ff7c32"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/arc-agi-3-chatgpt/src/store.ts:531 \u00B7 packages/arc-agi-3-chatgpt/src/store.ts:604 \u2014 both copies are in the same file, so extract the block 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/arc-agi-3-chatgpt/src/store.ts"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b8de60cf79e11beaca11976847e533f4b5866ec58380061228866df07c189a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/darwin-mode/src/security/memory.ts:138 \u00B7 packages/darwin-mode/src/security/memory.ts:161 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/src/security/memory.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad389e81e07a581c24c83371e1e6a35906027bf98f86c9563e4e9495e1353d55"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4 locations): packages/evals-extract/src/evaluator.ts:81 \u00B7 packages/evals-hle/src/evaluator.ts:79 \u00B7 packages/evals-math/src/evaluator.ts:79 \u00B7 packages/evals-sql/src/evaluator.ts:82 \u2014 the 4 copies are spread across 4 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/evals-extract/src/evaluator.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"bffd19e95bfb9da2953d6979bba61de2fbb128ed229d5b508a5d98abcbef5ce7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/harness/src/receipts.ts:159 \u00B7 packages/harness/src/receipts.ts:180 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/harness/src/receipts.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9bc3c3cb14650ec5c0d814ee4c911122ccea4ab547a1766ef8d8387965d56fc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): experiments/router-calibration-loop/assert.mjs:15 \u00B7 experiments/turn-credit-acceptance/assert.mjs:14 \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":"experiments/router-calibration-loop/assert.mjs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74665b58ce26f7ee1aa1459f2b2f8bdc2050238ebbf4ad93583c596dd984baf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/arc-agi-3-chatgpt/src/store.ts:938 \u00B7 packages/arc-agi-3-chatgpt/src/store.ts:1089 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3-chatgpt/src/store.ts"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"e398e755e56f6550e5263bb9dbdc43a679ab770f6e06a90aa23d12cc4f277849"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/arc-agi-3/src/canonical.ts:698 \u00B7 packages/arc-agi-3/src/canonical.ts:800 \u2014 both copies are in the same file, so extract the block 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/arc-agi-3/src/canonical.ts"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a68b6475d5dd456edc79a85fa2c08d448ceb6a5cc0b31a3782c75dc24831120"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/arc-agi-3/src/controller.ts:454 \u00B7 packages/arc-agi-3/src/controller.ts:782 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3/src/controller.ts"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1ed77cd43d3438845089338a830073541d03f5037a6fa9bb2d8eed3c3a3cf6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 5 locations): packages/evals-extract/src/evaluator.ts:192 \u00B7 packages/evals-hle/src/evaluator.ts:179 \u00B7 packages/evals-math/src/evaluator.ts:179 \u00B7 packages/evals-sql/src/evaluator.ts:184 \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/evals-extract/src/evaluator.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"57bdba16079b4eecde71102c1bca37f98a8d307ab680ca654b93609952230e72"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/redblue/src/judges/judge.ts:159 \u00B7 packages/redblue/src/judges/judge.ts:209 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/redblue/src/judges/judge.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"078989341410c6a1ef486496ebcb03e846909d34afe580ae4cf9a686b1364faa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): scripts/audit-deps.mjs:191 \u00B7 scripts/publish-dryrun.mjs:110 \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":"scripts/audit-deps.mjs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"9459de5798f36cef7b659a47996fbc6e69cb03aa055c69d8af58d0fbe15a1439"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): scripts/gcp-cluster.mjs:42 \u00B7 scripts/tbench-gcp.mjs:26 \u2014 the two spans are one implementation copied and then locally edited \u2014 201 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/gcp-cluster.mjs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c344116145ee2c09dfcbdcaed01ce4aa274e803ce3f2f89f0b3336e5f84a06"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): examples-packages/copilot/bin/scaffold.mjs:7 \u00B7 examples-packages/pi-dev/bin/scaffold.mjs:8 \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":"examples-packages/copilot/bin/scaffold.mjs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f9c046cddc3d178cdd828f57230669ae65d181c906802402d494c6cc102e8a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/arc-agi-3/src/plan-archive.ts:464 \u00B7 packages/arc-agi-3/src/plan-archive.ts:854 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3/src/plan-archive.ts"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac6d4444964c8bc01de3e6ae57bc1b0ec254f97d02d8ed83d8e63736b45fd6f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): packages/darwin-mode/src/clade.ts:113 \u00B7 packages/darwin-mode/src/clade.ts:140 \u2014 the two spans are one implementation copied and then locally edited \u2014 72 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/darwin-mode/src/clade.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c2dad82e310d940ef19e94f18ef2cf671323c752b7b6178a9cecd64afc1c41a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/darwin-mode/src/contrastive/confirmation.ts:140 \u00B7 packages/darwin-mode/src/contrastive/engine.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/darwin-mode/src/contrastive/confirmation.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb7b1725571468fce87b5d2951f9404925622767895f51cd8d3dc9555ebf291"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/darwin-mode/src/mutator.ts:146 \u00B7 packages/darwin-mode/src/refine-mutator.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/darwin-mode/src/mutator.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f0f47d38d73f55564ef49a3aa141f8fc1239177ad00a809868703605a1a494"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): packages/darwin-mode/src/openrouter-mutator.ts:18 \u00B7 packages/darwin-mode/src/requesty-mutator.ts:17 \u00B7 packages/redblue/src/models/openrouter.ts:11 \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/darwin-mode/src/openrouter-mutator.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8530f9ceb80aca2c0d34590a6aeb5928154a3db2e24da4511996a2e639b09e2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/darwin-mode/src/security/ablation.ts:92 \u00B7 packages/darwin-mode/src/security/compounding.ts:155 \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/darwin-mode/src/security/ablation.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"416b6729a68cd14b48e46d60a87413310b23f36402fe40df06806d0808024e43"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4 locations): packages/evals-extract/src/evaluator.ts:98 \u00B7 packages/evals-hle/src/evaluator.ts:96 \u00B7 packages/evals-math/src/evaluator.ts:96 \u00B7 packages/evals-sql/src/evaluator.ts:99 \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/evals-extract/src/evaluator.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f76c2e6f3effdb554cd91ee3d226660946068542efd7f7756c5ed9842f63c44"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): packages/kernel-js/src/memory.ts:58 \u00B7 packages/kernel-js/src/self-evolution.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/kernel-js/src/memory.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"2082dfc0445beedd01637754724d93df654107ac43b2c5e8a8c5858eb2a99d54"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): examples-packages/copilot/bin/scaffold.mjs:2 \u00B7 examples-packages/openclaw/bin/scaffold.mjs:2 \u2014 the two spans are one implementation copied and then locally edited \u2014 117 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":"examples-packages/copilot/bin/scaffold.mjs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf6fd07ddbf76592717e1f78dbc85e291ca8634339c5a97aa3f9d795301870a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): examples-packages/copilot/bin/scaffold.mjs:2 \u00B7 examples-packages/support/bin/scaffold.mjs:2 \u2014 the two spans are one implementation copied and then locally edited \u2014 100 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples-packages/copilot/bin/scaffold.mjs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b871e673ef7e5eb99b4b0833121121877678498dfb213b230e2b1c7cb37e9c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): examples-packages/devops/bin/scaffold.mjs:19 \u00B7 examples-packages/pi-dev/bin/scaffold.mjs:13 \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":"examples-packages/devops/bin/scaffold.mjs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b5aa8a025eb8d841b87c70b4763a9feaf572be8c43a7d330b0f699f95649030"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): examples-packages/pi-dev/bin/scaffold.mjs:8 \u00B7 examples-packages/sales/bin/scaffold.mjs:21 \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":"examples-packages/pi-dev/bin/scaffold.mjs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcbb9be587292d4d7600b6441ce3966c31b1289b084f746a4981086ca54a620d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): examples-packages/pi-dev/bin/scaffold.mjs:7 \u00B7 examples-packages/support/bin/scaffold.mjs:7 \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":"examples-packages/pi-dev/bin/scaffold.mjs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"624b5d2d78583da9793b2ed163d4b480a7aae682c443b6a37c09c262b504e3b8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): experiments/signal-flywheel/run.mjs:46 \u00B7 kimi-k3-harness/scripts/flywheel-evolve.mjs:46 \u00B7 packages/radio/scripts/flywheel-radio.mjs:96 \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":"experiments/signal-flywheel/run.mjs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"f399f2fba2837546511113e0efdcee637fecab8e73d2e23459a7961cf55714d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): packages/arc-agi-3-chatgpt/src/official-factory.ts:1229 \u00B7 packages/arc-agi-3-chatgpt/src/server.ts:546 \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/arc-agi-3-chatgpt/src/official-factory.ts"},"region":{"startLine":1229}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d14953539de8d087e74a14145fced3b4974281cb3043a481b9d29643e7071a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/avo/src/crypto.ts:7 \u00B7 packages/horizon/src/checkpoint.ts:24 \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/avo/src/crypto.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"a21a425654221002c1138e59a735ea8ab82bf4bb177f5fa9c46dc30e6215a129"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/create-agent-harness/src/meta-proxy-service.ts:497 \u00B7 packages/create-agent-harness/src/meta-proxy-service.ts:576 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/meta-proxy-service.ts"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c04767f30bbab7af342cdce1e4c66b39675054f846e12e77783a5f5b53e0d9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/create-agent-harness/src/meta-proxy.ts:811 \u00B7 packages/create-agent-harness/src/meta-proxy.ts:822 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8c5201034aa32a1c18c6722615ab71594011b98dbdc5b9a2e382c64e2fb5af"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/create-agent-harness/src/score.ts:60 \u00B7 packages/create-agent-harness/src/threat-model.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/create-agent-harness/src/score.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"897d3acf9f3db99c0adda048e7ba1ded5c28349f0375a65e28cfe1c7a42358c9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/darwin-mode/src/phenotype.ts:47 \u00B7 packages/weight-eft/src/eval.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/darwin-mode/src/phenotype.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d5845a293888c7c1cbc61de71dee7fbd173fe6b4e9c8cafdd17da1623fb756"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/darwin-mode/src/security/real-evolve.ts:134 \u00B7 packages/darwin-mode/src/security/real-loop.ts:89 \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/darwin-mode/src/security/real-evolve.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"1683fb2f12a03094bcd86b8bf51a9404e2388057b869a4e1673d1886ab099f88"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): packages/evals-toolcall/src/verifier.ts:94 \u00B7 packages/evals-toolcall/src/verifier.ts:111 \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/evals-toolcall/src/verifier.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"301f5ac94833be754cc928252b6bff143dd7c86ad216001fbde12f31e7b0f26b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): scripts/audit-deps.mjs:106 \u00B7 scripts/audit-deps.mjs: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":"scripts/audit-deps.mjs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c062c93172a904db184a092d7adbb9574c967717ee4f2d693ea2ee8334b3ba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): examples-packages/codex/bin/scaffold.mjs:11 \u00B7 examples-packages/repo-maintainer/bin/scaffold.mjs:19 \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":"examples-packages/codex/bin/scaffold.mjs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aea8b541640a7761d23f1351f30c8b1adead93e827d8de51f9eb0cdf93b7250"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): examples-packages/openclaw/bin/scaffold.mjs:7 \u00B7 examples-packages/pi-dev/bin/scaffold.mjs:7 \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":"examples-packages/openclaw/bin/scaffold.mjs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ac334d6a5bd29cc52c78fb376a1d08d7afe2ea7f577f887f2baee6ba6525da"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): examples-packages/pi-dev/bin/scaffold.mjs:13 \u00B7 examples-packages/rvm/bin/scaffold.mjs:19 \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":"examples-packages/pi-dev/bin/scaffold.mjs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"691122c9a43f42027dde14fe95c9a7fab8608e4b4c7b34854ca7eb724eaa31b2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): experiments/credit-feedback/assert.mjs:25 \u00B7 experiments/router-calibration-loop/assert.mjs:15 \u00B7 experiments/turn-credit-acceptance/assert.mjs:14 \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":"experiments/credit-feedback/assert.mjs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0425e4703d18512408f1edb5c8c013292911ca8b4cf33b9a5281131f9e88de6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): experiments/credit-feedback/run.mjs:32 \u00B7 experiments/router-calibration-loop/run.mjs:70 \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":"experiments/credit-feedback/run.mjs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ca3114a7334510adb6b7ffc95b3e1ac17493341612047238f22cd96fe1ddc1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): experiments/router-calibration-loop/lib.mjs:31 \u00B7 experiments/signal-flywheel/config.mjs:31 \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":"experiments/router-calibration-loop/lib.mjs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3995531021062564128e418ce8ce1987ca937d6019f95845cae7b74d713a09b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): experiments/signal-flywheel/config.mjs:31 \u00B7 experiments/turn-credit-acceptance/lib.mjs:27 \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":"experiments/signal-flywheel/config.mjs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"baf4f5cffda7b3b1a0d6a05e96bd2eadbca74ad99964a14ec2b3e672c5dc89d2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): packages/arc-agi-3-chatgpt/src/store.ts:434 \u00B7 packages/arc-agi-3-chatgpt/src/store.ts:488 \u00B7 packages/arc-agi-3-chatgpt/src/store.ts:735 \u00B7 packages/arc-agi-3-chatgpt/src/store.ts:814 \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/arc-agi-3-chatgpt/src/store.ts"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"143a65fa3ae32c653a0933116ab24ba327c008a985f74c3ed072d1f227cf2429"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/arc-agi-3/src/checkpoint.ts:203 \u00B7 packages/arc-agi-3/src/receipts.ts:189 \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/arc-agi-3/src/checkpoint.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7b70e75613bfb37e0ef68cac63ebca71ec0bd2d4bb423cf0a24cb7d8b960019"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): packages/aws-finops/src/cascade.ts:104 \u00B7 packages/aws-finops/src/cascade.ts:120 \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/aws-finops/src/cascade.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"807e50e07f7444f78053ea17ed450bca743f0ab9fac9834ba41bcdccfc073d93"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/create-agent-harness/src/audit-cmd.ts:39 \u00B7 packages/create-agent-harness/src/audit-cmd.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/create-agent-harness/src/audit-cmd.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f891270930b8470a7dd7e4fa135435b30174be86f0350d5617b83a29e9c5c2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): packages/create-agent-harness/src/sbom-cmd.ts:38 \u00B7 scripts/sbom.mjs:107 \u2014 the two spans are one implementation copied and then locally edited \u2014 93 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/create-agent-harness/src/sbom-cmd.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"6787bf40d753204e28193986d3697d873ce0fbed4c50839de39661f4b6cd0460"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5 locations): packages/darwin-mode/src/clade.ts:22 \u00B7 packages/darwin-mode/src/fann-surrogate.ts:106 \u00B7 packages/darwin-mode/src/numeric-mutator.ts:23 \u00B7 packages/oo-agents/src/pod.ts:79 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 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 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/darwin-mode/src/clade.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2951b004e5dd3e6346c247645c4604203fc3a2590383b8a3fd54d7bef9611cd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): packages/darwin-mode/src/numeric-mutator.ts:23 \u00B7 packages/oo-agents/src/pod.ts:79 \u00B7 packages/radio/src/sim.ts:342 \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/darwin-mode/src/numeric-mutator.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd7cae131ef98b8a69b81accecb05054489f69296f6cc12d4a54bad98af2324"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): packages/evals-extract/src/evaluator.ts:66 \u00B7 packages/evals-hle/src/evaluator.ts:64 \u00B7 packages/evals-math/src/evaluator.ts:64 \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/evals-extract/src/evaluator.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"b742f93f5ed460ecf69871cd7031ba50c49ec2634081529471bf873508dd5ee5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/host-claude-code/src/index.ts:209 \u00B7 packages/host-codex/src/index.ts:148 \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/host-claude-code/src/index.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"66fe95b1d45b8978bde4311c6a3c9825190f6e4fa626cc2415331b8fc536d25d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/host-copilot/src/index.ts:144 \u00B7 packages/host-opencode/src/index.ts:192 \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/host-copilot/src/index.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"b687e81cdb45374f99a2d814c96e66aaa82b74155bf662ef4f7670d3ffe1df46"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): packages/redblue/src/integrations/hackerone.ts:464 \u00B7 packages/redblue/src/integrations/hackerone.ts:637 \u2014 the two spans are one implementation copied and then locally edited \u2014 102 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/redblue/src/integrations/hackerone.ts"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"abaa2744a7c69d15c3c6e1d3ceb1ba6c4700c2e1a604405ed591a982c643511f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/sdk/src/index.ts:129 \u00B7 packages/sdk/src/index.ts:140 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/sdk/src/index.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82ecd8c47c17d332769519d1cf11071e3536a090c23906bd26595ecb3d72188"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): scripts/release-notes.mjs:55 \u00B7 scripts/release-notes.mjs: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":"scripts/release-notes.mjs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"63978806cda0160ab7fa3870eb2b5257e0d6190525f9a316925ac9bce9f9301f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): scripts/release.mjs:127 \u00B7 scripts/release.mjs:142 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release.mjs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1a63a63952475174f2b975749f7875aff6824a46e03d91ab1b471617d1ae6f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): scripts/verify-all-hosts.mjs:197 \u00B7 scripts/verify-all-hosts.mjs: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":"scripts/verify-all-hosts.mjs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6e2b0f9cd123bd6d979f89dfb519c3d94f89319921bd129b818b6066624894"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): experiments/turn-credit-acceptance/lib.mjs:39 \u00B7 packages/darwin-mode/src/security/util.ts:36 \u00B7 packages/projects/src/core.ts:81 \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":"experiments/turn-credit-acceptance/lib.mjs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed0f625b0face3bf2fc7c4bfbe9e6bda4c76412ea360369c43c654852429035"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/arc-agi-3-chatgpt/src/cli.ts:15 \u00B7 packages/arc-agi-3-chatgpt/src/cli.ts:31 \u2014 both copies are in the same file, so extract the block 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/arc-agi-3-chatgpt/src/cli.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"b197d60db2f711fa5fc0a91fb9abb8a0411f776e5484f6611d8c7e9d829a1a99"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): packages/arc-agi-3-chatgpt/src/official-factory.ts:284 \u00B7 packages/field-memory/src/util.ts:137 \u2014 the two spans are one implementation copied and then locally edited \u2014 102 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/arc-agi-3-chatgpt/src/official-factory.ts"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26343a5e8a9fef23db9c9d77115236ef4143e4d562bb55f12e0edaf0a3b1a6d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): packages/arc-agi-3-chatgpt/src/store.ts:185 \u00B7 packages/turn-credit/src/receipt.ts:13 \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/arc-agi-3-chatgpt/src/store.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c28214f6e9286a1c61143e5e446da058ae42cc0bf789c265832251cf7546c0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/arc-agi-3/src/checkpoint.ts:1118 \u00B7 packages/arc-agi-3/src/checkpoint.ts:1133 \u2014 both copies are in the same file, so extract the block 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/arc-agi-3/src/checkpoint.ts"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b8a409fde06d238331129eca0905d354614555d2f9c516301f5e6f11a4f205c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): packages/create-agent-harness/src/index.ts:1027 \u00B7 packages/create-agent-harness/src/index.ts:1060 \u00B7 packages/create-agent-harness/src/index.ts:1083 \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/create-agent-harness/src/index.ts"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"5895aa6600e7df7161ab2da8efc83d2bb8e94132374beb8a3bd6cd1d910bb6c0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/create-agent-harness/src/meta-proxy-service.ts:392 \u00B7 packages/create-agent-harness/src/meta-proxy-service.ts:682 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/meta-proxy-service.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ebe69c7e59c6433965fabd33ef197f0b3da55d9c637b75483b475014833286"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): packages/create-agent-harness/src/oia-manifest.ts:244 \u00B7 packages/create-agent-harness/src/score.ts:434 \u2014 the two spans are one implementation copied and then locally edited \u2014 115 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/create-agent-harness/src/oia-manifest.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"a777095d088472ec8e1dda3df0a44cfbeaa8a97a51d793ba4df5beb3f7f1ca25"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): packages/create-agent-harness/src/repo-scorecard.ts:265 \u00B7 packages/create-agent-harness/src/score.ts:436 \u2014 the two spans are one implementation copied and then locally edited \u2014 128 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/create-agent-harness/src/repo-scorecard.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"4171f8992e07b7695c4e74235a594b8bd9baddbfde1e522c018f1d2bc67f2810"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): packages/create-agent-harness/src/subcommands.ts:318 \u00B7 packages/create-agent-harness/src/subcommands.ts:328 \u00B7 packages/create-agent-harness/src/subcommands.ts:338 \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/create-agent-harness/src/subcommands.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac05c331c66082c86fdded265f64e7d071294ce9e824df918132b93bdf87dbb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/darwin-mode/src/mutator.ts:60 \u00B7 packages/darwin-mode/src/numeric-mutator.ts:12 \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/darwin-mode/src/mutator.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf672901ba59ef5c80d64a8a42ca9c4ab62f31be4ff355c5e923cbef04e71820"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/darwin-mode/src/security/evolve.ts:134 \u00B7 packages/darwin-mode/src/security/real-evolve.ts:204 \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/darwin-mode/src/security/evolve.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9ab6adbae2a815896e231e0e974d00739d5c308e685d6450931d915e54a442"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/darwin-mode/src/security/real-evolve.ts:180 \u00B7 packages/projects/src/discovery-evolve.ts:237 \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/darwin-mode/src/security/real-evolve.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"647a30cd3d37b8653f9d41e5758a58ad54e96bbd2beb522164212b91adc8cc8e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5 locations): packages/evals-extract/src/genome.ts:138 \u00B7 packages/evals-hle/src/genome.ts:136 \u00B7 packages/evals-math/src/genome.ts:141 \u00B7 packages/evals-sql/src/genome.ts:146 \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/evals-extract/src/genome.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea31a25815edc2c8ce5b9782312d147ef279558601cbc5051578173bc43a811"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5 locations): packages/evals-extract/src/verifier.ts:30 \u00B7 packages/evals-hle/src/verifier.ts:29 \u00B7 packages/evals-math/src/verifier.ts:31 \u00B7 packages/evals-sql/src/verifier.ts:31 \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/evals-extract/src/verifier.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d838324a7150b2e4178e984198345e9a679d58b2bac5a16dcea6e23bb6c6eac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/horizon/scripts/build-wasm.mjs:7 \u00B7 packages/oo-agents/scripts/build-wasm.mjs: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/horizon/scripts/build-wasm.mjs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ec9f1ba230b20a9f512185b505e160ffe39d77b0e456e33ec84ee416f078a7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): scripts/build-ordered.mjs:89 \u00B7 scripts/dev-toolkit.mjs:188 \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":"scripts/build-ordered.mjs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"a088a6022b5a49845ac8322613e9652b9083cd606720261a7ee5a6ea83e77245"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): scripts/check-runner-coverage.mjs:86 \u00B7 scripts/check-runner-coverage.mjs:110 \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":"scripts/check-runner-coverage.mjs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"11466f7f8fcb8cd64b36ecea0483e5103e31b18b2a288e3cb31020e663bb44ce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/release-notes.mjs:190 \u00B7 scripts/release-notes.mjs:203 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release-notes.mjs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bfb5109c58cf3b107050a9b94e2b3119971539ef000405c48870b413926867b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): apps/web-ui/src/generator/embeddings.ts:72 \u00B7 packages/create-agent-harness/src/analyze-repo.ts:299 \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":"apps/web-ui/src/generator/embeddings.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"951534fd81bf10c7189bebfe11452ca66c7f3d18d6b20f650f9fbbadf5ddbc3a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): examples-packages/devops/bin/scaffold.mjs:18 \u00B7 examples-packages/openclaw/bin/scaffold.mjs:8 \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":"examples-packages/devops/bin/scaffold.mjs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"52711cef80dd5a1c21ae378565478dea4a95d0333d9e0d839a1ba4f048f6b646"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): experiments/signal-flywheel/config.mjs:43 \u00B7 packages/jujutsu/src/embed.ts:48 \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":"experiments/signal-flywheel/config.mjs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d515bda8958626737b8385922be972f59ed441f77053a92c01d6e21398c24b3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/arc-agi-3-chatgpt/src/official-factory.ts:274 \u00B7 packages/kernel-js/src/session.ts:85 \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/arc-agi-3-chatgpt/src/official-factory.ts"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"a686bba41611ae2e3229a13a899b94c183dee428a5d743d014d6e94190c8749c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/arc-agi-3-chatgpt/src/store.ts:977 \u00B7 packages/arc-agi-3-chatgpt/src/store.ts:1120 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3-chatgpt/src/store.ts"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e5182100a0c127f2b171429515a98982eb10e284d2dd37896043bc5b44309e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/arc-agi-3/src/avo-loop.ts:99 \u00B7 packages/arc-agi-3/src/plan-archive.ts:288 \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/arc-agi-3/src/avo-loop.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d8842a314913e47f49a53c9c269f6c47c55bff158db9156788c05792ae24f9d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/arc-agi-3/src/receipts.ts:101 \u00B7 packages/arc-agi-3/src/receipts.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/arc-agi-3/src/receipts.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de38f0c0337837483b2f26f56fbff0ca944c24b1dc1dde496244e73b856c4f4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): packages/create-agent-harness/assets/generated-mcp.mjs:61 \u00B7 packages/redblue/src/cli/index.ts:543 \u00B7 packages/weight-eft/src/cli.ts:202 \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/create-agent-harness/assets/generated-mcp.mjs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e55eb269a4998c9315ae51990344d0b45cfadd9895cc806f42a85f5056e89a9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/create-agent-harness/src/meta-proxy-service.ts:639 \u00B7 packages/create-agent-harness/src/meta-proxy-service.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/create-agent-harness/src/meta-proxy-service.ts"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"503ec85e2a42547c31eac8f03d90a21f87d77df7c7e046a98139c76e0f587f52"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/create-agent-harness/src/plugin-init-cmd.ts:90 \u00B7 packages/create-agent-harness/src/upgrade-cmd.ts:60 \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/create-agent-harness/src/plugin-init-cmd.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb24fe7ec2f02e1cef2ad97605d112f7af3bfc57d3e91bcc06f8e045f13f68f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/create-agent-harness/src/subcommands.ts:72 \u00B7 packages/create-agent-harness/src/subcommands.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/create-agent-harness/src/subcommands.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac800dab03695c3df56eed46427838b285d4dc9f3ee81e393ff1a81800f7060"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/darwin-mode/src/security/fuzz-oracle.ts:19 \u00B7 packages/darwin-mode/src/security/semgrep-oracle.ts:63 \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/darwin-mode/src/security/fuzz-oracle.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b180cd6c3a402098b747945f9dc68ca762969b6522d5f26abbcba714292ece"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5 locations): packages/evals-extract/src/genome.ts:126 \u00B7 packages/evals-hle/src/genome.ts:124 \u00B7 packages/evals-math/src/genome.ts:129 \u00B7 packages/evals-sql/src/genome.ts:134 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 5 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 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/evals-extract/src/genome.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9a899a24c5976b2850f5dac3b9f5d3ff5eb4022e2a821f4b92ba70525e94c93"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): packages/evals-extract/src/normalizer.ts:73 \u00B7 packages/evals-extract/src/normalizer.ts:121 \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/evals-extract/src/normalizer.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ecf26268a519ea40241abcf96e41d33595bb6c50ac065d69756adb98ea98fc2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): packages/field-memory/src/field-memory.ts:462 \u00B7 packages/field-memory/src/field-memory.ts:483 \u00B7 packages/field-memory/src/field-memory.ts:525 \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/field-memory/src/field-memory.ts"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc721cdf2070c0a51d3c0e1e697966f45f281119168f66f4a7d809ab88f7c30"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): packages/field-memory/src/util.ts:137 \u00B7 packages/projects/src/core.ts:99 \u2014 the two spans are one implementation copied and then locally edited \u2014 81 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/field-memory/src/util.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"e09542d40c4b752ed3f0889b3db6e49538244be1ad9c73ae42fec01cd6988673"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): packages/flywheel/src/production-run.ts:75 \u00B7 packages/flywheel/src/run.ts:136 \u2014 the two spans are one implementation copied and then locally edited \u2014 82 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/flywheel/src/production-run.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa806eb82e82b70f8b8b2943dc91c22a020ff6015270bcd1a2b4cddb6b2430e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): scripts/nightly-sota-review.mjs:320 \u00B7 scripts/nightly-sota-review.mjs:396 \u2014 the two spans are one implementation copied and then locally edited \u2014 117 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":"scripts/nightly-sota-review.mjs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f2f85af703a84cac17fa765e7e957f6c340636b4f3772d82e699ac43804c3d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/sbom.mjs:128 \u00B7 scripts/sbom.mjs:144 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/sbom.mjs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec922f0039fda63a1982b3df3f3785479f3edf254af8571edca4d69f6fa6332e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): services/apicompletions/src/midstream/inflight.ts:234 \u00B7 services/apicompletions/src/routes/chatCompletions.ts:359 \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":"services/apicompletions/src/midstream/inflight.ts"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef1cae5713046448dd9b345413a35919b04bd11fb8c7641032718b977517c84c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): apps/web-ui/src/generator/verify.ts:33 \u00B7 apps/web-ui/src/generator/verify.ts:51 \u2014 the two spans are one implementation copied and then locally edited \u2014 55 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":"apps/web-ui/src/generator/verify.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1f8614866c0b2fea2ea8cd20e5ea07c2023d95b695da06ddc3fb6e5f9e628db"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): packages/arc-agi-3-chatgpt/src/official-factory.ts:969 \u00B7 packages/arc-agi-3-chatgpt/src/official-factory.ts:978 \u2014 the two spans are one implementation copied and then locally edited \u2014 52 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/arc-agi-3-chatgpt/src/official-factory.ts"},"region":{"startLine":969}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f712f598078af54db7511a4e298097ba43dd4a30cd8257a89e91180a33d24c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): packages/arc-agi-3-chatgpt/src/official-factory.ts:284 \u00B7 packages/kernel-js/src/session.ts:57 \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/arc-agi-3-chatgpt/src/official-factory.ts"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df9a9b87579e961fb328b80f4a131eea9d1b0cfc090daf71bae0aa2b6386437"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/arc-agi-3/src/belief-graph.ts:68 \u00B7 packages/arc-agi-3/src/receipts.ts:186 \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/arc-agi-3/src/belief-graph.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d0c8ab39327611bf289df11d4321018dfb8d22b2e5d402c68e76e3e2915949"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/arc-agi-3/src/checkpoint.ts:1054 \u00B7 packages/arc-agi-3/src/checkpoint.ts:1077 \u2014 both copies are in the same file, so extract the block 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/arc-agi-3/src/checkpoint.ts"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f6606332517002f027a9c059d2c5b68c397c6edc3ae77953dfc6b69f01c79f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): packages/arc-agi-3/src/checkpoint.ts:231 \u00B7 packages/arc-agi-3/src/memory.ts:141 \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/arc-agi-3/src/checkpoint.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"4018d7e21618c18c82660f0b9aed961cf85f43493792cbf958a7f7966379f746"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/create-agent-harness/src/analyze-repo.ts:294 \u00B7 packages/jujutsu/src/bridge/adapters/mock-providers.ts: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/create-agent-harness/src/analyze-repo.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"c87c1cb96710221426884b620e2517c47b94048af81c633aff75328fef58f725"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): packages/create-agent-harness/src/compare-cmd.ts:213 \u00B7 packages/create-agent-harness/src/score.ts:480 \u00B7 packages/create-agent-harness/src/threat-model.ts:263 \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/create-agent-harness/src/compare-cmd.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e6b880d9a7940a599b048c5cf51cb9a7cc67f32fcdebae66e5dd88a285346d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/create-agent-harness/src/diag.ts:163 \u00B7 packages/create-agent-harness/src/index.ts:42 \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/create-agent-harness/src/diag.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe3c6d8c5a8427d204a4f3909d5af8a830759f6bb02a09af9563e25d091ffbd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/create-agent-harness/src/meta-proxy-service.ts:658 \u00B7 packages/create-agent-harness/src/meta-proxy-service.ts:679 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/meta-proxy-service.ts"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f25a2515f416dc757dfe0163d97b977395380f721777c623e9655c9ae3334b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/create-agent-harness/src/repo-scorecard.ts:193 \u00B7 packages/create-agent-harness/src/repo-scorecard.ts:215 \u2014 both copies are in the same file, so extract the block 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/create-agent-harness/src/repo-scorecard.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"a93232e9efc6f9511f3bcd47adef474e814f4cd2b590c514947a19c7a0e3541d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/create-agent-harness/src/sbom-cmd.ts:87 \u00B7 packages/create-agent-harness/src/upgrade-cmd.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/create-agent-harness/src/sbom-cmd.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"f25f541a2a1ae87e05c13b000117230cec81e0848cf7211af35cc4ea7f2dca05"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): packages/create-agent-harness/src/tarball.ts:49 \u00B7 packages/create-agent-harness/src/walker.ts:56 \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/create-agent-harness/src/tarball.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a346e27e69f62daf87cced18e811098087e6ddf94915285e57a19ae4a5e839"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/create-agent-harness/src/wizard.ts:90 \u00B7 packages/create-agent-harness/src/wizard.ts:116 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/wizard.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"b718e1eb144046f7f800789d88316ee6da75c5c1f0a80f31a0d07d686b1fb064"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): packages/darwin-mode/src/security/codeql-oracle.ts:32 \u00B7 packages/darwin-mode/src/security/fuzz-oracle.ts:19 \u00B7 packages/darwin-mode/src/security/semgrep-oracle.ts:66 \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/darwin-mode/src/security/codeql-oracle.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc449c95b08d37e839fabbf763e22edb9bde86e283d9bbc3d17fa184d3f9f30"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6 locations): packages/evals-extract/src/gate.ts:38 \u00B7 packages/evals-hle/src/gate.ts:41 \u00B7 packages/evals-math/src/gate.ts:42 \u00B7 packages/evals-servedmodel/src/gate.ts:25 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 copies are spread across 6 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/evals-extract/src/gate.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb6b7e2d6c8c2b2e4427c6ecd46f93fbaf0cb90717e353769a89fed810e6e47"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5 locations): packages/evals-extract/src/verifier.ts:55 \u00B7 packages/evals-hle/src/verifier.ts:54 \u00B7 packages/evals-math/src/verifier.ts:56 \u00B7 packages/evals-sql/src/verifier.ts:56 \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/evals-extract/src/verifier.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f117a72254e74d457930c35d2bd127159a4c0c0724ff825dac116c250a2b771"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/evals-toolcall/src/normalizer.ts:147 \u00B7 packages/evals-toolcall/src/normalizer.ts:158 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/evals-toolcall/src/normalizer.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e0e9e835c5e9b1be8f9d72a504eaf2a7bbe63a27aea435b287f5701efbab930"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): packages/evals-toolcall/src/normalizer.ts:173 \u00B7 packages/projects/src/core.ts:99 \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/evals-toolcall/src/normalizer.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ae624e17920755e8842e6165e4ae9b3d7aa3ab906a652c1818084c67f47ae0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): packages/evals-toolcall/src/normalizer.ts:173 \u00B7 packages/turn-credit/src/receipt.ts:13 \u2014 the two spans are one implementation copied and then locally edited \u2014 90 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/evals-toolcall/src/normalizer.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"965e251f41b1d425996e9e613a90f9a67643a2e4e976f0f506ce614c40331a33"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): packages/projects/src/core.ts:99 \u00B7 packages/turn-credit/src/receipt.ts:13 \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/projects/src/core.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a74d8c26e4656314480eb92e00239bc53af7f72baa149ca387e251179328f3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/redblue/src/integrations/hackerone.ts:484 \u00B7 packages/redblue/src/integrations/hackerone.ts:667 \u2014 both copies are in the same file, so extract the block 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/redblue/src/integrations/hackerone.ts"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aba4eb316856414b4bd8ed474ae62483a8a1bb636910841eb4f5bac5daf67d2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/redblue/src/integrations/hackerone.ts:792 \u00B7 packages/redblue/src/integrations/hackerone.ts:871 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/redblue/src/integrations/hackerone.ts"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ce9225c3b3fe539f93978020dbe99a56b502bcf310937aab1e946e12e0fc9f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/redblue/src/judges/judge.ts:54 \u00B7 packages/redblue/src/judges/judge.ts:89 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/redblue/src/judges/judge.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c9201db9a8fa7526da8417d7575a0764c22754e4a425d66dab3b7b2b334a8fd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/turn-credit/src/cli.ts:39 \u00B7 packages/weight-eft/src/cli.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/turn-credit/src/cli.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"c960a0aa84f6fe8b4d75e2b2046fea3740c2676f74faf643ddf06efde64a26d7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/gcp-cluster.mjs:79 \u00B7 scripts/tbench-gcp.mjs:66 \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/gcp-cluster.mjs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"88cfdc543800e3368e2118de2ed410428678904057cf8da3cfd2afa9dbf5a48f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): scripts/release.mjs:29 \u00B7 scripts/version-bump.mjs:25 \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":"scripts/release.mjs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c47295779533721ab429da462f9d1ffa9f1cf0c70abfad84d5bf3e5fd414df4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/arc-agi-3-chatgpt/src/policy.ts:42 \u00B7 packages/arc-agi-3-chatgpt/src/server.ts:364 \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/arc-agi-3-chatgpt/src/policy.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb09549288145269caa69d544e815913352c2090827dc81ed1e49e61a3ff0fff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/arc-agi-3-chatgpt/src/store.ts:185 \u00B7 packages/avo/src/flywheelGate.ts:29 \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/arc-agi-3-chatgpt/src/store.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0db966f9771b32ae218db4aeb40c30730c44915445ed8cc0bb244681870381"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/arc-agi-3-chatgpt/src/store.ts:185 \u00B7 packages/field-memory/src/util.ts:137 \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/arc-agi-3-chatgpt/src/store.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3cb59d1b0ce81bc221728c5e7f9ee3d5e095ba1ffc1f568decfeff2b7b9f5f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/arc-agi-3/src/avo-loop.ts:390 \u00B7 packages/arc-agi-3/src/avo-loop.ts:473 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3/src/avo-loop.ts"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5518fe0c46d919b5259ac82f351e751631472ad34bf56f5c4f92b06d6a021f3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/arc-agi-3/src/belief-graph.ts:416 \u00B7 packages/darwin-mode/src/clade.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/arc-agi-3/src/belief-graph.ts"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a6c83e28c897d0d1c20b8904edd20bb66f858c51e8aff6180dd698400919cb3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/arc-agi-3/src/canonical.ts:197 \u00B7 packages/arc-agi-3/src/checkpoint.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/arc-agi-3/src/canonical.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"49aefe48ee6efe4490c9a6576ebb73c436bb5f0e0d592524758ad98453691e7b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): packages/arc-agi-3/src/canonical.ts:495 \u00B7 packages/arc-agi-3/src/canonical.ts:701 \u00B7 packages/arc-agi-3/src/canonical.ts:803 \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/arc-agi-3/src/canonical.ts"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"861bee25080664a222718bd07559516410bedb2ace0c3adc01a8edce46c67d63"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/arc-agi-3/src/checkpoint.ts:655 \u00B7 packages/arc-agi-3/src/supervisor.ts:303 \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/arc-agi-3/src/checkpoint.ts"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb953eec521afb468771a7f9716a65015cf9f83c54bb74064d8c0f2d65f9adf7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/arc-agi-3/src/checkpoint.ts:291 \u00B7 packages/avo/src/operator.ts:258 \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/arc-agi-3/src/checkpoint.ts"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bdd9d0ffef4b15143fa5eb3b695649e8f6e913fc9c82c622bbf75a7dadf6dd0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/arc-agi-3/src/controller.ts:1201 \u00B7 packages/arc-agi-3/src/supervisor.ts:206 \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/arc-agi-3/src/controller.ts"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb09a0d60d2143cf28d7e8225a1d324c091c377aa0df27f43c73ab6ab809e791"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/arc-agi-3/src/receipts.ts:143 \u00B7 packages/arc-agi-3/src/receipts.ts:527 \u2014 both copies are in the same file, so extract the block 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/arc-agi-3/src/receipts.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"e455e202ae186e23de615639337b38edc5756de1f52113d7f08d4c366c09f5fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/avo/src/flywheelGate.ts:29 \u00B7 packages/evals-toolcall/src/normalizer.ts:173 \u2014 the two spans are one implementation copied and then locally edited \u2014 88 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/avo/src/flywheelGate.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"7263102f520691cb33a1fbd22eedf40517ab8a3afb312cdc9ece72ed29a0bfa4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/avo/src/flywheelGate.ts:23 \u00B7 packages/flywheel/src/receipts.ts:10 \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/avo/src/flywheelGate.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"087f78347bb8f4cd5e964fa7bf46e1686adc9fac1dc3514d2e8071a9185d010b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/avo/src/flywheelGate.ts:29 \u00B7 packages/projects/src/core.ts:99 \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/avo/src/flywheelGate.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"92570988f55909d338170ad80a0a31da06b3d816c167cf37c57ed72cd24156aa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/avo/src/memory.ts:103 \u00B7 packages/avo/src/memory.ts:196 \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/avo/src/memory.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a79939eb2ed1c1a92f6576566241fe0d1f9f6998b2e68c5a4e32abd665fe94"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/avo/src/operator.ts:247 \u00B7 packages/flywheel/src/review-context.ts:143 \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/avo/src/operator.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6cae233b776b570e85226ee0fe85dcf44442667473dbf0c891b7d3505f49f42"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/create-agent-harness/scripts/gen-templates.mjs:16 \u00B7 scripts/install-all.mjs:41 \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/create-agent-harness/scripts/gen-templates.mjs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ecdc2616270656d11e5ea44dd7c9c99b3e2e1ba73848f9c3b07f1bb589874f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/create-agent-harness/src/eject.ts:54 \u00B7 packages/create-agent-harness/src/walker.ts: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/create-agent-harness/src/eject.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d327cd33775d9068629a2637540189d160a954db2606161dfdce31e2f902775"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/create-agent-harness/src/oia-manifest.ts:209 \u00B7 packages/create-agent-harness/src/oia-manifest.ts:215 \u2014 both copies are in the same file, so extract the block 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/create-agent-harness/src/oia-manifest.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a2b91a873b72629b499f08e81e78dd1f1ebfbd456f0c86b7c03d5c5f89fefe5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): packages/create-agent-harness/src/repo-scorecard.ts:52 \u00B7 packages/create-agent-harness/src/repo-scorecard.ts:191 \u00B7 packages/create-agent-harness/src/repo-scorecard.ts:213 \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/create-agent-harness/src/repo-scorecard.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e8fb17ab167e96b56fd69f5553f89ade992bca5d931b7cae80d90e0da15c692"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/create-agent-harness/src/subcommands.ts:42 \u00B7 packages/create-agent-harness/src/subcommands.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/create-agent-harness/src/subcommands.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"319f17dd573f2c7deaab0e8062328eba57942e216a84f00de6593a2458f2919b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): packages/evals-hle/src/normalizer.ts:70 \u00B7 packages/evals-math/src/normalizer.ts:95 \u00B7 packages/evals-sql/src/normalizer.ts:57 \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/evals-hle/src/normalizer.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5013fa844e089fcc712b3b894b60ed1c13c4ee97656c5cecb72448d8077d4b1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/evals-toolcall/src/evaluator.ts:120 \u00B7 packages/evals-toolcall/src/verifier.ts:69 \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/evals-toolcall/src/evaluator.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"1598ecd0ea4a6b959392147b8fad8743af7209fff12b5245c4378f9c007ff08e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/evals-toolcall/src/normalizer.ts:118 \u00B7 packages/redblue/src/integrations/hackerone.ts:74 \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/evals-toolcall/src/normalizer.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc90a0eb9ff3679aa2ca9fbba3aa5e9cf35e620eaec66b7f480de10d43a7082"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/field-memory/src/field-memory.ts:272 \u00B7 packages/field-memory/src/field-memory.ts:278 \u2014 both copies are in the same file, so extract the block 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/field-memory/src/field-memory.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ff1143e621ce42b412040671446209d7e3ec1ae26fc546943f4251f59d39eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/flywheel/src/cli.ts:46 \u00B7 packages/redblue/src/cli/index.ts:127 \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/flywheel/src/cli.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ee5d8950b597d97ef6ea25f4378e51b6adf56b4f21b88162d43c488a8040d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/flywheel/src/receipts.ts:10 \u00B7 packages/turn-credit/src/receipt.ts:8 \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/flywheel/src/receipts.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ffc5375db19caa6c4a2789fa1a3298f0777eed59f86cae686a1624e0d7035a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/host-claude-code/src/index.ts:105 \u00B7 packages/host-copilot/src/index.ts:127 \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/host-claude-code/src/index.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9cdbba56fe6ae49c01575f50e00368a696cfd1985384764f86dffe341375e9a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/host-claude-code/src/index.ts:137 \u00B7 packages/host-hermes/src/index.ts:62 \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/host-claude-code/src/index.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"07c81955fa2c7c31ce2694dab13d80c9b50d9ead759b24b1160e9b0f32371b81"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/host-github-actions/src/index.ts:96 \u00B7 packages/host-github-actions/src/index.ts:232 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 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/host-github-actions/src/index.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6ecf1a789600d4533eaf1242a24d9a042b9a8e2eb94e2493b25bfb2cd38ce1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/kernel-js/src/session.ts:57 \u00B7 packages/projects/src/core.ts:99 \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/kernel-js/src/session.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2d5fadc3994522d3b4b43f7fdbb883fd6a0b25fb21249cc958e302a79d92ff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/redblue/src/integrations/h1-submit.ts:241 \u00B7 packages/redblue/src/reports/hackerone.ts:182 \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/redblue/src/integrations/h1-submit.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"69610225898947747c41a36a44d6c569706a9fdd1263d0cc033326558415aa34"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/weight-eft/src/reward-hack.ts:178 \u00B7 packages/weight-eft/src/reward-hack.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/weight-eft/src/reward-hack.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5654a4dbcf8f1c8a9164004d2f2faf2bc725403bae1bac9c84b4590376466b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/workspace-lens/src/linalg.ts:27 \u00B7 packages/workspace-lens/src/linalg.ts:69 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/workspace-lens/src/linalg.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2e28e4efb431301e8c47319bacbe4976eff61a55fce9b354e3087cdbf53b5e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): scripts/healthcheck.mjs:202 \u00B7 scripts/healthcheck.mjs:220 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/healthcheck.mjs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"b63ab8dcbef3f7612ad696321d894cc2b62264adad8513d20df4ccc27fff8c28"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): scripts/healthcheck.mjs:25 \u00B7 scripts/marketplace-entry.mjs:20 \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":"scripts/healthcheck.mjs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"884ba42bfb82d38e5d35c5195d280debad83fdcf4d5a982a8fcef195a5028939"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): scripts/nightly-sota-review.mjs:72 \u00B7 scripts/sota-attest.mjs:37 \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":"scripts/nightly-sota-review.mjs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f936ec20cdb85c4520487e7a724c9cf223ee21589fe81a6ffc28470dd7b2348"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): scripts/release.mjs:60 \u00B7 scripts/validate-gcp-secrets.mjs:82 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release.mjs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"a00003a3bf97f966864657bad6ea16898e1942d278ffa408f683c9057e76d2b3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): apps/web-ui/src/generator/scaffold.ts:40 \u00B7 apps/web-ui/src/generator/scaffold.ts:47 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web-ui/src/generator/scaffold.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"f090704e6d70cf46509b659c233f856c1d96b236916db1e4c440833c3dae17d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/arc-agi-3-chatgpt/src/store.ts:470 \u00B7 packages/arc-agi-3-chatgpt/src/store.ts:507 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3-chatgpt/src/store.ts"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"90192fe5ac2e05eaa25246e0dc7c51f535e2726f639bfc95f2675f4a505cfc70"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/arc-agi-3/src/avo-loop.ts:830 \u00B7 packages/arc-agi-3/src/controller.ts:1494 \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/arc-agi-3/src/avo-loop.ts"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a5673d67c111e29374f0c9f37c4d4c91fec077e48da7c31904b08fef8befa1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/arc-agi-3/src/python-bridge.ts:150 \u00B7 packages/field-memory/src/field-memory.ts:359 \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/arc-agi-3/src/python-bridge.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30a6cda214ecb5f8509214221a6867c5f86211f407de4043ae7377f7f003187"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/avo/src/claim-gate.ts:555 \u00B7 packages/avo/src/claim-gate.ts:565 \u2014 both copies are in the same file, so extract the block 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/avo/src/claim-gate.ts"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ced1e4d208d2d6b308f5c528ace340760e4bc246ced8b710085e739d6294d08"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): packages/avo/src/claim-gate.ts:296 \u00B7 packages/avo/src/claim-gate.ts:335 \u2014 the two spans are one implementation copied and then locally edited \u2014 54 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/avo/src/claim-gate.ts"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee0393c6e2b43a1059cb0a2162258fc3eedd32776880979e2083204304146a0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/create-agent-harness/src/audit-cmd.ts:22 \u00B7 scripts/audit-deps.mjs:39 \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/create-agent-harness/src/audit-cmd.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a28a92da46310290226633aecd80225b56dc6552f7aecbc6bf99d4d1afe026"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): packages/create-agent-harness/src/export-config.ts:120 \u00B7 packages/create-agent-harness/src/sbom-cmd.ts:87 \u00B7 packages/create-agent-harness/src/upgrade-cmd.ts:39 \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/create-agent-harness/src/export-config.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"859aa81500c22cb25f3e095cd126390d800e1e44d39dd0e68ce460c0c5839de2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): packages/create-agent-harness/src/genome.ts:246 \u00B7 packages/create-agent-harness/src/score.ts:474 \u00B7 packages/create-agent-harness/src/threat-model.ts:257 \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/create-agent-harness/src/genome.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"9971702d5ee762f1e70968ebc6bf3693e903fef572fe41ac363b9f9a76f4e506"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/create-agent-harness/src/meta-proxy-service.ts:223 \u00B7 packages/create-agent-harness/src/meta-proxy-service.ts:249 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/meta-proxy-service.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"befed77d3415cc677384c5c6214cbd47dd043249996e9638e9fecb91a1d88883"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): packages/create-agent-harness/src/publish-cmd.ts:22 \u00B7 packages/create-agent-harness/src/sbom-cmd.ts:90 \u00B7 packages/create-agent-harness/src/upgrade-cmd.ts:45 \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/create-agent-harness/src/publish-cmd.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef412db42080980cf02b971e690a53051e6f4456c46472ad105955735ebb670"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/darwin-mode/src/clade.ts:36 \u00B7 packages/darwin-mode/src/numeric-mutator.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/darwin-mode/src/clade.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"190a9f9810f74eaf0bdee0409411f303261a587910080659a91847d3ea2f4734"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): packages/darwin-mode/src/contrastive/engine.ts:141 \u00B7 packages/darwin-mode/src/contrastive/engine.ts:152 \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/darwin-mode/src/contrastive/engine.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a6e5b81d17505017ceb61f26a8c6162f0c083cee606cbb84a066bc4be91ba2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/darwin-mode/src/fann-surrogate.ts:198 \u00B7 packages/darwin-mode/src/numeric-surrogate.ts:126 \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/darwin-mode/src/fann-surrogate.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"183413ca9d0ac090ef9c81e4dd5da2f4229005717086b20fb91b60db7d259cf8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): packages/darwin-mode/src/security/evolve.ts:104 \u00B7 packages/darwin-mode/src/security/real-evolve.ts:183 \u00B7 packages/projects/src/discovery-evolve.ts:240 \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/darwin-mode/src/security/evolve.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7cc35ea4a0fc4e61fe5d0b327cfebd99c7821d96e062715abad19b60bf71dc8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/darwin-mode/src/security/real-evolve.ts:90 \u00B7 packages/darwin-mode/src/security/real-loop.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/darwin-mode/src/security/real-evolve.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea53c4bb90e98acd15042a97da20776bd7356703fc03d2fa72a809ce4040f96"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5 locations): packages/evals-extract/src/genome.ts:21 \u00B7 packages/evals-hle/src/genome.ts:19 \u00B7 packages/evals-math/src/genome.ts:22 \u00B7 packages/evals-servedmodel/src/genome.ts:10 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 5 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/evals-extract/src/genome.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d88ef16248077ebf338f2467fcb980e16d0441171fadd6db1b56c47da16fc2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5 locations): packages/evals-extract/src/score.ts:85 \u00B7 packages/evals-hle/src/score.ts:85 \u00B7 packages/evals-math/src/score.ts:85 \u00B7 packages/evals-sql/src/score.ts:85 \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/evals-extract/src/score.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c987615f3e5551ffaa67241bd7bcda94d966e57283e075760260f99136488a9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/evals-math/src/normalizer.ts:110 \u00B7 packages/evals-math/src/verifier.ts:97 \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/evals-math/src/normalizer.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd06b2aac3cbc2e66df6b710989856ac252a43a1b871176193e59a47ce9a9cd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/evals-toolcall/src/evaluator.ts:132 \u00B7 packages/evals-toolcall/src/verifier.ts:137 \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/evals-toolcall/src/evaluator.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa2a687f08c144aa148353986d04bf73cada9738f9df973719a5d1b49803d545"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): packages/flywheel/src/replay.ts:164 \u00B7 packages/flywheel/src/replay.ts:227 \u2014 the two spans are one implementation copied and then locally edited \u2014 54 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/flywheel/src/replay.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c8d2fc697485d03884c2fb3cbe58eb380835268910618c742258b5850bef67"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/flywheel/src/validate-bundle.ts:52 \u00B7 packages/flywheel/src/validate-bundle.ts:80 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flywheel/src/validate-bundle.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"423821cd32463eab911e1f38ff4e00517690ab9e854b5b8ec0ff4189d02b7b41"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): packages/host-claude-code/src/index.ts:137 \u00B7 packages/host-openclaw/src/index.ts:93 \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/host-claude-code/src/index.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"8341c7eeda9c844ae293d44aec50cf9c7b44fc3a91907125309d70db4f117bcb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/host-codex/src/index.ts:33 \u00B7 packages/host-copilot/src/index.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/host-codex/src/index.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b3db65360c048a0ce8478d84ae58e5c41ecec12fe42218566186806e6d35be"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/projects/src/handoffs.ts:183 \u00B7 packages/projects/src/handoffs.ts:205 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/projects/src/handoffs.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b1b8c769c01358b8ca702b2872aa3784ad4579138398b4cfb6eb4aae436126"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/sota-attest.mjs:441 \u00B7 scripts/sota-attest.mjs:448 \u2014 both copies are in the same file, so extract the block 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/sota-attest.mjs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"397ac119bd9a358bd5860e5a8b6caa948b4e34e5436e8d1d531cbe8ca141aac6"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/cli-flags-completions.test.ts:4 reaches past another workspace package\u0027s public entry into its internals with a relative path (../packages/create-agent-harness/src/subcommands.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/cli-flags-completions.test.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"149d42d072adf309c36bdb27aea554d0c1a1c45dd2cfe91b098d23bc7f984baf"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/dream-explicit-new.test.ts:2 reaches past another workspace package\u0027s public entry into its internals with a relative path (../packages/create-agent-harness/src/index.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/dream-explicit-new.test.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bbf7377bffdc58492001f5217cadb62992918f9fa843e5ccf267dd721f18061"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/dream-explicit-new.test.ts:13 reaches past another workspace package\u0027s public entry into its internals with a relative path (../packages/create-agent-harness/src/index.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/dream-explicit-new.test.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb02c3e74a401d192e08491a4d16f9633b096714f3cd11b5ca3411703e2aa7b0"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/dream-explicit-new.test.ts:14 reaches past another workspace package\u0027s public entry into its internals with a relative path (../packages/create-agent-harness/src/upgrade-cmd.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/dream-explicit-new.test.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c51b419f5513ce424ad39ad2798f4e88a31fb5be2415ba6d0722eada98f336c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/dream-explicit-new.test.ts:30 reaches past another workspace package\u0027s public entry into its internals with a relative path (../packages/create-agent-harness/src/index.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/dream-explicit-new.test.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"223b11b27a732168a6f2bc9aad47edc2276e63587eac050d50499a95b276723e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/e2e-lifecycle.test.ts:34 reaches past another workspace package\u0027s public entry into its internals with a relative path (../packages/create-agent-harness/src/index.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/e2e-lifecycle.test.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"74051c08f37d1103ebf0adac2bb49d89f4f6463782d0f98cd7729fee2429c5f8"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/e2e-lifecycle.test.ts:35 reaches past another workspace package\u0027s public entry into its internals with a relative path (../packages/create-agent-harness/src/subcommands.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/e2e-lifecycle.test.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"2595b0fc22af2a0f467a665df35d720841ba149adeab82c8b50ba0670b4fdfd7"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/e2e-lifecycle.test.ts:36 reaches past another workspace package\u0027s public entry into its internals with a relative path (../packages/create-agent-harness/src/validate.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/e2e-lifecycle.test.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"48014e6ac63a0556f5fa898995a5baa23fe98ae0eabbe8494c967833fcf496dd"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/e2e-lifecycle.test.ts:37 reaches past another workspace package\u0027s public entry into its internals with a relative path (../packages/create-agent-harness/src/mcp-cmd.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/e2e-lifecycle.test.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"a97be9f41e552e0dfc17d51c6a7ca166e2943040704d992dc9448a5ae8414d7a"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/e2e-lifecycle.test.ts:38 reaches past another workspace package\u0027s public entry into its internals with a relative path (../packages/create-agent-harness/src/sbom-cmd.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/e2e-lifecycle.test.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7606df2234bf3c52bbcb41a39eb342c1e00834a7420331e8c0888e1187d5504"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/e2e-lifecycle.test.ts:39 reaches past another workspace package\u0027s public entry into its internals with a relative path (../packages/create-agent-harness/src/audit-cmd.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/e2e-lifecycle.test.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ce06a674a3a65db427cef0812f15c1f2b7dc8cef76702c60b1ea6654d5f6fe"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/e2e-lifecycle.test.ts:40 reaches past another workspace package\u0027s public entry into its internals with a relative path (../packages/create-agent-harness/src/upgrade-cmd.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/e2e-lifecycle.test.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fba5c4b5f6f9851d7b559e51d8de775dc4f6f292f6f1c6144586d7a9a56804e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/e2e-lifecycle.test.ts:41 reaches past another workspace package\u0027s public entry into its internals with a relative path (../packages/create-agent-harness/src/publish-cmd.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/e2e-lifecycle.test.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9256822377e0d8282e62874dc0b33e2474c0408ca6a34c1f0eb55bcb90cbdf6"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/e2e-lifecycle.test.ts:42 reaches past another workspace package\u0027s public entry into its internals with a relative path (../packages/create-agent-harness/src/federate.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/e2e-lifecycle.test.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cec34d194e631d29cdc207f01fe0c0ccc6e2ae1fa37ff9d2bd831c18aa168f8"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/e2e-lifecycle.test.ts:43 reaches past another workspace package\u0027s public entry into its internals with a relative path (../packages/create-agent-harness/src/diag.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/e2e-lifecycle.test.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae98a7c00098b314fe9bd2828660885fcf914b0bd233ecff703f1aa498b3ef83"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/e2e-scaffold-validate.test.ts:19 reaches past another workspace package\u0027s public entry into its internals with a relative path (../packages/create-agent-harness/src/index.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/e2e-scaffold-validate.test.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"148141214d32c4eaed1dc6a05723f1b0615ba27e5b76e6f78cfface65c093589"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/e2e-scaffold-validate.test.ts:20 reaches past another workspace package\u0027s public entry into its internals with a relative path (../packages/create-agent-harness/src/validate.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/e2e-scaffold-validate.test.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dae8d482152058f5060ae7398590faa8b9eeadd62d90fa6e77a505c481893aa"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/e2e-scaffold-validate.test.ts:97 reaches past another workspace package\u0027s public entry into its internals with a relative path (../packages/create-agent-harness/src/validate.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/e2e-scaffold-validate.test.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3879cabfaedd6b9dc709ea48d97539352fa708ee8b26a451ef23bdf059a2e0a"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/harness-sbom-audit.test.ts:7 reaches past another workspace package\u0027s public entry into its internals with a relative path (../packages/create-agent-harness/src/sbom-cmd.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/harness-sbom-audit.test.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7bbf5d3b3a825aec8d8793609d78b407bb1e6e32609183c490b82409bf83d50"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/harness-sbom-audit.test.ts:8 reaches past another workspace package\u0027s public entry into its internals with a relative path (../packages/create-agent-harness/src/audit-cmd.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/harness-sbom-audit.test.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c2e960786bbfaf0463d9491b017f92b560e1e83bc0be9713e78ec64b949f22a"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/mcp-cmd.test.ts:7 reaches past another workspace package\u0027s public entry into its internals with a relative path (../packages/create-agent-harness/src/mcp-cmd.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/mcp-cmd.test.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae11ab515123ed3791bce5cfe7560939d7ac2e964dcc4a1f5668729a7d1e6e3"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/mcp-dispatch-integration.test.ts:15 reaches past another workspace package\u0027s public entry into its internals with a relative path (../packages/kernel-js/src/dispatch.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/mcp-dispatch-integration.test.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c98dcc7c4e612ec082699ac60ef09a41c085a09861f786c0be67ae8c55a1bb7"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/publish-cmd.test.ts:7 reaches past another workspace package\u0027s public entry into its internals with a relative path (../packages/create-agent-harness/src/publish-cmd.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/publish-cmd.test.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"d96f60922328c280e1bfd6d4d596e4f8c1934c332a81d78d074f4fe2d02d0973"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/upgrade-cmd.test.ts:8 reaches past another workspace package\u0027s public entry into its internals with a relative path (../packages/create-agent-harness/src/index.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/upgrade-cmd.test.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e91e61afac6d46c6e65596a4241fdf0d3e9b8835250cab055afeca592fe75fe"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/upgrade-cmd.test.ts:9 reaches past another workspace package\u0027s public entry into its internals with a relative path (../packages/create-agent-harness/src/upgrade-cmd.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/upgrade-cmd.test.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab48deed42367147bd8fe0e5aaee95dcf7251571d7c2c1195d9b63858e82377e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: __tests__/witness-tamper.test.ts:20 reaches past another workspace package\u0027s public entry into its internals with a relative path (../packages/create-agent-harness/src/witness-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":"__tests__/witness-tamper.test.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb56a864e84a159cc7abd24da6188dc4153bcd78c1853ab2be76d3d62c3e819"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: experiments/credit-feedback/assert.mjs:18 reaches into another package with a relative path (../../packages/turn-credit/dist/index.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/credit-feedback/assert.mjs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d7caaeac8d40a546dc751d5fa8d82b5852d7edddd731075b7376c69a8e5052"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: experiments/credit-feedback/lib.mjs:19 reaches into another package with a relative path (../../packages/turn-credit/dist/index.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/credit-feedback/lib.mjs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"7272221d12383614c5e8c481948555b15138b24b0652a9b6b824259e55086fad"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: experiments/router-calibration-loop/lib.mjs:22 reaches into another package with a relative path (../../packages/turn-credit/dist/index.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/router-calibration-loop/lib.mjs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bd978549501630d50a6ed5f0f5e16e993210d601ece42a37a713a08f374310e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: experiments/router-calibration-loop/lib.mjs:28 reaches into another package with a relative path (../../packages/router/dist/index.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/router-calibration-loop/lib.mjs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede45070261b9b0097f3506c83b6fe3c5b785bd34044abd4753551f52eb8fba8"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: experiments/signal-flywheel/config.mjs:19 reaches into another package with a relative path (../../packages/turn-credit/dist/index.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/signal-flywheel/config.mjs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66ddfda581c596e9f24a0c382fc71123b807e719ab0cc5f1981fbe403a93256"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: experiments/signal-flywheel/config.mjs:25 reaches into another package with a relative path (../../packages/darwin-mode/dist/scorer.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/signal-flywheel/config.mjs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"712d1308f16a796d837f7e72455f678bbe4d9cd4e32c1b83d86560bc47830012"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: experiments/signal-flywheel/run.mjs:20 reaches into another package with a relative path (../../packages/flywheel/dist/index.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/signal-flywheel/run.mjs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa561ca27fce9baed33a9678cc082e577b402a98fa5b3772fddf695f5bf4720"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: experiments/signal-flywheel/verify.mjs:21 reaches into another package with a relative path (../../packages/flywheel/dist/index.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/signal-flywheel/verify.mjs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"c768493e9b6d052e75bf8d2b31b4b0221c2a3b530a031a6901efebbf0559f683"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: experiments/turn-credit-acceptance/assert.mjs:12 reaches into another package with a relative path (../../packages/flywheel/dist/receipts.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/turn-credit-acceptance/assert.mjs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd94a8997f15ab6a1baa3a10a381e82475e68ece9611d302b3e73a36f177e68a"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: experiments/turn-credit-acceptance/lib.mjs:18 reaches into another package with a relative path (../../packages/turn-credit/dist/index.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/turn-credit-acceptance/lib.mjs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"088eadc962537bea90463f00265b6d563762976bad35fe90c4a6869adfb2f3db"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: experiments/turn-credit-acceptance/run.mjs:22 reaches into another package with a relative path (../../packages/flywheel/dist/receipts.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/turn-credit-acceptance/run.mjs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1b2b94b8cd55af4b1d6470de364bc7a2e62f964158cae2da93d214d3a5ea89"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: experiments/user-awareness/probe.mjs:35 reaches into another package with a relative path (../../packages/flywheel/dist/index.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/user-awareness/probe.mjs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"317a4921e632301a6f8b40574ac96458e2ef829e967f9fb79876eb667c321120"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/create-agent-harness/__tests__/generated-fitness.test.ts:10 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../darwin-mode/src/repo_profiler.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/__tests__/generated-fitness.test.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"72930da6001f950492edc671db4fb6a8e05dc454f7cbd59f0811bde1760fb799"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/create-agent-harness/__tests__/generated-fitness.test.ts:11 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../darwin-mode/src/generator.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/__tests__/generated-fitness.test.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d260d9c0c9f0b260d7bd4a0596142e37c55f2807be25d6d9f99553eaea646e2"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/create-agent-harness/__tests__/generated-fitness.test.ts:12 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../darwin-mode/src/tier2-sandbox.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/__tests__/generated-fitness.test.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5235a1d6990b532fdedf7d518e36b3f270fb7d8c00bc70c3c5efae91dc28c4"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/create-agent-harness/__tests__/generated-fitness.test.ts:13 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../darwin-mode/src/sandbox.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/__tests__/generated-fitness.test.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e84430d32d73b5119bf0523659d94c291909c39dc079bb14325e6dc4fe1ff2d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/create-agent-harness/__tests__/generated-fitness.test.ts:14 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../darwin-mode/src/scorer.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/__tests__/generated-fitness.test.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b2f2f3ddfd1ccb891e78d1be03c17070fa29a986b4ed6f887183c86928d9132"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: packages/create-agent-harness/__tests__/generated-fitness.test.ts:15 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../darwin-mode/src/contrastive/confirmation.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/__tests__/generated-fitness.test.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dbb0961f78697f824f008b7e011cdacdfd7a9b7b7808b880ea47afc47d29877"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:deep-import]: packages/create-agent-harness/src/diag.ts:128 imports @metaharness/kernel/package.json, which the target package\u0027s package.json \u0060exports\u0060 does not declare \u2014 use a declared entry or declare the subpath."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/diag.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"544f5773d523906f7d5147eba1ff258650de6d53b4f639e3ef4165decc7d709c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: packages/radio/scripts/flywheel-radio.mjs:36 reaches into another package with a relative path (../../flywheel/dist/index.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/radio/scripts/flywheel-radio.mjs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc479b3e5dfe1da17539521dd22e6189129fc9262b5bffb2c50ddb99fd0d5bf4"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: scripts/avo-claim-gate.mjs:8 reaches into another package with a relative path (../packages/avo/dist/index.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/avo-claim-gate.mjs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"0201c27225628d9e137d5ad2d717c6631b0d1004d0ad746fa1d828dc7e8f814e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: scripts/benchmark-arc-avo-long-horizon.mjs:14 reaches into another package with a relative path (../packages/arc-agi-3/dist/index.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/benchmark-arc-avo-long-horizon.mjs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"3abdc44f3c767ef885e0f4820ca35391b97cd97ac1e833e598852fe4bfae9ecd"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: scripts/benchmark-arc-avo-long-horizon.mjs:15 reaches into another package with a relative path (../packages/arc-agi-3-chatgpt/dist/store.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/benchmark-arc-avo-long-horizon.mjs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea977e1586b92e66595bca149401810ed04fb831c7099441dc2f7ed23ba90c9"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: scripts/benchmark-independent-review-context.mjs:4 reaches into another package with a relative path (../packages/flywheel/dist/index.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/benchmark-independent-review-context.mjs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"135a78b7822aaae3f06b53a99eacc7007daf60d3714e549657a2b453f90be17d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: scripts/benchmark-multigeneration-proof.mjs:4 reaches into another package with a relative path (../packages/flywheel/dist/index.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/benchmark-multigeneration-proof.mjs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"9628469489e9a5b6ef6d81681ffdae3429f8b1f4649d5ee9ab8eb41584ad6f5d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: scripts/gcp-cluster.mjs:19 reaches into another package with a relative path (../packages/darwin-mode/bench/swebench/evolve-arch.mjs) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gcp-cluster.mjs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec64edd396321fe5f84b4a4d532fa2df2c811c80b39b37b3a35e3b1e9176035d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyProductionBindings (cyclomatic 96, cognitive 95): verifyProductionBindings has cyclomatic complexity 96 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flywheel/src/production-replay.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f55e1f11fecdc50af553b3d5d23f87aafb187fdac8f729bdb5ec1cfa8541ab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runProductionFlywheel (cyclomatic 93, cognitive 142): runProductionFlywheel has cyclomatic complexity 93 and cognitive complexity 142; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flywheel/src/production-run.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9dc4a6928a7e28bb63ae3cea0bc56895508e9c26b9a4dd33aef9b57ae809626"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateSupervisorState (cyclomatic 93, cognitive 125): validateSupervisorState has cyclomatic complexity 93 and cognitive complexity 125; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3/src/checkpoint.ts"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d1dfcc87b7166b5f693820798ca7fc9f35760775be4a01f215d86e08510a5e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function load (cyclomatic 88, cognitive 78): load has cyclomatic complexity 88 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3/src/plan-archive.ts"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26c6146c0fa43cbcf6be9ede44580cc441496ae6bc17668ac64570ea7133aae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runSim (cyclomatic 82, cognitive 203): runSim has cyclomatic complexity 82 and cognitive complexity 203; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/radio/src/sim.ts"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"593d0a9b4b3d80d578688398ac82ac1941187e9273fc597421123957a7482588"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 81, cognitive 77): (anonymous) has cyclomatic complexity 81 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3-chatgpt/src/official-factory.ts"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23e8a05759a06f93cf0b0958c89a8962ac00e730e08ddf0e4b5c96cb0e00775"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 71, cognitive 74): (anonymous) has cyclomatic complexity 71 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/darwin-mode/src/safety-ast.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"015b7906888179878d72e2c69eb047a77f1f93d3092ce5f791441d4b515dbf80"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateTransitionReceiptSchema (cyclomatic 70, cognitive 45): validateTransitionReceiptSchema has cyclomatic complexity 70 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/arc-agi-3/src/receipts.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b2947e4d8d6acc8a79044be67e71231842aa6ef109fe1153aea694e6bd9978"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function enableMetaProxyService (cyclomatic 68, cognitive 152): enableMetaProxyService has cyclomatic complexity 68 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/create-agent-harness/src/meta-proxy-service.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd466e932f3c89925f321f853d1728594944c0d23f21c3d5d04250c02adf4ff3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateCheckpointCrossFields (cyclomatic 65, cognitive 44): validateCheckpointCrossFields has cyclomatic complexity 65 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/arc-agi-3/src/checkpoint.ts"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"28fae3b6354a8e1ba0fa2842b4f7c6397eeced7c1819643ef7c156c2e353d68f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 63, cognitive 101): main has cyclomatic complexity 63 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":"scripts/nightly-sota-review.mjs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"3011ed14c380bd8f65e560e895d6b77ca63f4e66a03faa58a2849bb73c1854e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function commit (cyclomatic 61, cognitive 57): commit has cyclomatic complexity 61 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/arc-agi-3/src/memory.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43cfaf27046c1649849e0e6a46431bc41115fd59379d8da9f46e91988df0a9d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateBeliefGraphSnapshot (cyclomatic 61, cognitive 48): validateBeliefGraphSnapshot has cyclomatic complexity 61 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3/src/belief-graph.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c974175a75edee7085d8e35de126bddabe0346e48ed8e593ba6f878b0c0fbe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 59, cognitive 99): run has cyclomatic complexity 59 and cognitive complexity 99; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/avo/src/operator.ts"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"4442e51b6d3e3b556da1619066780349f2f83ce6ade18d860af7364f2659d79d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function commitTypedSupervisorDirective (cyclomatic 59, cognitive 46): commitTypedSupervisorDirective has cyclomatic complexity 59 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/arc-agi-3/src/supervisor.ts"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"012a443c3c7d561fe6f9355150f4d918291a7fbcebe7541e89f1d7732d5c05a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evolve (cyclomatic 57, cognitive 122): evolve has cyclomatic complexity 57 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/darwin-mode/src/evolve.ts"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"a933fcaafb1be4a9adb28b3d8c1ca4d38be32270924df5bde6183a07bb607477"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyMultiGenerationEvidence (cyclomatic 57, cognitive 88): verifyMultiGenerationEvidence has cyclomatic complexity 57 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/flywheel/src/multigeneration-proof.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"1924dc91df6bc7f8e54e3ec8731a698e03796146d9387be10dfb487a2d5a5524"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function metaProxyCmd (cyclomatic 56, cognitive 85): metaProxyCmd has cyclomatic complexity 56 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/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab4346ba4255aa1428075d94c522444ec9d4655b22b929d89847a478e46be371"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function preregistrationValid (cyclomatic 53, cognitive 27): preregistrationValid has cyclomatic complexity 53 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/avo/src/claim-gate.ts"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"480d5eec3684829c1e1fc8a1911bd906cdfa9e01e88bf48582f72aa755950646"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evolveNumeric (cyclomatic 52, cognitive 104): evolveNumeric has cyclomatic complexity 52 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/darwin-mode/src/numeric-evolve.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2477be648f4686c0d7ea502f37ef0825c223f358b8d6ee7c2df529f3dbe53cc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateCheckpointSchema (cyclomatic 52, cognitive 38): validateCheckpointSchema has cyclomatic complexity 52 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/arc-agi-3/src/checkpoint.ts"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"19fd5775aa0e81f4ecdd96426c691bc1f04e8d2f3da069a4536e90af1578843c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateExpectation (cyclomatic 51, cognitive 46): validateExpectation 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/arc-agi-3/src/canonical.ts"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"82abe1702f495a5660c0487a40d5ee94c34aeedfe5d03c5e4db964d0af259958"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function disableMetaProxyService (cyclomatic 50, cognitive 87): disableMetaProxyService has cyclomatic complexity 50 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/create-agent-harness/src/meta-proxy-service.ts"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"065eddd4dea1731b710d28a67efc86fded6f2dc8cedc50fc68180e54e136d99a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyReplayBundle (cyclomatic 47, cognitive 82): verifyReplayBundle 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/flywheel/src/replay.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"799e9afd68130af6dee70318a24d2036b7927467d899c837906135528e0fef87"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyCompletionCertificate (cyclomatic 45, cognitive 85): verifyCompletionCertificate 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/horizon/src/completion.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea48d1a2478a2a86392c3f154b53f8bb701853e45759eb5b9ff0adbdb79f47a2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateProductionManifest (cyclomatic 45, cognitive 24): validateProductionManifest has cyclomatic complexity 45 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/flywheel/src/production-gate.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b59217579abaf50fd33072e19ded37d3a4227dc66e2021fc34c317453ce4b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderScaffold (cyclomatic 44, cognitive 81): renderScaffold has cyclomatic complexity 44 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/create-agent-harness/src/index.ts"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b34c4f0a0f962b05fa52cfaf7daca09d8384cb00aecdb841938a1bbbdaed00c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addCandidates (cyclomatic 44, cognitive 73): addCandidates has cyclomatic complexity 44 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/arc-agi-3/src/plan-archive.ts"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"854fc93072851544a46f39f428f686726b158a717e5c46c68c6e403043398935"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function vectorAudit (cyclomatic 44, cognitive 65): vectorAudit has cyclomatic complexity 44 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":"scripts/sota-attest.mjs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"125f465868f0658842366c1b7fe4a5e8031fe11fb0b68694da54f976c7bcfeb9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #verifyCheckpointBindings (cyclomatic 44, cognitive 30): #verifyCheckpointBindings has cyclomatic complexity 44 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/arc-agi-3/src/avo-loop.ts"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"da95ad87c5f84bb4acc81b9087855a2fe58daad9b0ecef0b817bd4cd04f2adc1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runFlywheelGenerations (cyclomatic 41, cognitive 69): runFlywheelGenerations has cyclomatic complexity 41 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/flywheel/src/run.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfaa6a57947ffdb0b1f1d268a1236cd12f0c3ca0dc765380085883029e0acf87"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateCheckpointBeliefHistory (cyclomatic 41, cognitive 23): validateCheckpointBeliefHistory has cyclomatic complexity 41 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/arc-agi-3/src/checkpoint.ts"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a72bbe1ac00f8c0e6e0e072888d20820a3fd9fae9e12bf2da8302d6662f45ba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateStoredRule (cyclomatic 40, cognitive 24): validateStoredRule has cyclomatic complexity 40 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/arc-agi-3/src/memory.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e98594f05810e3e034db99b3d5093fa0adaadf207b4d2b43d6ba4d3479c13ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyEvidenceBundle (cyclomatic 39, cognitive 51): verifyEvidenceBundle has cyclomatic complexity 39 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/avo/src/claim-gate.ts"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"2367537ff90d5fb095aab546cd146b422aa73f79d2df2a0ccc0b293175c44f8e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function auditCmd (cyclomatic 38, cognitive 49): auditCmd has cyclomatic complexity 38 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/create-agent-harness/src/audit-cmd.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"da2fe64772253dd84a5dc0b314171290b115bc46979af13010662192b140c9f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 38, cognitive 22): (anonymous) has cyclomatic complexity 38 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/redblue/src/mock-target.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee3c11f4fc90b68f0f16ed81e9f8777fa0d0f0bea8478c6cef36e47e7682359"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gatedSubmit (cyclomatic 37, cognitive 50): gatedSubmit has cyclomatic complexity 37 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/redblue/src/integrations/h1-submit.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c0a0e43143bd82f172b1290b641710277581bd22142c5da593d40abedf865c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function retrieveContrastiveExperiences (cyclomatic 37, cognitive 45): retrieveContrastiveExperiences has cyclomatic complexity 37 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/darwin-mode/src/contrastive/memory.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"0099120ba8c9caf7b65ea86bf394640f70f48301b1345c42e9022333b3cc8752"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseRecord (cyclomatic 37, cognitive 40): parseRecord 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/field-memory/src/field-memory.ts"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9d2fb9d37d2741b0bf1008886f961a84d7cec84cbd200f1e2c3ef2d2d40e61"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createProductionManifest (cyclomatic 37, cognitive 31): createProductionManifest has cyclomatic complexity 37 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/flywheel/src/production-gate.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"5700cb3ffc29d340c98059e7621ece570d1db99a233e60c4a8dab9eec7e978fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanMcp (cyclomatic 34, cognitive 40): scanMcp 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/create-agent-harness/src/mcp-scan.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b9bec8089bb528ffdaaad4f1eb45f6548ff1a0892adcc18d06ecc7364774df3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function doctor (cyclomatic 33, cognitive 34): doctor 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/create-agent-harness/src/subcommands.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e18819fb729820c4b383cc54fb33606527e2f9e7e8d187d6666b492c11221a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readState (cyclomatic 33, cognitive 25): readState has cyclomatic complexity 33 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/flywheel/src/budget.ts"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"717bdb216b36921ef47bb16ecb49b41b0f4a6e69e101b8f65b0a79107ed49796"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validate (cyclomatic 32, cognitive 54): validate has cyclomatic complexity 32 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/oo-agents/src/schema.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"84cc44accebf1849ad0f45f3dd96fead497ff476bec3edbfa136868841964f35"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseArgs (cyclomatic 32, cognitive 38): parseArgs 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/create-agent-harness/src/index.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"e122d23b533be30503acaad9daa243b180792282e2848d56fc25b941704f2f52"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function graderValid (cyclomatic 32, cognitive 15): graderValid has cyclomatic complexity 32 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/avo/src/claim-gate.ts"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b949e13d1847f354def7bd12e6df1656e3ee8585e9246d5c53b69d7763e1089"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyFileMap (cyclomatic 31, cognitive 57): verifyFileMap has cyclomatic complexity 31 and cognitive complexity 57; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web-ui/src/generator/verify.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f4b3b17ca336a16871ce620604bea3c5e757ee8a1167be152020109c37c149"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 31, cognitive 44): main 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":"scripts/sota-attest.mjs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f90c08ec9eebef21608f5de00c74e01fc96385f89320dbb73314ac067b6c09e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateSpec (cyclomatic 31, cognitive 43): validateSpec has cyclomatic complexity 31 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/projects/src/harness-spec.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"36cec074fb27f6acdec62921038bbac5f023d9a64b9dde7199022f26b072a2ce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 31, cognitive 40): main has cyclomatic complexity 31 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/create-agent-harness/src/index.ts"},"region":{"startLine":1113}}}],"partialFingerprints":{"codehealthFindingId/v1":"334ce215696d538e6f6e4c108b9982f5e417f7d4e63d0bec534e3c4126126432"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function snapshotAgentJson (cyclomatic 31, cognitive 35): snapshotAgentJson 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/avo/src/operator.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d7359d27b555937a397737f7db74773adf681fe151f1cf60e2e616f6108644"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function analyzeRepoCmd (cyclomatic 31, cognitive 34): analyzeRepoCmd has cyclomatic complexity 31 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/create-agent-harness/src/analyze-repo.ts"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"127b5370202589010d00fc212702fd400b56b284dd319037f64bd9acc34e5f14"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateReceiptContinuation (cyclomatic 31, cognitive 28): validateReceiptContinuation has cyclomatic complexity 31 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/arc-agi-3/src/receipts.ts"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"f526a3468aaaf3c75d52a4d1dd58fdeed5f2116c4ffc2c3f070846c0bc49e551"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 31, cognitive 27): main has cyclomatic complexity 31 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/darwin-mode/src/cli.ts"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a466dbbeb10aa57f5b39867d7728c120333077fd5f2efbf177cc2cad5874680"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #stepCritical (cyclomatic 30, cognitive 51): #stepCritical has cyclomatic complexity 30 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/arc-agi-3/src/avo-loop.ts"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"521ec8d76b027c0dea7575707101897dd366e9b43c1093d1671d1a78ef10ebc8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseManifest (cyclomatic 30, cognitive 28): parseManifest 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/avo/src/claim-gate.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13908e71969d5bf6f33106495b55417f70db974d82422e83b4802e18d6f0040"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function productionDecision (cyclomatic 30, cognitive 19): productionDecision has cyclomatic complexity 30 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/flywheel/src/production-gate.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"d13d63b4b86f67738309b15294f03985b1866d2ef5d970c684e476d54b87e232"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSkillToml (cyclomatic 28, cognitive 55): parseSkillToml has cyclomatic complexity 28 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":"__tests__/codex-skills.test.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cfb40956e374ce0d2bdee62d7b13aa4afeb083bc8929cd6d549be2486e375bd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 28, cognitive 43): main 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":"scripts/release.mjs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"895aabd03e742d84b61a04d56c42d255c018c5434c0bd52314f2c42ca450f980"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function load (cyclomatic 28, cognitive 28): load 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/arc-agi-3/src/memory.ts"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"202333356920496c772d1239aebb5127dff8cb7cf5c1836cb22ff14ae95dad1e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 28, cognitive 17): (anonymous) has cyclomatic complexity 28 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/redblue/src/mock-target.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b253e6e40027eaf37aa21e1a0d6a652f7f4942bf5548a7bcd0851f1a98537e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function genomeCmd (cyclomatic 27, cognitive 38): genomeCmd 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/create-agent-harness/src/genome.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69131381ff13601990439b16703dd68622b27b1e00b843c0dfcc1a90747f074"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scoreCmd (cyclomatic 27, cognitive 38): scoreCmd 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/create-agent-harness/src/score.ts"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"1547df02299ad643f30eac66f2fe369b06730ffee734307c04fd63ca23dc9b9e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function threatModelCmd (cyclomatic 27, cognitive 38): threatModelCmd 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/create-agent-harness/src/threat-model.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"c761eff724bcaeecd4e8afab1d6d4021f04b6f7f909a4ea8315fd84e1e6815b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fit (cyclomatic 27, cognitive 34): fit 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/darwin-mode/src/fann-surrogate.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"e16e58a021adf0e813883530487649601d400246eeb70f326766ec8ab4a87d45"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runProtocol (cyclomatic 27, cognitive 34): runProtocol 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/radio/src/protocol.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"779adc9a014a0cd7e397a2991869a2fb3a38ed9800dd35341aa3a8fbf62955d1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function journalEvidence (cyclomatic 27, cognitive 33): journalEvidence has cyclomatic complexity 27 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/arc-agi-3-chatgpt/src/official-factory.ts"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"68fefe71a21250bde0337dbf3b794f8741f17313b40825cd06794dae7e6c9ff9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runMetaHarnessSubcommand (cyclomatic 27, cognitive 28): runMetaHarnessSubcommand 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/create-agent-harness/src/index.ts"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfbc46a2de6de02c8831e663997cc90394d731888392ab81c884e306cc2c91fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detect (cyclomatic 27, cognitive 24): detect 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/arc-agi-3/src/supervisor.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"6acdff7ee1cf578130880cbf54628d02150253127b4b2a78c23ad6d769d85165"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function benchmarkValid (cyclomatic 27, cognitive 12): benchmarkValid has cyclomatic complexity 27 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/avo/src/claim-gate.ts"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f53ab378f7267c4c686e4d997005531186150767a891addf98cb0f26123fa1d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #persistRuleEvidence (cyclomatic 26, cognitive 37): #persistRuleEvidence has cyclomatic complexity 26 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/arc-agi-3/src/avo-loop.ts"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"8445300056a00e6ee6885e42d5c8db745a219b063dbaffdcb848b33a96c9f95c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatReport (cyclomatic 26, cognitive 34): formatReport 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/create-agent-harness/src/compare-cmd.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c4a3a8a7ea5377cf172ea7e64e1c1cd31ec6b6571bc550842fbf9eddac97c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handle (cyclomatic 26, cognitive 25): handle 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/create-agent-harness/assets/generated-mcp.mjs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"4258c4d8b8d6d84c32403ef8e1397f022d57b0c86b2fb8295a3ff98d432d790b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function load (cyclomatic 26, cognitive 21): load has cyclomatic complexity 26 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3/src/world-model.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"9defedee5af5904b60e59307f6aa14e3c06311cc5bdcde4e7bb418c8e8ef6770"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadAvoCheckpoint (cyclomatic 26, cognitive 19): loadAvoCheckpoint has cyclomatic complexity 26 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/arc-agi-3-chatgpt/src/store.ts"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ba539f09633ba76012067bfcc10859762126eab76322473602b9d897afd98b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 26, cognitive 16): (anonymous) has cyclomatic complexity 26 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/arc-agi-3-chatgpt/src/official-factory.ts"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a2f2819db5b2ba87e0848e212b92f480000559deccc7e5c6d76ef05e565f85f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scoreRepoCmd (cyclomatic 25, cognitive 41): scoreRepoCmd 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/create-agent-harness/src/repo-scorecard.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0946ac32441dd5c0409b7a2de680a4592bbbe6a52a1fe81ef773c14d2fb6590"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyPlan (cyclomatic 25, cognitive 38): applyPlan has cyclomatic complexity 25 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/create-agent-harness/src/upgrade.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"04cfd81cc92b60e39b56eee5ebe85ff94cb883a1284cd2322bfabb15e1e19491"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function upgradeCmd (cyclomatic 25, cognitive 28): upgradeCmd has cyclomatic complexity 25 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/create-agent-harness/src/upgrade-cmd.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"79646381335b766f4488953506215e2e3d7a8509336a44f4ede32423d590397f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 25, cognitive 24): (anonymous) has cyclomatic complexity 25 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/arc-agi-3/src/controller.ts"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"80fb57a093eee45b5a083f3afb87ceb6d77783d83ef02a02babad80dd5b8ca15"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseLog (cyclomatic 24, cognitive 42): parseLog has cyclomatic complexity 24 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/kernel-js/src/session.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"4176e54c7754fae8b322096384258cd7524ff4b62a8d4c481903a17e3bac4240"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evaluateReleaseClaimGate (cyclomatic 24, cognitive 22): evaluateReleaseClaimGate has cyclomatic complexity 24 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/avo/src/claim-gate.ts"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b19558a17fefdb17c04a3bd10e452caba49972ba9182a753fa86449cd4a0f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 24, cognitive 22): constructor has cyclomatic complexity 24 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/field-memory/src/ruvector-storage.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bdff883c0f60abb7617884794c365bea4e981c43a252741ff57d7b30e430829"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function armMetricsValid (cyclomatic 24, cognitive 14): armMetricsValid has cyclomatic complexity 24 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/avo/src/claim-gate.ts"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d44abd37c178bb8d91347efacefa1f2e3389771070815b9e86e9ddc31e592a3"}},{"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/arc-agi-3/src/canonical.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4bd36474abac9a0b17e73b53453fe64a748bd8521190b6225b0c87a8e512fdb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 23, cognitive 28): (anonymous) 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/arc-agi-3-chatgpt/src/server.ts"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"24583f6435224c503ce23904391a2877b58f759f76dcb0582aabe76d555272c9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function oiaManifestCmd (cyclomatic 23, cognitive 28): oiaManifestCmd 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/create-agent-harness/src/oia-manifest.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"0120afca7c662d41e49c596f1a69acfd84230b23be331cde8631094c5bad0a3b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 23, cognitive 28): (anonymous) 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/darwin-mode/src/contrastive/validation.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee104dcd2fa48f6ee8377d8953ea50ad7a0058c8fe9841ffa4c81420da10b73d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function commitDirectiveCriticalSection (cyclomatic 23, cognitive 26): commitDirectiveCriticalSection 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/arc-agi-3/src/controller.ts"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c8a91121ddc97c24c0d9da3e03878f6b2073d43b96b27ffdb657ddfe6b32349"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hostConfigFiles (cyclomatic 23, cognitive 23): hostConfigFiles 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/create-agent-harness/src/host-config.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa0387d6f49182906258a2dac53a023b9a4a6c14351c51b62eaa890fd1f8404"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 23, cognitive 23): (anonymous) 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/field-memory/src/field-memory.ts"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"b55cb03de74c3d4e6de2a5cd7613a35134f47e3dd3db7488007113d611f495e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildRepoScorecard (cyclomatic 23, cognitive 22): buildRepoScorecard 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/create-agent-harness/src/repo-scorecard.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be392fcbaed62aa9df32e879653187a05051f261110710cab4db07bdba60d47"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function provision (cyclomatic 23, cognitive 21): provision 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":"scripts/gcp-cluster.mjs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"4300d606604df8c1287696d086c7d2b80840ff9d9082b1cf9b3a3bbec6ad7cd3"}},{"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/darwin-mode/src/contrastive/confirmation.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"28684d3435457fd93cc5c809ef27b79cf7044ffb364b881126aae73b407280ca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function clampLever (cyclomatic 23, cognitive 13): clampLever has cyclomatic complexity 23 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/evals-sql/src/evaluator.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6872a2ba7e691eed0df84d9443844b92035358a0bd4d6a19bf6aae723a45b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function weaknessesFull (cyclomatic 22, cognitive 30): weaknessesFull 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/redblue/src/integrations/hackerone.ts"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"aac8c5b29aa4620ac5a3ebdce9333e888fc5444acc5a8dd1cbaf85aebb9bc813"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function federateDispatch (cyclomatic 22, cognitive 28): federateDispatch 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/create-agent-harness/src/federate.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"4209b0aac4ca1704ab0193fee5be0ba8d6246c42dbe5ff758f27d94101381268"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hostFiles (cyclomatic 22, cognitive 19): hostFiles has cyclomatic complexity 22 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":"apps/web-ui/src/generator/scaffold.ts"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d382b3f51444ec3760e5934b5afb43eea1172c278e84e5c190c9a0cbcf315c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scoreVariant (cyclomatic 22, cognitive 16): scoreVariant has cyclomatic complexity 22 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/darwin-mode/src/scorer.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"b16474a7fd6aa417449367d9b0f73081982da9d709882debc1ddbc19aed0ddf1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function probeWriteScope (cyclomatic 22, cognitive 16): probeWriteScope has cyclomatic complexity 22 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/redblue/src/integrations/hackerone.ts"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"400b6a04bf4182a10702a296c70a02c7ae5d8dfe5fbbbe4e59781a8fb2db4a08"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runSeed (cyclomatic 21, cognitive 41): runSeed has cyclomatic complexity 21 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":"experiments/router-calibration-loop/lib.mjs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb2f0d0e807bf17366c1637ac72566ae3571999c6fadeaa8344cd13c88a3090"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evaluate (cyclomatic 21, cognitive 38): evaluate has cyclomatic complexity 21 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/evals-toolcall/src/evaluator.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d3a92e9b8d9fadd6148cc8d8e1d8de9ca0d785c37e37c1822ce667b4415687"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exportTrainingData (cyclomatic 21, cognitive 33): exportTrainingData 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/weight-eft/src/export.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"0851b8807af5d357913be304a97cd73155a25bf30c446798e3c87628e01c6782"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parsePatchPaths (cyclomatic 21, cognitive 31): parsePatchPaths 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":"scripts/sota-attest.mjs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f78cbcaac6e60ee39ca9dc7ff3011d8d8b78bb8b91060affbf02346ba1991cd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertJsonPayload (cyclomatic 21, cognitive 30): assertJsonPayload 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/arc-agi-3/src/checkpoint.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef946153e116949bea6c0da086a0d67311fdc5c450903cfa517f3e5400ba0eb8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function defineHarness (cyclomatic 21, cognitive 24): defineHarness 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/sdk/src/index.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"790e327b930261f09814750f59ef3e701d3a7db9adeb427e0a0e4a0805fb273d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 21, cognitive 22): (top-level) 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":"scripts/write-example-packages.mjs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"4458c4276691176104a70103b36fb7a230cbb8e4bb61365868db4d670ae3db55"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #disposeAfterQueue (cyclomatic 21, cognitive 20): #disposeAfterQueue 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/arc-agi-3/src/python-bridge.ts"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac73651a0c88bf8747db0ba9b17bf83e59ba8b166a822a2c87e3dd5fbe76ed4e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createOfficialArcControllerFactory (cyclomatic 21, cognitive 19): createOfficialArcControllerFactory 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/arc-agi-3-chatgpt/src/official-factory.ts"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"4110de3f4462eeb138e5ce77f16ba937037376664413b3c39829f006c7f79391"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatDiagReport (cyclomatic 21, cognitive 19): formatDiagReport 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/create-agent-harness/src/diag.ts"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa244a7942bb8ecdedc232894165c425d840a6ba9e54216a453fa25c10a94585"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function clampLever (cyclomatic 21, cognitive 11): clampLever has cyclomatic complexity 21 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/evals-toolcall/src/evaluator.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"a069cc5500260aa65e483c50368a246e1fb88c0e2ba2d632c9f503eda427c1d9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toolResponses (cyclomatic 20, cognitive 39): toolResponses has cyclomatic complexity 20 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/weight-eft/src/reward-hack.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"668acc188421f5a6cc5705720d81cb233479643719f2b19f8255cab75e79b954"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dispatch (cyclomatic 20, cognitive 33): dispatch 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/avo/src/cli.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e50c530a89cefbcab499b7009c6ff82dbeead936ae0784cb00528f26f2cc81"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseManagerState (cyclomatic 20, cognitive 28): parseManagerState 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/create-agent-harness/src/meta-proxy-service.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"62908694d9d8e525f40218391da2631ba276e8c23824d7569ab31dfbe98968f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function authenticate (cyclomatic 20, cognitive 26): authenticate 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/arc-agi-3-chatgpt/src/auth.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e56c37bc0e3d26bb934fa0cde7e907e10ad57d29397c83150884bdcf3e62d9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evolveDetectorsReal (cyclomatic 20, cognitive 22): evolveDetectorsReal 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/darwin-mode/src/security/real-evolve.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee85e02ecd6cfcb3daa765df64816b5c007bf516a6e9cb8dafa4c7d09e850c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function confirmContrastive (cyclomatic 20, cognitive 21): confirmContrastive 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/darwin-mode/src/contrastive/confirmation.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d76256b88664c3b9d1df77c036041a21fd30c051a791f64911df3060ef8d22"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function installMetaProxy (cyclomatic 20, cognitive 20): installMetaProxy 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/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab6ed61a52ec47877faa503337387356e6e601533d115eb5f879c4f036a0c46c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createArcMcpRuntime (cyclomatic 20, cognitive 18): createArcMcpRuntime 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/arc-agi-3-chatgpt/src/server.ts"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f052289c3d6fb669dfbf435d9e82939b160283e21bb0e9be3d11cc13de7f575"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildThreatModel (cyclomatic 20, cognitive 18): buildThreatModel 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/create-agent-harness/src/threat-model.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe41c0d0dc171b7367218ec264b24dd28a31b2405d30dd1a82c537953ba8538"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildAttestation (cyclomatic 20, cognitive 18): buildAttestation 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":"scripts/sota-attest.mjs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a0883002a5f62e7d1a328f3a4b13f0cbc560dfc2dabe1cb91294f7fe328ac89"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateArcAction (cyclomatic 20, cognitive 13): validateArcAction 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/arc-agi-3/src/canonical.ts"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"38efe2e8cd58c25730127c0f6858172c525530fe0829cddd7d45cdbb032e1a2e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadCheckpoint (cyclomatic 20, cognitive 12): loadCheckpoint has cyclomatic complexity 20 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/arc-agi-3-chatgpt/src/store.ts"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3efdae163a642057b768b594ae7679b0c4c21fd774d3f3191cb916a78492b68"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function clampLever (cyclomatic 20, cognitive 11): clampLever 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/evals-extract/src/evaluator.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fae5ee647f5b92cd3a0824076141273883665d33d6a78e172c48fc73521d543"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function clampLever (cyclomatic 20, cognitive 11): clampLever 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/evals-hle/src/evaluator.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"95993c692fbf2d8aed64384ad0a2272adf552dab6855b8c193ab6ee05e76fb36"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function clampLever (cyclomatic 20, cognitive 11): clampLever 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/evals-math/src/evaluator.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95998576fb459e162a65f78f53b82e327fe6953d64dca1d871cbbd42893fae3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reconcileTransitionReceipts (cyclomatic 20, cognitive 10): reconcileTransitionReceipts has cyclomatic complexity 20 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/arc-agi-3/src/receipts.ts"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d6df434fabf9bc7182d72d83918d89386d5bfc8ea61f706330267212312499"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function autotune (cyclomatic 19, cognitive 42): autotune has cyclomatic complexity 19 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":"scripts/gcp-cluster.mjs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"054b77d89439e0a5ca7238cfb205feb5add35a090ee8aa8cf58fb44008c2dfc1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 40): (anonymous) has cyclomatic complexity 19 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/radio/src/sim.ts"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"c53e0e1f9f086ffe89636da7590b619d476b6da6347a7fe6dc3d1ca0cc3b7d62"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function analyzeTranscript (cyclomatic 19, cognitive 36): analyzeTranscript has cyclomatic complexity 19 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/src/gepa/metric.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1bc9faecc90207e6cbf59dee4329576221480a192630670ffc74fc24f60cea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function canonValue (cyclomatic 19, cognitive 32): canonValue 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/evals-extract/src/normalizer.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"42dc7624f2a1d2a460de4a2e504e3a63a67b74e5e69495aaf901b406c364d262"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gepaOptimize (cyclomatic 19, cognitive 27): gepaOptimize 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/darwin-mode/src/gepa/loop.ts"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96176c88a4c9fb00a70ad4becfbe56e4c833d726389c2dc2e738b05de888229"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function installMd (cyclomatic 19, cognitive 27): installMd 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/host-prime-agent/src/index.ts"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aeb8ab17886e9cdb4b5b2b2f464479114794642e8106f53f52ab46e29e0c41f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 19, cognitive 27): main 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":"scripts/validate-gcp-secrets.mjs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f53824de0cb3910da4258000a3faa29847427484a241a8e495cc92b901d1a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyWitness (cyclomatic 19, cognitive 20): verifyWitness 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/create-agent-harness/src/witness-client.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"511bafed727a311b32eba1adacd1882651ec2c0393f70c8ed81faec9d852d38f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeAnswer (cyclomatic 19, cognitive 20): normalizeAnswer 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/evals-math/src/normalizer.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb7bd0d245304492808a9edd6dbfb0db3011c0e11a0f90bac0fdf637e773e4d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function HarnessBuilder (cyclomatic 19, cognitive 18): HarnessBuilder 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":"apps/web-ui/src/components/HarnessBuilder.tsx"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"458d5daeefa16a59522e8084d19a24aa08b6399dca2d0c43071e24b9cb96a741"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateExactArcObservation (cyclomatic 19, cognitive 16): validateExactArcObservation has cyclomatic complexity 19 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/arc-agi-3/src/canonical.ts"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b87d982b7a7c78e4ea8b99c07c748e2a4026c8253a6010c081ccfb07e79103"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evaluateShipGate (cyclomatic 19, cognitive 14): evaluateShipGate 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/avo/src/swebench.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"90664f708e97166eee1bfa42bc9f805f3758b7566905e513dbca37a812087888"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function integrateGeneratedRuntime (cyclomatic 18, cognitive 34): integrateGeneratedRuntime 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/create-agent-harness/src/generated-runtime.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c17207f2fab2a7d9f5822e6eee2950a1d2e9fce199a7396784dbcb2cbf9c4a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectRewardHack (cyclomatic 18, cognitive 34): detectRewardHack 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/weight-eft/src/reward-hack.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c81067894b013b14a8705aa45ebdaac1a35a918d5456cce956b5ead8f46f59"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function heuristicClassifier (cyclomatic 18, cognitive 25): heuristicClassifier 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/evals-toolcall/src/classifier.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"40aed0bb178a3f59eb45ac75ef3788fcdee4aba5853ca8333b1e053da3811ea6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseKeywordArgs (cyclomatic 18, cognitive 24): parseKeywordArgs 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/evals-toolcall/src/normalizer.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"0817f25d3dcdc55362ad02653b9feeaf831be167539765663b82952a5ea8b95e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractCapabilities (cyclomatic 18, cognitive 24): extractCapabilities 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":"scripts/verify-harness-live.mjs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"f165a39cae60607fb9ef894f3a0c8dfd45882d258cc47bd1ff721c28cbc48d13"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCall (cyclomatic 18, cognitive 23): parseCall 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/evals-toolcall/src/normalizer.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"2648b3cd490204175a5623cb3ea9e838d2da18995d50c6e067d3a4a4e2cfdbef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function actCriticalSection (cyclomatic 18, cognitive 22): actCriticalSection 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/arc-agi-3/src/controller.ts"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eebf3352a623cae65de2fb7224167076ea41a5a5dcfbeac8e85f804aadda749"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function postChatCompletions (cyclomatic 18, cognitive 22): postChatCompletions 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":"services/apicompletions/src/routes/chatCompletions.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de4ad04c87c909b41282259a082eee878432590cf1d16198e282e06af80b8d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function postMessages (cyclomatic 18, cognitive 22): postMessages 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":"services/apicompletions/src/routes/messages.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"23520ceb1b4f7a859091bd03c67bf241d61851675d92e105e1ed2e58a698caea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateDocument (cyclomatic 18, cognitive 21): validateDocument 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/darwin-mode/src/contrastive/validation.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc7d5bb59b4a34793cc4e715c029c2b7841d0f87a78c267360dad36acef5429"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function analyzeFiles (cyclomatic 18, cognitive 18): analyzeFiles 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/create-agent-harness/src/analyze-repo.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc472d771e031592f4e46f376c9dc7fb131d561472bb45e78895bf03defff3d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startMetaProxyService (cyclomatic 18, cognitive 17): startMetaProxyService 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/create-agent-harness/src/meta-proxy-service.ts"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"896330e95923aea048362f10cc7d660d50b0774ed0d02ecbc3fb918f356643f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runContrastive (cyclomatic 18, cognitive 17): runContrastive 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/darwin-mode/src/contrastive/engine.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f541cc7b8c2f699efd5ef581f1761056e37e2b0e83fde3471ff2ffd814039e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyFailure (cyclomatic 18, cognitive 17): classifyFailure 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/darwin-mode/src/gepa/metric.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"59d1082778a5a491434056ea86ceab8b7762bb5a8633ee7700a585b19ae95768"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateLineageCommit (cyclomatic 18, cognitive 17): validateLineageCommit 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/flywheel/src/validate-bundle.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e61a689d3bff314d8330759aa4557f962b27988d18b512678f6bcc6be331ac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 17, cognitive 37): run has cyclomatic complexity 17 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/projects/src/scheduler.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2f875ac7d7635e1f72c46036a649a94478d2aea9d4dc19e36390a22bd22bc1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildSupportBundle (cyclomatic 17, cognitive 31): buildSupportBundle 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/create-agent-harness/src/diag.ts"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"507e95d5ccd0b35d8f3c768068ad239c183fc1f39130d9e2e6a5884782ae369c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runSwarm (cyclomatic 17, cognitive 29): runSwarm has cyclomatic complexity 17 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/darwin-mode/src/security/swarm.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c194130c5292eedf5b3b5ac8981c2b068d259b34bb8d9e35075376f43713d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 17, cognitive 25): main 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":"scripts/release-notes.mjs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e63371a183a0fa5c1995e7697fd17b3c81be2bf1965503a6c57bdd7702504d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function programScope (cyclomatic 17, cognitive 24): programScope 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/redblue/src/integrations/hackerone.ts"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4fc9bf8aae5902f271f586015738e99dbaa6ecbb44dfaf7137b1d4b83711ddc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function execute (cyclomatic 17, cognitive 23): execute 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/avo/src/repository.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ecb5b72bb6086449c7b3fed20651e93cfd575a7c1edee14de9fe133d4a602ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function makeTask (cyclomatic 17, cognitive 23): makeTask 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/radio/src/sim.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb9f979f03a653d1e54b734c66c528497f1311928727fad66c8557155c9d323d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function streamInflight (cyclomatic 17, cognitive 23): streamInflight 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":"services/apicompletions/src/midstream/inflight.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"8624c0a977d23b07b01f72410a409dd3f9416272bf91acfa28fc70ea96cabb1e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateClaimSurfaces (cyclomatic 17, cognitive 22): validateClaimSurfaces 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/avo/src/claim-gate.ts"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"280b4594e7d151e77f349964349f94de79e6f3ca64d2a32f5e3348e4ea0a4b59"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evolve (cyclomatic 17, cognitive 20): evolve 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/darwin-mode/src/security/evolve.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"f085e3148636b4582ebf7f0cba0036cf412856d707679833ad1eca840dd31bef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveFeatures (cyclomatic 17, cognitive 19): resolveFeatures 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/arc-agi-3/src/avo-config.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee46636ead0ae2078621f8d9d61b2b0e38fecb26c2008cfd26c64dd483185be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function observe (cyclomatic 17, cognitive 19): observe 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/avo/src/supervisor.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e8cdccbd17aea0bd2cf8c255e30d4449e2aaef7e213eb65f34a48d91eb5cad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runCargoAudit (cyclomatic 17, cognitive 19): runCargoAudit 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":"scripts/audit-deps.mjs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b740bea2e1708b44974c86036f4318415bfab48920283f40674f1473ff55afa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateFrame (cyclomatic 17, cognitive 17): validateFrame 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/arc-agi-3/src/canonical.ts"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ac1a862556a9f6b8581134cca558c3cd9293b04d2077bd14e832e4a67bf38a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function analyzeFiles (cyclomatic 17, cognitive 16): analyzeFiles 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":"apps/web-ui/src/generator/repo.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b63fa427b6660a2152b6be391eb262de64fa4f38e4e27b5990799534c3e65d7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseObservation (cyclomatic 17, cognitive 12): parseObservation 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/arc-agi-3/src/python-bridge.ts"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3cbc5fb2b99d97c051878fb669bd11240a6bdc0db22d137ba2cf3771f8b9346"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertVariationAction (cyclomatic 17, cognitive 9): assertVariationAction 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/avo/src/operator.ts"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"107dc7c02993a1797c480d9cacf5efbf55f6618982f160aa23e118e74bfdda4e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runLoop (cyclomatic 16, cognitive 30): runLoop 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/horizon/src/driver.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"184bc92502dbc79f64138d5d8aa74470446fe2803e4d1b3ed9d8a64ff4ced304"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspectVariant (cyclomatic 16, cognitive 29): inspectVariant 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/darwin-mode/src/safety.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a5166aa952530d036dae52a28409a9bd8e80bc297ba432aeb45f74f71782d55"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runExecute (cyclomatic 16, cognitive 29): runExecute 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/radio/src/protocol.ts"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87b3666b192bfb3676d6b9c12c9ff96663212850ce2a5da3871bb2ece27e380"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toSafeJson (cyclomatic 16, cognitive 26): toSafeJson 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/arc-agi-3/src/canonical.ts"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"3363862c84e8d47b26ed8e05847c7ecf47ddf966fbe9333ec961c74ef0174d69"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cmdHackerOne (cyclomatic 16, cognitive 23): cmdHackerOne 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/redblue/src/cli/index.ts"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff3815204ffe30f3552d09c91357d5a02305876a201381c38a6a42e69da901b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 16, cognitive 23): main 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":"scripts/publish-workspace.mjs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a3d0d21c56f2ada26713bee9349687a24a24bde96127521f00fdea5568dd33"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function streamResponse (cyclomatic 16, cognitive 23): streamResponse 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":"services/apicompletions/src/routes/chatCompletions.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"899e752f5cfaeae4550e071c75697e73dd90aae50229623110be45f71eadb92c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function integrateFieldMemory (cyclomatic 16, cognitive 22): integrateFieldMemory 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/create-agent-harness/src/field-memory-scaffold.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b5aa1a25e54c7b1d7d87e49df5896b467706c9b994a72bcbe4e4abfdae487c8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scorecardRuns (cyclomatic 16, cognitive 20): scorecardRuns 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/arc-agi-3-chatgpt/src/official-factory.ts"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"8676c2553715763a8fb0edc551be77f75d09d7b15639e82dc5d7879fadb0eefc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scoreMcpSafety (cyclomatic 16, cognitive 20): scoreMcpSafety 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/create-agent-harness/src/score.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ba0724ca2f7a20e7fb3cd7f0c4e544e9d1ae6da0c261b5df3d739344a76e5a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function postCompletions (cyclomatic 16, cognitive 19): postCompletions 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":"services/apicompletions/src/routes/completions.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4be74f626e28d25cc19455ad08351634ecf1f34f448e91d490a5673942a2cff"}},{"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/arc-agi-3-chatgpt/src/official-factory.ts"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb44ce0bf6f9181112871c44a230575e682d32956ebba8065c0061652015a03b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dryRunOne (cyclomatic 16, cognitive 15): dryRunOne 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":"scripts/publish-dryrun.mjs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"073724a964d5b53270d9af763633e8afbb82c1012d3194ccad8c73935a2dde66"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function meetsPromotionRule (cyclomatic 16, cognitive 14): meetsPromotionRule 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/flywheel/src/gate.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"e50f60f21a959945eaa11ff177b6ccec088c89a20e2488a9fc3f1bf019f465e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runCli (cyclomatic 16, cognitive 13): runCli 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/workspace-probe/src/cli.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dcf3161ecb89b4a9751bbf38d9c1eb11c4f26b6b3946fc5db5b9926b608a585"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 16, cognitive 13): main 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":"scripts/avo-claim-gate.mjs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb2e9dd046e4e481e3f17c9b0b4f33b6f404f898da4e1a616c6b78e35281420"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 16, cognitive 12): run 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/flywheel/src/cli.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"010af352949d09fc663587cdd955a242fd3ebecfe25a7762bdd7d6fd1e534bba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function query (cyclomatic 16, cognitive 11): query 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/arc-agi-3/src/memory.ts"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"8775faf553510531733cf794669918659b5d5f4e7900d48dc3614a2727301caa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 16, cognitive 11): constructor 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/arc-agi-3/src/python-bridge.ts"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"686b5927a525d2bcd9d8a47719a04dc5f7f2dc05e8a897672813e44e4c4f99cc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runRepo (cyclomatic 15, cognitive 31): runRepo 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/darwin-mode/src/security/agentic.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3e14c040969bff2793de1ea5181e2fa23b190a71a4b3670bed694db615a28c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function containsRawGameIdentityKey (cyclomatic 15, cognitive 30): containsRawGameIdentityKey has cyclomatic complexity 15 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/arc-agi-3/src/canonical.ts"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d3ecf2dffbad3b9a6b6e751a97bd567046b4bc3d37e4b47ddb778c297046634"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function installAndActivateMetaProxy (cyclomatic 15, cognitive 28): installAndActivateMetaProxy 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/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"1538d9600a850242c109780846dd37da420534feb5fb3bb429b4de5c85ee802b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evaluate (cyclomatic 15, cognitive 26): evaluate 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/evals-extract/src/evaluator.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"661fa9d402b4e176aa4ba9b7dc9c69cdbc14a5ed98a35d9eb595f141b44e4af7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evaluate (cyclomatic 15, cognitive 26): evaluate 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/evals-sql/src/evaluator.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40545cf5f89ea1ba3341822dbf878d4ca1d5624a6b77846950cf768a3df5f25"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractJsonObject (cyclomatic 15, cognitive 26): extractJsonObject 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/evals-toolcall/src/normalizer.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa448e6d8a4f4a5a81c39abf8429d2a12a12438bb27d1e45943ddff48a0b73a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseTomlSubset (cyclomatic 15, cognitive 24): parseTomlSubset 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":"__tests__/integration/host-functional.test.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b16ee63b6b776c3948dca1d3e4cde1c6c0cc7b907f8fda100540eb13a57da8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runWizard (cyclomatic 15, cognitive 24): runWizard 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/create-agent-harness/src/wizard.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"c52c5f92b6a5cd5c4b6d1f6f7875daae6112e73100e1a8899550c1a5f7bf19ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function check (cyclomatic 15, cognitive 20): check 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/create-agent-harness/src/secrets.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"9085a9ba9a1fb3294ed0363788e7fbde19939c7d6152ffe08216b9e2f2729fa7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verify (cyclomatic 15, cognitive 19): verify 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/evals-sql/src/verifier.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d0de2dabe3d0c45ce5a99a259d56244f1ac19f455e5cefab7a2446d3b66d3b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function npmEntries (cyclomatic 15, cognitive 18): npmEntries 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":"scripts/sbom.mjs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"0744028b14cf0313d14f1ab17a00056cb70d600c64655b1cb8914afdc6475263"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pluginInitCmd (cyclomatic 15, cognitive 17): pluginInitCmd 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/create-agent-harness/src/plugin-init-cmd.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"76655bf6a6856dffc72a633d6a2cd0a1e379d62c451f6a37d1bfe7f07512f4ce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyIndependentReviewPacket (cyclomatic 15, cognitive 17): verifyIndependentReviewPacket 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/flywheel/src/review-context.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"183505f6286c25720b04ea2e330b4a92765c7cf876329f4a25d1344f9d0c8c35"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertActionLegalAgainst (cyclomatic 15, cognitive 16): assertActionLegalAgainst 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/arc-agi-3/src/controller.ts"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec67a75623ece01989d46a50a24f6648b7839810c0df7d0dfb443929976f3c7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mcpInvoke (cyclomatic 15, cognitive 15): mcpInvoke 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/create-agent-harness/src/mcp-cmd.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b4056ab11759cfb34ae445f8bcaa2e93c073a999e339377550b0012e60ba5a"}},{"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":"apps/web-ui/src/generator/repo.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"0435740ae815e0e712976dd5baf56aa7491f298e3b91cb226f7b3d7d09bb16e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function autogenousPromotionRule (cyclomatic 15, cognitive 14): autogenousPromotionRule 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/autogenous/src/gate.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"64476af9aff43aa54cc4a66961f769b80f69b7d2d51cc14800fc05d43486f957"}},{"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/create-agent-harness/src/analyze-repo.ts"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f8146028eb2afbd9a427aeb72441124724be0c962b2dcfefb782e12fd5766b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function appendOutcome (cyclomatic 15, cognitive 12): appendOutcome 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/arc-agi-3/src/plan-archive.ts"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"05c9101e29e7d914a9ff9e623a08a02a0bfb8e350b0b2a4973d2472ec99ef5f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseLearnArgs (cyclomatic 15, cognitive 12): parseLearnArgs 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/create-agent-harness/src/learn.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce49128ae89a4f04220f3cbae59f8bf51f1e31baa5d7ddccd6a937c0e1247dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeInstanceScore (cyclomatic 15, cognitive 12): computeInstanceScore 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/darwin-mode/src/gepa/metric.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"25fd4221e3ef38ba9fca6c192b5f66a60d970635932224e60673e50878093ebd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runVariantTaskLlmAgent (cyclomatic 15, cognitive 12): runVariantTaskLlmAgent 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/darwin-mode/src/llm-agent-sandbox.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec5bc98396b9ffc32e9863f6a1f34e10311fbbd4162e075ddfb79e9d9cd5609c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeAnswer (cyclomatic 15, cognitive 12): normalizeAnswer 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/evals-hle/src/normalizer.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a45c764953cc0ca155b5c31f08abb1d7587a0bb93ab4b72c31bd7e182c78d1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deriveBadgesFromMcpScan (cyclomatic 14, cognitive 25): deriveBadgesFromMcpScan 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/agntcy/src/identity/from-mcp-scan.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"c507b81d8755300b621faa8afeb76728b526671de3de0a62e42535a8c104687b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evaluate (cyclomatic 14, cognitive 25): evaluate 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/evals-hle/src/evaluator.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"7799a1f90ffc265e2dd7a8ef5f723e824ca5038ac470721f88e8c5ce5d869caf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evaluate (cyclomatic 14, cognitive 25): evaluate 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/evals-math/src/evaluator.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"517257df1cd247343a1e3f4acd2798cae04ca29f3d9bb275507925b5decb5435"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function canonValue (cyclomatic 14, cognitive 25): canonValue 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/evals-toolcall/src/normalizer.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"522bde05599d415566ba4890afbec012fe029342d81f90316c09ff32efa4a938"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function trainCmd (cyclomatic 14, cognitive 23): trainCmd 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/weight-eft/src/cli.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"233bad4e948a43ef1a46b7cae6ca1153d09ab9cbe8e478280b851d5a81ba9d06"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function projectToOasf (cyclomatic 14, cognitive 22): projectToOasf 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/agntcy/src/oasf/project.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d153b450e5db703e58eb4c242c3bc5c572f3cb7eee71ed758ae885cf8fadb6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compileObjectiveToEnvelope (cyclomatic 14, cognitive 21): compileObjectiveToEnvelope 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/agntcy/src/casa/compile.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"6293aec211aeebf1346087eaabb3c2f7b00bf05299f00ca78bc34b85d01dfe98"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveTooling (cyclomatic 14, cognitive 21): resolveTooling 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/darwin-mode/src/repo_profiler.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"821b1ce7bc800eef817761d98139aa7be9b8fa2ad1f2cb63b838b48f1e3ac386"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 14, cognitive 21): main 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":"scripts/verify-harness-live.mjs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb311d176ca653a8f5f8db52e394a6c5331cbe9d257af95ceb0cbdd3b86f608d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function packagesFromLock (cyclomatic 14, cognitive 20): packagesFromLock 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/create-agent-harness/src/sbom-cmd.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e34c5899a2427c7ac2ccc5095a71c7f80691e7fbf29f6089a4f54812cb62ac9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateVerticalManifest (cyclomatic 14, cognitive 18): validateVerticalManifest 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/vertical-base/src/index.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a740b9af3b52dac0d415444a1903d291f32c54e5cbd999c999b2f8889c5bdc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runDiscovery (cyclomatic 14, cognitive 17): runDiscovery 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/projects/src/discovery.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b4445e8a6e64baaa51cba101256d34e9224a37be89595ad39f393be9f760be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseAuthorities (cyclomatic 14, cognitive 16): parseAuthorities 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/avo/src/claim-gate.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08eb9fd139770fb10323edc91bcd7be39afc2d918893b2ea4c40226702af4fd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 14, cognitive 16): (top-level) 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":"scripts/native-router-guard.mjs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f5c7559a4419a850d1e31839a63bc08e73aa07eb5b2fbc5707429951fb0b123"}},{"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/darwin-mode/src/contrastive/engine.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"be78bea7b8884b116a2bf38859763dbc15e7dce2519a04f90b8cfa7566922473"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadKernel (cyclomatic 14, cognitive 15): loadKernel 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/kernel-js/src/index.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"33672613158d5cc9ce848749ed2b4a98d8c60c472aedee540eaf55ecaffe6316"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveArcAvoConfig (cyclomatic 14, cognitive 14): resolveArcAvoConfig 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/arc-agi-3/src/avo-config.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"02012ff8e759db02d2605721d15b91e6ce4bc2c2f9e37fb243718ad7b71847b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collect (cyclomatic 14, cognitive 14): collect 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/aws-finops/src/checkov-adapter.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff892cce53bda62a545313fb8a7564cb0ca65a7e3dd48dae72610a0ab88ecdc7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runLearn (cyclomatic 14, cognitive 14): runLearn 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/create-agent-harness/src/learn.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"72dd9537961b7fb2dfa190ce7fcaa583b73a05a8b859e9ab37d39a3ca43fe3de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sign (cyclomatic 14, cognitive 14): sign 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/create-agent-harness/src/subcommands.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c72216e20521f4080305377c4d7434df870b154b87c895b3004ca3a937ec01"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 14, cognitive 14): constructor 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/darwin-mode/src/fann-surrogate.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"a436d67d909a812cc78f89a7b6165f26bed846dff9a3d098a827da9a60c621de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 14, cognitive 14): main 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/darwin-mode/src/tier2-driver.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d41f05ebbdb89262b03abe4bcbbbd5e6560f9fa038af3c63030f8e9ff6928fc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function makeFeedback (cyclomatic 14, cognitive 13): makeFeedback 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/darwin-mode/src/gepa/metric.ts"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7cf99b6cf7d89c2793efed5f999722cfd2b9e88c3507e086a706e2375568fca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateMessagesBody (cyclomatic 14, cognitive 13): validateMessagesBody 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":"services/apicompletions/src/routes/messages.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"efed2c4c3477951659726b99706454933d22b3121963ebe5565701c6821c631f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateAssignment (cyclomatic 14, cognitive 12): validateAssignment 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/arc-agi-3-chatgpt/src/official-factory.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7e74b3ffd4d091f520b12cbb5676b790f6869245eb16bcf5a26efb9bf361261"}},{"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/arc-agi-3/src/memory.ts"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"803d476ed877b6a8297b48c431fd0a1b443885402b740a5274674ed39ceaad7e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function submitReport (cyclomatic 14, cognitive 11): submitReport 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/redblue/src/integrations/hackerone.ts"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd5b673bef300a8adf17ed0cb64eab1a1087fda43ceab684c6030f750267368"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateExactGridFrame (cyclomatic 14, cognitive 9): validateExactGridFrame 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/arc-agi-3/src/canonical.ts"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc3d474c1d1a6542e0f78721ccf96d50b99c771b7cd896f0344a6ebfbdf04d5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function call (cyclomatic 14, cognitive 9): call 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/darwin-mode/src/contrastive/editors.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"1299ae981c763482222921ad4e4e5de5f1bdb6234cc760b32f741269c9f1c696"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walk (cyclomatic 13, cognitive 27): walk 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/create-agent-harness/src/validate.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f61a390a938f13434be2bd6a5e1d2d8053b3ab664f48c1462057b7eea62910a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runCascade (cyclomatic 13, cognitive 24): runCascade 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/aws-finops/src/cascade.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e3148d8624f4017f0500158b7b12738d7558937d51e12e46e03162fd0025040"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function heuristicClassifier (cyclomatic 13, cognitive 22): heuristicClassifier 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/evals-math/src/classifier.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d7ab78ed4d84608bcb1f0cbf39002714328da78fcb17b83d6a536cbfbbb4d6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function heuristicClassifier (cyclomatic 13, cognitive 22): heuristicClassifier 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/evals-sql/src/classifier.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"833579efec219f052e4e59b2b5491ece67c15d7b9f6fda7d3c9605f4dcea48fd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mcpLs (cyclomatic 13, cognitive 21): mcpLs 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/create-agent-harness/src/mcp-cmd.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f259e4ca4681291f13253e4eb46f2c658d23974e982b4bb3a0c4b39bc1cabc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseYamlSubset (cyclomatic 13, cognitive 19): parseYamlSubset has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"__tests__/integration/host-functional.test.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b01e31af5f528cddd567c6155628a787fa21bf009942bdecf830b7e6a54d9c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function uninstallMetaProxy (cyclomatic 13, cognitive 19): uninstallMetaProxy 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/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"8647868b4387265568b474c97317b3e8782bdb69585061436b9d7125d298d211"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function version (cyclomatic 13, cognitive 18): version 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":"scripts/healthcheck.mjs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f146d0727b229572e7fce7da09d3b13c0bc11b165ac4f03261e7672c18ab45"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mcpServerPresent (cyclomatic 13, cognitive 17): mcpServerPresent 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":"apps/web-ui/src/generator/verify.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"7acca4382748a73c103a29cc8f0732d98f635df0b9011432c44b62a0310f0650"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function select (cyclomatic 13, cognitive 17): select 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/arc-agi-3/src/plan-archive.ts"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4cd52c156fb7262c099d6fcefc925ee7402560061562f259a322626ae0c47ea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inventory (cyclomatic 13, cognitive 17): inventory 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/create-agent-harness/src/analyze-repo.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e050d6f609229907452d1f29192cb9a77d2fea55650d42263bac8697ca5735"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function supportedOwnerPath (cyclomatic 13, cognitive 16): supportedOwnerPath 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/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d8f6cee9a6573af6e69be34c9fd3ad5093725a0126d52b7f20559b07b7df9d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runMcpCheck (cyclomatic 13, cognitive 16): runMcpCheck 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/create-agent-harness/src/validate.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e8d244ea48368a1bb8cfd6bcdbdf6b4a21002ed2a027599c4851fe9b33647f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 16): (anonymous) 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/flywheel/src/production-gate.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3547bec2325585e2ea2d76b56eb8146c6e698a91a1eb2106be0c64df4ff024"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function probe (cyclomatic 13, cognitive 16): probe 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/jujutsu/src/capability.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f33f88a4ea656bea8965b8b617bc1744b4b0e58bb80bfce4850470551a973fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verify (cyclomatic 13, cognitive 15): verify 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/evals-extract/src/verifier.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e89bfa00304cdff99967e4819a33abc98b7b94c584d163b599b3321182ea62"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateReplayBundle (cyclomatic 13, cognitive 15): validateReplayBundle 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/flywheel/src/validate-bundle.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"724de42102775678801f2cdce8dccff31afefe0de4ce8e17e6578d634d8765d1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runLearningLoop (cyclomatic 13, cognitive 15): runLearningLoop 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/projects/src/learning-loop.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c65842619823b8875d6f750c1ac462d660886c686d4ff1de0c4d21b24bffa5c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectLeaks (cyclomatic 13, cognitive 15): detectLeaks 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/projects/src/trace.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2848629695a2a06026f9256bd62a9273eec70342c9d153c175917b32277277"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertRawObservation (cyclomatic 13, cognitive 14): assertRawObservation 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/arc-agi-3/src/canonical.ts"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6538b15ad8f89ef26203cc9b90aee1bd5d758cd124e2ea206f584abedf75926"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function publishHarness (cyclomatic 13, cognitive 14): publishHarness 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/create-agent-harness/src/publish.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2e009065c5280153f27e026fc17726ff60558f7a637f77d1f4fb3f1ab0b1d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sbomCmd (cyclomatic 13, cognitive 14): sbomCmd 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/create-agent-harness/src/sbom-cmd.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dadbb9131eb7a031e6c938d0e2241f64f239043587c7cf245089c1f132ab4ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verify (cyclomatic 13, cognitive 14): verify 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/evals-hle/src/verifier.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"22bda4084368b9495d150a8940c69c30ce530d0c1ae26919c9510220c62394f3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resourcesOf (cyclomatic 13, cognitive 13): resourcesOf 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/aws-finops/src/infracost-adapter.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0cb453588b5eaf29e62698d581126d1a13cbb031e30927ed77a7e382d2df342"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyEdits (cyclomatic 13, cognitive 13): applyEdits 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/darwin-mode/src/contrastive/validation.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c213fb64387c34d23df161543b6348cb588f2247f1d47e223d02e95cadd1d1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cmdHackerOneSubmit (cyclomatic 13, cognitive 13): cmdHackerOneSubmit 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/redblue/src/cli/index.ts"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d5bf271bd2b42d492c416c508812da5367fbaa8c49ef972cbd0c6c1f1c4390"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateChatBody (cyclomatic 13, cognitive 13): validateChatBody 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":"services/apicompletions/src/routes/chatCompletions.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"48151e2dc9a03e6b620ba428b59f061d43f4d5c4c83b827e29251471def6e67b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildOiaManifest (cyclomatic 13, cognitive 12): buildOiaManifest 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/create-agent-harness/src/oia-manifest.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"552711f69b23b09d6351fd77ad3fecd4a28fbf0eb5a5590115925a93a0b37a01"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function spawnIsolatedDriver (cyclomatic 13, cognitive 12): spawnIsolatedDriver 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/darwin-mode/src/tier2-sandbox.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d98b938165d92977532bd8a2b2af000409fa47458ff7be6975e91f92e8bafd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function replay (cyclomatic 13, cognitive 12): replay 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/flywheel/src/cli.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"955711e70ac20c0e8b07ae16787d93643ed637b3a79bec6bb2d6b34f35404f14"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function snapshotArray (cyclomatic 13, cognitive 12): snapshotArray 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/flywheel/src/review-context.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3eabe0c45323ae023a88f3f4527b5a8985f28fb007159ff93c6205187bc5ba4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function processCmd (cyclomatic 13, cognitive 12): processCmd 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/turn-credit/src/cli.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"f25783655ca177dcea33a2a8ee5a68ea7fa4ac787c2e34ab4edb4771e9849dd6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildMetaEntry (cyclomatic 13, cognitive 12): buildMetaEntry 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":"scripts/marketplace-entry.mjs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08ba40c84baa16df5dfb2aaf4a3de1411535cc1c3aaa73e480b3fc7565f3cdb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergeRoutingControls (cyclomatic 13, cognitive 12): mergeRoutingControls 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":"services/apicompletions/src/core/http.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"831f62df8e3223813c474d04094f22a76d660a2d38b1d35174f6c58c5b80d814"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeDifficulty (cyclomatic 13, cognitive 12): computeDifficulty 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":"services/apicompletions/src/router/difficulty.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"849ed14ee90103e3e6b8f8f0bce692423c1313648eac3142f42146b5269be4e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validatedScorecardOptions (cyclomatic 13, cognitive 11): validatedScorecardOptions 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/arc-agi-3-chatgpt/src/official-factory.ts"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"2107300cbb9f124f2200c4e6c79d572b52cc9c376d7253beb9965740ae2e4340"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #handleResponseLine (cyclomatic 13, cognitive 11): #handleResponseLine 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/arc-agi-3/src/python-bridge.ts"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b4d26a047680b5a915cd7f3f91c1ecc6a5386f74513a776ff4602f2644b20db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #sanitize (cyclomatic 13, cognitive 11): #sanitize 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/avo/__tests__/openrouter-live.test.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"435a442ae1a35a2c38a802251c56be55011a407b79c7ba55411fb472a7d243ea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function provision (cyclomatic 13, cognitive 11): provision 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":"scripts/tbench-gcp.mjs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93f4729934b557677c4bb713d083fe00b04b5c70e36529bc5f0f809a033a96d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateUpdate (cyclomatic 13, cognitive 10): validateUpdate 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/field-memory/src/field-memory.ts"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"b87728fc9d16056c4a9641da30f80d73fc24d6445eeaed1aad8eab0478603e97"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 12, cognitive 21): run 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/darwin-mode/src/security/semgrep-oracle.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"37bc8ca78306257f6dfe6ebdffc653a4e0c72d0ad70a16c4ef38d99b143b2358"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateSpdx (cyclomatic 12, cognitive 21): validateSpdx 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/sbom.mjs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b86564491823b36fe665edb87a3013636edbef928f8917b52c889e112894e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function heuristicClassifier (cyclomatic 12, cognitive 20): heuristicClassifier 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/evals-hle/src/classifier.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"a101ed62bd286b3e60b2fbfd2e7347e0315d4387f9a8d4c14d9ba82f645ba2ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cliConfigYaml (cyclomatic 12, cognitive 17): cliConfigYaml 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/host-hermes/src/index.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"75fc8f695248e00998ca6f133cec25ce867f2f4593eefc7ba9df13f02c61cff3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reportCmd (cyclomatic 12, cognitive 17): reportCmd 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/turn-credit/src/cli.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c92114d45e57454c73f4092485c5602303834d29f2aa3e5d0609c3998c78dbc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function replaceEffectiveMetaProxy (cyclomatic 12, cognitive 16): replaceEffectiveMetaProxy 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/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"23258d37c829083a539701728030824ab8394b853546847a0daa33f04a5f759e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bootstrapDelta (cyclomatic 12, cognitive 16): bootstrapDelta 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/darwin-mode/src/security/stats.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f332bef652dcb9f10d83c893703ccaa22ced5441eb71fecfa623189525da06"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadGsm8kFromHub (cyclomatic 12, cognitive 16): loadGsm8kFromHub 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/evals-math/src/data.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c861b17fcaf84ee27d6be0a5afc06980483f7f9093b2a754df3fd1b7556a7ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractJson (cyclomatic 12, cognitive 16): extractJson 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/redblue/src/judges/judge.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad44cfa3dfe65494edb6db6bb35af0e4e62b066a1a831fbe364a0a6f85bd170e"}},{"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/arc-agi-3-chatgpt/src/store.ts"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"371d48dfe351a403f200789944dd3dffa52aa42b2da7829b17c23929701d3d79"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateGeneratedShieldCode (cyclomatic 12, cognitive 14): validateGeneratedShieldCode 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/darwin-mode/src/security/selfwrite.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea518a2bb1bd97cc0a857bd3bedf207e15218450fd63f35a815690b040ee681c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verify (cyclomatic 12, cognitive 13): verify 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/evals-math/src/verifier.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e9561ffea34293f682ce3143f75cc9c3129649eec8f4a82475455107e0110c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verify (cyclomatic 12, cognitive 13): verify 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/evals-toolcall/src/verifier.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb247a178386b2e63e4f7a2966a4480d7a46f8619b2bbb5204ab9f8b935d523b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function snapshotRecord (cyclomatic 12, cognitive 13): snapshotRecord 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/flywheel/src/review-context.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5073e036ab4f6e1adecbfaecdfca73177aa95b87267d32c11497ac36ae1b0e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sequentialEvidence (cyclomatic 12, cognitive 13): sequentialEvidence 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/flywheel/src/sequential.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2db5731f78aa96a0ad3d7a8df9784dfcc638a02c1c6f2903eea07c297cf1ed8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildUltralite (cyclomatic 12, cognitive 13): buildUltralite 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":"scripts/pareto-from-firestore.mjs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe1b3cc2d357437bd8e4e778a227555c88ee2706f516c90dd8107483f38dd4d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function simulateRun (cyclomatic 12, cognitive 12): simulateRun 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":"experiments/signal-flywheel/config.mjs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"d508ec0fb0d8048da72c4dcbd187753897c5f5576f52b2e7cbfb0edf3da365f4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validatePostcondition (cyclomatic 12, cognitive 12): validatePostcondition 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/arc-agi-3/src/plan-archive.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"e029221e1670b707391d59e4bf9d146f5936f220287b0879e4bd1bcb0f7d065d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stopMetaProxyService (cyclomatic 12, cognitive 12): stopMetaProxyService 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/create-agent-harness/src/meta-proxy-service.ts"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5911dff0781f3d205861f4943a2ca1dbed1e3dbf94e592a38edfaafd021d8f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runVariantTask (cyclomatic 12, cognitive 12): runVariantTask 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/darwin-mode/src/sandbox.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c58dff39f91125cdabddfb60185846a17fd9a79a4ddff256d79e5929539d1d1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function repositoryFile (cyclomatic 12, cognitive 12): repositoryFile 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":"scripts/avo-claim-gate.mjs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"db0956804538e5a29aaaeaf6780b80b142a7b0fac4c0af75ae4cb73d5122eb80"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 12, cognitive 12): main 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":"scripts/dev-toolkit.mjs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e653c0e9af7f74ef8006205427743367d98b40667f3eca441122be03f97e1cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateCasaEnvelope (cyclomatic 12, cognitive 11): validateCasaEnvelope 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/agntcy/src/casa/schema.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc8f5d05337085ccb9f8f9a0cb259999ea4a6656de7357d7db90b6d45ee71db6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateAgntcyIdentity (cyclomatic 12, cognitive 11): validateAgntcyIdentity 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/agntcy/src/identity/schema.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c7ba4ae2df652589042fcc69d2096eb0f55e01fdda2f09de7c03a29e51d48a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchesPostcondition (cyclomatic 12, cognitive 11): matchesPostcondition 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/arc-agi-3/src/controller.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ebde4c9c031896447ed26dab5f6b061d5899114380353341618da421d86f15d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function memoryRecord (cyclomatic 12, cognitive 11): memoryRecord 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/avo/src/operator.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"47dbc91f6adbbafc4d477b8813a8f482188fdf5337741c82871f5702740ac7ac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatGenomeReport (cyclomatic 12, cognitive 11): formatGenomeReport 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/create-agent-harness/src/genome.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"556fc3eed941148d304dcf3e0da06939d5f8e34719c9e7f0d7eefef145e048a2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rightsFromCapability (cyclomatic 12, cognitive 11): rightsFromCapability 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/host-rvm/src/index.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e16865a6b0fc86bbec794550483f53cbb11a3d810baa7bdec57800da84f79aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createRvfBackend (cyclomatic 12, cognitive 11): createRvfBackend 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/kernel-js/src/memory-rvf.ts"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeeb50f57d97aa1eac0ab51aca72ec740d546b472965d6b5ea81a51cf9e43b96"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function complete (cyclomatic 12, cognitive 11): complete 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/redblue/src/models/openrouter.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb8c9d87ca5ce4e530939f87c29d88cc4f0915938a783eb7cec22eb4486a87f4"}},{"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":"services/apicompletions/src/budget/firestore.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"2425e6e115cbefd460d74dbd3f44eb479f65920ac9d67bf0a18fba78a91f00fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadConfig (cyclomatic 12, cognitive 11): loadConfig 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":"services/apicompletions/src/config/index.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bfd403208e7e185970637751f07b46491ccfb89170fdd74e13878a28da3a7bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function publishToDirectory (cyclomatic 12, cognitive 10): publishToDirectory 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/agntcy/src/oasf/publish.ts"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"76afbca0f5bff6ff0bba8cd027564838cd1b98b02d385b83c5a5503ae2465081"}},{"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/arc-agi-3/src/controller.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"223039d6a554319ea8cdac79e407dc3f92dc73cbf3586c1736f2d2d588a76fa5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifySignedPayload (cyclomatic 12, cognitive 10): verifySignedPayload 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/avo/src/claim-gate.ts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f1fef2a17772b3bd721a15e9f1ec7804c18fe5de4f3a296df2b19b5816f62c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function appendLocked (cyclomatic 12, cognitive 10): appendLocked 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/kernel-js/src/session.ts"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b68de9df64c8028076f06fb2b4a4210961414de4b2ade390f8132129ef7f05f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 12, cognitive 10): run 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":"scripts/release.mjs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe4fd05dee9422e8b88a24e3a39c46b5d9bad0588fcfb3abb1dc7686ecb9ba03"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateArcRunBudget (cyclomatic 12, cognitive 9): validateArcRunBudget 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/arc-agi-3/src/canonical.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb5b9b9eb19e58c99ee12c4121c41d9e19bff76d33226c95c92e79b4e257a03"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkConstraints (cyclomatic 12, cognitive 9): checkConstraints 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/create-agent-harness/src/constraints.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"4abdcd0d83fb100bb1cc91d7f9305cf1df7fbd85ef6dc9d9522788ae0b39f1de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function supervise (cyclomatic 11, cognitive 22): supervise 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/gcp-cluster.mjs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9dc9f18ab953e28fb439a186a421bc37f265cb7e0ec461e25a561bf46b1c295"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseYaml (cyclomatic 11, cognitive 21): parseYaml 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/redblue/src/config/loader.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"9230786dd39b533ea753ec677ad25966bcbf960354768af02c8d469895a8b30b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function uiCatalogTs (cyclomatic 11, cognitive 19): uiCatalogTs 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/create-agent-harness/scripts/gen-templates.mjs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad92bea959ed18a3fe3eaa6751b02dd785144b9b3afbe9fa7145b317b0f88f3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function heuristicClassifier (cyclomatic 11, cognitive 18): heuristicClassifier 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/evals-extract/src/classifier.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"97274037c6c2b4d0436d91c3af862d5b0adf81d6b2874823e36728a0bbbafa7e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #onStdout (cyclomatic 11, cognitive 17): #onStdout 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/arc-agi-3/src/python-bridge.ts"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"7972b2cd353afa92d923f991f8915eeca5a97bc31a27248b04a66df0148ca94e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createCrossoverVariant (cyclomatic 11, cognitive 16): createCrossoverVariant 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/darwin-mode/src/mutator.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ec839efefbc9eaf636bb8bd2792fd5b4bf9e97c86190eac59ce25a0c876bd9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractJsonSpan (cyclomatic 11, cognitive 16): extractJsonSpan 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/evals-extract/src/normalizer.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b35fa7c63eebcaa8799f40125339a316afd330248ef38f3610b5b1fecaa59a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runAgentic (cyclomatic 11, cognitive 16): runAgentic 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/oo-agents/src/agent.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"a528fb232bb08952b3490a02298db3aca1a2bf123c3224edb0980a3ac1eea749"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildExportedConfig (cyclomatic 11, cognitive 15): buildExportedConfig 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/create-agent-harness/src/export-config.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a8f27014dbc6655450ba4cc93ecd0b7a207f46a4a0f3500d03a18e464d3ca73"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writeAtomic (cyclomatic 11, cognitive 15): writeAtomic 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/create-agent-harness/src/writer.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b633c0794979eb58ccf5f873193248cbf4afb5a2736a135afb2ad5423d1ddc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function expectedPredictionError (cyclomatic 11, cognitive 14): expectedPredictionError 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/arc-agi-3/src/receipts.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e790ee3f77ad59414b6b8a4879c5d38481a5fc5391d1468572aaa1d823d94bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pickEfficientWinner (cyclomatic 11, cognitive 13): pickEfficientWinner 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/darwin-mode/src/evolve.ts"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"8402404e9ca40d59755ec7914e4002925c1629c56eafab1e189d8b64ab8556e0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scoreFindings (cyclomatic 11, cognitive 13): scoreFindings 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/projects/src/cve-corpus.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0497e583b7f34206a210c7d0718d294c536b8586dbe226862668e4c855c9a2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 11, cognitive 13): main 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/healthcheck.mjs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"b778b33e7fd13f337d188ba3732d8175022de3385c47ae58ae1554a7ffd2d67b"}},{"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/arc-agi-3-chatgpt/src/store.ts"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"585a2fa0aae2d75d26011dd4ba5391ee56f27b318d12f376e37384299a9f9f1c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildLearnArgs (cyclomatic 11, cognitive 12): buildLearnArgs 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/create-agent-harness/src/learn.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e00ef26f3bdbeba0e700615614e70f9d9448eb9c437b07399fe0e4863938116"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function summarizeFailedTraces (cyclomatic 11, cognitive 12): summarizeFailedTraces 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/darwin-mode/src/mutator.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ee7ba19e41229b2a23346e9f572f1878ba7017371263f2fab5b5a71f6a9330"}},{"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/field-memory/src/ruvector-storage.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ddaa576c68b3aef6dba5ed80d28f3be34130db4bda0ae741724d46f52d21e72"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evolveDiscoveryPolicy (cyclomatic 11, cognitive 12): evolveDiscoveryPolicy 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/projects/src/discovery-evolve.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"06694713e7efde09184385b8a3a18d643cbdd0f0f0efb2319a7840e30d557070"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveTier (cyclomatic 11, cognitive 12): resolveTier 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":"services/apicompletions/src/tier/resolveTier.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"4425f4676f36f4f4cd720e8baed1e6ff2061b8dcf56c2f387ba5281c748664b1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertPlainReceipt (cyclomatic 11, cognitive 11): assertPlainReceipt 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/arc-agi-3/src/receipts.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"e561a8b979fd435502f1d4303a564ec88ef5677be946bdd1c9da529a3b8ef250"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runThroughMetaProxy (cyclomatic 11, cognitive 11): runThroughMetaProxy 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/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"61efd0a2be025214c79b5584eb394238f76ecd72c33584157a337b8cc85f20e6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function chatJSON (cyclomatic 11, cognitive 11): chatJSON 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/projects/src/openrouter.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f54c373e93a8983340636770d06ef3064283460a1888736e9ed54afcf46273"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runNpmAudit (cyclomatic 11, cognitive 11): runNpmAudit 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":"scripts/audit-deps.mjs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e072440e6e43ead8fc108213af126a4bd9c35b9f830952c8897f7b6508f76c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gateOnly (cyclomatic 11, cognitive 11): gateOnly 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":"scripts/nightly-sota-review.mjs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"307b7e5e83b846e25fe9161a7a600183420bba3ab0e3955d77168ada4a631997"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #verifyCheckpoint (cyclomatic 11, cognitive 10): #verifyCheckpoint 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/arc-agi-3/src/avo-loop.ts"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e02537add553830c60e2074b3701e2dd59f4fa5ec410214d88a38d24973456"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyTransitionReceipts (cyclomatic 11, cognitive 10): verifyTransitionReceipts 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/arc-agi-3/src/receipts.ts"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1edeee6dacb32d96b02d9a04cc6dc6a88f834d3bfcfc74b6ed714344d718cfd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function denyRuleBlocksEnvRead (cyclomatic 11, cognitive 10): denyRuleBlocksEnvRead 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/create-agent-harness/src/mcp-scan.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7ed4a7c9418a971e7d18aacb6222477fc5cb9159a6fc078f586c39813a61ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readHarnessProfile (cyclomatic 11, cognitive 10): readHarnessProfile 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/create-agent-harness/src/oia-manifest.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b2f71e42549142cebec51525ba06b9c5a9dc6ae24ae8787b417993f8092c9d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function litValue (cyclomatic 11, cognitive 10): litValue 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/evals-toolcall/src/normalizer.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43e0783e226aced574eef3ef51c7482571edb95a2e344c0ce4c103ba66572e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function installRunbook (cyclomatic 11, cognitive 10): installRunbook 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/host-github-actions/src/index.ts"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc564459dba81ff70bfdb59f4c40f4a65ce6efdf632962e8836daa60108d895"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateConfig (cyclomatic 11, cognitive 10): generateConfig 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/host-prime-agent/src/index.ts"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8965c1db6eaf3fb3298dda2a8c51b5a673e2f0e9239263cd3d2c3af6b3d82b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readCache (cyclomatic 11, cognitive 10): readCache 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/redblue/src/integrations/h1-cache.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"45bb0f4ab059cf6a1a8b7b06020e6566a4799421e084060c72d95dfd15417270"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function severityInputsFor (cyclomatic 11, cognitive 10): severityInputsFor 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/redblue/src/runner.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d44d0d32d7f5db33d5491e4398c2cfd638d637f5c17fb07ac5197c7691941b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function plugin (cyclomatic 11, cognitive 10): plugin 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/healthcheck.mjs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"2176d2dd3f324b7ac174e5c649106e2654d4ad010ecd6e5af9a36aa7a33273c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function liveProbe (cyclomatic 11, cognitive 10): liveProbe 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/verify-harness-live.mjs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7d5399c24ca6e110f11b633ef5f489f3a84c15237b2ddbfce961161eccf3f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function defaultDeps (cyclomatic 11, cognitive 10): defaultDeps 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":"services/apicompletions/src/deps.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"56830b7fb354a625ed18586e8e4a513704427ca017118007eb271500659a9de2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function plan (cyclomatic 11, cognitive 9): plan 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/arc-agi-3/__tests__/avo-loop.test.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"19931e752dfe1bbb9b8c57bb4f996c1826d01ce09280db208999596f5511e335"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateCandidateDraft (cyclomatic 11, cognitive 9): validateCandidateDraft 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/arc-agi-3/src/plan-archive.ts"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"cabcaed4096f81bd8ba347d3043290e3d762997f640604b27792dfc9bbd5ae70"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function append (cyclomatic 11, cognitive 9): append 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/arc-agi-3/src/world-model.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2a5c69fc21f069f91ffbffc3f4631876b1a8b71224a945f20c9071c26e79b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scorePublishReadiness (cyclomatic 11, cognitive 9): scorePublishReadiness 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/create-agent-harness/src/score.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"d639fc4f64c2baffcc6d61ca71c7a165c082fd142f92a57a9156e16bea27e38a"}},{"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/redblue/src/config/loader.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"079f8afeed281e77a847d1376b428a3ed887ea42b09d1d131c3d6221c45eddd8"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/arc-agi-3/src/controller.ts: 1437 lines of code: packages/arc-agi-3/src/controller.ts has 1437 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/arc-agi-3/src/controller.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b00986eec79bf3a5e536323134a14e11fb08ac585a4d942456b7ad9f201ed874"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/arc-agi-3-chatgpt/src/store.ts: 1270 lines of code: packages/arc-agi-3-chatgpt/src/store.ts has 1270 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/arc-agi-3-chatgpt/src/store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26509a34cab2c636e140cf02bbc1b445b3c4e8215e932d25c518a78d9d74638"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/field-memory/src/field-memory.ts: 1209 lines of code: packages/field-memory/src/field-memory.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/field-memory/src/field-memory.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ed0073450e853ce4416b537e80dc460857622402c56b89ac6c35999545b304"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/create-agent-harness/src/index.ts: 1189 lines of code: packages/create-agent-harness/src/index.ts has 1189 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/create-agent-harness/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d0aaf5c7f18a4cc2f227cd17365e9f95fde7706e9a54ca0647a2401f9cea65"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/arc-agi-3-chatgpt/src/official-factory.ts: 1188 lines of code: packages/arc-agi-3-chatgpt/src/official-factory.ts has 1188 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/arc-agi-3-chatgpt/src/official-factory.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c23a1757776c91e5d6f911d62fe995b99ba427dfc10e431c43d024c0119046f"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/arc-agi-3/src/checkpoint.ts: 1093 lines of code: packages/arc-agi-3/src/checkpoint.ts has 1093 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/arc-agi-3/src/checkpoint.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ca9fab1aa44926d9ba6b1251e78604f3668a02b68152fd9fd2ee58cedb28fd"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/arc-agi-3/src/plan-archive.ts: 1026 lines of code: packages/arc-agi-3/src/plan-archive.ts has 1026 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/arc-agi-3/src/plan-archive.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d330986842b8fa9e2c7cb2d3235c4dbf2f17518c2c26adcce3cf7d01142195"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/arc-agi-3/src/python-bridge.ts: 906 lines of code: packages/arc-agi-3/src/python-bridge.ts has 906 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/arc-agi-3/src/python-bridge.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aafd4870ae0c14d336de0e1b46635b5df36d32b977877d384d0ab682051c63bb"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/radio/src/sim.ts: 872 lines of code: packages/radio/src/sim.ts has 872 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/radio/src/sim.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"acfbc6564f536fe2bf5df461d0388d94d324eb6b003cacf4386de0fcce8aa762"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/arc-agi-3/src/canonical.ts: 843 lines of code: packages/arc-agi-3/src/canonical.ts has 843 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/arc-agi-3/src/canonical.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"033faf3b5443bb4d34bc8f41a7cdfc07dcd2ea83e83b79e242360ed12c582fcd"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/redblue/src/integrations/hackerone.ts: 838 lines of code: packages/redblue/src/integrations/hackerone.ts has 838 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/redblue/src/integrations/hackerone.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69be640288d44e6033d7a0aa52d6add3a76ff6438be6ade255a57e4ab730a8e0"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/arc-agi-3/src/avo-loop.ts: 806 lines of code: packages/arc-agi-3/src/avo-loop.ts has 806 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/arc-agi-3/src/avo-loop.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6759ee3ba987ff3de23f11642fb0784858f9a590368865017d8baaf39f2bba"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/create-agent-harness/src/meta-proxy.ts: 806 lines of code: packages/create-agent-harness/src/meta-proxy.ts has 806 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/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b811f43b940c58919607195c22db52bef49e04d94e8cb4c68f27d278ca507b"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/create-agent-harness/src/meta-proxy-service.ts: 794 lines of code: packages/create-agent-harness/src/meta-proxy-service.ts has 794 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/create-agent-harness/src/meta-proxy-service.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d23077471d9e5ad946f7b3ab029420f8939cc021ae121a21327b485c52600e78"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/avo/src/operator.ts: 748 lines of code: packages/avo/src/operator.ts has 748 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/avo/src/operator.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d14d565a9a144c25505a486944b3f48b897bf0b4a289aed6ad40f7caa54114"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/avo/src/claim-gate.ts: 712 lines of code: packages/avo/src/claim-gate.ts has 712 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/avo/src/claim-gate.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70017ab1aec1a410158084a144943a262a55096f7d0e3a02dcfe7a7cf6304162"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/arc-agi-3-chatgpt/src/tools.ts: 685 lines of code: packages/arc-agi-3-chatgpt/src/tools.ts has 685 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/arc-agi-3-chatgpt/src/tools.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e08be354488eb8c668b60bc20b4ee8f0e0d645790728746683522cc9c4be3df"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/darwin-mode/src/evolve.ts: 619 lines of code: packages/darwin-mode/src/evolve.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/darwin-mode/src/evolve.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a7bd2c8ed60a00846f627a5f18d7b487e5c2a2a4a19b503a59dc40fc1116f00"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/arc-agi-3/src/receipts.ts: 591 lines of code: packages/arc-agi-3/src/receipts.ts has 591 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/arc-agi-3/src/receipts.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb3b79110edcd80c033f9bd57735474a2cbf299763e932bfa3430202dd14dae"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/arc-agi-3-chatgpt/src/server.ts: 580 lines of code: packages/arc-agi-3-chatgpt/src/server.ts has 580 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/arc-agi-3-chatgpt/src/server.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddcffbbfe3c77ca2ab007fe41af61cbe0ca3c6d88f8a0344d30f81a9eab6135d"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/arc-agi-3/src/types.ts: 552 lines of code: packages/arc-agi-3/src/types.ts has 552 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/arc-agi-3/src/types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4abc9da6f4efd2f657d0fc51ebb7d749f5938c020cc673cda5c7e6c90d455f7a"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/redblue/src/cli/index.ts: 526 lines of code: packages/redblue/src/cli/index.ts has 526 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/redblue/src/cli/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"906832aa1e9d2bfff6ffba1a6177b3e49773b4ef1e2285d0a4b5797d4a9a5621"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/oo-agents/src/pod.ts: 507 lines of code: packages/oo-agents/src/pod.ts has 507 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/oo-agents/src/pod.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"abacd57ad1ea089f34832ca4c76716f117d428c98f20ef04abb49abdd2cbaf50"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/host-prime-agent/src/index.ts: 481 lines of code: packages/host-prime-agent/src/index.ts has 481 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/host-prime-agent/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d7f5156712d781db5c3fcf17a8d5fbc064fb0cfbfcbfcbb76d1f21471cb7e9"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/arc-agi-3/src/memory.ts: 479 lines of code: packages/arc-agi-3/src/memory.ts has 479 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/arc-agi-3/src/memory.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"382c70e39da40576129b57d4588122a97ea7fb1894e6d6188445bf7b77a005ba"}},{"ruleId":"R3","level":"warning","message":{"text":"apps/web-ui/src/generator/scaffold.ts: 477 lines of code: apps/web-ui/src/generator/scaffold.ts 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":"apps/web-ui/src/generator/scaffold.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1efea514bbd9cd8ce337133f5bd02da53c3815e4ad50578b6f3ce813e50d4b"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/create-agent-harness/src/diag.ts: 468 lines of code: packages/create-agent-harness/src/diag.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/create-agent-harness/src/diag.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f653a9880856ff4bcfa8d3c96fe1e30c9b1a90bd1f00f39afbcf9d5d39a948"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/create-agent-harness/src/score.ts: 441 lines of code: packages/create-agent-harness/src/score.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/create-agent-harness/src/score.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf4c762436d9c8f36776ec5daf69ac0c1df6cd5d26b911395213199aaea98b66"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/kernel-js/src/memory-rvf.ts: 429 lines of code: packages/kernel-js/src/memory-rvf.ts has 429 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/kernel-js/src/memory-rvf.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ff800f62b583175a43b3fa463b8a1a0d980ae28641ddd93c8b5d017350dae69"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/arc-agi-3/src/belief-graph.ts: 427 lines of code: packages/arc-agi-3/src/belief-graph.ts 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/arc-agi-3/src/belief-graph.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78f7c11f1579fd0dc8e85da49d877cb6e8025c767271a8f50875563d71234c3"}},{"ruleId":"R3","level":"warning","message":{"text":"services/apicompletions/src/routes/chatCompletions.ts: 414 lines of code: services/apicompletions/src/routes/chatCompletions.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":"services/apicompletions/src/routes/chatCompletions.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd85de757d6e3f39b17cb0d7bb6980ad54b38feb675901923b5c04bbf4c0f6aa"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/agntcy/src/oasf/publish.ts: 404 lines of code: packages/agntcy/src/oasf/publish.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/agntcy/src/oasf/publish.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bbd2d0b9e08c58671b72372aae2103cb82d7ba63d54be45041c5048bfb54106"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: packages/kernel-js/__tests__/memory-rvf-metadata.test.ts:152 imports \u0027./fixtures/rvf-0.4.6\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/kernel-js/__tests__/memory-rvf-metadata.test.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7bd8406d06f74d6c58e32db09ca008807b2e8769889a048f093d92f44839d73"}},{"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/create-agent-harness/templates/catalog.def.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d79a5ba1b8aa8b66f73edac957261b70e6e389b282c09bb9128d3aa588fa7c"}},{"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/create-agent-harness/scripts/gen-templates.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5334485fd8600f463077330d233c701003e0ac39b3c373e37ece3cbb32be85bf"}},{"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":"experiments/router-calibration-loop/lib.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"104dfa10e5de606d946db594435f691653072af1e2718afe4a8b988f6a94c713"}},{"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":"experiments/turn-credit-acceptance/lib.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b0c0d2463d5c8ee18cdb0639775eab973ed3443879dbc75cb39c50597df5cf"}},{"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":"experiments/signal-flywheel/config.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd968676e3625e4cd05ec74463b10c3c91ea5e5c892027cfb04badefd83e8af"}},{"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":"experiments/user-awareness/probe.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"820d6b88f3408d12988e8ac8aff714202c1663d1d28cb10e9877cb110c2c6131"}},{"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/radio/scripts/flywheel-radio.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c81a11e7f824f96873f2f6e768f96b6b0aac62dd16c35de9eb5ab7c6caa543"}},{"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":"experiments/credit-feedback/lib.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a3ae446a9d53f915f7682b5246004c31de0d388de5002491071aad0e403c68d"}},{"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/weight-eft/src/types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f14f6a8c8e5bcdfd9376e164030c31977f156339d1c6ce819aca8724bdbfa011"}},{"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":"services/apicompletions/src/budget/firestore.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cfea44f36a80291b370e5355a9efe6cc8f64fa53177244f3ddd23c7136bfde0"}},{"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":"experiments/signal-flywheel/run.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47aa1d1b7ff44d2b6a54854c76e81195db36caea07df3113d9cd13cc1c5461dc"}},{"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":"kimi-k3-harness/scripts/flywheel-evolve.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa81d4a59542338a8b897b276043ecf712dd12cc6b4b5f74273142a08bc6d737"}},{"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/agntcy/scripts/generate-oasf-taxonomy.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a77a17fc1348c66e333bf546fbb874a2aeeb20188b786892bae15b14869fd94a"}},{"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":"experiments/user-awareness/models.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e72dc99a917ceffac16c25f86b0299c5fa7bbc898f5ac628fb58bb5e70709e4"}},{"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":"apps/web-ui/scripts/screenshot.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a8837ddbfa00fac34b4b8cd0cb83ba03296349f6738445e85c58bf46a568df"}},{"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/horizon/scripts/demo.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7844c42b6f285fa7e19b494e45b6de2c15e7e5765a5d61f4875cf54d7fe1fe1f"}},{"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":"apps/web-ui/scripts/make-og.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a0505a381db8227820617cf76c88a5455ab8ebe8f8ad45d1d367d269e193b29"}},{"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":"experiments/router-calibration-loop/run.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"532a863f2b0c3e323b32400ccc881707e5bfec2c726283e1761c4ec172655106"}},{"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":"services/apicompletions/src/firestore/client.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a986baa1c37975614a3611da7692e47331b811189c39cb819cd4efd4a562748"}},{"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":"experiments/turn-credit-acceptance/run.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c37af3c3f7874a6408ebdb86cba453462094107e9988c729cd5403818f293b"}},{"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":"experiments/router-calibration-loop/assert.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9947e878eb452dc7d424c648ce557ba127aa7fa6a53edb88dc660e23fb0288d4"}},{"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":"experiments/credit-feedback/assert.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8449c90ea1c06608ba81bf862754bbaafced8b1fa24be994ec2846e21739254c"}},{"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":"experiments/turn-credit-acceptance/assert.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30aaf20da8d476fe70bd7115203df4399ef417a27047167589b6496d2efb5c76"}},{"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/flywheel/scripts/reproduce-production-controls.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e48b9c6c8f23d85fb46f5297dabfa99061266a3577a809205de6b97953ab4a3"}},{"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":"experiments/signal-flywheel/verify.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b422c3dadd930b221c8830821700e9a9a7db1a28f1777cf37683ef9d82ddfc"}},{"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":"experiments/credit-feedback/run.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4f89086317b7b5a45945cee51c346a4d0a0b351ae5fc9fee33f03ffcc2d96e"}},{"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/aws-finops/src/binaries.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"821865ff2f892e7c5085e8ceda8ea20c5b2d080795dfcf06eecb2890332ef7e9"}},{"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":"kimi-k3-harness/scripts/build-wasm.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f47c54809687b3b2cf3db39adfe282e49ec1d745c7493d73a62e4ba73edfed31"}},{"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":"services/apicompletions/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6c3a8e825d1c57e2b8b6313751956807c8d5737be3db40e93fea341417c97d"}},{"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/horizon/scripts/build-wasm.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bfbf9b47383dac916b619e8ae5737c6c77d302174d07ea183aa03c3d5a5c691"}},{"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/oo-agents/scripts/build-wasm.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5affc3499a4e4aa407800f3df799a2e34b98cf0a9366f1b06decb32e843c1ee6"}},{"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":"kimi-k3-harness/src/agents/architect.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b63cf9d2f18e42200314f553c26c436350fedc2264c0c6f1a9d43b1fd7e7852a"}},{"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":"kimi-k3-harness/src/agents/implementer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc061266e1cffa4328cc7bad595ff21fb6fe6747303bbd03b007972c2eaf9d9"}},{"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":"kimi-k3-harness/src/agents/reviewer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03138dd46a9b400cc5413613682cd2f48f81ef3f9212be73c12a5f23d4b703af"}},{"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":"kimi-k3-harness/src/agents/test-writer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a81b7b405400a548acc462950d61a1f48f3bf1ac183eb53b765e38e6123703"}},{"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/workspace-probe/bin/workspace-probe.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7dcd3634fc53611c9b45371f70cb7a1fcbac1d355e789f1d4aaffd8d4b48a04"}},{"ruleId":"R6","level":"warning","message":{"text":"The declared test suite includes a file that cannot be loaded: This repository declares test tooling, and the \u2713 above records that declaration \u2014 but packages/kernel-js/__tests__/memory-rvf-metadata.test.ts cannot be loaded at all: it imports a module that names no file in this repository, so the runner throws while collecting it and none of its cases execute. The wiring is present and the suite it points at does not run as written, which is why the tooling tick must not be read as a statement that the tests pass. Fix the unloadable file(s) \u2014 each one is reported with its failing import under Test Coverage \u2014 then the declared script exercises what it claims to."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/kernel-js/__tests__/memory-rvf-metadata.test.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5ddee294af7f000c6ebbd7c4405bbc190c0700d7686d2641cfe7b6bdc870da"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~448 LoC): no import path from any entry point (449 application, 123 tooling, 461 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (packages/darwin-mode/bench/ruvector/h3-code-localize.mjs) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/ruvector/h3-code-gate.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff40a6b08fac3f6ce3a56dd2d9c8df1b9743e812d1573aa26efcb6bb4ea885f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~354 LoC): no import path from any entry point (449 application, 123 tooling, 461 test roots considered), but 2 in-repo import(s) from 2 other file(s) do name it (experiments/router-calibration-loop/assert.mjs, experiments/router-calibration-loop/run.mjs) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/router-calibration-loop/lib.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"603dc0760850189d152d52dd1dc1808a62fa4a1e4410957db15f07823f4bd83c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~353 LoC): no import path from any entry point (449 application, 123 tooling, 461 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/darwin-mode/bench/livecodebench/solve-lcb.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2bbfd5c3a14b5ce0fe4ce7078ceb8f378c9311a2e5b5da6fb21c2acba4ca08a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~266 LoC): no import path from any entry point (449 application, 123 tooling, 461 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (experiments/signal-flywheel/run.mjs) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"experiments/signal-flywheel/config.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77190f318e59c0e1dfb78e0559359a474df927c92bdb220fac2b1a99aadbb97a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~228 LoC): no import path from any entry point (449 application, 123 tooling, 461 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/darwin-mode/bench/ruvector/h3-code-localize.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d0770316a5bb846002147d4cb3830d53049b92c5c940093bb118b3db3a64e2"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~188 LoC): no import path from any entry point (449 application, 123 tooling, 461 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/darwin-mode/bench/translate/chunked-synthesis.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c01a391c151d2306552d15256a3aad62c1f3c5dcdfe353a48b2415ec4f6b3b4d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~149 LoC): no import path from any entry point (449 application, 123 tooling, 461 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":"services/apicompletions/src/budget/firestore.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"343d70e4eb20334efa14841025693a6961514568620d264526f90fb7abf71a54"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~145 LoC): no import path from any entry point (449 application, 123 tooling, 461 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":"experiments/signal-flywheel/run.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84edc93e38991265d259462f2bf254ea34340396b60c7158c4d8c025f882b2b5"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~135 LoC): no import path from any entry point (449 application, 123 tooling, 461 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/darwin-mode/bench/orchestration/probe.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"282a08227cf7f488da155ad22f33eccb56abe208794c08413b7a7e90a6df2a7f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~120 LoC): no import path from any entry point (449 application, 123 tooling, 461 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/darwin-mode/bench/gaia/frames-summarize.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5f7b8cc9b9f5168b3f1a0007a20fb7507bd395cc48f472b8ee203ea35d398b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~117 LoC): no import path from any entry point (449 application, 123 tooling, 461 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/darwin-mode/bench/gaia/score-gaia.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c8b5ab8d0d0e08b0c06b39c3719c5f96bc2b1f00e8ea9edeeeaef465667525f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~80 LoC): no import path from any entry point (449 application, 123 tooling, 461 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":"experiments/router-calibration-loop/run.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc7fba2a67960ce784eeb4a2446861daeef6cbfd0222ca7222a2998fac94131"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~78 LoC): no import path from any entry point (449 application, 123 tooling, 461 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/darwin-mode/bench/swerebench/build-manifest.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9eafb3f246093b1695e8fb57e3cdc8f9fb89ddb33f892489b8f951e889a5de5"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~76 LoC): no import path from any entry point (449 application, 123 tooling, 461 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":"experiments/router-calibration-loop/assert.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a82fec50de36040428b0bb079a62c5d67c421c80930bdd7fc582d8a52b9ee68"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~65 LoC): no import path from any entry point (449 application, 123 tooling, 461 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/darwin-mode/bench/polyglot/polyglot-swarm-cn-mistral.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"361733b78f86f7d226d165ae50760c60e6e3084ee68130fb4e2b30863a0b7ff1"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~58 LoC): no import path from any entry point (449 application, 123 tooling, 461 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":"scripts/propagate-plugin-manifest.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b65ccac0c4b0e9256050095f6a90488155efa7f72796eccaed2a4737aa5546eb"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~9 LoC): no import path from any entry point (449 application, 123 tooling, 461 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/arc-agi-3-bench/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc2e7b3576cde9514a5c8abcff647249c9ef68b3b7740cf2584800c44f339a1"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~7 LoC): no import path from any entry point (449 application, 123 tooling, 461 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":"kimi-k3-harness/src/agents/architect.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca19bebc52ed5354749b38d467d3034ae97a46a8459135a3b92f7f7a7ff73ff"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~7 LoC): no import path from any entry point (449 application, 123 tooling, 461 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":"kimi-k3-harness/src/agents/implementer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa882112adfdb6033f3e933ba6246988852f226b27ec40abc43feedb86d9c7d5"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~7 LoC): no import path from any entry point (449 application, 123 tooling, 461 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":"kimi-k3-harness/src/agents/reviewer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85db539d8324e721fb1c0a1d494d8abd33cfcb653c860b8fd1c3ab4730bed60"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~7 LoC): no import path from any entry point (449 application, 123 tooling, 461 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":"kimi-k3-harness/src/agents/test-writer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f676aa338ff46da52aa51628f09c83ac1ac54af68bf3afc458021b94a3e36ea2"}},{"ruleId":"R7","level":"warning","message":{"text":"Benchmark script nothing runs (~215 LoC): This script imports the product (\u0027../dist/index.js\u0027), so it is an authored benchmark, not measurement input \u2014 but nothing invokes it: no package.json script, no CI workflow or build recipe, no Dockerfile, no other file under packages/aws-finops/bench/, and no in-repo reference to its name at all. It runs only if someone remembers to type \u0060node packages/aws-finops/bench/real-oracle.mjs\u0060, and it silently rots against the API it measures. Wire it into a script or workflow the way its wired siblings are, or delete it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/aws-finops/bench/real-oracle.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"965d96366002bcd7c98c1b8308e013c942cd8fe5a723559c97d911691f39e66c"}},{"ruleId":"R7","level":"warning","message":{"text":"Benchmark script nothing runs (~213 LoC): This script imports the product (\u0027../dist/index.js\u0027), so it is an authored benchmark, not measurement input \u2014 but nothing invokes it: no package.json script, no CI workflow or build recipe, no Dockerfile, no other file under packages/projects/bench/, and no in-repo reference to its name at all. It runs only if someone remembers to type \u0060node packages/projects/bench/real-cve-corpus.mjs\u0060, and it silently rots against the API it measures. Wire it into a script or workflow the way its wired siblings are, or delete it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/projects/bench/real-cve-corpus.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b54e5c2ba8b4c7e499b937391dbc30f09aaa59e111f97cbbeee82a85d5c282a"}},{"ruleId":"R7","level":"warning","message":{"text":"Benchmark script nothing runs (~97 LoC): This script imports the product (\u0027../dist/memory-rvf.js\u0027), so it is an authored benchmark, not measurement input \u2014 but nothing invokes it: no package.json script, no CI workflow or build recipe, no Dockerfile, no other file under packages/kernel-js/bench/, and no in-repo reference to its name at all. It runs only if someone remembers to type \u0060node packages/kernel-js/bench/memory-rvf-bench.mjs\u0060, and it silently rots against the API it measures. Wire it into a script or workflow the way its wired siblings are, or delete it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/kernel-js/bench/memory-rvf-bench.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"765887ccdb2f32c8f96d0c7fa7f323bb6c7026498c8f7f86824eafb36f0ccd15"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027WASM_PATH\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kimi-k3-harness/scripts/kernel.mjs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf342aa98a4aedf8c416bce4756f68a95d55d93ab0bb918ed5aab02bd9e113a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027newRequestId\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in packages/arc-agi-3-bench/src/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/arc-agi-3-bench/src/index.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3-bench/src/canonical.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db55691d93aadb6dac4cc4d53f9d3d16deb1b93bf3e8c17a88daa6dc7645292"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027PlannerEpisodeState\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in packages/arc-agi-3-bench/src/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/arc-agi-3-bench/src/index.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3-bench/src/types.ts"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"3985e980e51941df1eabab62c8b338f7cd270a22e8578a33f0b7662a6cc5b36b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027_resetRuvllmCacheForTests\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/analyze-repo.ts"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"637e507694d29efdd442dd44b24ed9edf948ede532f339586af5c31239fef9d1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027agenticowAvailable\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/cognition/cognition-harness.mjs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"9738d6d63730230307253084e0996eb0af90b8a954b32cbb82ae7e4f9d575f24"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027EMB_DIM\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/cognition/cognition-harness.mjs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"00909a7e985af9628dbebf80f8a1d1462baf7f337f82ee004a2d75056e3ce5d1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027_internal\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/cve-bench/env-recipe.mjs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"9554b9e328e9ade1a8978ac774929fe2e71232fd02d687752e67e055dc3b559d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027BASE_SYSTEM\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/gaia/scaffolds.mjs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a6584a82189a74ed82cc43cabe96f361f763d2e25614f7976e37695f3dfd13"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027embedBatch\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/ruvector/embedder.mjs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a40dcbe0e52e1679f4550beb6cef1e1ed362679c8ec1bf7cc9fa263f92f4310"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027default\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/swebench/gepa/branch-memory.mjs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa957bde736ea9ea8eae6ea2d131fa87fed94fa276ba109de8860485425cc50c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027NoopBudgetTracker\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"services/apicompletions/src/budget/tracker.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7082e2af72c95f542b10fbcdbd443001156b8f1249c15eac1219604d1cde49"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getFirestore\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"services/apicompletions/src/firestore/client.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3e1e5de31148e364d5379f2161e6832b4495617497419fd4ef2df049277dbf"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027FirestoreLedgerStore\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"services/apicompletions/src/metering/ledger.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5b4c2f8ae0ad70a588a851d4ad8ddfe4e547c04b5163a77f6c51388f34c75a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027PubSubUsagePublisher\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"services/apicompletions/src/metering/ledger.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ab05e0749d66255bad3ea61c81e31923a6c8ad70b9dccdcd45c26adb16acd3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027FirestoreIdempotencyStore\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"services/apicompletions/src/ratelimit/idempotency.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"a395c9fd8566304aa8fa880bf77a893495df9c033cf1a14de55e4f342316dba8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027FirestoreRateLimitStore\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"services/apicompletions/src/ratelimit/limiter.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"f57f38fafb44add329a9505e0c0e0952186729b62e26f48321efd389e33df9b0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027toPosix\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/vertical-base/src/index.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc2372b2789ba0cc7cff118bd5c1549f09012a1bbc82d919291426366cd72bf"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027inWorkspace\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":"scripts/check-runner-coverage.mjs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6d52d4d8a176cb547cab59d5c75c2b8472b7cd5d48be4db966c22a6c2fa6df"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027GH_REPO\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":"scripts/nightly-sota-review.mjs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2c85e468bd9f88599179cc9ca7ba5333ebdbc57c5b8575698560d8a1916db5"}},{"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":"scripts/generated-journey.mjs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71a101c3747524ccabea4175d5e722c53c56ef360c0e82d6e6db463ad50b50a"}},{"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/create-agent-harness/__tests__/generated-journey.test.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"85474b674f9c889af61ffe9920256532627007d0248c8b7d44570bf2bc05ebae"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027kolorist\u0027: Declared in packages/create-agent-harness/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/create-agent-harness/package.json"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e1b1d6481684964cd7bde74a569561250fc843e2456d63a620603ec625385c"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027node-fetch\u0027: Declared in services/apicompletions/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":"services/apicompletions/package.json"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"380ca095bb660af10ccc05bff5b3f302ea3760b4cc0d5874a44d4feafcb27025"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): packages/create-agent-harness/src/meta-proxy-service.ts \u2192 packages/create-agent-harness/src/meta-proxy.ts \u2192 packages/create-agent-harness/src/meta-proxy-service.ts"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/meta-proxy-service.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9504c47d9a7bf832d66468dcda08ecd93cefe81cab9b141680c2df3a6ad8142"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): packages/create-agent-harness/src/subcommands.ts \u2192 packages/create-agent-harness/src/validate.ts \u2192 packages/create-agent-harness/src/subcommands.ts"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/subcommands.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb6fe6d4558a9d5918a56607a31a7bcb25a309a01c3dcadd165c4b84263b9bcf"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): packages/router/src/index.ts \u2192 packages/router/src/train.ts \u2192 packages/router/src/index.ts"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/router/src/index.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"9619b7974153bf1b05fd84b5d9a71379e0d3bb03e295f26a685a127b73e7b1fe"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: crates/kernel-napi/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/kernel-napi/package.json"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"b715e4927d527783213299090dfce56e7641ac7d42338968602df467803b034a"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: kimi-k3-harness/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kimi-k3-harness/package.json"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"1088f042a857c29fd3713f1188575448e7388f1983aa4dae5084564172a99cdf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!!get(\u0027.mcp.json\u0027) || /modelcontextprotocol|mcp server/i.test(text)\u0060 appears character-identically in 2 files \u2014 apps/web-ui/src/generator/repo.ts, packages/create-agent-harness/src/analyze-repo.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web-ui/src/generator/repo.ts"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"239207118ea7f960a91fb97650c466e0b0c9921bb136094cb47b1b9553471334"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Array.isArray(b.messages) || b.messages.length === 0\u0060 appears character-identically in 2 files \u2014 services/apicompletions/src/routes/chatCompletions.ts, services/apicompletions/src/routes/messages.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"services/apicompletions/src/routes/chatCompletions.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb500b70717d0e87e038e5680f90b2d2c888dccf8e6371d03f04051334515d8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isInteger(budget.timeoutMs) || budget.timeoutMs \u003C 1 || budget.timeoutMs \u003E 300000\u0060 appears character-identically in 2 files \u2014 packages/darwin-mode/src/contrastive/confirmation.ts, packages/darwin-mode/src/contrastive/validation.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/src/contrastive/confirmation.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a5f37aafecdfaf167aa43af4765d5bedfada53c533ec2c853b255e7815ca31e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isInteger(options.dimension) || options.dimension \u003C 1\u0060 appears character-identically in 2 files \u2014 packages/field-memory/src/ruvector-storage.ts, packages/field-memory/src/storage.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/field-memory/src/ruvector-storage.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"039976ec883e01f2d5c826e204b56a356b1ef126dbead77a42ee4935e2bf63e6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isSafeInteger(value) || value \u003C 1 || value \u003E maximum\u0060 appears character-identically in 4 files \u2014 packages/arc-agi-3-chatgpt/src/policy.ts, packages/arc-agi-3-chatgpt/src/server.ts, packages/arc-agi-3-chatgpt/src/store.ts, packages/arc-agi-3/src/python-bridge.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3-chatgpt/src/policy.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"770dfd10b6992f604c596010e98aa63f817fbc1a5e801df96d509e0553505bcd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!candidate || typeof candidate !== \u0027object\u0027\u0060 appears character-identically in 2 files \u2014 packages/arc-agi-3-chatgpt/src/server.ts, packages/arc-agi-3-chatgpt/src/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/arc-agi-3-chatgpt/src/server.ts"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52c28c31d0dbb69e0e9537c20fc9e037343b12cdfe1733ed323b630c5c16737"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!descriptor?.enumerable || !(\u0027value\u0027 in descriptor)\u0060 appears character-identically in 4 files \u2014 packages/arc-agi-3-bench/src/model-driver.ts, packages/arc-agi-3/src/canonical.ts, packages/arc-agi-3/src/checkpoint.ts, packages/arc-agi-3/src/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/arc-agi-3-bench/src/model-driver.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"433734722eddde68a75e63c847023029012b31a4b44351d979044930840dbaa8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!existsSync(dir) || !statSync(dir).isDirectory()\u0060 appears character-identically in 4 files \u2014 packages/create-agent-harness/src/genome.ts, packages/create-agent-harness/src/oia-manifest.ts, packages/create-agent-harness/src/score.ts, packages/create-agent-harness/src/threat-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/create-agent-harness/src/genome.ts"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"9084ef126011bb3d8a3edaad728221d80438852771b8312a296cc28e8e1d008e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!key.trim() || key.length \u003E 128 || !Number.isFinite(value)\u0060 appears character-identically in 2 files \u2014 packages/arc-agi-3/src/checkpoint.ts, packages/arc-agi-3/src/controller.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3/src/checkpoint.ts"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"4636008ebd795bd3d118385c870b88e73ae2eaf6afc9243341fe0fe337e864a5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!value || typeof value !== \u0027object\u0027 || Array.isArray(value)\u0060 appears character-identically in 2 files \u2014 packages/arc-agi-3/src/canonical.ts, packages/arc-agi-3/src/checkpoint.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3/src/canonical.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5dc617180cd0d68ed42b79a214d9a0fcd9f698462a5c743a6b0ed83ea05390"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!value || typeof value !== \u0027object\u0027 || Array.isArray(value) || Object.getPrototypeOf(value) !== Object.prototype\u0060 appears character-identically in 6 files \u2014 packages/arc-agi-3/src/avo-loop.ts, packages/arc-agi-3/src/belief-graph.ts, packages/arc-agi-3/src/canonical.ts, packages/arc-agi-3/src/plan-archive.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3/src/avo-loop.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6bdcb258394f8a24a370457be7a664214266d7ad17fd8a732d85f9c25347830"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(process.env.METAHARNESS_KERNEL_BACKEND || \u0027\u0027).trim().toLowerCase() || null\u0060 appears character-identically in 2 files \u2014 packages/create-agent-harness/src/diag.ts, packages/kernel-js/src/index.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/diag.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"e691dd490d0b0c0d0d8351fdf5f898ff1292182080227d288d62e513988b163c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(v.startsWith(\u0027\u0022\u0027) \u0026\u0026 v.endsWith(\u0027\u0022\u0027)) || (v.startsWith(\u0022\u0027\u0022) \u0026\u0026 v.endsWith(\u0022\u0027\u0022))\u0060 appears character-identically in 2 files \u2014 packages/evals-toolcall/src/normalizer.ts, packages/redblue/src/config/loader.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/evals-toolcall/src/normalizer.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d55a799e4c0356e857327dfc6b663f5e7455dfe1bf17e516ff21d89fb324fd9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060acct.status !== \u0027active\u0027 || acct.headroomExhausted\u0060 appears character-identically in 2 files \u2014 services/apicompletions/src/budget/firestore.ts, services/apicompletions/src/budget/tracker.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"services/apicompletions/src/budget/firestore.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2aeff7a7bcd87437554012035d449cdca6dcf372fcc4c5e3aed750804dcdeb3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060anyLeak || (formatInvalid \u002B abstained) === results.length\u0060 appears character-identically in 2 files \u2014 packages/evals-hle/src/score.ts, packages/evals-math/src/score.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/evals-hle/src/score.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"48554b4eadf1a621d813d9324c61f011b47a60bec439f39bae14f3516301d0ff"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060b.similarity - a.similarity || compareText(a.record.id, b.record.id)\u0060 appears character-identically in 3 files \u2014 packages/field-memory/src/field-memory.ts, packages/field-memory/src/ruvector-storage.ts, packages/field-memory/src/storage.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/field-memory/src/field-memory.ts"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7990ff895ee6279964bc620e03140849804f2f63e8a92be683ca7ea8ae49d8c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060buf !== this.memBuf || this.memView === null\u0060 appears character-identically in 2 files \u2014 packages/horizon/src/core.ts, packages/oo-agents/src/vm.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/horizon/src/core.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4fef3c8c16fb5723ac33ec508e49faa1d01b8fdb91ee3b3df373cd303c3f465"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060check.exactQuestionSeen || check.policyMentionsBenchmarkArtifact || check.promptContainsDatasetSpecificHack || check.ngramOverlapWithPublicE\u2026\u0060 appears character-identically in 3 files \u2014 packages/evals-hle/src/leakage.ts, packages/evals-math/src/leakage.ts, packages/evals-sql/src/leakage.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/evals-hle/src/leakage.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"33970a95fe5d5c598e769f77ad4fd11d33cf0d86684adb846b9c2105d9dedc64"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.crossover === true \u0026\u0026 parents.length \u003E= 2\u0060 appears character-identically in 2 files \u2014 packages/darwin-mode/src/evolve.ts, packages/darwin-mode/src/numeric-evolve.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/src/evolve.ts"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dbd789d2bec3be964a62abded1e76f8a7ffdb3a453d015a4de697d1a81292f5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060currentId !== null \u0026\u0026 !seen.has(currentId)\u0060 appears character-identically in 2 files \u2014 packages/darwin-mode/src/archive.ts, packages/darwin-mode/src/numeric-archive.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/src/archive.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"c69dc124acc2485fcbdc02a01fc2235e42f486cab8fcecc97125fb63f96aa978"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060e.anchor \u0026\u0026 !(e.anchor.candidate \u003E= e.anchor.baseline * 0.98)\u0060 appears character-identically in 2 files \u2014 kimi-k3-harness/scripts/flywheel-evolve.mjs, packages/radio/scripts/flywheel-radio.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":"kimi-k3-harness/scripts/flywheel-evolve.mjs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0fa6ef56cc6ca702b054f42c566093c5c62c3b2a8968dea5ff668b297e504c8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060escalate \u0026\u0026 tier !== \u0027frontier\u0027 \u0026\u0026 cost \u003C genome.global.maxCostPerQuestionUsd\u0060 appears character-identically in 2 files \u2014 packages/evals-hle/src/evaluator.ts, packages/evals-math/src/evaluator.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/evals-hle/src/evaluator.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb51342f4bdbae37010cb40902500a6291458146a4f89dd3cf9567cdc15a51d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060get(\u0027pyproject.toml\u0027) || get(\u0027requirements.txt\u0027)\u0060 appears character-identically in 2 files \u2014 apps/web-ui/src/generator/repo.ts, packages/create-agent-harness/src/analyze-repo.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web-ui/src/generator/repo.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3d75142722a4c0a98f806d70cb3ced45c01653f38f762edf7f65ca0a53ff8d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isSafeIdentifier \u0026\u0026 !YAML_RESERVED_BARE.test(s)\u0060 appears character-identically in 3 files \u2014 packages/host-claude-code/src/index.ts, packages/host-hermes/src/index.ts, packages/host-openclaw/src/index.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/host-claude-code/src/index.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ce1b2c6e026041aa70f330fd0397445244fafb6bf8c3776cc99c370bd2d304"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060mode === \u0027none\u0027 || input.answer === null\u0060 appears character-identically in 2 files \u2014 packages/evals-hle/src/verifier.ts, packages/evals-math/src/verifier.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/evals-hle/src/verifier.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"758a9380756714e43712ab300732b35affb2404b868b4aaf0cf317216f318420"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060observation.state === \u0027NOT_PLAYED\u0027 || observation.state === \u0027GAME_OVER\u0027\u0060 appears character-identically in 2 files \u2014 packages/arc-agi-3/src/belief-graph.ts, packages/arc-agi-3/src/controller.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3/src/belief-graph.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea61e9af8b1cad73017928371c4b3e7cf816ff173f6200e5cc45843d08c1a47"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parent \u0026\u0026 !parent.children.includes(variant.id)\u0060 appears character-identically in 2 files \u2014 packages/darwin-mode/src/archive.ts, packages/darwin-mode/src/numeric-archive.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/src/archive.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd4f6bf3477f4283b2fa0228d653d4930c982257881d4d4e769acaf3c946db9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pkg.name \u0026\u0026 pkg.name !== \u0027@metaharness/kernel\u0027\u0060 appears character-identically in 2 files \u2014 packages/create-agent-harness/src/diag.ts, packages/create-agent-harness/src/index.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/diag.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb51b7db51c4513d496e3b9cd779eab39918bc3e89b9cdeb226a00a27692d1aa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pkg.peer === true || pkg.optional === true\u0060 appears character-identically in 2 files \u2014 packages/create-agent-harness/src/sbom-cmd.ts, scripts/sbom.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/create-agent-harness/src/sbom-cmd.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"d694efde3a830e4c98571fc53bdfe4d4ab3211a3c0e8b13b77506bc22a9c917a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.env.PROJECT || \u0027cognitum-20260110\u0027\u0060 appears character-identically in 3 files \u2014 scripts/gcp-cluster.mjs, scripts/nightly-sota-review.mjs, scripts/tbench-gcp.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":"scripts/gcp-cluster.mjs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3be089fb910a58d03619832a4cf2dddcb31d2d63a2045a418e9a90a99948a8e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060profile.hasCi \u0026\u0026 (a.template === \u0027vertical:devops\u0027 || a.commands.includes(\u0027review-diff\u0027))\u0060 appears character-identically in 2 files \u2014 apps/web-ui/src/generator/repo.ts, packages/create-agent-harness/src/analyze-repo.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web-ui/src/generator/repo.ts"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"a906207bfe1f33c9123a365d2f68f2c2dfca665e39f6bedc151c6f72dc188e46"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060profile.hasMcp \u0026\u0026 a.id === \u0027mcp-server-harness\u0027\u0060 appears character-identically in 2 files \u2014 apps/web-ui/src/generator/repo.ts, packages/create-agent-harness/src/analyze-repo.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web-ui/src/generator/repo.ts"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"04c823696d887e7e7eb9e3c96b20e937d8c0161fd21c9134b01ddcdf90f78055"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060prototype !== Object.prototype \u0026\u0026 prototype !== null\u0060 appears character-identically in 3 files \u2014 packages/arc-agi-3/src/canonical.ts, packages/arc-agi-3/src/checkpoint.ts, packages/avo/src/operator.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3/src/canonical.ts"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aca2c23020bade0d67bd2edb0b14127bf19a97ef56fb61436690ab544270f07"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060sig.confidence \u003C policy.escalationThreshold || sig.verifierDisagrees || sig.answerFormatInvalid || !!sig.subjectIsHighErrorForCheap\u0060 appears character-identically in 2 files \u2014 packages/evals-hle/src/routing.ts, packages/evals-math/src/routing.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/evals-hle/src/routing.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a26121ba0c2a1476c98bbd25c93521b99b81b56441e58500502e6bfc471d1d0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060t.exitCode !== 0 || t.timedOut || t.blockedActions.length \u003E 0\u0060 appears character-identically in 2 files \u2014 packages/darwin-mode/src/mutator.ts, packages/darwin-mode/src/phenotype.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/src/mutator.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b521cd78eb0a1df64f334dd22e6a94453a7ae5583eec45eca175f75ab97f41"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof action !== \u0027string\u0027 || !ACTIONS.has(action)\u0060 appears character-identically in 2 files \u2014 packages/arc-agi-3/src/belief-graph.ts, packages/arc-agi-3/src/canonical.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3/src/belief-graph.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48f6933a4e93b2d6ff444a1c04a8616bc10ad61def9bbf35b0d68df61941ded"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof b.model !== \u0027string\u0027 || b.model.length === 0\u0060 appears character-identically in 3 files \u2014 services/apicompletions/src/routes/chatCompletions.ts, services/apicompletions/src/routes/completions.ts, services/apicompletions/src/routes/messages.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"services/apicompletions/src/routes/chatCompletions.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"e012ca4e358e362334ac8c0331dc99eabf63110e5770809ce2b3ebc9b92978e4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof c.accuracy === \u0027number\u0027 \u0026\u0026 typeof b.accuracy === \u0027number\u0027\u0060 appears character-identically in 5 files \u2014 packages/evals-extract/src/gate.ts, packages/evals-hle/src/gate.ts, packages/evals-math/src/gate.ts, packages/evals-sql/src/gate.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/evals-extract/src/gate.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"487b6fe693e1d69ca1d6d9bfb6b4634a49156a8aa9fbab8b67343826865c939c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof ca === \u0027number\u0027 \u0026\u0026 typeof ba === \u0027number\u0027 \u0026\u0026 ca \u003C ba\u0060 appears character-identically in 5 files \u2014 packages/evals-extract/src/gate.ts, packages/evals-hle/src/gate.ts, packages/evals-math/src/gate.ts, packages/evals-sql/src/gate.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/evals-extract/src/gate.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"889637a197efbfd5e4b5b83237f924d9ca0a8c72d39aa200e00174724611751b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof content === \u0027string\u0027 \u0026\u0026 content.length \u003E MAX_MESSAGE_CHARS\u0060 appears character-identically in 2 files \u2014 services/apicompletions/src/routes/chatCompletions.ts, services/apicompletions/src/routes/messages.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"services/apicompletions/src/routes/chatCompletions.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"272dffa3d62288f47059dfa018b35fd3b2b48288307d64b275b15aed3e315c00"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof key !== \u0027string\u0027 || !allowed.has(key)\u0060 appears character-identically in 3 files \u2014 packages/arc-agi-3-bench/src/model-driver.ts, packages/arc-agi-3/src/checkpoint.ts, packages/flywheel/src/review-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/arc-agi-3-bench/src/model-driver.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"00970c60f1b7c8bc165ca96cd8f08694c845b6c86cb748527be73c83a49f4a35"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof key !== \u0027string\u0027 || !allowed.has(key) || !Object.getOwnPropertyDescriptor(value, key)?.enumerable || !(\u0027value\u0027 in Object.getOwnProper\u2026\u0060 appears character-identically in 2 files \u2014 packages/arc-agi-3/src/avo-loop.ts, packages/arc-agi-3/src/plan-archive.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3/src/avo-loop.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"8876b46f332c599c98d731b7d64a3316e82627eb468da6c08f4ca9370b734c18"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof key !== \u0027string\u0027 || !keys.has(key) || !Object.getOwnPropertyDescriptor(value, key)?.enumerable || !(\u0027value\u0027 in Object.getOwnPropertyD\u2026\u0060 appears character-identically in 2 files \u2014 packages/arc-agi-3/src/belief-graph.ts, packages/arc-agi-3/src/world-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/arc-agi-3/src/belief-graph.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceab9e6e1dbd14172dc13a8612a3ef4dc7adbdec9fec7ce3c3c8df1a7143b3c0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof key !== \u0027string\u0027 || (key !== \u0027length\u0027 \u0026\u0026 !/^(0|[1-9][0-9]*)$/.test(key))\u0060 appears character-identically in 6 files \u2014 packages/arc-agi-3/src/belief-graph.ts, packages/arc-agi-3/src/canonical.ts, packages/arc-agi-3/src/checkpoint.ts, packages/arc-agi-3/src/memory.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3/src/belief-graph.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b7448b17719408cc73f8fda2205b99b467bbe8fa1abaf61298603701026fe8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof key !== \u0027string\u0027 || (key !== \u0027maxActions\u0027 \u0026\u0026 key !== \u0027maxWallTimeMs\u0027)\u0060 appears character-identically in 2 files \u2014 packages/arc-agi-3/src/canonical.ts, packages/arc-agi-3/src/controller.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3/src/canonical.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8edfb7eb19b64021b10656760e9fae42ca5326086683fb5da189052c936d6e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof name !== \u0027string\u0027 || name.length === 0\u0060 appears character-identically in 2 files \u2014 apps/web-ui/src/generator/render.ts, packages/create-agent-harness/src/renderer.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web-ui/src/generator/render.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"1154c9a6a1c275cd86ff80926deacb87d60199ffc685af1e64c41a9e0a01623e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof v === \u0027number\u0027 \u0026\u0026 Number.isFinite(v)\u0060 appears character-identically in 3 files \u2014 packages/agntcy/src/oasf/project.ts, packages/aws-finops/src/infracost-adapter.ts, packages/flywheel/src/production-gate.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/agntcy/src/oasf/project.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"4114d1a3071ed4714a248c9085bbf1af9ab84a2d302ad4c83ab073facfd953f9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof v === \u0027number\u0027 \u0026\u0026 Number.isInteger(v)\u0060 appears character-identically in 2 files \u2014 packages/evals-extract/src/normalizer.ts, packages/evals-toolcall/src/verifier.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/evals-extract/src/normalizer.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"1493c3d800072f8e8d74845cec40b203389d94808c33569af33d2cf1a3995af4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0027string\u0027 || !HEX_HASH.test(value)\u0060 appears character-identically in 2 files \u2014 packages/arc-agi-3/src/checkpoint.ts, packages/arc-agi-3/src/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/arc-agi-3/src/checkpoint.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"49da8347ca725d57c87ba8e7f5ae35f72f1803f38ee4431a901eef5bd915f741"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0027string\u0027 || !value.trim() || value.length \u003E 256\u0060 appears character-identically in 2 files \u2014 packages/arc-agi-3/src/memory.ts, packages/arc-agi-3/src/world-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/arc-agi-3/src/memory.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"706036d839b145a6b5dcbdb7a47acf58012b77abc969ac470e8611745a44201c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0027string\u0027 || !value.trim() || value.length \u003E maximum || /[\\u0000-\\u001f]/.test(value)\u0060 appears character-identically in 2 files \u2014 packages/arc-agi-3/src/controller.ts, packages/arc-agi-3/src/plan-archive.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3/src/controller.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5aeb3e894965dcfc3a02e24084030a546803e02578b57798be4bec691777035"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0027number\u0027 \u0026\u0026 Number.isFinite(value)\u0060 appears character-identically in 2 files \u2014 packages/arc-agi-3-chatgpt/src/official-factory.ts, packages/arc-agi-3/src/plan-archive.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3-chatgpt/src/official-factory.ts"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"18212bc1a80361af477928affb6b4a113159e541b3869b5b189ce4e3ea6dfb0b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0027object\u0027 \u0026\u0026 value !== null \u0026\u0026 !Array.isArray(value)\u0060 appears character-identically in 5 files \u2014 packages/arc-agi-3-bench/src/model-driver.ts, packages/arc-agi-3-chatgpt/src/official-factory.ts, packages/arc-agi-3/src/python-bridge.ts, packages/create-agent-harness/src/field-memory-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/arc-agi-3-bench/src/model-driver.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"59afcff45ed0a5a88c788134b702c0e8603571eb485ec16eb9bec905c8d2901f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060v !== undefined \u0026\u0026 v !== null \u0026\u0026 v !== \u0027\u0027\u0060 appears character-identically in 2 files \u2014 packages/evals-extract/src/evaluator.ts, packages/evals-extract/src/verifier.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/evals-extract/src/evaluator.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8093892070ff5f9b245418198ce1fe0e3c2399f0256e033bbe6d775ec01901"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060v === undefined || Number.isNaN(Number(v))\u0060 appears character-identically in 6 files \u2014 packages/evals-extract/src/genome.ts, packages/evals-hle/src/genome.ts, packages/evals-math/src/genome.ts, packages/evals-servedmodel/src/genome.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/evals-extract/src/genome.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40310eb132da911e1c21ab990f424389e00adce91bce2b78245ab0d7ecd7276"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060v.status === \u0027RUNNING\u0027 || v.status === \u0027STAGING\u0027\u0060 appears character-identically in 2 files \u2014 scripts/gcp-cluster.mjs, scripts/tbench-gcp.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":"scripts/gcp-cluster.mjs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"b24bb9a42266a7d7fb0ec270d536a7a1d898d10d1726d89106cf80372947fe84"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value !== null \u0026\u0026 typeof value === \u0027object\u0027 \u0026\u0026 !Array.isArray(value)\u0060 appears character-identically in 2 files \u2014 packages/avo/src/claim-gate.ts, packages/flywheel/src/budget.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/avo/src/claim-gate.ts"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"d36b99474f9af996657632a82511566be72a402732fdab85a0fbe66b26541e98"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value === null || typeof value !== \u0027object\u0027\u0060 appears character-identically in 7 files \u2014 packages/arc-agi-3-chatgpt/src/official-factory.ts, packages/arc-agi-3-chatgpt/src/store.ts, packages/avo/src/crypto.ts, packages/darwin-mode/src/archive.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3-chatgpt/src/official-factory.ts"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1bf4074d451d4d6a58a0456bbc5fce62bc610bc32dc7e2aafbee4eb66e2c756"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value === null || typeof value !== \u0027object\u0027 || Array.isArray(value)\u0060 appears character-identically in 2 files \u2014 packages/avo/src/operator.ts, packages/flywheel/src/review-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/avo/src/operator.ts"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50e0840d431d8fe154afb3ec591c0da529523b89879b050666c8a81b124a6fb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value === null || typeof value === \u0027boolean\u0027 || typeof value === \u0027string\u0027\u0060 appears character-identically in 2 files \u2014 packages/arc-agi-3-bench/src/canonical.ts, packages/arc-agi-3-bench/src/model-driver.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3-bench/src/canonical.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e4b1cba53c170e1a0dad7ba64c8327c8876f25008ebfcea91f9270c42dedf2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value === null || typeof value === \u0027string\u0027 || typeof value === \u0027boolean\u0027\u0060 appears character-identically in 2 files \u2014 packages/arc-agi-3/src/canonical.ts, packages/arc-agi-3/src/checkpoint.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3/src/canonical.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"56aa6573ebf03b9596f3424069c73e0aa1b613c81406f2db4184a3b05a3bdb05"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value === undefined || value.startsWith(\u0027--\u0027)\u0060 appears character-identically in 2 files \u2014 packages/arc-agi-3-bench/src/cli.ts, scripts/benchmark-arc-avo-long-horizon.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/arc-agi-3-bench/src/cli.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"f88b862cf22cde59e75c760c7af440467757d51e42de305c4db9cb17649a7247"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060variant === null || typeof variant !== \u0027object\u0027\u0060 appears character-identically in 2 files \u2014 packages/darwin-mode/src/archive.ts, packages/darwin-mode/src/numeric-archive.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/src/archive.ts"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae65a1a03fd5c0c358f9465be08d1e6ab11b1ea8c7b619f5c4af427febca0bb3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(s[\u0022coverage_mean\u0022] \u003E ccf[\u0022coverage_mean\u0022] \u002B 1e-9) or (s[\u0022cost_per_task_mean\u0022] \u003C ccf[\u0022cost_per_task_mean\u0022] - 1e-9)\u0060 appears character-identically in 3 files \u2014 docs/research/retort-placement/analyze2.py, docs/research/retort-placement/analyze3.py, docs/research/retort-placement/analyze4.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/retort-placement/analyze2.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d4e7a5e5008261366f28d011e8c926a113a5709e63486531488f65b00b3eb6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060r.p_value is None or r.p_value!=r.p_value\u0060 appears character-identically in 3 files \u2014 docs/research/retort-placement/analyze2.py, docs/research/retort-placement/analyze3.py, docs/research/retort-placement/analyze4.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/research/retort-placement/analyze2.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f773df897716bc445fe83ca546db1f0d7b384e9704b1c92148055e04fe6672"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060canon\u0060 is exported and takes \u0060v: unknown\u0060 from its caller, and it calls itself at line 15 (\u0060canon\u0060) with a piece of \u0060v\u0060 (and at line 17) \u2014 and nowhere in \u0060canon\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 \u0060canon\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/turn-credit/src/receipt.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"be26778a588682fbc97c3f4e9a52c656734aca638cd940fa5a841ddcf2bc3d4d"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060stableStringify\u0060 is exported and takes \u0060value: unknown\u0060 from its caller, and it calls itself at line 102 (\u0060stableStringify\u0060) with a piece of \u0060value\u0060 (and at line 105) \u2014 and nowhere in \u0060stableStringify\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 \u0060stableStringify\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/projects/src/core.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d8bd83a943a53a35675636aef7d3537060ac0c06a882abf7867d6110e398e4"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060validate\u0060 is exported and takes \u0060v: unknown\u0060 from its caller, and it calls itself at line 40 (\u0060validate\u0060) with a piece of \u0060v\u0060 (and at line 56) \u2014 and nowhere in \u0060validate\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 \u0060validate\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/oo-agents/src/schema.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b5ebc2b3650e7abb33572d5f3a28a3040806663a44bd49a4aaf2bf84c8b7b6"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060describe\u0060 is exported and takes \u0060s: Schema\u0060 from its caller, and it calls itself at line 82 (\u0060describe\u0060) with a piece of \u0060s\u0060 (and at line 85) \u2014 and nowhere in \u0060describe\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 \u0060describe\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/oo-agents/src/schema.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c7c53bc79768054890ae04448c07323e8361d0f0ce778519c69a1da8af8c53"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060to_json\u0060 is public and takes \u0060v: \u0026Value\u0060 from its caller, and it calls itself at line 97 with a piece of the document (and at line 109) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. 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. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060to_json\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/oo-agents/crate/src/lib.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"5734d142707fba7a48f64531a54eca067f95eb31e07847529f58fbb9a90582e2"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060canonicalJson\u0060 is exported and takes \u0060v: unknown\u0060 from its caller, and it calls itself at line 59 (\u0060canonicalJson\u0060) with a piece of \u0060v\u0060 (and at line 64) \u2014 and nowhere in \u0060canonicalJson\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 \u0060canonicalJson\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/kernel-js/src/session.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3ebf6e42e75f132b91aff38f4ed514a893d248e7586361ff80dee13ddd6aca"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060to_json\u0060 is public and takes \u0060v: \u0026Value\u0060 from its caller, and it calls itself at line 119 with a piece of the document (and at line 131) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. 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. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060to_json\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/horizon/crate/src/lib.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc37e04a65676ee6de8ee37b451f6c32703d744919dba327c05cb001069e3c8"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060canonical\u0060 is exported, takes a document from its caller (line 16) and hands it to \u0060sortKeys\u0060, which calls itself at line 21 (\u0060sortKeys\u0060) with a piece of \u0060value\u0060 (and at line 25) \u2014 and nowhere in \u0060sortKeys\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 \u0060sortKeys\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/harness/src/receipts.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8e1fd284916c602878af0cb2ddcc524109159ec1d7a57ea2ad63e1557f70a2"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060evidenceDigest\u0060 is exported, takes a document from its caller (line 66) and hands it to \u0060visit\u0060, which calls itself at line 74 (\u0060visit\u0060) with a piece of \u0060v\u0060 (and at line 79) \u2014 and nowhere in \u0060visit\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 \u0060visit\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flywheel/src/production-gate.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa40c7d22a9014564c0c8e7e1991f4f45dd3f37e76b68c474b27d8701819fd01"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060canonicalJson\u0060 is exported and takes \u0060value: unknown\u0060 from its caller, and it calls itself at line 144 (\u0060canonicalJson\u0060) with a piece of \u0060value\u0060 (and at line 148) \u2014 and nowhere in \u0060canonicalJson\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 \u0060canonicalJson\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/field-memory/src/util.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b4e2f3200b84f10323bece537a60d04fb1601f25123dd7ebba29eb46223582"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060redactSecretsDeep\u0060 is exported and takes \u0060value: unknown\u0060 from its caller, and it calls itself at line 57 (\u0060redactSecretsDeep\u0060) with a piece of \u0060value\u0060 (and at line 61) \u2014 and nowhere in \u0060redactSecretsDeep\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 \u0060redactSecretsDeep\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/redact.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b5f90b13a9305e4c2f4bcc848a4f163d3523f9ebf387808311107a3673281db"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060parsePolicyReport\u0060 is exported, takes a document from its caller (line 34) and hands it to \u0060collect\u0060, which calls itself at line 17 (\u0060collect\u0060) with a piece of \u0060node\u0060 \u2014 and nowhere in \u0060collect\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 \u0060collect\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/aws-finops/src/checkov-adapter.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0bbdf9bdd935d8729e96d25c6b03ef1dffce86622ac94b6fe106b1db300a43a"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060canonical\u0060 is exported and takes \u0060value: unknown\u0060 from its caller, and it calls itself at line 10 (\u0060canonical\u0060) with a piece of \u0060value\u0060 (and at line 15) \u2014 and nowhere in \u0060canonical\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 \u0060canonical\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/avo/src/crypto.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44be6ed5e2a1c8cf781f39bd24aa061effaf467551fa99883a94f4b039b5cea"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060canon\u0060 is exported and takes \u0060v: unknown\u0060 from its caller, and it calls itself at line 31 (\u0060canon\u0060) with a piece of \u0060v\u0060 (and at line 33) \u2014 and nowhere in \u0060canon\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 \u0060canon\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/avo/src/flywheelGate.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"b02b3b63f3c8c04d62ca719cfd522d3a67c81eebebf2edba595dc79af5800c37"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060assertNoHiddenGameIdentity\u0060 is exported, takes a document from its caller (line 150) and hands it to \u0060visit\u0060, which calls itself at line 157 (\u0060visit\u0060) with a piece of \u0060candidate\u0060 (and at line 165) \u2014 and nowhere in \u0060visit\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 \u0060visit\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3-chatgpt/src/types.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"a58a191e33131055e8ae3ceb7187f9b126743262160e03ae6190b2fdda732bf9"}},{"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 34) and hands it to \u0060canonicalize\u0060, which calls itself at line 20 (\u0060canonicalize\u0060) with a piece of \u0060value\u0060 (and at line 27) \u2014 and nowhere in \u0060canonicalize\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 \u0060canonicalize\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3-bench/src/canonical.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"44998b80487874bf0a3a052dcc9e446dc25e11e7b68564a499cd08331341895c"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060get\u0060 is public and takes a \u0060J\u0060 as its receiver from its caller, and it calls itself at line 20 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. 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. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060get\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"kimi-k3-harness/crates/k3rs/src/json.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b59354b94737069482c7154e5a7ce2c23943232bbba538c1a93f22a9827090b"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060to_canonical_json\u0060 is public and takes \u0060value: \u0026serde_json::Value\u0060 from its caller, and it calls itself at line 215 with a piece of the document (and at line 221) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. 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. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060to_canonical_json\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/kernel/src/session.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec2da23ec510447942feed3603480230c8f76717327d5461a2d23d30c862ca6"}},{"ruleId":"X2","level":"note","message":{"text":"Not all async functions that make a request accept an AbortSignal: Only 5/13 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: complete: \u0060complete\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":"services/apicompletions/src/providers/openrouter.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ebd789eca2acafd0087d48953d89d91d7d3b489784d4f010b2ab84d677e2d34"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: invoke: \u0060invoke\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/redblue/src/attacks/sandbox.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b14c6290a43350696e37f2922c0b39fe8a3d696d386c5fb0279499d823a680"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: loadGsm8kFromHub: \u0060loadGsm8kFromHub\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/evals-math/src/data.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"113c77456411b14b50375dbb47ace3ddf756a6a1c7d8a814dddbf00e51bff9c1"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: generateMutation: \u0060generateMutation\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/darwin-mode/src/openrouter-mutator.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"08640b44aec5655651f1781af4e34fdc711ced7cda0c194e6b22a2a9bcb785a4"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: generateMutation: \u0060generateMutation\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/darwin-mode/src/requesty-mutator.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"220568e31b3172ec67a232efc0a705f60367f7adfdb002321644d576cb28a57f"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: pinJson: \u0060pinJson\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/create-agent-harness/src/publish.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdece658ca49ec0a2ca734c1028519a83c7e73e241b7aca5651f31b2974f5141"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchRepoFiles: \u0060fetchRepoFiles\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":"apps/web-ui/src/components/RepoImporter.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"7991eb7a0778c918a4e8e62889e542ac871ded47acfeb634853c51a14edc4e1b"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: waitForServer: \u0060waitForServer\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":"apps/web-ui/scripts/screenshot.mjs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"53cd1c672eb85b1bf69b1826b7facbb8e2db668cbc4f7438aaaeca2fe83f88e1"}},{"ruleId":"X25","level":"warning","message":{"text":"Option is kept and never read: \u0060CodeqlDetectorOracle\u0060 accepts \u0060opts.timeoutMs\u0060 from the caller and keeps it in \u0060this.timeoutMs\u0060 on line 65, where only it can read the value \u2014 but nothing ever reads \u0060this.timeoutMs\u0060. Setting \u0060opts.timeoutMs\u0060 therefore changes nothing: every caller gets the same behaviour whatever they pass, and nothing reports that the option was ignored. Read \u0060this.timeoutMs\u0060 where the behaviour it configures is decided \u2014 or, if the behaviour genuinely is fixed, remove \u0060opts.timeoutMs\u0060 from the accepted options so callers stop setting a knob that does nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/src/security/codeql-oracle.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f267c4937ebc7af5208dc4bbb4a652220ca5fec3660d3bd62fc145b07b7daf"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060HandlerOutput.decision\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/kernel/src/hooks.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd7eb7a4ca30df522d5bfe5841ffb68e4dfd9f01f44a9f150e5713ced35e8d2"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060HandlerOutput.additional_context\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/kernel/src/hooks.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad57c41fbfde5808fd496241a539ba1365ec6f5ca232d04b7298087444d526c"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060HandlerOutput.updated_input\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/kernel/src/hooks.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c6ba98576d9e100d341a7aaee4a8633e74e3ee81a5389ea6a5e6d06e5eb27b4"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060AgentMeta.role\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/template-catalog/src/lib.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"202efffb9fb12182384889673bc87e9062138fe47fa2e2ae9c655046aca76f7e"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ItemMeta.description\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/template-catalog/src/lib.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"478aad1da35c12be655b92e41eb32bb8840c009cb39dcba8459c864fbf35eddb"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060TemplateMeta.dir\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/template-catalog/src/lib.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"973452fc43f3937aeef2879a929438bdb19941b5d4584dcea266f8d0a04376b0"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060TemplateMeta.domain\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/template-catalog/src/lib.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9934e3391360245914b529965b614c46bb4d6a52f987d6ab862db38b3153264"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060TemplateMeta.description\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/template-catalog/src/lib.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"747ac6f8ff34e49742db770c8a54b18fe5f2f21e6626e57e7912b56b6594b28d"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060TemplateMeta.harness_desc\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/template-catalog/src/lib.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbfef94639efd313275bfb51306beb75e9cfda12590885acc3ec09af07129e90"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060TemplateMeta.quick_start\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/template-catalog/src/lib.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f38cdcfb67e5dcaf7afd894d77d02ccf0ea56d8c08c719fc35f41611837e82"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060TemplateMeta.tags\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/template-catalog/src/lib.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2aca98d6edaf61b2ac08201f940cb6dbaf595daf891c5ebd215da60d4e30e3f"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060TemplateMeta.mcp_servers\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/template-catalog/src/lib.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"977d015a480675e74b5fc6f4b7629602de1762fc84002e18c940e45102e55bac"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060TemplateMeta.agent_count\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/template-catalog/src/lib.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"f471627ea5f5939125ab84405a11865130c540b0fb90abb41b8039b2735ac260"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060TemplateMeta.skill_count\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/template-catalog/src/lib.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee3ab54a9b862bd95f793ddb7a376d71252fc68b49d1e576fce66f3904d4c3c4"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060TemplateMeta.command_count\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/template-catalog/src/lib.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fdcf2aebe30256df3b7ffaedbe67f104f9c246e3e95af7422da2d46fedb84fa"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060TemplateMeta.agents\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/template-catalog/src/lib.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab902efd15f2e5a9a3d7ff39e689b6277a3258520b25441b0bd8db83b0c072d7"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060TemplateMeta.skills\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/template-catalog/src/lib.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"a876040fb38df2a543f187667a34ff6a4d4e650055ad45a77769545f3098b020"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060TemplateMeta.commands\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/template-catalog/src/lib.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0922cb5e5dfa2c66775d37726d535ba48d98356d5e18c9ff3ffef7603e57039"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/jujutsu/src/capability.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b42eb5dc6245b86b188f3c3c4ed512c160b9630a91060bf8c5f3813700d48a3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/jujutsu/src/capability.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f98cc2c9adf88de69884887f1bb84b17446f311489a104a8eec116776f78c5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/jujutsu/src/bridge/adapters/agentic-jujutsu-op-provider.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d5d7bb3500933fe89fd1513ecab3aea7ba45248a39ba9ab60b2d5b215da21e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/jujutsu/src/bridge/adapters/agenticow-memory-provider.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b201b9859780ac67650e792ba8767d1489d05542c48471eec74dc54b5683e65"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/jujutsu/src/bridge/adapters/agenticow-memory-provider.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1f782f03b807c35e12bfe5e6ac75db377b895ea6fcc1ef323247d69332b7bd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/horizon/src/executor.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35991c122f5e28b9d670937719cff4aa8f5d0ade5d79dc421969260bebebe95"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flywheel/src/replay.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f9b20aad7f6da2668f406c9916bc2ba9d72b4024445003833edbea36dcb4a3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/flywheel/src/run.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfcdcf46957548ef71490a311a15dad535a370cb85f22a5919c2ea3a303dacfb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/evals-toolcall/src/normalizer.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f1b92544bbb678243afc8c6e65bfe6792675bb45b93fd32371100bcf2535c4"}},{"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/darwin-mode/src/archive.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"728ce806c14c534e0d0702697c494c204ee7a329fb135eeb542f1093abe439f5"}},{"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/darwin-mode/src/archive.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"2099969b2c17a76c505275dcf3b68fba3704e37a4b94a880125b70a4b2061fba"}},{"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/darwin-mode/src/mutator.ts"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec888e441c25206c24ab8cfdc137634f5e38737e1ba8425130f359590da841a"}},{"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/darwin-mode/src/numeric-archive.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0562010fb2f9d098412e390c2106ba8d842b89084373103c6e8cb6486b0dc3"}},{"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/darwin-mode/src/numeric-archive.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe81d2fb02aeb263053523238a08765e98fd2da51b07f196cc9861a73d3e9ff"}},{"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/darwin-mode/src/repo_profiler.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"356bf9bb324ac442370c2ee0ab607660efe1d0e0fc314958d90610fcbca84735"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/src/tier2-driver.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f6a6bd77295e704a3101a1a5bae14107c6d87d54550f136fc5ea1a3bc0578d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/src/tier2-driver.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b17652ec5f603bfddb5910ec6121eba12d56675a6ef03e6502ffb4593b9bf7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/src/gepa/metric.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"c949a3cee0c95e76e98d2765e8f9f0f252264ac7e88b81ceb8edba5d82339024"}},{"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/darwin-mode/src/contrastive/memory.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"950e63de6c2176c907d5dc6695f0a9e65e130250966bf918ad20b94db850c100"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/analyze-repo.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"d001c84b6f6f799ebf6b52b282f9637982c64b6a3352aebed264c89451bd728f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/analyze-repo.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f91808988a98f91a6fec6f19ada392e2cf789017228a2a2274bbeab9be5b20"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/analyze-repo.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3b53808461eb24705124d190da21128a8cc1e4824ff8d13a522dc3782437a4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/audit-cmd.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"20fefc58335c55a146c1424ca0100ac9837e43ea59a653627672c73fdc297cf0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/audit-cmd.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"98058323705d7e6b254a24b938c24aced15f215cfbcc50fbaf1e989ad4093079"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/diag.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d45726953e61cd251d6ca519aae357d99aa19422d61b8a7e7a18599cceccff"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/diag.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"c594602fcc32db73bc35e7b8600f7b0680890a73d559e115fa028721439cb7e9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/diag.ts"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8706a0a2d34a1018da9948f761111b8f1cb79b00551a25f0d3961fae2dd1cf1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/diag.ts"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc23b7b9baff703ebf4d01a3bb034a141993e7e08e84643ba6fa656fe690829"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/export-config.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b5a1a6e51241cf20c52499e608aa01ce63b57a6705197fe6c69f4ef564e50f4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/export-config.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"4abbdcd9145eb8852c6a66560b16d921a549719eec4973a1878fc17d7a476ec7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/export-config.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f241ab7eb5fb746c5a5a538dfafd196c9fc2f8a8bcf8f7efa926b72e5bc45e9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/index.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5a7c062ff4424317a7b59509cc8ef2c8a08bc0d2e94a9a3ac1f960b5a1df73"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/index.ts"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"522ff2b86b82981efba47d4c4142e61c63cee920ef9eeaeb22a9592d6028b7a0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/index.ts"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"aab01606f5a2d66687bfd9f1e6f83d97a4c46a5aa10fc83df865d38f6a630222"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/index.ts"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc71dca6265779798e89b58daa934af7da7cfda25b7e4bef7d19ba3f4e3165e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/index.ts"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc4104d4ddd5a97fa0c177b26101368559e572d6ff317e1be146b1cc3b79cf72"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/index.ts"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"922ddf1c10474eeb29726a18844fa15ce04784e085727cc4bd692dd240eccb6c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"501d6d7a9a6a1b8e6f39f1b6c0e5b91c63b631b7955077d0f53b790abf9ff408"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"35968280caf29ce283e67c56d052c59304f19c3b4b31248f853ed4584792331b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5e00335614070b105c6f37b833bb1b959f5331b265c00aa37de6d6787aa180"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7e6531e598494c2c259f3e02e3aec4b35cb98a512946e367cd8c7743e0521c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc51d5fcb69dd1db04818d033b669c19deb2df151950aa6fa18c35cb0bf5e32"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b8d57257b4729c1c20acbc389d84ce081a74a4cd0fbc1ce97e2b281c92fde8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"684b3f77416d2391a403343af8f3671e69fad831c9d462629c2a0c6c27fb4ac0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ed6cad0c155405f68660640930c142c4e7a53f6dddc33877f52afc1e25498e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/repo-scorecard.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ae9fa2107cf574b0c9b1b7ad562f382caba47bfc3069b046e7e70082d7994d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/repo-scorecard.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"865c376edc1ccfc29d2f3684cceb7bb1117475cde5886f4981632a6bfe5614c3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/repo-scorecard.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c5124e1eb7663ce9251277d9a0399c7a5add2201ceb6716fae8ab75eb41ac2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/subcommands.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb218f4bdb02496adc6cf12980389a6a4e163a4b1e09cbc7e5dcdd9bde5b28e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/subcommands.ts"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff583beb957ebfeb9e245668b33ed316609bb2c3e84c548e6c5152c6e73c237"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/upgrade-cmd.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9190812042d279f1403374c744a7e923c1ce7bbef22965f5096a63d853fed14"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/with-wasm.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"2686dc2edc6bbf00fe991279d4d9858484517e0a786da481b9bb5052d0a0a61a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/create-agent-harness/src/witness-client.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e48de36d9ad912a151cbb83ca8a3456c934e5a6d8b8c1a499fa658c67b2dae"}},{"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/create-agent-harness/src/writer.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf764520d95776e330a40a2f73b309e957dcf23d450d3c31962003e304494d64"}},{"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/create-agent-harness/src/writer.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"3848ae0d15d791d11bc161a63bc42b0732dfd0a653bdc9bddd83cb9971931c67"}},{"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/avo/src/repository.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbfa9aa9ea0de1cbbbf75e7552b43befd392a22dc910e49ab3f34425239e6a30"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3-chatgpt/src/tools.ts"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0fe694e282e5d64513e401505f088ec6159e72d9d6df020f06b90798dd99bf9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3-bench/src/runner.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f4263ccb99cf7d3f11b0a17127bbcffeac3feee9e79e95c86c97e741e58937"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3/src/python-bridge.ts"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b95099236a0722da2183f11751cb8fcefaf8a6c381fc10ad13eab161f418c6a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3/src/python-bridge.ts"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"e91321cc0206d3b687141c980d6103f0885eaac601addc5b64a84778d145e752"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3/src/python-bridge.ts"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"d576689f6eda3ae5cb2abb480ce4d51eec81d76a485d96b16f87d75b4e1f5d33"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/arc-agi-3/src/python-bridge.ts"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"51262f66547483e72e7d860ff80219ada55aceeac6f17e4a737b3bbeb3bc5fc9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/agntcy/scripts/generate-oasf-taxonomy.mjs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03b008f6cf660f6208724d30d51edd3fb72afe5c9d616d912a6d1c51cacd0d5"}},{"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/agntcy/scripts/generate-oasf-taxonomy.mjs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ba7596495fae348059cfb5e4d4990f381f94e470022861b3d3f6667998c9b2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web-ui/src/generator/repo.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e9fb92662a583dfe87c6d60212f86eb0d964d0a7fe592af565def865211459d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web-ui/src/generator/verify.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"de5bcde0d666b4e64ef706f7a440613e26fa60b4f380ea50140d15e878fb7121"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web-ui/src/generator/verify.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"a819d6c437f5f35cb0601106a3029be529e2c0cf05e7ec9a2aa542b63da234f7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web-ui/src/generator/verify.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"f55607311a5783a7df16012922f5a500ac654ffbecaa03d1a60f2454f0217e32"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web-ui/src/generator/verify.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d384ae500adfb30c7e0adbc7ca0b37105f8612b27b4a42e075836066afd16ad"}},{"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":"apps/web-ui/src/components/HostGuide.tsx"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"befeaa8c954669a854cadc0313fa7bb32778426aff7fd1f28c4dc09726b4811e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web-ui/src/components/OnboardingModal.tsx"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5feff043d7c9883da4896b1576ae09d7d70ce3c6ac26da51290e6b57224afca"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web-ui/src/components/OnboardingModal.tsx"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"33bcdfa491878da251b480aea2b68bc30d6fd00aaf18fe9903ceb8362ee7d523"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web-ui/src/components/OnboardingModal.tsx"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb977a108e2f08e0e175a2a7d4b7cca5054a1695f811a2ec9df965c68f82371d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web-ui/src/components/RepoImporter.tsx"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"245f81a61677ce8eec6a8f42e0eba69694543d82d4f6298896e4df43bdd232d6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web-ui/src/components/RepoImporter.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"e496e37f73026ea9a4c8360c934ebfdc008fad39cdad1a2162edb398be34b0cc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/web-ui/scripts/screenshot.mjs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc4d2f1b137f49c9115b01f22f9cfb476572051274b0949c71262601313f73f"}},{"ruleId":"X5","level":"note","message":{"text":"Null assertions (\u0060!\u0060) override strict null checking: ~2.8 \u0060!\u0060 null assertions per 1k TypeScript source lines \u2014 257 assertion(s) across the 91884 source line(s) of the 491 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/arc-agi-3/src/plan-archive.ts (21), packages/arc-agi-3/src/receipts.ts (10), packages/create-agent-harness/src/index.ts (10). 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/darwin-mode/src/gepa/metric.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"f503d847cf008bc658398fb9ded9a18433e56b380bd9a1b195f0d88bd78a33c4"}},{"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/darwin-mode/src/gepa/metric.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"7938554cedbf2093a675cab424d855c47be7a7d5deb7aca46337be87825060ae"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060writeBundle\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":"examples-packages/example-ads/bin/scaffold.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cbd90e960e73ef58ae773f1bb23f4eab77ad11f0fc0ff9c0dede1daded7f868"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060writeBundle\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":"examples-packages/example-aws/bin/scaffold.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b184b197c5f1c87e7336115181141918f0497c86e5d07cddf5dc82c959a22e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060writeBundle\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":"examples-packages/example-azure/bin/scaffold.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fba304fd28e697a3ad54fcac4df45fa3fbd6a5669f6549c055b3f0482fdb8db"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060writeBundle\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":"examples-packages/example-bio/bin/scaffold.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef44a2893ba2436613df55f09ce61543b0133353f231b817234ab41e4986e33"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060writeBundle\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":"examples-packages/example-datadog/bin/scaffold.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c853eb1925756b2d6ba6aa7b8d49f1379eb2d5642b7e5683fbd009190cff4e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060writeBundle\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":"examples-packages/example-fhir/bin/scaffold.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"4063350d689930dd05ee1682789ded8617f1cfade677268e5461073b6342d538"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060writeBundle\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":"examples-packages/example-gcp/bin/scaffold.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b35bfee5b8a911d9c5087c988e5efc0cc49483a456d4092fa5b57cf8ccb6eb9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060writeBundle\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":"examples-packages/example-github/bin/scaffold.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fbe78dd9d851f8af2dbc6321e06fc356ba4eed471e8e63cf64cbf0992964719"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060writeBundle\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":"examples-packages/example-huggingface/bin/scaffold.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"495defa7619b12e4ef4232afa3e3dac0833542fe4798d9a5247b0565622f0b32"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060writeBundle\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":"examples-packages/example-iot/bin/scaffold.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"430c050000e81e9f38336e6cec87a57cdee50e6d082bdec48671eaa64de0b045"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060writeBundle\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":"examples-packages/example-nasa/bin/scaffold.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0cb9de83d11ff16d84369f0b54349a319ce040cd8653a95380c43d1b24080e0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060writeBundle\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":"examples-packages/example-pinecone/bin/scaffold.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd37749604cac8a8f7ef09973ecee7a3ddb23d43bd7586a2df0e02f25cb11917"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060writeBundle\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":"examples-packages/example-qiskit/bin/scaffold.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"80dd555045e22433d8b626abcda215120fad7bf8b6cc783d5e8e8377432e7e30"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060writeBundle\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":"examples-packages/example-slack/bin/scaffold.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e32739d10f58a7a37a24f2716d7392860db47c577cea4fbd008672bc616a022"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060writeBundle\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":"examples-packages/example-stripe/bin/scaffold.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c164f093f41b99ed913565a38dbc524fbdd5fab5a3eefed06e63be65e91f82"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060writeBundle\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":"examples-packages/example-supabase/bin/scaffold.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a978a04b1ea2bdea2a9dd0e0dad14dccf96e9fab06fe423465b7cfe48386cdd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060writeBundle\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":"examples-packages/example-twilio/bin/scaffold.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b8b0beb4f008100f244d87d6ad83d8638e934e7324e53059ebdfd8d4d617ec"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060writeBundle\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":"examples-packages/example-web3/bin/scaffold.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1a2bae4fad407687e8238420d64f8e2151d1df18dff0dedcfed36168e971ff"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060retrieve\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/avo/src/memory.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"8304f3df0ff81b484f2bba2a91b0b7a6fc5b6c7f3fdfaaa59e37f2945ddde54c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060safeVer\u0060 swallows every exception into \u0060return \u0027unknown\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/aws-finops/bench/real-oracle.mjs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c2948b14f80aad8ca5a7b1422684d6c58f92b076f5990f50e318cbe4f348be8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060metaProxyLogLines\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/create-agent-harness/src/meta-proxy.ts"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba7924cbc97dbd4c9a53a27608fc5431bb793dbc1bccd36e0612e9647c0dc10"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060loadCatalog\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/create-agent-harness/src/index.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec0a2f1315678a0098211ae64ca96d184cef115f2c12f3ebe9433056a7a8205"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readClaims\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/create-agent-harness/src/mcp-cmd.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef9a44e88f918de4caaaf26e4dfeeacac92bd3c7bf8c98f1c154990a94b9099"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060countDir\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/create-agent-harness/src/score.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd33a592c117bd9debf1a7f7732796289aa699e89a5f6b50dd43a8a11d34337"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060listVMs\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/darwin-mode/bench/cve-bench/gcp-cascade-dispatch.mjs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3e194b16ed1df110e9a6fba8e44cfba7175655a95025204f83c86f00470d30"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060listVMs\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/darwin-mode/bench/cve-bench/gcp-validate-fleet.mjs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e455b98eea272aa2a9efcc8730264d8a46777780ba5838125e5b4c8759c4f9a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060usedVCPU\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/darwin-mode/bench/cve-bench/gcp-validate-fleet.mjs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec9ca6a02fa68caa309b2e8ddb6565a2823c8fe54370827c3ea3e6058780946"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060fsList\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/darwin-mode/bench/cve-bench/gcp-validate-fleet.mjs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"967ad06272bfd7f9f370306b411f417a170bf58a79f75a0e9ca38b38bf11a58a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060grepRepo\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/retort/greenfield-solve.mjs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"d708b568204ab05b689e3e9f9e03c95a2782ec7214910d97e34e93492dca8d34"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060memRecall\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/retort/greenfield-solve.mjs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ec5e837c47cef6a0c5e53a0029672ae340f75a581ce4576e88d5208e4eff90"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060orUsage\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/ruvector/ruvector-eval.mjs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7643e294e4ded9bbe71ae3c83b22d34f86cdedeb8f7eebdb18e75a18b80626"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060apiKey\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/ruvector/h1-pilot.mjs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"15768bdb06578c9b5b4ee425754584956efd6132cb4b5fad467fb1c71fb1dfd6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060searchTitles\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/darwin-mode/bench/ruvector/h1-pilot.mjs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d553e7522201d92a87f2a09744b2581767c7e99ebcdb57310113fc46e7a146"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060apiKey\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/ruvector/h3-pilot.mjs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e208c0459ea1d068e53d33b7ed52f91549a6aac0fbc126769eef07085bf9d00"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060searchTitles\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/darwin-mode/bench/ruvector/h3-pilot.mjs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"5522e1a0a79bd65d50f43ab32d3f4571b68dae499730e5faa62c118937cc9fd4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060llmPropose\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/darwin-mode/bench/swebench/evolve-arch.mjs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df56d333964f911ac04b08407ac9d5fe4fe2008c541b2b9977eb0877f6e9c85"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060listVMs\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/darwin-mode/bench/swebench/evolve-config.mjs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"983c291ec88045b9a19b2d3d4a7d43a784b8b930dc73059bdd919c860d19513d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060listVMs\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/darwin-mode/bench/swebench/evolve-perinstance.mjs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aaf9b1dbf3561f140d10476cf473e5663cf8bf6c79795caf9b19b4637b5546f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_rvfFiles\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/darwin-mode/bench/swebench/gepa/branch-memory.mjs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d674fcf9863a9eb8fc8161ad87a9a0d8bf848446aacc97289646867ccaf330"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readAuthToken\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/swebench/handoff-solver.mjs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca75b684cf8e0f9271846ef7502c96551bee0896eacab8f832630bff66b30d10"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060grepRepo\u0060 (in \u0060solveTier\u0060) swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/swebench/solve-agentic.mjs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"0552e804852cafddf41139d47339412adf9263f3ed26fb0aadb5a6240831ca89"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060solveFixed\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/swebench/solve-avo.mjs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a346defc36e8213c937dab7c2fdfe59b383cb1ba431af45904147c5b3881ef2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060branchDiff\u0060 (in \u0060solveAvo\u0060) swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/bench/swebench/solve-avo.mjs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"b43a84ec4aee5a3434b5b71d0d32b7b6a9047a737d8a4db810920f0b2e2e3d3d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060loadTraces\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/darwin-mode/bench/system-audit.mjs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27f82915fe89882bd84f1ca586f62c3e5fdc610a19378d969847108c5f7d991"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060read\u0060 (in \u0060extractSurfaceParams\u0060) swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/src/mock-sandbox.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9a691b8d770c31688479efdcb4c224e802636ad0fc5236e1a6912072e3d29f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readSurfaceGuidance\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/darwin-mode/src/llm-agent-sandbox.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d42b2405500fa45bdce029170acaee20f264508a70e9dfd663c53720bc95e09"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060safeParseObject\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/evals-extract/src/evaluator.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c51ba26b71d2954e4bcb10726d7f6f587412a027818420d7d5f0d30e5b14da"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060snippet\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/projects/bench/real-corpus-scan.bench.mjs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"6486cb8b826cfb2df7860e1f169257918e0d746df4bad8d3ce5c0a3012be18f3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060snippet\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/projects/bench/real-cve-corpus.mjs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed5323f17b7e7ccca9b68a2c98411979efead61fd78f99e4e1dd425def6fb36"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readEnvFile\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/redblue/src/integrations/hackerone.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2b3d50e3ab55533248eeb3b166495b326ee86176576d1a17bf22d63745920f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060listVMs\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/gcp-cluster.mjs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3f7a5a47ec9ced4404eb4619d087be5ab22f5ee7d53d7c8cb1cfc4bd8933b9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060serial\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/gcp-cluster.mjs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0e2fd05c755b0368642f888b2fc188e40ef276db5099498d2cc1b0ad81d96f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060verifyManifestSignature\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":"scripts/proxy-pin-drift.mjs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"37385afff3e3e5a370e201f1bb306467e1364b7e3319260b3a2541a7b7f49dde"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060listVMs\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/tbench-gcp.mjs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab8ebdf6abbb6fb2d20dcfee76c87334364ca11b82496c32545bd25fc379047d"}}],"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-1104","guid":"4c918cb5-b2a6-6c55-9963-a44ee464305e","name":"Use of Unmaintained Third Party Components","shortDescription":{"text":"Use of Unmaintained Third Party Components"},"helpUri":"https://cwe.mitre.org/data/definitions/1104.html"},{"id":"CWE-117","guid":"1cfadbc2-a979-485e-b768-c70fc922201e","name":"Improper Output Neutralization for Logs","shortDescription":{"text":"Improper Output Neutralization for Logs"},"helpUri":"https://cwe.mitre.org/data/definitions/117.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-1321","guid":"0367a99b-2a5d-7b52-a83b-6f4196022556","name":"CWE-1321","shortDescription":{"text":"CWE-1321"},"helpUri":"https://cwe.mitre.org/data/definitions/1321.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-1352","guid":"5257f322-5cfc-6b52-bedd-0b9a526b4c7d","name":"CWE-1352","shortDescription":{"text":"CWE-1352"},"helpUri":"https://cwe.mitre.org/data/definitions/1352.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-214","guid":"b10ad120-fb22-1351-9348-aa23b453e815","name":"CWE-214","shortDescription":{"text":"CWE-214"},"helpUri":"https://cwe.mitre.org/data/definitions/214.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-327","guid":"e51910ff-67b5-3c51-aa3d-92837d9eab90","name":"Use of a Broken or Risky Cryptographic Algorithm","shortDescription":{"text":"Use of a Broken or Risky Cryptographic Algorithm"},"helpUri":"https://cwe.mitre.org/data/definitions/327.html"},{"id":"CWE-345","guid":"d80d4b65-bbbe-b65d-958e-7ac466af18f9","name":"Insufficient Verification of Data Authenticity","shortDescription":{"text":"Insufficient Verification of Data Authenticity"},"helpUri":"https://cwe.mitre.org/data/definitions/345.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-502","guid":"f7d3b296-aac0-5c5a-b706-e07faba26c36","name":"Deserialization of Untrusted Data","shortDescription":{"text":"Deserialization of Untrusted Data"},"helpUri":"https://cwe.mitre.org/data/definitions/502.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-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-862","guid":"2d96ecd7-f7f1-7f55-9f3a-43bb5bafdf33","name":"Missing Authorization","shortDescription":{"text":"Missing Authorization"},"helpUri":"https://cwe.mitre.org/data/definitions/862.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-918","guid":"2e9b9091-5a0f-dc57-b644-7ad04bd56e64","name":"Server-Side Request Forgery (SSRF)","shortDescription":{"text":"Server-Side Request Forgery (SSRF)"},"helpUri":"https://cwe.mitre.org/data/definitions/918.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-939","guid":"12397742-f2c4-8254-8012-482c3356c551","name":"CWE-939","shortDescription":{"text":"CWE-939"},"helpUri":"https://cwe.mitre.org/data/definitions/939.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"},{"id":"CWE-95","guid":"400bba4e-483c-5c50-a695-114fa9168003","name":"Improper Neutralization of Directives in Dynamically Evaluated Code (\u0027Eval Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Directives in Dynamically Evaluated Code (\u0027Eval Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/95.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":"A01:2025","guid":"df693558-c822-0452-8f7b-4d53cb6bcc59","name":"Broken Access Control","shortDescription":{"text":"Broken Access Control"},"helpUri":"https://top10.owasp.org/2025/A01_2025-Broken_Access_Control/"},{"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":"A09:2025","guid":"78892bc9-3c98-495d-881c-8af1390d643c","name":"Security Logging \u0026 Alerting Failures","shortDescription":{"text":"Security Logging \u0026 Alerting Failures"},"helpUri":"https://top10.owasp.org/2025/A09_2025-Security_Logging_and_Alerting_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"},{"id":"CICD-SEC-7","guid":"4c4af28d-49e3-2d51-b597-e1396c49658b","name":"Insecure System Configuration","shortDescription":{"text":"Insecure System Configuration"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-07-Insecure-System-Configuration"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":70,"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."]}]}