{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"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":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"DM4","name":"Rich vs anemic domain model","shortDescription":{"text":"Rich vs anemic domain model"},"helpUri":"https://codehealth.canine.dev/dimensions/DM4"},{"id":"DM5","name":"Encapsulated state","shortDescription":{"text":"Encapsulated state"},"helpUri":"https://codehealth.canine.dev/dimensions/DM5"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"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":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"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":"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":"QuantizedLayouts.recognize (cyclomatic 124): QuantizedLayouts.recognize has cyclomatic complexity 124 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/Quantization.swift"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e60ef272ba489ed4ac053af839d0a5fa28bf26c0941f9ff2e957462d668514"}},{"ruleId":"D1","level":"warning","message":{"text":"GestureOrder.parse (cyclomatic 120): GestureOrder.parse has cyclomatic complexity 120 (threshold 15). Of this number, 118 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/RemoteGestures.swift"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d43bedac7b444c2f67671fb42e82e9646ccdd4957c1caa7c60d5dae15931303"}},{"ruleId":"D1","level":"warning","message":{"text":"ForgeLoRA.forging (cyclomatic 88): ForgeLoRA.forging has cyclomatic complexity 88 (threshold 15). Of this number, 72 points are the body\u0027s own statements and 16 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/ForgeLoRA.swift"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6eadfb7e6417544c06c961421403aaa7da56e664ef14a9fc8d25d5d9df6d4ac"}},{"ruleId":"D1","level":"warning","message":{"text":"EngineError.errorDescription (cyclomatic 77): EngineError.errorDescription has cyclomatic complexity 77 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Errors.swift"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"8544144a1445f0f130d61e382a77bdcf20002c5caae42eadbe7dc4f1315c1612"}},{"ruleId":"D1","level":"warning","message":{"text":"Problem.sentence (cyclomatic 77): Problem.sentence has cyclomatic complexity 77 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/Problems.swift"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"09bfa1cc45c8f45924fb8d3fa3f4488ddf03a98a21f5e0efd7c3fcd9133722e0"}},{"ruleId":"D1","level":"warning","message":{"text":"CapacityPlan.forcing (cyclomatic 75): CapacityPlan.forcing has cyclomatic complexity 75 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacityPlan.swift"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"4688f4f0c168f3ffe0f260ca902fc7c14be21ae6d4892043b366f123e0ae85ab"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteControl.add (cyclomatic 73): RemoteControl.add has cyclomatic complexity 73 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl\u002BAdd.swift"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"11fb3d45f9992e3d60e260f94464d3523b375f9486e773788eed914fc11fa3e5"}},{"ruleId":"D1","level":"warning","message":{"text":"ForgeDiT.tensor (cyclomatic 67): ForgeDiT.tensor has cyclomatic complexity 67 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/ForgeDiT.swift"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"f722b420a5023f6b652bca7800aeed6b4a7937f0f8a6df8f640e4a73eba65671"}},{"ruleId":"D1","level":"warning","message":{"text":"WeightProducts.linear (cyclomatic 65): WeightProducts.linear has cyclomatic complexity 65 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/WeightProducts.swift"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"44bb765717b76f321a80a02a88b5b5fa9fffd49ec88a5fd112c291357ecea85a"}},{"ruleId":"D1","level":"warning","message":{"text":"EngineError.init (cyclomatic 63): EngineError.init has cyclomatic complexity 63 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Errors.swift"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0ad83360f57bb167d1159335774bd67681bbe570e747c64e6e1867869a904d3"}},{"ruleId":"D1","level":"warning","message":{"text":"Context.solo (cyclomatic 59): Context.solo has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacityProbesSolos.swift"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"61dd8f9c2f63b33099d10f802d2ca8acf98bda9e708668e1c24e6e14c416636f"}},{"ruleId":"D1","level":"warning","message":{"text":"AppState.receive (cyclomatic 57): AppState.receive has cyclomatic complexity 57 (threshold 15). Of this number, 56 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/AppState\u002BMirror.swift"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ac39da2a97ff148de95175c0584915ecdff81fad2c52a291a8c99cafaefadb"}},{"ruleId":"D1","level":"warning","message":{"text":"Context.attention (cyclomatic 56): Context.attention has cyclomatic complexity 56 (threshold 15). Of this number, 48 points are the body\u0027s own statements and 8 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacityProbesSolos.swift"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"d584b7e966d01a810f420945bf9e39d6dec471e266863e497953900c7c54fdf6"}},{"ruleId":"D1","level":"warning","message":{"text":"GGUF.parse (cyclomatic 54): GGUF.parse has cyclomatic complexity 54 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 25 belong to 5 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/GGUF.swift"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca94313bc376f89b0e773b811adee1e77d9a56fd2109b18cf01364349ebab00"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteControl.addOnMirror (cyclomatic 54): RemoteControl.addOnMirror has cyclomatic complexity 54 (threshold 15). Of this number, 45 points are the body\u0027s own statements and 9 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl\u002BMirror.swift"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"e33b0983a2b3eadc149a2ab350206d07fa64e961540ef5980789f50e259252b7"}},{"ruleId":"D1","level":"warning","message":{"text":"Installer.install (cyclomatic 51): Installer.install has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/Installation.swift"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3df80c89be2f99e1b272ecd409ea5be77b0d19e718bf2ed2f31e7700ba422dd"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteControl.parse (cyclomatic 49): RemoteControl.parse has cyclomatic complexity 49 (threshold 15). Of this number, 48 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl\u002BAdd.swift"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"63af7901487d76f8cb14b154fcb8790484a0d39b07022b89cec64492955166be"}},{"ruleId":"D1","level":"warning","message":{"text":"ProductAssignment.isRunnable (cyclomatic 48): ProductAssignment.isRunnable has cyclomatic complexity 48 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacityPlan.swift"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"c77024cc705b9b3120afba6f84d8e0bc689b2ca787fae98d5b5b509ad37da08f"}},{"ruleId":"D1","level":"warning","message":{"text":"RenderGrid.init (cyclomatic 47): RenderGrid.init has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/RenderGrid.swift"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"18435c78c81f9631040fea912d658b544482f49dea7a17bdad9857e148459478"}},{"ruleId":"D1","level":"warning","message":{"text":"Recipes.normalize (cyclomatic 45): Recipes.normalize has cyclomatic complexity 45 (threshold 15). Of this number, 44 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/Families.swift"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a1afe137c4609bbbdf00285822edfd5190a86dbb775e940c8fb9c0265084f7"}},{"ruleId":"D1","level":"warning","message":{"text":"NeuralEngine.run (cyclomatic 43): NeuralEngine.run has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/NeuralEngine.swift"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"116e02b61070fc66a440e7d8f2f078d0817e74ac4d2f90d883c8cd31531919ef"}},{"ruleId":"D1","level":"warning","message":{"text":"ProductSolver.widened (cyclomatic 42): ProductSolver.widened has cyclomatic complexity 42 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 10 belong to 2 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacitySolver.swift"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"464f93ab2dca1ddb24007d8de6ab9d4b863343f87a1655f07f81a1ed46870a1b"}},{"ruleId":"D1","level":"warning","message":{"text":"Artifact.parse (cyclomatic 40): Artifact.parse has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Artifact.swift"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d634b6b5f3b4829f54dca4cf889efd5b277b8c55e516792d00b20e76cbf21aa"}},{"ruleId":"D1","level":"warning","message":{"text":"T5Tokenizer.init (cyclomatic 40): T5Tokenizer.init has cyclomatic complexity 40 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/T5Tokenizer.swift"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"02520df45c676ecddfe0e003001453ace880264724d902d0d2536dea62f041b2"}},{"ruleId":"D1","level":"warning","message":{"text":"Context.trial (cyclomatic 39): Context.trial has cyclomatic complexity 39 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 15 belong to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacityProbesSharing.swift"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1c8dc8910f433637e9c32dd9f6f79fedcfba5e16bbbe18b02f89ade51d32f5"}},{"ruleId":"D1","level":"warning","message":{"text":"CapacityFit.model (cyclomatic 39): CapacityFit.model has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacityFit.swift"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"6067be87a3a9cacf5e9ac818a443140726818bfaf7ee475fb75f1bd99b678421"}},{"ruleId":"D1","level":"warning","message":{"text":"WeightProducts.prepare (cyclomatic 39): WeightProducts.prepare has cyclomatic complexity 39 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/WeightProducts.swift"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"263fcf584e3d802bda7be0cbb0f6a86d29dbb3ca684814751af11ee0c9759173"}},{"ruleId":"D1","level":"warning","message":{"text":"Krea2PermutedMap.write (cyclomatic 39): Krea2PermutedMap.write has cyclomatic complexity 39 (threshold 15). Of this number, 36 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Verification/ResidualPermutation.swift"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"db17c8f152daa07f4c2336b9f6dcc7b0eb0859f8b57684802057bc49cd2e0480"}},{"ruleId":"D1","level":"warning","message":{"text":"QwenImage21DiT.body (cyclomatic 38): QwenImage21DiT.body has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/QwenImage21.swift"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb96d01d069bf5f060f5eaa520fa01862bf1424ba853ac665563cc14413121e"}},{"ruleId":"D1","level":"warning","message":{"text":"Runner.run (cyclomatic 37): Runner.run has cyclomatic complexity 37 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Measurement/Runner.swift"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"59158bda7d7e5d3a218d917ef2350a887f357e57485266728cf26192200a6c92"}},{"ruleId":"D1","level":"warning","message":{"text":"Qwen3VLGenerator.generate (cyclomatic 37): Qwen3VLGenerator.generate has cyclomatic complexity 37 (threshold 15). Of this number, 33 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Qwen3VLGeneration.swift"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"8727ca1cc3da40f68d6b106d3d3ce15c96146fce60d5d415dd7fbeaad376307a"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine.execute (cyclomatic 35): Engine.execute has cyclomatic complexity 35 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/EngineRender.swift"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"70436ae2d855c9fdcaf9c5550f40c21dcadec0d5f744dc78c163be2d8faf783d"}},{"ruleId":"D1","level":"warning","message":{"text":"RenderGrid.axis (cyclomatic 35): RenderGrid.axis has cyclomatic complexity 35 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/RenderGrid.swift"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"438bfdf79bf01147a8b7daad79f5e693cfc6618f21f17e245ce7de773c204179"}},{"ruleId":"D1","level":"warning","message":{"text":"ProductSolver.native (cyclomatic 34): ProductSolver.native has cyclomatic complexity 34 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 7 belong to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacitySolver.swift"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"efdfed95058f4e796ed632c20da2cdbdeb222e11faada74a7ffb262ac7d30ade"}},{"ruleId":"D1","level":"warning","message":{"text":"Tokenizer.init (cyclomatic 34): Tokenizer.init has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Tokenizer.swift"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"21fda30d5312e7b0a943c4c21f98b77df9e1230fa763050fed39c627f13287f8"}},{"ruleId":"D1","level":"warning","message":{"text":"ForgeDiT.forge (cyclomatic 34): ForgeDiT.forge has cyclomatic complexity 34 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/ForgeDiT.swift"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"8180492270623bf6924067324ff45e75250849ea4ac48f524e87877c10cdb0a8"}},{"ruleId":"D1","level":"warning","message":{"text":"Safetensors.init (cyclomatic 33): Safetensors.init has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Safetensors.swift"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c6ff4b36afc1b7d5176ec8c29f0824319f59ee4e6068554f2f35676fdc9f732"}},{"ruleId":"D1","level":"warning","message":{"text":"AppState.execute (cyclomatic 33): AppState.execute has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/AppState\u002BRender.swift"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe196686f9682fcc7c988aa88c49011cdfe0fad7227fd21c0ca55a3b87f1429"}},{"ruleId":"D1","level":"warning","message":{"text":"Context.validate (cyclomatic 32): Context.validate has cyclomatic complexity 32 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacityProbesValidation.swift"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"2688e4e95fd70601684838acec3befb82b8b66d0bdc4c28b6e9911eefe3cfb6d"}},{"ruleId":"D1","level":"warning","message":{"text":"ProductSolver.evaluate (cyclomatic 32): ProductSolver.evaluate has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacitySolver.swift"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"db8eecba73df0799df1bf5db90bacec221b02e515a56152643f7ed001624f137"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteControl.handle (cyclomatic 32): RemoteControl.handle has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl.swift"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f77a7c444bd4283ea073983f5e5248b45fec35627a19f149b5dd08f25debcee"}},{"ruleId":"D1","level":"warning","message":{"text":"ForgeText.plan (cyclomatic 31): ForgeText.plan has cyclomatic complexity 31 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 13 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/ForgeText.swift"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"1913bceb2105f8e77009d97f82d1eb3369203456b6ef35dae5b3c1910c1c90ed"}},{"ruleId":"D1","level":"warning","message":{"text":"Invocation.init (cyclomatic 31): Invocation.init has cyclomatic complexity 31 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Verification/Invocation.swift"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b093dcc61f2e9a9a0abf7d1f121bd3137857ea8727daa96bdc03ee9ac23e699"}},{"ruleId":"D1","level":"warning","message":{"text":"QwenImageWriterStages.check (cyclomatic 31): QwenImageWriterStages.check has cyclomatic complexity 31 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Verification/QwenImageWriterStages.swift"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e10d2d6aa841c0d8ab2c6fc47ca4a6e78903429d9676431ca13d4ea3de1850f"}},{"ruleId":"D1","level":"warning","message":{"text":"MirrorServer.handle (cyclomatic 30): MirrorServer.handle has cyclomatic complexity 30 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/MirrorServer.swift"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d03c2178e5df050dfd4da3e51acb1814536644c80facbafa6666456f02ef179"}},{"ruleId":"D1","level":"warning","message":{"text":"MossImageStages.evaluate (cyclomatic 30): MossImageStages.evaluate has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Verification/MossImageStages.swift"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb574bd6cc5ac8975343a22df9dcfe116156ce2b0431403ec853b0d10bc46ee"}},{"ruleId":"D1","level":"warning","message":{"text":"ForgeLoRA.targets (cyclomatic 29): ForgeLoRA.targets has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/ForgeLoRA.swift"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"69242191ad5c0106cc5900e0f2260db39a0556adc0bf265405c30761eb21dfd0"}},{"ruleId":"D1","level":"warning","message":{"text":"Context.trialPair (cyclomatic 28): Context.trialPair has cyclomatic complexity 28 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacityProbesSharing.swift"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"283f538f0a01f09dcc665aa314da2f2c5758fc58c7b393997dc707ec7f516085"}},{"ruleId":"D1","level":"warning","message":{"text":"TokenizerJSON.string (cyclomatic 28): TokenizerJSON.string has cyclomatic complexity 28 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 7 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/TokenizerTables.swift"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"190ecbdec1299781f828c6316c4f9366fec9cdc4912074c9ae75ffe846a57ba3"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteControl.subjects (cyclomatic 28): RemoteControl.subjects has cyclomatic complexity 28 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl\u002BCommands.swift"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a5d870306bdd826ff1c1b72b2abf775f62707f4e55957460d4df68f44cf0683"}},{"ruleId":"D1","level":"warning","message":{"text":"Config.init (cyclomatic 27): Config.init has cyclomatic complexity 27 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Qwen35.swift"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"1904411671d0d1fe0c7bec1325d79f0e2fef837948738effdf3ebdb57ace6caa"}},{"ruleId":"D1","level":"warning","message":{"text":"QwenImage21Sampler.run (cyclomatic 27): QwenImage21Sampler.run has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/QwenImage21Sampler.swift"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c7c65f0db04637eaa9ca395e689acdbef90fe96e1717a790feb49c0c35e288"}},{"ruleId":"D1","level":"warning","message":{"text":"Attention.init (cyclomatic 26): Attention.init has cyclomatic complexity 26 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Attention.swift"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e7d87204774e4e3aec6c9a2a48395826e5396a63c3d0edcd94b2ff664ebc916"}},{"ruleId":"D1","level":"warning","message":{"text":"MossImageDiT.blockStreamed (cyclomatic 26): MossImageDiT.blockStreamed has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/MossImage.swift"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"e97c9c5167163225764d5eb94ff56cf9de613a0cd4b320e7b35d760a7119c37d"}},{"ruleId":"D1","level":"warning","message":{"text":"QwenImage21DiT.layerPass (cyclomatic 26): QwenImage21DiT.layerPass has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/QwenImage21.swift"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"5339db22ddda816ed7afc02e7f41462384a1c69108be3c375e3803e3be8ae477"}},{"ruleId":"D1","level":"warning","message":{"text":"MapWriter.write (cyclomatic 26): MapWriter.write has cyclomatic complexity 26 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/Map.swift"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"8224e85dfad65b9a75eabdee72fc204ff0a4c3f4fe0ba214c9f96f012b304d5a"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.value (cyclomatic 26): Parser.value has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/OrderedJSON.swift"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc8575a2c80f7e2751b021bc7eb79bff84fa5ce407cb78eb5b13b265f2e7396f"}},{"ruleId":"D1","level":"warning","message":{"text":"AppState.restoreSettings (cyclomatic 26): AppState.restoreSettings has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/AppState\u002BRender.swift"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"38db2b5ac08925339086c78044cedbcf708dd12947c156397d9a2d325905f19a"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteControl.library (cyclomatic 26): RemoteControl.library has cyclomatic complexity 26 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 8 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl\u002BPlace.swift"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ec1b0d50919d193feaf3370eb65ed448fdef88c1a47ce8666b716a8d45c2b7"}},{"ruleId":"D1","level":"warning","message":{"text":"Img2ImgStages.run (cyclomatic 26): Img2ImgStages.run has cyclomatic complexity 26 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Verification/Img2ImgStages.swift"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1de57a737d6559d8019efdb5d5d798bd2b2c1f66c900239b183af53e1c7e01"}},{"ruleId":"D1","level":"warning","message":{"text":"MeasureOptions.parse (cyclomatic 25): MeasureOptions.parse has cyclomatic complexity 25 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Measurement/Series.swift"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d3c7a2fb8709a04fd0d9fa584404a9d65b53bb77761437047c8e06357cd3e6"}},{"ruleId":"D1","level":"warning","message":{"text":"Context.convolution (cyclomatic 25): Context.convolution has cyclomatic complexity 25 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacityProbesConvolution.swift"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0549dfee3c86e36a31cd3be195d862ae376707a049cb515670552c28d90bacc"}},{"ruleId":"D1","level":"warning","message":{"text":"CapacityDisk.measureClasses (cyclomatic 24): CapacityDisk.measureClasses has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacityDisk.swift"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c2514cccf17183aeac458d09250958fb35b71632f18b46894c5996b72ca7e5"}},{"ruleId":"D1","level":"warning","message":{"text":"CapacityPlan.init (cyclomatic 24): CapacityPlan.init has cyclomatic complexity 24 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, 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":"Sources/Siliconed/CapacityPlan.swift"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"e16d87c56fbc689cf783e13c91b83fcc474a0dbc7020d74cd4dea12c06585f71"}},{"ruleId":"D1","level":"warning","message":{"text":"ProductSolver.timed (cyclomatic 24): ProductSolver.timed has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacitySolver.swift"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7294375398cc4f155f3211b8e62aef28fe62527f0b8c46db239b11858fb5b6f"}},{"ruleId":"D1","level":"warning","message":{"text":"MemoryPlan.choose (cyclomatic 24): MemoryPlan.choose has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/MemoryPlan.swift"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"82cbc8bb9b7fc9757f5f13e9e88f01f25eac5b60ae75206e1d0fb919720aa36a"}},{"ruleId":"D1","level":"warning","message":{"text":"VAEEncoder.init (cyclomatic 24): VAEEncoder.init has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/VAEEncoder.swift"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d03c69f57b6eaa732f5738a72cf067484ab36ad24bf1522f0e6444e4aec4ea"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteLink.attempt (cyclomatic 24): RemoteLink.attempt has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Remote/Link.swift"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e258831de3383ea051e2f55c23ff33338909910620177d14e4093ead0d1072"}},{"ruleId":"D1","level":"warning","message":{"text":"Artifact.scale (cyclomatic 23): Artifact.scale has cyclomatic complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Artifact.swift"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"821238cf2754a459a69a846876dd476263c6efa2e3293768cb206d96af0b6177"}},{"ruleId":"D1","level":"warning","message":{"text":"MainWindow.watchKeys (cyclomatic 23): MainWindow.watchKeys has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/App.swift"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"1344c79227618570f78a2f29a08c200e43156d21be822084ba1266d3c5b87059"}},{"ruleId":"D1","level":"warning","message":{"text":"AppState.perform (cyclomatic 23): AppState.perform has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/AppState\u002BLibrary.swift"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b31e110846d31052e55d97e098ffa4c84044b75f32799a6a02afbcba13a6d2"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteControl.addGrid (cyclomatic 23): RemoteControl.addGrid has cyclomatic complexity 23 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl\u002BAdd.swift"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffde07db4dad98ccff8776fb1fed19638f9444b39061b88d70028e8ce08caf37"}},{"ruleId":"D1","level":"warning","message":{"text":"CapacityFit.overlap (cyclomatic 22): CapacityFit.overlap has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacityFit.swift"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35ab510cccdaf3e9b8a464e8d709389eff849e1fef053507dc0cbe07284cc2e"}},{"ruleId":"D1","level":"warning","message":{"text":"ImageRGB.straightRGBA (cyclomatic 22): ImageRGB.straightRGBA has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/ImageToImage.swift"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"448e6ff797ebf030429cbdb4954af87d928d8bab09f5613b0f6c9c7ed20f9c98"}},{"ruleId":"D1","level":"warning","message":{"text":"DiT.forward (cyclomatic 22): DiT.forward has cyclomatic complexity 22 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/DiT.swift"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7af0f78615ecb40c8b4b457be30c54b712eaca27380c72314c9afdb49ba8b13"}},{"ruleId":"D1","level":"warning","message":{"text":"GEMM.accumulatedLinear (cyclomatic 22): GEMM.accumulatedLinear has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/GEMM.swift"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"375784cbdf6f63bc0c19a95199c0bd8f96f703125d2b8cc18cff5f556ea20f17"}},{"ruleId":"D1","level":"warning","message":{"text":"Krea2DiT.blockStreamed (cyclomatic 22): Krea2DiT.blockStreamed has cyclomatic complexity 22 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Krea2.swift"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f73d251dcb504e7f5fd9141fb6f2f68d6c701b02061b17f9b8ce277f3764b5"}},{"ruleId":"D1","level":"warning","message":{"text":"Qwen3VLDecoder.run (cyclomatic 22): Qwen3VLDecoder.run has cyclomatic complexity 22 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Qwen3VLDecoder.swift"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4bb1cd3733fa1e8c814e6b22f246217d59de667bc0e58ad88b17ef50127826"}},{"ruleId":"D1","level":"warning","message":{"text":"QwenImage21DiT.layerStreamed (cyclomatic 22): QwenImage21DiT.layerStreamed has cyclomatic complexity 22 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/QwenImage21.swift"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"f64b6545e4400c93608b6561832cb99f5c183ff2c9907d4f91444abf5cb1cc27"}},{"ruleId":"D1","level":"warning","message":{"text":"WeightProducts.int8Plan (cyclomatic 22): WeightProducts.int8Plan has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/WeightProducts.swift"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"9244508ab0a9422328d31254d0e7d0b844a10944217c5131fa8c028779f08234"}},{"ruleId":"D1","level":"warning","message":{"text":"ForgeDiT.order (cyclomatic 22): ForgeDiT.order has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/ForgeDiT.swift"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e720cc95191f5db0da0c0be20e5a0392279a4dc733f006e73ce49f3234c3006"}},{"ruleId":"D1","level":"warning","message":{"text":"MirrorLibraryHost.handle (cyclomatic 22): MirrorLibraryHost.handle has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/MirrorLibrary.swift"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"1287e52caaa1312140d94101120ae56a76cd5071038b41b6feb963033806d54f"}},{"ruleId":"D1","level":"warning","message":{"text":"ForgeProgress.line (cyclomatic 22): ForgeProgress.line has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: Problem.suggestion (cyclomatic 55) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/Problems.swift"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcbd340cac087c506059d2537916b4fb43a9d14cfca436fb5f69b8b7cb7c8649"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteControl.set (cyclomatic 22): RemoteControl.set has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl\u002BCommands.swift"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f86ba631b5710217f861fd320852b894d627cf295f430a4ddb93e35743b5845"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteControl.wait (cyclomatic 22): RemoteControl.wait has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl\u002BFollow.swift"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"92cfcf4f276888831f9f4aa1a77c1e9330385325a26bae11b3667bf8c10c6127"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteControl.followMirroredGrid (cyclomatic 22): RemoteControl.followMirroredGrid has cyclomatic complexity 22 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 10 belong to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl\u002BMirror.swift"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4674f6ad6e11db23f61b7ed23ae51c7271ad41b05e643857e776c3a9f489c8"}},{"ruleId":"D1","level":"warning","message":{"text":"Recipe.init (cyclomatic 21): Recipe.init has cyclomatic complexity 21 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Engine.swift"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3aaac85e40fde886fc550ca45d6f30c464e3a222db458fe64d6bf663b3c539b"}},{"ruleId":"D1","level":"warning","message":{"text":"MossImageForge.forgeLoRA (cyclomatic 21): MossImageForge.forgeLoRA has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/MossImageForge.swift"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e17e7c0bc08d8dceee2c3aec745c51f29cd879d6f3ee284c9079095f1b7700"}},{"ruleId":"D1","level":"warning","message":{"text":"Qwen3VLDecoder.init (cyclomatic 21): Qwen3VLDecoder.init has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Qwen3VLDecoder.swift"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"2933b65c79148a511c88a98c6348bf7578b7d5638b881903e7feff6cf8798ef9"}},{"ruleId":"D1","level":"warning","message":{"text":"RGB8.init (cyclomatic 21): RGB8.init has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Qwen3VLImages.swift"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a53d158d97f9f192a9d9bba68ec80e9e74f104538a0cfe508456f454c02c82"}},{"ruleId":"D1","level":"warning","message":{"text":"Downloader.download (cyclomatic 21): Downloader.download has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/Downloader.swift"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b179a33d88450647092af610ebfae298cad085ebb4942fa89cc0aced497a526"}},{"ruleId":"D1","level":"warning","message":{"text":"HubImport.examine (cyclomatic 21): HubImport.examine has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/HubLink.swift"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"68878d650c2a7205b67e0893b9c488f4b8b6ddb41ee9befa3de93a23da3fc529"}},{"ruleId":"D1","level":"warning","message":{"text":"MapComparison.compare (cyclomatic 21): MapComparison.compare has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/Map.swift"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c25da87de383b5ba1f85d72e760eef90520183e8af13a45bdba4d5de192c398"}},{"ruleId":"D1","level":"warning","message":{"text":"AppState.enqueueGrid (cyclomatic 21): AppState.enqueueGrid has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/AppState\u002BRender.swift"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9dc3f3d8ae2a47a63bc8d1a078d7a537d4da3d1ab251256fbee60539c3999e"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteControl.writeInText (cyclomatic 21): RemoteControl.writeInText has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl\u002BLab.swift"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8adf6c5e9518f3c94ab57efa1fd4d025f0d4fb131e76aced766dbd7d98de7fa"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteControl.addGridOnMirror (cyclomatic 21): RemoteControl.addGridOnMirror has cyclomatic complexity 21 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl\u002BMirror.swift"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb38fa038e5bf22d2cdf7d4ba6600d0703c925b3655aa5540c6578227fa844d"}},{"ruleId":"D1","level":"warning","message":{"text":"FrameEditor.drag (cyclomatic 21): FrameEditor.drag has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/SubjectSheet.swift"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d1c91ec66f36cdf2b6f4477cc6fe643fc6419e92e30e580c48ae0ddcbc914f"}},{"ruleId":"D1","level":"warning","message":{"text":"GEMM.linear (cyclomatic 20): GEMM.linear has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/GEMM.swift"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"afab4affe9234627d2da580feb46d69a13feaba7bf78ea4c2f7f82290812fcd3"}},{"ruleId":"D1","level":"warning","message":{"text":"HeadSplitAttention.init (cyclomatic 20): HeadSplitAttention.init has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/HeadSplitAttention.swift"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb5cdaa80b4b9396686e9f288bc0fea522536a1d04b103b8d2d2965ec5103431"}},{"ruleId":"D1","level":"warning","message":{"text":"RenderGrid.cells (cyclomatic 20): RenderGrid.cells has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/RenderGrid.swift"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"f310bc367cf299049eb065e9ec8bce8045342555169ba1c668f805483bda17ac"}},{"ruleId":"D1","level":"warning","message":{"text":"WeightProducts.prepareSQ (cyclomatic 20): WeightProducts.prepareSQ has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/WeightProducts.swift"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"f17abb17d169552f07a7be4c51b8ec83be8e4424353416afa344c560fed56cd5"}},{"ruleId":"D1","level":"warning","message":{"text":"QuantizedTensor.absMax (cyclomatic 20): QuantizedTensor.absMax has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/Quantization.swift"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e5e649e2fee4bed9d42285e533d23822ad3ab2f4cb94231b0831a6df645030"}},{"ruleId":"D1","level":"warning","message":{"text":"MainWindow.key (cyclomatic 20): MainWindow.key has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/App.swift"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"859d70e95321d43b6668cf2c9199822ff6356c0693b5195fdeab3a01752f7cb0"}},{"ruleId":"D1","level":"warning","message":{"text":"AppState.formBlocker (cyclomatic 20): AppState.formBlocker has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/AppState\u002BCatalog.swift"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"b189b32277be0931561006aa5ab2cf3901593c9e8e327c9b8229388fa9ad7065"}},{"ruleId":"D1","level":"warning","message":{"text":"Context.chooseTiles (cyclomatic 19): Context.chooseTiles has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 7 of the 19 points are its own statements and the rest belongs to 3 function items inside it that branch (run, decide, summed). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacityProbesSolos.swift"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a508e11ba512df6c2bc6b743f0ef15bd9c3922820812fdf18efb383973be0a3"}},{"ruleId":"D1","level":"warning","message":{"text":"QwenImage21Sequence.init (cyclomatic 19): QwenImage21Sequence.init has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/QwenImage21.swift"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"f39288ef3f12dda677461b00b82fcd49d464a04c0a71e8b0245e0cb6a86c097f"}},{"ruleId":"D1","level":"warning","message":{"text":"TextEncoder.encode (cyclomatic 19): TextEncoder.encode has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/TextEncoder.swift"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c4df1dccc9f0df0b364a678a10f39b2cc73433fff82f95f4310cc1ccf0c14c"}},{"ruleId":"D1","level":"warning","message":{"text":"WeightProducts.plannedInt8 (cyclomatic 19): WeightProducts.plannedInt8 has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/WeightProducts.swift"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"18c5f6b4c847e454e37f1b14f1127448db00bdf85075845501a7626ad48bf163"}},{"ruleId":"D1","level":"warning","message":{"text":"Widen.dequantizePacked (cyclomatic 19): Widen.dequantizePacked has cyclomatic complexity 19 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Widen.swift"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc891be2aaf7cbdf564f66bd978a61c2cddbc3e9a9a9448ba04854b03c6e5c3"}},{"ruleId":"D1","level":"warning","message":{"text":"Report.rows (cyclomatic 19): Report.rows has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/ForgeDiT.swift"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8fabf780a9c97fca6a3a472ed597cc7ec12c6f1f7be2f1dbf0117d40023f355"}},{"ruleId":"D1","level":"warning","message":{"text":"ForgeLoRA.candidates (cyclomatic 19): ForgeLoRA.candidates has cyclomatic complexity 19 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/ForgeLoRA.swift"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"a246c7d4a19c96f8ddb7bf14eec89da2776eb5154fe6f579b4e6429c47f84a66"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteHost.pair (cyclomatic 19): RemoteHost.pair has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Remote/Host.swift"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"de26002acb326eb93004a2d16e06caa3203bc75a28e0f345edc9fff95fc04a98"}},{"ruleId":"D1","level":"warning","message":{"text":"AppState.open (cyclomatic 19): AppState.open has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/AppState\u002BHub.swift"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0b324371c9ba6bff877c4139ddfdf5046d160630bf4df20733b0e50d7034e1"}},{"ruleId":"D1","level":"warning","message":{"text":"AppState.sheetDrawing (cyclomatic 19): AppState.sheetDrawing has cyclomatic complexity 19 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 3 belong to 3 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/AppState\u002BRender.swift"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"f555282118df1ebfa516573cc767bf567544f8311c662963cb7680998f7e564b"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteControl.followGrid (cyclomatic 19): RemoteControl.followGrid has cyclomatic complexity 19 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl\u002BFollow.swift"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66a50f6065fcd704e31d5b4a62945c56cef034b508a7c8e44f6c0f99789e2b5"}},{"ruleId":"D1","level":"warning","message":{"text":"AnimaConditioner.condition (cyclomatic 18): AnimaConditioner.condition has cyclomatic complexity 18 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/AnimaConditioner.swift"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab8ed75d49ff373a4dd26918c5efc958a55ba197c6d0355bc6f7025fc882b822"}},{"ruleId":"D1","level":"warning","message":{"text":"CapacityFit.shapedLine (cyclomatic 18): CapacityFit.shapedLine has cyclomatic complexity 18 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacityFit.swift"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af9c6beebe5982aa058c3b1474c68f6d007120a6f51dd4751279a049c961bd5"}},{"ruleId":"D1","level":"warning","message":{"text":"PromptDiff.pieces (cyclomatic 18): PromptDiff.pieces has cyclomatic complexity 18 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/PromptDiff.swift"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"84eb1f5b23bedd92452b427b046f7475550c0f33fea273fecf73cfc2749ba087"}},{"ruleId":"D1","level":"warning","message":{"text":"QwenImage21DiT.init (cyclomatic 18): QwenImage21DiT.init has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/QwenImage21.swift"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ddd5bfe9b1ab818e56218fed44c8deaac64377997f792da1002baf1a64e7ba"}},{"ruleId":"D1","level":"warning","message":{"text":"Sampler.run (cyclomatic 18): Sampler.run has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Sampler.swift"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a1188c5ff2fc0be4b8dfb2ac4b453e50dd10d93ebef7cfa117f35941103299"}},{"ruleId":"D1","level":"warning","message":{"text":"TiledAttention.submit (cyclomatic 18): TiledAttention.submit has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/TiledAttention.swift"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cad128508dfc6002167d9fe775ec435c156448e02e316af32cb4ef66bab60d0"}},{"ruleId":"D1","level":"warning","message":{"text":"WeightProducts.inPlaceInt8 (cyclomatic 18): WeightProducts.inPlaceInt8 has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/WeightProducts.swift"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"745b20d640bb5b39f772dc0d56bd6d409bfc1fb1f8326e58424e964939ed520c"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteHost.admit (cyclomatic 18): RemoteHost.admit has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Remote/Host.swift"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"575645cb1c228dff129be23b40a227c89b524c8f4e0ad9719c50ef5220012bc1"}},{"ruleId":"D1","level":"warning","message":{"text":"ModulesAnima.swift.euler (cyclomatic 18): ModulesAnima.swift.euler has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/ModulesAnima.swift"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e3127f9de7f7a73492ec31d09c1991132422667539f91da430c1a821944519"}},{"ruleId":"D1","level":"warning","message":{"text":"AppCommands.body (cyclomatic 18): AppCommands.body has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/App.swift"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"45570dc2e8687ca3c3408adfbac4fdf463dbe57ab8ba3412422d8ef763b9605a"}},{"ruleId":"D1","level":"warning","message":{"text":"MirrorServer.admit (cyclomatic 18): MirrorServer.admit has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/MirrorServer.swift"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e944854a5a112afd98d1e86353ca227c1e0b891e2bfc7d224041dcaf1592405"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteControl.follow (cyclomatic 18): RemoteControl.follow has cyclomatic complexity 18 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl\u002BFollow.swift"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"28af32b257f0c0f25b3980a8c68b0b969e355cbb8aef2ca3d4df00a329573e96"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteControl.uninstall (cyclomatic 18): RemoteControl.uninstall has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl\u002BGestures.swift"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"f708d3a4d6ea10f965628d4908f35dcafdad13fcca0ea11e203bffefa39e3fbe"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteControl.lab (cyclomatic 18): RemoteControl.lab has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl\u002BLab.swift"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d152ae1806ad2ad078acc46d4fa578a236026adf0ebdda9d4b8c77773038d3"}},{"ruleId":"D1","level":"warning","message":{"text":"CapacityFit.thinFit (cyclomatic 17): CapacityFit.thinFit has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, 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":"Sources/Siliconed/CapacityFit.swift"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb5bcb02de70c6f51894ff7f3a6a504b506623eb6d0da1e42e97dffaf79c279"}},{"ruleId":"D1","level":"warning","message":{"text":"Admission.judge (cyclomatic 17): Admission.judge has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/EngineAdmission.swift"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"17fa2f87135360daa097538acfca6a209479638b8bca9329bad058495b92c550"}},{"ruleId":"D1","level":"warning","message":{"text":"MemoryNeed.gemm (cyclomatic 17): MemoryNeed.gemm has cyclomatic complexity 17 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/MemoryNeed.swift"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"420bea44736c1334a286541c6f9b408491759bf6e35ffef6042ec0b334c9f82e"}},{"ruleId":"D1","level":"warning","message":{"text":"PromptDiff.align (cyclomatic 17): PromptDiff.align has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/PromptDiff.swift"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b1dd9beeb56198153b9b3d8b9cbf49c0d0b5a6aefeae2b12e664ccec032ace"}},{"ruleId":"D1","level":"warning","message":{"text":"Qwen3VLDecoder.make::matrix (cyclomatic 17): Qwen3VLDecoder.make::matrix has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Qwen3VLDecoder.swift"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"1335e91460c324d0f2395c48f6ccb8680caa97e44ef369a37f12a91b6984271a"}},{"ruleId":"D1","level":"warning","message":{"text":"Config.init (cyclomatic 17): Config.init has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Qwen3VLVision.swift"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04d8092733eb38a3bd7aa56033ba097f43ead4e56edd98f8780df20ae9cfeaf"}},{"ruleId":"D1","level":"warning","message":{"text":"SetOrder.parse (cyclomatic 17): SetOrder.parse has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/RemoteWriting.swift"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d99c87958aa856b1771d2adb4a9ba0d2823f17e8713b39a78d33dbb5fc0a620"}},{"ruleId":"D1","level":"warning","message":{"text":"TiledAttention.init (cyclomatic 17): TiledAttention.init has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/TiledAttention.swift"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"01029c1f7ea6bc4dcafcf36fd28e5d63042767ff93c90a09bf1f91ca85718878"}},{"ruleId":"D1","level":"warning","message":{"text":"ForgeQwen35.plan (cyclomatic 17): ForgeQwen35.plan has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/ForgeQwen35.swift"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2aa16f0dfb815be4e485a32c4c6d95b652b49b0556f8a6ff8b727365b8475b8"}},{"ruleId":"D1","level":"warning","message":{"text":"HubImport.contentRanges (cyclomatic 17): HubImport.contentRanges has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/HubLink.swift"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"c931daf6fc7c941bf446fb46bb267421c23630e6e54c3b1e870d0c22192d804f"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.chain (cyclomatic 17): Parser.chain has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/OrderedJSON.swift"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96dc7f02bd37dae6f35bcb3aa2a51554fb9d63deb39f24faf24758c98e85821"}},{"ruleId":"D1","level":"warning","message":{"text":"AppState.next (cyclomatic 17): AppState.next 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":"Sources/SiliconedApp/AppState\u002BRender.swift"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba6bf93b639be3460a58bc382b7ebab0d79067eb46007c36e726b9edbe248fc"}},{"ruleId":"D1","level":"warning","message":{"text":"LicenseTerms.body (cyclomatic 17): LicenseTerms.body 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":"Sources/SiliconedApp/LicenseSheet.swift"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e4288bd7ff1a268e7a3182a2670e8f846ce3c9f7dd21e3741590cbb38c86eb3"}},{"ruleId":"D1","level":"warning","message":{"text":"PromptTextView.varyTarget (cyclomatic 17): PromptTextView.varyTarget 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":"Sources/SiliconedApp/PromptField.swift"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff4b48b7a840b4124903006c229203c97585c20ec50ca279426b918a2ca5f2ff"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteControl.install (cyclomatic 17): RemoteControl.install 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":"Sources/SiliconedApp/RemoteControl\u002BCommands.swift"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a757b5e3defb0677cd1d4b30f77e5f29352296214cb9041df60d57d6b45e856"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteControl.crop (cyclomatic 17): RemoteControl.crop has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl\u002BGestures.swift"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9ab8ca07957e7bd49bc4cec51fc97ea706f004fddd40a1125a6543c92f20f2"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteControl.writing (cyclomatic 17): RemoteControl.writing has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl\u002BWriter.swift"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe8e22d0a21364c14b066aff9824d799e21b7eed256aae521097735cda35d32"}},{"ruleId":"D1","level":"warning","message":{"text":"SceneView.body (cyclomatic 17): SceneView.body 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":"Sources/SiliconedApp/SceneView.swift"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f89246dd58ff7f11da9e3f7a44e8be69782745896bbc36ef823372d269be84"}},{"ruleId":"D1","level":"warning","message":{"text":"Block.forwardStreamed (cyclomatic 16): Block.forwardStreamed has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Block.swift"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8e46801e7c120f064c3447ec94c7fea71eeddbd808bc0f12db4edf501be5c4"}},{"ruleId":"D1","level":"warning","message":{"text":"Diagnostic.measureWidening (cyclomatic 16): Diagnostic.measureWidening has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/DiagnosticWideningProbes.swift"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d572c9f0a20a3a55417729e763338c11e96aee45c369093b576aaba3bd79f39"}},{"ruleId":"D1","level":"warning","message":{"text":"EngineSettings.init (cyclomatic 16): EngineSettings.init has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/EngineSettings.swift"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e7bf68ce11b1a2ab100437c1a2fab959fe7c8ea75ba90f9798c9639ea3e28e2"}},{"ruleId":"D1","level":"warning","message":{"text":"PNG.text (cyclomatic 16): PNG.text has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/ImagePNG.swift"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e70271604e94525fa3fb15f315b482ea0feaf1528bef36a41b0d2fe7d6f24c"}},{"ruleId":"D1","level":"warning","message":{"text":"TailStream.init (cyclomatic 16): TailStream.init has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Prefetcher.swift"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"1235093eb7c6b607a70035f1bd97f52b227fe9029196adab6d298c0c61709e47"}},{"ruleId":"D1","level":"warning","message":{"text":"Qwen35Encoder.encode (cyclomatic 16): Qwen35Encoder.encode has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Qwen35.swift"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7dfaf555b83e4f4119e41b480a6829958e52cf8395322aa513e1700c58911b"}},{"ruleId":"D1","level":"warning","message":{"text":"QwenImage21VAE.run (cyclomatic 16): QwenImage21VAE.run has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/QwenImage21VAE.swift"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"7206451bf4176e28c4cc26ae7573017aae5235892d4245c92d37456b4f9e2a3e"}},{"ruleId":"D1","level":"warning","message":{"text":"Widen.dequantize (cyclomatic 16): Widen.dequantize has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Widen.swift"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"331f9f13f70051c7c22b47982779f43992cf603bf79ac198fa8f61fd38fa300b"}},{"ruleId":"D1","level":"warning","message":{"text":"QuantizedTensor.dequantized (cyclomatic 16): QuantizedTensor.dequantized has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/Quantization.swift"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"d64ca2e1818dfb7952b554e7d28a00f772b4eb03fe4071c9a6e5478526d58ceb"}},{"ruleId":"D1","level":"warning","message":{"text":"AppState.receiveLibrary (cyclomatic 16): AppState.receiveLibrary has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/MirrorLibrary.swift"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b9068e6ea422f786dd65da2a27cce8f025fd2aa4314db3d2c32681105e4e0d2"}},{"ruleId":"D1","level":"warning","message":{"text":"main.swift.top-level code (cyclomatic 16): main.swift.top-level code has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Silicontrol/main.swift"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"0360a6b0d8151d20ba841516f5018f07305290e32401fcfa826c682457b6f0b2"}},{"ruleId":"D1","level":"warning","message":{"text":"Clouds.arbitrate (cyclomatic 16): Clouds.arbitrate has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Verification/Krea2Stages.swift"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"f717666c8ea180bb2675611d2942509809aeceabc18c6b82154553bdfb9ebbbb"}},{"ruleId":"D2","level":"warning","message":{"text":"QuantizedLayouts.recognize (cognitive 201): QuantizedLayouts.recognize has cognitive complexity 201 (threshold 15). Drivers by points: if/else 57 (116 pts), boolean chains 48, ternaries 8 (20 pts), loops 12 (15 pts), match/switch 1 (2 pts) (nesting depth added 75). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/Quantization.swift"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"75373deb4a16e283bd4268fffddb07db35e1bb23f06265289359334b1de1c140"}},{"ruleId":"D2","level":"warning","message":{"text":"GestureOrder.parse (cognitive 176): GestureOrder.parse has cognitive complexity 176 (threshold 15). Drivers by points: if/else 43 (93 pts), ternaries 20 (52 pts), boolean chains 20, match/switch 6 (10 pts), loops 1 (nesting depth added 86). Of this number, 173 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/RemoteGestures.swift"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6aea4a7b9efd2e287f9361a04a4a0233082470fad7a40759ed76b630dc29182"}},{"ruleId":"D2","level":"warning","message":{"text":"ForgeLoRA.forging (cognitive 139): ForgeLoRA.forging has cognitive complexity 139 (threshold 15). Drivers by points: if/else 49 (88 pts), boolean chains 24, loops 10 (20 pts), ternaries 3 (5 pts), match/switch 1 (2 pts) (nesting depth added 52). Of this number, 119 points are the body\u0027s own statements and 20 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/ForgeLoRA.swift"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"b06ea4ccc5da0ae08d3d65dea717f3ccde139fe9d3dfb9fbfcc1e4465e98d59d"}},{"ruleId":"D2","level":"warning","message":{"text":"Context.attention (cognitive 108): Context.attention has cognitive complexity 108 (threshold 15). Drivers by points: if/else 21 (58 pts), boolean chains 25, loops 7 (19 pts), match/switch 1 (3 pts), ternaries 1 (3 pts) (nesting depth added 53). Of this number, 90 points are the body\u0027s own statements and 18 belong to 4 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacityProbesSolos.swift"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"daf8e5c9abbdf80fdecf2191dcb7ca804da8b937cbb379b3cd65cbb1a4e08260"}},{"ruleId":"D2","level":"warning","message":{"text":"CapacityPlan.forcing (cognitive 107): CapacityPlan.forcing has cognitive complexity 107 (threshold 15). Drivers by points: if/else 22 (48 pts), boolean chains 32, ternaries 20 (27 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacityPlan.swift"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a7f929ce72405fbc04d3aa36916de5d9f0af834042d11b41f45b110a85968d6"}},{"ruleId":"D2","level":"warning","message":{"text":"ForgeDiT.tensor (cognitive 95): ForgeDiT.tensor has cognitive complexity 95 (threshold 15). Drivers by points: ternaries 17 (33 pts), if/else 19 (31 pts), boolean chains 29, loops 1 (2 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/ForgeDiT.swift"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb62ab6c865ffe1212d75410c3a1f830f44a1766e3af8813fa929d57bef0672"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteControl.add (cognitive 95): RemoteControl.add has cognitive complexity 95 (threshold 15). Drivers by points: if/else 43 (59 pts), boolean chains 20, ternaries 6 (10 pts), error handling 3, loops 2 (3 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl\u002BAdd.swift"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba3d38a4f6b39ecc9978020f8538a7f0d22857adf87c6cde8c246e507b2be7d"}},{"ruleId":"D2","level":"warning","message":{"text":"WeightProducts.linear (cognitive 90): WeightProducts.linear has cognitive complexity 90 (threshold 15). Drivers by points: if/else 28 (46 pts), boolean chains 31, ternaries 7 (12 pts), match/switch 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/WeightProducts.swift"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d26e1a234996314d6ee64f3e8fb4d25d396b40122112aa93f3d200e1b972ca4"}},{"ruleId":"D2","level":"warning","message":{"text":"Recipes.normalize (cognitive 85): Recipes.normalize has cognitive complexity 85 (threshold 15). Drivers by points: if/else 17 (40 pts), loops 9 (23 pts), boolean chains 11, ternaries 5 (10 pts), match/switch 1 (nesting depth added 42). Of this number, 84 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/Families.swift"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"686e4377d02adf71777c3ad1482cd0b76ef851e070c45e1d8d4a613b0d83677e"}},{"ruleId":"D2","level":"warning","message":{"text":"RenderGrid.init (cognitive 84): RenderGrid.init has cognitive complexity 84 (threshold 15). Drivers by points: if/else 27 (69 pts), boolean chains 6, ternaries 2 (6 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/RenderGrid.swift"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c0bbc25e9a6d85fae4462187efeac419694980fbf07844a3b35c8e14d35d3c"}},{"ruleId":"D2","level":"warning","message":{"text":"Installer.install (cognitive 81): Installer.install has cognitive complexity 81 (threshold 15). Drivers by points: if/else 23 (35 pts), ternaries 10 (21 pts), loops 6 (13 pts), boolean chains 12 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/Installation.swift"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b47f5422c193f90213656819492543aa2ccb2bdad2506eaecd0ccfa82fb7ca1"}},{"ruleId":"D2","level":"warning","message":{"text":"NeuralEngine.run (cognitive 75): NeuralEngine.run has cognitive complexity 75 (threshold 15). Drivers by points: if/else 21 (41 pts), ternaries 6 (14 pts), loops 7 (11 pts), boolean chains 4, match/switch 2 (3 pts), error handling 1 (2 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/NeuralEngine.swift"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0f6e4e4c85d1069a0523c245c90b507eb69267068c6dd6b466c0cdb5763f66"}},{"ruleId":"D2","level":"warning","message":{"text":"AppState.receive (cognitive 70): AppState.receive has cognitive complexity 70 (threshold 15). Drivers by points: if/else 22 (46 pts), boolean chains 9, loops 3 (7 pts), ternaries 2 (5 pts), match/switch 2 (3 pts) (nesting depth added 32). Of this number, 68 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/AppState\u002BMirror.swift"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"e074b353f2e0c1d2107cc291a220314eb14652c36edfd47b675c0b3da86c1005"}},{"ruleId":"D2","level":"warning","message":{"text":"Context.validate (cognitive 69): Context.validate has cognitive complexity 69 (threshold 15). Drivers by points: if/else 15 (42 pts), loops 11 (22 pts), boolean chains 5 (nesting depth added 38). Of this number, 63 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacityProbesValidation.swift"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"904360bd485798452edbbeb12ce3b5fb42d46f2c46ecfcf95b03d0e80f38973d"}},{"ruleId":"D2","level":"warning","message":{"text":"AppState.execute (cognitive 69): AppState.execute has cognitive complexity 69 (threshold 15). Drivers by points: if/else 15 (42 pts), ternaries 5 (15 pts), loops 2 (5 pts), boolean chains 3, match/switch 1 (3 pts), error handling 1 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/AppState\u002BRender.swift"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32a138023694ba199465da8c3a016dea41d57165bb9867e1a230921ad4b21b5"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteControl.addOnMirror (cognitive 68): RemoteControl.addOnMirror has cognitive complexity 68 (threshold 15). Drivers by points: if/else 33 (41 pts), boolean chains 15, error handling 3 (5 pts), loops 3 (4 pts), ternaries 2 (3 pts) (nesting depth added 12). Of this number, 55 points are the body\u0027s own statements and 13 belong to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl\u002BMirror.swift"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d9159cdbde7f153caa17d8f667448308756a52ad95140c6e69fa189bb77243"}},{"ruleId":"D2","level":"warning","message":{"text":"Context.solo (cognitive 66): Context.solo has cognitive complexity 66 (threshold 15). Drivers by points: boolean chains 28, if/else 14 (22 pts), ternaries 8 (15 pts), match/switch 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacityProbesSolos.swift"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"d64e713b03092651261f69b0e5e07893559963bced1261e2927fb02ff7d1cd63"}},{"ruleId":"D2","level":"warning","message":{"text":"Qwen3VLGenerator.generate (cognitive 66): Qwen3VLGenerator.generate has cognitive complexity 66 (threshold 15). Drivers by points: if/else 17 (36 pts), loops 9 (17 pts), boolean chains 9, ternaries 3 (4 pts) (nesting depth added 28). Of this number, 62 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Qwen3VLGeneration.swift"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"2525e4861ae959288ecee9b630a661cbb403ed421127f79a7a9838321758dc8d"}},{"ruleId":"D2","level":"warning","message":{"text":"GGUF.parse (cognitive 61): GGUF.parse has cognitive complexity 61 (threshold 15). Drivers by points: if/else 24 (37 pts), loops 7 (9 pts), boolean chains 7, match/switch 3 (4 pts), ternaries 2 (4 pts) (nesting depth added 18). Of this number, 39 points are the body\u0027s own statements and 22 belong to 5 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/GGUF.swift"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b61cd9fc0506248ac5e694ae63e7ae86eaa85eb708a40003f6242ed8e0fd70"}},{"ruleId":"D2","level":"warning","message":{"text":"Krea2PermutedMap.write (cognitive 61): Krea2PermutedMap.write has cognitive complexity 61 (threshold 15). Drivers by points: if/else 20 (31 pts), boolean chains 13, loops 4 (10 pts), ternaries 2 (4 pts), match/switch 1 (3 pts) (nesting depth added 21). Of this number, 51 points are the body\u0027s own statements and 10 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Verification/ResidualPermutation.swift"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d93a51134320588c7b24a590e6af99b42196455494858986299153494435ba"}},{"ruleId":"D2","level":"warning","message":{"text":"ProductSolver.evaluate (cognitive 59): ProductSolver.evaluate has cognitive complexity 59 (threshold 15). Drivers by points: if/else 20 (46 pts), ternaries 4 (8 pts), boolean chains 4, match/switch 1 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacitySolver.swift"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"14dd618533bfd0dcdf0e7b2ba1d5bbe6c9aaedac6836a0eb458733cf4b73389c"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteControl.parse (cognitive 58): RemoteControl.parse has cognitive complexity 58 (threshold 15). Drivers by points: if/else 18 (38 pts), boolean chains 9, match/switch 2 (6 pts), error handling 1 (3 pts), loops 2 (nesting depth added 26). Of this number, 57 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl\u002BAdd.swift"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87abb4e1d40a2633013b5ea9b4dae73aad70e7081597760d8424fa342351e81"}},{"ruleId":"D2","level":"warning","message":{"text":"QwenImage21DiT.body (cognitive 56): QwenImage21DiT.body has cognitive complexity 56 (threshold 15). Drivers by points: if/else 23 (33 pts), loops 5 (10 pts), boolean chains 8, ternaries 3 (5 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/QwenImage21.swift"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae133cd36ec23e41daee3101de724df55380515e7ea22a83cddf6e464b64561"}},{"ruleId":"D2","level":"warning","message":{"text":"CapacityFit.model (cognitive 55): CapacityFit.model has cognitive complexity 55 (threshold 15). Drivers by points: if/else 14 (26 pts), boolean chains 11, loops 10 (11 pts), ternaries 3 (7 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacityFit.swift"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a90001b996ac071858eb930d24f8ea02319248d6168f071d0a508b5e50f62f"}},{"ruleId":"D2","level":"warning","message":{"text":"Artifact.parse (cognitive 53): Artifact.parse has cognitive complexity 53 (threshold 15). Drivers by points: if/else 21 (34 pts), boolean chains 18, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Artifact.swift"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ddff458d80a5e9b1414811a409e4e1a19f5fcb97d298f47d73e1455186f081"}},{"ruleId":"D2","level":"warning","message":{"text":"ProductAssignment.isRunnable (cognitive 52): ProductAssignment.isRunnable has cognitive complexity 52 (threshold 15). Drivers by points: boolean chains 33, if/else 11 (18 pts), match/switch 1 (nesting depth added 7). 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":"Sources/Siliconed/CapacityPlan.swift"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1fb5c983eec0812ac6949a4bd1d95aba288ef45d40c4180c74f2fa7c8c7ce2"}},{"ruleId":"D2","level":"warning","message":{"text":"QwenImage21Sampler.run (cognitive 52): QwenImage21Sampler.run has cognitive complexity 52 (threshold 15). Drivers by points: if/else 9 (18 pts), ternaries 10 (17 pts), loops 5 (13 pts), boolean chains 4 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/QwenImage21Sampler.swift"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4665e2ff1b5ab1151ec459a1e4202f16d107299612ad6ff1a81064ddd259e6"}},{"ruleId":"D2","level":"warning","message":{"text":"Runner.run (cognitive 48): Runner.run has cognitive complexity 48 (threshold 15). Drivers by points: if/else 18 (25 pts), boolean chains 9, ternaries 5 (7 pts), error handling 2 (4 pts), loops 3 (nesting depth added 11). Of this number, 42 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Measurement/Runner.swift"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"98253536b1d85096aeb608b39f852a95f0f060b9d79fe77646dc36096965a42a"}},{"ruleId":"D2","level":"warning","message":{"text":"ProductSolver.widened (cognitive 47): ProductSolver.widened has cognitive complexity 47 (threshold 15). Drivers by points: boolean chains 22, if/else 15 (18 pts), loops 2 (5 pts), ternaries 2 (nesting depth added 6). Of this number, 37 points are the body\u0027s own statements and 10 belong to 2 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacitySolver.swift"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d469366276d10d9380bed9f3cfa31a2a492650911445a91c9fdd3e822798f1d"}},{"ruleId":"D2","level":"warning","message":{"text":"Tokenizer.init (cognitive 47): Tokenizer.init has cognitive complexity 47 (threshold 15). Drivers by points: if/else 15 (21 pts), loops 7 (11 pts), boolean chains 10, ternaries 2 (4 pts), error handling 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Tokenizer.swift"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba051efac9b78737f5935b57fb199a42055d8b179cdfdc977d3b71960f31c69"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteControl.subjects (cognitive 47): RemoteControl.subjects has cognitive complexity 47 (threshold 15). Drivers by points: if/else 13 (32 pts), boolean chains 7, match/switch 2 (4 pts), loops 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 23). Of this number, 45 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl\u002BCommands.swift"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8675b05ee4e2cebd89ddd0c39f44579b5ebdabc95e33830acb03bd86d7ee61"}},{"ruleId":"D2","level":"warning","message":{"text":"RenderGrid.axis (cognitive 45): RenderGrid.axis has cognitive complexity 45 (threshold 15). Drivers by points: if/else 17 (30 pts), ternaries 5 (10 pts), boolean chains 3, loops 1, match/switch 1 (nesting depth added 18). Of this number, 41 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/RenderGrid.swift"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c7e8d5ff0d2958c9785005216934b94336ff51800391396245aba874cf3af3"}},{"ruleId":"D2","level":"warning","message":{"text":"WeightProducts.prepare (cognitive 45): WeightProducts.prepare has cognitive complexity 45 (threshold 15). Drivers by points: boolean chains 20, if/else 14 (20 pts), ternaries 2 (4 pts), match/switch 1 (nesting depth added 8). Of this number, 44 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/WeightProducts.swift"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"86122d0623df90551d104b9d8fd3749f0c9e2da6988e8ab1d3e605295e927f97"}},{"ruleId":"D2","level":"warning","message":{"text":"Context.trial (cognitive 44): Context.trial has cognitive complexity 44 (threshold 15). Drivers by points: if/else 16 (19 pts), ternaries 10 (13 pts), boolean chains 9, loops 3 (nesting depth added 6). Of this number, 27 points are the body\u0027s own statements and 17 belong to 2 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacityProbesSharing.swift"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c12537d0d759295cde5b01dc15d737011669a15297deab606d1745114f27819"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine.execute (cognitive 43): Engine.execute has cognitive complexity 43 (threshold 15). Drivers by points: if/else 18 (23 pts), boolean chains 8, loops 5 (6 pts), ternaries 5 (6 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/EngineRender.swift"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"a03caf1ec88079be3e9dca9188559f58bfa09cdc78fd8782408555e0af6f8f09"}},{"ruleId":"D2","level":"warning","message":{"text":"T5Tokenizer.init (cognitive 42): T5Tokenizer.init has cognitive complexity 42 (threshold 15). Drivers by points: boolean chains 27, if/else 10 (13 pts), loops 2 (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/T5Tokenizer.swift"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fdd71426838b7da7595542e8e3a4dbf649cbeb326d7553dcc6b31a384279c89"}},{"ruleId":"D2","level":"warning","message":{"text":"Attention.init (cognitive 40): Attention.init has cognitive complexity 40 (threshold 15). Drivers by points: loops 6 (14 pts), ternaries 7 (13 pts), boolean chains 8, if/else 5 (nesting depth added 14). Of this number, 39 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Attention.swift"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66205af47883b2cb33f62ae4850fb1fe5802fa3a57f79b866dc8643279d6904"}},{"ruleId":"D2","level":"warning","message":{"text":"MapWriter.write (cognitive 40): MapWriter.write has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (22 pts), loops 8 (13 pts), error handling 1 (3 pts), boolean chains 2 (nesting depth added 15). Of this number, 30 points are the body\u0027s own statements and 10 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/Map.swift"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6319ad818272f603536bced56427ad08c5e5ba89705fafc984deceb49410eb1"}},{"ruleId":"D2","level":"warning","message":{"text":"EngineError.init (cognitive 39): EngineError.init has cognitive complexity 39 (threshold 15). Drivers by points: match/switch 13 (25 pts), ternaries 2 (6 pts), if/else 4 (5 pts), boolean chains 3 (nesting depth added 17). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Errors.swift"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"d39217258974c278b814c1e3ecfbbf94430db05389fbed4c10949459fbbd0322"}},{"ruleId":"D2","level":"warning","message":{"text":"ForgeLoRA.targets (cognitive 39): ForgeLoRA.targets has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 10, ternaries 1 (3 pts), match/switch 1 (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/ForgeLoRA.swift"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f122fae40b6b8cc6bd82f4ea752bfad83ca5aa666b57ce4a30c4978863e562"}},{"ruleId":"D2","level":"warning","message":{"text":"CapacityDisk.measureClasses (cognitive 38): CapacityDisk.measureClasses has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 8 (13 pts), boolean chains 4, ternaries 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacityDisk.swift"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"d60dcbb278d5fd370c538cf2973f0e0283beb63109dd482a8016b9cd156ac142"}},{"ruleId":"D2","level":"warning","message":{"text":"Qwen3VLImages.pixels (cognitive 38): Qwen3VLImages.pixels has cognitive complexity 38 (threshold 15). Drivers by points: loops 8 (36 pts), if/else 2 (nesting depth added 28). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Qwen3VLImages.swift"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"02432ac236a9eb4a6d1f3d2bd86662a6b72a5c8131b29de630c386a902feb96c"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteControl.addGrid (cognitive 38): RemoteControl.addGrid has cognitive complexity 38 (threshold 15). Drivers by points: if/else 16 (26 pts), loops 4 (7 pts), ternaries 2 (3 pts), boolean chains 1, error handling 1 (nesting depth added 14). Of this number, 28 points are the body\u0027s own statements and 10 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl\u002BAdd.swift"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"805c7e01677b94c9b960c961826ddb24249e11dca6c271e607d5bf274d539a93"}},{"ruleId":"D2","level":"warning","message":{"text":"ProductSolver.native (cognitive 37): ProductSolver.native has cognitive complexity 37 (threshold 15). Drivers by points: boolean chains 18, if/else 12 (16 pts), ternaries 3 (nesting depth added 4). Of this number, 30 points are the body\u0027s own statements and 7 belong to 2 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacitySolver.swift"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"6845453dcf5905daef2648a73e4004b0981d34d662954b0d636678c45ba4f398"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageRGB.straightRGBA (cognitive 37): ImageRGB.straightRGBA has cognitive complexity 37 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 11, loops 3 (10 pts), ternaries 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/ImageToImage.swift"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c8354ca717446082219556a05a59c88c6831d82a6847e10ec443e623bf59e39"}},{"ruleId":"D2","level":"warning","message":{"text":"Qwen3VLDecoder.run (cognitive 37): Qwen3VLDecoder.run has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (21 pts), ternaries 4 (8 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 16). Of this number, 34 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Qwen3VLDecoder.swift"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2dd392ea2edb4dd9d24097477a96f62fc698731ccf7e6defae73d09e05e7f7"}},{"ruleId":"D2","level":"warning","message":{"text":"Safetensors.init (cognitive 37): Safetensors.init has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 11, loops 3 (5 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Safetensors.swift"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cbda6103272ebe8dedab599da8aa991f7fa5a3c70407678d96cdc62d1efca84"}},{"ruleId":"D2","level":"warning","message":{"text":"AppState.perform (cognitive 37): AppState.perform has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (20 pts), ternaries 2 (8 pts), boolean chains 5, loops 4 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/AppState\u002BLibrary.swift"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"346afef5a6c845a6eb252dba033ddba728d2194c50f6042f5be0182168fa4580"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteControl.addGridOnMirror (cognitive 37): RemoteControl.addGridOnMirror has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 3 (7 pts), boolean chains 3, error handling 2, match/switch 1 (2 pts) (nesting depth added 16). Of this number, 27 points are the body\u0027s own statements and 10 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl\u002BMirror.swift"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c1d028ace20b086a732ccff24c8616c656654e7177c8bd9e3d83dd038601407"}},{"ruleId":"D2","level":"warning","message":{"text":"Context.trialPair (cognitive 36): Context.trialPair has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 10, ternaries 3 (6 pts), loops 2 (nesting depth added 7). Of this number, 34 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacityProbesSharing.swift"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"4576b58f506dc5a377fcf8edb95cf5199b7ff27c4f7e85caf8ebb434a15d7b23"}},{"ruleId":"D2","level":"warning","message":{"text":"HeadSplitAttention.init (cognitive 36): HeadSplitAttention.init has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (16 pts), ternaries 5 (9 pts), loops 2 (5 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 13). Of this number, 33 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/HeadSplitAttention.swift"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe72366fc52377327d96511066db02e739118c1cd83ba8ce01032da08b00ba3"}},{"ruleId":"D2","level":"warning","message":{"text":"Qwen3VLDecoder.init (cognitive 36): Qwen3VLDecoder.init has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 7 (15 pts), boolean chains 4 (nesting depth added 15). Of this number, 34 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Qwen3VLDecoder.swift"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7b942ee647205e5befa8efdf6f37ce169cc751520607122700268eda36ed3c"}},{"ruleId":"D2","level":"warning","message":{"text":"QwenImageWriterStages.check (cognitive 36): QwenImageWriterStages.check has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 10, boolean chains 8, loops 3 (4 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Verification/QwenImageWriterStages.swift"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b6c6c01dffdd7203bd0cdcfe18ae729e5d8e6dfdb8c3ebc724357aa0c8cfbd"}},{"ruleId":"D2","level":"warning","message":{"text":"InstructionOrder.parse (cognitive 35): InstructionOrder.parse has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (26 pts), ternaries 1 (4 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/RemoteWriting.swift"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"1938779fde48d635aebf6a7a018c3995a9d85b12912d7ff4271da5aa625c3044"}},{"ruleId":"D2","level":"warning","message":{"text":"ForgeLoRA.candidates (cognitive 35): ForgeLoRA.candidates has cognitive complexity 35 (threshold 15). Drivers by points: loops 10 (28 pts), ternaries 3 (6 pts), match/switch 1 (nesting depth added 21). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/ForgeLoRA.swift"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb5e8bd54b78c6830cc56a727758b89ab09fe3b59a39e3450d04b038da915fed"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteControl.handle (cognitive 35): RemoteControl.handle has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (22 pts), ternaries 3 (9 pts), error handling 2, match/switch 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl.swift"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed488c68e9669d15e491dd00e4cb7d46c5d0179c6728d4a950d6924489d4666"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteControl.library (cognitive 35): RemoteControl.library has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 7, error handling 1 (2 pts), loops 1 (2 pts), match/switch 1, ternaries 1 (nesting depth added 12). Of this number, 27 points are the body\u0027s own statements and 8 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl\u002BPlace.swift"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7189b209d2fafee38539ce14a37f58eadba4e49db8f93cb402f6a3c14d8df27"}},{"ruleId":"D2","level":"warning","message":{"text":"Invocation.init (cognitive 34): Invocation.init has cognitive complexity 34 (threshold 15). Drivers by points: boolean chains 17, if/else 12 (16 pts), loops 1 (nesting depth added 4). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Verification/Invocation.swift"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8ce34c31f422e96102c863c400df68d988a8d69ecbc6916948f3a7e6abd789"}},{"ruleId":"D2","level":"warning","message":{"text":"QwenImage21VAE.run (cognitive 33): QwenImage21VAE.run has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 3 (5 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/QwenImage21VAE.swift"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb38fcbee1f8b200a97efd1a87f2720b5d84644c3dbed3498093eef14192f17"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteControl.wait (cognitive 33): RemoteControl.wait has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 8, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl\u002BFollow.swift"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb6dd789d1b7cf8a4737e0eb467f6b5823521ba4a0a0b5f18b307f555908c0d"}},{"ruleId":"D2","level":"warning","message":{"text":"MossImageStages.evaluate (cognitive 33): MossImageStages.evaluate has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (20 pts), boolean chains 8, ternaries 4, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Verification/MossImageStages.swift"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"0844fd5547558d573bdbf9aa99a01130302736e91e3612631aad1c783289103a"}},{"ruleId":"D2","level":"warning","message":{"text":"Context.convolution (cognitive 32): Context.convolution has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 9, ternaries 5 (8 pts), loops 3 (4 pts) (nesting depth added 8). Of this number, 28 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacityProbesConvolution.swift"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51efd4f4c489ad6d2e8d32e6160fa1ffbb23e8679778635e8514ec53869e5e5"}},{"ruleId":"D2","level":"warning","message":{"text":"QwenImage21VAEDecoder.tail (cognitive 32): QwenImage21VAEDecoder.tail has cognitive complexity 32 (threshold 15). Drivers by points: loops 6 (14 pts), if/else 4 (9 pts), ternaries 4 (8 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/QwenImage21VAE.swift"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba6a86ad106583ceb04b88a6fb1709dfe680567f3f39594f7de46e757f85ca3"}},{"ruleId":"D2","level":"warning","message":{"text":"MapComparison.compare (cognitive 32): MapComparison.compare has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 4, loops 3, match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/Map.swift"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e09150558e7e3e1d2a0895fc10e83cb5774cba4af4ac3b4ace05b7f45e77b4"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.value (cognitive 32): Parser.value has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 6, loops 3 (6 pts), match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/OrderedJSON.swift"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e4f3eb1c6dabbfd9cd0e7e21489b87227d3e7981a98973f668c9f0e8b4bdbf"}},{"ruleId":"D2","level":"warning","message":{"text":"CapacityModel.split (cognitive 31): CapacityModel.split has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (8 pts), ternaries 2 (7 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacityModel.swift"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"92dcbe356d3dd00c08150b0929ccf8dd96621304f40f80f2613a4e48f4432929"}},{"ruleId":"D2","level":"warning","message":{"text":"RGB8.init (cognitive 31): RGB8.init has cognitive complexity 31 (threshold 15). Drivers by points: boolean chains 11, if/else 4 (9 pts), loops 3 (6 pts), ternaries 2 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Qwen3VLImages.swift"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"97dbdb32c3040963553802e9f819c3d282a3666979283faa34ee0c234a29e89b"}},{"ruleId":"D2","level":"warning","message":{"text":"Sampler.run (cognitive 31): Sampler.run has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (19 pts), ternaries 5 (6 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Sampler.swift"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"4587b7bd3fbc9fd52164a59c04c4b045e2ed9aa906128bb38af9a50b60c9fdfa"}},{"ruleId":"D2","level":"warning","message":{"text":"ForgeDiT.order (cognitive 31): ForgeDiT.order has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (28 pts), boolean chains 2, match/switch 1 (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/ForgeDiT.swift"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"840fb81c16f4dc1e39fbe2c201ba408d412fc7cc3237c1a817bae4a5b87daa3a"}},{"ruleId":"D2","level":"warning","message":{"text":"AppState.restoreSettings (cognitive 31): AppState.restoreSettings has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 8, loops 1 (2 pts), ternaries 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/AppState\u002BRender.swift"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"9174c0160e3deea8d81278e2000cbba7ccf1de1fba4ebe195bd9b3ecadd5972c"}},{"ruleId":"D2","level":"warning","message":{"text":"CapacityFit.overlap (cognitive 30): CapacityFit.overlap has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 5 (8 pts), boolean chains 6, ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacityFit.swift"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"397465b7a6683e7f6ff79946c753e2c75b99ed433f66846b3d71d4b53a7e8b2d"}},{"ruleId":"D2","level":"warning","message":{"text":"ProductSolver.timed (cognitive 30): ProductSolver.timed has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 6, ternaries 3 (6 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacitySolver.swift"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c38133c22aa82e37a4f5e645a202a895b74475024297b5e541beabcb938595"}},{"ruleId":"D2","level":"warning","message":{"text":"PNG.text (cognitive 30): PNG.text has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (10 pts), boolean chains 5 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/ImagePNG.swift"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"43370a8aadc171cfee4f1487e7838c9a3dac1d74f087e143b3c5754afd257b58"}},{"ruleId":"D2","level":"warning","message":{"text":"MossImageDiT.blockStreamed (cognitive 30): MossImageDiT.blockStreamed has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 11, if/else 8 (10 pts), loops 3 (5 pts), ternaries 4 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/MossImage.swift"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"397c5540c639236cc359392eced5c612cc1a1e0602a6f582030f42a840d3d6bd"}},{"ruleId":"D2","level":"warning","message":{"text":"PillowResample.lanczos (cognitive 30): PillowResample.lanczos has cognitive complexity 30 (threshold 15). Drivers by points: loops 8 (28 pts), if/else 2 (nesting depth added 20). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Qwen3VLImages.swift"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d643e3b41f9ad83afaf64a748f976587cc79e56ba6d16914ed18d0eb72fcc7c"}},{"ruleId":"D2","level":"warning","message":{"text":"RenderLoop.compare (cognitive 30): RenderLoop.compare has cognitive complexity 30 (threshold 15). Drivers by points: loops 7 (14 pts), if/else 5 (10 pts), ternaries 2 (4 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/RenderLoop.swift"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c0235f7ef93a1de8b7dc79bfd15501c9365518fd7752338cd69d06091c9ace"}},{"ruleId":"D2","level":"warning","message":{"text":"TokenizerJSON.string (cognitive 30): TokenizerJSON.string has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 4, match/switch 2 (4 pts), loops 3 (nesting depth added 10). Of this number, 23 points are the body\u0027s own statements and 7 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/TokenizerTables.swift"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb7f633d2ec8a20fe1f0fcad38462fc8efe0b7c242c508a0fc5d2e82c773c84"}},{"ruleId":"D2","level":"warning","message":{"text":"ForgeDiT.forge (cognitive 30): ForgeDiT.forge has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 8, loops 2 (3 pts), match/switch 2 (3 pts), ternaries 2 (3 pts), error handling 1 (2 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/ForgeDiT.swift"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"601e6b0f7ea5118e49185f9dac1ea7406f05190da22b7dc50d95de991000095b"}},{"ruleId":"D2","level":"warning","message":{"text":"TailStream.init (cognitive 29): TailStream.init has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 7 (13 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Prefetcher.swift"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"a345c1219c7854213a9e869460ef829a22cc2bcb31144d146e40c2f2ae982f1e"}},{"ruleId":"D2","level":"warning","message":{"text":"TailStream.release (cognitive 29): TailStream.release has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 3 (9 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Prefetcher.swift"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"8263c736ea1861673c3353b29524e5f1bc2931870cc60707b76d138793888868"}},{"ruleId":"D2","level":"warning","message":{"text":"QwenImage21DiT.layerPass (cognitive 29): QwenImage21DiT.layerPass has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 10, loops 3 (4 pts), ternaries 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/QwenImage21.swift"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"339895bd669d33aab1c90ddffcc8725c9811b38492f9bf88baed334ec5100202"}},{"ruleId":"D2","level":"warning","message":{"text":"TextEncoder.encode (cognitive 29): TextEncoder.encode has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (21 pts), loops 5 (7 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/TextEncoder.swift"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"3833e601799e49c724a0c4a3e874f09253bfdcf2c4958095d336c56dcec61ec6"}},{"ruleId":"D2","level":"warning","message":{"text":"WeightProducts.int8Plan (cognitive 29): WeightProducts.int8Plan has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (17 pts), ternaries 6 (8 pts), boolean chains 4 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/WeightProducts.swift"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d0b165b01a17e5546e7bf9987dc00411f5fd058c797625b7cba3f3820b9346"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteLink.attempt (cognitive 29): RemoteLink.attempt has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (21 pts), match/switch 3 (5 pts), boolean chains 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Remote/Link.swift"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c82330e948ca3560f49a76967c6d8ae8435c0bf87a314d7d0a586d04c4ea59"}},{"ruleId":"D2","level":"warning","message":{"text":"ModulesAnima.swift.euler (cognitive 29): ModulesAnima.swift.euler has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 9 (12 pts), if/else 5 (8 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/ModulesAnima.swift"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3227040508aaf2626a57e644d1d1c6caeba01375a4017c67106ddc81e822f16"}},{"ruleId":"D2","level":"warning","message":{"text":"DiT.forward (cognitive 28): DiT.forward has cognitive complexity 28 (threshold 15). Drivers by points: loops 11 (13 pts), if/else 6 (8 pts), ternaries 2 (4 pts), boolean chains 3 (nesting depth added 6). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/DiT.swift"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba461d7abb14b9e92e10e03db86852e020b4c9fbde8e8c95adece09a9e91e7c7"}},{"ruleId":"D2","level":"warning","message":{"text":"MossImageForge.forgeLoRA (cognitive 28): MossImageForge.forgeLoRA has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 9, loops 3 (5 pts), ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/MossImageForge.swift"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42aa579a179ba03802cd37b98119393248f314c2a6e256f573c8cbef495f57a"}},{"ruleId":"D2","level":"warning","message":{"text":"RenderGrid.cells (cognitive 28): RenderGrid.cells has cognitive complexity 28 (threshold 15). Drivers by points: if/else 3 (8 pts), ternaries 2 (8 pts), loops 3 (6 pts), match/switch 1 (4 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/RenderGrid.swift"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a8e82c8c747ddc03fac78cf09cb20c44db39607b6790475404bd23e0f4c1d0"}},{"ruleId":"D2","level":"warning","message":{"text":"Img2ImgStages.run (cognitive 28): Img2ImgStages.run has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 14, if/else 7 (9 pts), ternaries 3, loops 2 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Verification/Img2ImgStages.swift"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e1fe99438399e7cf337c66b80ca220ef13b8b63b3eda287e737ed7c445d0db"}},{"ruleId":"D2","level":"warning","message":{"text":"AnimaDiT.forward (cognitive 27): AnimaDiT.forward has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 5, loops 2 (5 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Anima.swift"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"b472f86e7cbf848f8de1438fcaa349b4dee468b36c53eee9413015fbdb91d48a"}},{"ruleId":"D2","level":"warning","message":{"text":"GEMM.linear (cognitive 27): GEMM.linear has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 4 (7 pts), boolean chains 6 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/GEMM.swift"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"728dc76727074c7e08cd120ae6b7f390158ed38917def3845555afe1ca546c1b"}},{"ruleId":"D2","level":"warning","message":{"text":"QwenImage21Sequence.init (cognitive 27): QwenImage21Sequence.init has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 8 (12 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/QwenImage21.swift"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"21dc07f51e50dde72bece73606172065f59d3dddcb5cf24e4d0ae9c5cf96f898"}},{"ruleId":"D2","level":"warning","message":{"text":"Report.rows (cognitive 27): Report.rows has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 7 (14 pts), if/else 9 (11 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/ForgeDiT.swift"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"2266505238dad0020751f39ee8a94b548d494c70d19897b44f865803a57e631b"}},{"ruleId":"D2","level":"warning","message":{"text":"MainWindow.watchKeys (cognitive 27): MainWindow.watchKeys has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 8, ternaries 3 (5 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/App.swift"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"1860d47f4d8f059c883969190346873b42163be2f6b193da2e35ef56e8a4f662"}},{"ruleId":"D2","level":"warning","message":{"text":"MeasureOptions.parse (cognitive 26): MeasureOptions.parse has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 2 (6 pts), match/switch 2 (5 pts), boolean chains 3, loops 1 (nesting depth added 11). Of this number, 23 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Measurement/Series.swift"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e48ba321f132363e4c29217cb38716fe7ece10c3ce0def4cdd7474854253514"}},{"ruleId":"D2","level":"warning","message":{"text":"Recipe.init (cognitive 26): Recipe.init has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 6, ternaries 6, loops 1 (2 pts) (nesting depth added 6). Of this number, 24 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Engine.swift"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b68a1585148c6f66823b9c8fa9c6f762f5c24b09035ad7de140eb3ecbb8eda5"}},{"ruleId":"D2","level":"warning","message":{"text":"MemoryPlan.choose (cognitive 26): MemoryPlan.choose has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 10, if/else 7 (10 pts), ternaries 5, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/MemoryPlan.swift"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e7ea577a44d74e18585fd641606637fd374023df2d00b6dbb43db8ca174adfa"}},{"ruleId":"D2","level":"warning","message":{"text":"Config.init (cognitive 26): Config.init has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 19, if/else 7. 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":"Sources/Siliconed/Qwen35.swift"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0f55307d4261321f078450582f98e00395b8ba9f37497218c9cec20847b751"}},{"ruleId":"D2","level":"warning","message":{"text":"HubImport.examine (cognitive 26): HubImport.examine has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (11 pts), error handling 4 (6 pts), boolean chains 5, ternaries 3 (4 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/HubLink.swift"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"3477e3047c4e344c5d8044ecd1266960330f4a0e46338db56f2056b40df7c5f4"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteChannel.receive (cognitive 26): RemoteChannel.receive has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (4 pts), loops 1 (3 pts), boolean chains 2, error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Remote/Channel.swift"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbfad72cc7feb09a9bfa5c1445460a6fe7fb937e30ed74024512846f06520034"}},{"ruleId":"D2","level":"warning","message":{"text":"MirrorServer.handle (cognitive 26): MirrorServer.handle has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (15 pts), error handling 4 (8 pts), boolean chains 2, match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/MirrorServer.swift"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5ee55e7e90a4965f674741973aa64902077044d622d01dd4455b1d9ec6e4ab"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteControl.uninstall (cognitive 26): RemoteControl.uninstall has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (20 pts), ternaries 1 (3 pts), boolean chains 2, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl\u002BGestures.swift"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"9206f1c51dd56a063d873d4c11a958663d6706a3a58ec0f64e40b4de511ec4d6"}},{"ruleId":"D2","level":"warning","message":{"text":"AnimaConditioner.condition (cognitive 25): AnimaConditioner.condition has cognitive complexity 25 (threshold 15). Drivers by points: loops 8 (13 pts), if/else 7 (9 pts), boolean chains 3 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/AnimaConditioner.swift"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"05537e0d2eae5ccf1b98287c3d36f4fdc574cb9321924fd71cc5c47cc5c332f5"}},{"ruleId":"D2","level":"warning","message":{"text":"CapacityFit.shapedLine (cognitive 25): CapacityFit.shapedLine has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 7, loops 1 (3 pts), match/switch 1 (nesting depth added 7). Of this number, 18 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacityFit.swift"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b83b20d35c8b7f5d65c97d39e43986cf7eaba1223141313fe30a58d532d72e1"}},{"ruleId":"D2","level":"warning","message":{"text":"Diagnostic.exactRows (cognitive 25): Diagnostic.exactRows has cognitive complexity 25 (threshold 15). Drivers by points: loops 9 (22 pts), ternaries 1 (2 pts), if/else 1 (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/DiagnosticProbes.swift"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"933ea693436c5d5e141bff7403c33eacc09ba6b1b30db23732cd6f5760a2ed86"}},{"ruleId":"D2","level":"warning","message":{"text":"Krea2DiT.blockStreamed (cognitive 25): Krea2DiT.blockStreamed has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 11, if/else 9, ternaries 3 (5 pts) (nesting depth added 2). Of this number, 22 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Krea2.swift"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"5202778654bead3f12b56bfb86dd9b12473d4771e902dddacd4c3b073815a568"}},{"ruleId":"D2","level":"warning","message":{"text":"Widen.rotateTile (cognitive 25): Widen.rotateTile has cognitive complexity 25 (threshold 15). Drivers by points: loops 8 (24 pts), if/else 1 (nesting depth added 16). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Widen.swift"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af0ca3b0cde2c6a4679620851c0e3e823eb2ae66e693d59d602fbbd2707ab2e"}},{"ruleId":"D2","level":"warning","message":{"text":"QuantizedTensor.absMax (cognitive 25): QuantizedTensor.absMax has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10, boolean chains 5, ternaries 3 (5 pts), loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/Quantization.swift"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c6a7d999196090fdf22ecfe258facce1f34225b6a15bd47e600e152f380d96"}},{"ruleId":"D2","level":"warning","message":{"text":"MirrorLibraryHost.handle (cognitive 25): MirrorLibraryHost.handle has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 2, match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/MirrorLibrary.swift"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb605a22d805547709ef89423c0392034104a11babf13fce8423c782e983b01a"}},{"ruleId":"D2","level":"warning","message":{"text":"ForgeProgress.line (cognitive 25): ForgeProgress.line has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/Problems.swift"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"e954fce099d67640cb020fdd37cb86dc69dfc3d1738e312e0ccfb7d1ccdf451a"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteControl.set (cognitive 25): RemoteControl.set has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 5, match/switch 3 (4 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl\u002BCommands.swift"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7b565c8fad983e97829b2f337fd18555fc67f20f31abf5187fc38e94db403d"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteControl.followGrid (cognitive 25): RemoteControl.followGrid has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (nesting depth added 8). Of this number, 23 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl\u002BFollow.swift"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"3496af38b24241dff9eaaf0c856449bba78ce44fa78b5e445760926736138423"}},{"ruleId":"D2","level":"warning","message":{"text":"GEMM.accumulatedLinear (cognitive 24): GEMM.accumulatedLinear has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 7, ternaries 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/GEMM.swift"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe60caace2d6a3efb651bd2debb8960edb89bcb4c6203a9eced05af261ec6849"}},{"ruleId":"D2","level":"warning","message":{"text":"LoRA.materialize (cognitive 24): LoRA.materialize has cognitive complexity 24 (threshold 15). Drivers by points: loops 4 (11 pts), if/else 6 (10 pts), boolean chains 3 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/LoRA.swift"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa2497d4180a9f511b064129884f822988f746586bb6f7120c2d911285054e86"}},{"ruleId":"D2","level":"warning","message":{"text":"MemoryNeed.gemm (cognitive 24): MemoryNeed.gemm has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 5 (10 pts), ternaries 3, boolean chains 1 (nesting depth added 7). Of this number, 14 points are the body\u0027s own statements and 10 belong to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/MemoryNeed.swift"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6cac243d51bb45a1ce7f7e2585d213257fc06a67178fff42543b954679968f8"}},{"ruleId":"D2","level":"warning","message":{"text":"PromptAlternatives.parse (cognitive 24): PromptAlternatives.parse has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/PromptAlternatives.swift"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ff248fdb00ee8a6ab62fe6618dbc7a8ee8741453096882ea872bf81e8d4987"}},{"ruleId":"D2","level":"warning","message":{"text":"Qwen35Encoder.encode (cognitive 24): Qwen35Encoder.encode has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 5 (7 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Qwen35.swift"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"b885737e7e9d6255a0fcbfe9b4bd31d3ffabfb5d0333688ae8e80bccc59ed627"}},{"ruleId":"D2","level":"warning","message":{"text":"Qwen3VLEncoder.encode (cognitive 24): Qwen3VLEncoder.encode has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 5 (11 pts) (nesting depth added 10). Of this number, 14 points are the body\u0027s own statements and 10 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Qwen3VL.swift"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74741326ad81a9d2fea360441f801ff7e2efed0c2470a72d2a6263770df377d"}},{"ruleId":"D2","level":"warning","message":{"text":"Resample.lanczosDouble (cognitive 24): Resample.lanczosDouble has cognitive complexity 24 (threshold 15). Drivers by points: loops 8 (22 pts), if/else 2 (nesting depth added 14). Of this number, 22 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Resample.swift"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c7f72a28dd80b90e1824f7fba92806b83c1a4d4038e58cf99fc1c355d98481"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkingCopy.prepare (cognitive 24): WorkingCopy.prepare has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 6 (10 pts), ternaries 1 (2 pts), boolean chains 1, error handling 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/WorkingCopy.swift"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"836f5850709f88ed255d244959713960b3ce0c9aac639aa1c70cfff99079cb3a"}},{"ruleId":"D2","level":"warning","message":{"text":"Downloader.download (cognitive 24): Downloader.download has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 7, ternaries 2 (4 pts), error handling 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/Downloader.swift"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"b25ab5c118148ab347db100d635da8e0f6405b1dc5ce372e0aa0c933872403ad"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteHost.pair (cognitive 24): RemoteHost.pair has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 5, ternaries 2 (5 pts), error handling 1 (2 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Remote/Host.swift"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c1a719699796c4d5070cc8b0db1765f2e8fad6452b575884ccc6e65166468f"}},{"ruleId":"D2","level":"warning","message":{"text":"AppState.sheetDrawing (cognitive 24): AppState.sheetDrawing has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15, boolean chains 4, ternaries 3, loops 1, match/switch 1. Of this number, 20 points are the body\u0027s own statements and 4 belong to 3 function items inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/AppState\u002BRender.swift"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4c61cc6cb811fa73c6b4b6c59f84035d46738fa6cb6a03f5236cbabe991d48"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteControl.writeInText (cognitive 24): RemoteControl.writeInText has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 5, match/switch 1 (2 pts), loops 1, ternaries 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl\u002BLab.swift"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"76fd119b48e3d6d04acaf16ab2c6b9021ee0cf579fdb74f118c59e97688ca6b5"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteControl.followMirroredGrid (cognitive 24): RemoteControl.followMirroredGrid has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 4, loops 1, match/switch 1 (nesting depth added 3). Of this number, 14 points are the body\u0027s own statements and 10 belong to 2 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl\u002BMirror.swift"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"6180bb9dc8e5b21b36c2343ef215086df63d4c1d4312b21825a58a9dab7e6db0"}},{"ruleId":"D2","level":"warning","message":{"text":"CapacityFit.sharing (cognitive 23): CapacityFit.sharing has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 4 (6 pts), boolean chains 4, ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacityFit.swift"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b250d92bf619041264042c48b50478f0fbca43596bad1c2dcbd39d04b1f9df5"}},{"ruleId":"D2","level":"warning","message":{"text":"CapacityModel.init (cognitive 23): CapacityModel.init has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 7 (8 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacityModel.swift"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"fecee5196bf79ef688db79078f3e1fe53188135bdf75f53d11f55bed86650aad"}},{"ruleId":"D2","level":"warning","message":{"text":"CapacityPlan.init (cognitive 23): CapacityPlan.init has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 20, ternaries 3. Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, 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":"Sources/Siliconed/CapacityPlan.swift"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d2640d1b93ef281e15d46812647d4a7815b5e7a7fa7ed480a668dd0d25d18e"}},{"ruleId":"D2","level":"warning","message":{"text":"EngineSettings.init (cognitive 23): EngineSettings.init has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/EngineSettings.swift"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"39133fe6a0c0f82c001b440997aa557c4077cb5b49fe7b64eebeb431d0b54f1c"}},{"ruleId":"D2","level":"warning","message":{"text":"VAEEncoder.init (cognitive 23): VAEEncoder.init has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 10, if/else 9 (10 pts), ternaries 2, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/VAEEncoder.swift"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"79aba63925bd982a290076a320a4f6553b4215aea8c3d58604b654c2dfb4ba5b"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteHost.admit (cognitive 23): RemoteHost.admit has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 3, loops 1 (2 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Remote/Host.swift"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"723208ff5bddf7853b73c6a46795356f5c2d92632a8dcb524ce3ed462e746eb8"}},{"ruleId":"D2","level":"warning","message":{"text":"AppState.open (cognitive 23): AppState.open has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 7, error handling 2 (3 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/AppState\u002BHub.swift"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de8fef0107b1df3b1e69a92b3c992e6a81fe75223895bd3b453937e936835cc"}},{"ruleId":"D2","level":"warning","message":{"text":"SceneView.bar (cognitive 23): SceneView.bar has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 5 (15 pts), if/else 5 (8 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/SceneView.swift"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e083e94437b4ac71e25b100edbd92db229f6837affed566e861bc9770b56a9d"}},{"ruleId":"D2","level":"warning","message":{"text":"main.swift.top-level code (cognitive 23): main.swift.top-level code has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (10 pts), error handling 4 (8 pts), ternaries 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Silicontrol/main.swift"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"76671f8ca0ffbaca258bb9d65c0c06bad3fb38b1701be13eac94be943211ca76"}},{"ruleId":"D2","level":"warning","message":{"text":"AnimaDiT.gemv (cognitive 22): AnimaDiT.gemv has cognitive complexity 22 (threshold 15). Drivers by points: loops 5 (16 pts), boolean chains 3, if/else 3 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Anima.swift"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"2722d340e73cda385a7b6184f0e61073d5e5c6a46bb4f82a76333d02bc6a3089"}},{"ruleId":"D2","level":"warning","message":{"text":"FileCopy.copy (cognitive 22): FileCopy.copy has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 2 (3 pts), ternaries 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/LibraryPlace.swift"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd928d1c1cef670751b3309c2ef1a74fcd152c0c6002c3f9b97e1549b2eb353b"}},{"ruleId":"D2","level":"warning","message":{"text":"QwenImage21DiT.layerStreamed (cognitive 22): QwenImage21DiT.layerStreamed has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 8, loops 5 (6 pts), if/else 5, ternaries 3 (nesting depth added 1). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/QwenImage21.swift"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ed924d4dd63aef3ae7e4da0be701234323908f9b24c28c811a661771fad862"}},{"ruleId":"D2","level":"warning","message":{"text":"QwenImage21DiT.attend (cognitive 22): QwenImage21DiT.attend has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 3 (6 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/QwenImage21.swift"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eee9c1aadbfe179441123ecb629397e6162601dbdc1202c6cab20a1d2630b43"}},{"ruleId":"D2","level":"warning","message":{"text":"SetOrder.parse (cognitive 22): SetOrder.parse has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4, ternaries 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/RemoteWriting.swift"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"119dec345f27eb63f30deb86304557de45a81f5fc6a198b63ff3a12a17837eb2"}},{"ruleId":"D2","level":"warning","message":{"text":"T5Tokenizer.viterbi (cognitive 22): T5Tokenizer.viterbi has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/T5Tokenizer.swift"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28078028d22d719f2efbe3380314c38f353d5b6de5b27cc8d9c9fd621552d1f"}},{"ruleId":"D2","level":"warning","message":{"text":"TiledAttention.submit (cognitive 22): TiledAttention.submit has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 4 (7 pts), boolean chains 5, if/else 5, loops 3 (5 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/TiledAttention.swift"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"373889e4ff569757ae0cd4bd29d2ae442595b4c492d3e24cd3f861c5110282bb"}},{"ruleId":"D2","level":"warning","message":{"text":"WeightProducts.prepareSQ (cognitive 22): WeightProducts.prepareSQ has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 14, if/else 4, ternaries 2 (4 pts) (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/WeightProducts.swift"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c5481af1a047f5ed4195afbb518b6b849af7601d23e4b8a7ea8f26603d02b6"}},{"ruleId":"D2","level":"warning","message":{"text":"Widen.dequantizePacked (cognitive 22): Widen.dequantizePacked has cognitive complexity 22 (threshold 15). Drivers by points: loops 8 (16 pts), if/else 4, boolean chains 1, match/switch 1 (nesting depth added 8). Of this number, 20 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Widen.swift"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c3f672a7472629c26944b4d9087cf119a3e0e2da1e9fd9bdf804d23e7b2930"}},{"ruleId":"D2","level":"warning","message":{"text":"ForgeQwen35.plan (cognitive 22): ForgeQwen35.plan has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 5, ternaries 2 (3 pts), loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/ForgeQwen35.swift"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"924b8edfc41b232794600cfa3e6c4efec47651b8f208f62e7b916d02f7628cb0"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.chain (cognitive 22): Parser.chain has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/OrderedJSON.swift"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea07c1fddf1d7ea1263d88c1e39113bbbb5e6808055063c40fa246e25cf53b39"}},{"ruleId":"D2","level":"warning","message":{"text":"QuantizedTensor.dequantized (cognitive 22): QuantizedTensor.dequantized has cognitive complexity 22 (threshold 15). Drivers by points: loops 3 (9 pts), boolean chains 5, if/else 4, ternaries 3 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/Quantization.swift"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"254baf9f33e042b892a737e9497649aee088a0f2531447fe69152cbd1c2d5025"}},{"ruleId":"D2","level":"warning","message":{"text":"Problem.sentence (cognitive 22): Problem.sentence has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 7 (13 pts), if/else 3 (5 pts), ternaries 2 (4 pts) (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/Problems.swift"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"936e8a5c23cbff834f969e036a538397045d6e441b695189a2a6cf95c38505ee"}},{"ruleId":"D2","level":"warning","message":{"text":"Footer.body (cognitive 22): Footer.body has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (18 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/Sidebar.swift"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"b567c8fbab9a2eb992811415f813633ddb24866e690a84a1f3c63faa2f1b88c9"}},{"ruleId":"D2","level":"warning","message":{"text":"FrameEditor.drag (cognitive 22): FrameEditor.drag has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 9 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/SubjectSheet.swift"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f883d60c36757e12d8537b0be9c737b9a963630e8e4190273393e49c4ab3f9e"}},{"ruleId":"D2","level":"warning","message":{"text":"AnimaOps.patchify (cognitive 21): AnimaOps.patchify has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (15 pts), ternaries 1 (6 pts) (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Anima.swift"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5d62af90e0babbdb04c95938e03a2ac31bf2cf17f94efbbff7c5f1b9dff02e"}},{"ruleId":"D2","level":"warning","message":{"text":"Artifact.scale (cognitive 21): Artifact.scale has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 15, if/else 4, match/switch 1, ternaries 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Artifact.swift"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4bf718a259086c9242a5ae399738aa1729e3570784ee13fee3c8e80b239bfcf"}},{"ruleId":"D2","level":"warning","message":{"text":"Phase.init (cognitive 21): Phase.init has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Remote/Installing.swift"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca24778bd9ccfe99959c2ac1990da223ca1915eb4ef4af6942ae72794323630"}},{"ruleId":"D2","level":"warning","message":{"text":"Admission.judge (cognitive 21): Admission.judge has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 4, ternaries 1 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/EngineAdmission.swift"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a5448ea6a593f1f8d181e62ce1e8da752e62625ebeca3822029ff760d2960a1"}},{"ruleId":"D2","level":"warning","message":{"text":"EngineError.errorDescription (cognitive 21): EngineError.errorDescription has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 7 (13 pts), ternaries 3 (6 pts), boolean chains 1, if/else 1 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Errors.swift"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4fb8d6ed8e7818387259b2824cc6ffe6d8d1d4bae99e11b93d65f55f0260d8"}},{"ruleId":"D2","level":"warning","message":{"text":"Qwen3VLDecoder.make::matrix (cognitive 21): Qwen3VLDecoder.make::matrix has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, match/switch 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Qwen3VLDecoder.swift"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"45fb2c9cf33cacccb56841b5abdb9ec4577a43a612c15e5a4db988c0a7594d13"}},{"ruleId":"D2","level":"warning","message":{"text":"QwenImage21DiT.init (cognitive 21): QwenImage21DiT.init has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 7, ternaries 2, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/QwenImage21.swift"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bcc584530f5bc8225c6e0448db23f16301901d50a137a08584fbe49e0edc11d"}},{"ruleId":"D2","level":"warning","message":{"text":"QwenImage21VAEDecoder.decode (cognitive 21): QwenImage21VAEDecoder.decode has cognitive complexity 21 (threshold 15). Drivers by points: loops 3 (10 pts), if/else 3 (5 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/QwenImage21VAE.swift"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c34c6ef3fe0c64fca0ebbafe29aecc83bfd669bb133ebff6b15b0ff7ae3521f"}},{"ruleId":"D2","level":"warning","message":{"text":"Tokenizer.split (cognitive 21): Tokenizer.split has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Tokenizer.swift"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e832376c3e8129102c6f5b82269d039fb4c85f9079909c22a47c155ec0d459"}},{"ruleId":"D2","level":"warning","message":{"text":"AppState.enqueueGrid (cognitive 21): AppState.enqueueGrid has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10, ternaries 4 (5 pts), boolean chains 4, loops 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/AppState\u002BRender.swift"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e88d71f4d6d5d211df8c2127171ab2adeb7b48143c1e766eb86d2a79066931"}},{"ruleId":"D2","level":"warning","message":{"text":"MirrorServer.release (cognitive 21): MirrorServer.release has cognitive complexity 21 (threshold 15). Drivers by points: if/else 2 (6 pts), ternaries 1 (5 pts), error handling 2 (4 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/MirrorServer.swift"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"94db494901a89e694a2034c0870a1cd48bc5a664b8293bab12a75caff8e5a06b"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteControl.followToEnd (cognitive 21): RemoteControl.followToEnd has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 2 (3 pts), match/switch 1 (nesting depth added 8). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl\u002BFollow.swift"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc0c7ed8c02024822e3ef02e50f09670e67a2860faca21e71f88cdc252c2fa00"}},{"ruleId":"D2","level":"warning","message":{"text":"SceneView.body (cognitive 21): SceneView.body has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 8, ternaries 2 (4 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/SceneView.swift"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9081407a0f136b2c4a73dfdf18e2d854ead1421d31b28366bedf6ac55c18481"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckCommand.run (cognitive 21): CheckCommand.run has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 2, ternaries 1 (2 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Verification/Registry.swift"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"37297bf3e607fe33fcf7c7f5e7a932f8f3b1f3b84ec0696717b3749a3b53f32b"}},{"ruleId":"D2","level":"warning","message":{"text":"AnimaConditioner.attention (cognitive 20): AnimaConditioner.attention has cognitive complexity 20 (threshold 15). Drivers by points: loops 7 (20 pts) (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/AnimaConditioner.swift"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da13d39da6e3f33d900709b9569410136eaab72a6fc1c5d7d069c26081d3747"}},{"ruleId":"D2","level":"warning","message":{"text":"PromptDiff.align (cognitive 20): PromptDiff.align has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (7 pts), loops 6 (7 pts), ternaries 1 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/PromptDiff.swift"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"59ea872a15f615a074f579c0aa92d2f397c11eab382a0586d52fb18761e0f73c"}},{"ruleId":"D2","level":"warning","message":{"text":"Qwen3VLVision.encode (cognitive 20): Qwen3VLVision.encode has cognitive complexity 20 (threshold 15). Drivers by points: loops 6 (11 pts), if/else 4 (7 pts), boolean chains 2 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Qwen3VLVision.swift"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"af0ea95d2d6498a622fc8342e17e49cd72393e8e512624ec87b902fb0956b706"}},{"ruleId":"D2","level":"warning","message":{"text":"TiledAttention.init (cognitive 20): TiledAttention.init has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (11 pts), ternaries 4 (5 pts), boolean chains 4 (nesting depth added 2). Of this number, 18 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/TiledAttention.swift"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16fcf95f6b17d5e4d0f25eec22be3124298ae2f8b811eb2bd098156ff15abe8"}},{"ruleId":"D2","level":"warning","message":{"text":"ForgeText.plan (cognitive 20): ForgeText.plan has cognitive complexity 20 (threshold 15). Drivers by points: if/else 18 (23 pts), ternaries 6 (8 pts), boolean chains 7, loops 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This shape REPEATS in the file: one other method here (ForgeText.plan::wantedName) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/ForgeText.swift"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81a67bc1054291dcb77fcf813bb6528bdd54f5b69016ffb26d3fdb93ccf1103"}},{"ruleId":"D2","level":"warning","message":{"text":"AppCommands.body (cognitive 20): AppCommands.body has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11, ternaries 5, boolean chains 4. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/App.swift"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"656f320626e9bf2a1a43582eb4b2625180cf0c30a6814b1f4ac93a1ad496b8c6"}},{"ruleId":"D2","level":"warning","message":{"text":"AppState.next (cognitive 20): AppState.next has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 7 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/AppState\u002BRender.swift"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf9f0565e6091dc10d1951ef7fd99b9f7ed623bbdc677db9ed48794f91fb3d82"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteControl.lab (cognitive 20): RemoteControl.lab has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 11). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl\u002BLab.swift"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"220e2105998d83823299bd98e8947054f2e8380d88a4c6dc56ed01dd2eb3539c"}},{"ruleId":"D2","level":"warning","message":{"text":"ProductAssignment.route (cognitive 19): ProductAssignment.route has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 8 (16 pts), if/else 1 (2 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacityPlan.swift"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d47d2abf4f7be2de37aebf144f53a203565cacfd52bcbb527b87852d496cb16"}},{"ruleId":"D2","level":"warning","message":{"text":"Diagnostic.measureWidening (cognitive 19): Diagnostic.measureWidening has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 6 (8 pts), loops 6 (7 pts), if/else 1 (2 pts), boolean chains 1, error handling 1 (nesting depth added 4). Of this number, 16 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/DiagnosticWideningProbes.swift"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"893546cf6e48c754fec42dea12b749bce59b34fa5202763e4d0a09692c00c74e"}},{"ruleId":"D2","level":"warning","message":{"text":"MossImageDiT.forward (cognitive 19): MossImageDiT.forward has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/MossImage.swift"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"b018ac33bd900be1cb86d3afc48c6c6789f01d766786570fa7c4980128145298"}},{"ruleId":"D2","level":"warning","message":{"text":"UTF8Stream.incompleteTail (cognitive 19): UTF8Stream.incompleteTail has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (6 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Qwen3VLGeneration.swift"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"518d6b5c28f5c5b5a6d924f087a549b92f644b90e09dbe8a5db5ce6724da70cb"}},{"ruleId":"D2","level":"warning","message":{"text":"TokenizerJSON.skipValue (cognitive 19): TokenizerJSON.skipValue has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 4, loops 2 (4 pts), match/switch 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/TokenizerTables.swift"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8757a7493716089fa4b0b91e53b0d818b573131ff58e8bc6bed030d8496c16f"}},{"ruleId":"D2","level":"warning","message":{"text":"WeightProducts.classification (cognitive 19): WeightProducts.classification has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 6 (13 pts), if/else 2 (4 pts), boolean chains 1, match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/WeightProducts.swift"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6471a6fc5c4b58db712593b2175aeeca17a9fd3d778396d3a469da75d183aa"}},{"ruleId":"D2","level":"warning","message":{"text":"ForgeText.plan::wantedName (cognitive 19): ForgeText.plan::wantedName has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), ternaries 3 (5 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (ForgeText.plan) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/ForgeText.swift"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"a228f7bbce80a98ba220a851da4494081ca373847631a01790f15da06a4c3af2"}},{"ruleId":"D2","level":"warning","message":{"text":"HubImport.contentRanges (cognitive 19): HubImport.contentRanges has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 10, if/else 5 (7 pts), loops 2 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/HubLink.swift"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"18b636d832549d7f44e4e585be308e78d1fa8b8057d169701cb63af10e70ac00"}},{"ruleId":"D2","level":"warning","message":{"text":"Installer.installMossImage (cognitive 19): Installer.installMossImage has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/Installation.swift"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb12808629dfe7edde5ad2cbf77f557e947029becefc0acedbd45481db97c37"}},{"ruleId":"D2","level":"warning","message":{"text":"OrderedJSON.reprPython (cognitive 19): OrderedJSON.reprPython has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 3 (6 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/OrderedJSON.swift"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"814f3592d4a88b5ad4526f61c9b9902be1fb331d8814979d7d1b9ef2fd0b1583"}},{"ruleId":"D2","level":"warning","message":{"text":"RemotePairingAttempt.start (cognitive 19): RemotePairingAttempt.start has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 2 (5 pts), error handling 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Remote/Link.swift"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66685b33e12d9132c9b10a308c39d69e6c5afa0ccc0b6735561e97c744075aa"}},{"ruleId":"D2","level":"warning","message":{"text":"AppState.formBlocker (cognitive 19): AppState.formBlocker has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14, boolean chains 5. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/AppState\u002BCatalog.swift"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"120c42e216dfee2451d531fb23a8de468a1d7dbe01db4f9020561c54dc552668"}},{"ruleId":"D2","level":"warning","message":{"text":"LicenseTerms.body (cognitive 19): LicenseTerms.body has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15, boolean chains 2, ternaries 2. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/LicenseSheet.swift"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8189d32cc20a7e8818920d8fe5e67627bd655f0caa3f2b1b2553f07d99eb531"}},{"ruleId":"D2","level":"warning","message":{"text":"Coordinator.restyle (cognitive 19): Coordinator.restyle has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 4 (5 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/PromptField.swift"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf725835ffd5a15b519454a97b403ff15ade8058de75da1e10ac804fc95d9dd"}},{"ruleId":"D2","level":"warning","message":{"text":"Coordinator.typedMention (cognitive 19): Coordinator.typedMention has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 7, ternaries 1 (3 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/PromptField.swift"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bedcaabfef326a54f5d29fd865cb2906ba97a9d2694eaad6ceeb0a67804225e"}},{"ruleId":"D2","level":"warning","message":{"text":"PromptTextView.varyTarget (cognitive 19): PromptTextView.varyTarget has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 8, loops 1, ternaries 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/PromptField.swift"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"97aae212543dd819cec40c115c2b832b37f019812beb796b436ee95aea500fda"}},{"ruleId":"D2","level":"warning","message":{"text":"AnimaDiT.block (cognitive 18): AnimaDiT.block has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (8 pts), loops 2 (4 pts), ternaries 2 (4 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Anima.swift"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d8db8bad380a6bd7a06f32096739152d87f1f6abcd8f4ab13f82dd4ee15ce71"}},{"ruleId":"D2","level":"warning","message":{"text":"HeadSplitAttention.run (cognitive 18): HeadSplitAttention.run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/HeadSplitAttention.swift"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"6873b4388ac1cababcc3437324fdb710baa352d122b19e55aa0053efbe8de116"}},{"ruleId":"D2","level":"warning","message":{"text":"PromptDiff.pieces (cognitive 18): PromptDiff.pieces has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 5, loops 5, if/else 4, match/switch 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 2). Of this number, 14 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/PromptDiff.swift"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc7a9610277b3f68074dab91cb5f8110b472d4f4205576ff88032c7b7f9e51f5"}},{"ruleId":"D2","level":"warning","message":{"text":"WriterOrder.parse (cognitive 18): WriterOrder.parse has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/RemoteWriting.swift"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"5227c1bca472d7ffc25af9617085473b1e36ec646bfe9faa8ca3dc3412e17fae"}},{"ruleId":"D2","level":"warning","message":{"text":"SolverWalk.stepUniPC (cognitive 18): SolverWalk.stepUniPC has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 6 (9 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Solver.swift"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"25810e5c508a1890d163dbb11b145ae50098740c2f4f5b87c7a8e19ec4f36088"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamedLoRA.init (cognitive 18): StreamedLoRA.init has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 7, if/else 3 (6 pts), loops 4 (5 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/StreamedLoRA.swift"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb1c3e0daa0d307617ca5bffa242b7198926229fddc0ab1b9e468351ca1beab"}},{"ruleId":"D2","level":"warning","message":{"text":"W8A8.quantize (cognitive 18): W8A8.quantize has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (17 pts), if/else 1 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/TensorGEMMInt8.swift"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb74100e362db9bd979aedcfa7134f3639785fcef6964ea998df07637c16d002"}},{"ruleId":"D2","level":"warning","message":{"text":"WeightProducts.plannedInt8 (cognitive 18): WeightProducts.plannedInt8 has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 11, ternaries 6, if/else 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/WeightProducts.swift"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"436befb09ba81b74b09e347d3cf33bbee67951711fe44c122c05394ba1c83641"}},{"ruleId":"D2","level":"warning","message":{"text":"Downloader.downloadInChunks (cognitive 18): Downloader.downloadInChunks has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 2, loops 1, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/Downloader.swift"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"13cc67377dad3bcd0a4214e36c4f8aee80b6cc86ee584829da70dc8cdfa0ca91"}},{"ruleId":"D2","level":"warning","message":{"text":"ChunkRun.fetch (cognitive 18): ChunkRun.fetch has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/Downloader.swift"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"780273bb603c949bebfe60aedecb140e1966180eb97d52b2546be4f9b4e24fd8"}},{"ruleId":"D2","level":"warning","message":{"text":"AppState.receiveLibrary (cognitive 18): AppState.receiveLibrary has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 6, match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/MirrorLibrary.swift"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35e82171d440722d7d28473c7346065fc3a01b6b627ac648e3d8aeaa51f96b3"}},{"ruleId":"D2","level":"warning","message":{"text":"MenuEntry.body (cognitive 18): MenuEntry.body has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 3 (5 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/HistoryTiles.swift"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"d68ddc2acd4a13d83b8105a44224a56595265637efd49ca9506558abc1f6c680"}},{"ruleId":"D2","level":"warning","message":{"text":"MirrorServer.admit (cognitive 18): MirrorServer.admit has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 7, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/MirrorServer.swift"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5aa294997a5d1609ddaedc39d860cd72de98f24f4435642d8e8bcf97998fdcb"}},{"ruleId":"D2","level":"warning","message":{"text":"Wires.body (cognitive 18): Wires.body has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 7 (14 pts), if/else 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/Rack.swift"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"4000aaee61bd08c5935b76dc3a630a17e50f6ee99c57268a9e527f8aab6d5b07"}},{"ruleId":"D2","level":"warning","message":{"text":"Statistics.stages (cognitive 18): Statistics.stages has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 4 (10 pts), if/else 4 (6 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/Statistics.swift"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"9293b757a1196041b4e770f927416d7e536d674fc724d9b77c63c30742f289b8"}},{"ruleId":"D2","level":"warning","message":{"text":"QwenImageStages.textWithImages (cognitive 18): QwenImageStages.textWithImages has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 3, loops 2, ternaries 2 (nesting depth added 2). Of this number, 11 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Verification/QwenImageStages.swift"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2c721a762fb7ed1c3ec7ba68b0a3f3b3bcba9e548d3ddedcb4cd42acd74705"}},{"ruleId":"D2","level":"warning","message":{"text":"Context.chooseTiles::run (cognitive 17): Context.chooseTiles::run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 3 (6 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacityProbesSolos.swift"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"c40738c369a92f31c94fc06fe0e4756d0b42ee2ce72a3dc4088a815c47538cbf"}},{"ruleId":"D2","level":"warning","message":{"text":"CapacityFit.thinFit (cognitive 17): CapacityFit.thinFit has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 10, if/else 7. Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, 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":"Sources/Siliconed/CapacityFit.swift"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ad6b73da22a44855fe4094327b86d0aac36ac327d7a25024781ebc18441294"}},{"ruleId":"D2","level":"warning","message":{"text":"Flux2VAE.patchify (cognitive 17): Flux2VAE.patchify has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (15 pts), boolean chains 2 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Flux2VAE.swift"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"98576c3814b4add218761d243a2dc5da7a7f159880c6a48545a8c8e903323fd2"}},{"ruleId":"D2","level":"warning","message":{"text":"TileTable.use (cognitive 17): TileTable.use has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 5 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/MatmulTile.swift"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1214cc421f47e3d11f2256756edd3f308e7b6276f850fd3484247087fb1135d"}},{"ruleId":"D2","level":"warning","message":{"text":"NamedSubjects.mentions (cognitive 17): NamedSubjects.mentions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/NamedSubjects.swift"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"31199a8802cc32c40ca128f672be40883e6fae9be0ff4642fe4d58d759e7ba42"}},{"ruleId":"D2","level":"warning","message":{"text":"NeuralEngine.prepareColumns (cognitive 17): NeuralEngine.prepareColumns has cognitive complexity 17 (threshold 15). Drivers by points: loops 8 (13 pts), if/else 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/NeuralEngine.swift"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"63bb7fc1b0b3e7e6e18f34c24e954b049096580f021e45a794a394c3031ecfa1"}},{"ruleId":"D2","level":"warning","message":{"text":"TailStream.start (cognitive 17): TailStream.start has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 3 (7 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Prefetcher.swift"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd1234da5c854d1edcdc381990cf550fdb6a8b17d39ca8aa4e8f0334242d2573"}},{"ruleId":"D2","level":"warning","message":{"text":"PromptDiff.units (cognitive 17): PromptDiff.units has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/PromptDiff.swift"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"1781165bd1cf391f3be39b8c7109204f95685e6e163c266d6806f1d13cf3d371"}},{"ruleId":"D2","level":"warning","message":{"text":"QwenImage21VAEEncoder.stages (cognitive 17): QwenImage21VAEEncoder.stages has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (6 pts), ternaries 2 (6 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/QwenImage21VAE.swift"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17a7c647db36ee6f75465a6946f0ecbe362e9259fce63086cf58bb3a7a94bd4"}},{"ruleId":"D2","level":"warning","message":{"text":"VAELayout.place::layout (cognitive 17): VAELayout.place::layout has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 2 (6 pts), boolean chains 2 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/VAEMemory.swift"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f01704f5fda9cf84825d02a60835a4d7e5c43087eea2a721a8a117f64a5b1a"}},{"ruleId":"D2","level":"warning","message":{"text":"WeightProducts.inPlaceInt8 (cognitive 17): WeightProducts.inPlaceInt8 has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 16, if/else 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/WeightProducts.swift"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"a635b98684604ad93c2bd32fec9d82989b53361c82fa3588cc6a04027719ffc6"}},{"ruleId":"D2","level":"warning","message":{"text":"Clouds.arbitrate (cognitive 17): Clouds.arbitrate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6, ternaries 4 (6 pts), boolean chains 5 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Verification/Krea2Stages.swift"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c31a5aba9f4d07dad9b59f166794031e0823f80ade029cc2332129cf74764b6"}},{"ruleId":"D2","level":"warning","message":{"text":"Context.sharingPair (cognitive 16): Context.sharingPair has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 6, loops 1, match/switch 1, ternaries 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacityProbesSharing.swift"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9865e2cbee9ed2d54fb4767982b704791f61a524b5715154f0d3af80472be7e"}},{"ruleId":"D2","level":"warning","message":{"text":"Context.normRope (cognitive 16): Context.normRope has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacityProbesWake.swift"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"55fe31bdc49b26ecde199b6ef0ff0caaf1d48820aa0ce0e6e919506730996828"}},{"ruleId":"D2","level":"warning","message":{"text":"Block.forward (cognitive 16): Block.forward has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 3, loops 1, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Block.swift"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d5ce26781eaca56c4cc6620ac81e355d8053da19498b90442fadf19a051d94"}},{"ruleId":"D2","level":"warning","message":{"text":"ProductSolver.candidates (cognitive 16): ProductSolver.candidates has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacitySolver.swift"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"38157cc285a922ad31d7e1e69416ca230255098885878b9166c5f3017dbaa90c"}},{"ruleId":"D2","level":"warning","message":{"text":"Krea2Exact.linears (cognitive 16): Krea2Exact.linears has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (9 pts), if/else 4, boolean chains 3 (nesting depth added 4). Of this number, 10 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Krea2.swift"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"d373fd9e275905b77add6238f16a3e2380e5e9917fcfe287ad7bcc2af74a5be7"}},{"ruleId":"D2","level":"warning","message":{"text":"TailStream.pointer (cognitive 16): TailStream.pointer has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 2, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Prefetcher.swift"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"194f605b11cf16a525a4e42477782b6bde64c485a38fc98a24c725ab412054f5"}},{"ruleId":"D2","level":"warning","message":{"text":"PromptWriter.run (cognitive 16): PromptWriter.run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 1, error handling 1, match/switch 1, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/PromptWriter.swift"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"562dbe4353e857776ae7b7db22f896d70931b1672bbec379711c83de805ad39b"}},{"ruleId":"D2","level":"warning","message":{"text":"QKNormRope.run (cognitive 16): QKNormRope.run has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 4 (5 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/QKNormRope.swift"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43258dd30605c4116a99850c3d52096e6efb2e74b2391ff922bc14901f5f660"}},{"ruleId":"D2","level":"warning","message":{"text":"Config.init (cognitive 16): Config.init has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 13, if/else 3. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Qwen3VLVision.swift"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f38ddaaf0c09ba24b51cb83337b25883def3c00d2a8c0baf47f37818587936"}},{"ruleId":"D2","level":"warning","message":{"text":"CropSpec.resolve (cognitive 16): CropSpec.resolve has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, if/else 4 (7 pts), match/switch 1, ternaries 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/RemoteGestures.swift"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a3146045834970b48c99a3bbc9d9428e8fd7170a2b6a87a3f9b42d67e6350f"}},{"ruleId":"D2","level":"warning","message":{"text":"Widen.dequantize (cognitive 16): Widen.dequantize has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 4, match/switch 2, boolean chains 1 (nesting depth added 5). Of this number, 14 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Widen.swift"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc119a72fd1aea2098dd290aae116cffca526f6501863ccf6caf8af745eea46"}},{"ruleId":"D2","level":"warning","message":{"text":"MapWriter.produce (cognitive 16): MapWriter.produce has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), boolean chains 4, ternaries 2 (4 pts), match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/Map.swift"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b73dd916d94c0b0130cd57fa1ce27e5e0adf8423dc5d2131220c5971212a389"}},{"ruleId":"D2","level":"warning","message":{"text":"MainWindow.key (cognitive 16): MainWindow.key has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 4, match/switch 1 (nesting depth added 5). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/App.swift"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"8152151b792c1b7563f1e66be152b123b0b059d633058fb584482e1ca31951db"}},{"ruleId":"D2","level":"warning","message":{"text":"AppState.click (cognitive 16): AppState.click has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 2 (4 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/AppState\u002BHistory.swift"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"58973cb3bd41148370a7c3e1f792284cdc603e0ddddebe4a09760ffccc926fdc"}},{"ruleId":"D2","level":"warning","message":{"text":"LabModel.writeForRemote (cognitive 16): LabModel.writeForRemote has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 1 (3 pts), loops 1 (2 pts), error handling 1 (nesting depth added 8). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/LabRemote.swift"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"684933193b8e07e117759669e6bea7d6bf2d52225ba5d1953c24cc9bf5b2e220"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelManagement.installPanel (cognitive 16): ModelManagement.installPanel has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/ModelsSheet.swift"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"297bed2930814787fd1c84bec4207a05739ededbff99242197230b2ba008b845"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteControl.install (cognitive 16): RemoteControl.install has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, boolean chains 7, ternaries 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl\u002BCommands.swift"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"c653a7846741a3ef6f3f6c4e1b0c4e4cbb51401456f8c65666e8b63eb2f24494"}},{"ruleId":"D2","level":"warning","message":{"text":"main.swift.exchange (cognitive 16): main.swift.exchange has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 4). Of this number, 10 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Silicontrol/main.swift"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a53346b247ec58084723603eec6b8aea3577481f90f7358160d082ef285bda1"}},{"ruleId":"D2","level":"warning","message":{"text":"MossImageEncoderStages.run (cognitive 16): MossImageEncoderStages.run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6, ternaries 4 (6 pts), boolean chains 2, loops 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Verification/MossImageEncoderStages.swift"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"d855aa8d5eccb1f9d73cab5698c1a85e72145ec86881738b3da66d8b882a2016"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AppState: TooManyMethods \u2014 270 methods, declared across 23 files: SiliconedApp/AppState.swift (32), SiliconedApp/AppState\u002BRender.swift (30), SiliconedApp/AppState\u002BHistory.swift (27), SiliconedApp/AppState\u002BCatalog.swift (20), \u002B19 more file(s). The bar is 30 methods; this is 240 over it, 9.00\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/AppState.swift"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a218669cb3ec3140e2ae38bd6f56935b9c7179f26264549c5a797fd30dc123"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: SilicontrolHelp/RemoteControlHelp.swift: FileTooLong \u2014 2331 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1831 over it, 4.66\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SilicontrolHelp/RemoteControlHelp.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc104f977fc5bba8a94e2702433792422fc824875d6fcc048397c5482f66810"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RemoteControl: TooManyMethods \u2014 97 methods, declared across 9 files: SiliconedApp/RemoteControl\u002BGestures.swift (21), SiliconedApp/RemoteControl\u002BCommands.swift (18), SiliconedApp/RemoteControl.swift (16), SiliconedApp/RemoteControl\u002BWriter.swift (10), \u002B5 more file(s). The bar is 30 methods; this is 67 over it, 3.23\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl.swift"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cfb9d9401b872d28ec585f5b776fc553788d07f1b7af24d610921cd60b86310"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: QuantizedLayouts.recognize: MethodTooLong \u2014 recognize runs 194 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 94 over it, 1.94\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/Quantization.swift"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"def02e3a523eba88193054783b6bd31f20f54a4c9e86380b6e1d25ad8b4fbc00"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ForgeLoRA.forging: MethodTooLong \u2014 forging runs 189 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 89 over it, 1.89\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/ForgeLoRA.swift"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a15e2f5e578d8f89749014064e6d852faa7ced9c6ace1c4d841f59a5bbcfdf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RemoteControl.add: MethodTooLong \u2014 add runs 183 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 83 over it, 1.83\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl\u002BAdd.swift"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a51ff2156a25c9f9956e85e4c57e8daa4e67392a3e1926131d57ed3b9be6928"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Library: TooManyMethods \u2014 52 methods, declared across 8 files: Forge/Management.swift (23), Siliconed/LibraryPlace.swift (9), Siliconed/Library.swift (7), Siliconed/Catalog.swift (6), \u002B4 more file(s). The bar is 30 methods; this is 22 over it, 1.73\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Library.swift"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eac41041c4c60ebc7d20cf238cd6c9bcd7db9feedf768c9e710c11ebea511bf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.execute: MethodTooLong \u2014 execute runs 173 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 73 over it, 1.73\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/EngineRender.swift"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"1072bc1eec35c225710619d19a80821b98f5018ef68e25b9f6b1ffe4a3945700"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Artifact: TooManyMethods \u2014 50 methods, declared across 5 files: Siliconed/Artifact.swift (34), Siliconed/ArtifactStaging.swift (13), Siliconed/CapacityStream.swift (1), Siliconed/MemoryPlanSites.swift (1), \u002B1 more file(s). The bar is 30 methods; this is 20 over it, 1.67\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Artifact.swift"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"785cbe01aa8f50ff63ab4be2b6c1863e602e7d89930633c5e27ef26b2f90705f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LabModel: TooManyMethods \u2014 47 methods, declared across 2 files: SiliconedApp/Lab.swift (45), SiliconedApp/LabRemote.swift (2). The bar is 30 methods; this is 17 over it, 1.57\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/Lab.swift"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"2532c888413855099b420b371de880d9e799950ab06096a9cf977887ddc8f909"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Qwen3VLGenerator.generate: MethodTooLong \u2014 generate runs 156 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 56 over it, 1.56\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Qwen3VLGeneration.swift"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe55bb5f9ef2d8342110fa7bee160a4ebea789ca46117ef4c5aa72288a5b586"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NeuralEngine.run: MethodTooLong \u2014 run runs 151 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 51 over it, 1.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/NeuralEngine.swift"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"97feda185f78b1fc5cafdac40667012e03d3403e02542a84b7a4456642a85e87"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FlashMatrix.source: MethodTooLong \u2014 source runs 143 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/FlashMatrix.swift"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"188c549c5d0bb1d81fc065a556dedbc54c0b298f604bd09e030fa73abf7e6e66"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Siliconed/QwenImage21.swift: FileTooLong \u2014 703 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 203 over it, 1.41\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":"Sources/Siliconed/QwenImage21.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ffd818f148a7f91e97ea38c88e2730eb132895ee303e8639f4be45e10da4ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Siliconed/Krea2.swift: FileTooLong \u2014 675 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 175 over it, 1.35\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Krea2.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d05c1c96a1124532e22f5cf166ac53508e27e8b177fb9b73d1b6115b2cab9e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Problem.sentence: MethodTooLong \u2014 sentence runs 135 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/Problems.swift"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"03e13a1f7b76beecc56c8584c958506cbfcf1b43604f44d509836299acc86869"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: QwenImage21DiT: 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":"Sources/Siliconed/QwenImage21.swift"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"e929102bb5d9e41a7aa21bca92c33f42200865de14cc0c0d9d06a92fad01531a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MirrorServer: 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":"Sources/SiliconedApp/MirrorServer.swift"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a14cb1131a4744bb579c10a7b96fe15422ce18200508272004df389baa1d7b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GestureOrder.parse: MethodTooLong \u2014 parse runs 132 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/RemoteGestures.swift"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ec67f24d01f5cb98e37aede40cbe9dae2559bb02aad7f55a2ca2cf2519837a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WeightProducts.linear: MethodTooLong \u2014 linear runs 126 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/WeightProducts.swift"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"41507c616ccb3ee4b0db6969dc2b5c644ac516fa381ec0eef117161d85181535"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RemoteControl.addOnMirror: MethodTooLong \u2014 addOnMirror runs 125 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl\u002BMirror.swift"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"3577a24d91fcf31c822ebc1fa86c8b806d7fc5a1d933ba51af27febbd2901cce"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MirrorServer: ClassTooLong \u2014 492 significant lines (blank, comment-only and punctuation-only lines excluded), 40 methods. The bar is 400 significant lines; this is 92 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":"Sources/SiliconedApp/MirrorServer.swift"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"6706ea3890bd614c8dea35ab12b03bb59d40495e7ccb9639fa84b2bafe14d2db"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Context.attention: MethodTooLong \u2014 attention runs 123 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacityProbesSolos.swift"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dbad53df12f3d385377b4fc36ba87df119355b363577f4f7910a235db3ad847"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppState.receive: MethodTooLong \u2014 receive runs 122 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/AppState\u002BMirror.swift"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"102049bc9a68b1e8fdc0b692ffa40e050860fc5d0580a57bf67b31d30edfb796"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Siliconed/WeightProducts.swift: 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":"Sources/Siliconed/WeightProducts.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b9bde2aa58a3a675be2e65a16900b9ad3e8586c01b51d05ed830915d5eab787"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Siliconed/Artifact.swift: FileTooLong \u2014 595 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 95 over it, 1.19\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":"Sources/Siliconed/Artifact.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a163bcd2ca30afed2e3609dd61c856442467fa4cdd839bf54e5d10dd1a200b72"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Siliconed/Anima.swift: FileTooLong \u2014 594 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 94 over it, 1.19\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":"Sources/Siliconed/Anima.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ff96f6f26454132b8457f24ecc34429fff97b3545e7ada375d5eb85be6dad1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Siliconed/MossImage.swift: FileTooLong \u2014 590 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 90 over it, 1.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/MossImage.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a1d0e149dd36b8a8bb1f30a5fb81bc04e6099c5ff2480152203a48ea4b910a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Attention.init: MethodTooLong \u2014 init runs 115 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Attention.swift"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e800efda84b711801bfe81c46d0d586f65253458b11524a76a8f39ac323c9e4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DiT.forward: MethodTooLong \u2014 forward runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/DiT.swift"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7fc21235baccb9826b0ba723b3fb9e300722c34b795f269292434eaf595c00e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GGUF.parse: MethodTooLong \u2014 parse runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/GGUF.swift"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffbcbaa72ed21d614323ebccb941baa48a0284211ab475a51a64daaa8459afbd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppState.execute: MethodTooLong \u2014 execute runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/AppState\u002BRender.swift"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e933db155ba48a0d18eb4f2009873c3d3e12b5da6c45defedf4a76dbcb7213e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ProductSolver: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacitySolver.swift"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"a69634c4151d5b07f71e1c48f67dcd5ad18e149390912277a8cdde0f48dd74c0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Runner.run: MethodTooLong \u2014 run runs 109 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Measurement/Runner.swift"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc8c10dfa1c06c945fb171c570f2799ed7dacff5a58731409c72c3277523a49"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Diagnostic.measureWidening: MethodTooLong \u2014 measureWidening runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/DiagnosticWideningProbes.swift"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8bb7bf45c46378ac901bbf0d93bac730eebcf4e4c1f8787aaa81b51858c12f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Installer.install: MethodTooLong \u2014 install runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/Installation.swift"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a16a42100e19e08d1d94f450eb5109338813f78d5e94741c078f0268b977f8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EngineError.errorDescription: MethodTooLong \u2014 errorDescription runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Errors.swift"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d9c49aa4358ae3fa7434ece7d8431145d6c4c886bb4fe7d4cae50b057de434"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Problem.suggestion: MethodTooLong \u2014 suggestion runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/Problems.swift"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"1622193836badcd11d404c05f902fdb8db4b281013306b79a3d94b2bf85eab8f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: SiliconedApp/AppState\u002BRender.swift: FileTooLong \u2014 521 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 21 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/AppState\u002BRender.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29be4a9be6f9be3c6eea87f517d78cb4268722d14a18160db6481e7bbe568cf7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: KernelStages: ClassTooLong \u2014 416 significant lines (blank, comment-only and punctuation-only lines excluded), 0 methods. The bar is 400 significant lines; this is 16 over it, 1.04\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Verification/KernelStages.swift"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd998d2a4eb562467ac39141a37246957c91d1d1baf6a9b1d2206001510e3eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Siliconed/QwenImage21VAE.swift: FileTooLong \u2014 516 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 16 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/QwenImage21VAE.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60923d96d1e13dfbc2aaff33d4e44e186e654818cb334c85273e99eb91b1e800"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppCommands.body: MethodTooLong \u2014 body runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/App.swift"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dee0a6362faea86716291f9ce6cc7b82a3c727896681b9c162dcf166da0625e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Forge/Installation.swift: 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":"Sources/Siliconed/Forge/Installation.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"befbbe94fe036b0fb5c900e1c557fe13f7297b3658e45d110a0c91c9788b9369"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TiledAttention.fusedSource: MethodTooLong \u2014 fusedSource runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/TiledAttention.swift"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"3150743a4394927d307dfed7aeb8f962533db788a3ad6bd6caa64671edb46797"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HeadSplitAttention.init: MethodTooLong \u2014 init runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/HeadSplitAttention.swift"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"facf94a575109c4249eb484fb45d5bba1999589e2a3142628bacb020c812f338"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: SiliconedApp/App.swift: FileTooLong \u2014 504 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 4 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/App.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd13f5d595a61992c7a28087b6dfcdbf3ce864795082b248b06622b09ff5f390"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (23 shared lines): Sources/SiliconedApp/RemoteControl\u002BAdd.swift:381-476 | Sources/SiliconedApp/RemoteControl\u002BMirror.swift:257-333 \u2014 These two members are variants of one another: 23 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl\u002BAdd.swift"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad92b819392c7d1c2ece01785884c2f3949d41a194e10a509724add5c9ba43ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): Sources/Siliconed/DiagnosticProbes.swift:133-178 | Sources/Siliconed/TensorGEMMInt8.swift:198-221 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/DiagnosticProbes.swift"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7f485d8f5588ea8b383895387ba0fb4d18270879ff663a7dd1f452ae3a56a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): Sources/Siliconed/ModulesKrea2.swift:65-73 | Sources/Siliconed/ModulesQwenImage21.swift:83-91 \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":"Sources/Siliconed/ModulesKrea2.swift"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ad50a14ab71224b2ec48566907fdf925b8869001083386cc503f431b663393"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): Sources/Siliconed/TensorGEMMBF16.swift:144-154 | Sources/Siliconed/TensorGEMMKQuant.swift:145-153 \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":"Sources/Siliconed/TensorGEMMBF16.swift"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"535594920af19f24b3c473673b43c427195c644339ef7e504d86a7731b97fcad"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): Sources/Siliconed/AnimaGELU.swift:93-103 | Sources/Siliconed/ElementwiseGPUAnima.swift:191-207 | Sources/Siliconed/ElementwiseGPUMoss.swift:137-148 | Sources/Siliconed/ElementwiseGPUkrea2.swift:145-157 | Sources/Siliconed/ElementwiseGPUqwen.swift:153-163 | Sources/Siliconed/MossImage.swift:925-935 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/AnimaGELU.swift"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d35dda929800b8f019de115032747b2be791a2397c5132a38718d9d49ebfc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (54 corresponding lines): Sources/Siliconed/Krea2.swift:144-205 | Sources/Siliconed/MossImage.swift:145-198 \u2014 These two members are one piece of code written twice and then edited apart: 54 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":"Sources/Siliconed/Krea2.swift"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"af581203de8a75ceaaf63bc1e7308f80742d4487b39563aa7130f11fcc0a8f6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): Sources/Siliconed/ModulesKrea2.swift:86-128 | Sources/Siliconed/MossImageModules.swift:96-142 \u2014 These two members are one piece of code written twice and then edited apart: 43 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":"Sources/Siliconed/ModulesKrea2.swift"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"05dda7901f3e4772b7011330779faf472a251e323e9523542482193db090a65b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): Sources/Siliconed/GEMM.swift:448-477 | Sources/Siliconed/GEMM.swift:597-620 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/GEMM.swift"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"391a16734767d56c10a5a07ee31e9a1ec045c5e9bbe8b533e2cc35f276f8815c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): Sources/Siliconed/WeightProducts.swift:671-693 | Sources/Siliconed/WeightProducts.swift:717-737 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/WeightProducts.swift"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"30450b181790fd79b2a9db79b39d26a72a49f70a7747c0c163a0537aac702b6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): Sources/Siliconed/ElementwiseGPUMoss.swift:155-179 | Sources/Siliconed/ElementwiseGPUkrea2.swift:163-186 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/ElementwiseGPUMoss.swift"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f1dc4cf6f58b577b0b41bca16bf57a095142eab17d609093d84540f0be4c82"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): Sources/Siliconed/Krea2.swift:1060-1081 | Sources/Siliconed/QwenImage21.swift:914-935 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Krea2.swift"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"da72ee80bd16a45e8054ddea96bfaef0de989272cad958a6307696881045442d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): Sources/Siliconed/Widen.swift:220-244 | Sources/Siliconed/Widen.swift:247-271 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Widen.swift"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"74450bbd7130b23e899fbfeff3d5bb8388df3a3a8ae828ba569d79a5aaaf7aa6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): Sources/Verification/Judge.swift:60-85 | Sources/Verification/Measures.swift:54-73 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Verification/Judge.swift"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e5a84948c61f3933fa3ff91f1aa6b2904b5fe2418af8b630225d16315b0a4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): Sources/Siliconed/DiagnosticJudgement.swift:39-71 | Sources/Verification/Measures.swift:12-34 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/DiagnosticJudgement.swift"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"af7edd638be30d0496451ebe53e5bcfeaa41c694e4d7a764805645c4f357db5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): Sources/Siliconed/ElementwiseGPU.swift:365-382 | Sources/Siliconed/ElementwiseGPU.swift:404-418 \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":"Sources/Siliconed/ElementwiseGPU.swift"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdbe882091ada566087c1a7ea250b75e51eb158ba468e58fbae8807674bc66fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): Sources/Siliconed/MemoryNeedQwenImage21.swift:247-260 | Sources/Siliconed/MemoryNeedQwenImage21.swift:263-275 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/MemoryNeedQwenImage21.swift"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"328c5ade080efe974f7ed29886a971f20ae5188b3d1b5d7e3e4d347e06e119e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): Sources/Siliconed/Widen.swift:755-767 | Sources/Siliconed/Widen.swift:770-783 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Widen.swift"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42692865fae7adacc049a4de04d5ced69a23dc8496d6598aae14c80adcfeec8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): Sources/Siliconed/Tokenizer.swift:222-241 | Sources/Siliconed/Tokenizer.swift:526-540 \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":"Sources/Siliconed/Tokenizer.swift"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a63a5982e55a0add9556d8dc04b6a063f277dfc58fe0d039043ae10d5fabf80"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): Sources/Siliconed/Flux2VAE.swift:105-121 | Sources/Siliconed/Flux2VAE.swift:128-145 \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":"Sources/Siliconed/Flux2VAE.swift"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdbdca9a030b68b61d17bc5bdcebf51b4ed6c59139c6db26a1cd9b861948f721"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 7\u002B corresponding lines): Sources/Siliconed/MemoryNeedKrea2.swift:288-294 | Sources/Siliconed/MemoryNeedKrea2.swift:354-360 | Sources/Siliconed/MemoryNeedMossImage.swift:36-44 | Sources/Siliconed/Qwen3VLGeneration.swift:223-229 | Sources/Siliconed/Qwen3VLVision.swift:199-206 | Sources/Siliconed/TextEncoder.swift:231-237 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/MemoryNeedKrea2.swift"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c1fb40f485ad87ed04697b59ae75557cd648f9cfab82b9a6ab0de8e95c833d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): Sources/Siliconed/Anima.swift:903-924 | Sources/Siliconed/Ops.swift:225-242 \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":"Sources/Siliconed/Anima.swift"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97d8147ec3581237f151318f3306caf9677e588b59935b072fe1ccab2cc3bbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): Sources/Siliconed/Conductor.swift:239-252 | Sources/Siliconed/HeadSplitAttention.swift:564-580 \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":"Sources/Siliconed/Conductor.swift"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"de581432ff7b3ec3f00e6e4ad37a385eabe4ed90f7b7424ac0ccf7134b33f181"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): Sources/Siliconed/Krea2.swift:374-383 | Sources/Siliconed/MossImage.swift:374-386 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Krea2.swift"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"35cc990f4adcb1ac1548995353d3b5385f1115e34ccaa895685489b7e3b9ef7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): Sources/Siliconed/DecodeKernels.swift:526-537 | Sources/Siliconed/DecodeKernels.swift:567-577 \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":"Sources/Siliconed/DecodeKernels.swift"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"e80088d39af637181ba6946779f948685919ae5d022ceda9e1be7028ed71fc78"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): Sources/Siliconed/Conductor.swift:198-210 | Sources/Siliconed/Conductor.swift:216-228 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Conductor.swift"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"d723e44ba593ba9258ebc1280045a09a8d6c4dde9e6bf313cc2c27564916f756"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): Sources/Siliconed/AnimaVAE.swift:153-163 | Sources/Siliconed/QwenImage21VAE.swift:777-788 \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":"Sources/Siliconed/AnimaVAE.swift"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"508f6679ce28d4c03ff94fa8131e005573ce6bfdf3522c81853b3107f2add3d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): Sources/Siliconed/MemoryNeedKrea2.swift:331-340 | Sources/Siliconed/MemoryNeedMossImage.swift:79-88 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/MemoryNeedKrea2.swift"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"168ead60ab38f337acc8919bf0c4b42cea365e5a2d52b6e904063ab84d6833ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): Sources/Siliconed/MossImage.swift:828-846 | Sources/Siliconed/Ops.swift:160-177 | Sources/Siliconed/Qwen35.swift:238-255 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 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":"Sources/Siliconed/MossImage.swift"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"0550a28c626a448b889efe87cbdaa179e002652290cd0b0644fe3c2a544e54d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): Sources/Siliconed/QwenImage21VAE.swift:464-474 | Sources/Siliconed/QwenImage21VAE.swift:731-743 \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":"Sources/Siliconed/QwenImage21VAE.swift"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"c965a72086eb0e9b7ce6c62f93f2d74e7d5464d899a75243d5f1a766b13abc70"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): Sources/Siliconed/NeuralEngine.swift:612-621 | Sources/Siliconed/NeuralEngine.swift:624-633 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/NeuralEngine.swift"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d4e41300e94fa3adc663dba51f42fce0943601b61103bd7866d62edad1542e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): Sources/SiliconedApp/Rack.swift:121-131 | Sources/SiliconedApp/Rack.swift:135-143 \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":"Sources/SiliconedApp/Rack.swift"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"a502fd5f5cd1224acbdbe880a8d6aaa527a4484b71d3f45800a062d019d31a79"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): Sources/Siliconed/CapacityModel.swift:146-155 | Sources/Siliconed/CapacityModel.swift:216-226 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacityModel.swift"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"401908f44744bb18c5288ce35ce0f4c4d32a121d27a1795b5ac305c0e3ce026c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): Sources/Siliconed/Krea2.swift:66-79 | Sources/Siliconed/MossImage.swift:60-72 | Sources/Siliconed/QwenImage21.swift:66-78 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Krea2.swift"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"885217ba6478c79e628f8bb8f9172f58e16f109a661fdc2b9a2a2e3501add611"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): Sources/Siliconed/CapacityPlan.swift:246-262 | Sources/Siliconed/CapacityPlan.swift:267-283 \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":"Sources/Siliconed/CapacityPlan.swift"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94c6a121fa744f83ea3064948da4b3fe3815a279e14fa56234e1106a569495c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): Sources/Siliconed/CapacityFit.swift:755-764 | Sources/Siliconed/CapacityProbesConvolution.swift:126-134 \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":"Sources/Siliconed/CapacityFit.swift"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea7de7fd8ccf9acb84713071d75e1368b34a10ff835c165febb992365789b42"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): Sources/Siliconed/Ops.swift:16-31 | Sources/Siliconed/Qwen35.swift:339-353 \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":"Sources/Siliconed/Ops.swift"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"f025e19c75b6dc220131b2bb1dba081fcf835242d2c7174040b042aa102dbb69"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 16\u002B corresponding lines): Sources/Siliconed/Anima.swift:879-896 | Sources/Siliconed/Krea2.swift:911-926 | Sources/Siliconed/Krea2.swift:929-944 | Sources/Siliconed/Ops.swift:258-275 | Sources/Siliconed/Ops.swift:294-311 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Anima.swift"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5dc0cc5004de135880df790ffcc5fda8faf1cdbf6e5bb06b8e304b4998805ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): Sources/Siliconed/Modules.swift:83-91 | Sources/Siliconed/ModulesAnima.swift:81-88 | Sources/Siliconed/MossImageModules.swift:73-82 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 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":"Sources/Siliconed/Modules.swift"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7386fd630789aa2f218264688dba30928a6fb3099601ad0b88257e554c8452e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): Sources/Siliconed/Krea2.swift:866-871 | Sources/Siliconed/MossImage.swift:707-712 \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":"Sources/Siliconed/Krea2.swift"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"473afb77916929bb1677ff0e2a7c989dd31f47611ce8c8f0e0573415f0c4b76a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): Sources/Siliconed/Modules.swift:287-295 | Sources/Siliconed/Modules.swift:323-331 \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":"Sources/Siliconed/Modules.swift"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb7d64180996b6384506d7af3186e21d7873e4257ed89169477ff6745a7adaf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): Sources/Siliconed/CapacityClasses.swift:498-507 | Sources/Siliconed/CapacityClasses.swift:512-520 \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":"Sources/Siliconed/CapacityClasses.swift"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9de4006acce75411eac05ffa89cb49aec92386e8dfce08f73460cd008e3fe59"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): Sources/Siliconed/GEMM.swift:386-392 | Sources/Siliconed/GEMM.swift:396-404 \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":"Sources/Siliconed/GEMM.swift"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"16353d5383d9b316de5953710d2f53bb24bc74b0f5f25f3e656a96ec67a888c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): Sources/Verification/ResidualPermutation.swift:67-75 | Sources/Verification/ResidualPermutation.swift:79-87 \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":"Sources/Verification/ResidualPermutation.swift"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad0b79e10b8fbba9b5f3310065d712fbbea7847ee0749d2db40b5438e53a038"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): Sources/Siliconed/DecodeKernels.swift:472-482 | Sources/Siliconed/DecodeKernels.swift:485-492 | Sources/Siliconed/DecodeKernels.swift:514-521 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 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":"Sources/Siliconed/DecodeKernels.swift"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca1120bd6982633330694a55f37ae6ba8a749a7146a3714f5059cec94e8fdf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): Sources/Siliconed/Ops.swift:82-94 | Sources/Siliconed/Ops.swift:244-253 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Ops.swift"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"313b1bb163b97623d7be3f1a33ff3a2153d278b91dd301bea7496f69fcd86d21"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): Sources/SiliconedApp/Curtain.swift:318-326 | Sources/SiliconedApp/SceneView.swift:290-298 \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":"Sources/SiliconedApp/Curtain.swift"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc8030e2e50470058ed308488e3756670a3b97e10093ffebe7a6a47568448d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): Sources/SiliconedApp/Palette.swift:92-99 | Sources/SiliconedApp/Subjects.swift:277-282 \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":"Sources/SiliconedApp/Palette.swift"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"a807c7750621eef1086d0840e85eef29a2c831d68f41482fb72db7e5d1fa1efe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): Sources/Siliconed/Widen.swift:726-731 | Sources/Siliconed/Widen.swift:734-740 \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":"Sources/Siliconed/Widen.swift"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aed3771578c0d59b13d29e72ecba6be56e9649a9e7cb15cdb26387494a7b5a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): Sources/Siliconed/ElementwiseGPU.swift:421-427 | Sources/Siliconed/ElementwiseGPU.swift:473-480 \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":"Sources/Siliconed/ElementwiseGPU.swift"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1bcb3fbd97a0fd5225a90824fd105c52691805499cca2af11197470036800af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): Sources/Verification/ResidualPermutation.swift:301-308 | Sources/Verification/ResidualPermutation.swift:310-317 \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":"Sources/Verification/ResidualPermutation.swift"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf6abd59a8c1428e7cf951df926033b124ba4c9a0fd83bb824e15df710a8242"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): Sources/Siliconed/Flux2VAE.swift:218-224 | Sources/Siliconed/VAE.swift:201-207 | Sources/Siliconed/VAEEncoder.swift:394-399 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Flux2VAE.swift"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"7931e477f3a78fe9cbc9c35672d0209462c415bab5e47c34358f6c0957058cc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): Sources/Siliconed/Conductor.swift:232-237 | Sources/Siliconed/Conductor.swift:259-264 \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":"Sources/Siliconed/Conductor.swift"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"12572015df85cd557cde3dc642146437d3845ffcf23519c14158b19d546d0d65"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): Sources/Siliconed/GEMM.swift:375-381 | Sources/Siliconed/GEMM.swift:408-416 \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":"Sources/Siliconed/GEMM.swift"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a1105def20f703a64f1b5e309b1071501aa6a22c83f215f1c01d6b1a6bf8c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): Sources/SiliconedApp/CropEditor.swift:266-270 | Sources/SiliconedApp/SubjectSheet.swift:325-329 \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":"Sources/SiliconedApp/CropEditor.swift"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1f8ab981bde8b75704c65ded58bee6f8694aef1e5476485ca48b45c91c07e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): Sources/Siliconed/Krea2.swift:1105-1116 | Sources/Siliconed/QwenImage21.swift:940-951 \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":"Sources/Siliconed/Krea2.swift"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"200e8c7d8abb5c6a64e0d69245b0e3654bfca3c50c02d4c8ad65b1eaa04473ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): Sources/Siliconed/QwenImage21VAE.swift:267-272 | Sources/Siliconed/QwenImage21VAE.swift:275-279 \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":"Sources/Siliconed/QwenImage21VAE.swift"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"97aa6c5f1fe680a63be87d70ed67a49674b7c89daf8b1655ea02bff6623496a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): Sources/Siliconed/NeuralEngine.swift:269-274 | Sources/Siliconed/NeuralEngine.swift:277-282 \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":"Sources/Siliconed/NeuralEngine.swift"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"98115633ff567419d43dd5c9b70c0c765649db84fd021bc28525f39bf70c2ef9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): Sources/SiliconedApp/Lab.swift:589-601 | Sources/SiliconedApp/SubjectSheet.swift:171-183 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/Lab.swift"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be46f61a9dd3aab210e440e7f50fdd1a349f28410a9e4471d6e02ec1d6f89d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): Sources/SiliconedApp/AppState\u002BReferences.swift:17-24 | Sources/SiliconedApp/AppState\u002BStart.swift:115-122 \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":"Sources/SiliconedApp/AppState\u002BReferences.swift"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5bfca5e08b514f32d7fc38d569151bf514a9d568cfeff2eeee6c838ffefecee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): Sources/Siliconed/Detail.swift:176-182 | Sources/Siliconed/Sampler.swift:244-250 \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":"Sources/Siliconed/Detail.swift"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c950b01cc2f04c9a412d8fe201c731c2c93a461b56bee3e4016c1af59034864"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): Sources/Siliconed/ElementwiseGPUqwen.swift:167-175 | Sources/Siliconed/QKNormRope.swift:156-164 \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":"Sources/Siliconed/ElementwiseGPUqwen.swift"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"205d2151dfeb432f2bce7e2b70a6d01e06b84427ebb4a053b6805e83d7831735"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): Sources/SiliconedApp/Curtain.swift:330-339 | Sources/SiliconedApp/SceneView.swift:82-90 \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":"Sources/SiliconedApp/Curtain.swift"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fefd0db8df00cbac34bdc4040c768d0613682f486a1b02a74b4eff863b1bd27"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): Sources/Siliconed/DiagnosticProbes.swift:82-84 | Sources/Siliconed/DiagnosticProbes.swift:89-94 \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":"Sources/Siliconed/DiagnosticProbes.swift"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a9a2650679feb909f160526e8d244c824569c1a0f127e682f14159a4e2d86e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): Sources/Siliconed/Flux2VAE.swift:149-156 | Sources/Siliconed/QwenImage21VAE.swift:181-189 | Sources/Siliconed/QwenImage21VAE.swift:192-201 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 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":"Sources/Siliconed/Flux2VAE.swift"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a2cc73fc62d3903d7e069adcaad4daa70456ff623c757f9d373ce55369642e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): Sources/Siliconed/Qwen3VLImages.swift:332-339 | Sources/Siliconed/Qwen3VLImages.swift:341-349 \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":"Sources/Siliconed/Qwen3VLImages.swift"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c3a00c10532b330d5c0ea00191fa26348cfc320a3019e67f041fe37cbda922"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): Sources/Measurement/Probes.swift:107-113 | Sources/Siliconed/DiagnosticMachine.swift:136-142 \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":"Sources/Measurement/Probes.swift"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c93e6047f306be3c1fa2d85b9814ac0f860df5ed363f2cbb03e16bc980b83c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): Sources/Siliconed/Remote/Installing.swift:250-259 | Sources/SiliconedApp/MirrorLibrary.swift:177-185 \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":"Sources/Siliconed/Remote/Installing.swift"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d1e4ec58dcaf4db913244020f171522efa6020db74f59fec519634e0996b29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): Sources/Siliconed/Widen.swift:25-31 | Sources/Siliconed/Widen.swift:54-60 \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":"Sources/Siliconed/Widen.swift"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd6b4c378924160ac63a52ea7d4d17ec70baa5ac8fd751fb4c6a7e005ade9085"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): Sources/Siliconed/Forge/ForgeQwen35.swift:109-113 | Sources/Siliconed/Forge/ForgeText.swift:64-68 \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":"Sources/Siliconed/Forge/ForgeQwen35.swift"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"774f5b3a71861f1f06919dc922df1f9a6ae036ff928a036417ef474f1f258d3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 6\u002B corresponding lines): Sources/Siliconed/Modules.swift:153-158 | Sources/Siliconed/ModulesAnima.swift:179-184 | Sources/Siliconed/MossImageModules.swift:165-171 | Sources/Siliconed/QwenImage21VAE.swift:848-854 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Modules.swift"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"522ce057c5117c341996ed8627995fed4e4aec382b55eff8fb7c3c986c3a3bee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): Sources/Siliconed/Ops.swift:34-42 | Sources/Siliconed/Ops.swift:401-407 \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":"Sources/Siliconed/Ops.swift"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"047938f34d3fda8d601652abd250c0b9436b4285dba4bf10172cdff94b2d7ccb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): Sources/Siliconed/ProductLedger.swift:156-163 | Sources/Siliconed/ProductLedger.swift:166-172 \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":"Sources/Siliconed/ProductLedger.swift"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"2782c98dda544f692c4ecd06bc4321fa33db74060a2e4ce2ebbc27bf4315cb76"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): Sources/Siliconed/MemoryNeedPromptWriter.swift:243-250 | Sources/Siliconed/MemoryNeedPromptWriter.swift:253-257 \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":"Sources/Siliconed/MemoryNeedPromptWriter.swift"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"3785b7fa2863a15fad761a6d5c73e0ea0c5afbddd2ff5e27b07c6b755cd778ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): Sources/Siliconed/Qwen3VLGeneration.swift:609-614 | Sources/Siliconed/Qwen3VLImages.swift:122-127 \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":"Sources/Siliconed/Qwen3VLGeneration.swift"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"70ebbc87985a33407bcd407b924f31d2322b675eac719b66b6f51fe0115f340a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): Sources/SiliconedApp/AppState\u002BMirror.swift:518-524 | Sources/SiliconedApp/AppState\u002BMirror.swift:526-532 \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":"Sources/SiliconedApp/AppState\u002BMirror.swift"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"a020912e552bd18935aa37a165fb79378934a182d70a55120b585e34e0a3b3f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): Sources/Measurement/Probes.swift:96-105 | Sources/Siliconed/Arena.swift:198-207 | Sources/Siliconed/VAEMemory.swift:570-579 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Measurement/Probes.swift"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5cacb5467e6193826529ccc8ee59f48cc5f04a6e744caaaf08d7afe6a8acf4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): Sources/Siliconed/MemoryNeedKrea2.swift:316-320 | Sources/Siliconed/MemoryNeedMossImage.swift:63-67 \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":"Sources/Siliconed/MemoryNeedKrea2.swift"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"e37ca2c428bb6c3a8fd4afb8372900a5bb7c1594d551b76b19d4dcbcc345801f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): Sources/Siliconed/QwenImage21VAE.swift:172-177 | Sources/Verification/QwenImageStages.swift:348-353 | Sources/Verification/QwenImageStages.swift:355-360 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/QwenImage21VAE.swift"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f9cc9756e97c1d26c6dcb2e2f8d43fd6b12140426de80e19e4e069e8128437"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): Sources/SiliconedApp/AppState\u002BPlace.swift:119-129 | Sources/SiliconedApp/AppState\u002BPlace.swift:157-166 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/AppState\u002BPlace.swift"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cac304fc7f4c9d92917f7705b2583934980421f48144ac5b05c17660ff6b161"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): Sources/SiliconedApp/AppState\u002BReferences.swift:26-31 | Sources/SiliconedApp/AppState\u002BStart.swift:108-112 \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":"Sources/SiliconedApp/AppState\u002BReferences.swift"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"e849162ad19315bfbc5abc48802b8ea0be74b3fffd693c21e4d4afd62208f021"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): Sources/Siliconed/QwenImage21VAE.swift:498-503 | Sources/Siliconed/VAE.swift:191-196 \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":"Sources/Siliconed/QwenImage21VAE.swift"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"83109fb261d3fc532be994c7d5c1aeb1da8a2269996f15d4d816ae80ef45d4d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): Sources/SiliconedApp/Curtain.swift:342-345 | Sources/SiliconedApp/SceneView.swift:93-97 \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":"Sources/SiliconedApp/Curtain.swift"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c79e423795b189859490c13ec38624d46b0cc382cc550434d6479f26a66a0e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): Sources/Siliconed/AnimaEngine.swift:17-23 | Sources/Siliconed/Krea2Engine.swift:62-68 \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":"Sources/Siliconed/AnimaEngine.swift"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f3aa242f6de7140051e80ebf9c51288c2497161ba1750e78686d687a6bc3b17"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): Sources/Siliconed/Block.swift:161-166 | Sources/Siliconed/Ops.swift:448-451 | Sources/Siliconed/Qwen3VLGeneration.swift:458-461 \u2014 These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Block.swift"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe65ff7eb5853fa144c37d397b7c0faefc5e4e0c5a8b9c846f2e02b508362c56"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): Sources/Siliconed/Widen.swift:710-715 | Sources/Siliconed/Widen.swift:718-723 \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":"Sources/Siliconed/Widen.swift"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc2812cb32a8b1f01868fb0cac68d24bc4f76afdd5298cf92b08be3d2995abd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): Sources/Siliconed/AnimaVAE.swift:147-151 | Sources/Siliconed/QwenImage21VAE.swift:511-519 | Sources/Siliconed/QwenImage21VAE.swift:771-775 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/AnimaVAE.swift"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"b14596141c1e2ecf04bd2f1d16251065709e7a210c2711cb0f89f4f3899e47ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): Sources/Siliconed/Krea2.swift:119-122 | Sources/Siliconed/MossImage.swift:121-124 | Sources/Siliconed/QwenImage21.swift:1012-1015 \u2014 These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Krea2.swift"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"673eb032031110966bbb941106ba74e63e5b017d02b65c1927ef8daea03eca24"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 4\u002B corresponding lines): Sources/Siliconed/Anima.swift:518-522 | Sources/Siliconed/Krea2.swift:635-639 | Sources/Siliconed/MossImage.swift:590-593 | Sources/Siliconed/MossImage.swift:654-658 | Sources/Siliconed/QwenImage21.swift:994-1001 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Anima.swift"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5126a5f005f84e0035680dc6753a7f509f0fb161515d9be4c3cff19efe2f5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): Sources/Siliconed/RenderCache.swift:124-132 | Sources/Siliconed/RenderCache.swift:135-141 \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":"Sources/Siliconed/RenderCache.swift"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6961be82b6aba633ef58f4836475a868abb525e3cc57cbf167c36ab6cccb02e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): Sources/Siliconed/CapacityPlan.swift:670-675 | Sources/Siliconed/MemoryNeed.swift:537-541 \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":"Sources/Siliconed/CapacityPlan.swift"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a026c0b9eaab444ed3511aec5f4ef6546e4aa952f9e78ca2def5cea0756dbb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): Sources/Siliconed/EngineRender.swift:24-31 | Sources/Siliconed/EngineRender.swift:34-38 \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":"Sources/Siliconed/EngineRender.swift"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d7b15f234f697f6a3e02946f09a4ca23d00d6e4226018a6463085bb861d3440"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): Sources/Siliconed/QwenImage21VAE.swift:156-159 | Sources/Siliconed/QwenImage21VAE.swift:162-166 \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":"Sources/Siliconed/QwenImage21VAE.swift"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4b8789695dbe8d385904008c95062c3367f187307b8d602ac4dd0d3fa495727"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): Sources/Measurement/Series.swift:153-157 | Sources/Siliconed/CapacityFit.swift:47-51 \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":"Sources/Measurement/Series.swift"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"360f27b5ac92d1a9ad2d935fbba1c58134c61939ec4cc0780a26d949540c06d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): Sources/Siliconed/Anima.swift:1022-1028 | Sources/Siliconed/MemoryNeedKrea2.swift:297-300 | Sources/Siliconed/MemoryNeedMossImage.swift:47-50 \u2014 These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Anima.swift"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f61eabbfbc649d0b0cba33a1dba8d5094f6e574b44f7dab6d872de306533a70"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): Sources/Siliconed/Safetensors.swift:235-239 | Sources/Siliconed/Safetensors.swift:243-246 \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":"Sources/Siliconed/Safetensors.swift"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ae3943425f5abf49926ebba6777e94170b8fa37c651467c56e964f16ff4eeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): Sources/SiliconedApp/RemoteControlSocket.swift:226-230 | Sources/Silicontrol/main.swift: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":"Sources/SiliconedApp/RemoteControlSocket.swift"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a9f7233c15fefd08d4108a19fde007ebfe1ba59c385fc9b65c1615313acae7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): Sources/Siliconed/Krea2.swift:641-644 | Sources/Siliconed/MossImage.swift:660-663 \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":"Sources/Siliconed/Krea2.swift"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce1128df87e287a659ed961bb19afa963751dbe70dc386c28a5ad7c533b4e630"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): Sources/Siliconed/Remote/Host.swift:250-257 | Sources/Siliconed/Remote/Host.swift:259-265 \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":"Sources/Siliconed/Remote/Host.swift"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"35139197a4822601d33a868945b38adf35c3bb973e2a93db39d1ae106b38d16d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): Sources/SiliconedApp/AppModels.swift:495-499 | Sources/SiliconedApp/RackMiniChain.swift:80-84 \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":"Sources/SiliconedApp/AppModels.swift"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d8335f50490a2ed2b21e6d9574dc893d3ccce035e9bd68ca3d5b94bb71d606"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): Sources/Siliconed/Flux2VAE.swift:211-214 | Sources/Siliconed/VAEEncoder.swift:387-389 \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":"Sources/Siliconed/Flux2VAE.swift"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb5819bf845abb6f91bf0b0b207b604b8c527f373b206f8015ecdca9d192458a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): Sources/Siliconed/CapacityModel.swift:101-107 | Sources/Siliconed/MatmulTile.swift:54-60 | Sources/Siliconed/TiledAttention.swift:633-637 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacityModel.swift"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6853282fa08db2b9643964843ed6d2d0a34f26f4070633d63b231c79838e347"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): Sources/Siliconed/Instrumentation.swift:28-33 | Sources/Siliconed/NeuralEngine.swift:115-119 | Sources/Siliconed/WeightProducts.swift:123-128 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Instrumentation.swift"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32ab72e30fe10fa676283bd65626a50b3108689a4f4257c2730aea24b63416e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): Sources/Siliconed/PhaseBoundary.swift:160-173 | Sources/Siliconed/DiagnosticJudgement.swift:112-124 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/PhaseBoundary.swift"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"d647dc949c661b21624139da3ab89f725a2214e20b8ea5e1b3ae6014018183c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): Sources/Siliconed/Prefetcher.swift:492-494 | Sources/Siliconed/Prefetcher.swift:495-500 \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":"Sources/Siliconed/Prefetcher.swift"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"3248ae26f682024c126130acc4d083361f8b14010639823d69e31863e88310f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): Sources/Siliconed/CapacityClasses.swift:308-314 | Sources/Siliconed/CapacityClasses.swift:317-324 \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":"Sources/Siliconed/CapacityClasses.swift"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"6691ee7854251e75ca94e0592db2a5b1aa175b9a244c053803ea78a9aa3b6c8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): Sources/Siliconed/Qwen35.swift:367-369 | Sources/Siliconed/TextEncoder.swift:341-343 \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":"Sources/Siliconed/Qwen35.swift"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea8ff5f94df6c32914f4dd88f031467c51cab5a54ac75ff8383908321d68373"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): Sources/Siliconed/Qwen35.swift:371-373 | Sources/Siliconed/TextEncoder.swift:352-354 \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":"Sources/Siliconed/Qwen35.swift"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6717e0100ea771a45de1cfb15e8a7c4cc7e96309d6bb1abff8ae53f07cdea2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): Sources/Siliconed/QwenImage21.swift:427-430 | Sources/Siliconed/QwenImage21.swift:434-438 \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":"Sources/Siliconed/QwenImage21.swift"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a9e76370f66a3bd5a522777b071737ebc2b31bb5ef1fa905fe9145f2311eb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): Sources/Siliconed/Remote/Pairings.swift:48-51 | Sources/Siliconed/Remote/Pairings.swift:54-57 \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":"Sources/Siliconed/Remote/Pairings.swift"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5afecaf13be1d6e88ef7e4d6a38dae19e5d1046305421495993e3f5a66bae8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): Sources/Siliconed/DiT.swift:473-476 | Sources/Siliconed/MemoryNeedKrea2.swift:363-365 \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":"Sources/Siliconed/DiT.swift"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a7446af0ee5307d9d1a27e8c3a797c08d75404a4387c85912383b26b8c8fae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): Sources/SiliconedApp/MirrorServer.swift:646-652 | Sources/SiliconedApp/MirrorLibrary.swift:287-293 \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":"Sources/SiliconedApp/MirrorServer.swift"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"445998447cb8bbafd108b4ef38eebadc6012bb4c524594c8f1ccbe8e594f3690"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): Sources/Siliconed/DiT.swift:528-530 | Sources/Siliconed/MemoryNeedKrea2.swift:304-306 | Sources/Siliconed/MemoryNeedMossImage.swift:53-55 \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":"Sources/Siliconed/DiT.swift"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"440ff6dd375adce405c18ff4262e42e48b3c30c235ae8c3a6871dff35cf522f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): Sources/SiliconedApp/MirrorLibrary.swift:270-276 | Sources/SiliconedApp/MirrorServer.swift:586-592 \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":"Sources/SiliconedApp/MirrorLibrary.swift"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb01f39bc8706f8faae0842b9c8bd87fdfe2a7d9c972faa394391928ec9bc794"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 4\u002B corresponding lines): Sources/Siliconed/Instrumentation.swift:15-18 | Sources/Siliconed/Qwen35.swift:357-360 | Sources/Siliconed/Qwen3VLVision.swift:208-211 | Sources/Siliconed/TextEncoder.swift:327-330 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Instrumentation.swift"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"9269d184c1906abefb4be1cfa395176a1b308b7a12f2934ffeb765b282e74c92"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): Sources/Siliconed/MossImage.swift:867-869 | Sources/Siliconed/QwenImage21.swift:891-893 \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":"Sources/Siliconed/MossImage.swift"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eada211e30ba007a57948d15c5752ba08050c862c5acbd9d1d386cf176cd4b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): Sources/Siliconed/Qwen35.swift:194-196 | Sources/Siliconed/TextEncoder.swift:218-220 \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":"Sources/Siliconed/Qwen35.swift"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"c758acbb8f3dd18a6d7cd235271b836f40695ceee9134759fc43408c39cfbb04"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): Sources/Siliconed/Block.swift:27-29 | Sources/Siliconed/Crop.swift:29-31 \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":"Sources/Siliconed/Block.swift"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51750af381405b3c81b055de48b0275522198a21e6ce217852ac617e8868610"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 3\u002B corresponding lines): Sources/Siliconed/DiT.swift:374-376 | Sources/Siliconed/Qwen35.swift:362-364 | Sources/Siliconed/Qwen3VLVision.swift:213-215 | Sources/Siliconed/TextEncoder.swift:332-334 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/DiT.swift"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa3f625d2ae5ddcd15a3ede4711225b91ded7a9287c6e44c9d13781306d34f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): Sources/Siliconed/Modules.swift:168-170 | Sources/Siliconed/ModulesAnima.swift:168-170 | Sources/Siliconed/MossImageModules.swift:154-156 \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":"Sources/Siliconed/Modules.swift"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"6652af43bfef27fe03717bb86e755ff99a62d7b282e4aa3ae53d71cd49ef9332"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): Sources/SiliconedApp/AppModels.swift:216-219 | Sources/SiliconedApp/AppState\u002BMirror.swift:478-481 | Sources/SiliconedApp/Subjects.swift:210-213 \u2014 These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/AppModels.swift"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d5d287e42a0faf7d33424275009a1db8b30c64eb06e7b8fb8f00badc8d8994"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): Sources/SiliconedApp/AppModels.swift:216-219 | Sources/SiliconedApp/Subjects.swift:210-213 \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":"Sources/SiliconedApp/AppModels.swift"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd711afe25ca311200e731b6aec1591ddac5207325e5c0f1cf73bdfc97e34ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): Sources/Siliconed/Anima.swift:967-969 | Sources/Siliconed/DiT.swift:420-422 \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":"Sources/Siliconed/Anima.swift"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"01824b31a19f63de77fafd31f7b14b7bc9180bfb0d52f1d02d122415a86eebda"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): Sources/Siliconed/Arena.swift:174-177 | Sources/Siliconed/Safetensors.swift:162-165 \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":"Sources/Siliconed/Arena.swift"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa480eddfd6cd7a73d9d3c090fc51d543c843f8a74b828ceb22ce683427c448"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): Sources/Siliconed/Qwen3VLGeneration.swift:245-247 | Sources/Siliconed/QwenImage21.swift:202-204 \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":"Sources/Siliconed/Qwen3VLGeneration.swift"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"77826a4cdd7ad3e4fba761e7e9091f4af806874cab3b2dcfbe61481d9dfae1d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): Sources/Siliconed/CapacityModel.swift:60-60 | Sources/Siliconed/ProductLedger.swift:62-62 \u2014 These two members are one piece of code written twice and then edited apart: 1 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":"Sources/Siliconed/CapacityModel.swift"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90a5be9bbcf9195b9b2f73dc87bcfc003c5c37e824b16b9d3cb3a814dd21cc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): Sources/Siliconed/CapacityClasses.swift:193-193 | Sources/Siliconed/RemoteGestures.swift:16-16 \u2014 These two members are one piece of code written twice and then edited apart: 1 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":"Sources/Siliconed/CapacityClasses.swift"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a6b32bfd221d14270ac9500df8a1ea45e862509b13dbab877c75e6f67c3504"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): Sources/Siliconed/MossImage.swift:776-778 | Sources/Siliconed/QwenImage21Pipeline.swift:136-136 \u2014 These two members are one piece of code written twice and then edited apart: 1 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":"Sources/Siliconed/MossImage.swift"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c1df387b0ad5bb73af77d96e264e05e4c2d1de5e0126184b6b700cc8c57db2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): Sources/Siliconed/Flux2VAE.swift:187-198 | Sources/Siliconed/VAE.swift:171-181 \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 \u0060Sources/Siliconed/Flux2VAE.swift:187\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060bands\u0060 to \u0060VAE.Bands\u0060 in one and \u0060Bands\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Flux2VAE.swift"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"9786cb2ce8354635cb0cb9d5d9d48ef23edf693f73c4674b05fb19230c6a5aab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): Sources/SiliconedApp/RemoteControl\u002BAdd.swift:407-418 | Sources/SiliconedApp/RemoteControl\u002BMirror.swift:278-287 \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 \u0060Sources/SiliconedApp/RemoteControl\u002BAdd.swift:407\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":"Sources/SiliconedApp/RemoteControl\u002BAdd.swift"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be6704dca86d135367cf8927e299693a0a7b510367d40bdb42bb21e58f0c2d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): Sources/Siliconed/Krea2.swift:1063-1081 | Sources/Siliconed/QwenImage21.swift:917-935 \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 \u0060Sources/Siliconed/Krea2.swift:1063\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Krea2.swift"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"892bd71a362c90653a3c67808b0ca6a7097108151fafb72a4faa857b2d311408"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): Sources/SiliconedApp/RemoteControl\u002BAdd.swift:165-174 | Sources/SiliconedApp/RemoteControl\u002BMirror.swift:101-108 \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":"Sources/SiliconedApp/RemoteControl\u002BAdd.swift"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7dc73c317bc246c3a1a04064e2d0f1ef5a0b94263552c1f110143a2ba9dc717"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Sources/Siliconed/Anima.swift:910-918 | Sources/Siliconed/Ops.swift:228-236 \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 \u0060Sources/Siliconed/Anima.swift:910\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Anima.swift"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"c54bf7688bbd57e7ebaadc1139e74be213c1ef21aa1758e7c063f92c6ad74892"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Sources/Siliconed/Krea2.swift:982-990 | Sources/Siliconed/Qwen3VLGeneration.swift:532-540 \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":"Sources/Siliconed/Krea2.swift"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd16c15b6b12e6d4acbe981c74337aed624f8a4c88c11e5162d82051a2b85a17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Sources/Siliconed/Ops.swift:259-267 | Sources/Siliconed/Ops.swift:295-303 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/Siliconed/Ops.swift:259\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Ops.swift"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7cad7756c60faf8dfc6217b25be47abc08631ea5cc34e7d28ff1e52e795c56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Sources/SiliconedApp/RemoteControl\u002BAdd.swift:14-22 | Sources/SiliconedApp/RemoteControl\u002BCommands.swift:177-185 \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 \u0060Sources/SiliconedApp/RemoteControl\u002BAdd.swift:14\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl\u002BAdd.swift"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"7298aa7917224142c5fd2f95b298b448a47a8ca01fd7da9d9dc4a21bb717453b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): Sources/SiliconedApp/RemoteControl\u002BAdd.swift:126-135 | Sources/SiliconedApp/RemoteControl\u002BMirror.swift:85-94 \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":"Sources/SiliconedApp/RemoteControl\u002BAdd.swift"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee3473cb022767bd9172ac4c4151af77e7674bdffad0dbb5a821639d8b5f52d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 3): Sources/Siliconed/Anima.swift:251-256 | Sources/Siliconed/DiT.swift:320-327 | Sources/Siliconed/Krea2.swift:310-315 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/Siliconed/Anima.swift:251\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Anima.swift"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf27fa61fd96c6b59297fe4cd659854c97229d9f8aa111ea2fbad73e98ec8306"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Sources/Siliconed/DiagnosticJudgement.swift:64-71 | Sources/Verification/Measures.swift:27-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 \u0060Sources/Siliconed/DiagnosticJudgement.swift:64\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/DiagnosticJudgement.swift"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e9b7ea7ad792ed5597c5c2f4e612da300f00d9117678121652d03ef2a076c81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Sources/Siliconed/Krea2.swift:912-919 | Sources/Siliconed/Krea2.swift:930-937 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/Siliconed/Krea2.swift:912\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Krea2.swift"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d7a79e13bf0f171d671cf08111c565ae62c830d77b406cf916d7f3ee7773835"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): Sources/Siliconed/Ops.swift:140-149 | Sources/Siliconed/Ops.swift:168-177 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/Siliconed/Ops.swift:140\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Ops.swift"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"442e960cf237327a690382038e9499212a146caef4f9dd9e9202fb2827e90e7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Sources/SiliconedApp/LabView.swift:359-366 | Sources/SiliconedApp/PromptField.swift:73-80 \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":"Sources/SiliconedApp/LabView.swift"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"816e07fc460519dc1187a2de45504f776346e7f2026fa467f56f603d4e2e8c93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): Sources/SiliconedApp/RemoteControl\u002BAdd.swift:385-392 | Sources/SiliconedApp/RemoteControl\u002BMirror.swift:261-266 \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 \u0060Sources/SiliconedApp/RemoteControl\u002BAdd.swift:385\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl\u002BAdd.swift"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c5fbf7178899a66e9397d9dce691daa22d348d4369f81f09f2654abba970a3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Sources/SiliconedApp/RemoteControl\u002BCommands.swift:417-424 | Sources/SiliconedApp/RemoteControl\u002BMirror.swift:395-402 \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":"Sources/SiliconedApp/RemoteControl\u002BCommands.swift"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc0c1220243c6b7cdc2d0abc57508aba8776f020f84c1d68056e350a715f7c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Sources/SiliconedApp/RemoteControl\u002BFollow.swift:20-27 | Sources/SiliconedApp/RemoteControl\u002BFollow.swift:137-145 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/SiliconedApp/RemoteControl\u002BFollow.swift:20\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The 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":"Sources/SiliconedApp/RemoteControl\u002BFollow.swift"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"becc140e3af0825c0ce0ba360708208652748883a4c9f059fc767c0fa94d3e2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Sources/SiliconedApp/RemoteControl\u002BLab.swift:83-90 | Sources/SiliconedApp/RemoteControl\u002BWriter.swift:23-30 \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":"Sources/SiliconedApp/RemoteControl\u002BLab.swift"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc41982eff8b631198283d948dc34ca344b120c34f76abe4013950baea0b7fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): Sources/Siliconed/Krea2.swift:151-157 | Sources/Siliconed/MossImage.swift:152-157 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/Siliconed/MossImage.swift:152\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":"Sources/Siliconed/Krea2.swift"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"f351751d9bb489db687b4d1d319b28b8cf0e39dae9049cf21ba659cce8d5dd3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Sources/Siliconed/Krea2.swift:660-668 | Sources/Siliconed/MossImage.swift:678-686 \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 \u0060Sources/Siliconed/Krea2.swift:660\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":"Sources/Siliconed/Krea2.swift"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd58a1b0fdf2b344e03928b1c145defe08aafd714c0e27275970c8f1faa154f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Sources/Siliconed/Ops.swift:85-92 | Sources/Siliconed/Ops.swift:245-252 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/Siliconed/Ops.swift:85\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Ops.swift"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ed0b3c402b6bcfe6572e3afa6d3e2062416fd33c499c9c566e5343f7412305"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Sources/Siliconed/QwenImage21Sampler.swift:163-169 | Sources/Siliconed/Sampler.swift:178-184 \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 \u0060Sources/Siliconed/QwenImage21Sampler.swift:163\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":"Sources/Siliconed/QwenImage21Sampler.swift"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"68747b618fd7f7a6e85894a3be711f13bdfe3f569fd88bd3d1bf0f7641830f23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20137 lines \u00D7 3): Sources/Siliconed/TensorGEMM.swift:354-355 | Sources/Siliconed/TensorGEMMBF16.swift:258-264 | Sources/Siliconed/TensorGEMMInt8.swift:274-280 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/Siliconed/TensorGEMM.swift:354\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060Sources/Siliconed/TensorGEMMBF16.swift:258\u0060 calls \u0060dispatchThreads\u0060, \u0060MTLSize\u0060 and \u0060Sources/Siliconed/TensorGEMM.swift:354\u0060 does not \u2014 after which the two agree again for 5 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/TensorGEMM.swift"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4db85fed2add1f8c34318c14e08b48c2031097f1a932d1253bdfb887a3c9c24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Sources/Siliconed/AnimaGELU.swift:95-103 | Sources/Siliconed/MossImage.swift:927-935 \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 \u0060Sources/Siliconed/AnimaGELU.swift:95\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/AnimaGELU.swift"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"b86959428c224a133094758e1b41a39632d5d746e9b0838a00635a40b4365ed4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Sources/Siliconed/Attention.swift:228-233 | Sources/Siliconed/HeadSplitAttention.swift:292-297 \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 \u0060Sources/Siliconed/Attention.swift:228\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Attention.swift"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a93bc2fe30d1f894f6b7bef6ccb02a1cc676ba2a6b16dda6b639ea0f7ed12ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20136 lines \u00D7 4): Sources/Siliconed/ElementwiseGPUAnima.swift:197-202 | Sources/Siliconed/ElementwiseGPUMoss.swift:142-144 | Sources/Siliconed/ElementwiseGPUkrea2.swift:151-156 | Sources/Siliconed/ElementwiseGPUqwen.swift:157-160 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060Sources/Siliconed/ElementwiseGPUAnima.swift:197\u0060 calls \u0060makeFunction\u0060 and \u0060Sources/Siliconed/ElementwiseGPUMoss.swift:142\u0060 does not \u2014 after which the two agree again for 5 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/ElementwiseGPUAnima.swift"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb4a6e1a74424de92c1f71db1cdfb43f8d05ff690d74fe15d9076bf0e69fb36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Sources/Siliconed/Flux2VAE.swift:109-114 | Sources/Siliconed/Flux2VAE.swift:133-138 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/Siliconed/Flux2VAE.swift:109\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Flux2VAE.swift"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"310ced4d0e30996b62361ea4a7e14392345fc87b331f4a2b61af7ac0531a18ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Sources/SiliconedApp/AppState\u002BReferences.swift:18-24 | Sources/SiliconedApp/AppState\u002BStart.swift:116-122 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/AppState\u002BReferences.swift"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"5433159682cb002b561cd88e1dfdb43a1ba11429084a10306bcb751f32b6bbe3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): Sources/SiliconedApp/RackDiT.swift:131-137 | Sources/SiliconedApp/RackDiT.swift:195-200 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/SiliconedApp/RackDiT.swift:131\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RackDiT.swift"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee2752f5192e1c0c85bbb9e08fea78ed5542e099eb2415879b79fc8331a7171"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 6): Sources/Siliconed/AnimaGELU.swift:93-97 | Sources/Siliconed/ElementwiseGPUAnima.swift:191-195 | Sources/Siliconed/ElementwiseGPUMoss.swift:137-141 | Sources/Siliconed/ElementwiseGPUkrea2.swift:145-149 | Sources/Siliconed/ElementwiseGPUqwen.swift:154-157 | Sources/Siliconed/MossImage.swift:925-929 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 6 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/Siliconed/AnimaGELU.swift:93\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060Sources/Siliconed/ElementwiseGPUAnima.swift:195\u0060 calls \u0060makeLibrary\u0060 and \u0060Sources/Siliconed/ElementwiseGPUqwen.swift:157\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/AnimaGELU.swift"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f48dbf72c364d3e4a6af67523c2296097c48b6cd3cbb1920ea6c03a3008ef4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20135 lines \u00D7 3): Sources/Siliconed/Anima.swift:334-338 | Sources/Siliconed/Anima.swift:351-355 | Sources/Siliconed/Anima.swift:360-361 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Anima.swift"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0aed0ae400616e335fb94540b7ac1eff578349a111c05a695bd1e10ab5ed90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Sources/Siliconed/Anima.swift:471-476 | Sources/Siliconed/Anima.swift:500-505 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Anima.swift"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"91142e7029a1a592caa2cee1bda52af639c29868dd7fc8e68d71a76af34aa823"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Sources/Siliconed/Arena.swift:199-205 | Sources/Siliconed/VAEMemory.swift:571-577 \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":"Sources/Siliconed/Arena.swift"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e8fbd28c4799c10f9be93782465762f0cf8eef7225dd7522fbdb57d152eb16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/Siliconed/CapacityPlan.swift:249-253 | Sources/Siliconed/CapacityPlan.swift:270-274 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/Siliconed/CapacityPlan.swift:249\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"Sources/Siliconed/CapacityPlan.swift"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f0e3d5d1846d8df74762eff9d8035ed674c9ab233bd64340d0d5f3c8dcd094"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/Siliconed/CapacityProbesSolos.swift:35-39 | Sources/Siliconed/CapacityProbesSolos.swift:181-185 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacityProbesSolos.swift"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"30164c7541c0477f0f18a8344d33e9c63348e8b5428ff5065a65d12594bbbe31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Sources/Siliconed/Detail.swift:177-182 | Sources/Siliconed/Sampler.swift:245-250 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Detail.swift"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"69130335894a7f304731d83a13de2e0c3c8979074765d79d6acefc5877ee0bad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/Siliconed/DiagnosticProbes.swift:150-154 | Sources/Siliconed/TensorGEMMInt8.swift:209-213 \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 \u0060Sources/Siliconed/DiagnosticProbes.swift:150\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":"Sources/Siliconed/DiagnosticProbes.swift"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e3488839edf503f425f6468c9426b398228438ac1e48b2ee2a04359670ba40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/Siliconed/MemoryNeedAnima.swift:153-157 | Sources/Siliconed/MemoryNeedKrea2.swift:187-191 \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 \u0060Sources/Siliconed/MemoryNeedAnima.swift:153\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060maps\u0060 to \u0060AnimaMaps\u0060 in one and \u0060Krea2Maps\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/MemoryNeedAnima.swift"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f47e7b94abc1c82c64f770b0d6809880fa08df1607c18819cf7eb373d13d29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/Siliconed/MemoryNeedKrea2.swift:336-340 | Sources/Siliconed/MemoryNeedMossImage.swift:84-88 \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 \u0060Sources/Siliconed/MemoryNeedKrea2.swift:336\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/MemoryNeedKrea2.swift"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"d08e206d11a373e6656cb772fb753cc374a0bfd687d9d5a4c49ba0489a73d25d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Sources/Siliconed/MossImage.swift:836-842 | Sources/Siliconed/Ops.swift:131-137 \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":"Sources/Siliconed/MossImage.swift"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad36a1190646c0924be8a4c1fc239a36f7f3474ff79ab1778b6bf4a9536dfc4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Sources/Siliconed/Qwen35.swift:468-473 | Sources/Siliconed/TextEncoder.swift:404-409 \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":"Sources/Siliconed/Qwen35.swift"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d182fc043a8db333517fe191e6ca794d9a193c40687d1da8f392572b8b3e971"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/Siliconed/Qwen35.swift:480-484 | Sources/Siliconed/TextEncoder.swift:420-425 \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 \u0060Sources/Siliconed/Qwen35.swift:480\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":"Sources/Siliconed/Qwen35.swift"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a9ac232842e7e1b95355152cfeb96492420ac3483cae5cc03873fe0b154c53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/Siliconed/Remote/Installing.swift:251-255 | Sources/SiliconedApp/MirrorLibrary.swift:178-182 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/Siliconed/Remote/Installing.swift:251\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Remote/Installing.swift"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0658647010e4498b0aa718a7523c258094ebe9971b4472c23e8324cf381969a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/Siliconed/WeightProducts.swift:679-683 | Sources/Siliconed/WeightProducts.swift:723-727 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/Siliconed/WeightProducts.swift:679\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/WeightProducts.swift"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"d278d6a5af32dbb069bf182b932febb79fe8202da1c2855d34f124fc20ce5bef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/Siliconed/Widen.swift:224-228 | Sources/Siliconed/Widen.swift:251-255 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/Siliconed/Widen.swift:224\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Widen.swift"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7361d66df6ac0320b414b22023e3c77b05a9d511303be7bc3e64fdebe6cbb52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Sources/SiliconedApp/AppState\u002BHub.swift:39-45 | Sources/SiliconedApp/MirrorLibrary.swift:140-146 \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 \u0060Sources/SiliconedApp/AppState\u002BHub.swift:39\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/AppState\u002BHub.swift"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cabd3a2dc22bfe833cba63c41ddbd27d28f9a021d6ec09537d8f6f5f023a0aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/SiliconedApp/Lab.swift:590-594 | Sources/SiliconedApp/SubjectSheet.swift:172-176 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/Lab.swift"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"fccb1ad0f166d4ac6b097355245e9e40d0fad729d6eef1ed1e769f18fcb5e442"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/SiliconedApp/RackDiT.swift:385-389 | Sources/SiliconedApp/Welcome.swift:170-176 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060spacing\u0060 to \u00602\u0060 in one and \u00603\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RackDiT.swift"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"c887960491e7337e33b2568026fd2808bd1ff0737d59401488eebb1a124fe390"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Sources/SiliconedApp/RemoteControl\u002BCommands.swift:451-456 | Sources/SiliconedApp/RemoteControl\u002BMirror.swift:435-440 \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":"Sources/SiliconedApp/RemoteControl\u002BCommands.swift"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"18523b73898fdc8465a77386f53a5204e5b464f33451b5e6414ce5dba59044a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/SiliconedApp/RemoteControl\u002BFollow.swift:36-42 | Sources/SiliconedApp/RemoteControl\u002BFollow.swift:151-155 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/SiliconedApp/RemoteControl\u002BFollow.swift:36\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl\u002BFollow.swift"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f799a6cbaa9002aa1cb8a8ab9fefb9dc1386c833a118bb12d9ecac297e341d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Sources/Siliconed/Anima.swift:819-825 | Sources/Siliconed/Krea2.swift:697-703 \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":"Sources/Siliconed/Anima.swift"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"3662ae7ea12dc40888e5e195c226021c7e945ee784613f31036ce69573f37907"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/Siliconed/Anima.swift:64-68 | Sources/Siliconed/QwenImage21.swift:66-70 \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 \u0060Sources/Siliconed/Anima.swift:64\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Anima.swift"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"555ca5a73c9889a781af44a06be1e26338d4ec60e56475d3c29f01452e385dae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/Siliconed/CapacityProbesValidation.swift:46-50 | Sources/Siliconed/CapacityProbesValidation.swift:76-80 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/Siliconed/CapacityProbesValidation.swift:46\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":"Sources/Siliconed/CapacityProbesValidation.swift"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d1f3d515a8152dc9b599ccb912c6c9b11422d8e939439d074528cde9332071"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/Siliconed/DecodeKernels.swift:398-402 | Sources/Siliconed/ElementwiseGPU.swift:302-306 \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 \u0060Sources/Siliconed/DecodeKernels.swift:398\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/DecodeKernels.swift"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd78236ade003d0098cdea07514efdfb5782be51c2713eb5478a6a5713f8b4ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Sources/Siliconed/ElementwiseGPUMoss.swift:167-173 | Sources/Siliconed/ElementwiseGPUkrea2.swift:173-179 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060Sources/Siliconed/ElementwiseGPUkrea2.swift:181\u0060 calls \u0060NormParams\u0060, \u0060UInt32\u0060 and \u0060Sources/Siliconed/ElementwiseGPUMoss.swift:175\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/ElementwiseGPUMoss.swift"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"907162677a0206c471face0072c19aae12cf1fa680e09247c32daca1d2d59ea4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): Sources/Siliconed/Krea2.swift:366-371 | Sources/Siliconed/MossImage.swift:366-371 | Sources/Siliconed/QwenImage21.swift:852-857 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Krea2.swift"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee1e9dddc2ccb4e174ea03252b680a5f628ec0ff9bd2457a07f73e2a3047e2ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/Siliconed/Krea2.swift:409-413 | Sources/Siliconed/Krea2.swift:422-426 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Krea2.swift"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcfb5f8b1d435281e48cb40868b65abd52c50ae44aebbaf765c1b17c36f398dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Sources/Siliconed/ModulesKrea2.swift:66-73 | Sources/Siliconed/ModulesQwenImage21.swift:84-91 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/ModulesKrea2.swift"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"f42bc0507538c57a6b9538cd764bd074dc2ea73883fe60b51899956a41371c44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/Siliconed/MossImage.swift:412-416 | Sources/Siliconed/MossImage.swift:427-431 \u2014 both copies are in the same file, so extract the block 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":"Sources/Siliconed/MossImage.swift"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"37cb610f8a1d3c3264d8bfc312f6ce2c151a574c287b638151c05d927c24cb84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/Siliconed/NeuralEngine.swift:347-351 | Sources/Siliconed/NeuralEngine.swift:400-404 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/Siliconed/NeuralEngine.swift:347\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/NeuralEngine.swift"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb89bf5312f3c43f3cf59a1fb823a7c78811457263f3962678d76da2b333444"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/Siliconed/NeuralEngine.swift:613-617 | Sources/Siliconed/NeuralEngine.swift:625-629 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/Siliconed/NeuralEngine.swift:613\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/NeuralEngine.swift"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"9819fa389dde490df178f445dda14543b771fd30c0438c7d5a0cfdc9ad82e334"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/Siliconed/Ops.swift:24-28 | Sources/Siliconed/Ops.swift:124-128 \u2014 both copies are in the same file, so extract the block 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":"Sources/Siliconed/Ops.swift"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64fd471d0eedad0667cd4a6b78e4d06da35c1c631e97c82687146b29c5a8ce4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): Sources/Siliconed/TensorGEMMBF16.swift:144-148 | Sources/Siliconed/TensorGEMMInt8.swift:166-170 | Sources/Siliconed/TensorGEMMKQuant.swift:145-149 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/Siliconed/TensorGEMMBF16.swift:144\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/TensorGEMMBF16.swift"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a6fbadf2e83fbecd85f62a531526eadeedb33dc62a91a79a20379193878cdd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/Siliconed/Tokenizer.swift:94-98 | Sources/Siliconed/Tokenizer.swift:226-230 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/Siliconed/Tokenizer.swift:94\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Tokenizer.swift"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"2949b8724b283ad9cec80aa7529cca4fb00cb8a2f8f95636ce1fe4e9769f529b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/SiliconedApp/DiagnosticSheet.swift:258-262 | Sources/SiliconedApp/DiagnosticSheet.swift:380-384 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/SiliconedApp/DiagnosticSheet.swift:258\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/DiagnosticSheet.swift"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e8dbb8b9c6c16fef1a94ea30f501ba8c3e082fbdf469ce781c0a0560b31ce7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Sources/SiliconedApp/PromptField.swift:553-558 | Sources/SiliconedApp/PromptField.swift:577-582 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/SiliconedApp/PromptField.swift:553\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/PromptField.swift"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"9126682bdbf5d11272ed5b9d8781fef8a1b14330e6a65cb737d9f2f10dacb86d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Sources/SiliconedApp/Rack.swift:126-131 | Sources/SiliconedApp/Rack.swift:138-143 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/SiliconedApp/Rack.swift:126\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/Rack.swift"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"44df5ac885add48f7604fc606247d84911871d32b6516beca49f0d98aa33a846"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/SiliconedApp/RackDiT.swift:254-258 | Sources/SiliconedApp/RackDiT.swift:264-268 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/SiliconedApp/RackDiT.swift:254\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":"Sources/SiliconedApp/RackDiT.swift"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"e612309e54a78bf5184a849b4db60ec43a2cc68e68268c2aea13c3e3ab1556f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Sources/SiliconedApp/RemoteControl\u002BAdd.swift:247-254 | Sources/SiliconedApp/RemoteControl\u002BMirror.swift:149-156 \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":"Sources/SiliconedApp/RemoteControl\u002BAdd.swift"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b21a16f1a19071b792921ce5b36a586b071a29c7f02cd377eff384920b6e24d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Sources/SiliconedApp/RemoteControl\u002BAdd.swift:431-437 | Sources/SiliconedApp/RemoteControl\u002BMirror.swift:296-302 \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 \u0060Sources/SiliconedApp/RemoteControl\u002BAdd.swift:431\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl\u002BAdd.swift"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a523d7681419091299b73876aac68b0ed3b0a6eae027c8bca275d7b7e020cf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/Verification/QwenImageStages.swift:349-353 | Sources/Verification/QwenImageStages.swift:356-360 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060channels\u0060 to \u0060Int\u0060 in one and \u0060Int = 64\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Verification/QwenImageStages.swift"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a4d3becaa6c5798d06742bda4a6482b1e80ea74e57960015d44fccff4c3506"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): tools/oracle/anima.py:577-602 | tools/oracle/krea2.py:923-947 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/oracle/anima.py"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"e42a0f6f509c13847b6427bd7d221f436073fd5021e0bb0f9706c4d5e3d7b2a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): tools/oracle/qwen-image-2.1.py:680-705 | tools/oracle/qwen-image-2.1.py:709-737 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/oracle/qwen-image-2.1.py"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed22dbd7d097762a82cfd515659a1831a22f234d766dc7e505a20677562f7587"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): tools/oracle/anima.py:646-679 | tools/oracle/moss-image.py:862-893 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/oracle/anima.py"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"534c2ad278bcdd9acb034c985e7fd6730849006eddf3c6f5251e53511bbe3383"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): tools/oracle/krea2.py:342-361 | tools/oracle/krea2.py:365-392 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/oracle/krea2.py"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f15b368c06a06b31ce0bf891d7479b3cfb9a3d29a1ab27682b538a41fd9503"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): tools/oracle/z-image.py:266-286 | tools/oracle/z-image.py:290-310 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/oracle/z-image.py"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ecb562bee0ef765afcd584d8c8d3fd1dcf4f84775ed434624f6716571869b88"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): tools/oracle/anima.py:395-412 | tools/oracle/krea2.py:396-415 \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":"tools/oracle/anima.py"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11599a6605aeb80315918f939365510e1f0e0efca7fbb69454044668fcc0809"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): tools/oracle/anima.py:460-474 | tools/oracle/krea2.py:419-435 \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":"tools/oracle/anima.py"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb520d4f4914fb2107b2b3a59e3acd0c89497d9378d2fcd91f0dac9f2d0aa57"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): tools/oracle/anima.py:606-624 | tools/oracle/krea2.py:951-969 | tools/oracle/qwen-image-2.1.py:990-1009 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 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":"tools/oracle/anima.py"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec6dcd498cf86dcd46b9b2ddfb29da22d773c88213ffcc37097a5ea8e99c8280"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): tools/oracle/anima.py:348-363 | tools/oracle/anima.py:367-391 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/oracle/anima.py"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"be08490962ff27a277ad1a76e6a68965193b6476dbb9db05e9f26f4c7de1f3fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): tools/oracle/moss-image.py:627-643 | tools/oracle/moss-image.py:647-673 \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":"tools/oracle/moss-image.py"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c17016b3d00d7944b5293c5797eed8669034fc640c5856dcdc8f199e6da7dbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): tools/oracle/krea2.py:130-152 | tools/oracle/moss-image.py:213-233 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/oracle/krea2.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"e89ce8fc459aff5bc5780e1d1a8a9dba710f9968069d8c6bd58c7b1abe7f0d74"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): tools/oracle/z-image.py:518-540 | tools/oracle/z-image.py:544-564 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/oracle/z-image.py"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af6b6fe9e3019d7d48a8721d6e21c001925b0bcbb12913b1dc41c956f04bfa7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): tools/oracle/krea2.py:229-248 | tools/oracle/moss-image.py:422-435 \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":"tools/oracle/krea2.py"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"f87de287bf69f2212c67c1046e7a1929af1636584609102bd7b9d29c46eabcc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): tools/oracle/qwen-image-2.1-writer.py:80-83 | tools/oracle/qwen-image-2.1.py:166-169 \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":"tools/oracle/qwen-image-2.1-writer.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b75c5b7091dc02d17f9d4c4c82f581870b3a189d490d49307b61289dd3d97a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): tools/oracle/anima.py:287-290 | tools/oracle/moss-image.py:446-449 \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":"tools/oracle/anima.py"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f747e4f3a3e64f19b684e2d4fb7df7a96aaad4b9e68a23fc926461a5b79df5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): tools/oracle/krea2.py:106-114 | tools/oracle/qwen-image-2.1.py:139-147 \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":"tools/oracle/krea2.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"f796b74433b622df0641037acf856266ee4c9f85cda0451de2e8e252c41b6e3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): tools/oracle/qwen-image-2.1-writer.py:87-89 | tools/oracle/qwen-image-2.1.py:173-177 \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":"tools/oracle/qwen-image-2.1-writer.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7b606d3a9f42170463f6834d51a782607063f3d9633597d416df211263a7725"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 2\u002B corresponding lines): tools/oracle/common.py:167-169 | tools/oracle/moss-image.py:408-409 | tools/oracle/quantized.py:320-321 | tools/oracle/qwen-image-2.1-writer.py:159-160 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/oracle/common.py"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff411c6f42043301a668bb20721ce8dfae58be37929838fc8c4374d8d4c36a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): tools/oracle/anima.py:190-193 | tools/oracle/krea2.py:118-120 | tools/oracle/moss-image.py:136-138 \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":"tools/oracle/anima.py"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b07b54eea38a0629609ace02fbecd9a92149d62b255fa507547979ee3eae7ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): tools/oracle/quant_fixtures.py:1043-1056 | tools/oracle/quant_fixtures.py:1271-1284 \u2014 both copies are in the same file, so extract the block 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":"tools/oracle/quant_fixtures.py"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d7abc1d53dc3c72b539d3a42c573bfbad1b48df2bf7e4d1bcf06d444c3dfd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): tools/oracle/anima.py:606-615 | tools/oracle/krea2.py:951-960 \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":"tools/oracle/anima.py"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1aa743ef28f8ecd974b1bf2d46c11d242b05aa56528fbec6375e6db9b0e43c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): tools/oracle/z-image.py:382-390 | tools/oracle/z-image.py:461-467 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/oracle/z-image.py:382\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/oracle/z-image.py"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"4045e53346f5a9a47fb192790a241b610c0500dee571a2f959d49f8c2c88f7cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): tools/oracle/anima.py:460-467 | tools/oracle/krea2.py:419-426 \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":"tools/oracle/anima.py"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"e603f5715e5452b8d837a7165275af05017405e8f723597ffb1f1947af863db8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): tools/oracle/anima.py:652-658 | tools/oracle/krea2.py:1011-1017 \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 \u0060tools/oracle/anima.py:652\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060tools/oracle/anima.py:660\u0060 calls \u0060error\u0060 and \u0060tools/oracle/krea2.py:1018\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/oracle/anima.py"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e16622f62c57f779d4dd44d49a8c5a86b84b4ec504ba50a8f2f8367b27c278"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): tools/oracle/quant_fixtures.py:365-370 | tools/oracle/quant_fixtures.py:1116-1121 | tools/oracle/quant_fixtures.py:1335-1340 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/oracle/quant_fixtures.py"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c67fd12cff53a4532e9ef853d569aa3839acd68d51d54a5d9ab5467a26ecf5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): tools/oracle/anima.py:628-632 | tools/oracle/krea2.py:973-978 \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":"tools/oracle/anima.py"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"292bd1de475ec9d99c7c9914b7ffe0d37136edfd748c0a8a4722ec172a7ae9a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): tools/oracle/quant_fixtures.py:1091-1097 | tools/oracle/quant_fixtures.py:1310-1316 \u2014 both copies are in the same file, so extract the block 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":"tools/oracle/quant_fixtures.py"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"57247b8522accb4aa796eeb68311d743ccd7eb075432084348d04faed08dedc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): tools/oracle/qwen-image-2.1-writer.py:198-209 | tools/oracle/qwen-image-2.1.py:299-310 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060tools/oracle/qwen-image-2.1-writer.py:210\u0060 calls \u0060from_pretrained\u0060, \u0060snap\u0060 and \u0060tools/oracle/qwen-image-2.1.py:311\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/oracle/qwen-image-2.1-writer.py"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ef5e966ccd731232128139d162e0b86d1b97010153d287e8ee48deac993a1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): tools/oracle/qwen-image-2.1-writer.py:217-225 | tools/oracle/qwen-image-2.1.py:216-226 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/oracle/qwen-image-2.1-writer.py"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b044fac6698d5b6cdd1f0629ef8c7801a3575e1f051c22940a4173ca67294d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): tools/oracle/anima.py:297-302 | tools/oracle/anima.py:535-540 \u2014 both copies are in the same file, so extract the block 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":"tools/oracle/anima.py"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b4b62db6b54cf3c7d0abd850f1a3f5965dab88e414390797eeb42b27dfda70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): tools/oracle/anima.py:356-360 | tools/oracle/anima.py:383-387 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060tools/oracle/anima.py:382\u0060 calls \u0060Int8Products\u0060 and \u0060tools/oracle/anima.py:355\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/oracle/anima.py"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"932e1461612b1e90933c904c2e639ba5c0a7e88ad09973c0ae5ced2e82376cd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): tools/oracle/anima.py:404-411 | tools/oracle/anima.py:445-452 \u2014 both copies are in the same file, so extract the block 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":"tools/oracle/anima.py"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"a282f960784f803a71221033075fffc632f8973bf89b4f09d66ba13b85f0a9be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): tools/oracle/anima.py:591-602 | tools/oracle/krea2.py:936-947 \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":"tools/oracle/anima.py"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"703d030a88ae8d0d7f49b660d54b415366325fa903c59bfd386ffc50a87f2224"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): tools/oracle/anima.py:619-624 | tools/oracle/krea2.py:964-969 \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":"tools/oracle/anima.py"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"173b0db8c57158003d6050599709b3e362efd61c8e02b9b1fc13d88a31ecfa7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): tools/oracle/krea2.py:349-356 | tools/oracle/krea2.py:379-386 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/oracle/krea2.py:349\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/oracle/krea2.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78855d6103631d74417187bec57078189f8050280804eba72563ce927507865"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): tools/oracle/krea2.py:407-414 | tools/oracle/krea2.py:487-494 \u2014 both copies are in the same file, so extract the block 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":"tools/oracle/krea2.py"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf46e26893e144ca4c119797d1b1d730589dd06b56a5c5d88c2fab88571299dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): tools/oracle/krea2.py:995-999 | tools/oracle/moss-image.py:862-866 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note 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":"tools/oracle/krea2.py"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6af31ff3942fe67ad25a475f355bc798dddc290a35377ec10a230240ec02c53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): tools/oracle/moss-image.py:687-692 | tools/oracle/moss-image.py:746-751 \u2014 both copies are in the same file, so extract the block 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":"tools/oracle/moss-image.py"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e7469c2254be55e8f99078280f7f4cac3c31d86764829db34801c28aeaf93c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): tools/oracle/qwen-image-2.1.py:694-698 | tools/oracle/qwen-image-2.1.py:725-729 \u2014 both copies are in the same file, so extract the block 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":"tools/oracle/qwen-image-2.1.py"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb6cd95f952dc6835d2b32449a835a3c96349bdbee43e520e76e10b56bfba08e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): tools/oracle/z-image.py:277-283 | tools/oracle/z-image.py:300-306 \u2014 both copies are in the same file, so extract the block 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":"tools/oracle/z-image.py"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"89072c4230dc4629a62591ce3e24f781d707d305a751b1ba1b75a31a4e38c140"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: Measurement: Measurement: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bf419ca7b1230a386bfcee2cdaf91b98ee56413c1adc031f679d6dd8fa7e8a90"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: SilicontrolHelp: SilicontrolHelp: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f87256202fc6d70d4b90bbcc3e723b56c24a54ac59d18777f637a0c1f5e702ef"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DecodeKernels (LCOM4 8): DecodeKernels\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":"Sources/Siliconed/DecodeKernels.swift"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eee3bb042444eca1c2d4dabd1b845cfda645513d2110598b80bc96ec0bb88bc"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: View (LCOM4 8): View\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":"Sources/SiliconedApp/LabView.swift"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e049bf01b616caa0322631bfb4a3ada146a7ad149db27671557fbaf06ae4d67"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Coordinator (LCOM4 4): Coordinator\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":"Sources/SiliconedApp/PromptField.swift"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a398b285ca49b8da247566af24415956d8d4b390cf4eec22f099074c915d45"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PromptTextView (LCOM4 4): PromptTextView\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":"Sources/SiliconedApp/PromptField.swift"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0928eb1fed8fa65ad18cd77b0e769aaf46016431d1c4d180371a71e84056f3"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testFasterRenderingIsTheRequestsAndReachesThePlan: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/AdmissionTests.swift"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02b622bafdf57991342655242b60c8304cba1ef38745f8a9722c1b402e74db5"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testTheHalfSizeRuleAlone: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/AdmissionTests.swift"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc90fa164b7f958501af5576396bdb784d6199d2444f77c6c6b2c075f200e79"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testAnimaOffByDefaultThreeWhenOnNeverUnderTheRules: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/HalfSizeStartTests.swift"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"f45d0fa90b8b872c2331dbd7625d30d96a071b62999e24b1b98cc7c460162708"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testTheHalfSizeStartFollowsTheOthersRules: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/MossImageFamilyTests.swift"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb68979d230816dc60a46f7b19562ea39b330f4c6c0d4766b6e7e0ad22c76e5"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testInt8RouteAgainstFloat64: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/NeuralEngineTests.swift"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f2c8936801947774b331c0880aa7853c624b784f076ba36582d4f3dc88a1eb5"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testInt8RouteGivesBackANonFiniteActivation: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/NeuralEngineTests.swift"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"4503b32d4174156aa07b3e171d101956b65dccce8e614deffe8ca250276d7607"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testNoFamilyPlanReadsTheSettings: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/PlanReadsNoSettingsTests.swift"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"88762e1865205c4e7fddad7b00baa92958fc8b25b1a850b6651c1de9f19e3720"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testTheTripwireCountsAReadInsideItsScope: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/PlanReadsNoSettingsTests.swift"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b38c5d73395cdd4349e32912f415bb7356ac6ef970013933915570a47b15e64"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testQwenSpectralPlan: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/PureFunctionsTests.swift"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d57bcd20d619220af1043b582e38912d677aaa61fd1b8ef66ff92d4949093da"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: testKrea2SpectralPlan: Skipped \u2014 throws XCTSkip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/PureFunctionsTests.swift"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"646ab4f0baf5f6a4c64e97893502f2d7eab2e35210d026bce7c8103d9118a3af"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testZImage: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/CapacityEngineLedgerTests.swift"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"10fa39233a231e9a4209d8f0f8f2068a0f8c172845e31966d11c92a3a9b71af1"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testQwenImage21: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/CapacityEngineLedgerTests.swift"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1bebc16ac52c2b67ac648a8822ee31ed60737d453fdb51c0f6ef2cbd813bcb6"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testAnima: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/CapacityEngineLedgerTests.swift"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"3790d8bfb4ce30f64605dedaace5499fc917284b601c615dbed0669c44310209"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testKrea2: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/CapacityEngineLedgerTests.swift"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fac35b263f768865df72ff9c1effba51d9353b2f869600bcda041698f46f2ec"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testMossImage: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/CapacityEngineLedgerTests.swift"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"33272bf4711e18f9bb962d97993068a98e9c49d9e2c3591c7dae1cd7a87ded61"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testTheThreeChainsOfTheRepositoryPlugIn: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/ChainTests.swift"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c091fc79cadbf60aa6ba768f3f3e4c7eeef34313c30bba62da7f21b6993441"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testALoRAOfTheRightTargetIsAccepted: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/ChainTests.swift"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd34c19e1f683c0d0ec9f9d31c63034d3f53512db670f89af8721bcbe763736b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testFitFallsBackWhereTheFloorLeavesNoRoom: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/CropTests.swift"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ee33692cfecdb10ef8cd3368a7036f0b67af16e694b01ff331c48b8307da5c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testRandomDragsNeverBreakTheRules: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/CropTests.swift"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf08d1499c6975dd620e45409639dbbb7745873b8b35723e816572f3547319e9"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testBlockScalesOverSeveralJobs: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/DequantizeTests.swift"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"b10d940bf68773646b6aaced5fc5530f388d189e08955ce55907c29cee1ca428"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testColumnScalesOverSeveralJobs: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/DequantizeTests.swift"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fbc25b06bd83cf8f355d3ede802f7bece06638abe99aadd29be2da13e15bd7e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testTensorScaleAndPlainCastOverSeveralJobs: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/DequantizeTests.swift"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"58388294792f759e971d2954bc6d62071df37c4624c425929bac73552895b18d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testRowScalesOverSeveralJobs: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/DequantizeTests.swift"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea1979379695332ad976e86cb6b13081e5f38e12e750aeef9332d9ce64f9835"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testSafetensorsTooShortIsNamedNotUnopenable: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/HostileFilesTests.swift"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc7ce8e533e03e5a45be23d731a591c6a8eeed6259cd45edb95839ebabd68194"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testSafetensorsHeaderLengthIsBounded: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/HostileFilesTests.swift"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"40fa2bb5758e30e96dd48093d2dbd6fb9bce0ba5c8c9530a2bc3dbe1a4f6f12c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testSafetensorsOffsetsAndShapesAreBounded: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/HostileFilesTests.swift"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"88cce0e1c79e616252d05001d769afb8a986ec8e3243f9b1ac03e85e430fb81f"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testGGUFHugeCountsAreRefusedBeforeReading: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/HostileFilesTests.swift"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"8395f61fccd22cf975ef26d724e2803b16e4a6b5f2bef0b475adce90d2685be1"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testGGUFOverflowingDimensionsAreRefused: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/HostileFilesTests.swift"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5cad46366081dce8a1a69419ff8f35109721ba1ceaa1c2436eefc7d204b6b64"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testQ4KBlocksAgainstFP64: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/KQuantKernelTests.swift"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da78cf8aaeb5fe74b49da6241d186adf04625b5502c5c63b75f8bd200c41d9f"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testQ5KBlocksAgainstFP64: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/KQuantKernelTests.swift"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"c509d0b54cb88b87ae3551915bc5e9d89952fdd0c5c7a44cee3707afaf30d2af"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testFP8ScaledPerTensorComfyUI: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/QuantizedMapTests.swift"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a94e5abdeb7e93a83ac9fc34c5f687f8934d59ab2f8b197490396ea9a1fff9"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testFP8PerRowTorchao: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/QuantizedMapTests.swift"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e09b3243893c6988e11e43d17f88b1aa7beb2c32dd608b0e7033f90b6b2742"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testInt8PerRowBF16SDNQ: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/QuantizedMapTests.swift"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"314f34b7accd90fb98eae255b958c25eccae56aa49a3bdd5852fc048f005b68f"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testInt8PerRowF32Torchao: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/QuantizedMapTests.swift"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b162dde2a404811b9e0630d98515599bf0c0c79aca852e5615507d0575cd878"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testInt8PerRowComfyUI: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/QuantizedMapTests.swift"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d98b28a6d21f45e7cb5745057f78151ab594413c7ddd9f9c7e427f014656c1"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testInt8PerTensorF16Scale: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/QuantizedMapTests.swift"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"f49d2b2956c94780d66dbc029caa2418d11db69b07158dc497b74e72330c7da0"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testFP8PerRowSDNQ: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/QuantizedMapTests.swift"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda6a82548b02a1305b952cde0f13a92754ca3d087a9928e26de5c69e5a50832"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testAWholeStepIsTheCPUPassesToken: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/Qwen3VLDecoderTests.swift"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae167dff47dcabaaa6226163de9f596e4319f1a0fd45722e08d056657e8468c7"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testTheLibraryAndItsGesturesTravelAsJSON: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/RemoteInstallingTests.swift"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"883c0d346ab86589896fa4b478f21b80484fabfa564ea3160aaed71a8f2e29dc"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testAPageOfZeroOrLessIsRefused: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/RobustnessTests.swift"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4afe76459c14b4670d6b3e524cc90a53c899a6c88c0ccfb83ee2294ce02bff"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testNegativeOffsetsAndSizesAreRefused: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/RobustnessTests.swift"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"06db30ab351f6b816f7a72c26b5b8aa14c6f5ca43fedd764901e2991f518a77c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testZImage: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/StartingNoiseTests.swift"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"385666e4bdf251d671335a3a9a0f6c7e2d71539790d9af7bde7bd9fc7ba307d0"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testAnima: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/StartingNoiseTests.swift"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"8633409b7ba2e2bbc6f8f070ddb75d38302d91f976a6ecb67bfc1e513517a4a3"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testKrea2: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/StartingNoiseTests.swift"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea38398b5a2dc119860bb36dde1dbbf4bcd43c63d3a6d61e5bf8e5634e8668d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testMossImage: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/StartingNoiseTests.swift"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc94ad4024379b42b07a571e64eacbe15c7303d2ef8acfd47b6be2fb28388fa5"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testRotatedRowsInChunksAgainstTheRecipe: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/W8A8KernelTests.swift"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"d451c33ca4972fef99aa79670e42a08d30afcd764c0ac249f79c8e7c2997ad0e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testALongRowTwoChunksASimdgroup: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/W8A8KernelTests.swift"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"b517b6d8a2f7d78d4fe1c84c487113e5f71431d4ff39950dc2dd6b06792b236e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testAGroupOf64AndATensorScale: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/W8A8KernelTests.swift"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"c83878d401e740b19b0c3e752a1e4f857821b33427536c82401428c9ef8ba0e6"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testNoRotationOnAPartialChunk: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/W8A8KernelTests.swift"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3568e3c841e4fbbb5c712dd1cbad9a2b3d4ded69e263c81ebfdcc7ff719785"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testTheWeightReadInPlaceInTheMap: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/W8A8KernelTests.swift"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be934299d10cd3748493c437da891077817c4941c7bea13d7384ae4e4b36736"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testTheNormQuantizesZImagesRowAsTheSeparatePass: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/W8A8KernelTests.swift"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c6ad11c2f1053c48770a3c03c663aecf983b87369f3a1d2dfeb938c340f858a"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testTheNormQuantizesAPartialChunkUnrotated: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/W8A8KernelTests.swift"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b202f8f13c8a81c0166205d52a4e1269eb296bd9307f123b88bc4dad241ec1e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testTheNormQuantizesTheLongestRowItHolds: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/W8A8KernelTests.swift"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae7f1f3c7e7d2abb7b35185ee69c9326ab04000ef8ba4d167ccb537d445d1664"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testQwensLayerNormQuantizesAsItWrites: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/W8A8KernelTests.swift"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c7d1510800ea3145544df23edb1b3759d5b93cd72581ffb505a862cfaab54d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testKrea2sNormQuantizesAsItWrites: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/W8A8KernelTests.swift"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ffd337a3633a6a06d98181d4ec0eb9280c4381d6c0e3191ae38adf38e8615e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testMossNormQuantizesAsItWrites: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/W8A8KernelTests.swift"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"061fed2787af1f3dc777ca4c489bb9c0085e502b88788c37f8e7cdd526dbc1e3"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testAnimasResidualAndNormQuantizeAsTheyWrite: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Tests/SiliconedTests/W8A8KernelTests.swift"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2ec50c423f4254fb8b7bf4f75beb9ee799fee71533618a36596e6dcefc1a2e"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: sdnq: \u0060sdnq\u0060 0.2.9 is published on PyPI under \u0060GPL-3.0-only\u0060, which this policy bans, and it is in the SHIPPED closure of this repository \u2014 so it is installed by everything that depends on this repository, not just by its test environment. A distribution offering SEVERAL licences is a choice and is only charged when every one of them is banned. Replace the package, or record an accepted exception."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6e540d624babfa3b5577a58853c6ec9616b0f5a6c6f4e5b0102c1e9ba785203d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Siliconed/WeightProducts.swift: Sources/Siliconed/WeightProducts.swift changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in WeightProducts.linear at line 278. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Siliconed/WeightProducts.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/WeightProducts.swift"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f65fa2f2052f15bf726a6f2cf02a44bd89f0ba04114d7bae99878d6e9b87605"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Siliconed/Errors.swift: Sources/Siliconed/Errors.swift changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 77 in EngineError.errorDescription at line 276. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Siliconed/Errors.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Errors.swift"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90c82050da79690eade8452cfeb31fd2461ad844f4c0ba3ae45ff14848f61a1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/SiliconedApp/Problems.swift: Sources/SiliconedApp/Problems.swift changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 77 in Problem.sentence at line 56. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/SiliconedApp/Problems.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/Problems.swift"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"002fece0c09e6cfd80a90c0a4905722cdef616a906ac4c6f3181026c54340185"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Siliconed/CapacityPlan.swift: Sources/Siliconed/CapacityPlan.swift changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 75 in CapacityPlan.forcing at line 756. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Siliconed/CapacityPlan.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacityPlan.swift"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"83951940ad1651b375bcfdc8ddabdfff0302497ad6a582ac4b54152b5b0d353e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/SiliconedApp/RemoteControl.swift: Sources/SiliconedApp/RemoteControl.swift changed 41 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in RemoteControl.handle at line 78. 1 of those changes was a fix/bug commit, and the other 40 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/SiliconedApp/RemoteControl.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl.swift"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9339549aba4c327b2f6e63745bee3928fa28983cb6c9c8db15048e578d6a0d8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/SiliconedApp/RemoteControl\u002BAdd.swift: Sources/SiliconedApp/RemoteControl\u002BAdd.swift changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 73 in RemoteControl.add at line 121. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/SiliconedApp/RemoteControl\u002BAdd.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl\u002BAdd.swift"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d53af5987c8fa108b561827de1ac7da79ac270501745ce1e7781461350938a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/SiliconedApp/AppState\u002BMirror.swift: Sources/SiliconedApp/AppState\u002BMirror.swift changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in AppState.receive at line 266. 1 of those changes was a fix/bug commit, and the other 20 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/SiliconedApp/AppState\u002BMirror.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/AppState\u002BMirror.swift"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"92586f917049df7db46c991f779168382195fa650829cb54ce479de734289692"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/SiliconedApp/AppState\u002BRender.swift: Sources/SiliconedApp/AppState\u002BRender.swift changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in AppState.execute at line 359. 1 of those changes was a fix/bug commit, and the other 33 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/SiliconedApp/AppState\u002BRender.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/AppState\u002BRender.swift"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc91d43ee8baff57a7a3ee32f89f926acc365e24176f43f1467bca35d0fdbd0a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Siliconed/QwenImage21.swift: Sources/Siliconed/QwenImage21.swift changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in QwenImage21DiT.body at line 452. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Siliconed/QwenImage21.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/QwenImage21.swift"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7c4161ac5ccfbad406ce6e69ec930c40479946c1e9898a6184f7449285dfe9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Siliconed/CapacitySolver.swift: Sources/Siliconed/CapacitySolver.swift changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in ProductSolver.widened at line 375. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Siliconed/CapacitySolver.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacitySolver.swift"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c65bea2971802cb18c8b7b55e20b89bac2b3e7be5db9fed20e2bb165839303"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/SiliconedApp/App.swift: Sources/SiliconedApp/App.swift changed 43 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in MainWindow.watchKeys at line 546. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/SiliconedApp/App.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/App.swift"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8be725b836f1a7a3f4fe995473f82f5011a7aa85c429b4d9f63a286952dbce"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Siliconed/CapacityProbesSolos.swift: Sources/Siliconed/CapacityProbesSolos.swift changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in Context.solo at line 194. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Siliconed/CapacityProbesSolos.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacityProbesSolos.swift"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"8549192072dea6055ba8da196983c5fe578e9ce38af88ba4a52da570edca7a97"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Siliconed/Forge/Quantization.swift: Sources/Siliconed/Forge/Quantization.swift changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 124 in QuantizedLayouts.recognize at line 430. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Siliconed/Forge/Quantization.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/Quantization.swift"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfcbd88f18199b4c29c65b5c258fcee0b2d9f6a693719c055f3c6993c38c694d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Siliconed/Forge/Families.swift: Sources/Siliconed/Forge/Families.swift changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in Recipes.normalize at line 345. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Siliconed/Forge/Families.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/Families.swift"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"1961088cc3b30a49dce2eedd575d2bfcf7bd34b33b0012a4337d82531aaa718e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Siliconed/Artifact.swift: Sources/Siliconed/Artifact.swift changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in Artifact.parse at line 280. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Siliconed/Artifact.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Artifact.swift"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec01b1b25c6837c40e2c8ac8457fc6c3f2897a12a380e35a98e6ceb6516fedea"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Siliconed/Forge/ForgeLoRA.swift: Sources/Siliconed/Forge/ForgeLoRA.swift changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 88 in ForgeLoRA.forging at line 420. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Siliconed/Forge/ForgeLoRA.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/ForgeLoRA.swift"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"b037969fb08a84d187530aae7849645ef6715e912951c54c971cc44cea45ab04"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Siliconed/Krea2.swift: Sources/Siliconed/Krea2.swift changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in Krea2DiT.blockStreamed at line 451. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Siliconed/Krea2.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Krea2.swift"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef648bf27aabd6374ff0bf140843bf83047a9b68587866190b8d54f17c8c059d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Siliconed/Forge/Installation.swift: Sources/Siliconed/Forge/Installation.swift changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in Installer.install at line 536. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Siliconed/Forge/Installation.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/Installation.swift"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"740dfef90d782892b4d165b437e7ecdc4ee80bb7783c9f21961483435b5e5ea8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/SiliconedApp/RemoteControl\u002BMirror.swift: Sources/SiliconedApp/RemoteControl\u002BMirror.swift changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in RemoteControl.addOnMirror at line 74. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/SiliconedApp/RemoteControl\u002BMirror.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl\u002BMirror.swift"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"42acff44fcf24eb5ffc280b9cfd650949ea38cf23e499a848ce57d4a59c3ccc7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Siliconed/CapacityFit.swift: Sources/Siliconed/CapacityFit.swift changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in CapacityFit.model at line 687. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Siliconed/CapacityFit.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacityFit.swift"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cd9573eb7eb07c75f03ee29e0c90435784b49b9aa60de7f6f5fe2727d8237a8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Siliconed/RemoteGestures.swift: Sources/Siliconed/RemoteGestures.swift changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 120 in GestureOrder.parse at line 232. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Siliconed/RemoteGestures.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/RemoteGestures.swift"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e027540e3fab2ab7fad5bf8081dd8637374a0e7a2830c9a8bdd8827a020bb6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Siliconed/GEMM.swift: Sources/Siliconed/GEMM.swift changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in GEMM.linear at line 297. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Siliconed/GEMM.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/GEMM.swift"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa2810ca7b74fbe1b4d85404ef31e0374d554b93da2cf0ab4be3091cdfd9a59c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Siliconed/EngineSettings.swift: Sources/Siliconed/EngineSettings.swift changed 41 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in EngineSettings.init at line 256. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Siliconed/EngineSettings.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/EngineSettings.swift"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e1334f8386a45f99c6596122ea19a31a0d315741b7c6f5cf30acd0ebccf52d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Siliconed/NeuralEngine.swift: Sources/Siliconed/NeuralEngine.swift changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in NeuralEngine.run at line 284. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Siliconed/NeuralEngine.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/NeuralEngine.swift"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab88a36b2fb18ef6dd37a19fe9c798ff5ffad2d3bd20e12bf8f463da97f3f3f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Siliconed/EngineRender.swift: Sources/Siliconed/EngineRender.swift changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in Engine.execute at line 52. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Siliconed/EngineRender.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/EngineRender.swift"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef8c85279b747ea43d04b052b7585c0c70325496cd075d64467039031979674"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/SiliconedApp/MirrorServer.swift: Sources/SiliconedApp/MirrorServer.swift changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in MirrorServer.handle at line 172. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/SiliconedApp/MirrorServer.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/MirrorServer.swift"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"7320b0845aa2e1bf0393e22ff9ff7e42102d33d50b223ec2d8b31caf98a362ec"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Siliconed/Engine.swift: Sources/Siliconed/Engine.swift changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in Recipe.init at line 231. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Siliconed/Engine.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Engine.swift"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b6ffc92dfac133d353a18fc4f86f662f3a8675a7064cf8d42369caea51a457"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Siliconed/MemoryNeed.swift: Sources/Siliconed/MemoryNeed.swift changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in MemoryNeed.gemm at line 416. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Siliconed/MemoryNeed.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/MemoryNeed.swift"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"d457c6e396f16e8d3e1ca9bfa375717a19be96d01fe94060de1a39e83a866f41"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Siliconed/Forge/ForgeDiT.swift: Sources/Siliconed/Forge/ForgeDiT.swift changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 67 in ForgeDiT.tensor at line 357. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Siliconed/Forge/ForgeDiT.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/ForgeDiT.swift"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d3b772fbca2d8329d9d101ef06b70146e64807bf02d05a28ecab120a3c12425"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Siliconed/MossImage.swift: Sources/Siliconed/MossImage.swift changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in MossImageDiT.blockStreamed at line 449. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Siliconed/MossImage.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/MossImage.swift"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dae3bfa86c204f7ba0fb6e2d4b67ec1d477143aec25fb91172572e42a2be41c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/SiliconedApp/RemoteControl\u002BCommands.swift: Sources/SiliconedApp/RemoteControl\u002BCommands.swift changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in RemoteControl.set at line 279. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/SiliconedApp/RemoteControl\u002BCommands.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl\u002BCommands.swift"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c1d5c6e388ad50e6ef905b2f5fb4c9018a8724c68975ce191b2afd5ee4e2c7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Siliconed/Block.swift: Sources/Siliconed/Block.swift changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Block.forwardStreamed at line 292. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Siliconed/Block.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Block.swift"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"52df725bca9e54587131d57c5a87c4c8689fe04290b1889dfe1ccaeda47abe16"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Siliconed/HeadSplitAttention.swift: Sources/Siliconed/HeadSplitAttention.swift changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in HeadSplitAttention.init at line 212. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Siliconed/HeadSplitAttention.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/HeadSplitAttention.swift"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7c85a5079fb447ae14c3cd26bd9b224dc9afad3bf4d70300f4291952dc9758"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tools/oracle/krea2.py: tools/oracle/krea2.py changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in krea2.main at line 994. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- tools/oracle/krea2.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/oracle/krea2.py"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"f17d7ae0dfdb362097baac3f41acd7abb16f4a4bfcd81bd541deab4f48f4d682"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Verification/Krea2Stages.swift: Sources/Verification/Krea2Stages.swift changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Clouds.arbitrate at line 428. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Verification/Krea2Stages.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Verification/Krea2Stages.swift"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"18cde4a4be60ae7ce84ab48b897f520085d6e9a8145c59555b3f82eaba310d75"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Siliconed/DiT.swift: Sources/Siliconed/DiT.swift changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in DiT.forward at line 191. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Siliconed/DiT.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/DiT.swift"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b405193a91e50a01491efb4482bffcab12b3404e774953c2af7e63c4cf3d54"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/SiliconedApp/AppState\u002BCatalog.swift: Sources/SiliconedApp/AppState\u002BCatalog.swift changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in AppState.formBlocker at line 73. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/SiliconedApp/AppState\u002BCatalog.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/AppState\u002BCatalog.swift"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"0411c5f63ce6dfe8944c1586fc44ae220c1ade52a3089ba53cc0864c8316efe4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Verification/Invocation.swift: Sources/Verification/Invocation.swift changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in Invocation.init at line 55. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Verification/Invocation.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Verification/Invocation.swift"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"f39d726f8cc60838f0a1ad655dfd7a7f3e4598fe96d3c04b7bbf64b91fc443e6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/SiliconedApp/AppState\u002BLibrary.swift: Sources/SiliconedApp/AppState\u002BLibrary.swift changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in AppState.perform at line 71. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/SiliconedApp/AppState\u002BLibrary.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/AppState\u002BLibrary.swift"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8299e67620e98ab8e9fc5140ccf332b9e5f1dc91571f0d381b7fcc4301527a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Siliconed/Attention.swift: Sources/Siliconed/Attention.swift changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in Attention.init at line 106. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Siliconed/Attention.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Attention.swift"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"35be06a8178701bb90010a7879a6222dbb8a811fcdd6d4a441d4f44cb9828895"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/SiliconedApp/PromptField.swift: Sources/SiliconedApp/PromptField.swift changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in PromptTextView.varyTarget at line 378. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/SiliconedApp/PromptField.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/PromptField.swift"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"b472b67d175b4450ec0f7d85db1621177a1661079d327dcddfec2b9d69376a89"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Verification/MossImageStages.swift: Sources/Verification/MossImageStages.swift changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in MossImageStages.evaluate at line 149. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Verification/MossImageStages.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Verification/MossImageStages.swift"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf5a5f12f6d75568ebaa98b4777712a97e49c8f2bee4d0ce9cd3f01a59897429"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Siliconed/RenderGrid.swift: Sources/Siliconed/RenderGrid.swift changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in RenderGrid.init at line 164. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Siliconed/RenderGrid.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/RenderGrid.swift"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1067768d05748c8d28c4f5c85f86e94564534d231c0bed71f524fdf5dbd0654"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Siliconed/CapacityProbesSharing.swift: Sources/Siliconed/CapacityProbesSharing.swift changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in Context.trial at line 231. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Siliconed/CapacityProbesSharing.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacityProbesSharing.swift"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0ad28765e10f013122e1297dfbee54440282a5c82eb288cf89a4dc3003410f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Siliconed/Sampler.swift: Sources/Siliconed/Sampler.swift changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Sampler.run at line 131. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Siliconed/Sampler.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Sampler.swift"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff8725fb99ac03e75ed3c58a70e7c013c2210ebce3be39d5cc1a7cd278204d57"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Siliconed/Tokenizer.swift: Sources/Siliconed/Tokenizer.swift changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in Tokenizer.init at line 86. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Siliconed/Tokenizer.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Tokenizer.swift"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2575ed43037371f5157212b71cae876b41cbc27584dc5fdd4543b7e4863a16d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Siliconed/Qwen3VLGeneration.swift: Sources/Siliconed/Qwen3VLGeneration.swift changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in Qwen3VLGenerator.generate at line 259. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Siliconed/Qwen3VLGeneration.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Qwen3VLGeneration.swift"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"b048009446effb7b94810bfebd6791cc520c7bc52faa235b324e6c901a9f045c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Siliconed/TextEncoder.swift: Sources/Siliconed/TextEncoder.swift changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in TextEncoder.encode at line 395. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Siliconed/TextEncoder.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/TextEncoder.swift"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5432055f0be2d172f51827566c62e5963784e0c93e584b442f0d158d719801a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/SiliconedApp/LicenseSheet.swift: Sources/SiliconedApp/LicenseSheet.swift changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in LicenseTerms.body at line 29. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/SiliconedApp/LicenseSheet.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/LicenseSheet.swift"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c4b380a802abe8ca950fa7bbafa9d5df3328b8b89ddb0a56df7fbfd7ae35900"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Siliconed/QwenImage21VAE.swift: Sources/Siliconed/QwenImage21VAE.swift changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in QwenImage21VAE.run at line 294. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Siliconed/QwenImage21VAE.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/QwenImage21VAE.swift"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"563381cb38980afdb15be6707a869a99e80a80dac964095ed11074dae76ce0af"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Siliconed/Forge/ForgeText.swift: Sources/Siliconed/Forge/ForgeText.swift changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in ForgeText.plan at line 71. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Siliconed/Forge/ForgeText.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/ForgeText.swift"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"6719a56865bd2f69fca476e7c54c5fcb6de0df24f2b0a968d27f97aeda30d65f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Measurement/Runner.swift: Sources/Measurement/Runner.swift changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in Runner.run 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-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Measurement/Runner.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Measurement/Runner.swift"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a73fb932797493c4029fcd1bb41bb198f358722170aeea9075b93f5586a78f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tools/oracle/qwen-image-2.1.py: tools/oracle/qwen-image-2.1.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in 1.main at line 1022. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- tools/oracle/qwen-image-2.1.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/oracle/qwen-image-2.1.py"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6cc64dd71ee04c2ac19296dd100ffe18158b6f328c61eeb3ce7c2282ad545d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Siliconed/MemoryPlan.swift: Sources/Siliconed/MemoryPlan.swift changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in MemoryPlan.choose at line 124. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Siliconed/MemoryPlan.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/MemoryPlan.swift"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"a23a0429ce2ecbf3e3c71367a985a12ce35e3a2e20570ab1ec613001ba7c6c16"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Siliconed/Prefetcher.swift: Sources/Siliconed/Prefetcher.swift changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in TailStream.init at line 233. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Siliconed/Prefetcher.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Prefetcher.swift"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"e382b81785a118a86db1ab23f29a9fffbab7c270773a423eb77f91f6c14bf9d0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Siliconed/VAEEncoder.swift: Sources/Siliconed/VAEEncoder.swift changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in VAEEncoder.init at line 113. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Siliconed/VAEEncoder.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/VAEEncoder.swift"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aef759bbe5dfe8acbce00b84aeae76b38121335ac9a1b5357fad0d09e055a56"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Siliconed/Forge/Map.swift: Sources/Siliconed/Forge/Map.swift changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in MapWriter.write at line 290. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Siliconed/Forge/Map.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/Map.swift"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"b518ede5ebe7443fc3020a7956cdfa704bfa51472ec2d0bd50e180473f9a3535"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Siliconed/TiledAttention.swift: Sources/Siliconed/TiledAttention.swift changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in TiledAttention.submit at line 240. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Siliconed/TiledAttention.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/TiledAttention.swift"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f29e3f06381de41a67775d98acf9094d1315ce18f02730e20e3b554c0bb01c8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Siliconed/Qwen3VLDecoder.swift: Sources/Siliconed/Qwen3VLDecoder.swift changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in Qwen3VLDecoder.make at line 396. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Siliconed/Qwen3VLDecoder.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Qwen3VLDecoder.swift"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ceb6e6261d0da590197df699cc11eba4162ceb12ec062ea3aad4df54a6aa45"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Siliconed/Remote/Link.swift: Sources/Siliconed/Remote/Link.swift changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in RemoteLink.attempt at line 113. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Siliconed/Remote/Link.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Remote/Link.swift"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f6c4950df06b371951e5ab6ef7f8e7d675d034dcb693aaefefaf537d03ba9b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Siliconed/RemoteWriting.swift: Sources/Siliconed/RemoteWriting.swift changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in SetOrder.parse at line 228. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Siliconed/RemoteWriting.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/RemoteWriting.swift"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c5d361a8093907de82b75ee990ff7bc434b8aea8c9f2812ec6cc07b8b02b612"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Siliconed/CapacityProbesValidation.swift: Sources/Siliconed/CapacityProbesValidation.swift changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in Context.validate at line 14. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Siliconed/CapacityProbesValidation.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacityProbesValidation.swift"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f2cf7ba605194b473aa8786227afc23a3272795cdb78fd1c5b31efce7cf163"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Siliconed/Remote/Host.swift: Sources/Siliconed/Remote/Host.swift changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in RemoteHost.admit at line 194. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Siliconed/Remote/Host.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Remote/Host.swift"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b13a87290bb96b293f271c10793a4741a5c736b43aa73c88968c7cca43bef00"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Siliconed/DiagnosticWideningProbes.swift: Sources/Siliconed/DiagnosticWideningProbes.swift changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Diagnostic.measureWidening at line 28. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Siliconed/DiagnosticWideningProbes.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/DiagnosticWideningProbes.swift"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4387332d6ed3375b114a8633f049ded17e1de4871d2a8f892c0e82391a86c6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Siliconed/CapacityDisk.swift: Sources/Siliconed/CapacityDisk.swift changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in CapacityDisk.measureClasses at line 183. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Siliconed/CapacityDisk.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacityDisk.swift"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf778824e8884ea9f86532e6e92d03e060cd969aad14739a3176b99e1b3547d3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/SiliconedApp/RemoteControl\u002BLab.swift: Sources/SiliconedApp/RemoteControl\u002BLab.swift changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in RemoteControl.lab at line 21. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/SiliconedApp/RemoteControl\u002BLab.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl\u002BLab.swift"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"45893c985674cec44f5066fcdd57df5d519763fc49c7c4736bf771280fd8d96f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Siliconed/EngineAdmission.swift: Sources/Siliconed/EngineAdmission.swift changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in Admission.judge at line 30. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Siliconed/EngineAdmission.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/EngineAdmission.swift"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"85597e17337171f264cb3845d598b0d1f64245fc1df8a84d5d1c987d5e19745e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/Silicontrol/main.swift: Sources/Silicontrol/main.swift changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in main.swift.top-level code at line 21. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 11:07:33 \u002B01:00\u0027 --until=\u00272026-11-08 11:07:33 \u002B01:00\u0027 --full-history --no-merges -- Sources/Silicontrol/main.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Silicontrol/main.swift"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"b43d3324b10d51ca244cc6f11b901bce34990a137c1cf40d1c2ab02d2409e859"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060(repository root)\u0060 (87601 LoC, 942 module-visible types across 11 directories) overshoots its size bounds. 1 of 2 build unit(s) (Python, SwiftPM) overshoot their size bounds, lowering Project Cohesion to 0.0/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Package.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef91926bd754eb6d4ee98140c4b33eb6f98f362cf24a02371c2db5e0aec4e519"}},{"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":"bd515a8aafb7e3077b43e5bab46415b3acaabd0fa2c73cc083b498898ca72a6e"},"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":"f199e4fe3e85503d4ba98433b243e250dbd6b592ce13ce747d0476d6c0199b35"},"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":"46ed5088e372a1645841089d14aca0a25845741310820ce62e7cb1a6cd16763b"},"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":"29a123e5ded039aafc5f9608aaec5c5e039833e07d8997aa993c9ad344fa17f1"},"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":"e4cb465e1f0d2eae4c574d9bbda594dca37b461c20ca4391a9a1ab1fb76b76e5"},"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":"34f998d59eaff18b05f62f3ffd53eb1d86ddd758e021a3b06f3dd141181d69a1"},"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":"3fef84eb7a38121dbe03d81cfaefd04c4a006600e19e79fad9a27610ef7d241a"},"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":"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":"cfe2514f0d7f0e1fd389b3b3267bf8902b83c4a9685fbd398bf34700a11ec85b"},"taxa":[{"id":"CWE-601","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a64c9f612fcda41a8eeca8924f86255c58a510fa2f6e268072ebaac47dd07e3a"},"properties":{"dependency":{"package":"pillow","version":"12.3.0","advisory":"[GHSA redacted]","aliases":["BIT-pillow-2026-112390","BIT-pillow-2026-112391","BIT-pillow-2026-112392","BIT-pillow-2026-112393","BIT-pillow-2026-112394","BIT-pillow-2026-112395","BIT-pillow-2026-112396","BIT-pillow-2026-112397","BIT-pillow-2026-112398","BIT-pillow-2026-112399","BIT-pillow-2026-112400","BIT-pillow-2026-112401","BIT-pillow-2026-112402","BIT-pillow-2026-112403","BIT-pillow-2026-112404","BIT-pillow-2026-112405","BIT-pillow-2026-112406","BIT-pillow-2026-112891","BIT-pillow-2026-112892","BIT-pillow-2026-112893","BIT-pillow-2026-112894","BIT-pillow-2026-112895","BIT-pillow-2026-112896","BIT-pillow-2026-112897","BIT-pillow-2026-112898","BIT-pillow-2026-112900","BIT-pillow-2026-112901","BIT-pillow-2026-114501","BIT-pillow-2026-96636","BIT-pillow-2026-96637","BIT-pillow-2026-96638","BIT-pillow-2026-96639","BIT-pillow-2026-96640","BIT-pillow-2026-96641","BIT-pillow-2026-96642","BIT-pillow-2026-96643","BIT-pillow-2026-96644","BIT-pillow-2026-96778","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-4326","PYSEC-2026-4327","PYSEC-2026-4328","PYSEC-2026-4329","PYSEC-2026-4330","PYSEC-2026-4331","PYSEC-2026-4332","PYSEC-2026-4333","PYSEC-2026-4334","PYSEC-2026-4335","PYSEC-2026-4336","PYSEC-2026-4337","PYSEC-2026-4338","PYSEC-2026-4339","PYSEC-2026-4340","PYSEC-2026-4341","PYSEC-2026-4342","PYSEC-2026-4343","PYSEC-2026-4363"],"severity":"critical","fixedVersion":"13.0.0","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"981aa26b19a3201fdb5db133624b392e83efbca38ce6d9ff5c68cb80f0a26459"},"properties":{"dependency":{"package":"pillow","version":"12.3.0","advisory":"[GHSA redacted]","aliases":["BIT-pillow-2026-112390","BIT-pillow-2026-112391","BIT-pillow-2026-112392","BIT-pillow-2026-112393","BIT-pillow-2026-112394","BIT-pillow-2026-112395","BIT-pillow-2026-112396","BIT-pillow-2026-112397","BIT-pillow-2026-112398","BIT-pillow-2026-112399","BIT-pillow-2026-112400","BIT-pillow-2026-112401","BIT-pillow-2026-112402","BIT-pillow-2026-112403","BIT-pillow-2026-112404","BIT-pillow-2026-112405","BIT-pillow-2026-112406","BIT-pillow-2026-112891","BIT-pillow-2026-112892","BIT-pillow-2026-112893","BIT-pillow-2026-112894","BIT-pillow-2026-112895","BIT-pillow-2026-112896","BIT-pillow-2026-112897","BIT-pillow-2026-112898","BIT-pillow-2026-112900","BIT-pillow-2026-112901","BIT-pillow-2026-114501","BIT-pillow-2026-96636","BIT-pillow-2026-96637","BIT-pillow-2026-96638","BIT-pillow-2026-96639","BIT-pillow-2026-96640","BIT-pillow-2026-96641","BIT-pillow-2026-96642","BIT-pillow-2026-96643","BIT-pillow-2026-96644","BIT-pillow-2026-96778","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-4326","PYSEC-2026-4327","PYSEC-2026-4328","PYSEC-2026-4329","PYSEC-2026-4330","PYSEC-2026-4331","PYSEC-2026-4332","PYSEC-2026-4333","PYSEC-2026-4334","PYSEC-2026-4335","PYSEC-2026-4336","PYSEC-2026-4337","PYSEC-2026-4338","PYSEC-2026-4339","PYSEC-2026-4340","PYSEC-2026-4341","PYSEC-2026-4342","PYSEC-2026-4343","PYSEC-2026-4363"],"severity":"critical","fixedVersion":"13.0.0","relation":"direct","declaredRange":"12.3.0","reachability":{"kind":"production","file":"tools/oracle/common.py","line":272}}}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: AppState\u002BDiagnostic.swift \u2194 DiagnosticSheet.swift: \u0060Sources/SiliconedApp/AppState\u002BDiagnostic.swift\u0060 and \u0060Sources/SiliconedApp/DiagnosticSheet.swift\u0060 change together 87% of the time (13 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package \u2014 so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 13 shared commits counted here, the most recent 3 are \u0060e34cb1b5\u0060 The first render measures this Mac again when no current map is kept; \u006067a82949\u0060 Measure This Mac starts only on the user\u0027s click, after asking for a \u2026; \u0060ef079542\u0060 The map\u0027s tier follows the memory alone, and its precision gates close \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/AppState\u002BDiagnostic.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a55b8a0bd7cfa497a01eacd348b0246b073cfbd4ae9068e43453615e060f173"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: RemoteControlHelp.swift \u2192 RemoteControl\u002BAdd.swift, RemoteControl\u002BCommands.swift, SettingsWindow.swift: \u0060Sources/SilicontrolHelp/RemoteControlHelp.swift\u0060 changes together with 3 other files \u2014 \u0060Sources/SiliconedApp/RemoteControl\u002BAdd.swift\u0060, \u0060Sources/SiliconedApp/RemoteControl\u002BCommands.swift\u0060, \u0060Sources/SiliconedApp/SettingsWindow.swift\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SilicontrolHelp/RemoteControlHelp.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b26ceb79cb7b07a22791c4c73e3f97e8194e576a44e607fe58e0cbefd3762a51"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: MemoryNeedKrea2.swift \u2194 MemoryNeedQwenImage21.swift: \u0060Sources/Siliconed/MemoryNeedKrea2.swift\u0060 and \u0060Sources/Siliconed/MemoryNeedQwenImage21.swift\u0060 change together 80% of the time (8 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). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package \u2014 so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u006081e445b6\u0060 The decoding carries the denoiser\u0027s Neural Engine surfaces instead of\u2026; \u0060db1b9b02\u0060 The text encoder kept, a choice of the memory plan charged in B; \u00603ced8c0b\u0060 LoRA products through the capacity plan (work in progress) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/MemoryNeedKrea2.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97d376a0237a7b752d2d8fa7c020f7968d2e0789350b6a974e8320f1c5f19cf"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: Block.swift \u2192 Anima.swift, Krea2.swift, MossImage.swift: \u0060Sources/Siliconed/Block.swift\u0060 changes together with 3 other files \u2014 \u0060Sources/Siliconed/Anima.swift\u0060, \u0060Sources/Siliconed/Krea2.swift\u0060, \u0060Sources/Siliconed/MossImage.swift\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Block.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce6e650cf5ce9ea3446492d43f9a0f7cedfb77ccaa321be221da72abddc75bf"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: MemoryNeedAnima.swift \u2194 MemoryNeedQwenImage21.swift: \u0060Sources/Siliconed/MemoryNeedAnima.swift\u0060 and \u0060Sources/Siliconed/MemoryNeedQwenImage21.swift\u0060 change together 60% of the time (6 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). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package \u2014 so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u006081e445b6\u0060 The decoding carries the denoiser\u0027s Neural Engine surfaces instead of\u2026; \u0060db1b9b02\u0060 The text encoder kept, a choice of the memory plan charged in B; \u00603ced8c0b\u0060 LoRA products through the capacity plan (work in progress) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/MemoryNeedAnima.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed82b171da981d6bfa127b06460d028db96deea392d3341f63737ddede5e0270"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: AppState\u002BCatalog.swift \u2194 Rack.swift: \u0060Sources/SiliconedApp/AppState\u002BCatalog.swift\u0060 and \u0060Sources/SiliconedApp/Rack.swift\u0060 change together 55% of the time (6 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package \u2014 so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060e34cb1b5\u0060 The first render measures this Mac again when no current map is kept; \u0060bd28427f\u0060 Series seen at a glance: a yellow \u00B1 at the left of what can vary; \u006067a82949\u0060 Measure This Mac starts only on the user\u0027s click, after asking for a \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/AppState\u002BCatalog.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9bc96fbaacba0217a42e2c699fbfef5044fc6ea9b2d39b344b820509a19ec2c"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: Errors.swift \u2194 AppState.swift: \u0060Sources/Siliconed/Errors.swift\u0060 and \u0060Sources/SiliconedApp/AppState.swift\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). They sit in different directories, but in this ecosystem the namespace is declared in the FILE, not by the folder \u2014 so the two may well share one namespace and reference each other with no import for this pass to see. Read the pair before acting: if one derives from or overrides the other, the dependency is explicit in the type declaration and the co-change is definitional; if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE and the thing to add is a comment saying so; if they simply belong together, co-locate them; if none of these 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 \u006059b8b6db\u0060 No machine profile left in the app; \u0060a94c0538\u0060 Library on another disk: move, open or bring it back from Settings; r\u2026; \u00605fe66a5c\u0060 Never deliver an image that is not finite \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Errors.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de56f958bd119341d95a90511367be60811098fc8c2739dec8fecaed1984702"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: Conductor.swift \u2194 NeuralEngine.swift: \u0060Sources/Siliconed/Conductor.swift\u0060 and \u0060Sources/Siliconed/NeuralEngine.swift\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). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package \u2014 so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; 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 \u00603ced8c0b\u0060 LoRA products through the capacity plan (work in progress); \u0060277ebad8\u0060 Capacity map: a route table read by the engine at each product and at\u2026; \u0060b3973f7b\u0060 GPU, AMX and Neural Engine together on one product, where the capacit\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Conductor.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c635640ddcab3357c4fa118c636c1322c1b89816b9faba31c708f49d1250767b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: Conductor.swift \u2194 Diagnostic.swift: \u0060Sources/Siliconed/Conductor.swift\u0060 and \u0060Sources/Siliconed/Diagnostic.swift\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). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package \u2014 so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; 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 \u0060b3973f7b\u0060 GPU, AMX and Neural Engine together on one product, where the capacit\u2026; \u00608c5f572d\u0060 Neural Engine beside the AMX, shape by shape; smaller program parts; \u006093d974e1\u0060 Neural Engine share per shape: the capacity map measures the ANE on t\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Conductor.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e02556c56368cdae78e6bbea11c69dcfc32a0620447f425d3cdb604c9098a39"}},{"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":"6b1273c81a1ca9b5eb097489b2567416912a145951451afeec807249ffa5e5b8"},"taxa":[{"id":"CICD-SEC-4","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":"fa4800cf4dc0cd87a2f188bdd854d709ab64e118b3e437c9b9c38490aa0faae2"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"DM4","level":"error","message":{"text":"Anemic domain model: Cancellation: \u0060Cancellation\u0060 is a data-only reference entity whose behaviour is DELEGATED to a foreign utility (static methods that take it as their first parameter and hold its logic) \u2014 the anemic domain model. Move the behaviour onto the entity so it enforces its own invariants rather than being driven from outside."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Cancellation.swift"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d67cdedec89fcb2d737e7f3f5f07e2a4ae6d2e01b3900f0a58521a781cac0d9"}},{"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":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add CodeQL\u0027s Swift pack (Swift/Xcode) (or \u0060semgrep --config=auto\u0060, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 3 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/test.yml"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060tools/oracle/requirements-quant.txt\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/oracle/requirements-quant.txt"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"459b10b7c3190f6cea872c4884db4f945936bd845aa09922569d38e4630a96bb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060args.stage == \u0022w8a8\u0022 and args.variant != \u0022compact\u0022\u0060 appears character-identically in 5 files \u2014 tools/oracle/anima.py, tools/oracle/krea2.py, tools/oracle/moss-image.py, tools/oracle/qwen-image-2.1.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/oracle/anima.py"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"53350bbfa6f70b5837c3d9a416ed6876fabff9ea0f75cc5eadfe4c1729204ae9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(n, ast.FunctionDef) and n.name in wanted\u0060 appears character-identically in 2 files \u2014 tools/oracle/quant_fixtures.py, tools/oracle/quantized.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/oracle/quant_fixtures.py"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8cac264d8f29aa1fc69c640bd46e62f8f26c8010ab5644ba9efa8c1d5823dc6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(squares) \u003C len(sizes) and \u00221024\u0022 not in squares\u0060 appears character-identically in 2 files \u2014 tools/oracle/anima.py, tools/oracle/krea2.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/oracle/anima.py"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a94577c23bd5ec24d3061c1515ddb3cf077672e31c7fbefc36338ad61e5ee5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060t.is_meta and not name.startswith(streamed)\u0060 appears character-identically in 2 files \u2014 tools/oracle/qwen-image-2.1-writer.py, tools/oracle/qwen-image-2.1.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/oracle/qwen-image-2.1-writer.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e7946f9fc890735cda234ff663b595d4926bbb83f95ad0041acad4a784a08ea"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!$0.path.isEmpty \u0026\u0026 !valid.contains($0.path)\u0060 appears character-identically in 2 files \u2014 Sources/SiliconedApp/AppState\u002BCatalog.swift, Sources/SiliconedApp/AppState\u002BPlace.swift. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/AppState\u002BCatalog.swift"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e65a004cb029d22a1aa8ea1f60a139b315c44b662b17b4ec176dbfc25baac16"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(a.usesTiles || a.splits) \u0026\u0026 sequence \u003E= headSplitRows\u0060 appears character-identically in 2 files \u2014 Sources/Siliconed/Krea2.swift, Sources/Siliconed/MossImage.swift. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Krea2.swift"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"748d93a437edf61712c2067a2b69caa10762f79fdb1540f4423692b80b0b6eac"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060arguments.count == 1 || arguments[1] == \u0022--download\u0022\u0060 appears character-identically in 2 files \u2014 Sources/SiliconedApp/RemoteControl\u002BCommands.swift, Sources/SiliconedApp/RemoteControl\u002BMirror.swift. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/RemoteControl\u002BCommands.swift"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"2095f1d00dd1b0f0cf6866c6f8e81e0755ee09886b7c67f1d7feeed1ce6ef1a9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060columns % 2 == 0 \u0026\u0026 rounded.offset % 4 == 0\u0060 appears character-identically in 4 files \u2014 Sources/Siliconed/ElementwiseGPU.swift, Sources/Siliconed/ElementwiseGPUMoss.swift, Sources/Siliconed/ElementwiseGPUkrea2.swift, Sources/Siliconed/ElementwiseGPUqwen.swift. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/ElementwiseGPU.swift"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d333e4c9bb0773a5305f551432fa4305d0c8f5463b7145e4e33e2403797363c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060image.width == width \u0026\u0026 image.height == height\u0060 appears character-identically in 4 files \u2014 Sources/Siliconed/MemoryNeedAnima.swift, Sources/Siliconed/MemoryNeedKrea2.swift, Sources/Siliconed/MemoryNeedZImage.swift, Sources/Siliconed/Qwen3VLImages.swift. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/MemoryNeedAnima.swift"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"1247ebff853fed30e9f55e4021b422c338d1037f434cd91c1094c9dee7c3d654"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060key.weight == .int8 || key.weight == .q8\u0060 appears character-identically in 2 files \u2014 Sources/Siliconed/CapacityPlan.swift, Sources/Siliconed/CapacitySolver.swift. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/CapacityPlan.swift"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"5813c9937f10b913b4bfce4e98a25809efd19ebbe9d8c296cfab84e86ebf0773"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lora != nil || context.detail != .normal\u0060 appears character-identically in 5 files \u2014 Sources/Siliconed/Modules.swift, Sources/Siliconed/ModulesAnima.swift, Sources/Siliconed/ModulesKrea2.swift, Sources/Siliconed/ModulesQwenImage21.swift. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Modules.swift"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c398f4c81677387e8297bcae70a66781860478165725c8c612f902b194fa5c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060outcome != .asNamed || t.dtype != .bfloat16\u0060 appears character-identically in 2 files \u2014 Sources/Siliconed/Forge/ForgeQwen35.swift, Sources/Siliconed/Forge/ForgeText.swift. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/ForgeQwen35.swift"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"783e115335b635aa7ea03c6b2b6451cb87f0fe0bf7e9746774f443d83b679792"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060request.mapInPlace \u0026\u0026 request.mapInPlaceAvailable\u0060 appears character-identically in 5 files \u2014 Sources/Siliconed/MemoryNeedAnima.swift, Sources/Siliconed/MemoryNeedKrea2.swift, Sources/Siliconed/MemoryNeedMossImage.swift, Sources/Siliconed/MemoryNeedQwenImage21.swift. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/MemoryNeedAnima.swift"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2e7a38f48a8b0a58670f45ef30e995ee8e7c91f8d2ac2039da0f3c182da4039"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060request.tail.fraction \u003E 0 \u0026\u0026 request.tail.streamed\u0060 appears character-identically in 2 files \u2014 Sources/Siliconed/MemoryNeedKrea2.swift, Sources/Siliconed/MemoryNeedMossImage.swift. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/MemoryNeedKrea2.swift"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d9f6f630197ae09800e704e9372e40b1157d13db724707af77a079e194be50"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, 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":"Sources/Siliconed/Catalog.swift"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"588465d738460c2ac02882c09567a4a764142bb10e756b7b7776e85b978444c4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, 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":"Sources/Siliconed/DiagnosticMachine.swift"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ba94fd5f13ac83ed98ca9d83f582d42db7f9bf7a75f9a3e2f5c86ab527b674"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, 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":"Sources/Siliconed/DiagnosticWideningProbes.swift"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebaab4fa856549c9beac7687fc2b14977c76e0f60dfba4c20fc5fcf1c0262592"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, 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":"Sources/Siliconed/NeuralEngine.swift"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"59dd203457ea7f7f7ad4de28c28e63aca725c57f7282fce46b3c78e663168b79"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, 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":"Sources/Siliconed/NeuralEngine.swift"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ed8318a89017e267b1c04b32694963cfed24e23004ae09c515b892b6e416fb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/RenderCache.swift"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"699feadfa190ecf93677273232f2cb821db9828e9c32f42c3c1b47287df57f53"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/Forge/HubLink.swift"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"830f0107cb023eac39f215198d0be32aac9425ee20ed839f8c5547265717e3de"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Measurement/Runner.swift"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c5c0f4fa4d2ff3b1fd1356d5458bdbcf391ab8cea459554fa192937c588afa9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060residue\u0060 turns every thrown error into \u0060[]\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the error or let it propagate (\u0060throws\u0060). 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 at the \u0060catch\u0060, \u0060guard\u0060 or \u0060??\u0060, or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/LabInputs.swift"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c9ae39cce18d7937816fc0511a2ea865c8cb582f4cee0122d2850a3523fb282"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060evict\u0060 turns every thrown error into \u0060[]\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the error or let it propagate (\u0060throws\u0060). 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 at the \u0060catch\u0060, \u0060guard\u0060 or \u0060??\u0060, or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/Siliconed/RenderCache.swift"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"103d36a843b842a53e5775acc26ad2121ad7117c37ef1f680a8a211c0a7f0098"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060promptGroups\u0060 turns every thrown error into \u0060[]\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the error or let it propagate (\u0060throws\u0060). 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 at the \u0060catch\u0060, \u0060guard\u0060 or \u0060??\u0060, or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SiliconedApp/AppState\u002BCatalog.swift"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c370f9bd5f117e79bc7175a3d04e7b8d6ed74096053b7c01f4d99a6e439cd0f"}}],"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-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-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-601","guid":"9b8963d5-129b-475c-90cf-2d1766e66f2f","name":"URL Redirection to Untrusted Site (\u0027Open Redirect\u0027)","shortDescription":{"text":"URL Redirection to Untrusted Site (\u0027Open Redirect\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/601.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"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":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"},{"id":"CICD-SEC-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":17,"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."]}]}