{"$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":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"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":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AC1","name":"Text alternatives","shortDescription":{"text":"Text alternatives"},"helpUri":"https://codehealth.canine.dev/dimensions/AC1"},{"id":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX2","name":"Stateful singletons","shortDescription":{"text":"Stateful singletons"},"helpUri":"https://codehealth.canine.dev/dimensions/AX2"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX6","name":"Interface segregation","shortDescription":{"text":"Interface segregation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX6"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"DM6","name":"Domain \u2194 infrastructure boundary","shortDescription":{"text":"Domain \u2194 infrastructure boundary"},"helpUri":"https://codehealth.canine.dev/dimensions/DM6"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"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":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"P7","name":"Outbound HTTP resilience","shortDescription":{"text":"Outbound HTTP resilience"},"helpUri":"https://codehealth.canine.dev/dimensions/P7"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"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":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"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":"provider-coverage.update (cyclomatic 33): provider-coverage.update has cyclomatic complexity 33 (threshold 15). Most of this is not in the body itself: 7 of the 33 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 31, 53, 58, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/assets/js/provider-coverage.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd1bf9e0414f2f71a81fe3c0f61b22dedf0088c144aa41f49200aec68b4968b8"}},{"ruleId":"D1","level":"warning","message":{"text":"provider-coverage.root.addEventListener(\u0022click\u0022) (cyclomatic 20): provider-coverage.root.addEventListener(\u0022click\u0022) has cyclomatic complexity 20 (threshold 15). Of this number, 15 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":"docs/assets/js/provider-coverage.js"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"708d0052113bd07c6ecf3a859caac3bdafef1b3f3fbf383681e3094176408177"}},{"ruleId":"D1","level":"warning","message":{"text":"Chat.render_payload (cyclomatic 17): Chat.render_payload 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":"lib/ruby_llm/protocols/gemini/chat.rb"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"e542349bcdd84fa3118dc18a43fd14d882b504990f63b5882e89246135b966ed"}},{"ruleId":"D2","level":"warning","message":{"text":"provider-coverage.update (cognitive 18): provider-coverage.update has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, if/else 4 (5 pts), ternaries 3 (4 pts) (nesting depth added 2). Most of this is not in the body itself: 2 of the 18 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 31, 53, 30, \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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: docs/assets/js/provider-coverage.js holds 2 of the 4 methods over the threshold \u2014 including the worst \u2014 and 4 of the 8 points over it (50%), 2\u00D7 the next-largest file (lib/ruby_llm/mcp/http.rb at 2). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/assets/js/provider-coverage.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f9e27761bc2a5838b8485716fb582cb1f56a0e69e7a888fbe4106d8633e77b"}},{"ruleId":"D2","level":"warning","message":{"text":"Stream.read (cognitive 17): Stream.read has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), error handling 3 (6 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":"lib/ruby_llm/mcp/http.rb"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c3c52cc538fb72eef74c849761732c8007e312dcaf559258e68314f5a795d9e"}},{"ruleId":"D2","level":"warning","message":{"text":"ResearchJob.research (cognitive 17): ResearchJob.research has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 pts), error handling 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/research_job.rb"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"4474aaa35c4e8dd23654d4852b6a381eb4af394027f0416ed69d66932aac01f6"}},{"ruleId":"D2","level":"warning","message":{"text":"provider-coverage.root.addEventListener(\u0022click\u0022) (cognitive 16): provider-coverage.root.addEventListener(\u0022click\u0022) has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 9, ternaries 4 (5 pts), error handling 1, if/else 1 (nesting depth added 1). Of this number, 10 points are the body\u0027s own statements and 6 belong to 2 function literals inside it that branch. To reduce it, 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 file is where this pass\u0027s cognitive complexity CONCENTRATES: docs/assets/js/provider-coverage.js holds 2 of the 4 methods over the threshold \u2014 including the worst \u2014 and 4 of the 8 points over it (50%), 2\u00D7 the next-largest file (lib/ruby_llm/mcp/http.rb at 2). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/assets/js/provider-coverage.js"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"9771818a6f981bdccb009fdb9649c790769add9c111f6593d247546005394dc6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Chat: TooManyMethods \u2014 231 methods. The bar is 30 methods; this is 201 over it, 7.70\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":"lib/ruby_llm/chat.rb"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd529bbaeaf7041ee25bba3a6a788edeced169c6874b9502450d4d674f85af2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Provider: TooManyMethods \u2014 112 methods. The bar is 30 methods; this is 82 over it, 3.73\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/provider.rb"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec3ad234faa09282ecc3964abd11c572407171f9f0b15238e60432a86cc5a33"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MCP: TooManyMethods \u2014 111 methods. The bar is 30 methods; this is 81 over it, 3.70\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":"lib/ruby_llm/mcp.rb"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8b555945a795c0a3ff352525fdfb7ceccfd44f1cf2f726c31d8a27242b0add"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ruby_llm/chat.rb: FileTooLong \u2014 1723 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1223 over it, 3.45\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":"lib/ruby_llm/chat.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e832fa2797d70189c78773d33c51de28bd7e974c70ff4f6475818d84e409bd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Protocol: TooManyMethods \u2014 92 methods. The bar is 30 methods; this is 62 over it, 3.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocol.rb"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed03da0226a49a8c73c0087abdb1e15f8130f25147655617510ec7e9b397347"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ChatMethods: TooManyMethods \u2014 79 methods. The bar is 30 methods; this is 49 over it, 2.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":"lib/ruby_llm/active_record/chat_methods.rb"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e54bc762769e50c59fcc3098cc97aa00004dc639e475f48fc43536e266564fb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Agent: TooManyMethods \u2014 78 methods. The bar is 30 methods; this is 48 over it, 2.60\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/agent.rb"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d9500729283afec3c7a644fc434a75e3ae7004958e10947c3aa1ae09731c1b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CodeExecution: TooManyMethods \u2014 76 methods. The bar is 30 methods; this is 46 over it, 2.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/code_execution.rb"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"660186fde3ef3df11ba565185bf47418f79e83ad4a242ca822929d37ddebb5c4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Models: TooManyMethods \u2014 71 methods. The bar is 30 methods; this is 41 over it, 2.37\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":"lib/ruby_llm/models.rb"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd4107c047fbb64b786b3dad554fab7b48217f1637e83f3d1736f158beddee7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Chat: TooManyMethods \u2014 70 methods. The bar is 30 methods; this is 40 over it, 2.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/anthropic/chat.rb"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"7939d2407900f451aad4a34b71517ace00c03aa71f55a23e71ee483e61fbe382"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Chat: TooManyMethods \u2014 70 methods. The bar is 30 methods; this is 40 over it, 2.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/chat_completions/chat.rb"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b8df1c25da5842cc4d97be6b427b5b0be4ad0ba17cb081bf4d4aadbbceeb8c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Chat: TooManyMethods \u2014 69 methods. The bar is 30 methods; this is 39 over it, 2.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/converse/chat.rb"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cfe0bc6ed969458de0dfa02a22d4a66d97e273cc934909220bdbc2e4e931eac"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RunClaims: TooManyMethods \u2014 64 methods. The bar is 30 methods; this is 34 over it, 2.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/active_record/run_claims.rb"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f54f146a2437aa91a2faf92a0ecceac85345bd2d962c9027ae5191abc2b4a9d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Chat: TooManyMethods \u2014 62 methods. The bar is 30 methods; this is 32 over it, 2.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/responses/chat.rb"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"f87f0ac9457524116388b46f106767c133a7b6e5f9715ac9e165ccaa58b48b82"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Attachment: TooManyMethods \u2014 58 methods. The bar is 30 methods; this is 28 over it, 1.93\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/attachment.rb"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2eb3e260716badec85a8f1ecc49419fbae4415bed15331d2bc9e2108ad8985f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Bedrock: TooManyMethods \u2014 51 methods. The bar is 30 methods; this is 21 over it, 1.70\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":"lib/ruby_llm/providers/bedrock.rb"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"17fd36464ad7befd12b23a6de8a2f73bbeab8e91016eade3d19b36804ed03d54"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Cost: TooManyMethods \u2014 50 methods. The bar is 30 methods; this is 20 over it, 1.67\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":"lib/ruby_llm/cost.rb"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d32f8d6540ff031b361d6285931935af2f1811eec6fb0af7df007f2e12e74c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GeneratorHelpers: TooManyMethods \u2014 47 methods. The bar is 30 methods; this is 17 over it, 1.57\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/generators/ruby_llm/generator_helpers.rb"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4115d688e0d7e8b90ce353c06d78f6b67342334a350a7ee5126c8e04608de03"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Tool: TooManyMethods \u2014 46 methods. The bar is 30 methods; this is 16 over it, 1.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/tool.rb"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab40fae51d3efb03c614c00f1b656ad0f79975304b398b8f82cc80826aba307a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Message: TooManyMethods \u2014 45 methods. The bar is 30 methods; this is 15 over it, 1.50\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/message.rb"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a49182ea6096588b72a0baea9f3091c6f613947a89d37fe09d7cdb54a38d9bc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Chat: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 over it, 1.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/gemini/chat.rb"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fd8b3afa275cc52eff54f3aeb2255c955380d0ea73ab12ec7e51deaecbd564f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Batch: TooManyMethods \u2014 42 methods. The bar is 30 methods; this is 12 over it, 1.40\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":"lib/ruby_llm/batch.rb"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a45b4e494d2700c5620c8b36b61145a8891ffd57e4b506036aa0d6adf71cf7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MessageMethods: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/active_record/message_methods.rb"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eec4afc70efe07c00b1abc9ec9f0eae167175759bcce2f0a07cd39da5340db9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ChatUIGenerator: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/generators/ruby_llm/chat_ui/chat_ui_generator.rb"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b076cf130da4097ab40d765825157dd3e4433148f55be6f31d06feef65f58f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Scaffold: TooManyMethods \u2014 37 methods. The bar is 30 methods; this is 7 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/generators/ruby_llm/provider/scaffold.rb"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"213164bbf226b0739814d890c0a2533d5cbc92fefdbedd5ceb26b7f4f0d3828c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ruby_llm/mcp.rb: FileTooLong \u2014 602 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 102 over it, 1.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/mcp.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d2a40042724dc28c75fef91cd2b881df1869234e1bf17619a3a62a2af897e0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FileStore: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\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":"lib/ruby_llm/file_store.rb"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b03e5301e1ca3dfa162c1c133c9d2a22b926ae25d7c195874b1558b78007922"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Question: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\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":"lib/ruby_llm/question.rb"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"3509885b9ba09c62ddb636758a34e17b3dddf22f43af112f101f1980d11d718d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: active_record/chat_methods.rb: FileTooLong \u2014 584 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 84 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":"lib/ruby_llm/active_record/chat_methods.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9fc1879ccc7f0f79230c0b7bf6d4bb06eae74263197f1377d137a027321d431"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AttachmentHelpers: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/active_record/attachment_helpers.rb"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2169d574696446fc88b840d85c6a5023f96f227640bb3f43b4f605880941875"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ruby_llm/protocol.rb: FileTooLong \u2014 581 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 81 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":"lib/ruby_llm/protocol.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7642647f97f6c26d32679c8db36e3952900b154c27c8202cb452c2aa7786ab28"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RubyLLM: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm.rb"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a55bdf8906570be9751ce99cc6e25f1ab535076045fe81bea41f11b4df9b2e7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: HTTP: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/mcp/http.rb"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a214e7521eab4f0dcb2daa49b8e1462ef5559219080959f864d0d900f508f81"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Connection: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/transport/connection.rb"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7458859a71fb65f75fe823e2b14d2a43696cf2c4f70e6e2175df18d05e33ef"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ruby_llm/provider.rb: FileTooLong \u2014 563 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 63 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":"lib/ruby_llm/provider.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3cc9e87d3b0db66f33e11ba939c62f8de1acd1b8acab67cbf32cc18b34c5222"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ruby_llm/models.rb: FileTooLong \u2014 558 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 58 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/models.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66092231dc95478f4586781c10ba3787c83065ffe50ceceb9eafdd69e51b3545"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ruby_llm/code_execution.rb: FileTooLong \u2014 551 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 51 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/code_execution.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98713c5d15431f726d301a2a80e1b974ff732faed198a0742f1b3498e3a36d49"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ruby_llm/agent.rb: FileTooLong \u2014 546 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 46 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/agent.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad04cdffaa6b50fd485f7f718286b9a50fab8a7140c7b31b1466a55c5f90ab6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: VertexAI: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/providers/vertexai.rb"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c6f68f240190c8cb01fe699edd467dd750597ad3da9310beddd43e31adf8b86"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Streaming: 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":"lib/ruby_llm/protocols/converse/streaming.rb"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b55241951fbdf6da13e487e095b35fd7ca486dc3fd2e1760a8cf6752c334f2b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: converse/chat.rb: FileTooLong \u2014 512 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 12 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/converse/chat.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f542ef5f587da8fe585d2234dddc50c06ea9f5b9f2f282e9cb982672f1e1d2b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/ruby_llm/batch.rb:106-119 | lib/ruby_llm/batch.rb:123-136 \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":"lib/ruby_llm/batch.rb"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"6178581d049ec0233b5f23a0c387c3c0e3cb20f26e6754a89d57f827667082a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): lib/ruby_llm/provider.rb:144-165 | lib/ruby_llm/provider.rb:189-206 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/provider.rb"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"920a276aa6a8af3deff277dc5cbe874ba609ef01fa4fa10d3a303fec649cb9b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/ruby_llm/protocols/interactions/request_shapes.rb:32-42 | lib/ruby_llm/protocols/responses/request_shapes.rb:34-41 \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":"lib/ruby_llm/protocols/interactions/request_shapes.rb"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"328bd880d6e9b09664400334497cf30ec0d1ae4582c080f1f3e4187d17a56747"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): lib/ruby_llm/protocols/bedrock/files.rb:19-36 | lib/ruby_llm/protocols/vertexai/files.rb:20-36 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/bedrock/files.rb"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"50381f14572a47a69e439d781b3ef94be08bc04a799d835594ce5ee7dc05193b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/ruby_llm/protocols/anthropic/request_shapes.rb:15-22 | lib/ruby_llm/protocols/mistral/conversations/request_shapes.rb:12-18 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/anthropic/request_shapes.rb"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"5789b85e2e6d6f65b59edbd1965e7ed2367ad003200cba81c36c42b1c10a0d15"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/ruby_llm/protocols/chat_completions/images.rb:34-48 | lib/ruby_llm/providers/xai/images.rb:60-73 \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":"lib/ruby_llm/protocols/chat_completions/images.rb"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb341ce2f7d6fe00b42440e3419b50ac4a632bb80a1773f49e5096d0ff75a1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/ruby_llm/protocol.rb:446-452 | lib/ruby_llm/protocols/elevenlabs/speech.rb:24-33 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocol.rb"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"1016ffa66586212d5f22f028872927ae8e65ab2d42a7a455b4b15b1cea68cf0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): lib/ruby_llm/protocols/interactions/streaming.rb:97-101 | lib/ruby_llm/protocols/mistral/conversations/streaming.rb:73-77 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/interactions/streaming.rb"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42c6a9ca687d1d1161b636c02e34031ae4dd28fb06c0eda4aa93e4b855afccc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): lib/ruby_llm/protocols/invoke_model/nova_embeddings.rb:18-26 | lib/ruby_llm/protocols/invoke_model/titan_multimodal_embeddings.rb:10-18 | lib/ruby_llm/protocols/invoke_model/titan_text_embeddings.rb:10-18 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/invoke_model/nova_embeddings.rb"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b9c37d3589b8b6cd35ef9165299718344eff419d43e9d334bee4f96c0d7a50"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): lib/ruby_llm/file_store/tools/edit.rb:23-34 | lib/ruby_llm/file_store/tools/read.rb:28-40 | lib/ruby_llm/file_store/tools/search.rb:27-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 12 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":"lib/ruby_llm/file_store/tools/edit.rb"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae53be941e0ebf825ebf14016e7e04340c0b48b19dbb24621e6c2c21627295cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): lib/ruby_llm/protocols/chat_completions/transcription.rb:84-92 | lib/ruby_llm/providers/mistral/transcription.rb:30-39 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/chat_completions/transcription.rb"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"4017b54cbf3ad719af2ab770875c21697a1a98bcfa1d2cb696442e141ede0b2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/ruby_llm/protocol.rb:345-352 | lib/ruby_llm/protocols/invoke_model/stability_images.rb:20-26 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocol.rb"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5f0eb6b86d557665533ba58be14315546728872112812cd6500081d1f53a869"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): lib/ruby_llm/code_execution/packages.rb:155-163 | lib/ruby_llm/code_execution/ruby_installation.rb:71-80 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/code_execution/packages.rb"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"232b3cbf6a8a215c58b0e0e5ab0105caf7cbca2ef66369485ed9f2351ce2965f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): lib/ruby_llm/protocols/openai/decisions.rb:109-114 | lib/ruby_llm/protocols/system_one/responses.rb:38-43 \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":"lib/ruby_llm/protocols/openai/decisions.rb"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"871694782266d4bdee74a69d6f8cca59a387841bb84e2152836d78e17e216948"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): lib/ruby_llm/protocols/openai/decisions.rb:118-123 | lib/ruby_llm/protocols/system_one/responses.rb:47-53 \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":"lib/ruby_llm/protocols/openai/decisions.rb"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"7478a48ef538a88e2c89b24435dd93bec23846d1de408a7b338493256aab4a6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): lib/ruby_llm/ocr.rb:62-66 | lib/ruby_llm/video_job.rb:60-65 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/ocr.rb"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0935d55cb813ade071991982c35db3cfc50c17ad2be3f8f3f7e4dc760f588ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): lib/ruby_llm/protocols/anthropic/models.rb:23-38 | lib/ruby_llm/protocols/gemini/models.rb:9-23 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/anthropic/models.rb"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cde4ff83e91c249035dab381fc3c3088a6c70c681787ddaece5d4020a0eff02"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): lib/ruby_llm/protocols/chat_completions/rerank.rb:39-50 | lib/ruby_llm/protocols/cohere/rerank.rb:40-51 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/chat_completions/rerank.rb"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"766aa8e8000c9404acd70fb98a946ccc8a020b063265cdafb570d5ff621807a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): lib/ruby_llm/protocols/deepgram/streaming_transcription.rb:79-82 | lib/ruby_llm/protocols/xai/streaming_transcription.rb:107-112 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/deepgram/streaming_transcription.rb"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"f778301b92fc3ddfc5c943c5647419445e6f61a0869fc0650ffa18ffe5f1cf9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): lib/ruby_llm/code_execution/workspace.rb:274-280 | lib/ruby_llm/file_store/directory.rb:160-165 \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":"lib/ruby_llm/code_execution/workspace.rb"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3796f570bd466a990ef542411ab5b97eb687456a91d511ccae8f146a89d9df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): lib/ruby_llm/protocols/chat_completions/models.rb:15-25 | lib/ruby_llm/providers/xai/models.rb:26-39 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/chat_completions/models.rb"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36e38566e0a9bedad8d687104480e08dfdc0facb663b3b1875dd0be9ef388e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/ruby_llm/protocols/converse/media.rb:120-133 | lib/ruby_llm/protocols/converse/media.rb:152-165 \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":"lib/ruby_llm/protocols/converse/media.rb"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"353fa8cfc9426692d706e57bf3ea89bbd6f9b0339fc5aa9517d114118729e98e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/ruby_llm/providers/vertexai/anthropic/batches.rb:39-46 | lib/ruby_llm/providers/vertexai/chat_completions/batches.rb:40-48 \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":"lib/ruby_llm/providers/vertexai/anthropic/batches.rb"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"1998a712434ba4396ebc434333b847edc3593877dda48b08620e9b7aeaa1eb59"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/ruby_llm/protocols/cohere/batches.rb:63-70 | lib/ruby_llm/providers/mistral/chat_completions/batches.rb:76-87 \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":"lib/ruby_llm/protocols/cohere/batches.rb"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0df78bb369c21ee2867eb26823200c6673ec075a098aded47834f92c1911429"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): lib/ruby_llm/protocols/interactions/transcription.rb:41-43 | lib/ruby_llm/providers/vertexai/transcription.rb:55-57 \u2014 These two members are one piece of code written twice and then edited apart: 3 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":"lib/ruby_llm/protocols/interactions/transcription.rb"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a827f52774e02666e3c340172240f9453d8bdb916a068c62af69536e7bf748c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 12\u002B corresponding lines): lib/ruby_llm/providers/azure/media.rb:15-27 | lib/ruby_llm/providers/gpustack/media.rb:15-28 | lib/ruby_llm/providers/mistral/media.rb:15-28 | lib/ruby_llm/providers/ollama/media.rb:15-26 | lib/ruby_llm/providers/perplexity/media.rb:15-26 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 12 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/providers/azure/media.rb"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddaa738f168812d359ac2b8c72af579ec0ffedbe6e621ee7cd4c53bac17d4c47"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): lib/ruby_llm/protocols/anthropic/tools.rb:78-88 | lib/ruby_llm/protocols/converse/chat.rb:480-495 | lib/ruby_llm/protocols/gemini/tools.rb:135-147 \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":"lib/ruby_llm/protocols/anthropic/tools.rb"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"8351bd3e905b0aa3cd433d726e5058aea76e41f5924c03fe6c14afbf788977f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): lib/ruby_llm/protocols/bedrock/files.rb:40-51 | lib/ruby_llm/protocols/vertexai/files.rb:40-52 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/bedrock/files.rb"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e61fafbbdcbd34d30f466e5ff3d3e9ead05d32e592fb4ad5ab5b1b0d70c4cb94"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 10\u002B corresponding lines): lib/ruby_llm/protocols/anthropic/files.rb:33-42 | lib/ruby_llm/protocols/gemini/files.rb:81-91 | lib/ruby_llm/protocols/mistral/files.rb:23-33 | lib/ruby_llm/protocols/openai/files.rb:27-37 | lib/ruby_llm/protocols/xai/files.rb:23-32 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/anthropic/files.rb"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"278e25ca93d3492f8249ca12ae95728f46852dd740dcca28716795b5aaa579e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): lib/ruby_llm/agent.rb:751-760 | lib/ruby_llm/tool.rb:127-135 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/agent.rb"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c71be6afc31150c31f238c2542c80144f7611855d055da9f668938b82c46d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/ruby_llm/protocols/chat_completions/images.rb:83-89 | lib/ruby_llm/providers/xai/images.rb:46-52 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/chat_completions/images.rb"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15f104d67b636e9d02e5ec524cd377423352de3ae3d84106bf27f1c5ee21d4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): lib/ruby_llm/providers/deepseek/responses.rb:46-50 | lib/ruby_llm/protocols/responses/chat.rb:561-565 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/providers/deepseek/responses.rb"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b5a017e2da31f212bb017d43ac40559c14b2428daa7df85364051906cfeda5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/ruby_llm/protocols/interactions/streaming.rb:17-23 | lib/ruby_llm/protocols/mistral/conversations/streaming.rb:11-17 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/interactions/streaming.rb"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9b1aa03b57f3c65e1251cda80a5f8b10fd0f50b96d56ac0aebc6d50f40a735"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): lib/ruby_llm/protocols/chat_completions/tools.rb:31-44 | lib/ruby_llm/protocols/cohere/tools.rb:19-30 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/chat_completions/tools.rb"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5fb716fcda482719b28ceabe48703ec442987a40851b5627f596441cca34409"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): lib/ruby_llm/protocols/gemini/streaming.rb:109-116 | lib/ruby_llm/protocol/streaming.rb:248-253 \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":"lib/ruby_llm/protocols/gemini/streaming.rb"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"b70e009b97d9256f207c6418b388d81a1d94bb3d23f90823fe5df44210dd996f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/ruby_llm/protocols/perplexity/agent.rb:75-81 | lib/ruby_llm/protocols/responses/streaming.rb:97-103 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/perplexity/agent.rb"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"890f971b979334e96ade981891ffd93c034f1800e204f705dab82932056a6beb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/ruby_llm/protocols/anthropic/tools.rb:59-65 | lib/ruby_llm/protocols/converse/chat.rb:303-310 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/anthropic/tools.rb"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e88494a57874a564b510a4043c38e3a36b0df1e1075b93b8a34d03bf3a7eaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): lib/ruby_llm/providers/hetzner/chat.rb:38-46 | lib/ruby_llm/providers/openrouter/media.rb:16-24 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/providers/hetzner/chat.rb"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"8371ba345be2f1b3dc1845207661d012d7b95a38f4f2ee33584964ee920136a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 4\u002B corresponding lines): lib/ruby_llm/protocols/bedrock/async_videos.rb:26-29 | lib/ruby_llm/protocols/gemini/videos.rb:25-28 | lib/ruby_llm/protocols/minimax/videos.rb:33-36 | lib/ruby_llm/providers/azure/videos.rb:21-24 | lib/ruby_llm/providers/openrouter/videos.rb:24-28 | lib/ruby_llm/providers/xai/videos.rb:38-41 | lib/ruby_llm/providers/zai/videos.rb:24-27 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 4 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 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/bedrock/async_videos.rb"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b59fd778ceb270a5ed7442484a4c59a76788688c82b8407657db0cdeb638119"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): lib/ruby_llm/mcp/http.rb:235-242 | lib/ruby_llm/support/cancellation.rb:28-35 \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":"lib/ruby_llm/mcp/http.rb"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d9b72d39f711e2cac94b2ccdf2c4cba000c082b7cc97352454a7d9a2030b37"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): lib/ruby_llm/protocols/chat_completions/chat.rb:429-433 | lib/ruby_llm/protocols/responses/chat.rb:423-427 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/chat_completions/chat.rb"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"d40ec6cedf02d5713cb6e1a6f887b454efbd151435a0d722238de049d9b60545"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/ruby_llm/cached_content.rb:102-109 | lib/ruby_llm/uploaded_file.rb:143-149 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/cached_content.rb"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e50fe65097edeeeea1fdb5065edc18e3cb9383e59e2d605100f25e52f797f16"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): lib/ruby_llm/protocols/gemini/chat.rb:409-411 | lib/ruby_llm/protocols/gemini/streaming.rb:96-98 \u2014 These two members are one piece of code written twice and then edited apart: 3 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":"lib/ruby_llm/protocols/gemini/chat.rb"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e79a6dd894d941f2a7e0973bffc0ddcc8c53013fc9b06954339ac6d20040f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): tasks/support/mutation_testing/cassette_lock.rb:46-50 | tasks/support/mutation_testing/spec_selection.rb:37-42 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tasks/support/mutation_testing/cassette_lock.rb"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a4a915e1ac303ee5e351c050652de50369c3c282cade24bd772703ecc3f66a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): lib/ruby_llm/protocols/anthropic/chat.rb:265-268 | lib/ruby_llm/protocols/cohere/chat.rb:76-80 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/anthropic/chat.rb"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a12335699a472d501a6ca6bced6148e679cf0a9cb1182a46e03efd639a1acd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): lib/ruby_llm/protocols/gemini/videos.rb:111-114 | lib/ruby_llm/providers/vertexai/videos.rb:54-56 \u2014 These two members are one piece of code written twice and then edited apart: 3 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":"lib/ruby_llm/protocols/gemini/videos.rb"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"d10393a3b0a320aed1179c8c3dbc8068d63d7d214ea43fc29ebe3ae35720b2af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): lib/ruby_llm/cached_content.rb:89-92 | lib/ruby_llm/video_job.rb:79-81 \u2014 These two members are one piece of code written twice and then edited apart: 3 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":"lib/ruby_llm/cached_content.rb"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc4f700f8fff303336ebdc54c2e05f989d517a88d01722771a7844958f119990"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): lib/ruby_llm/protocols/anthropic/chat.rb:513-518 | lib/ruby_llm/providers/openrouter/chat.rb:126-131 \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":"lib/ruby_llm/protocols/anthropic/chat.rb"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"4adef6c0b6c5bc5247e3f7f509060c3e5b2e1cb178ed7d4419fb5e81eb001f05"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): lib/ruby_llm/protocols/converse.rb:62-64 | lib/ruby_llm/protocols/invoke_model.rb:17-19 \u2014 These two members are one piece of code written twice and then edited apart: 3 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":"lib/ruby_llm/protocols/converse.rb"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"bddabdfa601351bc91d9c198ab65a969f97c25beb566e580da41f55e04c66e6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): lib/ruby_llm/providers/openrouter/videos.rb:69-74 | lib/ruby_llm/providers/xai/videos.rb:73-78 \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":"lib/ruby_llm/providers/openrouter/videos.rb"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"66264af7551644ccd82d66ee261b9e7a9e36d9d28eb5bce202f5d982b59a0c7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): lib/ruby_llm/protocols/chat_completions/request_shapes.rb:63-65 | lib/ruby_llm/protocols/interactions/request_shapes.rb:46-48 | lib/ruby_llm/protocols/responses/request_shapes.rb:45-47 \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":"lib/ruby_llm/protocols/chat_completions/request_shapes.rb"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"502eabf231e07a827a6b328c5fffdfad566531e04e3a84501b95e05aa8816240"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 2\u002B corresponding lines): lib/ruby_llm/protocols/anthropic/request_shapes.rb:33-34 | lib/ruby_llm/protocols/converse/request_shapes.rb:32-33 | lib/ruby_llm/protocols/gemini/request_shapes.rb:39-40 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 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 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/anthropic/request_shapes.rb"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f631b2bf5652d130d3c3009c26cb2b1e94b55b2fbfa2e6eaf5e34bae7a0a01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/generators/ruby_llm/provider/cli.rb:125-133 | lib/generators/ruby_llm/provider/cli.rb:138-146 \u2014 both copies are in the same file, so extract the block 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":"lib/generators/ruby_llm/provider/cli.rb"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"299fd07ee4f1f726d1293f5649fb04f2c26ce385ae3c0598d733d4ccee07813e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): lib/ruby_llm/protocols/chat_completions/streaming.rb:46-53 | lib/ruby_llm/providers/openrouter/streaming.rb:26-34 \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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/chat_completions/streaming.rb"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e671010001a812c2886e9bc5da55f5185a46206ea75249a563418ae51883e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/ruby_llm/protocols/invoke_model/titan_multimodal_embeddings.rb:11-18 | lib/ruby_llm/protocols/invoke_model/titan_text_embeddings.rb:11-18 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/invoke_model/titan_multimodal_embeddings.rb"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8227f3b02b6b5dd091e648498989d8bdd2ae68dfe5cc559fe206c35faca515"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/ruby_llm/file_store/tools/edit.rb:24-29 | lib/ruby_llm/file_store/tools/search.rb:28-33 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/ruby_llm/file_store/tools/edit.rb:24\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/file_store/tools/edit.rb"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"742456880bf789b59b493aee36973ba4051005fa58ed656e4fa912625f364fb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): lib/ruby_llm/file_store/tools/write.rb:19-27 | lib/ruby_llm/skill/loader.rb:41-50 \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":"lib/ruby_llm/file_store/tools/write.rb"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"613fa687bd2f17460437dc147ffd83bb6d1840bee3480f8939ab4d4485f92a9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/ruby_llm/protocols/chat_completions/chat.rb:310-316 | lib/ruby_llm/protocols/responses/chat.rb:288-294 \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":"lib/ruby_llm/protocols/chat_completions/chat.rb"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"d884a59eb52ca34b3c49f155fc9b286c31937e9f9487ba16888211446e017a8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): lib/ruby_llm/protocols/chat_completions/chat.rb:320-325 | lib/ruby_llm/protocols/responses/chat.rb:298-303 \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":"lib/ruby_llm/protocols/chat_completions/chat.rb"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da240f316165d5ef6be4247c2a38c02d32185c5f7ad8958399d4c1c5642f71d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): lib/ruby_llm/protocols/converse/chat.rb:431-438 | lib/ruby_llm/providers/openrouter/chat.rb:135-142 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/converse/chat.rb"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03dba6f230f2c66462e06727bd7bcccc26ffe56a7d4c7777723cc83710d1517"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): lib/ruby_llm/protocols/openai/decisions.rb:101-105 | lib/ruby_llm/protocols/system_one/responses.rb:30-34 \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 \u0060lib/ruby_llm/protocols/openai/decisions.rb:101\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/openai/decisions.rb"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"3efff2c29742133b2ea0444e9c925c0622c77b3627bf3878087b86933e5c2653"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): lib/ruby_llm/protocols/bedrock/batches.rb:81-87 | lib/ruby_llm/protocols/vertexai/batch_prediction.rb:100-106 \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":"lib/ruby_llm/protocols/bedrock/batches.rb"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96b174abe9226280c99c4bf2209eacd2f8e50373bbd8c061f585bbbd44c3caf"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Gemini (LCOM4 22): Gemini\u0027s methods fall into 22 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 22 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":"lib/ruby_llm/protocols/gemini/media.rb"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d3ff81a008264934afc57e30ecb9ff8d8d62e485aeaa6215f63649b09de5f0"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: InstallGenerator (LCOM4 12): InstallGenerator\u0027s methods fall into 12 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 12 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":"lib/generators/ruby_llm/install/install_generator.rb"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"615cfb475f6333fed17450e883a034542a8715878cb02b6b2aa94902665f391b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: UpgradeGenerator (LCOM4 11): UpgradeGenerator\u0027s methods fall into 11 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 11 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":"lib/generators/ruby_llm/upgrade/upgrade_generator.rb"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33d49e512024f796bf89aad976fd23cba038c69c2d8fff70ae2de1b7118f873"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ToolGenerator (LCOM4 10): ToolGenerator\u0027s methods fall into 10 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 10 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":"lib/generators/ruby_llm/tool/tool_generator.rb"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"470d4f8c38fe7a3f3da8c39e9c93050739e96081f680c2b758aedf4ac28d749a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ChatUIGenerator (LCOM4 9): ChatUIGenerator\u0027s methods fall into 9 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 9 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":"lib/generators/ruby_llm/chat_ui/chat_ui_generator.rb"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1021ba11ae21d47f8bd2586c7acce6e65088713910084163812a956c439f69"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Protocol (LCOM4 8): Protocol\u0027s methods fall into 8 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 8 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":"lib/ruby_llm/protocol.rb"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b99905f70d2915f47fc6f81e2c8178fdec8d831ccab8f81300a7e38881906e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Scaffold (LCOM4 7): Scaffold\u0027s methods fall into 7 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 7 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":"lib/generators/ruby_llm/provider/scaffold.rb"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"e64a049f31f37bf828f7ca1f8be5c3879dab541b5502b206a137833d10a270d2"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Message (LCOM4 7): Message\u0027s methods fall into 7 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 7 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":"lib/ruby_llm/message.rb"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e021f50737c536880685319996d4611ce205aa857ebc877651c07ed4293fec"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Cohere (LCOM4 6): Cohere\u0027s methods fall into 6 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 6 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":"lib/ruby_llm/protocols/cohere.rb"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"6563692b94d0e8b18acd3cdb0b9069d9e0bd05bc29cd37f5c14eefadd54dadae"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Attachment (LCOM4 5): Attachment\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/attachment.rb"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"93705520aa614ecfce4d36f16e0b77485a7b3d62e60fa2d7c93d4fd4036ee30e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: MCP (LCOM4 5): MCP\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/mcp.rb"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bbf670b57506c6074f10b1fa93d75a074420048f5be37bb9fe6006f717f05af"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Task (LCOM4 4): Task\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":"lib/ruby_llm/mcp/task.rb"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"386a4e5c13f456e6ebfac81d66f5700b368f330355157dcb04bbe8e3e0953b9d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Model (LCOM4 4): Model\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":"lib/ruby_llm/model.rb"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6bbef56fb23eadb8a72feb33350a182766fe4effb303ec5f616d521f3dc2b4e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Provider (LCOM4 4): Provider\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":"lib/ruby_llm/provider.rb"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"8591929a0f8c4661b1a4aa3aca19c62ccf6cca7ee9d1b1d2d0a415dc060ebfdb"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Tool (LCOM4 4): Tool\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":"lib/ruby_llm/tool.rb"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"5edd05f48f86821a42c23d73fc25ac816a2ad297f656eecb0a96663399a6e5e3"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ModelCatalogPage (LCOM4 4): ModelCatalogPage\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":"tasks/support/model_catalog_page.rb"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f030ce84488afa8c21ea67cb54a312e4d72b3c61007cb03da74e2dc10924987"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/ruby_llm/protocols/gemini/chat.rb: lib/ruby_llm/protocols/gemini/chat.rb changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in Chat.render_payload at line 34. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 00:38:50 \u002B01:00\u0027 --until=\u00272026-11-14 00:38:50 \u002B01:00\u0027 --full-history --no-merges -- lib/ruby_llm/protocols/gemini/chat.rb\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/gemini/chat.rb"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c86e079c9f4672652e6197c50449c3d4964c8e3ab6beb44f9f027b602ebe35"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: docs/assets/js/provider-coverage.js: docs/assets/js/provider-coverage.js changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in provider-coverage.update at line 27. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 00:38:50 \u002B01:00\u0027 --until=\u00272026-11-14 00:38:50 \u002B01:00\u0027 --full-history --no-merges -- docs/assets/js/provider-coverage.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/assets/js/provider-coverage.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0064e0a0d81a405b6c7885e9be2e2d1842fc7b01813f396ef9861a755f97ce5"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060ruby_llm.gemspec\u0060 makes this repository a deployable product (line 51)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ruby_llm.gemspec"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"792e8d2fb51c81a5cb3e51a25a4e0eaa65d45b9a0893edb88d5a0514c7e0c3a9"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 2 project(s) overshoot their size bounds, lowering Project Cohesion to 0.0/10. The most over is \u0060(repository root)\u0060 (58564 LoC, 2063 module-visible types across 109 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c7e87f583a839ff6a0844245a4bfa3abc0b8c3437a05f24369455fa9b9bbb657"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7369a9cf2d532591f51abac4d7fe45a7d4faa936c8e5df7c9d702617c0d162e2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5cb1015df4478ff502a48c58113cfcd3746eed3c78105ad253fbc98d0ee635cb"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"714ddbdaf391320d55bac358792016977ecae3f0754fa22475b212a740dec4ee"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"20ad278d66aada355d3063c36432ff467284fd7a97178be48d49fbdaefd8df2c"},"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":"acb24eb8c9fd8a3e5c3afd517ef7101d03334ce0d9e4df7df140b1f32bf1a708"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"29f48cf20b5227b35dc6d4f706befd2f1883ed6c97c04ed559c5ac0e35477d9a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6d01d66af40054e63fc3a52197db68678914f9eb4659d769f6c8880c5f0b4faf"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a6bfd13d4d99b075991384967d88148e52f6b33a887d3332c21ef76a0d86f726"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"931b69a21ee3003cdd5578f737937207067f9289e70ff2d7f32971279abb92cc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"53f9baba302b4c731f89c8b2e32ae8ce44103a48bb336888d54b96de3ec54f80"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"abcb7feffea9cb461473a83eea5d7ba61fd66a6ceea0e663e347b4ff8680d766"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"73cb43e75987ceda8d1e0aa2c7f4304a093a8d32f0a744df88199737bce9b739"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b7649372582c086ba6b748301090e60e94092c3eb4ecc77f1ca4265f244f90a2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0a4c622cb808d8cc8ed2edac73f96a8d65c8c95926131d5d0f50e5c331de8a49"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"720d05a7b7541b5cb615b21da079cc4b7c5061b241d68bc8056be1b4f6349422"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fd57e0c8e62c11154d32a4287e123d1910402bee54ff14cb73e5663fb4b153e3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b09ea8adcc4130315c04fd5d809ac68ec66c972b44b98b32dfc8857f586700e0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6631eb021faa126a6ae028aad7d967209e15ef1a6b2f6242f7e97b7a5abc1618"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e27fdebd872266fac1e3da99f1bb709878b68b632941674880d71c6f3f1ec668"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6020e31b259e2c6715e8273fb63aaa8b07d6762f2a68aadc6f5f45801083ea89"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"23a3c153922061d8b6a12cb06526c89608d55d517be1e8a1ebe36191f905cd33"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"66296d1b660869bd015bf39a7914fbd31a7821c6a7cb7afba0a9a3675f258a7e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6d6d93c5ea3d257f39265be95c9c0a95a583ae1bb7c5f45a9eb84d7b10c75bfc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d302734be4e98bd324964484cae4242a57216790575642e1e2d89792a6546d2a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"247d91ba1719dc38b230ca4d731ac1875898aa51a459bb073e0dbfb3821473d2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3e9e9d938b2c8da22bea3ca1a54d8a9c4f22108683329559c9cdd3187495ca2c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"50adbcd711dca68f872cf2be71adcafe71227cad845e99d760eb77a975a1047e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8500bd444dd29b22a2b7ee47bd5fb7323de7a5296fca9e95d0d7da12354cfcad"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cde78f3f657ef71d1ac4a4470aa0df01cd34ece8ad37dd01bfbae847e824a0c7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"acc9f219f7a51c19aa9ae50e94e026e6a582bf06de34d5d431c2ad00f71c8cee"},"taxa":[{"id":"CWE-250","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":"d96b37454df43dc832e4e0d431b254bc33620fa1ac2cc2619a33667905b471d9"},"taxa":[{"id":"CWE-250","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":"b21ef51d97f04d1a8b921e635aca9ef4e877341aa2c3b0f6eaeabc61234774b6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c4cba96defced5ae384be91b8ea19baf524e2d100c321199da8bec12048497c4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fd34071f0a37397b22950926e6e7d533f19a1ab2e35c80a3ec230eef7195ce4c"},"taxa":[{"id":"CWE-250","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":"6504d8d1633fd2629c17cb911821ef9d4b240f323d5e1ebac2df01ac4726a04a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5cf4f8c5c122cffda2d108be61863e89e2bea08cf99e9069ed1aeeedc86bc2f6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"070cd3d7cec15541f701710c57674771858e2585beccdf3fbd37b6410b29af3b"},"taxa":[{"id":"CWE-94","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":"7495036cc1ed9178620f55c73a40e0e6fba7af122cc9491d05922e553051f630"},"taxa":[{"id":"CWE-94","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":"6bf4b4f5f6c8a2e48ce959a53609d887d38a1bc716063d6f1f6c662e7a57f3bf"},"taxa":[{"id":"CWE-328","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":"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":"fd7cbab131f8e7af0fb5044fa26d6f8240897fee0586e02dc085d30e2302871d"},"taxa":[{"id":"CWE-94","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":"4ba388ee787c8b0a14b202197556f29cab4dcd2fa6ec3864795678766c2a970c"},"taxa":[{"id":"CWE-94","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":"fa1a85c6926b4928601512f9da97833f8265d35375fc2c403583f69f09b52e5e"},"taxa":[{"id":"CWE-94","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":"a224bf956d2276629e3f2c0dc922fa5862bdcba8210fe1eda4d7cbfa527ddf92"},"taxa":[{"id":"CWE-94","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":"9398c20f96c11910414005960bcef24d51b48c08c33c80436559a1de3c615845"},"taxa":[{"id":"CWE-1265","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"64b10a347f3af66257446f1f8fec0956e5a1ea1de4295ea41e4052c4c0b12d60"},"taxa":[{"id":"CWE-1265","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"0166814bfa1e4a328b17f9e34f2ad7f331df34a485e1ffa50bbd54311f773515"},"taxa":[{"id":"CWE-1265","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"acf465fc665ce03aa12ce020b36adc3cde4a2de86db95ea902c0c5bbbc30d003"},"taxa":[{"id":"CWE-1265","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"b730171678fd17bd76ec7e5de4c57ab8666c6e48e20d4c1d23bf07c545e25219"},"taxa":[{"id":"CWE-1265","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"f5d410b790be923b3e5e976b241b11dfe6bfefbae78a8e8182e8d31400b0dbc1"},"taxa":[{"id":"CWE-1265","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"1149ec341f4ee874e43f24fe414f34efda504acf4bd901095dc1c3ff30679b1d"},"taxa":[{"id":"CWE-1265","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"2a82a80713cb80c7df8b4b271a4d6c43c1ee26e2dec98cd2b1ad630e729be6d1"},"taxa":[{"id":"CWE-1265","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"ddb2036bf41871ad50f0b21c5017fce86ec21db735fc4db45f9274d4afe06d71"},"taxa":[{"id":"CWE-1265","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"eec887631ac380b9340caaa9ca83162f66d68cda7bc13674d8c3ba38e8204f68"},"taxa":[{"id":"CWE-1265","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"6e52530ae0def400001732ed7f73a99e73715d973b5a32251e15b9afa3dae96b"},"taxa":[{"id":"CWE-328","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":"8804149d49a94540b76b8633019c4b339549bff4e3eb2bdb2f28458e5481fbfb"},"taxa":[{"id":"CWE-1265","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: speech.rb \u2192 embedding.rb, image.rb, provider.rb, transcription.rb: \u0060lib/ruby_llm/speech.rb\u0060 changes together with 4 other files \u2014 \u0060lib/ruby_llm/embedding.rb\u0060, \u0060lib/ruby_llm/image.rb\u0060, \u0060lib/ruby_llm/provider.rb\u0060, \u0060lib/ruby_llm/transcription.rb\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 4 separate couplings, not 4 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 4."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/speech.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c68ce7b8162e9147504e8b937ef5aad5c6988098074a9375ae6cc8b8dc52509"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: chat_tool_call_state.rb \u2194 run_claims.rb: \u0060lib/ruby_llm/active_record/chat_tool_call_state.rb\u0060 and \u0060lib/ruby_llm/active_record/run_claims.rb\u0060 change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060e76acd48\u0060 Answer a tool call that had started as interrupted on resume, never r\u2026; \u00604ed1b01c\u0060 End a stopped run\u0027s claims in a fiber whose thread is exiting (#1585); \u00602db8c71f\u0060 Keep a running tool call\u0027s claim when its process shuts down (#1582) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/active_record/chat_tool_call_state.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6f6edfa94b4070dd8e4bcc651334b1d6504211e7100814e4d2eefb2fb6a597"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: embedding.rb \u2194 image.rb: \u0060lib/ruby_llm/embedding.rb\u0060 and \u0060lib/ruby_llm/image.rb\u0060 change together 67% of the time (12 of the 18 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 12 shared commits counted here, the most recent 3 are \u0060d8419270\u0060 Run standalone operations through one Operation (#1392); \u00609e56e296\u0060 Share save and model_info across result objects (#1390); \u0060073ab733\u0060 Record one-shot usage in the ledger with an owner \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/embedding.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1381a037daadbb8cb3d6f35e339b419fcfb317a9abdbd3d8613b920f0a2c6737"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: embedding.rb \u2194 transcription.rb: \u0060lib/ruby_llm/embedding.rb\u0060 and \u0060lib/ruby_llm/transcription.rb\u0060 change together 56% of the time (10 of the 18 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u0060d8419270\u0060 Run standalone operations through one Operation (#1392); \u00609e56e296\u0060 Share save and model_info across result objects (#1390); \u0060073ab733\u0060 Record one-shot usage in the ledger with an owner \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/embedding.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc77c91a6a44e46bcc3b84ffc5a8bf1095d08f6ff221871372105243190cdf99"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: image.rb \u2194 transcription.rb: \u0060lib/ruby_llm/image.rb\u0060 and \u0060lib/ruby_llm/transcription.rb\u0060 change together 53% of the time (10 of the 19 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u0060d8419270\u0060 Run standalone operations through one Operation (#1392); \u00609e56e296\u0060 Share save and model_info across result objects (#1390); \u0060073ab733\u0060 Record one-shot usage in the ledger with an owner \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/image.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a984376b97f441d57c41016ef06ed07b3b25df7978b6eca894492dacc530d4"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: context.rb \u2194 provider.rb: \u0060lib/ruby_llm/context.rb\u0060 and \u0060lib/ruby_llm/provider.rb\u0060 change together 50% of the time (6 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060d44a0943\u0060 Drop Ruby 3.1, which reached end of life; \u0060a1a85133\u0060 Add OpenAI Decisions as a judgments backend (#1008); \u00605ade6e24\u0060 Add video generation with RubyLLM.animate and animate_later \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/context.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f71f3cc243d84a9bad6ec7c9b33e47ff5b58c25173983ba50af9de4ec5961b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: transcription.rb \u2194 provider.rb: \u0060lib/ruby_llm/protocols/chat_completions/transcription.rb\u0060 and \u0060lib/ruby_llm/provider.rb\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u00604a936931\u0060 Fix agent rescue_from, chunk types and VideoJob.find (#1361); \u0060cf384e83\u0060 Stream transcriptions with RubyLLM.transcribe; \u00605cdf01f0\u0060 Make one-shot API keywords explicit \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/chat_completions/transcription.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b0e6c75fe1628174236725bd5d27e07841d9bb20bdb9b34c40dff08d77e1c31"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: run_claims.rb \u2194 tool_call_state.rb: \u0060lib/ruby_llm/active_record/run_claims.rb\u0060 and \u0060lib/ruby_llm/chat/tool_call_state.rb\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u0060e76acd48\u0060 Answer a tool call that had started as interrupted on resume, never r\u2026; \u00604ed1b01c\u0060 End a stopped run\u0027s claims in a fiber whose thread is exiting (#1585); \u00602db8c71f\u0060 Keep a running tool call\u0027s claim when its process shuts down (#1582) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/active_record/run_claims.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"467b8a85518065e2cfd19275353c75029f56538505fecad6b7df20e7d26c38f0"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","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":"1152ca5a224fb2cdd7f25edd4439046433862ac88158728925675c0ecfe5ff77"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.home-play-button\u0060 moves (\u0060transition: transform 0.18s ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/assets/css/rubyllm-overrides.css"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"c75ff0b6255a58383845448b3d1af4c592ce2f52a9c6b6396275026b19782b51"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.home-demo-soon\u0060 moves (\u0060transition: opacity 0.18s ease, transform 0.18s ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/assets/css/rubyllm-overrides.css"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd457a377ecbdecb71c9cd83c7ccba8f4a9374928c1cb5c255c564463a1c61b"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.home-model-switcher-model\u0060 moves (\u0060transition: opacity 0.18s ease,\n    transform 0.18s ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/assets/css/rubyllm-overrides.css"},"region":{"startLine":1413}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba16dece6825294ece9fba9b149a5a72474143257a4e08eb59514244eaee7c5a"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.home-love-nav\u0060 moves (\u0060transition: color 0.18s ease,\n    transform 0.18s ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/assets/css/rubyllm-overrides.css"},"region":{"startLine":1568}}}],"partialFingerprints":{"codehealthFindingId/v1":"4768b52d3c51c7b2ea5260438ed6096a9b174f6724206088ce06143bd4b6e4ce"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.home-love-card\u0060 moves (\u0060transition: box-shadow 0.18s ease,\n    transform 0.18s ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/assets/css/rubyllm-overrides.css"},"region":{"startLine":1618}}}],"partialFingerprints":{"codehealthFindingId/v1":"506858204dfa70f662c513ad1ba6d4219375a993a64630be9ce5a8c331d03e94"}},{"ruleId":"AX2","level":"warning","message":{"text":"Stateful handler: TokenEndpoint: \u0060TokenEndpoint\u0060 serves requests (a Rack app is one instance the server shares across every request thread, so its instance variables are shared along with its class variables and globals) but updates that shared state with a read-modify-write outside any lock (self.class.requests; e.g. \u0060self.class.requests\u0060 in \u0060call\u0060 at line 26). Two requests that interleave between the read and the write lose one update."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benchmarks/vertex_ai.rb"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"573196323a7f7267f603f30c19ba18c505c0c4cfe7b1321691444822ec457d77"}},{"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":"spec/ruby_llm/chat_bedrock_thinking_spec.rb"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"e89046868b8ff313eb1f188c9b1466f39950515ec54e6072c80c0888b053bb74"}},{"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":"spec/ruby_llm/protocols/cohere/batches_spec.rb"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4f6213f4b31382b17531e664f1f6c5dd460be7851579f813edbd647b90256e"}},{"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":"spec/ruby_llm/protocols/cohere/batches_spec.rb"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"9638cf498ec17a5bce597468fcd7a0dda22a4190ac7cf80eeb62ae33fa261e4a"}},{"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":"spec/ruby_llm/protocols/vertexai/ranking_spec.rb"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"151a05a1ad4d89dc31b23419b629be2fb39adfaa14f6a4744e6cecdc0f25707d"}},{"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":"spec/ruby_llm/protocols/vertexai/text_to_speech_spec.rb"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"d727115a004f4c0e1d8a448513fdff7dd8821ecba7432b5496f4da6916a65f08"}},{"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":"spec/ruby_llm/providers/azure/cohere_spec.rb"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c0c8c7653af566930a5e87a07710ba09e16c06d6eaaebe64f8ae5b7071bfcd"}},{"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":"spec/ruby_llm/providers/bedrock/mantle_spec.rb"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"c21b64df0d0f8c2a8c0920181ee23f6ab43e4f9bbb94ecce94711ee8e09b88fd"}},{"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":"spec/ruby_llm/providers/elevenlabs_spec.rb"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"700d3f8650ecc181dde5694bad1fb8af79edb841e188464b78762a31a79f9251"}},{"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":"spec/tasks/mutation_testing_spec.rb"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a09784f278acbbab945b8e555fc2495fa716f219c396025dba840c2efd6a3a"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P12","level":"warning","message":{"text":"Coverage collected but not gated: CI collects a coverage report but no step enforces a minimum \u2014 coverage could halve and CI stays green. Add a step that fails the build when coverage drops below a floor (your coverage tool\u0027s minimum-threshold flag, or a coverage-gate action) so the number guards something. What was searched, so you can tell an absence from a miss: this repository\u0027s CI files AND its coverage configuration \u2014 the well-known coverage and test-runner config files, read at the repository root and inside workspace package directories two levels down, so a floor declared beside the tests rather than in the pipeline is credited \u2014 matched against the threshold settings this check knows by name. A floor set in your coverage service\u0027s web UI rather than in a committed file, or under a setting whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7f63c06044cf998d9a0698692df30d8873e29bc9b0c98ee829255017c1193d33"}},{"ruleId":"P6","level":"note","message":{"text":"Changelog looks stale/thin: The changelog this check read carries 2 versioned entries, against a bar of 3. Counted as either the distinct \u0060x.y.z\u0060 versions it names (a link\u0027s target is not counted) or its version-shaped section headings (\u0060## [1.2.0]\u0060, \u0060## V14.x.x\u0060, \u0060## Updates in 8.0.x\u0060), whichever is the larger \u2014 so a log sectioned by minor series counts its sections, not its individual patch numbers. Entries recorded somewhere this check does not read \u2014 release notes generated at tag time from a generator config it did not recognise, or a log kept outside the repository \u2014 are not counted here, and this row is about what is re-findable in the tree rather than about how often you release."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c9a74c249fe67853238d9c15085f7f97d31f51bb82455046aa10c2cef82f67b8"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060Faraday.get\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":"conformance/mcp/client.rb"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a47235b5b252e97b0767a58a77c3478016e1d31e9b2869e4b87898977526c74"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060Digest::SHA256\u0060 or \u0060OpenSSL::Digest.new(\u0022SHA256\u0022)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/active_record/attachment_helpers.rb"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc5e173dfea8cfbf061dd739d565749cac9d5c15de726e3ee7969ed46bc998c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060agent || allocate.bind(chat, input_values)\u0060 appears character-identically in 2 files \u2014 lib/ruby_llm/agent.rb, lib/ruby_llm/agent/callbacks.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/agent.rb"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a40d0fb7aac4befa964853ee72b72eefb0265620ce0be6050e1dbaa41cd5333"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060attachment.extension || attachment.format\u0060 appears character-identically in 2 files \u2014 lib/ruby_llm/protocols/converse/media.rb, lib/ruby_llm/protocols/invoke_model/nova_embeddings.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/converse/media.rb"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"8245baff0487d9d9160f530ba62bbb1d5f4d2fa3c426cedf98e9b4a318efc1c0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060attachment.image? || attachment.audio? || attachment.video?\u0060 appears character-identically in 2 files \u2014 lib/ruby_llm/protocols/elevenlabs/flows/media.rb, lib/ruby_llm/protocols/elevenlabs/flows/videos.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/elevenlabs/flows/media.rb"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"53bd920957705e94d2d0da68737b100084989dc0837431eff156f9ee00f945ea"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060attachment.processing \u0026\u0026 attachment.video?\u0060 appears character-identically in 2 files \u2014 lib/ruby_llm/protocols/gemini/media.rb, lib/ruby_llm/protocols/interactions/content.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/gemini/media.rb"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f624cd6d64afd66a9845f3fb5e2fbd55ad3c7a8267c77a72e2202781626b24b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060attachment.provider_file_uri || attachment.provider_file_id\u0060 appears character-identically in 2 files \u2014 lib/ruby_llm/protocols/converse/media.rb, lib/ruby_llm/protocols/gemini/media.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/converse/media.rb"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a178e271a28767052f34202015d102906de2b2149c5d7f998039135777e6d78"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060caching != false \u0026\u0026 message.cache_until_here?\u0060 appears character-identically in 2 files \u2014 lib/ruby_llm/protocols/anthropic/chat.rb, lib/ruby_llm/protocols/converse/chat.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/anthropic/chat.rb"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d46bac336547feb294d15e2285e16d4c85592f10594a0ce425540c1409118d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060caching != false \u0026\u0026 msg.cache_until_here?\u0060 appears character-identically in 2 files \u2014 lib/ruby_llm/protocols/responses/chat.rb, lib/ruby_llm/providers/openrouter/chat.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/responses/chat.rb"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab594628dbc1d0aa37902e739df090e307e9dbf85c05f048851685dbb18247f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060citation.start_index \u0026\u0026 citation.end_index\u0060 appears character-identically in 2 files \u2014 lib/ruby_llm/protocols/anthropic.rb, lib/ruby_llm/protocols/chat_completions/chat.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/anthropic.rb"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"59543fcf7257ce390954196cf46e3b46dc80d02330d741e7ff962ff1fb02b66a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060citations \u0026\u0026 !model.supports?(:citations)\u0060 appears character-identically in 5 files \u2014 lib/ruby_llm/protocols/anthropic/chat.rb, lib/ruby_llm/protocols/chat_completions/chat.rb, lib/ruby_llm/protocols/cohere/chat.rb, lib/ruby_llm/protocols/gemini/chat.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/anthropic/chat.rb"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7bebde0da60f130a6c5bd3b954c7204f0a27d2c1445e6eea98dfaf7263c0f9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060content.valid_encoding? \u0026\u0026 !content.include?(\u0022\\0\u0022)\u0060 appears character-identically in 2 files \u2014 lib/ruby_llm/file_store/tools/edit.rb, lib/ruby_llm/skill/loader.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/file_store/tools/edit.rb"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"065eec00db8ea076f28ddda7fc228bbc6da809948b2155207e5acdab44c1b017"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060content_type || file_content_type(attachment)\u0060 appears character-identically in 3 files \u2014 lib/ruby_llm/protocols/bedrock/files.rb, lib/ruby_llm/protocols/files.rb, lib/ruby_llm/protocols/vertexai/files.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/bedrock/files.rb"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b8bdf6c79db4518428f5d2832a4e401fc32a4b185510f6e9f4dce95a45c9c2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060data.dig(\u0027candidates\u0027, 0, \u0027content\u0027, \u0027parts\u0027) || []\u0060 appears character-identically in 3 files \u2014 lib/ruby_llm/protocols/gemini/chat.rb, lib/ruby_llm/protocols/gemini/streaming.rb, lib/ruby_llm/providers/vertexai/transcription.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/gemini/chat.rb"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7dc73ffdabc8fb4be50181e216d5eb5503600fc1b9f77cc8a33898e4f88c56"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060data.dig(\u0027candidates\u0027, 0, \u0027finishReason\u0027) || data.dig(\u0027promptFeedback\u0027, \u0027blockReason\u0027)\u0060 appears character-identically in 3 files \u2014 lib/ruby_llm/protocols/gemini/chat.rb, lib/ruby_llm/protocols/gemini/streaming.rb, lib/ruby_llm/protocols/gemini/transcription.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/gemini/chat.rb"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd831c2fbe44c5178a1e2b2e6bee441f5510cf6339e517ce1367edb12398a33a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060defined?(Rails) \u0026\u0026 Rails.respond_to?(:root) \u0026\u0026 Rails.root\u0060 appears character-identically in 2 files \u2014 lib/ruby_llm/prompt.rb, lib/ruby_llm/skill.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/prompt.rb"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"872e15ffa2bd1ab7eca91650a1585a63080b44e1af77c257bf7a2d675fb5608b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060index.is_a?(Integer) \u0026\u0026 index.between?(0, documents.length - 1)\u0060 appears character-identically in 3 files \u2014 lib/ruby_llm/protocols/bedrock/rerank.rb, lib/ruby_llm/protocols/chat_completions/rerank.rb, lib/ruby_llm/protocols/cohere/rerank.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/bedrock/rerank.rb"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"b99ba5d2a008d2efaba574c1c24c78c7a1f6fc748248f6bb14db98eeef028e5d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060last[:cache_control] || last[\u0027cache_control\u0027]\u0060 appears character-identically in 2 files \u2014 lib/ruby_llm/protocols/anthropic/chat.rb, lib/ruby_llm/providers/openrouter/chat.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/anthropic/chat.rb"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a96835d6bf21aea995bf545f729f66f9db4a46d3aa62de6af0cd0662749b2c0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060limit \u0026\u0026 content.is_a?(String) \u0026\u0026 content.length \u003E limit\u0060 appears character-identically in 2 files \u2014 lib/ruby_llm/chat/context_budget.rb, lib/ruby_llm/chat/file_references.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/chat/context_budget.rb"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"2085fbe068e8c481c04696e40dd721e885ae80bfd64250defa4fa38c5b87529f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060line.dig(\u0027status\u0027, \u0027message\u0027) || batch_error_message(line)\u0060 appears character-identically in 2 files \u2014 lib/ruby_llm/providers/vertexai/anthropic/batches.rb, lib/ruby_llm/providers/vertexai/chat_completions/batches.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/providers/vertexai/anthropic/batches.rb"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d16cf6482fca4a38afc738c4109bc3a725504008334d27be0d4252de5ea8a55"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060msg.thinking \u0026\u0026 producer_slug(msg) == @provider.slug\u0060 appears character-identically in 2 files \u2014 lib/ruby_llm/protocols/converse/chat.rb, lib/ruby_llm/providers/openrouter/chat.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/converse/chat.rb"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"8122fec3dfa9622fb7f945e5a9d869faaa3bdbaa48655250297893dcb107048e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options[:ttl] || retention_ttl(options[:retention])\u0060 appears character-identically in 2 files \u2014 lib/ruby_llm/protocols/chat_completions/chat.rb, lib/ruby_llm/protocols/responses/chat.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/chat_completions/chat.rb"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb2b01b720744d7f469ed6ef9f2d221ee368387fe8b5a8dde6965e8714a6ac3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060part[\u0027thoughtSignature\u0027] || part[\u0027thought_signature\u0027]\u0060 appears character-identically in 2 files \u2014 lib/ruby_llm/protocols/gemini/request_shapes.rb, lib/ruby_llm/protocols/gemini/tools.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/gemini/request_shapes.rb"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"8308b463e9a2c04da80ae21871cf0861d1c460d0c4b01170b2c1b1339a8b1c01"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060payload.key?(:input) || payload.key?(\u0027input\u0027)\u0060 appears character-identically in 4 files \u2014 lib/ruby_llm/protocols/chat_completions/embedding_batches.rb, lib/ruby_llm/protocols/responses/batches.rb, lib/ruby_llm/providers/mistral/chat_completions/batches.rb, lib/ruby_llm/providers/xai/chat_completions/batches.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/chat_completions/embedding_batches.rb"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"587d7603d9a1a4dacacd85caa36db6e1eb47aa76168754efd982ed50dcc4c092"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060payload.key?(:messages) || payload.key?(\u0027messages\u0027)\u0060 appears character-identically in 4 files \u2014 lib/ruby_llm/protocols/chat_completions/batches.rb, lib/ruby_llm/providers/openai.rb, lib/ruby_llm/providers/vertexai/anthropic/batches.rb, lib/ruby_llm/providers/vertexai/chat_completions/batches.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/chat_completions/batches.rb"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"3495ae22da6f8f3f50a9e43461f98d665ce055dd8bca36eec4fe81fca3fcd72b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060response.headers[\u0027content-type\u0027] || \u0027video/mp4\u0027\u0060 appears character-identically in 2 files \u2014 lib/ruby_llm/providers/azure/videos.rb, lib/ruby_llm/providers/openrouter/videos.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/providers/azure/videos.rb"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"7333183c5396b23904d8b78a5740cdda8143727a9a31d65b2f4d5c657cca314b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result[:source_id] || result[:url] || result[:title]\u0060 appears character-identically in 2 files \u2014 lib/ruby_llm/protocols/anthropic/tools.rb, lib/ruby_llm/protocols/converse/chat.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/anthropic/tools.rb"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b1652445569d307e3af7c9ff52974f20c5a4ed313c23731ee6a9c040150bceb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060store[path] || raise(ToolError, \u0022There is no file at #{path}. #{missing_hint(path)}\u0022)\u0060 appears character-identically in 2 files \u2014 lib/ruby_llm/file_store/tools/base.rb, lib/ruby_llm/file_store/tools/edit.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/file_store/tools/base.rb"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"299409e7e9a0e85ef57e9b3418315595d3652f434cd51cdbb08aed70e4d82334"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060thinking.respond_to?(:effort) \u0026\u0026 thinking.effort\u0060 appears character-identically in 2 files \u2014 lib/ruby_llm/open_telemetry/attributes.rb, lib/ruby_llm/providers/openrouter/chat.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/open_telemetry/attributes.rb"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31d7f2e38129995c0264236935c4b9f30d60d5059c9790542062fae2e8ecdff"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value.is_a?(String) \u0026\u0026 value.strip.empty?\u0060 appears character-identically in 2 files \u2014 lib/ruby_llm/configuration.rb, lib/ruby_llm/question.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/configuration.rb"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b707b7e3f8c3f49baf2ae4adf9abe975cbb7a93416f7b9ef50565c9e37aee1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value.is_a?(String) || value.is_a?(Array)\u0060 appears character-identically in 2 files \u2014 lib/ruby_llm/models.rb, tasks/support/model_registry_diff.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/models.rb"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d8ea785cd0f8c67c5acf5ced77417d4edf01da7e645ecc597d080efc8b307c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value.nil? || (value.is_a?(String) \u0026\u0026 value.strip.empty?)\u0060 appears character-identically in 2 files \u2014 lib/ruby_llm/protocols/chat_completions/images.rb, lib/ruby_llm/skill.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/chat_completions/images.rb"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"97021a45477ae43db94b3e0540f2eac1cf563e13024521f49c0bc8651f035301"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060wrap\u0060 is public and takes \u0060sources\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 70 (\u0060self.wrap\u0060) with a piece of \u0060sources\u0060 \u2014 and nowhere in \u0060wrap\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack 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. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060wrap\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/attachment.rb"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"d721094e42636087be81e3b8dfbcd38e561de0a41c730a3eb2930db63be3041c"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060deep_merge\u0060 is public and takes \u0060original\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 116 (\u0060self.deep_merge\u0060) with a piece of \u0060original\u0060 \u2014 and nowhere in \u0060deep_merge\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack 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. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060deep_merge\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/support/utils.rb"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"d767d8e05a235583c1d7e4dfb94b1536ce98adbc3ba248396608f2b5c26cbf61"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060deep_dup\u0060 is public and takes \u0060value\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 127 (\u0060self.deep_dup\u0060) with a piece of \u0060value\u0060 (and at line 130) \u2014 and nowhere in \u0060deep_dup\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack 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. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060deep_dup\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/support/utils.rb"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e6c877594adfc4e1ab63d22f257264274d1a6d2be898f4503b731789dd9f96"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060deep_stringify_keys\u0060 is public and takes \u0060value\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 144 (\u0060self.deep_stringify_keys\u0060) with a piece of \u0060value\u0060 (and at line 147) \u2014 and nowhere in \u0060deep_stringify_keys\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack 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. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060deep_stringify_keys\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/support/utils.rb"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d6c3049943e34791033d0751e8a1b6518a395a1ce672c686297e2fb313f3c11"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060deep_symbolize_keys\u0060 is public and takes \u0060value\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 160 (\u0060self.deep_symbolize_keys\u0060) with a piece of \u0060value\u0060 (and at line 163) \u2014 and nowhere in \u0060deep_symbolize_keys\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack 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. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060deep_symbolize_keys\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/support/utils.rb"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"715cf48d14fe6e29b4f8b004fe04f8752926ebab804f34a0b61a8a487ebaff08"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060references_only_definitions?\u0060 is public and takes \u0060value\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 47 (\u0060self.references_only_definitions?\u0060) with a piece of \u0060value\u0060 (and at line 49) \u2014 and nowhere in \u0060references_only_definitions?\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack 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. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060references_only_definitions?\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/gemini/schemas.rb"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d1ea5ca33f5a9dd66ce2387dce77b8dc7271897eecf17b886bbcfa18131ef2"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060identified?\u0060 is public and takes \u0060value\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 65 (\u0060self.identified?\u0060) with a piece of \u0060value\u0060 (and at line 66) \u2014 and nowhere in \u0060identified?\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack 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. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060identified?\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/gemini/schemas.rb"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"78103ce358186bfecae9a228033edbafd3009cb7e1540941eda98d634ad58d34"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060copy\u0060 is public and takes \u0060value\u0060 \u2014 which it walks as a \u0060Hash\u0060 \u2014 from its caller, and it calls itself at line 12 (\u0060self.copy\u0060) with a piece of \u0060value\u0060 \u2014 and nowhere in \u0060copy\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends stack 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. A walk like this one raises \u0060SystemStackError\u0060 past about 3,800 levels on the main thread and about 1,000 on a \u0060Thread\u0060 \u2014 where Puma serves requests and Sidekiq runs jobs (MRI 3.3 and 4.0). \u0060JSON.parse\u0060 stops at 100 levels by default, but the other parsers a caller may use do not: \u0060YAML.safe_load\u0060 builds 1,400 levels from 2.8 KB, \u0060Oj.load\u0060 100,000, REXML 200,000, and \u0060JSON.load\u0060 on json 2.7 (Ruby 3.3\u0027s default) or \u0060JSON.parse(\u2026, max_nesting: false)\u0060 58,000. \u0060SystemStackError\u0060 is not a \u0060StandardError\u0060: a bare \u0060rescue\u0060 or \u0060rescue =\u003E e\u0060 around the call does not stop it. Thread a depth argument through \u0060copy\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/judge/data.rb"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07781bc57ce6d59b62805ad4e6dff3144ca8e9660fe3cc713c7fa9c306cbc81"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/generators/ruby_llm/generator_helpers.rb"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"caeb0a606837503a0eb50db7542501024f93f329fbdc1d77b8d9f0c4db6185ab"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/generators/ruby_llm/generator_helpers.rb"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"b526f0c633f274b13ea677f3a57e12376ae32f68e696bc9727b68c6f6cff754f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060rescue StandardError\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/generators/ruby_llm/chat_ui/chat_ui_generator.rb"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e15e6fe1848b48e09addc48cf93b634182d90ea9f00166895c07497b7d71407"}},{"ruleId":"X5","level":"note","message":{"text":"Ruby\u0027s type checker does not check nil everywhere: This repository commits no Sorbet configuration (\u0060sorbet/config\u0060) and no \u0060Steepfile\u0060, so nothing type-checks its 575 Ruby product file(s): a nilable value reaches a method call silently and raises \u0060NoMethodError: undefined method \u2026 for nil\u0060 the first time it is nil. A \u0060# typed:\u0060 sigil does nothing without a \u0060sorbet/config\u0060 beside the code; a Steep run configured only on a command line is not something this check can read."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"32b27113b1bc22f400935e8620d19eae7fd3ef145cc36018609c445ea8cd4af1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060npm_names\u0060 answers \u0060[]\u0060 when \u0060ParserError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/code_execution/packages.rb"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a25f3bce421f5460310e4a4b3853af4e47cb65b8c2db422a2273b17c2a18e6a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060filename\u0060 answers \u0060\u0027resource\u0027\u0060 when \u0060InvalidURIError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/mcp/content.rb"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"be2690ae76d4eefef7b527159977dd552c892ee1da24cd652ca73b9826007ad5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060normalized_delta\u0060 answers \u0060{}\u0060 when \u0060ParserError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/protocols/converse/streaming.rb"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"6efc49a2f4b922230681710984e94fdf687c7162cc7eace9687e4b81be2a34be"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060loaded_names\u0060 answers \u0060[]\u0060 when \u0060ParserError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ruby_llm/tools/search.rb"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"6413b42052040477fcc1651a914bfae1a1dd1eeafb8321d01e86bc92b803631a"}}],"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-1265","guid":"9bfc5711-f2f2-6252-bd2e-ff21a1e98a6c","name":"CWE-1265","shortDescription":{"text":"CWE-1265"},"helpUri":"https://cwe.mitre.org/data/definitions/1265.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-250","guid":"52ee12e8-390a-7351-b1e6-388afa694e54","name":"CWE-250","shortDescription":{"text":"CWE-250"},"helpUri":"https://cwe.mitre.org/data/definitions/250.html"},{"id":"CWE-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-328","guid":"f0ffc869-97c3-dc5c-8825-be1159f1fc5f","name":"Reversible One-Way Hash","shortDescription":{"text":"Reversible One-Way Hash"},"helpUri":"https://cwe.mitre.org/data/definitions/328.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-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-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"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":"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/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"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":61,"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."]}]}