{"$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":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"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":"AX5","name":"Architecture \u0026 structure","shortDescription":{"text":"Architecture \u0026 structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AX5"},{"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":"AXA1","name":"Runtime unauthenticated reachability","shortDescription":{"text":"Runtime unauthenticated reachability"},"helpUri":"https://codehealth.canine.dev/dimensions/AXA1"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"AXH1","name":"Runtime security headers","shortDescription":{"text":"Runtime security headers"},"helpUri":"https://codehealth.canine.dev/dimensions/AXH1"},{"id":"AXI1","name":"Runtime container hardening","shortDescription":{"text":"Runtime container hardening"},"helpUri":"https://codehealth.canine.dev/dimensions/AXI1"},{"id":"AXR1","name":"Runtime accessibility (rendered)","shortDescription":{"text":"Runtime accessibility (rendered)"},"helpUri":"https://codehealth.canine.dev/dimensions/AXR1"},{"id":"AXS1","name":"Runtime exposed surface","shortDescription":{"text":"Runtime exposed surface"},"helpUri":"https://codehealth.canine.dev/dimensions/AXS1"},{"id":"C2","name":"Access Controls","shortDescription":{"text":"Access Controls"},"helpUri":"https://codehealth.canine.dev/dimensions/C2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"ES1","name":"Fold determinism","shortDescription":{"text":"Fold determinism"},"helpUri":"https://codehealth.canine.dev/dimensions/ES1"},{"id":"ES2","name":"Immutable events","shortDescription":{"text":"Immutable events"},"helpUri":"https://codehealth.canine.dev/dimensions/ES2"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P5","name":"DR \u0026 Backup","shortDescription":{"text":"DR \u0026 Backup"},"helpUri":"https://codehealth.canine.dev/dimensions/P5"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"P7","name":"Outbound HTTP resilience","shortDescription":{"text":"Outbound HTTP resilience"},"helpUri":"https://codehealth.canine.dev/dimensions/P7"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"ActiveSession::on_incoming_message (cyclomatic 60): ActiveSession::on_incoming_message has cyclomatic complexity 60 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/session/active.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0945a3137643306d41d5e176a510ad42785cb57b02f0b25bfc848a92bc2e8f"}},{"ruleId":"D1","level":"warning","message":{"text":"bench-benchmarkoor-summary.main (cyclomatic 47): bench-benchmarkoor-summary.main 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":".github/scripts/bench-benchmarkoor-summary.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d34855e76ff68c8774bbb5bfba1ed0937f5e29a6e1b952e307a3d51f67cf5f5"}},{"ruleId":"D1","level":"warning","message":{"text":"ActiveSession::poll (cyclomatic 41): ActiveSession::poll has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/session/active.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"405ea427ef1fb3374f303564cb37b335fc3a6d47d90dca12a799531ffcc4af0e"}},{"ruleId":"D1","level":"warning","message":{"text":"reth_transaction_pool::maintain::maintain_transaction_pool (cyclomatic 41): reth_transaction_pool::maintain::maintain_transaction_pool has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/maintain.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"5218efb026ffc6c33362d9daad41f281e84de2405dcec5f02c3ca1e15d34921f"}},{"ruleId":"D1","level":"warning","message":{"text":"reth_node_ethereum::engine_ssz_proxy::handle_engine_ssz_request (cyclomatic 37): reth_node_ethereum::engine_ssz_proxy::handle_engine_ssz_request has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ethereum/node/src/engine_ssz_proxy.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"b876d8dafbe6600e035cb560e1778dcfbd951f8ed165dc799ff1288c82c47ee1"}},{"ruleId":"D1","level":"warning","message":{"text":"Discv4Service::poll (cyclomatic 35): Discv4Service::poll has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/discv4/src/lib.rs"},"region":{"startLine":1891}}}],"partialFingerprints":{"codehealthFindingId/v1":"152ab34eef0b76c0544200eeba853d32a136838ab8d8b6ea4bc96306b24b02cf"}},{"ruleId":"D1","level":"warning","message":{"text":"NetworkManager::on_handle_message (cyclomatic 35): NetworkManager::on_handle_message has cyclomatic complexity 35 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/manager.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f8913211a5d2ded1dfbea62324949c893726da7827ca645a64410e772e40f5"}},{"ruleId":"D1","level":"warning","message":{"text":"EthTransactionValidator::validate_stateless (cyclomatic 35): EthTransactionValidator::validate_stateless has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/validate/eth.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"936a840f01224ff229b98f26d6b35e4f9e3f6974c4858ee764f68e841b73a0a5"}},{"ruleId":"D1","level":"warning","message":{"text":"ProtocolMessage::decode_message_with_tx_memory_budget (cyclomatic 34): ProtocolMessage::decode_message_with_tx_memory_budget 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":"crates/net/eth-wire-types/src/message.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a5d261f1fee44a42bd90b18a3fb1ee03e109bc87c7e88ef3cb3c26ab37faa0f"}},{"ruleId":"D1","level":"warning","message":{"text":"Command::execute (cyclomatic 32): Command::execute 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":"crates/cli/commands/src/re_execute.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a34b713dae8c280f554dc5c01d85b8c67db424b5769f1c48a7e300594e22d0f"}},{"ruleId":"D1","level":"warning","message":{"text":"reth_ethereum_payload_builder::default_ethereum_payload (cyclomatic 32): reth_ethereum_payload_builder::default_ethereum_payload 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":"crates/ethereum/payload/src/lib.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"974f153b58e9716a8822819846c02f57b532b9058068b8e139595f8d5de98f14"}},{"ruleId":"D1","level":"warning","message":{"text":"EthStateCacheService::poll (cyclomatic 31): EthStateCacheService::poll has cyclomatic complexity 31 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc-eth-types/src/cache/mod.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"e914785ca9156e84beef996f672411eca4b6a7f0f4adf9730c895544aaade66f"}},{"ruleId":"D1","level":"warning","message":{"text":"ArenaParallelSparseTrie::update_cached_rlp (cyclomatic 30): ArenaParallelSparseTrie::update_cached_rlp has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/sparse/src/arena/mod.rs"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a11b7d1faea914fda6c8ab2c9f8fb123c6e32469d676f522a25b356e5f69d3"}},{"ruleId":"D1","level":"warning","message":{"text":"ArenaParallelSparseTrie::update_leaves (cyclomatic 30): ArenaParallelSparseTrie::update_leaves 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":"crates/trie/sparse/src/arena/mod.rs"},"region":{"startLine":2776}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f2ff73d4741dfa0a51d8e0ace3d095aef1ca65fac88c62ee2efbe90555d4b1"}},{"ruleId":"D1","level":"warning","message":{"text":"StreamCodec::decode (cyclomatic 29): StreamCodec::decode has cyclomatic complexity 29 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/ipc/src/stream_codec.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"de12e36c4aac3d2f90e6c50242b38c481bddbd12a650b377ae2359d3d7c6aa52"}},{"ruleId":"D1","level":"warning","message":{"text":"TrieWitness::compute (cyclomatic 27): TrieWitness::compute 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":"crates/trie/trie/src/witness.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df20350f00021076c2b8cd7f2b4113f03501d8c4346d666b91e24825eeacbcb"}},{"ruleId":"D1","level":"warning","message":{"text":"Command::execute (cyclomatic 26): Command::execute has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/stage/drop.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"1383392e9f2908fc01996b94ebe5296ca870690189c4d59b3c566952ab588e20"}},{"ruleId":"D1","level":"warning","message":{"text":"Command::execute (cyclomatic 25): Command::execute has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/mod.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"edaa1b8c9c74c2be55bb4e548832cd131d8d3d932de608c78acd90065b017e68"}},{"ruleId":"D1","level":"warning","message":{"text":"EstimateCall::estimate_gas_with (cyclomatic 25): EstimateCall::estimate_gas_with has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc-eth-api/src/helpers/estimate.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"32098c1ed6fa847a68730bb3592679275ecf264721325242754f1121b1fde12d"}},{"ruleId":"D1","level":"warning","message":{"text":"bench-reth-summary.main (cyclomatic 25): bench-reth-summary.main has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/bench-reth-summary.py"},"region":{"startLine":2050}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d054d25efa093a0681d300e38c2d8dc96eb971cc6bf354043549586a3e2f82"}},{"ruleId":"D1","level":"warning","message":{"text":"EthBeaconConsensus::validate_header (cyclomatic 24): EthBeaconConsensus::validate_header 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":"crates/ethereum/consensus/src/lib.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"85dc0e579d4175752ecad397b872c3bbb7bb9613da3f0a9dce4e437e89dad4f2"}},{"ruleId":"D1","level":"warning","message":{"text":"TransactionFetcher::on_announcement (cyclomatic 24): TransactionFetcher::on_announcement 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":"crates/net/network/src/transactions/fetcher.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"f49a25d28c63ca265cb6e48c10fcdd375a92770af9581911358014a9c41160df"}},{"ruleId":"D1","level":"warning","message":{"text":"TransactionsManager::import_transactions (cyclomatic 24): TransactionsManager::import_transactions 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":"crates/net/network/src/transactions/mod.rs"},"region":{"startLine":1347}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0bede68795776e6ea47e19bf6fb82dc821031eab95b2f45a479b704346459ca"}},{"ruleId":"D1","level":"warning","message":{"text":"IpcConnDriver::poll (cyclomatic 24): IpcConnDriver::poll 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":"crates/rpc/ipc/src/server/connection.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"359bec2cec4c77eca4073627c63382e502fec61b4418a149d1ece1ce16ee4ea5"}},{"ruleId":"D1","level":"warning","message":{"text":"ExecutionStage::execute (cyclomatic 24): ExecutionStage::execute 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":"crates/stages/stages/src/stages/execution/mod.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe98cfd57ed86e8d703665ee14d80d04308eb819b6f5d34411e8fe2ed81a386d"}},{"ruleId":"D1","level":"warning","message":{"text":"DatabaseProvider::take_state_above (cyclomatic 24): DatabaseProvider::take_state_above 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":"crates/storage/provider/src/providers/database/provider.rs"},"region":{"startLine":3076}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce63e1419caa1663436da1ae01b9bd369b8fadedadf27aba28cf46790408c79f"}},{"ruleId":"D1","level":"warning","message":{"text":"inject-cargo-docs.injectCargoDocs (cyclomatic 24): inject-cargo-docs.injectCargoDocs has cyclomatic complexity 24 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 6 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/vocs/scripts/inject-cargo-docs.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"59fc931ab031dfb3a1e3b1b5c7af59e620deb68f8380603107c9b510a6a38b26"}},{"ruleId":"D1","level":"warning","message":{"text":"BasicEngineValidator::validate_block_with_state (cyclomatic 23): BasicEngineValidator::validate_block_with_state has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/tree/src/tree/payload_validator.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f84fddad55a73d38e72fce814b2ebf8a4eb7c87b26cd9952e13b8e1d95a3378"}},{"ruleId":"D1","level":"warning","message":{"text":"P2PStream::poll_next (cyclomatic 23): P2PStream::poll_next 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":"crates/net/eth-wire/src/p2pstream.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"f21e82b25a417b929a8982a834b25e93401b4249b670308b07f2a58eb7135c0a"}},{"ruleId":"D1","level":"warning","message":{"text":"NetworkManager::on_swarm_event (cyclomatic 23): NetworkManager::on_swarm_event 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":"crates/net/network/src/manager.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d16bc7882a241d5e2def75e74547f657f257252667335c6d7ed3311e32aa207"}},{"ruleId":"D1","level":"warning","message":{"text":"EthFees::fee_history (cyclomatic 23): EthFees::fee_history 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":"crates/rpc/rpc-eth-api/src/helpers/fee.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"3684fd0b78b8cd6cddf26838a81679c1cc140d7f61bfd99f7769cec30e652fed"}},{"ruleId":"D1","level":"warning","message":{"text":"DatabaseProvider::save_blocks_inner (cyclomatic 23): DatabaseProvider::save_blocks_inner has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/database/provider.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e70426e334026eb4848229cff85a95439198d031785442974c593040e5e255"}},{"ruleId":"D1","level":"warning","message":{"text":"ArchiveFetcher::download_sequential (cyclomatic 22): ArchiveFetcher::download_sequential 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":"crates/cli/commands/src/download/fetch.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b8feaf21ad84305d2454cfde522610a4d66d7168920f584e34e5c2dc3fc75a"}},{"ruleId":"D1","level":"warning","message":{"text":"Command::execute (cyclomatic 22): Command::execute 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":"crates/cli/commands/src/stage/run.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"c76d81b6f92b1ed5058ebf3949f2d35098011ccbeda9c57bc3bc9060af4719c0"}},{"ruleId":"D1","level":"warning","message":{"text":"RlpxSatelliteStream::poll_next (cyclomatic 22): RlpxSatelliteStream::poll_next 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":"crates/net/eth-wire/src/multiplex.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"4723151c12361a39d72a3b63971206f908787c640d23700368164a1f371c2e51"}},{"ruleId":"D1","level":"warning","message":{"text":"EthStatsService::run (cyclomatic 22): EthStatsService::run 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":"crates/node/ethstats/src/ethstats.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"382585cfe29768c3ede5ca42fecdd36b1f6cb9880a431673a2d1cf213061256b"}},{"ruleId":"D1","level":"warning","message":{"text":"bench-call-summary.build_summary (cyclomatic 22): bench-call-summary.build_summary 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":".github/scripts/bench-call-summary.py"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"866d451a1257c0d629a1db0dbfd8d22fc9d52fdf421987f4a5ac7f0de2e94c5d"}},{"ruleId":"D1","level":"warning","message":{"text":"bench-reth-summary.compute_target_metric_summary (cyclomatic 22): bench-reth-summary.compute_target_metric_summary 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":".github/scripts/bench-reth-summary.py"},"region":{"startLine":1517}}}],"partialFingerprints":{"codehealthFindingId/v1":"73295c13922bb57a6b11ef285e9ce437c9a809332f1d13976ff54096e4724f9e"}},{"ruleId":"D1","level":"warning","message":{"text":"Command::execute (cyclomatic 21): Command::execute 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":"crates/cli/commands/src/db/get.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b49b3810dcbf0ffa49220c3c35cb8e2172441483ff13164df9c82a982412f6"}},{"ruleId":"D1","level":"warning","message":{"text":"DownloadCommand::resolve_components (cyclomatic 21): DownloadCommand::resolve_components 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":"crates/cli/commands/src/download/mod.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cbaa871088da679919d3294534fa3b2325d29ea15c92ed94085379c8d92dd5d"}},{"ruleId":"D1","level":"warning","message":{"text":"reth_cli_commands::db::tui::handle_event (cyclomatic 21): reth_cli_commands::db::tui::handle_event has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/tui.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d355fbe403ca775bdcc2f02497adce1420e1beb6fb52668ea44ba046caf73b7"}},{"ruleId":"D1","level":"warning","message":{"text":"EngineApiTreeHandler::on_engine_message (cyclomatic 21): EngineApiTreeHandler::on_engine_message 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":"crates/engine/tree/src/tree/mod.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b352ddca41005450b385ee37fdcf19afd1ea8473889da5ba279be94f7d6c02e"}},{"ruleId":"D1","level":"warning","message":{"text":"ReverseHeadersDownloader::poll_next (cyclomatic 21): ReverseHeadersDownloader::poll_next 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":"crates/net/downloaders/src/headers/reverse_headers.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"377e0fac55041f6c116a935185d2af67e500eb00e3a94dbe4f854ccaf56932d2"}},{"ruleId":"D1","level":"warning","message":{"text":"Discovery::new (cyclomatic 21): Discovery::new 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":"crates/net/network/src/discovery.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf3350247037c67a15c81d70e5ba8cddfa041ffef40a3829b28ff741f8c1828"}},{"ruleId":"D1","level":"warning","message":{"text":"PeerResponse::poll (cyclomatic 21): PeerResponse::poll has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This shape REPEATS in the file: one other method here (PeerResponseResult::try_into_message) 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":"crates/net/network/src/message.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2264392f5017e475fed1fce353018b66372d14077d94c773d48690792a3fe98"}},{"ruleId":"D1","level":"warning","message":{"text":"PeerResponseResult::try_into_message (cyclomatic 21): PeerResponseResult::try_into_message has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This shape REPEATS in the file: one other method here (PeerResponse::poll) 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":"crates/net/network/src/message.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48ad4c9ec5fb99bdc7435f89144ab1c86e39b3d1f3650fb1448b10f10962bfd"}},{"ruleId":"D1","level":"warning","message":{"text":"reth_payload_primitives::validate_payload_timestamp (cyclomatic 21): reth_payload_primitives::validate_payload_timestamp has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/payload/primitives/src/lib.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f2d9a0089ce8fe5856d4e9d0d88851fee3932e319b611cb02b36299b4f434b"}},{"ruleId":"D1","level":"warning","message":{"text":"EthPubSub::handle_accepted (cyclomatic 21): EthPubSub::handle_accepted has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc/src/eth/pubsub.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"4651296a4756078be6925b1f2369d8aa0baa08171293b0b3b3060247f5d86a7f"}},{"ruleId":"D1","level":"warning","message":{"text":"EthBundle::call_bundle (cyclomatic 20): EthBundle::call_bundle 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":"crates/rpc/rpc/src/eth/bundle.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"7953f24da371d3f392912521146274d7231cb4617a0531bab76f05a988dab490"}},{"ruleId":"D1","level":"warning","message":{"text":"EthCall::simulate_v1 (cyclomatic 20): EthCall::simulate_v1 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":"crates/rpc/rpc-eth-api/src/helpers/call.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"761c04eb192c137ed430ed0585be27eecaa3ff2abdbbe400610a4b1a35439512"}},{"ruleId":"D1","level":"warning","message":{"text":"DecodedMultiProofV2::from_witness_with (cyclomatic 20): DecodedMultiProofV2::from_witness_with 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":"crates/trie/common/src/proofs.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd7b241441f60e27d4c9f8e165eea73a1cb01ff2a160c0b59799b213fb4c30fa"}},{"ruleId":"D1","level":"warning","message":{"text":"EngineNodeLauncher::launch_node (cyclomatic 19): EngineNodeLauncher::launch_node 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":"crates/node/builder/src/launch/engine.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c2e0c2be5748aee078f1dc2a0ac2fc0fdd8c5764f1cea08886a5fdbc333626"}},{"ruleId":"D1","level":"warning","message":{"text":"DebugApi::debug_subscribe (cyclomatic 19): DebugApi::debug_subscribe has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc/src/debug.rs"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba2905f69b17b6a086df0ee5290957c7ddaa421cedef6b1c1c2da9445e71bcc"}},{"ruleId":"D1","level":"warning","message":{"text":"reth_rpc_eth_types::cache::db::apply_state_overrides_with_state (cyclomatic 19): reth_rpc_eth_types::cache::db::apply_state_overrides_with_state 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":"crates/rpc/rpc-eth-types/src/cache/db.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f2d2091d0fbad9359bd4663e94622ae765937026b266bfc72b41345b7fe852a"}},{"ruleId":"D1","level":"warning","message":{"text":"SnapBootstrap::run (cyclomatic 19): SnapBootstrap::run has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/snap-sync/src/bootstrap.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea541ab6ea91166d96a84ba0d56a922e0d8607d57ae6064582abbdd281a033c"}},{"ruleId":"D1","level":"warning","message":{"text":"DatabaseProvider::remove_state_above (cyclomatic 19): DatabaseProvider::remove_state_above 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":"crates/storage/provider/src/providers/database/provider.rs"},"region":{"startLine":2938}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fad088e3347f12ddf1543c644d8b33edf7095df7f562b72f68a757073a6be5a"}},{"ruleId":"D1","level":"warning","message":{"text":"AllTransactions::update_txs (cyclomatic 19): AllTransactions::update_txs 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":"crates/transaction-pool/src/pool/txpool.rs"},"region":{"startLine":1640}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1fe700c004c60da5cce1f6b51ac833fd647d2d5018c52d9f5f2de3b55a6894"}},{"ruleId":"D1","level":"warning","message":{"text":"ArenaParallelSparseTrie::reveal_nodes (cyclomatic 19): ArenaParallelSparseTrie::reveal_nodes 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":"crates/trie/sparse/src/arena/mod.rs"},"region":{"startLine":2341}}}],"partialFingerprints":{"codehealthFindingId/v1":"7943b80936eeb1bd9fff862e3e34f056f8dab1689f1d553f18f535d05ce76477"}},{"ruleId":"D1","level":"warning","message":{"text":"ProofCalculator::next_uncached_key_range (cyclomatic 19): ProofCalculator::next_uncached_key_range 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":"crates/trie/trie/src/proof_v2/calculator.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"7453669781633e3d14224b42ea63418a60d9e6231d236b7532d78de1ae4e0c42"}},{"ruleId":"D1","level":"warning","message":{"text":"PrewarmCacheTask::transact_worker (cyclomatic 18): PrewarmCacheTask::transact_worker 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":"crates/engine/tree/src/tree/payload_processor/prewarm.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8584595a73981cb614978c4818eb95506d5a7fe198c44c55d930921722052f"}},{"ruleId":"D1","level":"warning","message":{"text":"Discv4Service::on_neighbours (cyclomatic 18): Discv4Service::on_neighbours 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":"crates/net/discv4/src/lib.rs"},"region":{"startLine":1530}}}],"partialFingerprints":{"codehealthFindingId/v1":"6354d019d7c367607e18012e5d3858f6f5f4d0b746c7b916d1c102c679574762"}},{"ruleId":"D1","level":"warning","message":{"text":"PeersManager::poll (cyclomatic 18): PeersManager::poll 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":"crates/net/network/src/peers.rs"},"region":{"startLine":1388}}}],"partialFingerprints":{"codehealthFindingId/v1":"496ba7c35c915cd4df2a96b6f9003511932e1a9e10e3954d8c014216de575aa5"}},{"ruleId":"D1","level":"warning","message":{"text":"TransactionsManager::on_new_pooled_transaction_hashes (cyclomatic 18): TransactionsManager::on_new_pooled_transaction_hashes 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":"crates/net/network/src/transactions/mod.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"004e57ead093e6dc7429cbeb57d42e0e46b3fd8e985f53a774a22a979200b011"}},{"ruleId":"D1","level":"warning","message":{"text":"EthFilterInner::logs_for_filter (cyclomatic 18): EthFilterInner::logs_for_filter 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":"crates/rpc/rpc/src/eth/filter.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"1275469cb61c244479ddbf5d56565fa7c1728a3554a679a002aac928baee1b07"}},{"ruleId":"D1","level":"warning","message":{"text":"EthSimBundle::sim_bundle_inner (cyclomatic 18): EthSimBundle::sim_bundle_inner 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":"crates/rpc/rpc/src/eth/sim_bundle.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af999c22f593d250efe12a10b3ef2a70026fc8457c71cc983a5a260323b3c7f"}},{"ruleId":"D1","level":"warning","message":{"text":"reth_rpc_eth_types::simulate::execute_transactions (cyclomatic 18): reth_rpc_eth_types::simulate::execute_transactions 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":"crates/rpc/rpc-eth-types/src/simulate.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc8c0cf233c598fc130d442e835eb92c5b2d042784b6300f5e06af872e3071d"}},{"ruleId":"D1","level":"warning","message":{"text":"StorageHashingStage::execute (cyclomatic 18): StorageHashingStage::execute 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":"crates/stages/stages/src/stages/hashing_storage.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"afaad90096606847aad1ca978c65107873fe0a4875afdbf5b5d075e7b1125ef8"}},{"ruleId":"D1","level":"warning","message":{"text":"DatabaseEnv::open (cyclomatic 18): DatabaseEnv::open has cyclomatic complexity 18 (threshold 15). Of this number, 15 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":"crates/storage/db/src/implementation/mdbx/mod.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"4085f09929f640b6ef6399c291ea23bdbf3aa811a9d2443a0299789447f648da"}},{"ruleId":"D1","level":"warning","message":{"text":"ArenaParallelSparseTrie::update_subtrie_hashes (cyclomatic 18): ArenaParallelSparseTrie::update_subtrie_hashes 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":"crates/trie/sparse/src/arena/mod.rs"},"region":{"startLine":2507}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c5494fee32c33cdc838e359555f108e8d6d1697eb8258c390a552b69a422f9"}},{"ruleId":"D1","level":"warning","message":{"text":"ArenaParallelSparseTrie::prune (cyclomatic 18): ArenaParallelSparseTrie::prune 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":"crates/trie/sparse/src/arena/mod.rs"},"region":{"startLine":2642}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab84d15ea6bfbae9fa5b5470674ee36557fb8302ec4f364039b55ddbd29300c3"}},{"ruleId":"D1","level":"warning","message":{"text":"StateRoot::calculate (cyclomatic 18): StateRoot::calculate 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":"crates/trie/trie/src/trie.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"883c19985357100360e0f63b94d87fcb8f3ef5fb4100663195766b841bf6ef8d"}},{"ruleId":"D1","level":"warning","message":{"text":"bench-call-summary.run_stats (cyclomatic 18): bench-call-summary.run_stats 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":".github/scripts/bench-call-summary.py"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b94b22d59c839678420c6cb6a832d2363344049668b7572048ef62d2248c45"}},{"ruleId":"D1","level":"warning","message":{"text":"bench-call-summary.generate_markdown (cyclomatic 18): bench-call-summary.generate_markdown 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":".github/scripts/bench-call-summary.py"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"548bc2bd288f9d60cd362da733b388201a4842c4830364e08d4ba45df06afdf2"}},{"ruleId":"D1","level":"warning","message":{"text":"PrewarmedTx::validate (cyclomatic 17): PrewarmedTx::validate 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":"crates/engine/tree/src/tree/payload_processor/reuse.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"92f7538d7040e8e45f0e60b5b85fd664761c12cd02233838c5ab8db6d77001a7"}},{"ruleId":"D1","level":"warning","message":{"text":"Discv4Service::on_ping (cyclomatic 17): Discv4Service::on_ping 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":"crates/net/discv4/src/lib.rs"},"region":{"startLine":1197}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec7dcf6fb57f3df9367425d00f6c95947b6cde56e93f0a768bd4b48418857c4"}},{"ruleId":"D1","level":"warning","message":{"text":"DnsDiscoveryService::poll (cyclomatic 17): DnsDiscoveryService::poll has cyclomatic complexity 17 (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":"crates/net/dns/src/lib.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"b16dd0f8f6a069887a24d3589eb638ca501eef16dfa0592bbaa2e4c2dc192049"}},{"ruleId":"D1","level":"warning","message":{"text":"LaunchContextWith::create_provider_factory_with_recovery (cyclomatic 17): LaunchContextWith::create_provider_factory_with_recovery 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":"crates/node/builder/src/launch/common.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"af6f9c6437f62a2cc833f01843955d669911fdad897087aefb61b93762a5ba11"}},{"ruleId":"D1","level":"warning","message":{"text":"EthSimBundle::parse_and_flatten_bundle (cyclomatic 17): EthSimBundle::parse_and_flatten_bundle 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":"crates/rpc/rpc/src/eth/sim_bundle.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"410e77b6f4523778a291fb6ef3f5a09926ba3d75b8bd6b6b321d79702c837614"}},{"ruleId":"D1","level":"warning","message":{"text":"LoadPendingBlock::build_block (cyclomatic 17): LoadPendingBlock::build_block 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":"crates/rpc/rpc-eth-api/src/helpers/pending_block.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"257ad0a5289b35d783160bf0e5de37127cdae1c7f254535c589e55b7ea1bae01"}},{"ruleId":"D1","level":"warning","message":{"text":"AccountHashingStage::execute (cyclomatic 17): AccountHashingStage::execute 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":"crates/stages/stages/src/stages/hashing_account.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"96db66ba10b19f51e17c8d0b8eb02133f1cf037a9a62a605759233e7dbbc2548"}},{"ruleId":"D1","level":"warning","message":{"text":"EnvironmentBuilder::open_with_permissions (cyclomatic 17): EnvironmentBuilder::open_with_permissions 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":"crates/storage/libmdbx-rs/src/environment.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"bedfa5b48bedd2924b4e8a57c2016f3ae065df450c9107febf2d1b67ddc5e842"}},{"ruleId":"D1","level":"warning","message":{"text":"AllTransactions::insert_tx (cyclomatic 17): AllTransactions::insert_tx 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":"crates/transaction-pool/src/pool/txpool.rs"},"region":{"startLine":2119}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60a66755ae9bbfc1b7fb5fe260a4c9cf14a084fb499f9b82891ba62164d35c4"}},{"ruleId":"D1","level":"warning","message":{"text":"bench-reth-summary.compute_target_metric_change (cyclomatic 17): bench-reth-summary.compute_target_metric_change 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":".github/scripts/bench-reth-summary.py"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ea1f833cdb088563ee7992ef3cb00ec50adecdc741b82fdb6e400664a0822f"}},{"ruleId":"D1","level":"warning","message":{"text":"StartingStream::poll_next (cyclomatic 16): StartingStream::poll_next 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":"crates/era-downloader/src/stream.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"0888222a55ea443750a8329cffc9eda8ea9b66f0d0f1b931d29108f35fa5653e"}},{"ruleId":"D1","level":"warning","message":{"text":"reth_ethereum_consensus::validation::validate_block_post_execution_with_bal_hashes (cyclomatic 16): reth_ethereum_consensus::validation::validate_block_post_execution_with_bal_hashes 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":"crates/ethereum/consensus/src/validation.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee6cdcddc37d89ea795678229aa9ac6f3f9f3e0eb0276416f243e3aff0a47b51"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionManager::poll_pending_session_event (cyclomatic 16): SessionManager::poll_pending_session_event 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":"crates/net/network/src/session/mod.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"13fe199f481579ea753e849e0e703aba8636fbd58abb556c916a1bbc843d116f"}},{"ruleId":"D1","level":"warning","message":{"text":"TransactionsManager::propagate_transactions (cyclomatic 16): TransactionsManager::propagate_transactions 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":"crates/net/network/src/transactions/mod.rs"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"40029c5430abcdc154ba2299ee3427ca3893b6ae85a5e62e1159b6e43085866d"}},{"ruleId":"D1","level":"warning","message":{"text":"PayloadBuilderService::poll (cyclomatic 16): PayloadBuilderService::poll 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":"crates/payload/builder/src/service.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ed3fb9fd41961761c892de8d206de3a31e7bfb2c7e7b1f1b8568d3ca6617f6"}},{"ruleId":"D1","level":"warning","message":{"text":"reth_rpc_eth_types::simulate::resolve_transaction_with_account (cyclomatic 16): reth_rpc_eth_types::simulate::resolve_transaction_with_account 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":"crates/rpc/rpc-eth-types/src/simulate.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bacddc8b3059ae71b5137b83b4778a95885cc94b31aafdcd948faf0be343d5c"}},{"ruleId":"D1","level":"warning","message":{"text":"Pipeline::unwind_stages (cyclomatic 16): Pipeline::unwind_stages 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":"crates/stages/api/src/pipeline/mod.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b05dc48302eeeea96966727515fafa8af338856726f444e39d007b3f1cf2dbd"}},{"ruleId":"D1","level":"warning","message":{"text":"reth_db_common::init::init_genesis_with_settings_and_validate (cyclomatic 16): reth_db_common::init::init_genesis_with_settings_and_validate 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":"crates/storage/db-common/src/init.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1dde217082de030a8631b3e7004be6b4ee68661c7bde7701fdf66d3c05bde2"}},{"ruleId":"D1","level":"warning","message":{"text":"StaticFileProvider::ensure_invariants (cyclomatic 16): StaticFileProvider::ensure_invariants 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":"crates/storage/provider/src/providers/static_file/manager.rs"},"region":{"startLine":1735}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a5565b5b23441563298af9390f607fa695893c5eda03a5c619d3fcf59a531e0"}},{"ruleId":"D1","level":"warning","message":{"text":"OverlayManager::get_or_compute_overlay (cyclomatic 16): OverlayManager::get_or_compute_overlay has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/storage-overlay/src/manager.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59f7c905f0841f340e0b4409d60f605dbc77d8ceb6cda3453fbf1e55c8125b4"}},{"ruleId":"D1","level":"warning","message":{"text":"ArenaCursor::seek (cyclomatic 16): ArenaCursor::seek 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":"crates/trie/sparse/src/arena/cursor.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d54361f925fc7cd7e22bb5b17233071591e0aa30f91c2edc108fd803c6186e6"}},{"ruleId":"D1","level":"warning","message":{"text":"bench-reth-summary.generate_comparison_table (cyclomatic 16): bench-reth-summary.generate_comparison_table 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":".github/scripts/bench-reth-summary.py"},"region":{"startLine":1733}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e5beb1c42cc32b3153c34a6389eb34282dc1b779fb088bf3a139a3f1c70650"}},{"ruleId":"D2","level":"warning","message":{"text":"reth_transaction_pool::maintain::maintain_transaction_pool (cognitive 116): reth_transaction_pool::maintain::maintain_transaction_pool has cognitive complexity 116 (threshold 15). Drivers by points: if/else 25 (85 pts), loops 5 (17 pts), match/switch 4 (9 pts), boolean chains 5 (nesting depth added 77). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/maintain.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3eb2d3c90c95fe18fc6338aa04d8c70ab045a67c0237331583fc60cf3331159"}},{"ruleId":"D2","level":"warning","message":{"text":"Command::execute (cognitive 102): Command::execute has cognitive complexity 102 (threshold 15). Drivers by points: if/else 24 (80 pts), loops 5 (12 pts), match/switch 3 (9 pts), boolean chains 1 (nesting depth added 69). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/re_execute.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa13e55f552398390b8f53537c84cd3ebe8ebf6342b39db22445cd5ae0b5c100"}},{"ruleId":"D2","level":"warning","message":{"text":"ActiveSession::poll (cognitive 90): ActiveSession::poll has cognitive complexity 90 (threshold 15). Drivers by points: match/switch 11 (37 pts), if/else 15 (36 pts), loops 8 (15 pts), boolean chains 2 (nesting depth added 54). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/session/active.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda0bf750b7de999cfb7a1eab91ef8a86d52cb05e8f9badb65d3970f4a1bf112"}},{"ruleId":"D2","level":"warning","message":{"text":"ActiveSession::on_incoming_message (cognitive 66): ActiveSession::on_incoming_message has cognitive complexity 66 (threshold 15). Drivers by points: if/else 25 (36 pts), match/switch 11 (30 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/session/active.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"6197ba6f4a27ebac84b3e6177ab7ac827e50a996ca49025c43923538ca5b84a8"}},{"ruleId":"D2","level":"warning","message":{"text":"bench-benchmarkoor-summary.main (cognitive 64): bench-benchmarkoor-summary.main has cognitive complexity 64 (threshold 15). Drivers by points: if/else 18 (25 pts), boolean chains 16, ternaries 5 (14 pts), loops 7 (9 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/bench-benchmarkoor-summary.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"acfdbae40d550da1df89037a6a3d2f9550f8a8593c1d1101fec5ceeae91bbd17"}},{"ruleId":"D2","level":"warning","message":{"text":"ArenaParallelSparseTrie::update_leaves (cognitive 63): ArenaParallelSparseTrie::update_leaves has cognitive complexity 63 (threshold 15). Drivers by points: if/else 11 (25 pts), match/switch 6 (18 pts), loops 7 (16 pts), boolean chains 4 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/sparse/src/arena/mod.rs"},"region":{"startLine":2776}}}],"partialFingerprints":{"codehealthFindingId/v1":"32911f883321072f197601b5917e64a3a28a815193f5d27d929b2696f4e3480f"}},{"ruleId":"D2","level":"warning","message":{"text":"reth_ethereum_payload_builder::default_ethereum_payload (cognitive 62): reth_ethereum_payload_builder::default_ethereum_payload has cognitive complexity 62 (threshold 15). Drivers by points: if/else 29 (51 pts), match/switch 3 (7 pts), boolean chains 3, loops 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ethereum/payload/src/lib.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e540473e0049bb5a96e814c8ab0e2cd29c00237e0e8bd42fabfc57e0f05e17c"}},{"ruleId":"D2","level":"warning","message":{"text":"AllTransactions::update_txs (cognitive 59): AllTransactions::update_txs has cognitive complexity 59 (threshold 15). Drivers by points: if/else 18 (47 pts), loops 5 (12 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/pool/txpool.rs"},"region":{"startLine":1640}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fde7d22d24d85c8e3a39ee163b63994e347d5b6cdd70c5bd3142da12d3364e0"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamCodec::decode (cognitive 58): StreamCodec::decode has cognitive complexity 58 (threshold 15). Drivers by points: if/else 19 (41 pts), boolean chains 8, match/switch 2 (7 pts), loops 1 (2 pts) (nesting depth added 28). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/ipc/src/stream_codec.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"1238256ab5985b67ce8f9f18f686865e1f87c4883cd2ef6c6801fd78716a2fc2"}},{"ruleId":"D2","level":"warning","message":{"text":"IpcConnDriver::poll (cognitive 57): IpcConnDriver::poll has cognitive complexity 57 (threshold 15). Drivers by points: if/else 11 (30 pts), match/switch 5 (18 pts), loops 4 (7 pts), boolean chains 2 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/ipc/src/server/connection.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"376e83944e471f95c0d366256f49068d79b9f1c5ed36c459f31e5979d7f3a1f9"}},{"ruleId":"D2","level":"warning","message":{"text":"EthStateCacheService::poll (cognitive 57): EthStateCacheService::poll has cognitive complexity 57 (threshold 15). Drivers by points: if/else 9 (29 pts), loops 7 (22 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc-eth-types/src/cache/mod.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2035d7d5b41d5e373d0b2e27dd7db8f00f67d6de443e3c508fd07648f8aaf68"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseProvider::take_state_above (cognitive 57): DatabaseProvider::take_state_above has cognitive complexity 57 (threshold 15). Drivers by points: if/else 18 (42 pts), loops 6 (13 pts), boolean chains 2 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/database/provider.rs"},"region":{"startLine":3076}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb700678264f8f6b8e61fed2c8ba62f13fb4e34ac2008b54571bd7e53f1c1545"}},{"ruleId":"D2","level":"warning","message":{"text":"EngineApiTreeHandler::on_engine_message (cognitive 56): EngineApiTreeHandler::on_engine_message has cognitive complexity 56 (threshold 15). Drivers by points: if/else 14 (45 pts), match/switch 5 (11 pts) (nesting depth added 37). 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":"crates/engine/tree/src/tree/mod.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9183b9f6ea2b2024394827607dfd2458a25c4bac809377c791491f56a51527c"}},{"ruleId":"D2","level":"warning","message":{"text":"ArenaParallelSparseTrie::update_cached_rlp (cognitive 56): ArenaParallelSparseTrie::update_cached_rlp has cognitive complexity 56 (threshold 15). Drivers by points: if/else 14 (39 pts), match/switch 5 (12 pts), loops 2 (3 pts), boolean chains 2 (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":"crates/trie/sparse/src/arena/mod.rs"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3618f499e76868e31ceba3aeb2b4e6533e3aed3053de4390453eca5f4901215"}},{"ruleId":"D2","level":"warning","message":{"text":"Discv4Service::poll (cognitive 54): Discv4Service::poll has cognitive complexity 54 (threshold 15). Drivers by points: if/else 11 (30 pts), loops 7 (14 pts), match/switch 3 (10 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":"crates/net/discv4/src/lib.rs"},"region":{"startLine":1891}}}],"partialFingerprints":{"codehealthFindingId/v1":"392d06c918e21d953cb077bcd45945fe7df807b9809cc6592b44898ac9c15293"}},{"ruleId":"D2","level":"warning","message":{"text":"DecodedMultiProofV2::from_witness_with (cognitive 52): DecodedMultiProofV2::from_witness_with has cognitive complexity 52 (threshold 15). Drivers by points: if/else 15 (44 pts), loops 3 (5 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/common/src/proofs.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"781365d80a89aec07bb9f54fa143017b6ce954963e0ef78f41c8667fd7c9080a"}},{"ruleId":"D2","level":"warning","message":{"text":"reth_node_ethereum::engine_ssz_proxy::handle_engine_ssz_request (cognitive 51): reth_node_ethereum::engine_ssz_proxy::handle_engine_ssz_request has cognitive complexity 51 (threshold 15). Drivers by points: if/else 20 (38 pts), match/switch 8 (13 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ethereum/node/src/engine_ssz_proxy.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6448f0d3305814e27c6d83baa11deed965d1d9fa7534a4bf3cfd411524cd29"}},{"ruleId":"D2","level":"warning","message":{"text":"TrieWitness::compute (cognitive 51): TrieWitness::compute has cognitive complexity 51 (threshold 15). Drivers by points: if/else 21 (34 pts), loops 8 (13 pts), boolean chains 4 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/trie/src/witness.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab62bf9633348199e3b8f96fa06d3c209e25f45ac5e472f2b6f9a0f1465783e5"}},{"ruleId":"D2","level":"warning","message":{"text":"bench-reth-summary.compute_target_metric_summary (cognitive 51): bench-reth-summary.compute_target_metric_summary has cognitive complexity 51 (threshold 15). Drivers by points: loops 12 (32 pts), if/else 8 (18 pts), boolean chains 1 (nesting depth added 30). 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":".github/scripts/bench-reth-summary.py"},"region":{"startLine":1517}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e371776ba811303f9bbae731e1b40d4a17ab681025e94b3db3d62f2e453948"}},{"ruleId":"D2","level":"warning","message":{"text":"TransactionFetcher::on_announcement (cognitive 49): TransactionFetcher::on_announcement has cognitive complexity 49 (threshold 15). Drivers by points: if/else 20 (41 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/transactions/fetcher.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b2f527e52a01b1fdddebb39d8ed71a6bbd155c4ff88181e48996828709c0bd"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseProvider::remove_state_above (cognitive 49): DatabaseProvider::remove_state_above has cognitive complexity 49 (threshold 15). Drivers by points: if/else 17 (39 pts), loops 4 (10 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/database/provider.rs"},"region":{"startLine":2938}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad865fc075f06025068853f4ca309d83b729339236422895dd7d347b6b4e1c2"}},{"ruleId":"D2","level":"warning","message":{"text":"EthStatsService::run (cognitive 48): EthStatsService::run has cognitive complexity 48 (threshold 15). Drivers by points: if/else 11 (32 pts), match/switch 4 (13 pts), loops 3 (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":"crates/node/ethstats/src/ethstats.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"750ba3dba628016490d2abe19ebe17ad229be420ca54b363448e4b88cd844675"}},{"ruleId":"D2","level":"warning","message":{"text":"ArchiveFetcher::download_sequential (cognitive 45): ArchiveFetcher::download_sequential has cognitive complexity 45 (threshold 15). Drivers by points: if/else 19 (38 pts), boolean chains 4, 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":"crates/cli/commands/src/download/fetch.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b9e9ff4455d4eda002eb06c4b0207d0518a8c34b25bd510d1e6dd17df032ff"}},{"ruleId":"D2","level":"warning","message":{"text":"EthSimBundle::parse_and_flatten_bundle (cognitive 44): EthSimBundle::parse_and_flatten_bundle has cognitive complexity 44 (threshold 15). Drivers by points: if/else 9 (29 pts), loops 4 (11 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc/src/eth/sim_bundle.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"a833a7d8906071a6c067ec226567eecd9f96c95086b6d195f7852b6b0e1a469c"}},{"ruleId":"D2","level":"warning","message":{"text":"Discovery::new (cognitive 43): Discovery::new has cognitive complexity 43 (threshold 15). Drivers by points: if/else 18 (31 pts), match/switch 4 (7 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/discovery.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e40dbfc29b33b2043de94701d8583ac13de5bf065607e0f53a498b5d8773f9"}},{"ruleId":"D2","level":"warning","message":{"text":"NetworkState::poll (cognitive 42): NetworkState::poll has cognitive complexity 42 (threshold 15). Drivers by points: loops 8 (18 pts), if/else 6 (17 pts), match/switch 2 (7 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/state.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"0894b66c2d145d8ba96ad54118d258a95847df0f19e81052fd615a8dd781eb0b"}},{"ruleId":"D2","level":"warning","message":{"text":"EthFilterInner::logs_for_filter (cognitive 41): EthFilterInner::logs_for_filter has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (34 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 22). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc/src/eth/filter.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aa8b0a6a072904043101926976c46b42b390b07b3cba6e17648aeb4d117e992"}},{"ruleId":"D2","level":"warning","message":{"text":"LoadPendingBlock::build_block (cognitive 41): LoadPendingBlock::build_block has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (35 pts), match/switch 1 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc-eth-api/src/helpers/pending_block.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"da14486cc35656cba63f6d6d4724a34f10ea825d1099878d7dfd6e2b458f0333"}},{"ruleId":"D2","level":"warning","message":{"text":"EthTransactionValidator::validate_stateless (cognitive 41): EthTransactionValidator::validate_stateless has cognitive complexity 41 (threshold 15). Drivers by points: if/else 24 (33 pts), boolean chains 5, match/switch 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":"crates/transaction-pool/src/validate/eth.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b8b28041b503b8f711bc4f3a6c7c5b5cdfe9d297187d42ffd572fde1e484ca8"}},{"ruleId":"D2","level":"warning","message":{"text":"ArenaParallelSparseTrie::prune (cognitive 41): ArenaParallelSparseTrie::prune has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (36 pts), loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/sparse/src/arena/mod.rs"},"region":{"startLine":2642}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a38b055c23731f8dfff9001bfcacbfe938ce8af4bd53bc3ccae17a44d24c82"}},{"ruleId":"D2","level":"warning","message":{"text":"ReverseHeadersDownloader::poll_next (cognitive 39): ReverseHeadersDownloader::poll_next has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (23 pts), match/switch 3 (8 pts), loops 4 (6 pts), boolean chains 2 (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":"crates/net/downloaders/src/headers/reverse_headers.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"de93e93a9d377d9b43ce518d76012fcd8169ad6f2a54edb279004e2b6de7d14a"}},{"ruleId":"D2","level":"warning","message":{"text":"TransactionsManager::propagate_transactions (cognitive 39): TransactionsManager::propagate_transactions has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 6 (17 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/transactions/mod.rs"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b4ca286c6f6f429c5dcdf9a4d02aef3f29623526cd4e3f82584b89d31e0a8b"}},{"ruleId":"D2","level":"warning","message":{"text":"PayloadProcessor::spawn_tx_iterator (cognitive 38): PayloadProcessor::spawn_tx_iterator has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (30 pts), loops 2 (7 pts), boolean chains 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/tree/src/tree/payload_processor/mod.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef68457fc41d689f7349242f1e475bc0322646ef13b8de3770c9ec5e485ec2a"}},{"ruleId":"D2","level":"warning","message":{"text":"EthFees::fee_history (cognitive 38): EthFees::fee_history has cognitive complexity 38 (threshold 15). Drivers by points: if/else 18 (24 pts), loops 4 (11 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":"crates/rpc/rpc-eth-api/src/helpers/fee.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0d0d2dd19847276caec1dc0c95c695e3adf90f1d34f0607a52bfd2d6243805"}},{"ruleId":"D2","level":"warning","message":{"text":"ExecutionStage::execute (cognitive 38): ExecutionStage::execute has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (31 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stages/stages/src/stages/execution/mod.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a6aa964251968562096bc8e9813fbd8b219f9e001d087e9232077604946b7ac"}},{"ruleId":"D2","level":"warning","message":{"text":"StateRoot::calculate (cognitive 38): StateRoot::calculate has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (29 pts), match/switch 2 (4 pts), loops 2 (3 pts), boolean chains 2 (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":"crates/trie/trie/src/trie.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5390060a386c6ff7ef801c08237717fe88308cbed66000a2a3abf904619ae5"}},{"ruleId":"D2","level":"warning","message":{"text":"PeersManager::on_connection_failure (cognitive 37): PeersManager::on_connection_failure has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (34 pts), boolean chains 3 (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/peers.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba5b1e8a52be5c58703428a6fe7441e3bee46bb042d6d4aac3d175c929f49125"}},{"ruleId":"D2","level":"warning","message":{"text":"reth_rpc::reth::finalized_chain_notifications (cognitive 37): reth_rpc::reth::finalized_chain_notifications has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (28 pts), match/switch 3 (8 pts), loops 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc/src/reth.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"053ed52d277766a0c4b1e852d0a5689a70bbd943ce9f9b9213919fc413f0456b"}},{"ruleId":"D2","level":"warning","message":{"text":"reth_rpc_eth_types::simulate::execute_transactions (cognitive 37): reth_rpc_eth_types::simulate::execute_transactions has cognitive complexity 37 (threshold 15). Drivers by points: if/else 17 (33 pts), boolean chains 3, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc-eth-types/src/simulate.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"978010b71306f13ac189acfb07aab82d95343248cce24ac6954ed8bb281b310a"}},{"ruleId":"D2","level":"warning","message":{"text":"P2PStream::poll_next (cognitive 36): P2PStream::poll_next has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (26 pts), boolean chains 5, match/switch 2 (4 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/eth-wire/src/p2pstream.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"adbc81a50f620ed6db290f63f0848a314f29fbe5a2788ba97a3dd4d18b1974f7"}},{"ruleId":"D2","level":"warning","message":{"text":"ProofCalculator::next_uncached_key_range (cognitive 36): ProofCalculator::next_uncached_key_range has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (29 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/trie/src/proof_v2/calculator.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"e67cbb4bd4964dc6ead4c2b1fc61ff520aef93d8af53ca580c6f2bfc7d386799"}},{"ruleId":"D2","level":"warning","message":{"text":"Discv4Service::on_neighbours (cognitive 35): Discv4Service::on_neighbours has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (27 pts), match/switch 3 (6 pts), loops 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/discv4/src/lib.rs"},"region":{"startLine":1530}}}],"partialFingerprints":{"codehealthFindingId/v1":"3afe01b958d5570ba30f518d4fc166aa2ed3c35f4905a1d1985bd136bd374f5f"}},{"ruleId":"D2","level":"warning","message":{"text":"PeersManager::poll (cognitive 35): PeersManager::poll has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 4 (8 pts), match/switch 1 (3 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/peers.rs"},"region":{"startLine":1388}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff4068b219668c371e07bc7547d85b4f43389304d2b139d4461be4b295e629d0"}},{"ruleId":"D2","level":"warning","message":{"text":"PayloadBuilderService::poll (cognitive 35): PayloadBuilderService::poll has cognitive complexity 35 (threshold 15). Drivers by points: if/else 5 (17 pts), match/switch 3 (11 pts), loops 4 (7 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/payload/builder/src/service.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"460ab0a6b1707dd5927e6b45c306151dab72ab1574b4b9bd8e8c93e210e4e346"}},{"ruleId":"D2","level":"warning","message":{"text":"ArenaParallelSparseTrie::reveal_nodes (cognitive 35): ArenaParallelSparseTrie::reveal_nodes has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (24 pts), loops 4 (8 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/sparse/src/arena/mod.rs"},"region":{"startLine":2341}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dcdaad2fad9bd9edd0784cf0da02a94055a1d15f85a608c50330d202603c4ea"}},{"ruleId":"D2","level":"warning","message":{"text":"PrewarmedTx::validate (cognitive 34): PrewarmedTx::validate has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (28 pts), loops 3, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/tree/src/tree/payload_processor/reuse.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f29126ff93f3342a8c19faf8669156e854a0f8275707fb419af609f98e5213"}},{"ruleId":"D2","level":"warning","message":{"text":"DnsDiscoveryService::poll (cognitive 34): DnsDiscoveryService::poll has cognitive complexity 34 (threshold 15). Drivers by points: loops 9 (19 pts), match/switch 3 (10 pts), if/else 2 (4 pts), boolean chains 1 (nesting depth added 19). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/dns/src/lib.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"e795235c73f1270442670405838021af30a23134d9d4456ae8e01b98de23b8f1"}},{"ruleId":"D2","level":"warning","message":{"text":"RlpxSatelliteStream::poll_next (cognitive 34): RlpxSatelliteStream::poll_next has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (23 pts), match/switch 4 (8 pts), boolean chains 2, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/eth-wire/src/multiplex.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa9cc28e2b8ef55d82fba36abd45c8aca2c8eb8bad5d17554c433f55cbf7f26"}},{"ruleId":"D2","level":"warning","message":{"text":"EngineNodeLauncher::launch_node (cognitive 34): EngineNodeLauncher::launch_node has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (28 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/builder/src/launch/engine.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"82941a806975242b1bcb43222a23d297f66de20c70bcbde5f77ef5bc969c3cc1"}},{"ruleId":"D2","level":"warning","message":{"text":"EthPubSub::handle_accepted (cognitive 34): EthPubSub::handle_accepted has cognitive complexity 34 (threshold 15). Drivers by points: if/else 6 (17 pts), match/switch 6 (15 pts), loops 1 (2 pts) (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":"crates/rpc/rpc/src/eth/pubsub.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5567e1dbbaec814fd79e77a0a4f11d4415b6d94b9026511e45352bd0ebe5a20"}},{"ruleId":"D2","level":"warning","message":{"text":"StorageHashingStage::execute (cognitive 34): StorageHashingStage::execute has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 4 (9 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":"crates/stages/stages/src/stages/hashing_storage.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca5c326eb0e4e1e2faf75aeec2d48e15e0eb2164e1df89eea0db615cd557b8d"}},{"ruleId":"D2","level":"warning","message":{"text":"DiskFileBlobStore::get_by_versioned_hashes_eip7594 (cognitive 34): DiskFileBlobStore::get_by_versioned_hashes_eip7594 has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 5 (11 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/blobstore/disk.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7dbf6fa641b54744328b89f70c59e12b0fea02440986d2b105f62ef268e92bf"}},{"ruleId":"D2","level":"warning","message":{"text":"EthBeaconConsensus::validate_header (cognitive 33): EthBeaconConsensus::validate_header has cognitive complexity 33 (threshold 15). Drivers by points: if/else 22 (30 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ethereum/consensus/src/lib.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d352526554cf3ad508b11c4c98ba421a2ef03d53fc78def4b2aba439ea734f"}},{"ruleId":"D2","level":"warning","message":{"text":"EthRequestHandler::get_headers_response (cognitive 33): EthRequestHandler::get_headers_response has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (27 pts), match/switch 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/eth_requests.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d3edf21952c9a361333d32f2d234e62e44f22c37e0081ca95565507e909eee"}},{"ruleId":"D2","level":"warning","message":{"text":"FetchFullBlockFuture::poll (cognitive 33): FetchFullBlockFuture::poll has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (24 pts), match/switch 3 (8 pts), loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/p2p/src/full_block.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85f49aecb33854ff5d5a49b3c2adda928344b02131b570d4dbc0b8bfde6a71a"}},{"ruleId":"D2","level":"warning","message":{"text":"EthCall::simulate_v1 (cognitive 33): EthCall::simulate_v1 has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (26 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc-eth-api/src/helpers/call.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"c76cdf30596d41317ae2611093d4d5fab9aa57bdce751533ddcb30b61f2877e3"}},{"ruleId":"D2","level":"warning","message":{"text":"Pipeline::unwind_stages (cognitive 32): Pipeline::unwind_stages has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 4 (5 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stages/api/src/pipeline/mod.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"0457de97fd5ef9840df0185def639f5f0cf5e4626ca25071d6fa578454546452"}},{"ruleId":"D2","level":"warning","message":{"text":"DiskFileBlobStore::get_by_versioned_hashes_cells_eip7594 (cognitive 32): DiskFileBlobStore::get_by_versioned_hashes_cells_eip7594 has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 5 (11 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/blobstore/disk.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"96bb2a8fa63090c6004d6730538fcf75a29a7f52e1efe6d66b008207be3449f8"}},{"ruleId":"D2","level":"warning","message":{"text":"BasicEngineValidator::validate_block_with_state (cognitive 31): BasicEngineValidator::validate_block_with_state has cognitive complexity 31 (threshold 15). Drivers by points: if/else 20 (23 pts), match/switch 5 (7 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/tree/src/tree/payload_validator.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"c144e2a8458d3e408cb1f9618c515bd6a53190c4d43bd12dfaef8219acae719d"}},{"ruleId":"D2","level":"warning","message":{"text":"reth_rpc_eth_types::cache::db::apply_state_overrides_with_state (cognitive 31): reth_rpc_eth_types::cache::db::apply_state_overrides_with_state has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc-eth-types/src/cache/db.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"0546cfc865d4fb1f528c2be0eba319c7434ab1d18536cb1ee6fd1517dd143ebc"}},{"ruleId":"D2","level":"warning","message":{"text":"TransactionsManager::import_transactions (cognitive 30): TransactionsManager::import_transactions has cognitive complexity 30 (threshold 15). Drivers by points: if/else 18 (24 pts), loops 2 (3 pts), match/switch 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/transactions/mod.rs"},"region":{"startLine":1347}}}],"partialFingerprints":{"codehealthFindingId/v1":"12075dd1f2ba86254dd2a9d163d8600a647e69f168eb8ad37bdfa5b71f04b729"}},{"ruleId":"D2","level":"warning","message":{"text":"AccountHashingStage::execute (cognitive 30): AccountHashingStage::execute has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 4 (9 pts), boolean chains 5 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stages/stages/src/stages/hashing_account.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c26f924b00c122c4d7c3a16a3b3f8e34a401cd23f70706a914f254c7c3cbccb"}},{"ruleId":"D2","level":"warning","message":{"text":"reth_stages::stages::execution::slot_preimages::inject_plain_wipe_slots (cognitive 30): reth_stages::stages::execution::slot_preimages::inject_plain_wipe_slots has cognitive complexity 30 (threshold 15). Drivers by points: loops 8 (16 pts), if/else 5 (14 pts) (nesting depth added 17). 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":"crates/stages/stages/src/stages/execution/slot_preimages.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f09ce738279a477835e6a163621f816bf91198fcc7a1c97278c7ea9dc75089d"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseProvider::save_blocks_inner (cognitive 30): DatabaseProvider::save_blocks_inner has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (17 pts), loops 4 (8 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/database/provider.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce51677fe1a6c7f1e03717c7c2b49071fa0bd2032ea11e15e6264dbf3e7de9e0"}},{"ruleId":"D2","level":"warning","message":{"text":"Command::execute (cognitive 29): Command::execute has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (23 pts), match/switch 4 (6 pts) (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":"crates/cli/commands/src/db/get.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f223f5c52f8f9b56e6279f313d53da4e4394cf82b651f1e27f32e463a42ce88"}},{"ruleId":"D2","level":"warning","message":{"text":"reth_cli_commands::db::get::get_rocksdb_storage_history (cognitive 29): reth_cli_commands::db::get::get_rocksdb_storage_history has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (19 pts), match/switch 2 (4 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/get.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"b55b12317156d8831eb2bc54620f347e1d2a2e889d86cecee6cc2d87e95670d4"}},{"ruleId":"D2","level":"warning","message":{"text":"EstimateCall::estimate_gas_with (cognitive 29): EstimateCall::estimate_gas_with has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 5, match/switch 3 (5 pts), loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"crates/rpc/rpc-eth-api/src/helpers/estimate.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca1927ed4550221d9d6e17689cfa0ea43b91caa68fd07172c3a4addb96874ccf"}},{"ruleId":"D2","level":"warning","message":{"text":"AllTransactions::insert_tx (cognitive 29): AllTransactions::insert_tx has cognitive complexity 29 (threshold 15). Drivers by points: if/else 17 (25 pts), loops 2 (3 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":"crates/transaction-pool/src/pool/txpool.rs"},"region":{"startLine":2119}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c65c00aa4d77fc9d3888b7e20b42f155f9f4207686d04c385e2231e461f8a83"}},{"ruleId":"D2","level":"warning","message":{"text":"EthTransactionValidator::validate_eip4844 (cognitive 29): EthTransactionValidator::validate_eip4844 has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (26 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/validate/eth.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"69677a89df8814fef178c65147187a5f0398c9426ddacffdcf260ad5ab2ff2d6"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadCommand::resolve_components (cognitive 28): DownloadCommand::resolve_components has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 6 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/download/mod.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41b7994de5ab01c01f1a09471cbb351ee61e84466b92a4b50e4bdfe39846c0e"}},{"ruleId":"D2","level":"warning","message":{"text":"reth_cli_commands::download::manifest::generate_manifest (cognitive 28): reth_cli_commands::download::manifest::generate_manifest has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/download/manifest.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"901d42afabf11383cc707c63113a2fe7a4e09abfbfc2a699c92d4ed1ca83dd7f"}},{"ruleId":"D2","level":"warning","message":{"text":"RlpxProtocolMultiplexer::into_satellite_stream_with_tuple_handshake (cognitive 28): RlpxProtocolMultiplexer::into_satellite_stream_with_tuple_handshake has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (21 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/eth-wire/src/multiplex.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"534e2440ed36082da823f9e15629e623614a8797b29b8f399a5fca9035da1012"}},{"ruleId":"D2","level":"warning","message":{"text":"EthSimBundle::sim_bundle_inner (cognitive 28): EthSimBundle::sim_bundle_inner has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 3, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc/src/eth/sim_bundle.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7aca50833a9a2106441fe6868a72858f0b4e225df34a306299ee017d008b966"}},{"ruleId":"D2","level":"warning","message":{"text":"PoolInner::notify_on_transaction_updates (cognitive 28): PoolInner::notify_on_transaction_updates has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 4 (6 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/pool/mod.rs"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84361b66e94e91cd5bb44571da0cfe903518755d9934656cd1574da2c06cd95"}},{"ruleId":"D2","level":"warning","message":{"text":"ArenaParallelSparseTrie::maybe_collapse_or_remove_branch (cognitive 28): ArenaParallelSparseTrie::maybe_collapse_or_remove_branch has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/sparse/src/arena/mod.rs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"1516f72eedd38a1edc5de94312137a4440f78ce9fbf6c7ddc2fae282e43e6722"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeArena::sweep_blinded (cognitive 28): NodeArena::sweep_blinded has cognitive complexity 28 (threshold 15). Drivers by points: loops 6 (14 pts), if/else 5 (12 pts), boolean chains 2 (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":"crates/trie/sparse/src/arena/node_arena.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce80c09fa5dd1be0016b0ae23c50801269d0254c307fb71f716003e112dcc245"}},{"ruleId":"D2","level":"warning","message":{"text":"bench-reth-summary.main (cognitive 28): bench-reth-summary.main has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 9, loops 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/bench-reth-summary.py"},"region":{"startLine":2050}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23e0ea800a321006265f222a64676adc6fa3ca1c588c2cfb53aea07e7d1e9b8"}},{"ruleId":"D2","level":"warning","message":{"text":"reth_cli_commands::db::get::get_rocksdb_account_history (cognitive 27): reth_cli_commands::db::get::get_rocksdb_account_history has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (19 pts), match/switch 2 (4 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/get.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"16783a0ed2306a71277b4f7243b6d03c5a9fbc669ef42c5ca4073d230569823d"}},{"ruleId":"D2","level":"warning","message":{"text":"ECIESCodec::decode (cognitive 27): ECIESCodec::decode has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (24 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/ecies/src/codec.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"5feb279aff6ee138318a4eaef03d6bdafea0d3fed18087ab69e9ad6fa255e6ba"}},{"ruleId":"D2","level":"warning","message":{"text":"ProtocolMessage::decode_message_with_tx_memory_budget (cognitive 27): ProtocolMessage::decode_message_with_tx_memory_budget has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (24 pts), match/switch 2 (3 pts) (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/eth-wire-types/src/message.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece91ada949d08687dd76bcfe48a285abe568ee2917751033830a8373525b7c1"}},{"ruleId":"D2","level":"warning","message":{"text":"EthBundle::call_bundle (cognitive 27): EthBundle::call_bundle has cognitive complexity 27 (threshold 15). Drivers by points: if/else 19 (23 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc/src/eth/bundle.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5478b738d8566f5d342d934bbf30065cfdd5e6d22ae3afba45035e0838406c9"}},{"ruleId":"D2","level":"warning","message":{"text":"reth_db_common::init::init_genesis_with_settings_and_validate (cognitive 27): reth_db_common::init::init_genesis_with_settings_and_validate has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/db-common/src/init.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf89e5b7f6f53299ebc5f978496c4d6b66e8f598c48428578d0d8567dbb90b4a"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseProvider::write_state_reverts (cognitive 27): DatabaseProvider::write_state_reverts has cognitive complexity 27 (threshold 15). Drivers by points: loops 5 (16 pts), if/else 4 (11 pts) (nesting depth added 18). 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":"crates/storage/provider/src/providers/database/provider.rs"},"region":{"startLine":2738}}}],"partialFingerprints":{"codehealthFindingId/v1":"328acab39d173bcbf2dc450a390734dacb886c5d5595b650669894ebd99e39cb"}},{"ruleId":"D2","level":"warning","message":{"text":"DiskFileBlobStore::get_by_versioned_hashes_v1 (cognitive 27): DiskFileBlobStore::get_by_versioned_hashes_v1 has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 5 (11 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/blobstore/disk.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32afb534e59897719614725d81ed02d109eef1feace4f8bcb7aebccbf661708"}},{"ruleId":"D2","level":"warning","message":{"text":"PendingPool::remove_to_limit (cognitive 27): PendingPool::remove_to_limit has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 4 (9 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/pool/pending.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f2a7cbee3434430a174839072c834f20cdacbb98cb7963ea31c1fe1fa70e1a"}},{"ruleId":"D2","level":"warning","message":{"text":"Command::execute (cognitive 26): Command::execute has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 4 (11 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/p2p/bootnode.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c32684e8ea9972e7ef0e7ec36d3e557f9f0bb334d23be83e68f16dd94c89650"}},{"ruleId":"D2","level":"warning","message":{"text":"reth_cli_commands::download::extract::streaming_download_and_extract (cognitive 26): reth_cli_commands::download::extract::streaming_download_and_extract has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (20 pts), match/switch 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/download/extract.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b12db8c8956908a3590df85897dd9dd510bbd7b7d3e6d0b556b0854f6bd333f"}},{"ruleId":"D2","level":"warning","message":{"text":"ReceiptFileClient::from_receipt_reader (cognitive 26): ReceiptFileClient::from_receipt_reader has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 3 (7 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/downloaders/src/receipt_file_client.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"712f63e8e30a38ef646c92d00472e0dfc5c6ea347d7a14cadcf2444bdd5aa039"}},{"ruleId":"D2","level":"warning","message":{"text":"NetworkManager::on_swarm_event (cognitive 26): NetworkManager::on_swarm_event has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (25 pts), match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/manager.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df42660765d8b9dac668ef4a7b93678bb67a63712ca240c8081050a8df7943f"}},{"ruleId":"D2","level":"warning","message":{"text":"FetchFullBlockRangeFuture::poll (cognitive 26): FetchFullBlockRangeFuture::poll has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (16 pts), match/switch 3 (8 pts), boolean chains 1, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/p2p/src/full_block.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"7faa7d28a59e95d824652adcc21e9d490489ec53300bc095a55b087368b1e1a2"}},{"ruleId":"D2","level":"warning","message":{"text":"RangeBlockMode::next (cognitive 26): RangeBlockMode::next has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc/src/eth/filter.rs"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"75be00289cb25cb5de2763a8899ed2e602d7cff8eefac9fde24a2ca6da77d9ba"}},{"ruleId":"D2","level":"warning","message":{"text":"ValidationApi::validate_message_against_block (cognitive 26): ValidationApi::validate_message_against_block has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 2 (4 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":"crates/rpc/rpc/src/validation.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee639a4553eb06bfa5f823c68febfa75606f6c97f496905161259cc989f774c8"}},{"ruleId":"D2","level":"warning","message":{"text":"StaticFileProvider::update_index (cognitive 26): StaticFileProvider::update_index has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 1, match/switch 1 (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/static_file/manager.rs"},"region":{"startLine":1113}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd25306b29367fda2e133ee9cb708fd88c43ddcded23d2987eb50ef4b7b75f96"}},{"ruleId":"D2","level":"warning","message":{"text":"StaticFileProvider::check_consistency (cognitive 26): StaticFileProvider::check_consistency has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/static_file/manager.rs"},"region":{"startLine":1332}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f68747df3aa92722599baa8e5e2a9840e0e754aa589a2cefdd0bdf8de490237"}},{"ruleId":"D2","level":"warning","message":{"text":"Command::static_files_stats_table (cognitive 25): Command::static_files_stats_table has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 3 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/stats.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e07e910564b2c514e37f971d098b7602b3a9b69a9f3186be8e3f11b327ba2c4"}},{"ruleId":"D2","level":"warning","message":{"text":"ExExNotificationsWithHead::poll_next (cognitive 25): ExExNotificationsWithHead::poll_next has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 2 (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":"crates/exex/exex/src/notifications.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eed9bf94659bc55c629329a42d5ba65833d0f6b572af45ff8b9f2e0f11e260f"}},{"ruleId":"D2","level":"warning","message":{"text":"SpawnedDownloader::poll (cognitive 25): SpawnedDownloader::poll has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (17 pts), match/switch 2 (5 pts), loops 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/downloaders/src/bodies/task.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b7e3ec74889988f16d417d09360378cc4cb4d24e7439be484e5bc6073fdfbb"}},{"ruleId":"D2","level":"warning","message":{"text":"Swarm::poll_next (cognitive 25): Swarm::poll_next has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (18 pts), match/switch 2 (4 pts), loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/swarm.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"61fd2227688e6ccc3ed3f65d232d250bf3ae5848cea7128249abd311cf21c391"}},{"ruleId":"D2","level":"warning","message":{"text":"LaunchContextWith::create_provider_factory_with_recovery (cognitive 25): LaunchContextWith::create_provider_factory_with_recovery has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 3, match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/builder/src/launch/common.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"065e45a7707409c4bd537d4749db2b9ed224f4ad62ee44a3e99a3f6e4566d897"}},{"ruleId":"D2","level":"warning","message":{"text":"DebugApi::debug_subscribe (cognitive 25): DebugApi::debug_subscribe has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 7 (13 pts), if/else 6 (10 pts), boolean chains 1, loops 1 (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":"crates/rpc/rpc/src/debug.rs"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"afdf217b9c327eb4113b142d5e5d4220ecd38a96366d5b45f61dd8c2710d4c59"}},{"ruleId":"D2","level":"warning","message":{"text":"TraceApi::trace_filter (cognitive 25): TraceApi::trace_filter has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc/src/trace.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"606459922e4614df8bb33c3e7db605529ea86f2560969746b9c75dc426e66677"}},{"ruleId":"D2","level":"warning","message":{"text":"ReadTransactions::start_monitor (cognitive 25): ReadTransactions::start_monitor has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (5 pts), match/switch 2 (5 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/libmdbx-rs/src/txn_manager.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0fd66cd3a1176e219db1add92034f136669eb2a4d20498dee436da8c732ca6"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseProvider::write_state_changes (cognitive 25): DatabaseProvider::write_state_changes has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 3 (7 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":"crates/storage/provider/src/providers/database/provider.rs"},"region":{"startLine":2817}}}],"partialFingerprints":{"codehealthFindingId/v1":"d268243769785f295d331f1268ffb38bd47b641e323ccb77723e47dc00b0e23a"}},{"ruleId":"D2","level":"warning","message":{"text":"RocksDBBatch::prune_account_history_batch (cognitive 25): RocksDBBatch::prune_account_history_batch has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (RocksDBBatch::prune_storage_history_batch) 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":"crates/storage/provider/src/providers/rocksdb/provider.rs"},"region":{"startLine":2389}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3067bf0a7296198914237316c35d2089dcfc16788be3569d4224408d79b398"}},{"ruleId":"D2","level":"warning","message":{"text":"RocksDBBatch::prune_storage_history_batch (cognitive 25): RocksDBBatch::prune_storage_history_batch has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (RocksDBBatch::prune_account_history_batch) 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":"crates/storage/provider/src/providers/rocksdb/provider.rs"},"region":{"startLine":2543}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad34ecdff42de2272443a89b719e1b5dbe051a13ff56958ec2f5ffb0b3be0eee"}},{"ruleId":"D2","level":"warning","message":{"text":"ArenaParallelSparseTrie::update_subtrie_hashes (cognitive 25): ArenaParallelSparseTrie::update_subtrie_hashes has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 3 (5 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/sparse/src/arena/mod.rs"},"region":{"startLine":2507}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f467de4179f128fbaaac44c0e5ed3c39565e1c671f294f52fe79c0ce170a971"}},{"ruleId":"D2","level":"warning","message":{"text":"TrieNodeIter::try_next (cognitive 25): TrieNodeIter::try_next has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (17 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/trie/src/node_iter.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee1a65ae41ef8b839142d1dc77f907ee118daea85e1df9073121a16fe2900862"}},{"ruleId":"D2","level":"warning","message":{"text":"bench-call-summary.build_summary (cognitive 25): bench-call-summary.build_summary has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 10, loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/bench-call-summary.py"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"f18beadc86f198d3b18760805c2ecb107d0b0f23dcbcc0eda7e7d3709c748c99"}},{"ruleId":"D2","level":"warning","message":{"text":"Command::execute_current (cognitive 24): Command::execute_current has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 2 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/state.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0b13aac8bc23f2db8328626236d2837922c9359f5d1974d702df0dad5b2db7"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionManager::poll_pending_session_event (cognitive 24): SessionManager::poll_pending_session_event has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 5 (8 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":"crates/net/network/src/session/mod.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"c317aef1a688ce1338c09c746fb69598ece4d15aaf2473bd0874737f7bc2b2f1"}},{"ruleId":"D2","level":"warning","message":{"text":"Pipeline::execute_stage_to_completion (cognitive 24): Pipeline::execute_stage_to_completion has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stages/api/src/pipeline/mod.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"afea2094a5dbe8349594184d5f0aecd0f5b4b1f88c6446ff20fa7648f39851c1"}},{"ruleId":"D2","level":"warning","message":{"text":"EnvironmentBuilder::open_with_permissions (cognitive 24): EnvironmentBuilder::open_with_permissions has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (19 pts), match/switch 2 (3 pts), loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/libmdbx-rs/src/environment.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"466c14fe4b50d885999ca88b1509ea87811d3d683fef27ee017c561211fa4cdb"}},{"ruleId":"D2","level":"warning","message":{"text":"StaticFileProviderRW::heal_changeset_sidecar (cognitive 24): StaticFileProviderRW::heal_changeset_sidecar has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/static_file/writer.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a3002a151ac89a3c1293fb5fe966e99faec29708eb8fe0f29151c35a98e44a"}},{"ruleId":"D2","level":"warning","message":{"text":"Command::execute (cognitive 23): Command::execute has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/account_storage.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"21aaef6422d63878d4a6f9971f353cca8272a1ad413e459b8060cc443a16edc3"}},{"ruleId":"D2","level":"warning","message":{"text":"reth_cli_commands::import_core::import_blocks_from_file (cognitive 23): reth_cli_commands::import_core::import_blocks_from_file has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 3 (9 pts), loops 1 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/import_core.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"0402424c822a26436bbf4c00a106fd38ee9709018dcb1f9e090e8ce9207feaaf"}},{"ruleId":"D2","level":"warning","message":{"text":"PrewarmCacheTask::refresh_results (cognitive 23): PrewarmCacheTask::refresh_results has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 4 (10 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/tree/src/tree/payload_processor/prewarm.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec82bffc26feee0ea6cb26c67e203e846eb0a9f310fd570e829f234c4d2f0118"}},{"ruleId":"D2","level":"warning","message":{"text":"CachedPrecompileProvider::execute (cognitive 23): CachedPrecompileProvider::execute has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/precompile_cache.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d4a3a60b020a5e720ae5adfee151463f15e3d3fffe14593b2dfb7ed4af6edd"}},{"ruleId":"D2","level":"warning","message":{"text":"Discovery::poll (cognitive 23): Discovery::poll has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 5 (9 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/discovery.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"1372c00f0f4d959b0641192c6f51b827bfa4a43b436402c02cab292eedb64bd7"}},{"ruleId":"D2","level":"warning","message":{"text":"EthRequestHandler::on_receipts70_request (cognitive 23): EthRequestHandler::on_receipts70_request has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 2 (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":"crates/net/network/src/eth_requests.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"baf9ec7f69a8c7c6a3c5c3e929fedea4c6536472335c9b8950a7977e57d4e9a1"}},{"ruleId":"D2","level":"warning","message":{"text":"reth_rpc_eth_types::simulate::resolve_transaction_with_account (cognitive 23): reth_rpc_eth_types::simulate::resolve_transaction_with_account has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc-eth-types/src/simulate.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"4755a4ca60cad1ab519ab600244af27cd03a95da31bb66f1ebb6a3d32620d5e8"}},{"ruleId":"D2","level":"warning","message":{"text":"ChunkedMultiProofTargetsV2::next (cognitive 23): ChunkedMultiProofTargetsV2::next has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 2, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/common/src/target_v2.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcbd0324c62145cf07e477643d06a96b824f1b7fdd7a1013dd53b4215053a011"}},{"ruleId":"D2","level":"warning","message":{"text":"ArenaParallelSparseTrie::find_leaf_in_arena (cognitive 23): ArenaParallelSparseTrie::find_leaf_in_arena has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (15 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/sparse/src/arena/mod.rs"},"region":{"startLine":1287}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b71f9e628dbe42ead3ec24623897ecc0718754aca22fd4a6659a7b2cb444f9"}},{"ruleId":"D2","level":"warning","message":{"text":"BasicBlockDownloader::poll (cognitive 22): BasicBlockDownloader::poll has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 4 (5 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":"crates/engine/tree/src/download.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd044d8354f13e7f84032fe2f35ae793808dc84dacf4286509ccb25abae0ceb"}},{"ruleId":"D2","level":"warning","message":{"text":"EngineHandler::poll (cognitive 22): EngineHandler::poll has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 2 (7 pts), loops 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":"crates/engine/tree/src/engine.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"154a6e8b167a87cb5fc102041e50e6b524be335c2c848a6eb9932ecd42d30751"}},{"ruleId":"D2","level":"warning","message":{"text":"PrewarmCacheTask::transact_worker (cognitive 22): PrewarmCacheTask::transact_worker has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 4, 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":"crates/engine/tree/src/tree/payload_processor/prewarm.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b65902d7e8be7ab4852f801e2a439c122a522f6928c1b3a93ec17f87bae67ff"}},{"ruleId":"D2","level":"warning","message":{"text":"Discv4Service::on_ping (cognitive 22): Discv4Service::on_ping has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 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":"crates/net/discv4/src/lib.rs"},"region":{"startLine":1197}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cce071527124c61ac657165982baa7ad7e04669a49a942929d47ce6dbcb5ddd"}},{"ruleId":"D2","level":"warning","message":{"text":"PeersManager::apply_reputation_change (cognitive 22): PeersManager::apply_reputation_change has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 1, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/peers.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f6bf048c586879162d340d3365d3e04d3c337c992a20a422408313f5cef7328"}},{"ruleId":"D2","level":"warning","message":{"text":"TransactionFetcher::evict_pending (cognitive 22): TransactionFetcher::evict_pending has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/transactions/fetcher.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ac499122c5ca04b8ff47ceb1127a14d84de2a23fb8ae2aefa7c3c2f28ad3d1"}},{"ruleId":"D2","level":"warning","message":{"text":"TestingApi::build_payload_v1 (cognitive 22): TestingApi::build_payload_v1 has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 2, 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":"crates/rpc/rpc/src/testing.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"eafa87994d0ab5930b8c49d7c2e087b24a452fa69edab247c73da31fff962dc1"}},{"ruleId":"D2","level":"warning","message":{"text":"reth_rpc_eth_types::logs_utils::append_matching_block_logs (cognitive 22): reth_rpc_eth_types::logs_utils::append_matching_block_logs has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 2 (11 pts), if/else 3 (8 pts), loops 2 (3 pts) (nesting depth added 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. 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":"crates/rpc/rpc-eth-types/src/logs_utils.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26165f02a4ceba822cbf8150d871875c2dd7db125ac79f1b7cc7cbf96110cd8"}},{"ruleId":"D2","level":"warning","message":{"text":"SnapBootstrap::run (cognitive 22): SnapBootstrap::run has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 3 (7 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/snap-sync/src/bootstrap.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"e64b7e7cb1a52a4aee4b7ad5e6dcac3fead7937a52a99182330b3f71780e1285"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseProvider::get_prune_checkpoints_for_availability (cognitive 22): DatabaseProvider::get_prune_checkpoints_for_availability has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/database/provider.rs"},"region":{"startLine":3987}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9d98ccd8c297030140caca0bbac88ea684f869dd3ada51ab58d8e56341b787"}},{"ruleId":"D2","level":"warning","message":{"text":"bench-call-summary.run_stats (cognitive 22): bench-call-summary.run_stats has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 5 (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":".github/scripts/bench-call-summary.py"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b36dd078cb6291812ae56cc43e3205a4bc71f1927d449559de60b6344074e7"}},{"ruleId":"D2","level":"warning","message":{"text":"bench-reth-charts.plot_latency_and_throughput (cognitive 22): bench-reth-charts.plot_latency_and_throughput has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 4 (9 pts), if/else 4 (7 pts), loops 3 (5 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":".github/scripts/bench-reth-charts.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"df3a9c2fa07f8c93b67fd217790f5c40216d8da0367e36fa27b5ee2bfabe85ec"}},{"ruleId":"D2","level":"warning","message":{"text":"inject-cargo-docs.injectCargoDocs (cognitive 22): inject-cargo-docs.injectCargoDocs has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 6, ternaries 2 (4 pts), loops 3, error handling 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":"docs/vocs/scripts/inject-cargo-docs.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"a483e7cd196b1f09ff771f819577a7ea58280e9da0ec3bd6e745df13679ac256"}},{"ruleId":"D2","level":"warning","message":{"text":"reth_cli_commands::db::repair_trie::do_verify_and_repair (cognitive 21): reth_cli_commands::db::repair_trie::do_verify_and_repair has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/repair_trie.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"925cc050d96c3993be1ba3b20b09acf58378c2369c963f23610fa2dfa8a13a9a"}},{"ruleId":"D2","level":"warning","message":{"text":"EngineApiTreeHandler::insert_block_or_payload (cognitive 21): EngineApiTreeHandler::insert_block_or_payload has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (17 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":"crates/engine/tree/src/tree/insert.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c8c3a37c64beaf5082c756232bee35ef6de7e21f9395f5e03c0e62c134a848"}},{"ruleId":"D2","level":"warning","message":{"text":"SparseTrieCacheTask::promote_pending_account_updates (cognitive 21): SparseTrieCacheTask::promote_pending_account_updates has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 3 (7 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/tree/src/tree/state_root_strategy/sparse_trie.rs"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"299dacccb608f97b77d2aa3d7cce8a1c2a3b45d96a508b1ffcfbf9e7ec8b7a27"}},{"ruleId":"D2","level":"warning","message":{"text":"reth_ethereum_consensus::validation::validate_block_post_execution_with_bal_hashes (cognitive 21): reth_ethereum_consensus::validation::validate_block_post_execution_with_bal_hashes has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 5 (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":"crates/ethereum/consensus/src/validation.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead5cb869afde6f7300e2fd3671f2b852f31c6bde174f2d25058fd824d4f1d9a"}},{"ruleId":"D2","level":"warning","message":{"text":"ExExManager::poll (cognitive 21): ExExManager::poll has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (7 pts), loops 5 (6 pts), match/switch 2 (6 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":"crates/exex/exex/src/manager.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"e946d2d437737bad14d570a7986d9a9d297f8ad8ea09c775774317c5257b1fdf"}},{"ruleId":"D2","level":"warning","message":{"text":"BodiesDownloader::poll_next (cognitive 21): BodiesDownloader::poll_next has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 4 (7 pts), match/switch 2 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/downloaders/src/bodies/bodies.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"a14d0c07b817ed164e1f0a6152bf3e036d756b56fa8e936ff5cb4c449aaf370d"}},{"ruleId":"D2","level":"warning","message":{"text":"TransactionFetcher::dispatch (cognitive 21): TransactionFetcher::dispatch has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 2 (5 pts), loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/transactions/fetcher.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b4cfe10a5cd8269e594f3481dbc48867a251714225d2a26a81af22114994539"}},{"ruleId":"D2","level":"warning","message":{"text":"TransactionLookupStage::execute (cognitive 21): TransactionLookupStage::execute has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stages/stages/src/stages/tx_lookup.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"aec79b51f18cc236ecbfab535d34f636bcc6f73127b19e36bd8ac5ca383795aa"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseEnv::open (cognitive 21): DatabaseEnv::open has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (16 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 6). Of this number, 16 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/db/src/implementation/mdbx/mod.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"8559a5087a6669ae33be29418abff023aa07be4cbbe4e44d93d3257fc0952346"}},{"ruleId":"D2","level":"warning","message":{"text":"ArenaSparseSubtrie::prune (cognitive 21): ArenaSparseSubtrie::prune has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 1 (nesting depth added 8). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/sparse/src/arena/mod.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e39ad8acea5fc6cd2eb0c56130282abaabc258c69c70535b6d675cedc3b6b90"}},{"ruleId":"D2","level":"warning","message":{"text":"bench-reth-charts.merge_csvs (cognitive 21): bench-reth-charts.merge_csvs has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 3 (7 pts), ternaries 1 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/bench-reth-charts.py"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"e587283584a053e19ac7116cda3212abe95632061b00cd1c9e38b837fcf75b6e"}},{"ruleId":"D2","level":"warning","message":{"text":"ArchiveProcessor::run (cognitive 20): ArchiveProcessor::run has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 2 (5 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":"crates/cli/commands/src/download/archive.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0139e5291880355bd690fdec28dbf8e2409618d96970a99653dd32d84ed56cf"}},{"ruleId":"D2","level":"warning","message":{"text":"Command::execute (cognitive 20): Command::execute has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 3 (5 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/stage/drop.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a22e42a87b8e5c5e8ef6b24fa7a95774e856876cb4fc7c6cec3b0cb987e6eb3"}},{"ruleId":"D2","level":"warning","message":{"text":"Command::execute (cognitive 20): Command::execute has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (3 pts), boolean chains 1, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/stage/run.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac713e9dbe1491683e7760e509dc09aee80565040ff4f2857af7150accdecfa0"}},{"ruleId":"D2","level":"warning","message":{"text":"reth_cli_commands::re_execute::verify_bundle_against_changesets (cognitive 20): reth_cli_commands::re_execute::verify_bundle_against_changesets has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (8 pts), match/switch 2 (7 pts), if/else 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":"crates/cli/commands/src/re_execute.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb574c15cd2d8d2428bce3549e8c0429f77751190fdbef574bc5ad2f52414e3"}},{"ruleId":"D2","level":"warning","message":{"text":"reth_engine_tree::tree::payload_processor::bal::worker::spawn_worker (cognitive 20): reth_engine_tree::tree::payload_processor::bal::worker::spawn_worker has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 2 (6 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/tree/src/tree/payload_processor/bal/worker.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"9513aa1dd71c97b1330a752d94f316615f028147a23b68b35ab21d43c31b77d6"}},{"ruleId":"D2","level":"warning","message":{"text":"reth_engine_tree::tree::payload_processor::bal_prewarm_pool::prewarm_loop (cognitive 20): reth_engine_tree::tree::payload_processor::bal_prewarm_pool::prewarm_loop has cognitive complexity 20 (threshold 15). Drivers by points: loops 3 (9 pts), match/switch 3 (8 pts), if/else 1 (3 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":"crates/engine/tree/src/tree/payload_processor/bal_prewarm_pool.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"295e8722f9e8a2d47155b162d0f5db29474a1763eb4ec50e8ab2d8efc5d79807"}},{"ruleId":"D2","level":"warning","message":{"text":"PeersManager::new (cognitive 20): PeersManager::new has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 4, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/peers.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c17b5749bcdb7ef00a10526bce1c9a7fc89f06f6ff1a38b7aafd804278dfe6b"}},{"ruleId":"D2","level":"warning","message":{"text":"TransactionFetcher::on_delivery (cognitive 20): TransactionFetcher::on_delivery has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/transactions/fetcher.rs"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f15cae9e22f86a146cdfdd3246d292ecc13d47a9a04f67698089e67e0593bc"}},{"ruleId":"D2","level":"warning","message":{"text":"reth_network::session::authenticate_stream (cognitive 20): reth_network::session::authenticate_stream has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (8 pts), match/switch 5 (8 pts), loops 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/session/mod.rs"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ac9e20855924e997fec232c02311d30134024520636b43b85bcacfae5e0ff3"}},{"ruleId":"D2","level":"warning","message":{"text":"reth_payload_primitives::validate_payload_timestamp (cognitive 20): reth_payload_primitives::validate_payload_timestamp has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 10, if/else 10. 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":"crates/payload/primitives/src/lib.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56d8005d573763bd4e5dad502bf7a59f335ad8a81f025b4cc869788f3fe2555"}},{"ruleId":"D2","level":"warning","message":{"text":"ReceiptsByLogs::prune (cognitive 20): ReceiptsByLogs::prune has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 2 (3 pts), loops 2, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prune/prune/src/segments/user/receipts_by_logs.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d628c36dd89abc45fdc4570368467666e459a446e7a46d429a6afdc305299bf"}},{"ruleId":"D2","level":"warning","message":{"text":"reth_prune::segments::user::history::prune_shard (cognitive 20): reth_prune::segments::user::history::prune_shard has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 1 (4 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":"crates/prune/prune/src/segments/user/history.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"e80071a3360e2ee960886fa21b0baee54669013afc2b1d78b3039aa5bcb708c3"}},{"ruleId":"D2","level":"warning","message":{"text":"EthFilterInner::get_logs_in_block_range_inner (cognitive 20): EthFilterInner::get_logs_in_block_range_inner has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (5 pts), match/switch 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":"crates/rpc/rpc/src/eth/filter.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5571b478c7d3cc591e31784f08386e393cc67d1cb7d382c266163d8e670414"}},{"ruleId":"D2","level":"warning","message":{"text":"StaticFileProvider::ensure_invariants (cognitive 20): StaticFileProvider::ensure_invariants has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/static_file/manager.rs"},"region":{"startLine":1735}}}],"partialFingerprints":{"codehealthFindingId/v1":"f492706c5e4c428c64a97e87eb92b45c4f45aa29add6997faa8445cb502d2974"}},{"ruleId":"D2","level":"warning","message":{"text":"OverlayManager::get_or_compute_overlay (cognitive 20): OverlayManager::get_or_compute_overlay has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 7 (12 pts), if/else 4 (7 pts), boolean chains 1 (nesting depth added 8). 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":"crates/storage/storage-overlay/src/manager.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"acedc0c61a8c72f6b0b4e0a1da6336f54b6ea083ce4439644d49111f4300fa08"}},{"ruleId":"D2","level":"warning","message":{"text":"DiskFileBlobStore::has_versioned_hashes (cognitive 20): DiskFileBlobStore::has_versioned_hashes has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 5 (8 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/blobstore/disk.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b438bde5e6cf1b05cf8d90566634d537ad0591146db305e1d4448476025be96"}},{"ruleId":"D2","level":"warning","message":{"text":"ProofCalculator::proof_subtrie (cognitive 20): ProofCalculator::proof_subtrie has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (17 pts), loops 2, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/trie/src/proof_v2/calculator.rs"},"region":{"startLine":1209}}}],"partialFingerprints":{"codehealthFindingId/v1":"0450fc6b02f3741e9f3b0e0959d0321ed48bb2360fa88f8c00a0c6b63ac913eb"}},{"ruleId":"D2","level":"warning","message":{"text":"bench-call-summary.generate_markdown (cognitive 20): bench-call-summary.generate_markdown has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (11 pts), ternaries 4 (5 pts), boolean chains 3, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/bench-call-summary.py"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae0fec05d22a93cd817749e645fe23265fe893abd670aeba17addded5dc47132"}},{"ruleId":"D2","level":"warning","message":{"text":"bench-reth-charts.plot_wait_breakdown (cognitive 20): bench-reth-charts.plot_wait_breakdown has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (19 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":".github/scripts/bench-reth-charts.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"395b114e0dda6635b25155f5a3be8827fc0d97dd25055427b5ec8579151796ee"}},{"ruleId":"D2","level":"warning","message":{"text":"EngineApiTreeHandler::apply_chain_update (cognitive 19): EngineApiTreeHandler::apply_chain_update has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (16 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":"crates/engine/tree/src/tree/forkchoice.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"5369817b8013c7700c0eb746daf5c9d527420c3078ccf5606b11b3f9963adfbc"}},{"ruleId":"D2","level":"warning","message":{"text":"EngineApiTreeHandler::run_until_exit (cognitive 19): EngineApiTreeHandler::run_until_exit has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 3 (7 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":"crates/engine/tree/src/tree/mod.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"a471472728d108625d261286c1d0af22e89735c91b5efc2993281052d87f8324"}},{"ruleId":"D2","level":"warning","message":{"text":"Worker::warm_one_batch (cognitive 19): Worker::warm_one_batch has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 1, loops 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/tree/src/tree/txpool_prewarm/worker.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc24a29a6b0e4c3da55234d02ec17ea06a23f8a91fb83f343bd002e8b63da60"}},{"ruleId":"D2","level":"warning","message":{"text":"SpawnedDownloader::poll (cognitive 19): SpawnedDownloader::poll has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 4 (12 pts), if/else 1 (4 pts), loops 2 (3 pts) (nesting depth added 12). 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":"crates/net/downloaders/src/headers/task.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad604bf5ba54f9f8658af8f42a5edf00391b1024d7ebc4ba8fe997bcda91b40"}},{"ruleId":"D2","level":"warning","message":{"text":"StateFetcher::poll (cognitive 19): StateFetcher::poll has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 3 (9 pts), if/else 2 (6 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 11). 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":"crates/net/network/src/fetch/mod.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2972c167bf45b1210f482d2eadf5a525dad6e4fdc32717df31108e2cb2c9081"}},{"ruleId":"D2","level":"warning","message":{"text":"reth_node_builder::rpc::prewarm_new_block_bals_task (cognitive 19): reth_node_builder::rpc::prewarm_new_block_bals_task has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (4 pts), match/switch 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/builder/src/rpc.rs"},"region":{"startLine":1727}}}],"partialFingerprints":{"codehealthFindingId/v1":"074f3f4e73a19e682b8a502996d3ccb9684500755a6c6cf90cbdad75baacaade"}},{"ruleId":"D2","level":"warning","message":{"text":"Pruner::prune_segments (cognitive 19): Pruner::prune_segments has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (17 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":"crates/prune/prune/src/pruner.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df14d2f05b61a13583addcc2fd28459af90b3892d852c9928f40d21278819a2"}},{"ruleId":"D2","level":"warning","message":{"text":"reth_rpc_eth_types::simulate::sanitize_chain (cognitive 19): reth_rpc_eth_types::simulate::sanitize_chain has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc-eth-types/src/simulate.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa2ec68fa366979f9b845b18e5a0a66d7dac368a4f214be6f1a300530133c375"}},{"ruleId":"D2","level":"warning","message":{"text":"SegmentHeader::prune (cognitive 19): SegmentHeader::prune has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (19 pts) (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/static-file/types/src/segment.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"051b378590cda03f0dadb2b623b8f0239e042945545ffe12c18cd59282e6b094"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseProvider::write_state (cognitive 19): DatabaseProvider::write_state has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 5, loops 3 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/database/provider.rs"},"region":{"startLine":2620}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b5f85e42e016cbf76fbcf2fc375d49e8238f2cc8bff467f20a3e71862a51dbc"}},{"ruleId":"D2","level":"warning","message":{"text":"OverlayBuilder::build_state_trie_overlay_at_frontiers (cognitive 19): OverlayBuilder::build_state_trie_overlay_at_frontiers has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (18 pts), 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":"crates/storage/storage-overlay/src/builder.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7905ed0d9c75e820e836d9bb08e0820b31b052225b35b98ef99caae4abba707"}},{"ruleId":"D2","level":"warning","message":{"text":"ArenaCursor::next (cognitive 19): ArenaCursor::next has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (16 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":"crates/trie/sparse/src/arena/cursor.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33ea2b2f06ded9f34b60e0862232f5ca0444c5af4c68a88d4eeac083b8cd5b5"}},{"ruleId":"D2","level":"warning","message":{"text":"bench-reth-summary.compute_target_metric_change (cognitive 19): bench-reth-summary.compute_target_metric_change has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 4, ternaries 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/bench-reth-summary.py"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e839cbad48efdfcec2378bddac849495910f75afcaed9eeeb64ceeaa3a31ce"}},{"ruleId":"D2","level":"warning","message":{"text":"reth_cli_commands::db::checksum::checksum_change_based_segment (cognitive 18): reth_cli_commands::db::checksum::checksum_change_based_segment has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 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":"crates/cli/commands/src/db/checksum/mod.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec733611c3b1773be0b3691484c668b98443f16947811b740793638d1b1251a8"}},{"ruleId":"D2","level":"warning","message":{"text":"reth_cli_commands::db::tui::handle_event (cognitive 18): reth_cli_commands::db::tui::handle_event has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 4 (8 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":"crates/cli/commands/src/db/tui.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca3cc5b0ec9e6b1c225f959a2162883e8554982f9d0c130f012d0009fed479d9"}},{"ruleId":"D2","level":"warning","message":{"text":"MiningMode::poll (cognitive 18): MiningMode::poll has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/local/src/miner.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e45ed0133d23b5a2d8357d35c930553ee7ec357df13c96137133c0c9bd84e46"}},{"ruleId":"D2","level":"warning","message":{"text":"EngineApiTreeHandler::on_backfill_sync_finished (cognitive 18): EngineApiTreeHandler::on_backfill_sync_finished has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"crates/engine/tree/src/tree/sync.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"93449fc3d150c2bc8e45e8781613d24e6aeeb7e29fa05c6db48257168543108a"}},{"ruleId":"D2","level":"warning","message":{"text":"StartingStream::poll_next (cognitive 18): StartingStream::poll_next has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 5, match/switch 2 (3 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/era-downloader/src/stream.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e5ad549ae11696a0acdaef3c595f438d69dd370397f08d82650e77f5c0862d2"}},{"ruleId":"D2","level":"warning","message":{"text":"BodiesRequestFuture::poll (cognitive 18): BodiesRequestFuture::poll has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/downloaders/src/bodies/request.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"90cf4af4470cfc5c85fba118379f403995dc407bf80398e9b6e820bc7762e8ff"}},{"ruleId":"D2","level":"warning","message":{"text":"EventHandler::poll (cognitive 18): EventHandler::poll has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (5 pts), loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/events/src/node.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c9d7a726e9a4d3688cea31e233d469c4eb4f166416e1cbbcb40f6252be2ab61"}},{"ruleId":"D2","level":"warning","message":{"text":"EthCall::call_many (cognitive 18): EthCall::call_many has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc-eth-api/src/helpers/call.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec97463e6fece53412d96ade26af11ffd675fc7e9473f7335a38d9aee44c94c"}},{"ruleId":"D2","level":"warning","message":{"text":"Pipeline::on_stage_error (cognitive 18): Pipeline::on_stage_error has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stages/api/src/pipeline/mod.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ade9f984172994c6394056113c485a270f121e3e920113be64d130a8e937d05"}},{"ruleId":"D2","level":"warning","message":{"text":"ArenaCursor::seek (cognitive 18): ArenaCursor::seek has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, loops 2, 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":"crates/trie/sparse/src/arena/cursor.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd1a1beff3705c9d023d86e731f02e67e68f50924e8f7ff068117e47712a396"}},{"ruleId":"D2","level":"warning","message":{"text":"StorageWorker::verify_storage (cognitive 18): StorageWorker::verify_storage has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/trie/src/verify/storage.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06b6a643c81fc372c137e41df20aee8a548cc5740c0c7787ec16eed18651f21"}},{"ruleId":"D2","level":"warning","message":{"text":"bench-reth-summary.query_histogram_target_metric_run (cognitive 18): bench-reth-summary.query_histogram_target_metric_run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/bench-reth-summary.py"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"45286d4099a873a461ff7e02724a40bbc03cc0a28252f4305316e452741ee9e5"}},{"ruleId":"D2","level":"warning","message":{"text":"fetch-grafana-dashboard.make_exportable (cognitive 18): fetch-grafana-dashboard.make_exportable has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (7 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":".github/scripts/fetch-grafana-dashboard.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"5211984f47532241a2f25943fbff6380b29112211f1beae178fd2ca496351e23"}},{"ruleId":"D2","level":"warning","message":{"text":"GetValueViewer::view_dupsort (cognitive 17): GetValueViewer::view_dupsort has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 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":"crates/cli/commands/src/db/get.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"881ef86e7402fb7c24bf8f91d2ca6c4e18b9429244c479108e88e9aaa2b6311b"}},{"ruleId":"D2","level":"warning","message":{"text":"Command::execute (cognitive 17): Command::execute has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 2 (3 pts) (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/mod.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a8bee8f964142950b3c43b7b5f70cf62fb40d2e9154f24b9777ad6fcc9c09d9"}},{"ruleId":"D2","level":"warning","message":{"text":"reth_cli_commands::db::checksum::checksum_static_file (cognitive 17): reth_cli_commands::db::checksum::checksum_static_file has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/checksum/mod.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"399b879d5e39f4e6a66646f5d8bf7df782b869cc94e3c85ca04262f611f570cd"}},{"ruleId":"D2","level":"warning","message":{"text":"reth_cli_commands::init_state::without_evm::append_dummy_chain (cognitive 17): reth_cli_commands::init_state::without_evm::append_dummy_chain has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 6 (7 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":"crates/cli/commands/src/init_state/without_evm.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"99fa0e01628799d86a0cb10fa6852072826ee9185ba5ec720186572807e34900"}},{"ruleId":"D2","level":"warning","message":{"text":"EngineReorg::poll_next (cognitive 17): EngineReorg::poll_next has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 4 (11 pts), if/else 2 (4 pts), boolean chains 1, loops 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":"crates/engine/util/src/reorg.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0cba4de4d33c5783cd36710126fbb060380a62cd8da486d6b8743b5a97ce03f"}},{"ruleId":"D2","level":"warning","message":{"text":"QueryPool::poll (cognitive 17): QueryPool::poll has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (5 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":"crates/net/dns/src/query.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f42c296e2e9686c758387c42ee6efb5cef4487fe51508aa82fa9dd7062c9ab"}},{"ruleId":"D2","level":"warning","message":{"text":"TransactionsManager::on_new_pooled_transaction_hashes (cognitive 17): TransactionsManager::on_new_pooled_transaction_hashes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (14 pts), match/switch 2, boolean chains 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":"crates/net/network/src/transactions/mod.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"d23f05c1ef04ba990ad3365f2651e2739c33236277fdbeb9bac067fa8872fbe2"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeState::handle_pipeline_event (cognitive 17): NodeState::handle_pipeline_event has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 2 (4 pts) (nesting depth added 8). 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":"crates/node/events/src/node.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"debbe84469f8ad9aa154da81ecf4dea3c2b51bf74ea27a5ece48f11de3d87cfc"}},{"ruleId":"D2","level":"warning","message":{"text":"reth_payload_primitives::validate_slot_number_presence (cognitive 17): reth_payload_primitives::validate_slot_number_presence has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 1 (nesting depth added 8). 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":"crates/payload/primitives/src/lib.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"746b4dfb3d74a17f01a00ee0e3e7127790403656a7048e9ba22e820bfa31a824"}},{"ruleId":"D2","level":"warning","message":{"text":"SharedFeed::produce (cognitive 17): SharedFeed::produce has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (10 pts), match/switch 2 (5 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":"crates/rpc/rpc/src/eth/pubsub.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9a872404caabba2a4b7f309b636e958653582065c2621a42c67ac92891d9b0"}},{"ruleId":"D2","level":"warning","message":{"text":"reth_stages::stages::sender_recovery::recover_range (cognitive 17): reth_stages::stages::sender_recovery::recover_range has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (7 pts), match/switch 2 (7 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":"crates/stages/stages/src/stages/sender_recovery.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db110012c0828ad1ff1fa5582e5c23f6c3aec255e082dd88ad2f4cb81846baf"}},{"ruleId":"D2","level":"warning","message":{"text":"DbTool::list (cognitive 17): DbTool::list has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/db-common/src/db_tool/mod.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73cd2dd986ad123c9f58ee23450e179c9f0a1481afef2ce91365765aa7172a6"}},{"ruleId":"D2","level":"warning","message":{"text":"ConsistentProvider::get_in_memory_or_storage_by_tx (cognitive 17): ConsistentProvider::get_in_memory_or_storage_by_tx has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/consistent.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ceed518d500f5743608396b70c212873de4761ccd40910f4a537cc2a395227"}},{"ruleId":"D2","level":"warning","message":{"text":"StaticFileProviderRW::truncate (cognitive 17): StaticFileProviderRW::truncate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/static_file/writer.rs"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67544b51d4d51af945d26e323189350496c78802587d0d0f6487e6aca0cfc08"}},{"ruleId":"D2","level":"warning","message":{"text":"BlobTransactions::satisfy_attributes (cognitive 17): BlobTransactions::satisfy_attributes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (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":"crates/transaction-pool/src/pool/blob.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5436c24d795f47455cbb41a480afb470e73d74d84623f47bb549932e7e2320b"}},{"ruleId":"D2","level":"warning","message":{"text":"reth_cli_commands::download::planning::collect_planned_archives (cognitive 16): reth_cli_commands::download::planning::collect_planned_archives has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/download/planning.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a78ddec90654142c3d76a5039c36fddee300c2075b3fb144a8d649dd8ce4de8"}},{"ruleId":"D2","level":"warning","message":{"text":"ExecutionCache::insert_state (cognitive 16): ExecutionCache::insert_state has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/execution-cache/src/cached_state.rs"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea64cb389f95ea81dfdc60d07fdf14746d1b051dfe1ed79506dd5adda4e7f54f"}},{"ruleId":"D2","level":"warning","message":{"text":"EngineApiTreeHandler::get_save_blocks_input (cognitive 16): EngineApiTreeHandler::get_save_blocks_input has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, loops 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/tree/src/tree/persist.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a00066b50a8cab9842babe604e5c8b6c45ff00bc9326a4dc200eff92f2cfdb9"}},{"ruleId":"D2","level":"warning","message":{"text":"PrewarmCacheTask::spawn_txs_prewarm (cognitive 16): PrewarmCacheTask::spawn_txs_prewarm has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/tree/src/tree/payload_processor/prewarm.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d2d00f70a29f3cc26ac170871268772567191bfa2dcae7cb41207013a568eb"}},{"ruleId":"D2","level":"warning","message":{"text":"PredictedState::update (cognitive 16): PredictedState::update has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/tree/src/tree/payload_processor/reuse.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d927a9d97d09334e7ee8020c64ef5fb1c7aec1828e9e69887dbd4f3a81ac6e"}},{"ruleId":"D2","level":"warning","message":{"text":"BasicEngineValidator::execute_transactions (cognitive 16): BasicEngineValidator::execute_transactions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/tree/src/tree/payload_validator.rs"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3c87e6cf7f6fd0fd76aaf932a4b7e257fc424838de446cf86134af6aa44867"}},{"ruleId":"D2","level":"warning","message":{"text":"SparseTrieCacheTask::run_ready_storage_work (cognitive 16): SparseTrieCacheTask::run_ready_storage_work has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2, 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":"crates/engine/tree/src/tree/state_root_strategy/sparse_trie.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"df104b4bdb92347ef7ba8dc27b66c5a683528e428451190d9c6f058b63f193d5"}},{"ruleId":"D2","level":"warning","message":{"text":"reth_era_utils::history::import (cognitive 16): reth_era_utils::history::import has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 2, loops 2, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/era-utils/src/history.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"58758cac4975ab270de0eae46205c07d59b0fd76f39d11470145372cf4eb26e7"}},{"ruleId":"D2","level":"warning","message":{"text":"reth_era_utils::history::process_iter (cognitive 16): reth_era_utils::history::process_iter has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 2, boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/era-utils/src/history.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"341022b8c3f6d377508fd98e4108cb01e1b365901c409178bcfd4726484c1d31"}},{"ruleId":"D2","level":"warning","message":{"text":"Discv4Service::evict_expired_requests (cognitive 16): Discv4Service::evict_expired_requests has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 3 (5 pts), match/switch 1 (2 pts) (nesting depth added 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":"crates/net/discv4/src/lib.rs"},"region":{"startLine":1694}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e1a040c9a72ebbfba20443d7a0f8af9049dd645decd1f50faa541be4815579"}},{"ruleId":"D2","level":"warning","message":{"text":"RlpxSatelliteStream::poll_outbound_producers (cognitive 16): RlpxSatelliteStream::poll_outbound_producers has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 2 (6 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/eth-wire/src/multiplex.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7cdc305c4fdb9ada5136b3d3635d317b0848eca38a451a8f4228e2caf0a7752"}},{"ruleId":"D2","level":"warning","message":{"text":"StateRangeRequests::poll (cognitive 16): StateRangeRequests::poll has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/eth_requests.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"acdef32220479b02ba4cf6f3ce90e97c69b0310379209a2c0a5d0471a7074f9c"}},{"ruleId":"D2","level":"warning","message":{"text":"StateRangeRequest::serve_storage_ranges (cognitive 16): StateRangeRequest::serve_storage_ranges has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/eth_requests.rs"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b18f31d43d303c23d3b003363a73c925d30e474bd5078da18c2fbfdc1b2a2ed"}},{"ruleId":"D2","level":"warning","message":{"text":"TransactionFetcher::pack_request (cognitive 16): TransactionFetcher::pack_request has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/transactions/fetcher.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"42fbfaa1c229ef282bc841892ebd798eb356ae5603e53ec92277ec3b01973989"}},{"ruleId":"D2","level":"warning","message":{"text":"DebugApi::trace_chain_block (cognitive 16): DebugApi::trace_chain_block has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 3 (5 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc/src/debug.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"526825a0234c43a6346b86d6ddaacfac49bce6ea2c578246461e019a8e5ef9f5"}},{"ruleId":"D2","level":"warning","message":{"text":"ValidationApi::ensure_payment (cognitive 16): ValidationApi::ensure_payment has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc/src/validation.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"6684d88db5d21d9801e9d8193d2f42ed0807de4c9e1ba1c011eec6f624d22605"}},{"ruleId":"D2","level":"warning","message":{"text":"HeaderStage::write_headers (cognitive 16): HeaderStage::write_headers has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stages/stages/src/stages/headers.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"7081350d9b7be246e42db878657078fb80f72396370ee1cce904e32ff83f9b49"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseProvider::append_blocks_with_state (cognitive 16): DatabaseProvider::append_blocks_with_state has cognitive complexity 16 (threshold 15). Drivers by points: loops 6 (11 pts), if/else 5 (nesting depth added 5). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/database/provider.rs"},"region":{"startLine":3869}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7953f5fb4057a90ff0059f96c942e1c2df352101f6aef873672a21ac5f41b7d"}},{"ruleId":"D2","level":"warning","message":{"text":"RocksDBBatch::prune_history_shards_inner (cognitive 16): RocksDBBatch::prune_history_shards_inner has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 2, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/rocksdb/provider.rs"},"region":{"startLine":2299}}}],"partialFingerprints":{"codehealthFindingId/v1":"3171cebcc678df7de5a8c5e7288b2fa3eca37204a6bc7c9d4e014e8bb65d52c0"}},{"ruleId":"D2","level":"warning","message":{"text":"bench-reth-summary.load_target_metric_scrapes (cognitive 16): bench-reth-summary.load_target_metric_scrapes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 1 (2 pts), loops 2, 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":".github/scripts/bench-reth-summary.py"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"971bb468f51f9b50c5f7d1b687944b1a0f6915fcbadfa16bfd8d9b9e7b6dbb8f"}},{"ruleId":"D2","level":"warning","message":{"text":"bench-reth-summary.generate_comparison_table (cognitive 16): bench-reth-summary.generate_comparison_table has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), ternaries 7, boolean chains 1, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/bench-reth-summary.py"},"region":{"startLine":1733}}}],"partialFingerprints":{"codehealthFindingId/v1":"6abfc2457441360a39f8d1c8454c62786d5ae11375b01d302a3530f850436925"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DatabaseProvider: ClassTooLong \u2014 2458 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 42 methods, 55 blocks, lines 164-4194. The bar is 400 significant lines; this is 2058 over it, 6.15\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":"crates/storage/provider/src/providers/database/provider.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7610362c810a8f2ed531cfcee5657280b47355ce73f4b769db7bf1a60a80ba7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: database/provider.rs: FileTooLong \u2014 2597 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 95% of them inside a single declaration: DatabaseProvider (55 blocks, 164-4194). The bar is 500 significant lines; this is 2097 over it, 5.19\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/database/provider.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"394d7c37338cc64f8f43ce1bc629e939d8a7bb09bcec59aaa242a1c14176bb82"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: StaticFileProvider: ClassTooLong \u2014 1580 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 57 methods, 18 blocks, lines 124-3155. The bar is 400 significant lines; this is 1180 over it, 3.95\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":"crates/storage/provider/src/providers/static_file/manager.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"b777d5d4b9bb0cd4643406c56d5c7528447eded65036f5b1b6d88acc2302924d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ArenaParallelSparseTrie: ClassTooLong \u2014 1455 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 31 methods, 6 blocks, lines 668-3064. The bar is 400 significant lines; this is 1055 over it, 3.64\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":"crates/trie/sparse/src/arena/mod.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"0281ac6eb67ae1830ea388e0b705765def65a4561165924591240287eee15865"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: arena/mod.rs: FileTooLong \u2014 1816 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 80% of them inside a single declaration: ArenaParallelSparseTrie (6 blocks, 668-3064). The bar is 500 significant lines; this is 1316 over it, 3.63\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/sparse/src/arena/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4460e75bdf403fbac621edf7e2dd49c39aa0867d9a1b9c742816350fada78875"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: static_file/manager.rs: FileTooLong \u2014 1779 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 89% of them inside a single declaration: StaticFileProvider (18 blocks, 124-3155). The bar is 500 significant lines; this is 1279 over it, 3.56\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/static_file/manager.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa91346cb64ac1cf8ada1df8e891afd390c47843344880f2e5cbb9be98783719"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/bench-reth-summary.py: FileTooLong \u2014 1767 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1267 over it, 3.53\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":".github/scripts/bench-reth-summary.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dca856cbbede39da754c725331fa4635f2f9c29478e71591089aeca20adc17b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rocksdb/provider.rs: FileTooLong \u2014 1688 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1188 over it, 3.38\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":"crates/storage/provider/src/providers/rocksdb/provider.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"216bd101b7b1688f727bec48a63c5bef96d6ada3948f32b303af8b540fa6a9fd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EngineApiTreeHandler: TooManyMethods \u2014 89 methods, declared across 7 files: tree/persist.rs (15), tree/insert.rs (14), tree/canonical.rs (13), tree/mod.rs (13), \u002B3 more file(s). The bar is 30 methods; this is 59 over it, 2.97\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":"crates/engine/tree/src/tree/mod.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"712edab091f5936f16e8391492fb2e513fa0dde81b256941b407dd4823bfeb61"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PoolInner: TooManyMethods \u2014 87 methods. The bar is 30 methods; this is 57 over it, 2.90\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":"crates/transaction-pool/src/pool/mod.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae5d0973ed91574f5d8edfc3d14a20543172801cf3a6be50bfe7e765741283ee"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1373 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 61% of them inside a single declaration: Discv4Service (4 blocks, 497-2081). The bar is 500 significant lines; this is 873 over it, 2.75\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/discv4/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"18c778a4957bb6a66f6b8f5fac56ffbec2469ded1a8fa3394cc3ad54ab541632"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1355 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 855 over it, 2.71\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc-builder/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab093d8308ca5e9e21c87e85f76f3ffbd88a14bafb80ae335fa501e214129de"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EngineApi: ClassTooLong \u2014 1058 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 73 methods, 8 blocks, lines 65-1796. The bar is 400 significant lines; this is 658 over it, 2.65\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":"crates/rpc/rpc-engine-api/src/engine_api.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"a22568d1211bd6b405b0ddba482f74e1aeb4c0d88001f437982f5e38393ead58"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tree/payload_validator.rs: FileTooLong \u2014 1301 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 801 over it, 2.60\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/tree/src/tree/payload_validator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c178c9e8838d262f9aa02bee0cd036f1d069ec6efcb787670082ddad3d2643"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pool/txpool.rs: FileTooLong \u2014 1274 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 774 over it, 2.55\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/pool/txpool.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cf8fc0db3d5ed821d89fbd005c2cf8e329f23832812e1b89e6092360b16a085"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1264 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 764 over it, 2.53\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":"crates/storage/rpc-provider/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d92bbef3be84d993a70438e790f073dc7db6a5654fe6e4cfbfe9123ee963b642"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TreeConfig: TooManyMethods \u2014 73 methods. The bar is 30 methods; this is 43 over it, 2.43\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":"crates/engine/primitives/src/config.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0411c1fa02c4e4ce11d1be370121dd8ccc7472019ff8f4ce2928ecff990cea3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EngineApi: TooManyMethods \u2014 73 methods. The bar is 30 methods; this is 43 over it, 2.43\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":"crates/rpc/rpc-engine-api/src/engine_api.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"b32311ee197c1267a4d28689971f6027ad7b0e280e2a5e7ec24081aa6c9b9da2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: transactions/mod.rs: FileTooLong \u2014 1214 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 63% of them inside a single declaration: TransactionsManager (6 blocks, 321-1772). The bar is 500 significant lines; this is 714 over it, 2.43\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/transactions/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2aac27fd46c3e3a6d0750f82c220084671f8cc29fdfe79fbc72b3cefe77e5fc"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DebugApi: ClassTooLong \u2014 950 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 23 methods, 6 blocks, lines 65-1500. The bar is 400 significant lines; this is 550 over it, 2.38\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc/src/debug.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f61649f14368199afb899f738088233b5dcabdb4f4d021d13e755bfdde37b8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/rpc.rs: FileTooLong \u2014 1130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 630 over it, 2.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/builder/src/rpc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e8529f10e09c08e08ad9efdb933678755e218073aefb99376bb083cb0071218"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/engine_api.rs: FileTooLong \u2014 1109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 95% of them inside a single declaration: EngineApi (8 blocks, 65-1796). The bar is 500 significant lines; this is 609 over it, 2.22\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc-engine-api/src/engine_api.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a99effa1e2eb649816f898da70728a4c160b55b759b93d4ca14a32b777b5ed"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/debug.rs: FileTooLong \u2014 1092 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 87% of them inside a single declaration: DebugApi (6 blocks, 65-1500). The bar is 500 significant lines; this is 592 over it, 2.18\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc/src/debug.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e463bdf3c43b4516d2ffa2baeefa4990b87c8fb4ac12ad71f1bf17d07c779dc8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ConsistentProvider: ClassTooLong \u2014 873 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 8 methods, 19 blocks, lines 45-1447. The bar is 400 significant lines; this is 473 over it, 2.18\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/consistent.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"42045c9bc09684771f033830f2d89681d1697cfb3d217b2137e33af24cdde017"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: StaticFileProviderRW: ClassTooLong \u2014 858 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 57 methods, 2 blocks, lines 235-1812. The bar is 400 significant lines; this is 458 over it, 2.15\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":"crates/storage/provider/src/providers/static_file/writer.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75ba1c3579f2c7d07cce5535d11e303e0d41fde33f74b53041fc170c25c0953"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Discv4Service: ClassTooLong \u2014 837 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 57 methods, 4 blocks, lines 497-2081. The bar is 400 significant lines; this is 437 over it, 2.09\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/discv4/src/lib.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06ce0d4cc30ef706205eeecab898836d85150c878417662707c16bbbeecc23b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: static_file/writer.rs: FileTooLong \u2014 1015 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 85% of them inside a single declaration: StaticFileProviderRW (2 blocks, 235-1812). The bar is 500 significant lines; this is 515 over it, 2.03\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/static_file/writer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"468b539547b11be907e55c32deed0efdfeed3530b3d851fd9fedcedfee72ff86"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/execute.rs: FileTooLong \u2014 1011 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 511 over it, 2.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":"crates/evm/evm/src/execute.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ae2663ecc65e44a53f70a159a3fd757f6684ea6c719656556a9cd3729e286d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LaunchContextWith: TooManyMethods \u2014 60 methods. The bar is 30 methods; this is 30 over it, 2.00\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/builder/src/launch/common.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"6645ade39e02d05ab82a888ba727d774597b110ab23649234fb5ac2ade213675"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ProofCalculator: ClassTooLong \u2014 769 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 26 methods, 3 blocks, lines 42-1572. The bar is 400 significant lines; this is 369 over it, 1.92\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":"crates/trie/trie/src/proof_v2/calculator.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7e58792c55554215fda3609658d5a61afef962b8224bc217fa570da14209db6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TransactionsManager: ClassTooLong \u2014 761 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 30 methods, 6 blocks, lines 321-1772. The bar is 400 significant lines; this is 361 over it, 1.90\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":"crates/net/network/src/transactions/mod.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"167328b95d9e88a866af360963025589d1e7dc8320e270a1dd1a72ef498b5db0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Discv4Service: TooManyMethods \u2014 57 methods. The bar is 30 methods; this is 27 over it, 1.90\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":"crates/net/discv4/src/lib.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"25494c3ca19bb4ed209eb2d69232327077d7e81a72981f0fac8329e38b0c00aa"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PeersManager: TooManyMethods \u2014 57 methods. The bar is 30 methods; this is 27 over it, 1.90\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":"crates/net/network/src/peers.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"949266099f74461e4e0a5a818a29fb71bfc6b13235a2c9caa034407132def9b4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: StaticFileProvider: TooManyMethods \u2014 57 methods. The bar is 30 methods; this is 27 over it, 1.90\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":"crates/storage/provider/src/providers/static_file/manager.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"5194cb6325d910d3e791ef4553c6727a81b7f678049bc317edd4448e48d6c28e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: StaticFileProviderRW: TooManyMethods \u2014 57 methods. The bar is 30 methods; this is 27 over it, 1.90\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":"crates/storage/provider/src/providers/static_file/writer.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a692b7d172bbea66e6d94aca1fb1277c9b54d506bcf492acc62cd22c4ce0877"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TxPool: TooManyMethods \u2014 57 methods. The bar is 30 methods; this is 27 over it, 1.90\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":"crates/transaction-pool/src/pool/txpool.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b95915bdedec2ac68f6d31afe4b9dc4e87fda6b8df9ad5a13155c8677799e65"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PeersManager: ClassTooLong \u2014 751 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 57 methods, 3 blocks, lines 58-1472. The bar is 400 significant lines; this is 351 over it, 1.88\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":"crates/net/network/src/peers.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda41467287f9cb2cced6f3cf36380880010fd539dc4572c50ff2113dbe7c429"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EthBundle.call_bundle: MethodTooLong \u2014 call_bundle runs 183 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"crates/rpc/rpc/src/eth/bundle.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b7830bc2c67e7267675960eda99f8ee706d99c56782d4d506d14b4d35d1264"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: proof_v2/calculator.rs: FileTooLong \u2014 910 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 85% of them inside a single declaration: ProofCalculator (3 blocks, 42-1572). The bar is 500 significant lines; this is 410 over it, 1.82\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/trie/src/proof_v2/calculator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e1aef81f83094048456241eeef6b71100ae34b4da1714436dff3a346d624dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: session/mod.rs: FileTooLong \u2014 905 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 405 over it, 1.81\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/session/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d44ce81c6fea87810677c5d919faf34f603f80ebc63a8d215210bb0e9cce7b3a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/init.rs: FileTooLong \u2014 905 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 405 over it, 1.81\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/db-common/src/init.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b8f70a99100bcb22e06cd4436f9837abad8576fd135614eb51a5e82d339b168"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: providers/consistent.rs: FileTooLong \u2014 905 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 96% of them inside a single declaration: ConsistentProvider (19 blocks, 45-1447). The bar is 500 significant lines; this is 405 over it, 1.81\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/consistent.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"265711c008c66bec51975ed3f02f1a735293cc27dc59a333899d0fad6c0e60d7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TxPool: ClassTooLong \u2014 723 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 57 methods, 5 blocks, lines 94-1429. The bar is 400 significant lines; this is 323 over it, 1.81\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":"crates/transaction-pool/src/pool/txpool.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"432232cf218d46469dceaf7cb9b7c68ed94c0cd86139da67268a9412f332c891"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pool/mod.rs: FileTooLong \u2014 900 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 77% of them inside a single declaration: PoolInner (3 blocks, 140-1413). The bar is 500 significant lines; this is 400 over it, 1.80\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/pool/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6fd8d28e156b17bb83bb4589130a0dfe4c03e42f39f6cedcb1a86256133977"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NetworkManager.on_swarm_event: MethodTooLong \u2014 on_swarm_event runs 178 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 78 over it, 1.78\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/manager.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ab2addfa3ff0527e7a00572e716cb0f7c7c3328372da6c0a5a531dacbf8cde"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NetworkConfigBuilder: TooManyMethods \u2014 53 methods. The bar is 30 methods; this is 23 over it, 1.77\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":"crates/net/network/src/config.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"b503295368b1f6f7e252b1733cacfc01a19d6167e90ac0e909a2c0d9ae203a24"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EngineApiTreeHandler.on_engine_message: MethodTooLong \u2014 on_engine_message runs 176 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 76 over it, 1.76\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/tree/src/tree/mod.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd121bdec483ef5ec501ba223ed8eb8886da0ecae5fa7d0c391a1c2a35a5940"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SessionManager.poll_pending_session_event: MethodTooLong \u2014 poll_pending_session_event runs 176 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 76 over it, 1.76\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/session/mod.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"642b70459a0f6aabe2b62cc61580c3ab3be7ca602216acf7b358cd1e56088fd2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/peers.rs: FileTooLong \u2014 879 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 85% of them inside a single declaration: PeersManager (3 blocks, 58-1472). The bar is 500 significant lines; this is 379 over it, 1.76\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/peers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e86af8d07ddc4c9c94a8653c00bc66d50bf443b235f041aa8d5036d4c2d156d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RpcBlockchainStateProvider: ClassTooLong \u2014 696 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 7 methods, 31 blocks, lines 921-1983. The bar is 400 significant lines; this is 296 over it, 1.74\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":"crates/storage/rpc-provider/src/lib.rs"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"795822d496467a9dde5e9d612a5e5dc7acc7a00d4020a7ccce0986a689a282cd"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PoolInner: ClassTooLong \u2014 695 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 87 methods, 3 blocks, lines 140-1413. The bar is 400 significant lines; this is 295 over it, 1.74\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":"crates/transaction-pool/src/pool/mod.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"463ccd860cb68c393c75459ee1666d082fae23c694142cc33fdc6f2ee5370c66"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: state_root_strategy/sparse_trie.rs: FileTooLong \u2014 865 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 74% of them inside a single declaration: SparseTrieCacheTask (2 blocks, 119-1235). The bar is 500 significant lines; this is 365 over it, 1.73\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/tree/src/tree/state_root_strategy/sparse_trie.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"074600f829ff5c0ec3949f4bc37db67fcb4b38cbf4a692ec3f83a5fcfa0ee8d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/bench-call-summary.py: FileTooLong \u2014 855 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 355 over it, 1.71\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/bench-call-summary.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6cdfc1b476746daba5148381978f5ebcdae3b10b5471853a0652d10c0500e14"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: launch/common.rs: FileTooLong \u2014 852 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 73% of them inside a single declaration: LaunchContextWith (10 blocks, 262-1350). The bar is 500 significant lines; this is 352 over it, 1.70\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/builder/src/launch/common.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a7df3120fca23ec3ca2274fd0d6c5f6229e30ede33b559977231f47da86be9b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: validate/eth.rs: FileTooLong \u2014 851 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 351 over it, 1.70\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":"crates/transaction-pool/src/validate/eth.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd24c4215c8fffee09ed8e7642dcb8f54772f7f7de169a1bbb07e914fddac3d3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: OverlayStateProvider: ClassTooLong \u2014 677 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 11 methods, 18 blocks, lines 162-1076. The bar is 400 significant lines; this is 277 over it, 1.69\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/storage-overlay/src/provider.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"017260800fa784d7effefb3d88fceaa850be1d4897c80f77d7626fcffa27f01f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: reth_cli_commands::download::manifest::generate_manifest: FunctionTooLong \u2014 reth_cli_commands::download::manifest::generate_manifest runs 168 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 68 over it, 1.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/download/manifest.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe1e196caf8a8f963ab2450923d94d92c3ed711599dfc1072b03bd0a7196b30"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: RpcServerArgs: TooManyFields \u2014 50 stored fields beside 17 methods. The bar is 30 stored fields; this is 20 over it, 1.67\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/core/src/args/rpc_server.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd6b2b640d8bccfa7f65a66b338443b48e3a927284689c75e7bc5395c931813"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/engine_ssz_proxy.rs: FileTooLong \u2014 831 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 331 over it, 1.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":"crates/ethereum/node/src/engine_ssz_proxy.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4aab51c9f6749032fe621679df66be5057f7ecc2fbe8d02b569e57ec6f46911"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/provider.rs: FileTooLong \u2014 821 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 82% of them inside a single declaration: OverlayStateProvider (18 blocks, 162-1076). The bar is 500 significant lines; this is 321 over it, 1.64\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/storage-overlay/src/provider.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdbd68e809e3012681863f6a1c95f2accf881cce5ccbb050dd7e7f65f6fdcd6d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArenaParallelSparseTrie.update_leaves: MethodTooLong \u2014 update_leaves runs 164 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 64 over it, 1.64\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/sparse/src/arena/mod.rs"},"region":{"startLine":2776}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae30b01c7ef73c9010358432cb822682e9b6e2ae844ed57773d1d78d56c5f7b6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NetworkManager: ClassTooLong \u2014 655 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 36 methods, 4 blocks, lines 108-1209. The bar is 400 significant lines; this is 255 over it, 1.64\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":"crates/net/network/src/manager.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff29380d58c7660ade8e7785040116c7ea76da524e9b02f23ce1838785efeb4f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SparseTrieCacheTask: ClassTooLong \u2014 642 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 30 methods, 2 blocks, lines 119-1235. The bar is 400 significant lines; this is 242 over it, 1.61\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/tree/src/tree/state_root_strategy/sparse_trie.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"aafcd12c2d48670877fa36ebc95b0611f1f9ad9121294e6a15c2a60756e02c01"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: eth/filter.rs: FileTooLong \u2014 802 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 302 over it, 1.60\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc/src/eth/filter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a6fbefe4d4c7802462e604e171ded1fcaad288fa98b835f7376858ea0e86d3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DefaultRpcServerArgs: TooManyMethods \u2014 48 methods. The bar is 30 methods; this is 18 over it, 1.60\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/core/src/args/rpc_server.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8bd8b178d6277390cfd972c5b32d9e9eb58b6852063466284e75f8fd4d7219"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RocksDBProvider: TooManyMethods \u2014 48 methods, declared across 2 files: rocksdb/provider.rs (43), rocksdb/invariants.rs (5). The bar is 30 methods; this is 18 over it, 1.60\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/rocksdb/provider.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"a55ed54958c6c50381128273ada04fadc99953e55e9fbbc54d23c9b7d968e743"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DatabaseProvider.save_blocks_inner: MethodTooLong \u2014 save_blocks_inner runs 160 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 60 over it, 1.60\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/database/provider.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b05b6ab45b0c5970226fe7f234ae4db058eff8701e564cdfa63579779ad7eb6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/traits.rs: FileTooLong \u2014 798 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 298 over it, 1.60\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/traits.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f616c0c69eafacc40a119f88c0aedd5914218dafcd82bdcb9d9fccff89e52c97"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: state_root_strategy/mod.rs: FileTooLong \u2014 790 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 290 over it, 1.58\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/tree/src/tree/state_root_strategy/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef4f2fabb1972ed28e627130f7b96f360402a8fa0952e2a708404baa5bcdd92"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StateRoot.calculate: MethodTooLong \u2014 calculate runs 157 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 57 over it, 1.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/trie/src/trie.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb8195c9c31e85e52787ee5e900415abaec8aced018b8d7c2c3f590c72f9830"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EthApiBuilder: TooManyMethods \u2014 47 methods. The bar is 30 methods; this is 17 over it, 1.57\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc/src/eth/builder.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd28991dae332c6f93e9e2e5e7cc441295c71c1270d4517ca7c8275e2fbda28"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LaunchContextWith: ClassTooLong \u2014 623 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 60 methods, 10 blocks, lines 262-1350. The bar is 400 significant lines; this is 223 over it, 1.56\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":"crates/node/builder/src/launch/common.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"639ef27d8f8c1cdccfc6b2876816e5d7494e8d8c90cf8ad793ab71c4b66e394c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RpcServerConfig.start: MethodTooLong \u2014 start runs 154 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 54 over it, 1.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc-builder/src/lib.rs"},"region":{"startLine":1417}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c3354762115b761ac2cc911f661783be0afdd08d3435f946bdabcb765a5cf79"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: DefaultRpcServerArgs: TooManyFields \u2014 46 stored fields beside 48 methods. The bar is 30 stored fields; this is 16 over it, 1.53\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/core/src/args/rpc_server.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"209a477ad9390057c107e4d132ea4b6e23d40b4668f746dceb46565229b35df5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: download/manifest.rs: FileTooLong \u2014 756 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 256 over it, 1.51\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/download/manifest.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9354c597d4ba6f42d2710804b3881286f6bf5e199bed7a81cee5826071fec205"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DefaultStateRootStrategy.spawn_sparse_trie_task: MethodTooLong \u2014 spawn_sparse_trie_task runs 151 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"crates/engine/tree/src/tree/state_root_strategy/mod.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ffd459c8e56c2b0d747d2863a8c1cb1de79a06d769ce456f1e75c3a7b506a91"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RpcAddOns: ClassTooLong \u2014 603 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 22 methods, 8 blocks, lines 531-1463. The bar is 400 significant lines; this is 203 over it, 1.51\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":"crates/node/builder/src/rpc.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a8a665565e5d31ce6dd4bce3edfd1ad333a4c9a92383d977bf7c17da7fb739"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EthSimBundle.sim_bundle_inner: MethodTooLong \u2014 sim_bundle_inner runs 148 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc/src/eth/sim_bundle.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11f61a5916559de5d90d004d4fcb8edb8834c99c4ec897ebb29e385c94ba054"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Discovery.new: MethodTooLong \u2014 new runs 145 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/discovery.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff67240f48418dd3806fdd1592ba92f2a70e700b3bbb5431b75d1fc3cd53a08b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExecutionStage.execute: MethodTooLong \u2014 execute runs 145 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stages/stages/src/stages/execution/mod.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"b253768bb17722704a90c1c56d4b4855e213ba7852662f84a37ab4faa3674846"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BlockchainProvider: ClassTooLong \u2014 577 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 8 methods, 31 blocks, lines 66-1160. The bar is 400 significant lines; this is 177 over it, 1.44\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":"crates/storage/provider/src/providers/blockchain_provider.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b5476ce522a06ba5e6dbb434ecea7ffbe4fe9253926b39096b37f01f1e4d22"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: providers/blockchain_provider.rs: FileTooLong \u2014 717 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 80% of them inside a single declaration: BlockchainProvider (31 blocks, 66-1160). The bar is 500 significant lines; this is 217 over it, 1.43\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/blockchain_provider.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b97dc15ef756781b12a07f3e3ba4db7cb119772371f596ef68f39e3434f348"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CanonicalInMemoryState: TooManyMethods \u2014 43 methods. The bar is 30 methods; this is 13 over it, 1.43\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":"crates/chain-state/src/in_memory/canonical.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf695a4eb8d2834496ef2055c4d91375267ecc259e483ce339823d02a324d40"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Command.static_files_stats_table: MethodTooLong \u2014 static_files_stats_table runs 143 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"crates/cli/commands/src/db/stats.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa58b0b7655ca2db9d43a78f2f4a19c3ab48e83473069d6d8d49a9f7a017fe5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/manager.rs: FileTooLong \u2014 712 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 92% of them inside a single declaration: NetworkManager (4 blocks, 108-1209). The bar is 500 significant lines; this is 212 over it, 1.42\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/manager.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"354d57ce76180c87a2461a10b191fb4fbdb1d9427516609ce429fd624254b61f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: transactions/fetcher.rs: FileTooLong \u2014 711 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 73% of them inside a single declaration: TransactionFetcher (4 blocks, 96-1153). The bar is 500 significant lines; this is 211 over it, 1.42\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/transactions/fetcher.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28f85da2c0674ece60eb7dea520721d3b9428d762d43aa8a111583ecfd65f9a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ProviderFactory: ClassTooLong \u2014 568 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 21 methods, 26 blocks, lines 75-1020. The bar is 400 significant lines; this is 168 over it, 1.42\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":"crates/storage/provider/src/providers/database/mod.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03be1fab47e85add5b6ff06a909a30c6afa0c505642cb584ad2b9cea20e5821"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/manager.rs: FileTooLong \u2014 706 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 69% of them inside a single declaration: OverlayManager (4 blocks, 49-781). The bar is 500 significant lines; this is 206 over it, 1.41\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/storage-overlay/src/manager.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"733f5fd371adf5f517dbf6bf83f1ceb4394f6bfdf30499a8d2a61526d1cec0cd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DatabaseProvider: TooManyMethods \u2014 42 methods. The bar is 30 methods; this is 12 over it, 1.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/database/provider.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a3e69bb65578fcc0c71cd85ccaf526165492360c811ab96bdcdff8ef45b122"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ChangesetCache.get_or_compute_range: MethodTooLong \u2014 get_or_compute_range runs 139 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/storage-overlay/src/changeset_cache.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7c254f770d07b777a992a71eee1f8c53df54d9a3efe9d7cf7a66fe8e07bbb3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: session/active.rs: FileTooLong \u2014 691 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 70% of them inside a single declaration: ActiveSession (3 blocks, 152-1046). The bar is 500 significant lines; this is 191 over it, 1.38\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/session/active.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b888d94b9d848d179e94560fa87f99ef3585b8d8e24b30276e05f057f52370c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: error/mod.rs: FileTooLong \u2014 688 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 188 over it, 1.38\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":"crates/rpc/rpc-eth-types/src/error/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0ca751aa087b9e9821386a879191d3b8aca6fda5e9f78891580ae834cd8bc4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: headers/reverse_headers.rs: FileTooLong \u2014 684 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 69% of them inside a single declaration: ReverseHeadersDownloader (5 blocks, 69-968). The bar is 500 significant lines; this is 184 over it, 1.37\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/downloaders/src/headers/reverse_headers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e5638213c96b4a85a0ba6df0d881e9ee784ed58418ac92671b90c10b56dcc5c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: reth_cli_commands::import_core::import_blocks_from_file: FunctionTooLong \u2014 reth_cli_commands::import_core::import_blocks_from_file runs 136 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/import_core.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea901ffedc6ed4491992372d3a178cadcc4616497a3924e11910f67f4a61e5db"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ActiveSession.poll: MethodTooLong \u2014 poll runs 136 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/session/active.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9dedd3477b8d9539d714a128ab7e0a96175ffbdf9186670f4e69b1a0b355f1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OverlayBuilder.build_state_trie_overlay_at_frontiers: MethodTooLong \u2014 build_state_trie_overlay_at_frontiers runs 136 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/storage-overlay/src/builder.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e0d2028de1a9d67db18bd64bf5924b46f98f9a433483938e74a5182756ea33e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RuntimeBuilder.build: MethodTooLong \u2014 build runs 136 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tasks/src/runtime.rs"},"region":{"startLine":969}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a0c35900840c5338899310470c42e5bf92ba579fda3967fe65f113d2551bb12"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArenaParallelSparseTrie.update_cached_rlp: MethodTooLong \u2014 update_cached_rlp runs 136 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/sparse/src/arena/mod.rs"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"e16623d87ad9302dcee7c79e09f0cb47f7464f79be51d37acd9b6a7853728c5d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/cached_state.rs: FileTooLong \u2014 674 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 174 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":"crates/engine/execution-cache/src/cached_state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"056766d6af588c240be7d8a38fc26bd62bcc4573daedd24220aa4e2073ef33c5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/multiplex.rs: FileTooLong \u2014 673 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 173 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":"crates/net/eth-wire/src/multiplex.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c6f8ea1ebd4d9838dd6563cbbf93cc9787c89689ed3d810ef7f31f194082de"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/proofs.rs: FileTooLong \u2014 669 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 169 over it, 1.34\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":"crates/trie/common/src/proofs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba183f9a1a2ca692b8493b363408c3be94df8ecac433b3da08458adc70769748"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Runtime: 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":"crates/tasks/src/runtime.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ea2f931a033e6feb3b9df56b357bbf4c522f372adee72e007f2e69fd8c60cd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: args/rpc_server.rs: FileTooLong \u2014 661 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 161 over it, 1.32\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":"crates/node/core/src/args/rpc_server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c3879e6943f4ab23d8da241551ff99053d065e1884ea6c8fb2c585fa3ff790"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: download/mod.rs: FileTooLong \u2014 659 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 159 over it, 1.32\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":"crates/cli/commands/src/download/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f7b343f4bf934a9a319bc515033e9cbacdf7d03e6ee2f755a0f2a337260790"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TransactionFetcher: ClassTooLong \u2014 521 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 25 methods, 4 blocks, lines 96-1153. The bar is 400 significant lines; this is 121 over it, 1.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/transactions/fetcher.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"81018a524967e9dcc9fa9c1fb7ad282fb49ef87b46528b4cd077a48e0d09b066"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EthTransactionValidator: TooManyMethods \u2014 39 methods. The bar is 30 methods; this is 9 over it, 1.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/validate/eth.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11093fea3175e738922849a5473a5e74ef16aae0944b0e84fb4aecbd55e79dc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TransactionsManager.import_transactions: MethodTooLong \u2014 import_transactions runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/transactions/mod.rs"},"region":{"startLine":1347}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dead9e8e9de7d01f88d69cb8aedb3950eba8cc689f7457939249c45f46f34dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: args/network.rs: FileTooLong \u2014 645 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 145 over it, 1.29\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/core/src/args/network.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6acc14ecfd1ca88a3f8b6db699d391c61535c54c06f52c210d94cb4b142fde2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/transaction.rs: FileTooLong \u2014 645 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 145 over it, 1.29\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc-convert/src/transaction.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e75ede2c7c6cc8c9a77077c7b3d1c11e39c558711cbe81041d5623479a4980"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: reth_network::session::authenticate_stream: FunctionTooLong \u2014 reth_network::session::authenticate_stream runs 129 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/session/mod.rs"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"19aff44c2aae4e955dfd1002f1c0fc91b50262c1e45124dbae0be82d174416ce"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: payload_processor/reuse.rs: FileTooLong \u2014 642 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 142 over it, 1.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/tree/src/tree/payload_processor/reuse.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d2535dec0591562959be8e4b6f8a2c51aa9567e3cd5ae0eac33d580898aa43"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TestingApi.build_payload_v1: MethodTooLong \u2014 build_payload_v1 runs 128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc/src/testing.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"f239eb103561be1bf16e8e6b923a35361b56f874bb87b87b33171dca6498b60e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tree/mod.rs: FileTooLong \u2014 638 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 138 over it, 1.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/tree/src/tree/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d89acb417a606d9c51eca2cf9a8f6e51ef626dd4c715e18690b8ade90805fa0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: helpers/call.rs: FileTooLong \u2014 638 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 138 over it, 1.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc-eth-api/src/helpers/call.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"893079bf453e7f2979ab3520f05006d024cfcfa0b1c09eb6418f1f3774a5a493"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DatabaseProvider.take_state_above: MethodTooLong \u2014 take_state_above runs 127 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/database/provider.rs"},"region":{"startLine":3076}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b589b47bc233b0a3f0b188ee9d982b2deaba223622a193b7190f69b747d2b1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Chain: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/execution-types/src/chain.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d05ed02e7613616bcf51faef900942eda5284553c3eedf5119d962c61365ee"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NodeConfig: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/core/src/node_config.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"f18f35fe40946cbcde3922e3de46e758498d34371fd43fe800499a333a307f8a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SparseStateTrie: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/sparse/src/state.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b041a6175b586d234576e188465ced48c53352d7a2ad2d51f22d418e193224"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: DatabaseProviderMetrics: TooManyFields \u2014 38 stored fields beside 3 methods. The bar is 30 stored fields; this is 8 over it, 1.27\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/database/metrics.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"af61a7fd88354d51969b4ea02dc71f1ad771c3ae3364eeb83b02cae4d986e511"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/either_writer.rs: FileTooLong \u2014 631 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 131 over it, 1.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/either_writer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24335d1fae80a075c4270c6e591cc9ad722db0a25441ae9c62a945a42dc07cf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/core.rs: FileTooLong \u2014 628 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 128 over it, 1.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc-eth-api/src/core.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af8a4822f2aeb1d0b9327eea626a3b2b9cdbda44a9a42a17dac04720d0eedf7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EthTransactionValidator: ClassTooLong \u2014 500 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 39 methods, 6 blocks, lines 80-1521. The bar is 400 significant lines; this is 100 over it, 1.25\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":"crates/transaction-pool/src/validate/eth.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef696b9177b83641607b3b89f67b5a21361359f5cb356a07f52798c88803e01"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/full_block.rs: FileTooLong \u2014 625 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 125 over it, 1.25\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":"crates/net/p2p/src/full_block.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5008525d9ef5b40adef634fcc8b939900d8b66017a2ab8742fb4046d0bb49591"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MerkleStage.execute: MethodTooLong \u2014 execute runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"crates/stages/stages/src/stages/merkle.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ebc85fd61d88bb38cc551fe86d0510f3ba92768e6d3b2eb90f7a005aaf9012"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TraceApi: ClassTooLong \u2014 499 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 19 methods, 8 blocks, lines 49-838. The bar is 400 significant lines; this is 99 over it, 1.25\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":"crates/rpc/rpc/src/trace.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"f652db620f4419cf7fa1d19703df2b6462d976a0fcecb08fde005ff378df8d6f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RpcBlockchainProvider: ClassTooLong \u2014 499 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 8 methods, 21 blocks, lines 133-915. The bar is 400 significant lines; this is 99 over it, 1.25\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":"crates/storage/rpc-provider/src/lib.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb066faae19cb0675b16724f43541234e70a7bd85a4a18af1aa9bf696426eda3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: database/mod.rs: FileTooLong \u2014 622 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 91% of them inside a single declaration: ProviderFactory (26 blocks, 75-1020). The bar is 500 significant lines; this is 122 over it, 1.24\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/database/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65b46e0dddfccbdc8e4e1466f5a0832a38a00d8b89d1db359b85a50c03b4b10"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: download/fetch.rs: FileTooLong \u2014 620 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 120 over it, 1.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/download/fetch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ab24bac4ba645b81e70df371bcd01156fb7ace362c05ec3234236dc02d14197"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Cursor: TooManyMethods \u2014 37 methods. The bar is 30 methods; this is 7 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/libmdbx-rs/src/cursor.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"d623c44918676b84739e0eeb733e2e2d408323d0b3ad02fc25033e7d4850e2bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/eth_requests.rs: FileTooLong \u2014 616 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 116 over it, 1.23\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":"crates/net/network/src/eth_requests.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a536cc0b92ca9809ed1c4012d8f1233134ef76a0909dbc5579fd8a272505472"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/runtime.rs: FileTooLong \u2014 616 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 116 over it, 1.23\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":"crates/tasks/src/runtime.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b5ef196a8edbed2714fac36d10c68828bfedbe7a7cea21c2f78d4e38585c8b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/updates.rs: FileTooLong \u2014 610 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 110 over it, 1.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/common/src/updates.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b4951ea200785a4c13f65ff7c19e094d724eae1c15be8fa2a13119f5618a59"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ProofCalculator.next_uncached_key_range: MethodTooLong \u2014 next_uncached_key_range runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"crates/trie/trie/src/proof_v2/calculator.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e6fc7db3dc12fabd1189eea910afef8485b2ea0a7bb1b4ce0d448d6c076a33e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: OverlayManager: ClassTooLong \u2014 485 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 30 methods, 4 blocks, lines 49-781. The bar is 400 significant lines; this is 85 over it, 1.21\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":"crates/storage/storage-overlay/src/manager.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd064a5a917f5f664a4aa27dab3225cc8fba94c22566379a47d8c558b517e54"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SessionManager: ClassTooLong \u2014 481 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 29 methods, 2 blocks, lines 76-854. The bar is 400 significant lines; this is 81 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/session/mod.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93974a6ec8313330cd914de59c85b143de4900fc01d112d4e64d546c00bbea5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ActiveSession: ClassTooLong \u2014 481 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 22 methods, 3 blocks, lines 152-1046. The bar is 400 significant lines; this is 81 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/session/active.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"a323b260e7ae11dd9d26dc2f381e068e8bdb5514f455284b2228cddb7b5916c5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NetworkManager: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/manager.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"74532cca97017b1d9f7ed8e50233fc61cac0db402d44f61da43f97b167a70601"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: JitMetrics: TooManyFields \u2014 36 stored fields beside 2 methods. The bar is 30 stored fields; this is 6 over it, 1.20\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ethereum/evm/src/factory.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"5383147e594b44a8438d683b59cd56e10209ac33efa58d6add9fb65d20d17bd5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Command.execute: MethodTooLong \u2014 execute runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/get.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"84dfd4e0bc280cd7f3ce02c588e5a8c41a513196b86dfd5d54c98a120bf0dcfa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cache/mod.rs: FileTooLong \u2014 598 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 98 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":"crates/rpc/rpc-eth-types/src/cache/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be27aff16e4f55cb4e0f131eafe70c21768fca6613bf3991947c1b65fdff1ec0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/trie.rs: FileTooLong \u2014 591 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 91 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":"crates/trie/trie/src/trie.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b3091663f4e4781b5b7c026a563583d427bfd9afc0a6389c467d895ebfc3f1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TrieWitness.compute: MethodTooLong \u2014 compute runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/trie/src/witness.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"60f09df36b25e4a361267c9f9f7292d15878155c6edf99bcf205014b1d51d165"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ReverseHeadersDownloader: ClassTooLong \u2014 470 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 25 methods, 5 blocks, lines 69-968. The bar is 400 significant lines; this is 70 over it, 1.18\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/downloaders/src/headers/reverse_headers.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e6d8225fb5c82b09d742546a2195ccfc3670fce64458deee7f2401321dce7d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/trace.rs: FileTooLong \u2014 587 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 85% of them inside a single declaration: TraceApi (8 blocks, 49-838). The bar is 500 significant lines; this is 87 over it, 1.17\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc/src/trace.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"693752680cfc369d49a80fc1e0d9fd4472320377d81f3a350b68fddfd535a241"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: helpers/transaction.rs: FileTooLong \u2014 585 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 73% of them inside a single declaration: EthTransactions (65-765). The bar is 500 significant lines; this is 85 over it, 1.17\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc-eth-api/src/helpers/transaction.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1532c44d9a0736da4b0604e0b36d753f0aed81f17cba529cf2f84404f4329b42"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NoopProvider: ClassTooLong \u2014 467 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 3 methods, 40 blocks, lines 57-810. The bar is 400 significant lines; this is 67 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/storage-api/src/noop.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f0e5c728e110d32faf35f0d623c265b2ec8633b95d86d4209a0da51a1a04b2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: TreeConfig: TooManyFields \u2014 35 stored fields beside 73 methods. The bar is 30 stored fields; this is 5 over it, 1.17\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/primitives/src/config.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eca11a0c7e0e3cea1f7caa691094182ec51eb016a9b2261c3ec676f7c37b805"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: NetworkArgs: TooManyFields \u2014 35 stored fields beside 16 methods. The bar is 30 stored fields; this is 5 over it, 1.17\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/core/src/args/network.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f87ae4caa5db1127778750aa2e58832c4e93f51eb213b2f3e4d8cbb14f18c6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: EngineArgs: TooManyFields \u2014 35 stored fields beside 5 methods. The bar is 30 stored fields; this is 5 over it, 1.17\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/core/src/args/engine.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7bc920ea23ac44bf46df86087198b97c7056ac54691a2daec5928e59b673694"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BasicEngineValidator.calculate_timing_stats: MethodTooLong \u2014 calculate_timing_stats runs 116 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/tree/src/tree/payload_validator.rs"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"7290cdff8a7223fd01e5cacf015d6fa01185f087ec0c2b63771ab268a6edc551"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RocksDBProvider: ClassTooLong \u2014 462 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 48 methods, 3 blocks, lines 804-1675. The bar is 400 significant lines; this is 62 over it, 1.16\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/rocksdb/provider.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e08a1f030b50d4569f3d0d6c2613dee2baff0d620d1664d77ae067375a542e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: payload_processor/prewarm.rs: FileTooLong \u2014 576 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 76 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/tree/src/tree/payload_processor/prewarm.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31bb4a1b9bf54d671ceeed5895afb30615356d9f2ccc41819246620315cec5c0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 568 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 68 over it, 1.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/payload/basic/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"622b5de5530227a635e07922404e8021bce720b14a5d3906cf7f37ed25e198ea"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ExecutionOutcome: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/execution-types/src/execution_outcome.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95cfc044f1e8f82fe6dee99934a0dfaede5230cd6155429e3b331c18df932db"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/hashed_state.rs: FileTooLong \u2014 554 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 54 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/common/src/hashed_state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98df3de077a54ab3cca3fbadd607c2075096166ecc7d8cfd1d159faef42f0af7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AllTransactions: ClassTooLong \u2014 443 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 29 methods, 3 blocks, lines 1444-2364. The bar is 400 significant lines; this is 43 over it, 1.11\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":"crates/transaction-pool/src/pool/txpool.rs"},"region":{"startLine":1444}}}],"partialFingerprints":{"codehealthFindingId/v1":"83cf0beaf15ce82da8b971e12ffef09fd685c347bad7c547438eb4a97bad1df5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DefaultEngineValues: 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":"crates/node/core/src/args/engine.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f8156a62694f2dd4e5d7df146ee91f6bda83a5cb4c6fc0ab8196f3ae818f36"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DefaultTxPoolValues: 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":"crates/node/core/src/args/txpool.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"24cc4555d5b0381c53dcd82b26eb4a3eec87d53a8a13c389dba7f596d68dba23"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TransportRpcModules: 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":"crates/rpc/rpc-builder/src/lib.rs"},"region":{"startLine":1779}}}],"partialFingerprints":{"codehealthFindingId/v1":"c010317b6403c78ec08f3ca3d62791ea0aa06abf023d2a567de4ecd2af819684"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EthTransactionValidatorBuilder: 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":"crates/transaction-pool/src/validate/eth.rs"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f7527c02991a4a35a03a602e41a1fec952ad382a8c7e17ffc9b41b68808a67"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/node.rs: FileTooLong \u2014 550 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 50 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ethereum/node/src/node.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be4ef0517b203bdeedf380ba1c6096bb111954803260f4cdc46a166510a7fa81"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/broadcast.rs: FileTooLong \u2014 546 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 46 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/eth-wire-types/src/broadcast.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e3a63f9909c3923889fc652bcea8935b27dc5233eaa6b40229edabd2a369f9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArchiveFetcher.download_sequential: MethodTooLong \u2014 download_sequential runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"crates/cli/commands/src/download/fetch.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"50dbcbadd83a3f4d875ba49b2d4534692552aa8dc10782666409020cd4329832"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EthTransactionValidator.validate_stateless: MethodTooLong \u2014 validate_stateless runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"crates/transaction-pool/src/validate/eth.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"572dbb774a0ac277bd7e8b6ba9858e01d0427a0c57a1ae37ca0c869056f78e1d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builder/mod.rs: FileTooLong \u2014 543 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 43 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/builder/src/builder/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ab99ad310cb725a75a386500073af20ecc230f6bb0e0e878d41dce2876c92f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/validation.rs: FileTooLong \u2014 540 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 70% of them inside a single declaration: ValidationApi (4 blocks, 56-650). The bar is 500 significant lines; this is 40 over it, 1.08\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc/src/validation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f5646dad9a91a0a4c1df4bb0893f3102d6ed393dc24cda236ad4df88018acb"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EthApiBuilder: ClassTooLong \u2014 429 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 47 methods, 5 blocks, lines 31-649. The bar is 400 significant lines; this is 29 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc/src/eth/builder.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc44118dee1b49dec05789338dff71b5c3a52f5b92a3fd837ef997f218f7047"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NetworkManager.new: MethodTooLong \u2014 new runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/manager.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d45786300f4c2e8671e1dabfb3f56788bab7f3dff686e58c1a6d34d0be437f3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EstimateCall.estimate_gas_with: MethodTooLong \u2014 estimate_gas_with runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc-eth-api/src/helpers/estimate.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4ab551bd7383294cbf779b4a8ff41cfd4f41ebcefb1529673643b4fe754688"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EthTransactions: ClassTooLong \u2014 426 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 25 methods. The bar is 400 significant lines; this is 26 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc-eth-api/src/helpers/transaction.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dfb4ef0a9313b48555bd61987b9a30ef2a8885f6aab929bef92a7e831654416"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/history.rs: FileTooLong \u2014 531 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 31 over it, 1.06\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":"crates/era-utils/src/history.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf2f6d55c1bcaa69eca072258e26e2efb7d6379afdbc4939e4853de301b444c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: inject-cargo-docs.injectCargoDocs: FunctionTooLong \u2014 injectCargoDocs 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":"docs/vocs/scripts/inject-cargo-docs.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"279ff4629f38d80a1bc2d507b859c6b6574c9b12ce545551b8e0be0bd3bd9f88"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ActiveSession.on_incoming_message: MethodTooLong \u2014 on_incoming_message runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/session/active.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"b32ced259f43f6805fb295a95431a181381b195ba362896952bf1e7bb32c5ba8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EthPubSub.handle_accepted: MethodTooLong \u2014 handle_accepted runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc/src/eth/pubsub.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd46339cca9ac693ffb9a22675b9ae3e41eef8c1c431553bc09466ec61acac93"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/noop.rs: FileTooLong \u2014 521 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 90% of them inside a single declaration: NoopProvider (40 blocks, 57-810). The bar is 500 significant lines; this is 21 over it, 1.04\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/storage-api/src/noop.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa875bf88cab35db81999cb492ebd0f33cd63f15d4742db398a94875fa23ca59"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/p2pstream.rs: FileTooLong \u2014 519 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 19 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":"crates/net/eth-wire/src/p2pstream.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc427a5ef9ebaea7fc57ab659922608388212492f16ecb5939537063e5cbd3c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: DefaultEngineValues: TooManyFields \u2014 31 stored fields beside 33 methods. The bar is 30 stored fields; this is 1 over it, 1.03\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/core/src/args/engine.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"cafb46b696f85a9cad0f4ce33428fa47c6efaad967943bdbf0273d57fc1e380d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: DefaultTxPoolValues: TooManyFields \u2014 31 stored fields beside 33 methods. The bar is 30 stored fields; this is 1 over it, 1.03\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/core/src/args/txpool.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e14c8e6263cde1030d02d05b3365c03978d48864b12c7cd591abe33ca4576bb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EitherWriter: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/either_writer.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"71febf816facb61f0113de10327294003be956ed911f4cf342fc9af6f31b1fe8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ArenaParallelSparseTrie: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/sparse/src/arena/mod.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"02911925cd40df6eb2e0df70ad42772b1af4815a73c04b28de97c21bfca120ed"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: SparseTrieCacheTask: TooManyFields \u2014 31 stored fields beside 30 methods. The bar is 30 stored fields; this is 1 over it, 1.03\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/tree/src/tree/state_root_strategy/sparse_trie.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"223b843c387a95fdc6388bc2f2e4f36b4a8306c9c02a330004e426d24fdd70e4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: TxPoolArgs: TooManyFields \u2014 31 stored fields beside 2 methods. The bar is 30 stored fields; this is 1 over it, 1.03\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/core/src/args/txpool.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a112af89b55350cbe74d76d0373882655f589192c1a171cafc35d172cd69f09"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ExecutionTimingStats: TooManyFields \u2014 31 stored fields. The bar is 30 stored fields; this is 1 over it, 1.03\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/chain-state/src/execution_stats.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"256ce71f0e785495f29abaf19af2f64a8016fb0dbd8ce36e1048d90f0debb408"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RocksDBBatch: ClassTooLong \u2014 412 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 22 methods, 3 blocks, lines 1997-2771. The bar is 400 significant lines; this is 12 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/rocksdb/provider.rs"},"region":{"startLine":1997}}}],"partialFingerprints":{"codehealthFindingId/v1":"3919e024a6d72c38e3bb78cb34c20729da5c638946b0ed6200cfa6d1af1ed3eb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DebugNodeLauncherFuture.launch_node: MethodTooLong \u2014 launch_node runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/builder/src/launch/debug.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"a62ef093897de5da3b75a1db659de757084ec70ec2e310612ac17e0202ebfb4b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Pipeline.unwind_stages: MethodTooLong \u2014 unwind_stages runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stages/api/src/pipeline/mod.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"150aa669957734d19c73594f84df492daec894931fad69898a3b9dc41cee9e99"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/message.rs: FileTooLong \u2014 513 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 13 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":"crates/net/eth-wire-types/src/message.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"acdca38b9e4cb0d80a16d2ca8032409ebe3952a4a8e153782b0d9825b0af0e0f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Pipeline: ClassTooLong \u2014 408 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 17 methods, 4 blocks, lines 70-769. The bar is 400 significant lines; this is 8 over it, 1.02\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stages/api/src/pipeline/mod.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"494e8907bc001db8258cfc1961944d97716d41cba16d196396e869b64698894d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TransactionFetcher.on_announcement: MethodTooLong \u2014 on_announcement runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"crates/net/network/src/transactions/fetcher.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a425eb32ec1527c3adf4b0f6b30897c7853dd60eeab43de583e1ca8fdd9d80"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AllTransactions.insert_tx: MethodTooLong \u2014 insert_tx runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 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":"crates/transaction-pool/src/pool/txpool.rs"},"region":{"startLine":2119}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a206db8494572dbfb497f2cb95ef2779c65c88ccf6c8b5614f4be4ee29a27b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/maintain.rs: FileTooLong \u2014 503 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 3 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/maintain.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af3da814ff6e3c11f7aaab0b3f66c30c4093652310cc9c738682ce31b0bfabd3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TreeConfig: ClassTooLong \u2014 401 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 73 methods, 3 blocks, lines 117-866. The bar is 400 significant lines; this is 1 over it, 1.00\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/primitives/src/config.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb8a729b7d7c1dc9d37828e1811c231cf93db40112ce089ce5cc36d7d339763"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (89 shared lines): crates/storage/provider/src/providers/rocksdb/provider.rs:2392-2508 | crates/storage/provider/src/providers/rocksdb/provider.rs:2546-2663 \u2014 These two members are variants of one another: 89 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":"crates/storage/provider/src/providers/rocksdb/provider.rs"},"region":{"startLine":2392}}}],"partialFingerprints":{"codehealthFindingId/v1":"96dda2a566131a206b30a48a47aad918eafe29c80582304646ce40e3f2cbfb3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (44 shared lines): crates/stages/stages/src/stages/hashing_account.rs:161-282 | crates/stages/stages/src/stages/hashing_storage.rs:90-223 \u2014 These two members are variants of one another: 44 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":"crates/stages/stages/src/stages/hashing_account.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd74a655f1a150bb2053e01e7c92711fd5470e5923685a6605c874edf8ffd1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (40 shared lines): crates/rpc/rpc-eth-api/src/helpers/transaction.rs:515-597 | crates/rpc/rpc-eth-api/src/helpers/transaction.rs:608-686 \u2014 These two members are variants of one another: 40 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":"crates/rpc/rpc-eth-api/src/helpers/transaction.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff93f2371a15473caf6db324e68e51226669907f5b394cff3c195f692c8932b"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (36 shared lines): crates/prune/prune/src/segments/user/account_history.rs:258-345 | crates/prune/prune/src/segments/user/storage_history.rs:262-352 \u2014 These two members are variants of one another: 36 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":"crates/prune/prune/src/segments/user/account_history.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"19edb021e1d0e3a07e67e722df4904a088c823ca660cd97f45d95133cb8549a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/storage/libmdbx-rs/src/cursor.rs:561-596 | crates/storage/libmdbx-rs/src/cursor.rs:656-691 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/libmdbx-rs/src/cursor.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"c405484a7e5d268894b2f94126c949321f95eb8435ea3cec63228261cf0749d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/net/discv4/src/proto.rs:283-309 | crates/net/discv4/src/proto.rs:325-351 | crates/net/discv4/src/proto.rs:368-394 | crates/net/discv4/src/proto.rs:503-537 | crates/net/discv4/src/proto.rs:590-621 \u2014 These 5 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 5 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 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/discv4/src/proto.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd45e92edaa87e1119cf4f7682094fadf0ddc92cd8a55e2bdc60d03db2c880c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/net/network/src/fetch/mod.rs:389-418 | crates/net/network/src/fetch/mod.rs:425-440 | crates/net/network/src/fetch/mod.rs:447-461 | crates/net/network/src/fetch/mod.rs:471-485 | crates/net/network/src/fetch/mod.rs:492-521 \u2014 These 5 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 5 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 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/fetch/mod.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca4252fe07e560db0df8ddf2278b5a248d3b8628a107847b68c291fea8cb111"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/cli/commands/src/db/repair_trie.rs:75-117 | crates/cli/commands/src/prune.rs:37-131 | crates/cli/commands/src/stage/run.rs:115-387 | crates/node/builder/src/launch/common.rs:800-848 \u2014 These 4 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 4 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 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/repair_trie.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f03e464df4ef63357024989278a534efd9aa66baa6993c00d62c3cf04f8d688"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/cli/commands/src/db/stats.rs:78-157 | crates/cli/commands/src/db/stats.rs:159-221 | crates/cli/commands/src/db/stats.rs:226-406 | crates/cli/commands/src/db/stats.rs:408-446 \u2014 These 4 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 4 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 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/stats.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f32b5e2161d500ae434ed924477e015cfbcff2ed8147f1a4bf0d3257874b29d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/cli/commands/src/stage/dump/execution.rs:34-58 | crates/cli/commands/src/stage/dump/hashing_account.rs:22-51 | crates/cli/commands/src/stage/dump/hashing_storage.rs:21-41 | crates/cli/commands/src/stage/dump/merkle.rs:41-77 \u2014 These 4 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 4 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 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/stage/dump/execution.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"26236ef5cc840ab79316d913c92686827b92f988fb92cb6963b88022e81ac48d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/rpc/rpc-engine-api/src/engine_api.rs:1128-1146 | crates/rpc/rpc-engine-api/src/engine_api.rs:1172-1190 | crates/rpc/rpc-engine-api/src/engine_api.rs:1195-1219 | crates/rpc/rpc-engine-api/src/engine_api.rs:1225-1250 \u2014 These 4 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 4 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 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc-engine-api/src/engine_api.rs"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a464fd04ffbb473aa3848708af6974c589dd52a4d567135f747c699a002c9ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (67 corresponding lines): crates/trie/common/src/hashed_state.rs:588-654 | crates/trie/common/src/updates.rs:677-743 \u2014 These two members are one piece of code written twice and then edited apart: 67 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/common/src/hashed_state.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b4fbce1bd69497dae1519b8dd4fb587844ca0d2817b518d75968b9a1beecc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (93 corresponding lines): crates/stages/stages/src/stages/index_account_history.rs:68-160 | crates/stages/stages/src/stages/index_storage_history.rs:72-164 \u2014 These two members are one piece of code written twice and then edited apart: 93 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stages/stages/src/stages/index_account_history.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ffa54c39bcd49eedde77be52eaa54953f200ed847380b0ad77a8a0a9692797"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (72 corresponding lines): crates/storage/db-common/src/init.rs:1044-1125 | crates/storage/db-common/src/init.rs:1149-1220 \u2014 These two members are one piece of code written twice and then edited apart: 72 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/db-common/src/init.rs"},"region":{"startLine":1044}}}],"partialFingerprints":{"codehealthFindingId/v1":"0695b4c9d6496f4be96cba5b33cc294b05dbe50334eac901f95e4b1f142ad153"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (63 corresponding lines): crates/storage/provider/src/providers/rocksdb/provider.rs:2226-2288 | crates/storage/provider/src/providers/rocksdb/provider.rs:2678-2744 \u2014 These two members are one piece of code written twice and then edited apart: 63 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/rocksdb/provider.rs"},"region":{"startLine":2226}}}],"partialFingerprints":{"codehealthFindingId/v1":"aabc7a9d2ee2290eae1e4f1c2e005e2605350d671692d42ee8af3494d3172944"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (59 corresponding lines): crates/cli/commands/src/db/get.rs:361-419 | crates/cli/commands/src/db/get.rs:431-491 \u2014 These two members are one piece of code written twice and then edited apart: 59 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/get.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7da26cfc8ad719c9db4bfdb15dc0b44a557868ee4801474c15bb62a95ae3ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): crates/cli/commands/src/db/migrate_v2.rs:126-171 | crates/cli/commands/src/db/migrate_v2.rs:176-225 \u2014 These two members are one piece of code written twice and then edited apart: 46 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/migrate_v2.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad9fff63aacad1b52a064f90efd992dd127a10fa7a0ed39a11eece49c2fc100"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (72 corresponding lines): crates/prune/prune/src/segments/user/account_history.rs:100-171 | crates/prune/prune/src/segments/user/storage_history.rs:101-173 \u2014 These two members are one piece of code written twice and then edited apart: 72 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prune/prune/src/segments/user/account_history.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"126dc69d4c1cfd274db0e64ab945d60823d0ef041a5b87d54976baafc2f6f18b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 58\u002B corresponding lines): crates/transaction-pool/src/blobstore/disk.rs:79-143 | crates/transaction-pool/src/blobstore/disk.rs:150-213 | crates/transaction-pool/src/blobstore/disk.rs:307-364 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 58 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":"crates/transaction-pool/src/blobstore/disk.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"349e2a331d874c8da888c45f0b8f657e324ef8f35f75c1cfe89f2300f3075b91"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (52 corresponding lines): crates/stages/stages/src/stages/utils.rs:251-302 | crates/stages/stages/src/stages/utils.rs:459-523 \u2014 These two members are one piece of code written twice and then edited apart: 52 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stages/stages/src/stages/utils.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9604fca4b2372cec42e7fcf8f37172aad651ebae71e9f1dc707c380e6e8ec0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (54 corresponding lines): crates/storage/provider/src/providers/static_file/manager.rs:2497-2554 | crates/storage/provider/src/providers/static_file/manager.rs:2602-2655 \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":"crates/storage/provider/src/providers/static_file/manager.rs"},"region":{"startLine":2497}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b929f9bcf9d5f2a48fb681f78cec59652148f72795135dc3007c66837c22ce6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (62 corresponding lines): crates/prune/prune/src/segments/user/account_history.rs:182-243 | crates/prune/prune/src/segments/user/storage_history.rs:184-247 \u2014 These two members are one piece of code written twice and then edited apart: 62 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prune/prune/src/segments/user/account_history.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d55836fe6c5c22e1fe9c0f86bcf292ec5d6ebc30b29ec6535b423d1f96d568"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): crates/stages/stages/src/stages/utils.rs:127-173 | crates/stages/stages/src/stages/utils.rs:183-229 \u2014 These two members are one piece of code written twice and then edited apart: 47 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stages/stages/src/stages/utils.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e34203b05c87e8ef8853af7720e955e7dbbaa47153e1105d1617864fd7cab7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/net/peers/src/node_record.rs:175-206 | crates/net/peers/src/trusted_peer.rs:118-163 \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":"crates/net/peers/src/node_record.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"84669e590f644174801ee1aa96eb9cf8a3232da4c0b925769e7b2cf8331302f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): crates/trie/common/src/proofs.rs:232-269 | crates/trie/common/src/proofs.rs:358-394 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/common/src/proofs.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"e09e5a42a43a311c28932c45faa8615bd2ca020102eca3e34eda5ba242b144d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (79 corresponding lines): .github/scripts/bench-reth-summary.py:1123-1201 | .github/scripts/bench-reth-summary.py:1211-1295 \u2014 These two members are one piece of code written twice and then edited apart: 79 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/bench-reth-summary.py"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"487e364a03e707e9e8b1d5889dc5e1458d6321c2a3e90a1e3582bb32dd225ca7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/storage/provider/src/providers/rocksdb/provider.rs:1266-1311 | crates/storage/provider/src/providers/rocksdb/provider.rs:1321-1358 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/rocksdb/provider.rs"},"region":{"startLine":1266}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa6978d14ddc19382674f838222896c692caf6897e1598b8f50775cae3ab9685"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): crates/storage/provider/src/providers/rocksdb/provider.rs:1636-1674 | crates/storage/provider/src/providers/rocksdb/provider.rs:2142-2186 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/rocksdb/provider.rs"},"region":{"startLine":1636}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcbf47a2dbb932337a4e34b1268e9d47a26da92b668076dc8e59089fcfbf80ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/transaction-pool/src/pool/pending.rs:175-212 | crates/transaction-pool/src/pool/pending.rs:226-265 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/pool/pending.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"9103667b7b7d70f492a7664968ae0999289a96c3c9ceb74e62c82793f1de94af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (54 corresponding lines): crates/storage/provider/src/providers/consistent.rs:1244-1298 | crates/storage/provider/src/providers/consistent.rs:1393-1446 \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":"crates/storage/provider/src/providers/consistent.rs"},"region":{"startLine":1244}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7156bb2548b0d3a05a68bdf41f5988c7f6e1db4bb216bd8cc65dc31cb52a7f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): crates/trie/parallel/src/proof_task/mod.rs:547-597 | crates/trie/parallel/src/proof_task/mod.rs:605-653 \u2014 These two members are one piece of code written twice and then edited apart: 49 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/parallel/src/proof_task/mod.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"81897a43a6944a48b78eb483fb66ace58d32fb7adfd496adbc7b5d76394196e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): crates/storage/storage-overlay/src/manager.rs:919-964 | crates/storage/storage-overlay/src/manager.rs:1030-1068 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/storage-overlay/src/manager.rs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"d30ccfe3e289166bee7ee36d374fd855c6eed26ee92d389176201eb09177a207"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): crates/storage/provider/src/providers/database/provider.rs:3505-3539 | crates/storage/provider/src/providers/database/provider.rs:3562-3600 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/database/provider.rs"},"region":{"startLine":3505}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbcc93bf3b9939c71daa52bf6fb3df8c87f9215e98b41d3bf24c4deebb2a4174"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): crates/trie/common/src/hashed_state.rs:1809-1845 | crates/trie/common/src/updates.rs:1527-1564 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/common/src/hashed_state.rs"},"region":{"startLine":1809}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da91edf88c386694a536a7ea22ffaa238fa174d2fca3e021a0689185e97f515"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): crates/net/network/src/session/mod.rs:302-351 | crates/net/network/src/session/mod.rs:366-406 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/session/mod.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf82950aeafcc14da87f850b447624eb951a7dc928c16d2802cc798136f18fc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): crates/trie/trie/src/hashed_cursor/post_state.rs:248-283 | crates/trie/trie/src/trie_cursor/in_memory.rs:199-233 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/trie/src/hashed_cursor/post_state.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ad197563fee44cca24ff46abeeb922779559c3c6a79a2d161f2b17fcf66a42"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/era/src/era/file.rs:154-192 | crates/era/src/ere/file.rs:182-208 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/era/src/era/file.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a6a917a15cd44152df6fa5b2c9fa6ad9bf12c3ecdd709b8cfe6a2ef010bf58"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): crates/rpc/rpc/src/validation.rs:495-534 | crates/rpc/rpc/src/validation.rs:540-582 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc/src/validation.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b68879d1f29165fbffe870fc93ee35c38ae59f88ede22f8ac9859cadb13272d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): crates/stages/stages/src/stages/utils.rs:319-359 | crates/stages/stages/src/stages/utils.rs:541-581 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stages/stages/src/stages/utils.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"768bdab3ef798f7613cb13c969e260b758fb33e1d895134b320059efd685999c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 38\u002B corresponding lines): crates/trie/trie/src/hashed_cursor/post_state.rs:301-339 | crates/trie/trie/src/trie_cursor/in_memory.rs:240-282 | crates/trie/trie/src/trie_cursor/in_memory.rs:287-324 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 38 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":"crates/trie/trie/src/hashed_cursor/post_state.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe4ab7f074c90876022935d4a369e20545a775db89dd9726e74efafb073ad7e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): docs/vocs/docs/snippets/sources/exex/hello-world/src/bin/3.rs:9-34 | docs/vocs/docs/snippets/sources/exex/tracking-state/src/bin/1.rs:22-51 \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":"docs/vocs/docs/snippets/sources/exex/hello-world/src/bin/3.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"689b746a26d53513f9d4c814367f2a11905c29ef8d0613b8691bf2e7f7bb99d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/config/src/config.rs:60-79 | crates/node/core/src/node_config.rs:549-568 \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":"crates/config/src/config.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b9f6f992ffa13f8d4f4838f036ec03a6f086527d54196466431c0ac5c5d5e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/tasks/src/worker_map.rs:60-84 | crates/tasks/src/worker_map.rs:91-116 \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":"crates/tasks/src/worker_map.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c81cb57b756ea6a5ef6a0c78978fb271c622ac66a23a705d4dbe230806b82c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/storage/provider/src/changeset_walker.rs:67-100 | crates/storage/provider/src/changeset_walker.rs:149-175 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/changeset_walker.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"067175b6762707bc53bfc9d9746f36d94d053438cdf680a25323e11c6e309b1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/tasks/src/runtime.rs:703-727 | crates/tasks/src/runtime.rs:772-802 \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":"crates/tasks/src/runtime.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9165ac3e15ce96f58cb09e753b13ade824d3cef8571bd9f009c34a55563ea3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/net/eth-wire-types/src/broadcast.rs:610-632 | crates/net/eth-wire-types/src/broadcast.rs:793-819 \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":"crates/net/eth-wire-types/src/broadcast.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"79d46eecdb44910c75f70b69f89f68f8c5110df02cce2df6d511d267697c390e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/storage/provider/src/providers/static_file/manager.rs:2465-2491 | crates/storage/provider/src/providers/static_file/manager.rs:2569-2595 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/static_file/manager.rs"},"region":{"startLine":2465}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9627d2f7c45dd14d1dc9fd090df0ee2f984f880e4c7840951116fce1230ab35"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/storage/provider/src/providers/database/provider.rs:2549-2574 | crates/storage/provider/src/providers/database/provider.rs:2579-2611 \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":"crates/storage/provider/src/providers/database/provider.rs"},"region":{"startLine":2549}}}],"partialFingerprints":{"codehealthFindingId/v1":"c90af935f67f74cf5526cf39628a3bf7ffbaf3717849d6c8b10a31f427ea07c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/cli/commands/src/download/manifest.rs:323-350 | crates/cli/commands/src/download/manifest.rs:358-388 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/download/manifest.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"58629f6adcebb54acd3837916f23009a65f272d9d2533fdf5223af44bc4b047a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 30\u002B corresponding lines): crates/engine/execution-cache/src/cached_state.rs:846-875 | crates/engine/execution-cache/src/cached_state.rs:881-910 | crates/engine/execution-cache/src/cached_state.rs:912-941 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 30 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/execution-cache/src/cached_state.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"503cdaafdba3d0c31667b600196821c08476f7e1099e1740777e662ef47307b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 39\u002B corresponding lines): crates/storage/provider/src/providers/consistent.rs:1146-1191 | crates/storage/provider/src/providers/consistent.rs:1198-1239 | crates/storage/provider/src/providers/consistent.rs:1305-1343 | crates/storage/provider/src/providers/consistent.rs:1349-1388 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 39 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":"crates/storage/provider/src/providers/consistent.rs"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6890030ad0f345b3631d789b6dc674f786e2e17e3ce1f343515ca7e72128183"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/trie/common/src/range_proof.rs:81-110 | crates/trie/common/src/range_proof.rs:130-151 \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":"crates/trie/common/src/range_proof.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d11cc069f862c581c83ec5c4014a254e1e4da6bfdfd575a001ffdd8aacf117"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/transaction-pool/src/validate/task.rs:270-291 | crates/transaction-pool/src/validate/task.rs:297-315 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/validate/task.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"0402e20fb7350b6bfd553515756c8040fc1a8a4375546c32429890575bb28293"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/node/core/src/args/trace.rs:305-334 | crates/node/core/src/args/trace.rs:342-368 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/core/src/args/trace.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"578b778f7cc52066db732df3f87765f0b1fca42c72483e5f0550fac26cd34717"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/stages/stages/src/stages/utils.rs:375-401 | crates/stages/stages/src/stages/utils.rs:599-625 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stages/stages/src/stages/utils.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"8711c2c2ebb8fd7b61c967b81d7c97d4187d01cbbbee319b924e30f88baae2bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/trie/trie/src/hashed_cursor/post_state.rs:347-379 | crates/trie/trie/src/trie_cursor/in_memory.rs:326-358 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/trie/src/hashed_cursor/post_state.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"4773983d7aa4593d320afcc3d40f9c410cab9e202521359a1cf74b0592aaef74"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/rpc/rpc/src/trace.rs:610-639 | crates/rpc/rpc/src/trace.rs:646-679 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc/src/trace.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d416b7669c0b7a77d47e92326393184d6daebdd2ae1b9c060441314affb4f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/rpc/rpc/src/validation.rs:291-315 | crates/rpc/rpc/src/validation.rs:686-712 \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":"crates/rpc/rpc/src/validation.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"72481553a8e4a0128a3bb88ae62f022da994f35dd89c35e812dcc24ad8b12725"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/storage/provider/src/providers/state/latest.rs:255-279 | crates/storage/storage-overlay/src/provider.rs:830-854 \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":"crates/storage/provider/src/providers/state/latest.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ae56de4fcde86b5dc8043814c088fd4b2c653143c43602cb39d1754af87832"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/engine/util/src/skip_fcu.rs:42-67 | crates/engine/util/src/skip_new_payload.rs:38-64 \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":"crates/engine/util/src/skip_fcu.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a65ea493b3130f6e5045daf55e5740751c43014679129ceef9f66952badb93"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/trie/common/src/proofs.rs:735-759 | crates/trie/common/src/proofs.rs:785-808 \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":"crates/trie/common/src/proofs.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3dd98d503348dc0606947bbd608d85e68228beacd8c5c79df76f2028581d541"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/storage/provider/src/providers/static_file/writer.rs:1337-1368 | crates/storage/provider/src/providers/static_file/writer.rs:1400-1429 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/static_file/writer.rs"},"region":{"startLine":1337}}}],"partialFingerprints":{"codehealthFindingId/v1":"1150e77ea8083199efc4bc03196b0fcd481fb06cdf1b0b8690ecbb840c063088"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/storage/storage-overlay/src/provider.rs:502-528 | crates/storage/storage-overlay/src/provider.rs:911-939 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/storage-overlay/src/provider.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"4699155f6f4aaabbc022a59acbb1dd7372b2c6a4bd1cb0455d838d8bd3864933"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/net/network/src/transactions/mod.rs:2067-2086 | crates/net/network/src/transactions/mod.rs:2113-2132 \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":"crates/net/network/src/transactions/mod.rs"},"region":{"startLine":2067}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb87f48c0506b27022d558e46973092297c98f6a817d2cfd330df31ed3b31fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/trie/common/src/hashed_state.rs:101-122 | crates/trie/common/src/hashed_state.rs:468-495 \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":"crates/trie/common/src/hashed_state.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"21bc8a24198d0b57f20eef0777cf079d105470014d22a419d2893584f626110c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): docs/vocs/docs/snippets/sources/exex/remote/src/exex_2.rs:31-49 | docs/vocs/docs/snippets/sources/exex/remote/src/exex_3.rs:47-65 | docs/vocs/docs/snippets/sources/exex/remote/src/exex_4.rs:67-85 \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":"docs/vocs/docs/snippets/sources/exex/remote/src/exex_2.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"713bbbeb7e74ee532d356da5a7858793bf0bd560ed05bf9a3a85b7d2b430833e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/storage/provider/src/providers/rocksdb/provider.rs:1371-1390 | crates/storage/provider/src/providers/rocksdb/provider.rs:1402-1421 \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":"crates/storage/provider/src/providers/rocksdb/provider.rs"},"region":{"startLine":1371}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ae8fbd8b05bd155a1bad0437e0c6eefdf6bdf30ac9983a495607a4a75d4b3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/storage/provider/src/providers/static_file/writer.rs:1440-1467 | crates/storage/provider/src/providers/static_file/writer.rs:1504-1530 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/static_file/writer.rs"},"region":{"startLine":1440}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb78a0cc18fe0a1199c3cfd38b3ca48da5acf1221846db108580f9fe5c83dae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/transaction-pool/src/pool/blob.rs:110-140 | crates/transaction-pool/src/pool/blob.rs:167-189 \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":"crates/transaction-pool/src/pool/blob.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"f147218594c0415a114d3bea740951fcc26ae69f7cf5486c3539038efffc253e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/net/network/src/eth_requests.rs:250-276 | crates/net/network/src/eth_requests.rs:414-440 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/eth_requests.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd3ec6ddfb2503a88377c68d621d02a020173180f517faa044178da435c9fc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/storage/db/src/mdbx.rs:33-50 | crates/storage/db/src/mdbx.rs:54-69 \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":"crates/storage/db/src/mdbx.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c0914ef7af5b50ee3e2362aea0638d2801ac6e9d8a6471ba8e0631e10f23d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/engine/execution-cache/src/cached_state.rs:532-551 | crates/engine/execution-cache/src/cached_state.rs:572-591 \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":"crates/engine/execution-cache/src/cached_state.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49242b0a81c9720d0a273b108c113b60c0ea06080023f348c9d413cc0eaab0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/engine/tree/src/tree/payload_processor/reuse.rs:882-900 | crates/engine/tree/src/tree/payload_processor/reuse.rs:917-937 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/tree/src/tree/payload_processor/reuse.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcaf2bfe06cebafd64bbbf2c3c38b24e6cd4aff3b37eb4bf11dc4ebe6f1fe1f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 21\u002B corresponding lines): crates/storage/db/src/implementation/mdbx/cursor.rs:298-318 | crates/storage/db/src/implementation/mdbx/cursor.rs:320-340 | crates/storage/db/src/implementation/mdbx/cursor.rs:344-364 | crates/storage/db/src/implementation/mdbx/cursor.rs:380-400 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 21 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":"crates/storage/db/src/implementation/mdbx/cursor.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"c97c445fc6810dffe1fb6824a22eed71c6c0e74757117bc5ebd46a402ba6c791"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/storage/nippy-jar/src/cursor.rs:79-104 | crates/storage/nippy-jar/src/cursor.rs:119-145 \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":"crates/storage/nippy-jar/src/cursor.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad73a6f49d248aade2cad5492c9c46bf7876f520000df3e6cee251a1b7adce8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/storage/storage-overlay/src/provider.rs:995-1007 | crates/storage/storage-overlay/src/provider.rs:1012-1026 \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":"crates/storage/storage-overlay/src/provider.rs"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"39b3c570e9497bd5782e1233ce5465d0cbcca0c27a2a4783481ec65a2fa8bdbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/transaction-pool/src/blobstore/mem.rs:27-52 | crates/transaction-pool/src/blobstore/mem.rs:59-82 \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":"crates/transaction-pool/src/blobstore/mem.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c8840ed48635c67cb36976eeef67d4772648c0de44e081eb7595bdec3bbda6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/engine/invalid-block-hooks/src/witness.rs:207-232 | crates/engine/invalid-block-hooks/src/witness.rs:240-262 \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":"crates/engine/invalid-block-hooks/src/witness.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb11347064bf60049664c01e481926f86ea500868bcb267721b353dd6252bb9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/ethereum/evm/src/convert.rs:74-88 | crates/ethereum/evm/src/convert.rs:96-116 \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":"crates/ethereum/evm/src/convert.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee3c44a3cfbd3e01e0f60e36710582590a0841ad7c0516c569ee44d8b53b9ef8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/rpc/rpc-engine-api/src/engine_api.rs:1152-1167 | crates/rpc/rpc-engine-api/src/engine_api.rs:1292-1307 | crates/rpc/rpc-engine-api/src/engine_api.rs:1314-1329 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc-engine-api/src/engine_api.rs"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce4668da3c3f3ebdae9674775091e4caa0d805df35d8cf4e5ff4d8236c51e4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/storage/storage-overlay/src/provider.rs:757-769 | crates/storage/storage-overlay/src/provider.rs:775-787 \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":"crates/storage/storage-overlay/src/provider.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fadc59cd3a02070d87bd51c99f0fc4cc0f0d6d8de5acba5803a8d9a1ee44fbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/trie/common/src/updates.rs:161-181 | crates/trie/common/src/updates.rs:185-207 \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":"crates/trie/common/src/updates.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"81962a772cb2e1ca3c9d9bf2cded7353c56a9aa4d47a66f526eba4adf6c1afe2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/cli/commands/src/stage/dump/execution.rs:140-162 | crates/cli/commands/src/stage/dump/hashing_storage.rs:49-71 \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":"crates/cli/commands/src/stage/dump/execution.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c8caeaae97078709d41fec0c58cfcea09d13d199eacbbbf26a6ada5609ce40e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/storage/provider/src/providers/rocksdb/provider.rs:1037-1054 | crates/storage/provider/src/providers/rocksdb/provider.rs:2827-2840 \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":"crates/storage/provider/src/providers/rocksdb/provider.rs"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dbe5d0a0da1d9b699cdb0f3ef2b3f57d30aee0e8757b1199c73cfac7f4b92aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/prune/prune/src/segments/user/account_history.rs:65-86 | crates/prune/prune/src/segments/user/storage_history.rs:66-87 \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":"crates/prune/prune/src/segments/user/account_history.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"b732bc60c0d194989585b924dd859f5fa1ceab01abe72da9d13480c51466e449"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/ethereum/engine-primitives/src/payload.rs:142-171 | crates/ethereum/engine-primitives/src/payload.rs:176-208 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ethereum/engine-primitives/src/payload.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"daf927c38ab330f9d46cee126615049a580b9d21380ef0428f41b99990ac53e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/net/eth-wire-types/src/capability.rs:232-243 | crates/net/eth-wire-types/src/capability.rs:361-374 \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":"crates/net/eth-wire-types/src/capability.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"d514b3be2e5ae5db5c0e3addcca67aab98fddc278c9a8b858c05dc4e2286e576"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/net/p2p/src/full_block.rs:650-666 | crates/net/p2p/src/full_block.rs:985-1001 \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":"crates/net/p2p/src/full_block.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db571111dbe164306a0e1d34e635dfe77e9f8943f0b6bc57fce2bb065f3bf5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/node/builder/src/builder/mod.rs:273-286 | crates/node/builder/src/builder/mod.rs:297-313 \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":"crates/node/builder/src/builder/mod.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8825dfd65177b0a3d8ede93af72d5b3e9e9404f85c2f8406fda8954ba03ed8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): .github/scripts/bench-call-summary.py:783-793 | .github/scripts/bench-reth-summary.py:1895-1905 \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":".github/scripts/bench-call-summary.py"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"381dc90cfad326a15c82584df56f6ced5897347151adbcbfacc86dc6a6dd1bb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/net/network/src/session/active.rs:610-629 | crates/net/network/src/session/active.rs:636-659 \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":"crates/net/network/src/session/active.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"92eaccc647bef1b61e30482341a73d89506a5762ce146d7841fd9157a19d383c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/node/core/src/args/database.rs:127-143 | crates/node/core/src/args/debug.rs:289-300 \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":"crates/node/core/src/args/database.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"7623f390c13eaf67d173821e143dd526528043f9ccb889cca5e2901813dc7b3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/storage/libmdbx-rs/src/transaction.rs:404-416 | crates/storage/libmdbx-rs/src/transaction.rs:436-448 \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":"crates/storage/libmdbx-rs/src/transaction.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d866d2fd8d3bb789fa044e2690f9d532a30b4461c01d889b969c6bfb8fcbf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/trie/trie/src/trie_cursor/mock.rs:192-202 | crates/trie/trie/src/trie_cursor/mock.rs:208-219 \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":"crates/trie/trie/src/trie_cursor/mock.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3bbb80c4fab4e45387a7f27550c080daa74a1da6c6cd268063fad611bf30bdb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/cli/commands/src/download/tui.rs:228-239 | crates/cli/commands/src/download/tui.rs:241-252 \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":"crates/cli/commands/src/download/tui.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c67d8236082a9dc1ded9aa1c3ce6d717220fb5e92f4f88c467c47e9fa9abe0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/net/ecies/src/algorithm.rs:453-470 | crates/net/ecies/src/algorithm.rs:529-548 \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":"crates/net/ecies/src/algorithm.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"57dc5793558b2e15f56a96b696ef9df8a4d5784aef2304121bd3d4586ec20f2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 52\u002B corresponding lines): crates/rpc/rpc/src/eth/builder.rs:86-137 | crates/rpc/rpc/src/eth/builder.rs:190-241 | crates/rpc/rpc/src/eth/builder.rs:247-298 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 52 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":"crates/rpc/rpc/src/eth/builder.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa2d99b405796ed8572e36a5b371da71069a66685c576058c893821b76105aa5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/storage/storage-overlay/src/manager.rs:732-750 | crates/storage/storage-overlay/src/manager.rs:758-780 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/storage-overlay/src/manager.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf9f555d426c054a1d39dd17f60f1469d585fbef168c8810c6e80d833278596"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/rpc/rpc/src/eth/helpers/signer.rs:28-41 | crates/rpc/rpc/src/eth/helpers/signer.rs:48-68 \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":"crates/rpc/rpc/src/eth/helpers/signer.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"237a3cc8a438dfa5c86c970d36fdef0e450248c7cf2f27302a2db191a3f6eb3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): crates/storage/provider/src/providers/database/mod.rs:382-406 | crates/storage/provider/src/providers/database/mod.rs:413-431 | crates/storage/provider/src/providers/database/mod.rs:442-458 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/database/mod.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc44b9ff90fcd6159914f31b6b120dd97465766767e67f32efdbdcf0984fbbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/storage/storage-overlay/src/manager.rs:70-87 | crates/storage/storage-overlay/src/manager.rs:103-119 \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":"crates/storage/storage-overlay/src/manager.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"9893af58ea6d404fc84bbcd048f508967d2708ca5a0338c652e621f8f5e9a448"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/era-downloader/src/client.rs:133-149 | crates/era-downloader/src/client.rs:152-168 \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":"crates/era-downloader/src/client.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1c2381f65d3c9416b8cc74b66ccd2f7377dd13659bf583218cdb2ed3a2199c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/era/src/era1/types/execution.rs:332-351 | crates/era/src/era1/types/execution.rs:374-393 \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":"crates/era/src/era1/types/execution.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd15a0f138d452e3615dcf986bdfaa59075f82af5acece8a6b761e5d2d1a264"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/storage/provider/src/providers/static_file/manager.rs:563-577 | crates/storage/provider/src/providers/static_file/manager.rs:584-606 \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":"crates/storage/provider/src/providers/static_file/manager.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed221bd48fe18813cbb736fd5b7a9e19bae47fa8c8904249608ac006a834d5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/cli/commands/src/db/tui.rs:136-162 | crates/cli/commands/src/download/tui.rs:343-358 \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":"crates/cli/commands/src/db/tui.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da388c63255cf97ec1ddf7f3f74386e3b8e2696b1d79809ea754611fd01feb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/net/eth-wire-types/src/message.rs:800-816 | crates/net/eth-wire-types/src/message.rs:844-862 \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":"crates/net/eth-wire-types/src/message.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f94dad1a7016cffcfa75f8b600aeaa42f531eba540baaeff1c01d7d9f8f504"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/storage/nippy-jar/src/compression/lz4.rs:10-34 | crates/storage/nippy-jar/src/compression/lz4.rs:52-76 \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":"crates/storage/nippy-jar/src/compression/lz4.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1011a2fabbcb0089490b73edf1e00f6d0e3f49e0d426d9eecff53d8ffe1198"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/storage/provider/src/init.rs:103-115 | crates/storage/provider/src/init.rs:129-145 \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":"crates/storage/provider/src/init.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d9234a935f78be02dda0ab370001222977aa972261866f88ce3d5b5773e03d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/storage/provider/src/providers/rocksdb/provider.rs:1768-1783 | crates/storage/provider/src/providers/rocksdb/provider.rs:1796-1814 \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":"crates/storage/provider/src/providers/rocksdb/provider.rs"},"region":{"startLine":1768}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac1764cbcdf7992bda88a8a7642a3c9404dfb4efea5edd3eca398e1bcc33c967"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): crates/trie/common/src/prefix_set.rs:281-304 | crates/trie/common/src/prefix_set.rs:312-335 | crates/trie/common/src/prefix_set.rs:339-357 \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":"crates/trie/common/src/prefix_set.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"f480a40b4faf2f269e4f525374dbb1cab612714d7b158f43743f51cb002a7b41"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 23\u002B corresponding lines): crates/cli/commands/src/stage/dump/hashing_account.rs:83-105 | crates/cli/commands/src/stage/dump/hashing_storage.rs:78-100 | crates/cli/commands/src/stage/dump/merkle.rs:165-188 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 23 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/stage/dump/hashing_account.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"596fa10174fe3a16834a8466a4be58b4d7a83d060c50d329afc255f2f561f201"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/storage/provider/src/either_writer.rs:859-880 | crates/storage/provider/src/either_writer.rs:906-926 \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":"crates/storage/provider/src/either_writer.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a835c3960cdd483d97f6a67c9c17dc7ff81e3697e395c29a1620ba9aaaebf43"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/storage/provider/src/providers/static_file/writer.rs:139-158 | crates/storage/provider/src/providers/static_file/writer.rs:189-208 \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":"crates/storage/provider/src/providers/static_file/writer.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ddc190f92b97c28351d40de2a84bdc9608d078327a831388a486086bc1c49ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/net/discv5/src/config.rs:417-429 | crates/net/discv5/src/config.rs:432-444 \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":"crates/net/discv5/src/config.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"a48d07c6d5595375f5689ce6ddf12a3c363458479ae2fe74aa884db16f193884"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/rpc/rpc-layer/src/compression_layer.rs:41-56 | crates/rpc/rpc-layer/src/decompression_layer.rs:44-64 \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":"crates/rpc/rpc-layer/src/compression_layer.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b1d7645de41688528982ad59bddfef82437247b68a43b54b6165e7af1e6225"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/rpc/rpc-eth-types/src/cache/mod.rs:222-231 | crates/rpc/rpc-eth-types/src/cache/mod.rs:237-247 \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":"crates/rpc/rpc-eth-types/src/cache/mod.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0263ef6cedfe94f9fe955b3f49f9306cadedbd805b6e53aee95b1ab92d68dba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/trie/trie/src/trie.rs:695-728 | crates/trie/trie/src/trie.rs:740-771 \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":"crates/trie/trie/src/trie.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c793559ec8c788b32b0f7e51e9b8fae1a97993a46594c6c65e04f334fea5fa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/storage/db-common/src/init.rs:881-903 | crates/storage/db-common/src/init.rs:908-930 \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":"crates/storage/db-common/src/init.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52ae20b530d788cc1510be4bfb7eef1e1d481222b2b118388e22a9ccbc66556"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/storage/storage-overlay/src/provider.rs:689-702 | crates/storage/storage-overlay/src/provider.rs:720-738 \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":"crates/storage/storage-overlay/src/provider.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec47bb7b73aa94971b9e8e5bf825a68e349db79360819a54e2838bbaf437736b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/rpc/rpc-builder/src/lib.rs:1834-1847 | crates/rpc/rpc-builder/src/lib.rs:2165-2177 \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":"crates/rpc/rpc-builder/src/lib.rs"},"region":{"startLine":1834}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98a016d4feb9e44265ec4ba0feacd519817da4034a4a8f80d74dc8851c71a10"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/rpc/rpc/src/otterscan.rs:187-198 | crates/rpc/rpc/src/otterscan.rs:204-214 \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":"crates/rpc/rpc/src/otterscan.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"561926b7a1de79ea415d46560cdde08edc1d6861fd34dafd4c5ad734f3d4af93"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/storage/db/src/implementation/mdbx/mod.rs:318-329 | crates/storage/db/src/implementation/mdbx/mod.rs:331-342 \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":"crates/storage/db/src/implementation/mdbx/mod.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55c5d8c2ad61aab7b70c505da70a434287a3690fff8d35e3c6872d5e4e84a8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/storage/provider/src/providers/rocksdb/provider.rs:994-1005 | crates/storage/provider/src/providers/rocksdb/provider.rs:2804-2814 \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":"crates/storage/provider/src/providers/rocksdb/provider.rs"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"3226d020fde8196d3a105836735c16d0f4084a13c09f8500c7201f4d9aa965a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/storage/provider/src/providers/static_file/writer.rs:102-117 | crates/storage/provider/src/providers/static_file/writer.rs:120-131 \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":"crates/storage/provider/src/providers/static_file/writer.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a79eaebea87af287958bc5d2b0c5ae45c8b18b94a1dc10d23a888d17740471b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/rpc/rpc-builder/src/lib.rs:1289-1301 | crates/rpc/rpc-builder/src/lib.rs:1318-1332 \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":"crates/rpc/rpc-builder/src/lib.rs"},"region":{"startLine":1289}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb95851b97d3694731f782b185e8423118ca0e048004edab140be729ca819d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/storage/provider/src/providers/consistent.rs:91-105 | crates/storage/provider/src/providers/static_file/manager.rs:2070-2085 \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":"crates/storage/provider/src/providers/consistent.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a8b2106b56fa9d418dfcf0261d0476a074579149fd4cc2d965d119869bfd3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ethereum/evm/src/lib.rs:461-471 | crates/ethereum/evm/src/lib.rs:558-568 \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":"crates/ethereum/evm/src/lib.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"01fec5f6da6c810d54197baba85ca2c518e7a7edc5d3ea197a10b9d19ba705d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/net/ecies/src/algorithm.rs:283-310 | crates/net/ecies/src/algorithm.rs:326-352 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/ecies/src/algorithm.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"87019010708774de9462e6225de4921ca4c3e5a68ff036bd651bced0ee0bd9cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/net/network/src/error.rs:248-267 | crates/net/network/src/error.rs:269-286 \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":"crates/net/network/src/error.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"b734fc154a0097e94eb3c4a1a8c120a65a9f0ed5178693403041dc956e0f34f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/era/src/common/compression.rs:14-25 | crates/era/src/era/types/consensus.rs:93-107 | crates/era/src/era/types/consensus.rs:209-223 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/era/src/common/compression.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fff6a3b30be9016a3821696cca5c6a39b437215882fa145b4f5b2bccfd6cb9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/exex/exex/src/notifications.rs:170-183 | crates/exex/exex/src/notifications.rs:185-203 \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":"crates/exex/exex/src/notifications.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"522d4dcd073e8be7b517d3f2df08f6ec113b27901ba264402e598258976256e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/storage/provider/src/providers/static_file/jar.rs:104-119 | crates/storage/provider/src/providers/static_file/jar.rs:126-143 \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":"crates/storage/provider/src/providers/static_file/jar.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b59e64c70ed464e6aa54514117855ca6b77cf236bd0926140e7fa606f3e861"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/transaction-pool/src/blobstore/mem.rs:180-197 | crates/transaction-pool/src/blobstore/mem.rs:226-242 \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":"crates/transaction-pool/src/blobstore/mem.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"373f79493f4a6076c139a0bf8fab0ee8b6a06304610fa8bbf8d64ffb3368123d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/trie/common/src/updates.rs:329-344 | crates/trie/common/src/updates.rs:348-365 \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":"crates/trie/common/src/updates.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc8860b12bb3f5f317d9dafc917a71133b16df3a10aea18e9d9a063914393e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/cli/commands/src/download/manifest.rs:462-476 | crates/cli/commands/src/download/manifest.rs:484-502 \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":"crates/cli/commands/src/download/manifest.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"f411a8473d009a34ee34c2c93672ae7778c4fcb59e8cc8ec5fbfe2cece9ac4f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/net/eth-wire-types/src/broadcast.rs:700-715 | crates/net/eth-wire-types/src/broadcast.rs:716-731 \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":"crates/net/eth-wire-types/src/broadcast.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6af9bd27a9ef3c4d1bd7d2b4bbb0096856f418e9729f7d25c766041ae89c1dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/node/builder/src/node.rs:134-146 | crates/rpc/rpc-builder/src/lib.rs:1060-1074 \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":"crates/node/builder/src/node.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa2fc06dd977a650bfee2637a397b8378b6cedfb18ff7b4a1f5e01552c5b4413"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/transaction-pool/src/blobstore/mem.rs:106-119 | crates/transaction-pool/src/blobstore/mem.rs:129-141 \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":"crates/transaction-pool/src/blobstore/mem.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"511747b3189de24bc0660a22b32b1f3ee227b99406ab75edecccf2ef7212ca00"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/transaction-pool/src/pool/mod.rs:395-404 | crates/transaction-pool/src/pool/mod.rs:473-484 \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":"crates/transaction-pool/src/pool/mod.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"900ea44c6ce952ec5c7a40e068c42914d4ef1c3926458a9cc5438170c05d44d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/storage/provider/src/providers/static_file/manager.rs:503-512 | crates/storage/provider/src/providers/static_file/manager.rs:538-556 \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":"crates/storage/provider/src/providers/static_file/manager.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c125ad7385c3899f2a79fe166950de4f4ee6d8fc37d0b58eb16fd3398620bf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/tasks/src/lib.rs:177-189 | crates/tasks/src/runtime.rs:934-946 \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":"crates/tasks/src/lib.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c141d53c9e6b4b0c3ea184cbb70a8e940453ddcf2d21ce8aa08550aaf970fff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): crates/rpc/rpc-engine-api/src/engine_api.rs:1392-1409 | crates/rpc/rpc-engine-api/src/engine_api.rs:1422-1438 | crates/rpc/rpc-engine-api/src/engine_api.rs:1450-1468 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc-engine-api/src/engine_api.rs"},"region":{"startLine":1392}}}],"partialFingerprints":{"codehealthFindingId/v1":"75717cdd2d1522c29dc92f0835aac07a41c6f8989a8857f9c6a32612bdc850dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/rpc/rpc/src/validation.rs:444-460 | crates/rpc/rpc/src/validation.rs:466-489 \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":"crates/rpc/rpc/src/validation.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"91549a3624c3cf7a7648cb7fdd19c0fa4c3bdadde131e95523cefa09d4b361b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/snap-sync/src/bootstrap.rs:462-479 | crates/snap-sync/src/bootstrap.rs:485-499 \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":"crates/snap-sync/src/bootstrap.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"db56115abd92b695bdb1db7cc20dda86a45e8a8659fd660d60b58015aed333f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/storage/provider/src/providers/rocksdb/provider.rs:1008-1018 | crates/storage/provider/src/providers/rocksdb/provider.rs:1060-1069 \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":"crates/storage/provider/src/providers/rocksdb/provider.rs"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"48cb648a2ddecd910bebc8bc398e9cd500d46da4e8a767791d9e21531725b495"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 17\u002B corresponding lines): crates/storage/provider/src/providers/static_file/writer.rs:1651-1667 | crates/storage/provider/src/providers/static_file/writer.rs:1712-1728 | crates/storage/provider/src/providers/static_file/writer.rs:1735-1751 | crates/storage/provider/src/providers/static_file/writer.rs:1754-1770 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/static_file/writer.rs"},"region":{"startLine":1651}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d9b8fea58cffca06e7e79a7d6aeee7731a45d5bebf6fcb2b696824a411f0663"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/storage/storage-overlay/src/builder.rs:676-689 | crates/storage/storage-overlay/src/builder.rs:695-710 \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":"crates/storage/storage-overlay/src/builder.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d249653f206f71bc4bbee1f10ee0ad516a42b3d74d79a283f6c245273665386"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): docs/vocs/docs/snippets/sources/exex/remote/src/exex.rs:51-62 | docs/vocs/docs/snippets/sources/exex/remote/src/exex_4.rs:53-64 \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":"docs/vocs/docs/snippets/sources/exex/remote/src/exex.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"80fbaaba3c4e8b89c1648294dc169294637edc1ec4d5e69b4fd9742cf69a139a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/rpc/ipc/src/server/mod.rs:100-115 | crates/rpc/jsonrpsee/server/src/server.rs:142-154 \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":"crates/rpc/ipc/src/server/mod.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"5678b26d18d889696a6cada5e25413df745d5c6ce4667a220c4eacbeda08c356"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/tasks/src/pool.rs:270-281 | crates/tasks/src/pool.rs:287-298 | crates/tasks/src/pool.rs:323-334 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tasks/src/pool.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"276579da52eb964e6ae749ec4feba71b5203facce16a3930c6674f947b8d7a05"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/storage/provider/src/providers/database/provider.rs:1340-1352 | crates/storage/provider/src/providers/database/provider.rs:1364-1377 \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":"crates/storage/provider/src/providers/database/provider.rs"},"region":{"startLine":1340}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f4f6e95b717d246caab03240bd06e41b82a52942ceb5bd7e67e8da7a939818"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/storage/provider/src/providers/database/provider.rs:2166-2178 | crates/storage/provider/src/providers/database/provider.rs:2286-2304 \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":"crates/storage/provider/src/providers/database/provider.rs"},"region":{"startLine":2166}}}],"partialFingerprints":{"codehealthFindingId/v1":"141cafb0112a8d17c4bf89096415688e82e99e1c91462a1b367d8819e7b566fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/net/eth-wire-types/src/version.rs:135-146 | crates/net/eth-wire-types/src/version.rs:162-173 \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":"crates/net/eth-wire-types/src/version.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a6146d3e9f0e61d646ae6f13c0133a2a6e80299cc28ee4ebe1b5dca9a7d623"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 17\u002B corresponding lines): crates/storage/provider/src/providers/static_file/writer.rs:1260-1279 | crates/storage/provider/src/providers/static_file/writer.rs:1288-1304 | crates/storage/provider/src/providers/static_file/writer.rs:1313-1329 | crates/storage/provider/src/providers/static_file/writer.rs:1378-1394 | crates/storage/provider/src/providers/static_file/writer.rs:1670-1686 | crates/storage/provider/src/providers/static_file/writer.rs:1689-1705 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/static_file/writer.rs"},"region":{"startLine":1260}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b3218dbc0e33e6f6eaad74e4171b2fca358c609b972c8fe6c1b624b0986940"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/storage/storage-overlay/src/provider.rs:193-207 | crates/storage/storage-overlay/src/provider.rs:237-251 \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":"crates/storage/storage-overlay/src/provider.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"9719373728cb7ee485d0a7ea567dc7a359ae39c110692ae04002682297f624d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/trie/common/src/hashed_state.rs:260-271 | crates/trie/common/src/hashed_state.rs:276-287 \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":"crates/trie/common/src/hashed_state.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"897287dc402969028d3bc2011b1620046ed35b6105cb3719f64dc5462731c3f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/chain-state/src/notifications.rs:69-80 | crates/payload/builder-primitives/src/events.rs:66-81 | crates/payload/builder-primitives/src/events.rs:96-111 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/chain-state/src/notifications.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"fccbb5a422586e7c1a64b2bb32ecc2fbb08921a88f26f5ceb950dc5f2adf3472"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/net/downloaders/src/bodies/task.rs:40-53 | crates/net/downloaders/src/headers/task.rs:41-53 \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":"crates/net/downloaders/src/bodies/task.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a6041784d9a45f1aa336865845fd9893e120db5b09855371aef73cb9abd0dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/net/p2p/src/full_block.rs:449-465 | crates/net/p2p/src/full_block.rs:592-609 \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":"crates/net/p2p/src/full_block.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb9641aea709ec2c4b613b4902aae156ca929bc656069503e20f7d90b466029e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/storage/provider/src/providers/state/latest.rs:73-82 | crates/storage/storage-overlay/src/provider.rs:536-549 \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":"crates/storage/provider/src/providers/state/latest.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bdf8207782689ddc0bed6ecd337eb8eee6b7fc74ee33a1f1521cf6254e99d2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/storage/rpc-provider/src/lib.rs:306-317 | crates/storage/rpc-provider/src/lib.rs:1430-1441 \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":"crates/storage/rpc-provider/src/lib.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"e649592335e051c6cf1c12b44a2e7daac5eda93f2ac80d23a6fe41101fe7452e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/trie/common/src/hashed_state.rs:518-525 | crates/trie/common/src/updates.rs:599-606 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/common/src/hashed_state.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"af28da131c4f6dcc27e94ce4c7b53372b1e6cb3bea10b3339ff853b4baeb31a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/storage/provider/src/either_writer.rs:466-477 | crates/storage/provider/src/either_writer.rs:498-509 | crates/storage/provider/src/either_writer.rs:597-608 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/either_writer.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"82bb6bb67310658e3e6523011d96ae549b00ba1486a942ee01d3a3d872d56a82"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 12\u002B corresponding lines): crates/storage/rpc-provider/src/lib.rs:388-402 | crates/storage/rpc-provider/src/lib.rs:423-438 | crates/storage/rpc-provider/src/lib.rs:483-497 | crates/storage/rpc-provider/src/lib.rs:591-602 | crates/storage/rpc-provider/src/lib.rs:674-686 | crates/storage/rpc-provider/src/lib.rs:698-709 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/rpc-provider/src/lib.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6f171c650d5606b7419d285be2332c2ea88e0997347289e5741ae02d00005e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/trie/trie/src/hashed_cursor/post_state.rs:209-225 | crates/trie/trie/src/trie_cursor/in_memory.rs:158-174 \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":"crates/trie/trie/src/hashed_cursor/post_state.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34ab6967ef4b6de9f56a89bdacadac220671adfc1e91e685c65e6eb7c082004"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/rpc/ipc/src/server/mod.rs:259-270 | crates/rpc/jsonrpsee/server/src/server.rs:944-960 \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":"crates/rpc/ipc/src/server/mod.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a638f3cc5ca162f842828c8170cac40d2d2177cb6ed04a57d8b6963a96c29c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/stages/stages/src/stages/sender_recovery.rs:433-448 | crates/stages/stages/src/stages/tx_lookup.rs:255-273 \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":"crates/stages/stages/src/stages/sender_recovery.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"652d6d16f1b19cdbd74c5117124f70299c8a46fa915a1b23b52c450fd731d7d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/storage/provider/src/providers/database/provider.rs:1628-1643 | crates/storage/provider/src/providers/database/provider.rs:1665-1678 \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":"crates/storage/provider/src/providers/database/provider.rs"},"region":{"startLine":1628}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e829f5786ff1a9ed07129b8f54d74e13600e63cb2296ba688e98491b7a666f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/transaction-pool/src/pool/txpool.rs:1875-1883 | crates/transaction-pool/src/pool/txpool.rs:1891-1899 \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":"crates/transaction-pool/src/pool/txpool.rs"},"region":{"startLine":1875}}}],"partialFingerprints":{"codehealthFindingId/v1":"53131b92e2d09f6d51419855c85e5f0e61bd561f0587b5b52979d9e74a03ebff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/engine/tree/src/tree/state_root_strategy/mod.rs:330-338 | crates/trie/parallel/src/state_root_task.rs:214-222 \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":"crates/engine/tree/src/tree/state_root_strategy/mod.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"6852f65f3f1966599a982b5765e08a2b7d0ab98180e10c897d9e1140f7cc5ff6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/evm/evm/src/execute.rs:1164-1174 | crates/evm/evm/src/execute.rs:1183-1197 \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":"crates/evm/evm/src/execute.rs"},"region":{"startLine":1164}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b040e218fd7cfdfcf1b66dc858431373b77e50eb8867be2f8d3479ffe0a3593"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/stages/stages/src/stages/hashing_account.rs:289-309 | crates/stages/stages/src/stages/hashing_storage.rs:230-250 \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":"crates/stages/stages/src/stages/hashing_account.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"a544af199d94a5f544ef61b3f8357ba1d314b0ef71a337c3a75b6279495b73bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): .github/scripts/bench-call-summary.py:215-221 | .github/scripts/bench-call-summary.py:225-234 \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":".github/scripts/bench-call-summary.py"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9afdda07eaf9be04d54e33cb3052b70a813a6ef1dc466ed08568dad5dfe722d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/evm/evm/src/engine.rs:194-205 | crates/evm/evm/src/execute.rs:1597-1608 \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":"crates/evm/evm/src/engine.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5945a2b47fdf8b3855451e90b723a92db2e24f3548b06a628f927cebf4d5c53"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/storage/provider/src/providers/consistent.rs:632-640 | crates/storage/provider/src/providers/consistent.rs:662-670 | crates/storage/provider/src/providers/consistent.rs:676-684 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/consistent.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0499dc0930376b07943fa6253db12f40f873d8497ae08845d16103a57f0ec5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/storage/provider/src/providers/state/latest.rs:154-166 | crates/storage/provider/src/providers/state/latest.rs:190-202 \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":"crates/storage/provider/src/providers/state/latest.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a03bd59cf58d3c60ec6cdcaf1078a61ce94102c612b2be969302be594562c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/prune/prune/src/builder.rs:101-117 | crates/prune/prune/src/builder.rs:137-151 \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":"crates/prune/prune/src/builder.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c934b3aca03ffd9d267a21d4e48153558df8ca042202c5cda1d06f183e77809"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/storage/db-api/src/mock.rs:257-264 | crates/storage/db-api/src/mock.rs:295-301 \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":"crates/storage/db-api/src/mock.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2376e8b5ef62d9bedf6d6a7cc7f9cc248fc415fa6e74d2038560968608064b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/storage/provider/src/providers/rocksdb/provider.rs:1141-1148 | crates/storage/provider/src/providers/rocksdb/provider.rs:2863-2870 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/rocksdb/provider.rs"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ccea3f9ba22109aec796e05152462b2ec6e4b005d90b4859257a4053a3e16bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/tasks/src/lib.rs:73-82 | crates/tasks/src/lib.rs:96-105 \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":"crates/tasks/src/lib.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"e277468b7b70559a2e74799700448131ba72c0296f9b3ff82858c44b00f54944"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/transaction-pool/src/traits.rs:200-211 | crates/transaction-pool/src/traits.rs:218-229 \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":"crates/transaction-pool/src/traits.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8497cd34e3171cda0d6cc68b2256899b5262ba70e0e350af141a105973d63c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/trie/db/src/state.rs:230-243 | crates/trie/db/src/state.rs:248-261 \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":"crates/trie/db/src/state.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"af254ba25d7b59bc2f094e1532f03f16a97e16454ed38bb89ab9d6962f81a052"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/trie/trie/src/changesets.rs:90-102 | crates/trie/trie/src/changesets.rs:118-129 \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":"crates/trie/trie/src/changesets.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd0f14640f7419ba6d80159ed9f8f1fbea208b658280206ef2ba51109a0e12c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/net/network/src/peers.rs:267-276 | crates/net/network/src/peers.rs:299-311 \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":"crates/net/network/src/peers.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe23a7ef9c16aed00cfc2c1eabf732cc8b5749002f3d0c601bb8017f58601732"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/rpc/rpc-engine-api/src/engine_api.rs:791-802 | crates/rpc/rpc-engine-api/src/engine_api.rs:924-934 \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":"crates/rpc/rpc-engine-api/src/engine_api.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"88956667159cce8463aa9cced9a24c3b994d9b05522025a4d44ace2df0842c88"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/snap-sync/src/bootstrap.rs:516-527 | crates/snap-sync/src/common/download.rs:82-93 \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":"crates/snap-sync/src/bootstrap.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc3648fef18553db647faab255c8888c1778234cd6e4fd1e4ded4a79b2996e64"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/stages/api/src/pipeline/builder.rs:110-116 | crates/stages/api/src/pipeline/mod.rs:761-768 \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":"crates/stages/api/src/pipeline/builder.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a144f35ee1eab7eda2c1bde69a0f0999e7e4a4f8d0f9bbcb7a4c76b2f5e1fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 7\u002B corresponding lines): crates/storage/provider/src/either_writer.rs:542-549 | crates/storage/provider/src/either_writer.rs:586-594 | crates/storage/provider/src/either_writer.rs:826-832 | crates/storage/provider/src/either_writer.rs:843-849 | crates/storage/provider/src/either_writer.rs:891-897 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/either_writer.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"81de2b50c19b9f8c8638d2f0df87b3f88e81ac42c86e93b91dac14f04fb6d9f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/storage/db/src/static_file/cursor.rs:74-81 | crates/storage/db/src/static_file/cursor.rs:87-98 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/db/src/static_file/cursor.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a780a40fcde05d17fce34904d676d00e2d32922872b50d18e483a0e37e0ca5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/storage/provider/src/providers/static_file/manager.rs:2908-2921 | crates/storage/provider/src/providers/static_file/manager.rs:2950-2957 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/static_file/manager.rs"},"region":{"startLine":2908}}}],"partialFingerprints":{"codehealthFindingId/v1":"b730ef5a56c95706ce2dd582fe1b6d9c4b392577dc87c73ef2eeeeef823b999e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/engine/tree/src/tree/invalid_headers.rs:63-72 | crates/engine/tree/src/tree/invalid_headers.rs:75-84 \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":"crates/engine/tree/src/tree/invalid_headers.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"be3f33ab046d4923913ae4c07000d5c5acedd3efd1ada81ddb901b579d7df841"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ethereum/node/src/snap/mod.rs:152-162 | crates/storage/provider/src/providers/database/provider.rs:1507-1515 \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":"crates/ethereum/node/src/snap/mod.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"df068facc0297fef5dbdc6387895e7a86a695553b457de75db9141d23f418e4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/rpc/rpc-eth-api/src/helpers/pending_block.rs:171-184 | crates/rpc/rpc-eth-api/src/helpers/pending_block.rs:248-266 \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":"crates/rpc/rpc-eth-api/src/helpers/pending_block.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"46ab66e185a97d7f2f9887e7b024f5fbb2d9a5e992c3a2e238604bdaa2a60c0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/stages/stages/src/stages/hashing_account.rs:316-325 | crates/stages/stages/src/stages/hashing_storage.rs:257-266 \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":"crates/stages/stages/src/stages/hashing_account.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2da8ac9d650e36033ddc86b2c57d2611c1b4583875da4a87cc17b7fcf9014c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/storage/storage-overlay/src/provider.rs:634-642 | crates/storage/storage-overlay/src/provider.rs:661-671 \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":"crates/storage/storage-overlay/src/provider.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83f54b2b2f098bdd3e9a5ac478a8fdb3f7b59c1841a1647e873229cd5c649f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/transaction-pool/src/pool/listener.rs:287-306 | crates/transaction-pool/src/pool/listener.rs:329-348 \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":"crates/transaction-pool/src/pool/listener.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3646b5e4eb8acb410f41527382872ea1a12bbfd08e4ee73ff4aadc29da13578"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 8\u002B corresponding lines): crates/net/network/src/fetch/client.rs:67-74 | crates/net/network/src/fetch/client.rs:89-100 | crates/net/network/src/fetch/client.rs:113-124 | crates/net/network/src/fetch/client.rs:131-142 | crates/net/network/src/fetch/client.rs:157-173 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/fetch/client.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d504188870fd0e051efc53070fdcc7c1f7137a2598468988175576d250ada6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 11\u002B corresponding lines): crates/storage/provider/src/providers/static_file/jar.rs:164-175 | crates/storage/provider/src/providers/static_file/jar.rs:219-229 | crates/storage/provider/src/providers/static_file/jar.rs:314-324 | crates/storage/provider/src/providers/static_file/jar.rs:329-339 | crates/storage/provider/src/providers/static_file/jar.rs:376-386 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/static_file/jar.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"1545e594368ff4814d8fad51b0d6cfc7077f3ec76042d1ba2acbaff3b8a90c0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/storage/storage-overlay/src/provider.rs:626-632 | crates/storage/storage-overlay/src/provider.rs:647-656 \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":"crates/storage/storage-overlay/src/provider.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f268ad3fa40424267d9c4126da00d4424c129f70e7e904c3e970f524db7679"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): .github/scripts/bench-reth-summary.py:143-153 | .github/scripts/bench-target-metric-sample-filter.py:17-24 \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":".github/scripts/bench-reth-summary.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc1d707bc746ba867b48a8997117b123f930662f2b3284e79f0f22016aa3ebb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ethereum/evm/src/executor.rs:476-488 | crates/ethereum/evm/src/executor.rs:574-584 \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":"crates/ethereum/evm/src/executor.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd67921f7b208c16431f4510696c71da24295ba2422e7d97943479b5309733c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/evm/evm/src/cached.rs:108-116 | crates/evm/evm/src/cached.rs:118-124 \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":"crates/evm/evm/src/cached.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c76e35f3d367dec8381647a082fa0a9a5bc6bedadf853878399299eea176e92"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/rpc/rpc-eth-types/src/cache/mod.rs:448-460 | crates/rpc/rpc-eth-types/src/cache/mod.rs:467-479 | crates/rpc/rpc-eth-types/src/cache/mod.rs:486-501 \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":"crates/rpc/rpc-eth-types/src/cache/mod.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"476901419e17b211cf06fddef9f38098d1d57067e413a4c512a6337a924ad835"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/transaction-pool/src/pool/mod.rs:274-284 | crates/transaction-pool/src/pool/mod.rs:290-300 \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":"crates/transaction-pool/src/pool/mod.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5f39e008783947afd8a3da1d0df7ea9581002fe6a5e15ab18f0f1e7819e0cbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/trie/trie/src/hashed_cursor/post_state.rs:228-241 | crates/trie/trie/src/trie_cursor/in_memory.rs:177-192 \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":"crates/trie/trie/src/hashed_cursor/post_state.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c66e88b5e4d341305c6716567a98a8a801e8f318d3ec2ba0080623eeac1cee0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/era/src/era1/types/execution.rs:511-520 | crates/era/src/ere/types/execution.rs:613-624 \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":"crates/era/src/era1/types/execution.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a5ed4c00ae0dbd91e2559adc934f1f619f47bd5ca36e1e8c51f64852b0094e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/trie/common/src/hashed_state.rs:215-226 | crates/trie/common/src/proofs.rs:79-90 | crates/trie/common/src/proofs.rs:633-645 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/common/src/hashed_state.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"792d709c142a047827e0df049e130dd8de195b1593e1d81b1724ae593b327371"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/trie/parallel/src/state_root_task.rs:327-338 | crates/trie/parallel/src/state_root_task.rs:342-353 \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":"crates/trie/parallel/src/state_root_task.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"530abc54b993b26dc4322628f229cb7ab7b55751de6f6f5c8941fce73c151538"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 9\u002B corresponding lines): testing/testing-utils/src/genesis_allocator.rs:71-79 | testing/testing-utils/src/genesis_allocator.rs:88-97 | testing/testing-utils/src/genesis_allocator.rs:106-117 | testing/testing-utils/src/genesis_allocator.rs:126-137 | testing/testing-utils/src/genesis_allocator.rs:142-150 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/testing-utils/src/genesis_allocator.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d4bcfa304afb32a31b2a0ac8756f42ce730b76b00eb4d4e1e636e3e9bde47cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ethereum/evm/src/factory.rs:476-484 | crates/ethereum/evm/src/factory.rs:487-495 \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":"crates/ethereum/evm/src/factory.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced7679d406307a08c41eb478dadd94de58783a5944d6c15e52bb4b7d6fed0a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/storage/provider/src/bal/rocksdb.rs:217-229 | crates/storage/storage-api/src/bal.rs:85-96 \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":"crates/storage/provider/src/bal/rocksdb.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef313eb3995a44f07e8a43954b83bf7a9a6650d8669ca6b5c4bd4765f2f3cf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/storage/provider/src/providers/rocksdb/provider.rs:1076-1087 | crates/storage/provider/src/providers/rocksdb/provider.rs:2843-2851 \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":"crates/storage/provider/src/providers/rocksdb/provider.rs"},"region":{"startLine":1076}}}],"partialFingerprints":{"codehealthFindingId/v1":"0195dc270f148931fefdabab57a55df71f96d0c5aed7bd2f48c66a48c54bbe08"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/trie/common/src/trie_node_v2.rs:221-233 | crates/trie/common/src/trie_node_v2.rs:235-246 \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":"crates/trie/common/src/trie_node_v2.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5a00864bba38de25d2b3e2d2006638d45611b5261648578b9132743737f0a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/trie/trie/src/hashed_cursor/metrics.rs:133-138 | crates/trie/trie/src/trie_cursor/metrics.rs:136-141 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/trie/src/hashed_cursor/metrics.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae61a9c7876296aa5d21953c924769fb4d5c3ec890289464ec2071b1d668df8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/era/src/ere/types/execution.rs:410-424 | crates/era/src/ere/types/execution.rs:447-461 \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":"crates/era/src/ere/types/execution.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf56a316e565a9b049d76a8dcc9c22ab7ab855c7c9fdcb62295bfe3af59f7630"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/net/discv4/src/lib.rs:943-951 | crates/net/dns/src/lib.rs:208-216 \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":"crates/net/discv4/src/lib.rs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4481df6dd57ad0bd15315f19624dcd8463ec5ef00070bfb2a6ef3301e5f034e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/net/network/src/transactions/mod.rs:2135-2143 | crates/net/network/src/transactions/mod.rs:2147-2157 \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":"crates/net/network/src/transactions/mod.rs"},"region":{"startLine":2135}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab6c9ccff7a4fcad6fad2c0c529e3531da82fd9df555d97b5842f2d60c53d8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/storage/provider/src/providers/blockchain_provider.rs:391-400 | crates/storage/provider/src/providers/blockchain_provider.rs:406-410 \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":"crates/storage/provider/src/providers/blockchain_provider.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"270ea26f7d981ed0be93a6f6786df7ef99e92b40ae09ef350e976b3d6f5f4c84"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/storage/provider/src/providers/consistent.rs:739-753 | crates/storage/provider/src/providers/consistent.rs:758-772 \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":"crates/storage/provider/src/providers/consistent.rs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc6304a990a70bd9d1df3d7b06e06ddf3b6e36cdd9305f2fc9ace599cd6a30f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/transaction-pool/src/blobstore/disk.rs:369-378 | crates/transaction-pool/src/blobstore/mem.rs:202-209 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/blobstore/disk.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"c49dbd8d74d627f10ba522b9ed45a9ab5ee4e35f286fd13730b776c7f3eda408"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/engine/execution-cache/src/cached_state.rs:1045-1057 | crates/engine/execution-cache/src/cached_state.rs:1065-1077 | crates/engine/execution-cache/src/cached_state.rs:1084-1096 \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":"crates/engine/execution-cache/src/cached_state.rs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff5fae133e91faad3c1ca28a403502546164c12e46abba3f9691753e5a452e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 10\u002B corresponding lines): crates/era/src/era/types/consensus.rs:178-190 | crates/era/src/era/types/consensus.rs:240-252 | crates/era/src/era1/types/execution.rs:134-146 | crates/era/src/era1/types/execution.rs:197-206 | crates/era/src/era1/types/execution.rs:266-276 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/era/src/era/types/consensus.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5aea793b48bd8c3d95416003c408d90f2615bcb1aaf41016600a1895e69483"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/exex/exex/src/context.rs:45-54 | crates/exex/exex/src/dyn_context.rs:41-49 \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":"crates/exex/exex/src/context.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd1be8158e8eeade3bc787e89cc643eca7259cb6ed7560e8916ca089676393d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/net/network/src/manager.rs:1047-1060 | crates/net/network/src/manager.rs:1065-1073 \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":"crates/net/network/src/manager.rs"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce737a6ce6f327b9082e564ad829d1cd02e0f5b3adcde0fa22790c9205a48db9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/rpc/rpc/src/otterscan.rs:139-153 | crates/rpc/rpc/src/otterscan.rs:168-181 \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":"crates/rpc/rpc/src/otterscan.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12400af9a3e2bd13348a18bb26191558a7f67ddb81c4e370f71304e60c0e328"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/snap-sync/src/account/download.rs:62-67 | crates/snap-sync/src/account/download.rs:93-98 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/snap-sync/src/account/download.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"91bd1ce1fda5c535f15ee79be2a8c2282cfcb43c6947de70ab89eddcaf101d0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/storage/db-api/src/models/accounts.rs:53-62 | crates/storage/db-api/src/models/accounts.rs:122-131 \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":"crates/storage/db-api/src/models/accounts.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf5b898678cd3180596bf988eaca3268bfe1dc02aa9717f0854d57c66e47380e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 7\u002B corresponding lines): crates/storage/provider/src/either_writer.rs:417-429 | crates/storage/provider/src/either_writer.rs:489-495 | crates/storage/provider/src/either_writer.rs:516-522 | crates/storage/provider/src/either_writer.rs:529-535 | crates/storage/provider/src/either_writer.rs:561-567 | crates/storage/provider/src/either_writer.rs:574-580 \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":"crates/storage/provider/src/either_writer.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"6385dea3443bc5ba4b0e8c9560037fab0c604a53929bcae08b57e1f69afc253c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/storage/provider/src/providers/static_file/jar.rs:248-254 | crates/storage/provider/src/providers/static_file/jar.rs:262-268 \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":"crates/storage/provider/src/providers/static_file/jar.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c4f816c259b85b804516f1d158d09f4a4139670a8d96bf543426f107b6216a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/cli/commands/src/download/fetch.rs:505-512 | crates/cli/commands/src/download/progress.rs:630-641 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/download/fetch.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"90871ae6891db429307c0ba23cb6ede4ab5e157050f31dff672d004489347653"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/node/core/src/args/pruning.rs:332-343 | crates/node/core/src/args/pruning.rs:372-385 \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":"crates/node/core/src/args/pruning.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"2201a4dc47379185b354d810f6c8fb3e268985e24089e4cde1343907a2b5b8fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): crates/node/core/src/args/pruning.rs:345-355 | crates/node/core/src/args/pruning.rs:357-367 | crates/node/core/src/args/pruning.rs:387-397 | crates/node/core/src/args/pruning.rs:399-409 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/core/src/args/pruning.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dfe480e44ace46e2d7d2f03dacb081bf0e473039fced03cebdc2df060a44e48"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/payload/basic/src/lib.rs:899-908 | crates/payload/basic/src/lib.rs:932-939 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/payload/basic/src/lib.rs"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b87ce1296792fa36114338927fd518da5075c3d67f686f61e9a87c3bbc6b27"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/trie/common/src/hashed_state.rs:501-512 | crates/trie/common/src/updates.rs:576-587 \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":"crates/trie/common/src/hashed_state.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce7c32950d945e43abc7cc6a36e927851fc4cab2a251d9d787fc343b98a0024d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/evm/execution-types/src/chain.rs:513-519 | crates/evm/execution-types/src/chain.rs:523-529 \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":"crates/evm/execution-types/src/chain.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca1739c31ff06fd8dd8b0c67591cc6b3d57fd198a445026fc5b750310ae33f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/storage/provider/src/providers/database/provider.rs:2014-2029 | crates/storage/provider/src/providers/database/provider.rs:2035-2050 \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":"crates/storage/provider/src/providers/database/provider.rs"},"region":{"startLine":2014}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f60fb7904f6c7db3b012be23819ae543698abc01c2179da94d1f09ebed2a837"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/storage/storage-api/src/database_provider.rs:119-128 | crates/storage/storage-api/src/database_provider.rs:138-147 \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":"crates/storage/storage-api/src/database_provider.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6f0435a97256957d9bf9f410a38f4ec0a234dc07a1831ce7e06daef5d5a396"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/storage/provider/src/either_writer.rs:694-703 | crates/storage/provider/src/either_writer.rs:775-784 \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":"crates/storage/provider/src/either_writer.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb04b98807c7f9064c633b9cff98d5b88d5c91c93903e8d3e8574edffba58808"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 11\u002B corresponding lines): crates/storage/provider/src/providers/static_file/manager.rs:2709-2719 | crates/storage/provider/src/providers/static_file/manager.rs:2736-2746 | crates/storage/provider/src/providers/static_file/manager.rs:2767-2777 | crates/storage/provider/src/providers/static_file/manager.rs:2798-2808 | crates/storage/provider/src/providers/static_file/manager.rs:2923-2933 | crates/storage/provider/src/providers/static_file/manager.rs:2938-2948 | crates/storage/provider/src/providers/static_file/manager.rs:3007-3017 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/static_file/manager.rs"},"region":{"startLine":2709}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1539e63dd67150599d58c67dd35847b9e884551b02c71d1e128483f5866e8b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ethereum/node/src/node.rs:100-108 | crates/exex/test-utils/src/lib.rs:144-152 \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":"crates/ethereum/node/src/node.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"d108dc3d3b648cdd7a02204e192efae754609a525846371776766601025b9eb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/rpc/rpc-builder/src/lib.rs:2218-2232 | crates/rpc/rpc-layer/src/auth_client_layer.rs:74-88 \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":"crates/rpc/rpc-builder/src/lib.rs"},"region":{"startLine":2218}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4782a979ceaff50d04c9925d0f38f78dc0995d3753e307c44eeed2c2db2552e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): crates/storage/provider/src/either_writer.rs:105-115 | crates/storage/provider/src/either_writer.rs:125-136 | crates/storage/provider/src/either_writer.rs:147-158 | crates/storage/provider/src/either_writer.rs:168-179 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/either_writer.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"7007a7b98589cc8ccfbeac3966cc846b2fb5dd5717993f4a81a5b7c8a08e9d19"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/storage/provider/src/providers/database/provider.rs:484-496 | crates/storage/provider/src/traits/rocksdb_provider.rs:56-64 \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":"crates/storage/provider/src/providers/database/provider.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc9cce0240a07da9116d17f956782d1f7fba3c3d284a2860f835d4da8c85011"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/engine/execution-cache/src/lib.rs:123-136 | crates/storage/storage-overlay/src/manager.rs:262-274 \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":"crates/engine/execution-cache/src/lib.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b78b662be95a649d723956637b70c520c3f88b976d88c6ab09d632f65df421"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/storage/db-api/src/models/bal.rs:76-86 | crates/storage/db-api/src/models/accounts.rs:66-70 \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":"crates/storage/db-api/src/models/bal.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0547db306b5492f7a8d65d03f450ad1cff28f4c7a39f9defd1f0cd22b5c5fc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 12\u002B corresponding lines): crates/era/src/era/file.rs:270-284 | crates/era/src/era/file.rs:287-298 | crates/era/src/era/file.rs:301-313 | crates/era/src/era/file.rs:316-328 | crates/era/src/era1/file.rs:366-380 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/era/src/era/file.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0faff1757fb70a067af602a31b9495dcdfd90bfe155204cb2804350bd901b7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/rpc/rpc-eth-api/src/helpers/call.rs:722-733 | crates/rpc/rpc-eth-api/src/helpers/estimate.rs:285-300 \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":"crates/rpc/rpc-eth-api/src/helpers/call.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"827dba932e0bdf9c298bb6004280aade3b4c9cbafbb57a98702289741acf4608"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): docs/vocs/docs/snippets/sources/exex/hello-world/src/bin/1.rs:3-9 | docs/vocs/docs/snippets/sources/exex/tracking-state/src/bin/1.rs:54-64 | docs/vocs/docs/snippets/sources/exex/tracking-state/src/bin/2.rs:74-84 \u2014 These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/vocs/docs/snippets/sources/exex/hello-world/src/bin/1.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c52bc6b5138ec0689000700f53cbd9f7b6d956dee6644ca2946f86fb016bce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/cli/commands/src/download/manifest.rs:606-613 | crates/cli/commands/src/download/manifest.rs:616-625 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/download/manifest.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d5448e3a4e71d30a342a4f0bc888cb2450919629f7cd076d500a259799dd6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/transaction-pool/src/pool/parked.rs:146-152 | crates/transaction-pool/src/pool/pending.rs:587-592 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/pool/parked.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c29b67a9652db701695518c91eccfa42dd74e658556d45d92e18dac4f7ecac8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/trie/trie/src/verify/mod.rs:142-150 | crates/trie/trie/src/verify/pipeline.rs:105-113 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/trie/src/verify/mod.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06d86242dbf41b828394ece12172e44a47dce2a461d1cd3e289d9b3c5bab9f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/stages/stages/src/test_utils/test_db.rs:138-145 | crates/storage/storage-api/src/database_provider.rs:58-63 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stages/stages/src/test_utils/test_db.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ea26df8f4ff869a8fa0877b1f09abac475c8ac9c99b3ffd3dc5f27c9e22276"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/engine/execution-cache/src/txpool.rs:49-55 | crates/engine/tree/src/tree/txpool_prewarm/worker.rs:343-349 \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":"crates/engine/execution-cache/src/txpool.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc66223e9441844fe5d309009c202353d312d4db9418cbb295ccd5d77a368a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/trie/trie/src/hashed_cursor/post_state.rs:137-148 | crates/trie/trie/src/trie_cursor/in_memory.rs:97-108 \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":"crates/trie/trie/src/hashed_cursor/post_state.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef2586ab466f6b7b34adfe89c6c652d799ad78f57c23515dcb0ed8b6ba0ffd6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/net/peers/src/node_record.rs:53-57 | crates/net/peers/src/trusted_peer.rs:36-40 \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":"crates/net/peers/src/node_record.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d063f1265e6b3d033517ec147008dde600b30b7cf1e4a4d9a96b93297c25002"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/transaction-pool/src/test_utils/mock.rs:950-956 | crates/transaction-pool/src/traits.rs:1868-1874 \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":"crates/transaction-pool/src/test_utils/mock.rs"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"95dd278f175d7e37955bee8b9da1a4f66635a0dd91920ca6e6b886886d73322b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/node/builder/src/rpc.rs:871-892 | crates/rpc/rpc-builder/src/lib.rs:230-241 \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":"crates/node/builder/src/rpc.rs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a68328d97b92523358c58c6388bd6518fcc6e4ce1c8c609ff74baf01a654872"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/node/core/src/args/debug.rs:271-273 | crates/rpc/rpc-server-types/src/module.rs:283-289 \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":"crates/node/core/src/args/debug.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"7120ded9dc4c7381dd2f39162f927e30f005a105d2c3a687e51f972cc97c7c1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/rpc/rpc-eth-types/src/block.rs:136-140 | crates/rpc/rpc-eth-types/src/pending_block.rs:137-141 \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":"crates/rpc/rpc-eth-types/src/block.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f4a7e6568c2cca72c5443b91bd315987d222c3794f9ce460f2468e02503e80"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): crates/trie/common/src/hashed_state.rs:460-462 | crates/trie/common/src/target_v2.rs:109-112 | crates/trie/common/src/updates.rs:563-566 \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":"crates/trie/common/src/hashed_state.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d6bc830902ce8a32af845b2f75a087db8cd38c5f6436ecd8f615c022eb65c2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): .github/scripts/bench-reth-charts.py:35-51 | .github/scripts/bench-reth-summary.py:71-87 \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":".github/scripts/bench-reth-charts.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"930a41a87e14a122af7bfcc716673376f1e157fff213638d6e5754c09a1c9ae9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/era/src/era1/types/execution.rs:217-220 | crates/era/src/ere/types/execution.rs:146-149 \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":"crates/era/src/era1/types/execution.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b87f1722aa920482f47eef6e2fbcd424e8bd84a6cf7032c9f20623763391a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/cli/commands/src/download/progress.rs:326-330 | crates/transaction-pool/src/blobstore/mod.rs:279-283 \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":"crates/cli/commands/src/download/progress.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"b59cd750daf202be1c6381fc40133a82ab7a22fb8030bbc0c002512a199b62dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/evm/execution-types/src/execute.rs:48-50 | crates/evm/execution-types/src/execution_outcome.rs:189-191 \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":"crates/evm/execution-types/src/execute.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"31bf2741ab63c631e6a20a44d68ec1c7b3623c0c5dce262e7293e3143a7a4e2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/rpc/rpc-eth-api/src/helpers/transaction.rs:917-924 | crates/storage/provider/src/providers/database/provider.rs:2145-2149 \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":"crates/rpc/rpc-eth-api/src/helpers/transaction.rs"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"715a62283a324493e98b39f7a25834c59b9dd0ac1ddbb2ecbc14de29a9961477"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/storage/provider/src/test_utils/mock.rs:1023-1025 | crates/storage/storage-api/src/state.rs:77-82 \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":"crates/storage/provider/src/test_utils/mock.rs"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"5774e51f1c8da72d0dcaa3332ac3d8de45a3a95de2e1892804b9a2e86e69034f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (42 lines \u00D7 2): crates/storage/provider/src/providers/rocksdb/provider.rs:2413-2454 | crates/storage/provider/src/providers/rocksdb/provider.rs:2567-2608 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/storage/provider/src/providers/rocksdb/provider.rs:2413\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":"crates/storage/provider/src/providers/rocksdb/provider.rs"},"region":{"startLine":2413}}}],"partialFingerprints":{"codehealthFindingId/v1":"d627bc32b752f231b9bfee75bc66fb20d106581a1a79a1b98378e8b428054e29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): crates/rpc/rpc/src/eth/builder.rs:207-241 | crates/rpc/rpc/src/eth/builder.rs:264-298 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rpc/rpc/src/eth/builder.rs:207\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":"crates/rpc/rpc/src/eth/builder.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bcb3098d48b91cb04ad123058c24436b65678f0088b2904d2c8d922bc72ab67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): crates/storage/provider/src/providers/database/provider.rs:2973-3006 | crates/storage/provider/src/providers/database/provider.rs:3136-3169 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/storage/provider/src/providers/database/provider.rs:2973\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":"crates/storage/provider/src/providers/database/provider.rs"},"region":{"startLine":2973}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d277ceeb4576b156cd02f84e4880bd947eea2ae7ce0e123e1d36a0d01b41f96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201333 lines \u00D7 2): crates/ethereum/payload/src/lib.rs:271-298 | crates/rpc/rpc-eth-api/src/helpers/pending_block.rs:337-369 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ethereum/payload/src/lib.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b1c06e53c174acee0024dd489914f90c7a2d57a9022d4c982f6f4418e66cff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31\u201332 lines \u00D7 2): crates/rpc/rpc/src/validation.rs:499-530 | crates/rpc/rpc/src/validation.rs:548-578 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rpc/rpc/src/validation.rs:499\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060request\u0060 to \u0060BuilderBlockValidationRequestV5\u0060 in one and \u0060BuilderBlockValidationRequestV6\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":"crates/rpc/rpc/src/validation.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf31506e75c19a86c9682cdb042051863239f07ca4fbd16e36a9bd3d8145944"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): crates/engine/tree/src/tree/state_root_strategy/sparse_trie.rs:399-429 | crates/engine/tree/src/tree/state_root_strategy/sparse_trie.rs:438-468 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/tree/src/tree/state_root_strategy/sparse_trie.rs:399\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":"crates/engine/tree/src/tree/state_root_strategy/sparse_trie.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f8e2967ab1e5100ce6f790437d6d7aaeae1a05545af2350aa7af4704dd43ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): crates/storage/provider/src/providers/database/provider.rs:3017-3047 | crates/storage/provider/src/providers/database/provider.rs:3182-3212 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/storage/provider/src/providers/database/provider.rs:3017\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":"crates/storage/provider/src/providers/database/provider.rs"},"region":{"startLine":3017}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ed41060e3a369ca992a6dfb432bd697333564a4bc2429f2b5ef9b35a5bd853"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201331 lines \u00D7 2): crates/storage/provider/src/providers/rocksdb/provider.rs:2465-2494 | crates/storage/provider/src/providers/rocksdb/provider.rs:2619-2649 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/storage/provider/src/providers/rocksdb/provider.rs:2465\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":"crates/storage/provider/src/providers/rocksdb/provider.rs"},"region":{"startLine":2465}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1cdd0c226d73f317bf331e4af563a56cf6318361e7d1e68f03c8a7d07f77995"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): crates/storage/libmdbx-rs/src/cursor.rs:564-593 | crates/storage/libmdbx-rs/src/cursor.rs:659-688 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/libmdbx-rs/src/cursor.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ab6da840c23b20bd62fa3843886cf9f1333f505049b1a8b81b0763501f0efa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201327 lines \u00D7 2): crates/prune/prune/src/segments/user/storage_history.rs:123-146 | crates/prune/prune/src/segments/user/storage_history.rs:273-299 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prune/prune/src/segments/user/storage_history.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8d44b65f49396775c21ef95dc5f0d9641c23ce7a64c72363622220ba14beeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201325 lines \u00D7 2): crates/prune/prune/src/segments/user/account_history.rs:103-127 | crates/prune/prune/src/segments/user/storage_history.rs:104-125 \u2014 before extracting anything, compare \u0060crates/prune/prune/src/segments/user/account_history.rs\u0060 and \u0060crates/prune/prune/src/segments/user/storage_history.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 109 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/prune/prune/src/segments/user/account_history.rs:103\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":"crates/prune/prune/src/segments/user/account_history.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"7056062b5e5368db9aa904c3a4ad24160628159a24783ab13758a1a47efe7483"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201325 lines \u00D7 2): crates/prune/prune/src/segments/user/account_history.rs:125-146 | crates/prune/prune/src/segments/user/account_history.rs:272-296 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prune/prune/src/segments/user/account_history.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"630d8655d6dd82504259d7355d2bf43a175ac7896c5cb0e8daf727a0292c7dc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/stages/stages/src/stages/utils.rs:321-345 | crates/stages/stages/src/stages/utils.rs:543-567 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/stages/stages/src/stages/utils.rs:321\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stages/stages/src/stages/utils.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dfa46405b94b93cec3e5a6a22146135e5cccf6ea0da80c27ee6a7daebc3b000"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/storage/provider/src/test_utils/mock.rs:1255-1277 | crates/storage/storage-api/src/noop.rs:631-653 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/test_utils/mock.rs"},"region":{"startLine":1255}}}],"partialFingerprints":{"codehealthFindingId/v1":"0804c13836915ad3fb25fa05fc43f431090aad53c035fef0df3f1d220b51963d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/trie/common/src/proofs.rs:274-296 | crates/trie/common/src/proofs.rs:399-421 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/common/src/proofs.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dffd502af5cf505372bc3282d42ae840e3f9f0cedd5d1d8854f05cc9d9bcd3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201323 lines \u00D7 2): crates/trie/trie/src/trie.rs:240-260 | crates/trie/trie/src/trie.rs:313-335 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/trie/trie/src/trie.rs:240\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":"crates/trie/trie/src/trie.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09daaf4b105b00ed31535adb188db58bff47dbc319f26d199aa20c720a100d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201322 lines \u00D7 3): crates/transaction-pool/src/blobstore/disk.rs:108-129 | crates/transaction-pool/src/blobstore/disk.rs:180-198 | crates/transaction-pool/src/blobstore/disk.rs:329-350 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/transaction-pool/src/blobstore/disk.rs:108\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/blobstore/disk.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d235b77ac4ea5f71c8d0461b59539e90097703476d3e47b82cffdaa267b4e6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/cli/commands/src/db/state.rs:72-93 | crates/cli/commands/src/db/state.rs:99-120 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/state.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3aabe8f1b406f9e15f40bf305d2be27ea7c39a27d11f2ae4144be648f3d72f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/cli/commands/src/stage/run.rs:167-188 | crates/cli/commands/src/stage/run.rs:218-239 \u2014 both copies are in the same file, so extract the block 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, \u0060crates/cli/commands/src/stage/run.rs:216\u0060 calls \u0060extend\u0060, \u0060clone\u0060 and \u0060crates/cli/commands/src/stage/run.rs:165\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":"crates/cli/commands/src/stage/run.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"f63e98a296e56591fc3833fed887974d4bedb850eed9ac061f1b47d9e2b816c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): crates/net/peers/src/node_record.rs:186-206 | crates/net/peers/src/trusted_peer.rs:142-163 \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 \u0060crates/net/peers/src/node_record.rs:186\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":"crates/net/peers/src/node_record.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5357057dccc062dd2275f10242891e668391f723032423ce6f533232785acb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/prune/prune/src/segments/user/account_history.rs:185-206 | crates/prune/prune/src/segments/user/storage_history.rs:187-208 \u2014 before extracting anything, compare \u0060crates/prune/prune/src/segments/user/account_history.rs\u0060 and \u0060crates/prune/prune/src/segments/user/storage_history.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 109 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/prune/prune/src/segments/user/account_history.rs:185\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":"crates/prune/prune/src/segments/user/account_history.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"680412451eacf9fc01d4d4b2eae56f9d60d2bc72b31f16da9d6c5899f9db1226"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201321 lines \u00D7 2): crates/rpc/rpc-eth-api/src/helpers/transaction.rs:555-569 | crates/rpc/rpc-eth-api/src/helpers/transaction.rs:658-678 \u2014 both copies are in the same file, so extract the block 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":"crates/rpc/rpc-eth-api/src/helpers/transaction.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"222021bdc6ad11bfb94f7bb6febf74020627e3c34186b7568385b9c7a1c5fcf3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): crates/stages/stages/src/stages/utils.rs:154-173 | crates/stages/stages/src/stages/utils.rs:209-229 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/stages/stages/src/stages/utils.rs:154\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":"crates/stages/stages/src/stages/utils.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"7770d9183c2584f4347896f28477a9b8252a18caa75b10edb597002add91a291"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/trie/trie/src/trie.rs:218-238 | crates/trie/trie/src/trie.rs:291-311 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/trie/trie/src/trie.rs:218\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/trie/src/trie.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75b75294733a659f6c18c716f10bdb419348b5e430b9a34c6b85c8aa161141d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 2): crates/cli/commands/src/db/account_storage.rs:32-49 | crates/cli/commands/src/db/account_storage.rs:63-82 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/cli/commands/src/db/account_storage.rs:32\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/account_storage.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"2659c71e5226337e6b8c6cd6a6395ca7fb66d0db3aeec86896d8da88014947de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/stages/stages/src/stages/index_account_history.rs:96-115 | crates/stages/stages/src/stages/index_storage_history.rs:100-119 \u2014 before extracting anything, compare \u0060crates/stages/stages/src/stages/index_account_history.rs\u0060 and \u0060crates/stages/stages/src/stages/index_storage_history.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/stages/stages/src/stages/index_account_history.rs:96\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":"crates/stages/stages/src/stages/index_account_history.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"efcc899bc73df79c261aaea54ec123a1b34d90202306081955e4397b05bb7222"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/storage/provider/src/changeset_walker.rs:39-58 | crates/storage/provider/src/changeset_walker.rs:121-140 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"crates/storage/provider/src/changeset_walker.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"84469ce904b64141e9aaa87f40be3bfa9cfafc45b1665808072c317361e741cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201320 lines \u00D7 2): crates/storage/provider/src/providers/consistent.rs:1168-1187 | crates/storage/provider/src/providers/consistent.rs:1223-1235 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/storage/provider/src/providers/consistent.rs:1168\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":"crates/storage/provider/src/providers/consistent.rs"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7a04491aae603258c018a35e710c5b23a9081b02673d98b5737d428384b17c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): crates/storage/provider/src/providers/consistent.rs:1320-1339 | crates/storage/provider/src/providers/consistent.rs:1365-1383 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/storage/provider/src/providers/consistent.rs:1320\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":"crates/storage/provider/src/providers/consistent.rs"},"region":{"startLine":1320}}}],"partialFingerprints":{"codehealthFindingId/v1":"e92017af6374c470a4f7d36faa9d5f271cef37e3e143fe35cee9437502c81a7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): crates/storage/provider/src/providers/database/provider.rs:1119-1137 | crates/storage/provider/src/providers/database/provider.rs:1234-1253 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/storage/provider/src/providers/database/provider.rs:1119\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 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":"crates/storage/provider/src/providers/database/provider.rs"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"561bc36b80bb4fcc89baed4bb72ff51b6a31f212999fbe2f9920d4d943347e33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): crates/storage/provider/src/providers/rocksdb/provider.rs:1292-1311 | crates/storage/provider/src/providers/rocksdb/provider.rs:1340-1358 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/storage/provider/src/providers/rocksdb/provider.rs:1292\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":"crates/storage/provider/src/providers/rocksdb/provider.rs"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"9feeb67937b6d07732fbd51be947ca8f7b1ee0e7395d413790f802166e9de70b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): crates/storage/provider/src/providers/static_file/manager.rs:2500-2519 | crates/storage/provider/src/providers/static_file/manager.rs:2605-2623 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/storage/provider/src/providers/static_file/manager.rs:2500\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 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":"crates/storage/provider/src/providers/static_file/manager.rs"},"region":{"startLine":2500}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b3e4b78c964c0fdf1e3f077e73e7ae8e61c36816f40b463ea5ceaa68c726336"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): crates/tasks/src/runtime.rs:705-724 | crates/tasks/src/runtime.rs:775-793 \u2014 both copies are in the same file, so extract the block 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":"crates/tasks/src/runtime.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ff16f32d14b0f56d1e19644d4e63088a9bb3981632606e158c24e23ea7f2ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/trie/common/src/hashed_state.rs:533-552 | crates/trie/common/src/updates.rs:614-633 \u2014 before extracting anything, compare \u0060crates/trie/common/src/hashed_state.rs\u0060 and \u0060crates/trie/common/src/updates.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/common/src/hashed_state.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ad795542ccf349b99f7f8d93028e2a9cc4ad27763ace4eb1fec53e1aef98f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/rpc/rpc-eth-api/src/helpers/transaction.rs:534-552 | crates/rpc/rpc-eth-api/src/helpers/transaction.rs:616-634 \u2014 both copies are in the same file, so extract the block 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":"crates/rpc/rpc-eth-api/src/helpers/transaction.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eea033f1d4fbe6dd7d68af6012a8f227a206ac6cbc35c5df250a442e93abf6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/transaction-pool/src/pool/txpool.rs:275-293 | crates/transaction-pool/src/pool/txpool.rs:296-314 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/transaction-pool/src/pool/txpool.rs:275\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":"crates/transaction-pool/src/pool/txpool.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb9ee4a69c65c7db2d24634b040b207caa04151a1ebb5ab99a12999de164614b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): docs/vocs/docs/snippets/sources/exex/remote/src/exex.rs:28-45 | docs/vocs/docs/snippets/sources/exex/remote/src/exex_3.rs:26-43 | docs/vocs/docs/snippets/sources/exex/remote/src/exex_4.rs:28-45 \u2014 before extracting anything, compare \u0060docs/vocs/docs/snippets/sources/exex/remote/src/exex.rs\u0060 and \u0060docs/vocs/docs/snippets/sources/exex/remote/src/exex_3.rs\u0060 as WHOLE FILES: 90% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"docs/vocs/docs/snippets/sources/exex/remote/src/exex.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d8494541842318943cc3a6c9f72ef119b45f46a66abc8df1299925566fdebc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/cli/commands/src/stage/dump/hashing_account.rs:88-105 | crates/cli/commands/src/stage/dump/hashing_storage.rs:83-100 \u2014 before extracting anything, compare \u0060crates/cli/commands/src/stage/dump/hashing_account.rs\u0060 and \u0060crates/cli/commands/src/stage/dump/hashing_storage.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/cli/commands/src/stage/dump/hashing_account.rs:88\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":"crates/cli/commands/src/stage/dump/hashing_account.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd01a7681a4f3bb7875a90db6aa683a79822771a55f5f93bc96179a4c5d89bd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 2): crates/era/src/era1/types/execution.rs:407-449 | crates/era/src/ere/types/execution.rs:475-517 \u2014 before extracting anything, compare \u0060crates/era/src/era1/types/execution.rs\u0060 and \u0060crates/era/src/ere/types/execution.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/era/src/era1/types/execution.rs:407\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":"crates/era/src/era1/types/execution.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"91090ef8391204867daf8f6e97f0cbfaa18c49d9501028a79723930d2a647149"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/prune/prune/src/segments/receipts.rs:61-78 | crates/prune/prune/src/segments/user/sender_recovery.rs:112-129 \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 \u0060crates/prune/prune/src/segments/receipts.rs:61\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":"crates/prune/prune/src/segments/receipts.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"00aaf7bba218a42dacea3874f9414f043aec838909839678861e2cc9b87eab92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201318 lines \u00D7 2): crates/storage/provider/src/providers/consistent.rs:1245-1259 | crates/storage/provider/src/providers/consistent.rs:1394-1411 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/storage/provider/src/providers/consistent.rs:1245\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060range\u0060 to \u0060impl RangeBounds\u003CBlockNumber\u003E\u0060 in one and \u0060impl core::ops::RangeBounds\u003CBlockNumber\u003E\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":"crates/storage/provider/src/providers/consistent.rs"},"region":{"startLine":1245}}}],"partialFingerprints":{"codehealthFindingId/v1":"545f9d592129dce1124511944e3e0b73fec203a094b356a134691ad29580a2c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/cli/commands/src/db/get.rs:392-408 | crates/cli/commands/src/db/get.rs:466-482 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/cli/commands/src/db/get.rs:392\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":"crates/cli/commands/src/db/get.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dfb7098a6ab5647cdf121d4331f6c7605e311a67d73ec954894ef347438bb3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/rpc/rpc-engine-api/src/engine_api.rs:1199-1215 | crates/rpc/rpc-engine-api/src/engine_api.rs:1230-1246 \u2014 both copies are in the same file, so extract the block 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":"crates/rpc/rpc-engine-api/src/engine_api.rs"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed52ff8b85dc04b3f9a144b611a2a041639dd42dc7105dbc1f069560ad71029f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/tasks/src/worker_map.rs:63-79 | crates/tasks/src/worker_map.rs:94-110 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tasks/src/worker_map.rs:63\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tasks/src/worker_map.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a6217149bbae78f5c0c1fd2bf4f10d99351dfec276f4f75978d0031129a31d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201317 lines \u00D7 2): crates/transaction-pool/src/pool/mod.rs:805-821 | crates/transaction-pool/src/pool/mod.rs:890-901 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/transaction-pool/src/pool/mod.rs:832\u0060 calls \u0060on_new_transaction\u0060 and \u0060crates/transaction-pool/src/pool/mod.rs:904\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":"crates/transaction-pool/src/pool/mod.rs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4aa56e070f9c9a5d6f7d28e93795d3051452502bd4e26a84e70315bb4315a44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/trie/trie/src/hashed_cursor/post_state.rs:267-283 | crates/trie/trie/src/trie_cursor/in_memory.rs:217-233 \u2014 before extracting anything, compare \u0060crates/trie/trie/src/hashed_cursor/post_state.rs\u0060 and \u0060crates/trie/trie/src/trie_cursor/in_memory.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 93 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/trie/trie/src/hashed_cursor/post_state.rs:267\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":"crates/trie/trie/src/hashed_cursor/post_state.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"826b9f9a31c24b95e864b8e8046940ef48510221290dc132e8e8ca44c6d756c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): crates/cli/commands/src/stage/dump/hashing_account.rs:36-51 | crates/cli/commands/src/stage/dump/hashing_storage.rs:26-41 | crates/cli/commands/src/stage/dump/merkle.rs:62-77 \u2014 before extracting anything, compare \u0060crates/cli/commands/src/stage/dump/hashing_account.rs\u0060 and \u0060crates/cli/commands/src/stage/dump/hashing_storage.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/cli/commands/src/stage/dump/hashing_account.rs:36\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/stage/dump/hashing_account.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"efeab6971ba3dcac56f33fbc0a9529f660ac9d970a06a46412621146bd5872f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/cli/commands/src/download/manifest.rs:324-339 | crates/cli/commands/src/download/manifest.rs:359-374 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/cli/commands/src/download/manifest.rs:324\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/download/manifest.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b939b9c4c71e2eda47392ed329bd55eeac3b70d3b6392b34a624e2e70950a5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/engine/tree/src/tree/payload_validator.rs:809-823 | crates/engine/tree/src/tree/payload_validator.rs:848-863 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/tree/src/tree/payload_validator.rs:809\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":"crates/engine/tree/src/tree/payload_validator.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2a6b532d00b4a877df558af481e7038f7fec21a3b0b9dcae633a38ad9324ed4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 2): crates/net/discv4/src/proto.rs:522-534 | crates/net/discv4/src/proto.rs:602-617 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/net/discv4/src/proto.rs:602\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":"crates/net/discv4/src/proto.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b30f20862fac6ed557103a3d3bfe59a2bdcd6d60c9c25f43f768bead81da0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/net/eth-wire-types/src/broadcast.rs:611-626 | crates/net/eth-wire-types/src/broadcast.rs:794-809 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/net/eth-wire-types/src/broadcast.rs:611\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/eth-wire-types/src/broadcast.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e8ec4b21fb76ad0cf90faadd89838b9c4ca48c74bab7106ba234af7826ef2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/prune/prune/src/segments/user/storage_history.rs:159-173 | crates/prune/prune/src/segments/user/storage_history.rs:232-247 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/prune/prune/src/segments/user/storage_history.rs:159\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prune/prune/src/segments/user/storage_history.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a21f43b0542c255993b78ef226ab5a7e777f5233bcac20b3751e905615b2c2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/storage/provider/src/providers/consistent.rs:238-253 | crates/storage/provider/src/providers/consistent.rs:335-350 \u2014 both copies are in the same file, so extract the block 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":"crates/storage/provider/src/providers/consistent.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b28a632e741b18d212913975fce5bb812e9c2a79222b6fdbfac5433cc06fb4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/transaction-pool/src/blobstore/disk.rs:86-101 | crates/transaction-pool/src/blobstore/mem.rs:31-46 \u2014 before extracting anything, compare \u0060crates/transaction-pool/src/blobstore/disk.rs\u0060 and \u0060crates/transaction-pool/src/blobstore/mem.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/transaction-pool/src/blobstore/disk.rs:86\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/blobstore/disk.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"673c394587b3ae4ee7e82fc1b06fc25a98b13bac86b6d39ec65f3eb88cf63f81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/trie/common/src/proofs.rs:248-263 | crates/trie/common/src/proofs.rs:373-388 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/trie/common/src/proofs.rs:248\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":"crates/trie/common/src/proofs.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"34866fd12bd37d18fe27244e3193720bf367fe2f755cca1af172de47b19db4c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/transaction-pool/src/blobstore/disk.rs:161-175 | crates/transaction-pool/src/blobstore/mem.rs:63-77 \u2014 before extracting anything, compare \u0060crates/transaction-pool/src/blobstore/disk.rs\u0060 and \u0060crates/transaction-pool/src/blobstore/mem.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/transaction-pool/src/blobstore/disk.rs:161\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/blobstore/disk.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdef7e53cc62444a5bf286e3a7ebe7ac6632fb7ffa6b160375761378f20ab893"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/trie/trie/src/hashed_cursor/post_state.rs:325-339 | crates/trie/trie/src/trie_cursor/in_memory.rs:310-324 \u2014 before extracting anything, compare \u0060crates/trie/trie/src/hashed_cursor/post_state.rs\u0060 and \u0060crates/trie/trie/src/trie_cursor/in_memory.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 93 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/trie/trie/src/hashed_cursor/post_state.rs:325\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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060key\u0060 to \u0060B256\u0060 in one and \u0060Nibbles\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":"crates/trie/trie/src/hashed_cursor/post_state.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca1b70b9aab8a0729c794b993a21279de0671726fe162962eeecfa3b579a3f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 5): crates/net/discv4/src/proto.rs:296-309 | crates/net/discv4/src/proto.rs:338-351 | crates/net/discv4/src/proto.rs:381-394 | crates/net/discv4/src/proto.rs:526-537 | crates/net/discv4/src/proto.rs:609-621 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/net/discv4/src/proto.rs:296\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":"crates/net/discv4/src/proto.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7e251c2ec04e742b3b308c742329f793cff6409a3c5ef2a44952957bb6663c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/cli/commands/src/stage/dump/execution.rs:145-157 | crates/cli/commands/src/stage/dump/hashing_storage.rs:54-67 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from 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":"crates/cli/commands/src/stage/dump/execution.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8cd7ed120c37cea3c125150c95a79c20e3058670896595f824ffd186bda869"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/cli/runner/src/lib.rs:110-123 | crates/cli/runner/src/lib.rs:170-182 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/cli/runner/src/lib.rs:110\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":"crates/cli/runner/src/lib.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"c149b7009e18a528f33775364e9781a7d7c1121940ca19a6881cb8433a2cd349"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): crates/prune/prune/src/segments/user/account_history.rs:101-114 | crates/prune/prune/src/segments/user/account_history.rs:183-194 \u2014 both copies are in the same file, so extract the block 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":"crates/prune/prune/src/segments/user/account_history.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"601374612a6c191ca19a6912c9c36eb1ea79217c42f5fd5e88923028e3b4a2a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): crates/prune/prune/src/segments/user/storage_history.rs:102-115 | crates/prune/prune/src/segments/user/storage_history.rs:185-196 \u2014 both copies are in the same file, so extract the block 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":"crates/prune/prune/src/segments/user/storage_history.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"96db3f2259481d084b2b2da3047b3a4c9e493c37d77c4d058f5dfcef53f67f5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/storage/provider/src/providers/static_file/manager.rs:2468-2481 | crates/storage/provider/src/providers/static_file/manager.rs:2572-2584 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/storage/provider/src/providers/static_file/manager.rs:2468\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 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":"crates/storage/provider/src/providers/static_file/manager.rs"},"region":{"startLine":2468}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e5f56c9f80ffa215bf23b6737b9b1dfe583df8244aff405c970d965461a191b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/storage/provider/src/providers/static_file/writer.rs:1235-1248 | crates/storage/provider/src/providers/static_file/writer.rs:1266-1279 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/storage/provider/src/providers/static_file/writer.rs:1235\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/storage/provider/src/providers/static_file/writer.rs:1233\u0060 calls \u0060increment_block\u0060, \u0060number\u0060 and \u0060crates/storage/provider/src/providers/static_file/writer.rs:1264\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":"crates/storage/provider/src/providers/static_file/writer.rs"},"region":{"startLine":1235}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d497428c63cdb68d6b87dcbbfb0b103398dad87db0d58d4695f3087067e6ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/transaction-pool/src/pool/txpool.rs:241-254 | crates/transaction-pool/src/pool/txpool.rs:261-273 \u2014 both copies are in the same file, so extract the block 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":"crates/transaction-pool/src/pool/txpool.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"31fee1861777c93f9fcd4be975945ca1f78ca29b83db656729a0a74193ebfef0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/trie/trie/src/hashed_cursor/post_state.rs:366-379 | crates/trie/trie/src/trie_cursor/in_memory.rs:345-358 \u2014 before extracting anything, compare \u0060crates/trie/trie/src/hashed_cursor/post_state.rs\u0060 and \u0060crates/trie/trie/src/trie_cursor/in_memory.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 93 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/trie/trie/src/hashed_cursor/post_state.rs:366\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":"crates/trie/trie/src/hashed_cursor/post_state.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"c635e0591707d5199a5de8c5548286cadf2a2dbf8d69a1e1527539f5b3e26d53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): docs/vocs/docs/snippets/sources/exex/hello-world/src/bin/3.rs:11-24 | docs/vocs/docs/snippets/sources/exex/tracking-state/src/bin/1.rs:26-39 \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 \u0060docs/vocs/docs/snippets/sources/exex/hello-world/src/bin/3.rs:11\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/vocs/docs/snippets/sources/exex/hello-world/src/bin/3.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a2af02371fd5f5eb266c69b31398f9088382ec895357ae0d496cea9f8cb9ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/chain-state/src/in_memory/canonical.rs:276-288 | crates/chain-state/src/in_memory/canonical.rs:355-367 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/chain-state/src/in_memory/canonical.rs:276\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/chain-state/src/in_memory/canonical.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d905e771bb52bb942cf63ab6c140b1398eafb0055b7cd358c72c5c10daf293b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/engine/tree/src/tree/state_root_strategy/mod.rs:1142-1153 | crates/engine/tree/src/tree/state_root_strategy/mod.rs:1215-1227 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/tree/src/tree/state_root_strategy/mod.rs:1142\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/tree/src/tree/state_root_strategy/mod.rs"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bec87cd4583e986f0763519387bf4adb1faea9754ae2f2103cbacb58417744b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/prune/prune/src/segments/user/account_history.rs:262-274 | crates/prune/prune/src/segments/user/storage_history.rs:263-275 \u2014 before extracting anything, compare \u0060crates/prune/prune/src/segments/user/account_history.rs\u0060 and \u0060crates/prune/prune/src/segments/user/storage_history.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 109 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prune/prune/src/segments/user/account_history.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"b178fe73c7653cd72398f66199f46e4b341835efd808c622b5dca20513ee55cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/stages/stages/src/stages/hashing_account.rs:162-174 | crates/stages/stages/src/stages/hashing_storage.rs:92-104 \u2014 before extracting anything, compare \u0060crates/stages/stages/src/stages/hashing_account.rs\u0060 and \u0060crates/stages/stages/src/stages/hashing_storage.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/stages/stages/src/stages/hashing_storage.rs:91\u0060 calls \u0060tx_ref\u0060 and \u0060crates/stages/stages/src/stages/hashing_account.rs:161\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":"crates/stages/stages/src/stages/hashing_account.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"a227a29412db15eae8274be38711911a829d4420484d9ad787d104233b7e49f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/storage/db-common/src/init.rs:1045-1059 | crates/storage/db-common/src/init.rs:1150-1164 \u2014 both copies are in the same file, so extract the block 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":"crates/storage/db-common/src/init.rs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e9826aea50599935f5004dcbdf315c3933f1028a27b38d4b259f23595bc95e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/storage/provider/src/providers/static_file/writer.rs:652-664 | crates/storage/provider/src/providers/static_file/writer.rs:709-721 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/storage/provider/src/providers/static_file/writer.rs:652\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/static_file/writer.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb7f0b8d6ba381000a6ee6ec1a0513d230cbfc17ff3f839ffa6c5d5bd1b2859"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/transaction-pool/src/blobstore/disk.rs:437-449 | crates/transaction-pool/src/blobstore/mem.rs:249-261 \u2014 before extracting anything, compare \u0060crates/transaction-pool/src/blobstore/disk.rs\u0060 and \u0060crates/transaction-pool/src/blobstore/mem.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"crates/transaction-pool/src/blobstore/disk.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ff81aad251dd2e6f3b669debf2412e3ffe2e8e647cda22e0cc0c6103f4f90e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/transaction-pool/src/pool/mod.rs:895-907 | crates/transaction-pool/src/pool/mod.rs:960-972 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/transaction-pool/src/pool/mod.rs:895\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":"crates/transaction-pool/src/pool/mod.rs"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e68c8fc20dc21d224c601608442fa29e13ac8e19e5a260b9e399414800a2f5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/transaction-pool/src/pool/pending.rs:200-212 | crates/transaction-pool/src/pool/pending.rs:253-265 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/transaction-pool/src/pool/pending.rs:200\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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060crate) fn update_blob_fee( \u0026mut\u0060 in one and \u0060crate) fn update_base_fee( \u0026mut\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/transaction-pool/src/pool/pending.rs:251\u0060 calls \u0060priority\u0060 and \u0060crates/transaction-pool/src/pool/pending.rs:199\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":"crates/transaction-pool/src/pool/pending.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"e14aa67a4eb6fde495da0275e2b6169eeb6011512985f1a36ac895d03c8ea3ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/trie/common/src/hashed_state.rs:636-648 | crates/trie/common/src/updates.rs:725-737 \u2014 before extracting anything, compare \u0060crates/trie/common/src/hashed_state.rs\u0060 and \u0060crates/trie/common/src/updates.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/common/src/hashed_state.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"a641903fbbe258cbace1dc7af0088a2072ecdab5840c510feb010806549353e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/trie/common/src/proofs.rs:213-225 | crates/trie/common/src/proofs.rs:339-351 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/common/src/proofs.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03e32a56e4e985e1f76fa2933f5a10c24034eef032fdd462dbb524838e22b13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/trie/common/src/proofs.rs:233-245 | crates/trie/common/src/proofs.rs:359-371 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/trie/common/src/proofs.rs:233\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/common/src/proofs.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"7590bf2499e723b8f41edcd0075ab01b0503fbf07eb0e4d5255e379e907ec890"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/trie/common/src/proofs.rs:736-748 | crates/trie/common/src/proofs.rs:786-798 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/trie/common/src/proofs.rs:736\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/common/src/proofs.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"2565027a143d9e81051c93989f607761512802b265e125fbd3dcdb67dd390a13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/trie/trie/src/hashed_cursor/post_state.rs:213-225 | crates/trie/trie/src/trie_cursor/in_memory.rs:162-174 \u2014 before extracting anything, compare \u0060crates/trie/trie/src/hashed_cursor/post_state.rs\u0060 and \u0060crates/trie/trie/src/trie_cursor/in_memory.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 93 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060key\u0060 to \u0060B256\u0060 in one and \u0060Nibbles\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":"crates/trie/trie/src/hashed_cursor/post_state.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"26432e4d36eb5f7db5ceb3729b7627dfd143ae87768025521663b1901b9c2933"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 4): docs/vocs/docs/snippets/sources/exex/remote/src/exex_1.rs:30-40 | docs/vocs/docs/snippets/sources/exex/remote/src/exex_2.rs:38-49 | docs/vocs/docs/snippets/sources/exex/remote/src/exex_3.rs:54-65 | docs/vocs/docs/snippets/sources/exex/remote/src/exex_4.rs:74-85 \u2014 before extracting anything, compare \u0060docs/vocs/docs/snippets/sources/exex/remote/src/exex_2.rs\u0060 and \u0060docs/vocs/docs/snippets/sources/exex/remote/src/exex_3.rs\u0060 as WHOLE FILES: 84% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060docs/vocs/docs/snippets/sources/exex/remote/src/exex_1.rs:30\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":"docs/vocs/docs/snippets/sources/exex/remote/src/exex_1.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae66b4c9ec44d4f87d02b4da36d42eb3d7e4be4057c64ad6dbe96538de27969"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/cli/commands/src/db/repair_trie.rs:146-157 | crates/cli/commands/src/db/repair_trie.rs:275-286 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/cli/commands/src/db/repair_trie.rs:146\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/repair_trie.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"67eb1fd78a1d6e8e6a5b95c7db07fae7fd415dae7d3320da17c4e63f746e266c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/era/src/era1/types/execution.rs:382-393 | crates/era/src/ere/types/execution.rs:450-461 \u2014 before extracting anything, compare \u0060crates/era/src/era1/types/execution.rs\u0060 and \u0060crates/era/src/ere/types/execution.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/era/src/era1/types/execution.rs:382\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":"crates/era/src/era1/types/execution.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ea3f1d59101442abea5b6df32fe78c9fb6d8173641c656c3c90d03f5110ce4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/net/downloaders/src/bodies/task.rs:42-53 | crates/net/downloaders/src/headers/task.rs:43-53 \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 \u0060crates/net/downloaders/src/bodies/task.rs:42\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":"crates/net/downloaders/src/bodies/task.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a6a854b01101d8206791628b872c19620b6e968568a041be3ef95fadcc933a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/net/eth-wire-types/src/broadcast.rs:701-712 | crates/net/eth-wire-types/src/broadcast.rs:717-728 \u2014 both copies are in the same file, so extract the block 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":"crates/net/eth-wire-types/src/broadcast.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc70bccf0f8fa3d0dfd63b0fc4e9adbecf3f927efad1d3ec9049b483e28295a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/rpc/rpc-eth-api/src/helpers/state.rs:176-187 | crates/rpc/rpc-eth-api/src/helpers/state.rs:226-237 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rpc/rpc-eth-api/src/helpers/state.rs:176\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc-eth-api/src/helpers/state.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"6345e270b18bde58ee9e412fcb53f994e192c6c07f7c6b8edefc112baebfea22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/rpc/rpc/src/debug.rs:1055-1066 | crates/rpc/rpc/src/debug.rs:1067-1078 \u2014 both copies are in the same file, so extract the block 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":"crates/rpc/rpc/src/debug.rs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"888d98f3bb2fb89716540f7e5cfe037349fbc51420c578dfd5f83aaa92f5816b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/stages/stages/src/stages/hashing_account.rs:187-198 | crates/stages/stages/src/stages/hashing_storage.rs:117-127 \u2014 before extracting anything, compare \u0060crates/stages/stages/src/stages/hashing_account.rs\u0060 and \u0060crates/stages/stages/src/stages/hashing_storage.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/stages/stages/src/stages/hashing_account.rs:187\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stages/stages/src/stages/hashing_account.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aebcb7bcf1f54ea8edd23ff9a6fd4034781425421a1729f9458738fa435f1b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/stages/stages/src/stages/utils.rs:376-387 | crates/stages/stages/src/stages/utils.rs:600-611 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/stages/stages/src/stages/utils.rs:376\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stages/stages/src/stages/utils.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb2d466066ef1e9d06b5e167a4fe9055ba53fcfc9083da0d3b68c35496dc1b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/storage/provider/src/providers/consistent.rs:1306-1317 | crates/storage/provider/src/providers/consistent.rs:1350-1362 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/storage/provider/src/providers/consistent.rs:1306\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/consistent.rs"},"region":{"startLine":1306}}}],"partialFingerprints":{"codehealthFindingId/v1":"538be24c70ccc41b2c8fbbb94bac6c512831b77217ffc64e4340caa43b8d55d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/storage/provider/src/providers/rocksdb/provider.rs:2263-2274 | crates/storage/provider/src/providers/rocksdb/provider.rs:2716-2727 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/storage/provider/src/providers/rocksdb/provider.rs:2263\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/rocksdb/provider.rs"},"region":{"startLine":2263}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0daa060e9e1f25c2351525224b46713fc64636f66e5ee2412483a5c0bc59242"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/transaction-pool/src/pool/pending.rs:188-199 | crates/transaction-pool/src/pool/pending.rs:238-249 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/transaction-pool/src/pool/pending.rs:188\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/transaction-pool/src/pool/pending.rs:251\u0060 calls \u0060priority\u0060 and \u0060crates/transaction-pool/src/pool/pending.rs:200\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":"crates/transaction-pool/src/pool/pending.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"9495854b8d8871dbda1ebe770f4cfd216c152ce9491c8f67fefba6fa94897222"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/transaction-pool/src/pool/txpool.rs:443-454 | crates/transaction-pool/src/pool/txpool.rs:467-478 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/transaction-pool/src/pool/txpool.rs:443\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/pool/txpool.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"2414ed51ea84fd332f6bc7d1b359b02aa4db775f5009c8a3ba72800773b34555"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/trie/common/src/hashed_state.rs:103-114 | crates/trie/common/src/hashed_state.rs:469-478 \u2014 both copies are in the same file, so extract the block 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":"crates/trie/common/src/hashed_state.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc23a050f1c3d8084b6680bbaf239713e564538a485ea9ceb4f6e356d5cc0be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/trie/trie/src/proof/mod.rs:181-192 | crates/trie/trie/src/proof/mod.rs:325-336 \u2014 both copies are in the same file, so extract the block 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":"crates/trie/trie/src/proof/mod.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ba570a2ff58e27ce1c4e4d0e583524757daff9052af396e4ce53251bc1743d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): crates/cli/commands/src/stage/dump/execution.rs:41-51 | crates/cli/commands/src/stage/dump/hashing_account.rs:36-46 | crates/cli/commands/src/stage/dump/hashing_storage.rs:26-36 | crates/cli/commands/src/stage/dump/merkle.rs:62-72 \u2014 before extracting anything, compare \u0060crates/cli/commands/src/stage/dump/hashing_account.rs\u0060 and \u0060crates/cli/commands/src/stage/dump/hashing_storage.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/cli/commands/src/stage/dump/execution.rs:41\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/stage/dump/execution.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"9459ccca54e0e417bb21d39e2eb4d1bfd8a25bdcadb879640f762bdeec66bf39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 4): docs/vocs/docs/snippets/sources/exex/remote/src/exex.rs:66-76 | docs/vocs/docs/snippets/sources/exex/remote/src/exex_2.rs:32-39 | docs/vocs/docs/snippets/sources/exex/remote/src/exex_3.rs:48-55 | docs/vocs/docs/snippets/sources/exex/remote/src/exex_4.rs:68-75 \u2014 before extracting anything, compare \u0060docs/vocs/docs/snippets/sources/exex/remote/src/exex.rs\u0060 and \u0060docs/vocs/docs/snippets/sources/exex/remote/src/exex_3.rs\u0060 as WHOLE FILES: 90% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060docs/vocs/docs/snippets/sources/exex/remote/src/exex.rs:66\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/vocs/docs/snippets/sources/exex/remote/src/exex.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0faa7ff67eb400ea7a905bdb04d10f96c91454c939af48f3f30e91948b380b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u201311 lines \u00D7 4): crates/cli/commands/src/db/stats.rs:204-206 | crates/cli/commands/src/db/stats.rs:305-312 | crates/cli/commands/src/db/stats.rs:368-378 | crates/cli/commands/src/db/stats.rs:396-403 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/cli/commands/src/db/stats.rs:204\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 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":"crates/cli/commands/src/db/stats.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"9999d75eeac95101bf24586c102a5897bd9550023fbc22f0d61669d417767aab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/rpc/rpc-engine-api/src/engine_api.rs:1174-1184 | crates/rpc/rpc-engine-api/src/engine_api.rs:1197-1207 | crates/rpc/rpc-engine-api/src/engine_api.rs:1228-1238 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/rpc/rpc-engine-api/src/engine_api.rs:1211\u0060 calls \u0060Ok\u0060 and \u0060crates/rpc/rpc-engine-api/src/engine_api.rs:1186\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":"crates/rpc/rpc-engine-api/src/engine_api.rs"},"region":{"startLine":1174}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4ca7f8eed66b790e7d6163815403bfe1561acb3f0c46aa2e18333aa7655dea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/net/discv4/src/lib.rs:1635-1645 | crates/net/discv4/src/lib.rs:1647-1657 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/discv4/src/lib.rs"},"region":{"startLine":1635}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78378723a489ba78e56350c9f3365cdddabdf40bf4f7a3c3b74bd052cdfed10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/net/ecies/src/codec.rs:70-80 | crates/net/ecies/src/codec.rs:89-99 \u2014 both copies are in the same file, so extract the block 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":"crates/net/ecies/src/codec.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f0150b605e6cad43c0681548b282a3c337520f7275478f008099c40b2eb59c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/net/network/src/error.rs:251-261 | crates/net/network/src/error.rs:272-282 \u2014 both copies are in the same file, so extract the block 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":"crates/net/network/src/error.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a394856091a5741ae71417e9fa12c97da83d61cdae840309d6df004e5fee92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rpc/rpc-engine-api/src/engine_api.rs:1133-1143 | crates/rpc/rpc-engine-api/src/engine_api.rs:1177-1187 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rpc/rpc-engine-api/src/engine_api.rs:1133\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":"crates/rpc/rpc-engine-api/src/engine_api.rs"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"e874b28669e9cf9ef0b2118fea961710bed166bccbd06f9a06744a70cf8986e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rpc/rpc-engine-api/src/engine_api.rs:1396-1406 | crates/rpc/rpc-engine-api/src/engine_api.rs:1425-1435 \u2014 both copies are in the same file, so extract the block 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":"crates/rpc/rpc-engine-api/src/engine_api.rs"},"region":{"startLine":1396}}}],"partialFingerprints":{"codehealthFindingId/v1":"7400d9e5e8cee673579400e83719b358a504fa0025fafe874ab05d1cd18b64fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rpc/rpc-eth-api/src/helpers/blocking_task.rs:203-213 | crates/rpc/rpc/src/eth/filter.rs:690-700 \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 \u0060crates/rpc/rpc-eth-api/src/helpers/blocking_task.rs:203\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":"crates/rpc/rpc-eth-api/src/helpers/blocking_task.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f0c2c0b771a9ba2f1e944cccdf037c1456d63d7a797cf55429ba4e2a77a5278"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/stages/stages/src/stages/hashing_account.rs:234-244 | crates/stages/stages/src/stages/hashing_storage.rs:174-184 \u2014 before extracting anything, compare \u0060crates/stages/stages/src/stages/hashing_account.rs\u0060 and \u0060crates/stages/stages/src/stages/hashing_storage.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/stages/stages/src/stages/hashing_account.rs:234\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":"crates/stages/stages/src/stages/hashing_account.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"082d567ff8f05afebbeaaf52e590e67174aa05386f6a8e58e949630b03f71344"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/storage/db-common/src/init.rs:717-727 | crates/storage/db-common/src/init.rs:789-799 \u2014 both copies are in the same file, so extract the block 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":"crates/storage/db-common/src/init.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a19d0022dbc5396e5c4404638d549df0b209369ae0a5f930f6463e9a5c1a90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/storage/nippy-jar/src/cursor.rs:94-104 | crates/storage/nippy-jar/src/cursor.rs:135-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 \u0060crates/storage/nippy-jar/src/cursor.rs:94\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":"crates/storage/nippy-jar/src/cursor.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"400cf15430f67086a218d54e056b579456caaf469da17e88b3959bfcbbc68c20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/storage/provider/src/providers/static_file/writer.rs:1340-1350 | crates/storage/provider/src/providers/static_file/writer.rs:1403-1413 \u2014 both copies are in the same file, so extract the block 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":"crates/storage/provider/src/providers/static_file/writer.rs"},"region":{"startLine":1340}}}],"partialFingerprints":{"codehealthFindingId/v1":"c040b41d1db6e9ef7517bca6e74c320e195f5ff2c393810f75aa76c674a0948c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): crates/storage/rpc-provider/src/lib.rs:484-494 | crates/storage/rpc-provider/src/lib.rs:699-707 \u2014 both copies are in the same file, so extract the block 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":"crates/storage/rpc-provider/src/lib.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a4f86a2c62dfd06ac86e50fa942da36db16f08e88ef7bcca4f5fa718940986"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/storage/storage-overlay/src/manager.rs:920-930 | crates/storage/storage-overlay/src/manager.rs:1031-1041 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/storage/storage-overlay/src/manager.rs:920\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/storage-overlay/src/manager.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f0f90de31d428fd8d8d17c79b498ff22b29531ea1afa6a7596297e716ec3c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/storage/storage-overlay/src/manager.rs:949-959 | crates/storage/storage-overlay/src/manager.rs:1053-1063 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/storage/storage-overlay/src/manager.rs:949\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":"crates/storage/storage-overlay/src/manager.rs"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"a71f679b90abaac9005c20174b560e9801195da576fc187f581d832efe443da5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/trie/trie/src/hashed_cursor/post_state.rs:310-322 | crates/trie/trie/src/trie_cursor/in_memory.rs:297-307 \u2014 before extracting anything, compare \u0060crates/trie/trie/src/hashed_cursor/post_state.rs\u0060 and \u0060crates/trie/trie/src/trie_cursor/in_memory.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 93 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/trie/trie/src/hashed_cursor/post_state.rs:310\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060key\u0060 to \u0060B256\u0060 in one and \u0060Nibbles\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":"crates/trie/trie/src/hashed_cursor/post_state.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6488d776c5fa19a9b185b91d47ff98a09a71b53bc1ba7dc96c5dcbb8b0aaaea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/cli/commands/src/db/repair_trie.rs:170-179 | crates/cli/commands/src/db/repair_trie.rs:294-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/repair_trie.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"93cfe921302ee850a80bd4899230182b985c0800e6f0a67959394d927f02838c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/cli/commands/src/download/extract.rs:488-497 | crates/cli/commands/src/download/fetch.rs:428-437 \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":"crates/cli/commands/src/download/extract.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"63de43a947fb48f9f4d4b22f3092ea171762ead0c1a655f979c6611102945799"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/engine/tree/src/tree/payload_processor/prewarm.rs:380-389 | crates/engine/tree/src/tree/payload_processor/prewarm.rs:418-427 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/tree/src/tree/payload_processor/prewarm.rs:380\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/engine/tree/src/tree/payload_processor/prewarm.rs:428\u0060 calls \u0060Some\u0060, \u0060reject\u0060 and \u0060crates/engine/tree/src/tree/payload_processor/prewarm.rs:390\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":"crates/engine/tree/src/tree/payload_processor/prewarm.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf0d2ff9b241999eda1992bf9f78adc24370aa31e722abac68acc18741fa0c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/ethereum/node/src/engine_ssz_proxy.rs:592-601 | crates/ethereum/node/src/engine_ssz_proxy.rs:636-645 \u2014 both copies are in the same file, so extract the block 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":"crates/ethereum/node/src/engine_ssz_proxy.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"7925c5268515a904ef681914dfcd9c3e9fd1d842f8ab0f54bebc5155053ee9b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/net/eth-wire-types/src/broadcast.rs:744-753 | crates/net/eth-wire-types/src/broadcast.rs:940-949 \u2014 both copies are in the same file, so extract the block 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":"crates/net/eth-wire-types/src/broadcast.rs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"09cde5b442e455d6be9f2ec7d5c674f33759d2564c7dc2c171e4a8070e3de397"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/net/network/src/session/active.rs:611-620 | crates/net/network/src/session/active.rs:637-646 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/net/network/src/session/active.rs:611\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/session/active.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"d630494db58804415c6761ea8981bdc42df526f269804955b773167e4449b86a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/rpc/rpc/src/eth/helpers/signer.rs:33-41 | crates/rpc/rpc/src/eth/helpers/signer.rs:59-68 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rpc/rpc/src/eth/helpers/signer.rs:33\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":"crates/rpc/rpc/src/eth/helpers/signer.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b3e0e694333608a78a956a25ade7d97afdbf597100314af6fc3dcb6d06dfda3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/storage/provider/src/providers/state/latest.rs:270-279 | crates/storage/storage-overlay/src/provider.rs:845-854 \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 \u0060crates/storage/provider/src/providers/state/latest.rs:270\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":"crates/storage/provider/src/providers/state/latest.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dad9eeb84e6ea7eb690a9687a2ddb98761dbb144b63dd4e1dcc1a3ebb6ebbe9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/storage/provider/src/providers/static_file/writer.rs:142-151 | crates/storage/provider/src/providers/static_file/writer.rs:192-201 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/storage/provider/src/providers/static_file/writer.rs:142\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/static_file/writer.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d9f31e3befca714985288386d6492d96908a48aa7d4c41dd9a1afebf26a6d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/transaction-pool/src/blobstore/disk.rs:313-322 | crates/transaction-pool/src/blobstore/mem.rs:183-192 \u2014 before extracting anything, compare \u0060crates/transaction-pool/src/blobstore/disk.rs\u0060 and \u0060crates/transaction-pool/src/blobstore/mem.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/transaction-pool/src/blobstore/disk.rs:313\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/blobstore/disk.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b2f2fce1079d50082eceb032e77a52773d5d1ca616928d5187a89810badca3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/trie/common/src/prefix_set.rs:282-291 | crates/trie/common/src/prefix_set.rs:340-349 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/trie/common/src/prefix_set.rs:282\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/common/src/prefix_set.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fddcf24ca8b72d8aae9c2b468c7487810f6a29626f3dbfe5493c02abf975f2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/trie/db/src/state.rs:231-240 | crates/trie/db/src/state.rs:249-258 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/db/src/state.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c55a1d2eed507c6335c0e08c974770e49e0bfc519ef38da8e4cb3157f4955f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): docs/vocs/docs/snippets/sources/exex/hello-world/src/bin/2.rs:11-20 | docs/vocs/docs/snippets/sources/exex/hello-world/src/bin/3.rs:37-46 \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":"docs/vocs/docs/snippets/sources/exex/hello-world/src/bin/2.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2291edd1ed4b3b6e92261221bdcdfcd255bcdf7e951e32204a7af45d1d7d19d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): docs/vocs/docs/snippets/sources/exex/remote/src/exex.rs:53-62 | docs/vocs/docs/snippets/sources/exex/remote/src/exex_4.rs:55-64 \u2014 before extracting anything, compare \u0060docs/vocs/docs/snippets/sources/exex/remote/src/exex.rs\u0060 and \u0060docs/vocs/docs/snippets/sources/exex/remote/src/exex_4.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060docs/vocs/docs/snippets/sources/exex/remote/src/exex.rs:53\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/vocs/docs/snippets/sources/exex/remote/src/exex.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"963789f385ac689045f060f9a0d9d9ef447a40714321925b686b13e9bf0618a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 4): crates/cli/commands/src/db/stats.rs:123-130 | crates/cli/commands/src/db/stats.rs:193-200 | crates/cli/commands/src/db/stats.rs:382-389 | crates/cli/commands/src/db/stats.rs:431-439 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/cli/commands/src/db/stats.rs:192\u0060 calls \u0060is_empty\u0060 and \u0060crates/cli/commands/src/db/stats.rs:121\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":"crates/cli/commands/src/db/stats.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"20fba6fc8b4f217f14e5fa975c565d47aea742b43d4e88f22683213e11e7881a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20139 lines \u00D7 5): crates/net/network/src/fetch/mod.rs:400-405 | crates/net/network/src/fetch/mod.rs:431-440 | crates/net/network/src/fetch/mod.rs:453-461 | crates/net/network/src/fetch/mod.rs:477-485 | crates/net/network/src/fetch/mod.rs:513-521 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/net/network/src/fetch/mod.rs:400\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 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060crate) fn on_block_headers_response( \u0026mut\u0060 in one and \u0060crate) fn on_block_bodies_response( \u0026mut\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":"crates/net/network/src/fetch/mod.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8c63c73e53530787917ea5b92ab3d5ea936b6557ecc7e449fbbc5dfd52ebca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/rpc/rpc-engine-api/src/engine_api.rs:1159-1167 | crates/rpc/rpc-engine-api/src/engine_api.rs:1299-1307 | crates/rpc/rpc-engine-api/src/engine_api.rs:1321-1329 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rpc/rpc-engine-api/src/engine_api.rs:1159\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":"crates/rpc/rpc-engine-api/src/engine_api.rs"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"844ef8a17c3e72adfc819bab09a8d3008386fc0a1b641be65fee6f38c7332e7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 3): crates/storage/provider/src/providers/rocksdb/provider.rs:997-1003 | crates/storage/provider/src/providers/rocksdb/provider.rs:1748-1756 | crates/storage/provider/src/providers/rocksdb/provider.rs:2807-2814 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/storage/provider/src/providers/rocksdb/provider.rs:997\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 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":"crates/storage/provider/src/providers/rocksdb/provider.rs"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e6f626449074ca4bd9d2195212b5dfed16ab09ee213b2fb4fcbc0f0cd77554c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/cli/commands/src/db/copy.rs:48-56 | crates/cli/commands/src/db/migrate_v2.rs:414-422 \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":"crates/cli/commands/src/db/copy.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"05abec4dd7109d71f905400ed42ad183dd8282df19845287f98a83d1c3b39144"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/cli/commands/src/stage/dump/execution.rs:76-83 | crates/cli/commands/src/stage/dump/merkle.rs:44-52 \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 \u0060crates/cli/commands/src/stage/dump/execution.rs:76\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/stage/dump/execution.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1633a0512e2b46fe594b32eb485bd1771cd87018ad3902bcc26ac183cb1734"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/engine/tree/src/tree/mod.rs:778-786 | crates/engine/tree/src/tree/mod.rs:859-867 \u2014 both copies are in the same file, so extract the block 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, \u0060crates/engine/tree/src/tree/mod.rs:858\u0060 calls \u0060elapsed\u0060 and \u0060crates/engine/tree/src/tree/mod.rs:777\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":"crates/engine/tree/src/tree/mod.rs"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7c1c9e444f90dc7883b7f544e234f7d488ce5540350cdea0beb02100588a32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rpc/rpc-engine-api/src/engine_api.rs:876-884 | crates/rpc/rpc-engine-api/src/engine_api.rs:972-980 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rpc/rpc-engine-api/src/engine_api.rs:876\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/rpc/rpc-engine-api/src/engine_api.rs:885\u0060 calls \u0060with_capacity\u0060 and \u0060crates/rpc/rpc-engine-api/src/engine_api.rs:981\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":"crates/rpc/rpc-engine-api/src/engine_api.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"690a31d152d65108c67f08c3008ac9b2a168919cb4cd7376ba0c8f75a5e92d6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rpc/rpc/src/otterscan.rs:190-198 | crates/rpc/rpc/src/otterscan.rs:206-214 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rpc/rpc/src/otterscan.rs:190\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":"crates/rpc/rpc/src/otterscan.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3adf851b1ea653db5324bba53755b3ee7cb83f72eb6bf97edf442c126c2713"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rpc/rpc/src/trace.rs:611-619 | crates/rpc/rpc/src/trace.rs:647-655 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rpc/rpc/src/trace.rs:611\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc/src/trace.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1ced42ee3ebbec7bf848be811837ef3e8689efd992154a5d8953919975f2e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/stages/stages/src/stages/utils.rs:346-354 | crates/stages/stages/src/stages/utils.rs:389-397 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/stages/stages/src/stages/utils.rs:346\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":"crates/stages/stages/src/stages/utils.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bfdd09f8e3ef26bad4c742843e07172f9af657f74a79400afc75659d815b44f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/stages/stages/src/stages/utils.rs:568-576 | crates/stages/stages/src/stages/utils.rs:613-621 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/stages/stages/src/stages/utils.rs:568\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":"crates/stages/stages/src/stages/utils.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe632c50241a9638ccfa2d9dbfdbd18723e2d653074fad01ef767cdcd0ee45b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/storage/db/src/implementation/mdbx/mod.rs:321-329 | crates/storage/db/src/implementation/mdbx/mod.rs:334-342 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/storage/db/src/implementation/mdbx/mod.rs:321\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":"crates/storage/db/src/implementation/mdbx/mod.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a489246ffa79e0c93cd1e2ad685a1425df4de9875e5df3bc2468a7c4378683"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/storage/nippy-jar/src/consistency.rs:67-81 | crates/storage/nippy-jar/src/consistency.rs:105-113 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/storage/nippy-jar/src/consistency.rs:67\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/nippy-jar/src/consistency.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"265925078c2968c41d8ac48ef2e9d66f6720e0c7a5ef43103e8d136167497cf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/storage/provider/src/providers/database/provider.rs:3379-3388 | crates/storage/provider/src/providers/database/provider.rs:3405-3413 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/storage/provider/src/providers/database/provider.rs:3379\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":"crates/storage/provider/src/providers/database/provider.rs"},"region":{"startLine":3379}}}],"partialFingerprints":{"codehealthFindingId/v1":"15eb1f24595d696310334d09339f15115055653f7627a29d418586887b7f7d99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/storage/provider/src/providers/rocksdb/provider.rs:2241-2248 | crates/storage/provider/src/providers/rocksdb/provider.rs:2275-2283 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/storage/provider/src/providers/rocksdb/provider.rs:2275\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. 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":"crates/storage/provider/src/providers/rocksdb/provider.rs"},"region":{"startLine":2241}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a36da9be0bdfcad54a713b78e74418e2fdcc01495f1f5fec17c81be40ae378"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/storage/provider/src/providers/rocksdb/provider.rs:2694-2701 | crates/storage/provider/src/providers/rocksdb/provider.rs:2728-2736 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/storage/provider/src/providers/rocksdb/provider.rs:2728\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. 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":"crates/storage/provider/src/providers/rocksdb/provider.rs"},"region":{"startLine":2694}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ccf164a6b061350a387eee76ceb74845d75f68050307ddfcaf09faf44e4e197"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/storage/storage-overlay/src/provider.rs:758-766 | crates/storage/storage-overlay/src/provider.rs:776-784 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/storage/storage-overlay/src/provider.rs:758\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/storage-overlay/src/provider.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a540f5b8870d957b8dd5cab17e11194f75fed807415d8f0731349f8fcf503fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/transaction-pool/src/blobstore/disk.rs:398-406 | crates/transaction-pool/src/blobstore/mem.rs:229-237 \u2014 before extracting anything, compare \u0060crates/transaction-pool/src/blobstore/disk.rs\u0060 and \u0060crates/transaction-pool/src/blobstore/mem.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/transaction-pool/src/blobstore/disk.rs: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":"crates/transaction-pool/src/blobstore/disk.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc023977cdd13dec9d8bb202b931e2c9ca3f6bcf7b08a56460b98606f914e16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/trie/common/src/proofs.rs:241-249 | crates/trie/common/src/proofs.rs:744-752 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/trie/common/src/proofs.rs:241\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":"crates/trie/common/src/proofs.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"10fae80774201ae1454d1c226056989481fb49ccdb6834440b7c797b3556adae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/trie/common/src/target_v2.rs:237-245 | crates/trie/common/src/target_v2.rs:269-277 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/trie/common/src/target_v2.rs:237\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/common/src/target_v2.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d402f3fae94286387983a1c86ef25d882bcbe363e8b2882c4292df2c4dd0e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/trie/trie/src/hashed_cursor/post_state.rs:198-206 | crates/trie/trie/src/trie_cursor/in_memory.rs:147-155 \u2014 before extracting anything, compare \u0060crates/trie/trie/src/hashed_cursor/post_state.rs\u0060 and \u0060crates/trie/trie/src/trie_cursor/in_memory.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 93 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060next_entry\u0060 to \u0060\u0026Option\u003C(B256, V::NonZero)\u003E\u0060 in one and \u0060\u0026Option\u003C(Nibbles, BranchNodeCompact)\u003E\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":"crates/trie/trie/src/hashed_cursor/post_state.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"27fe23b67f0a966c5a3959c8bb5c61f9bc63197973794dc867c8914d4cd1dcd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/storage/provider/src/either_writer.rs:467-474 | crates/storage/provider/src/either_writer.rs:499-506 | crates/storage/provider/src/either_writer.rs:598-605 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/storage/provider/src/either_writer.rs:467\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060key\u0060 to \u0060StorageShardedKey\u0060 in one and \u0060ShardedKey\u003CAddress\u003E\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":"crates/storage/provider/src/either_writer.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ada37e745f2d2715d657cc92aaa9e91fe675eaa74ba23123cfa220ea671521"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/net/downloaders/src/file_client.rs:258-265 | crates/net/downloaders/src/receipt_file_client.rs:90-97 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/net/downloaders/src/file_client.rs: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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/net/downloaders/src/file_client.rs:256\u0060 calls \u0060clone\u0060 and \u0060crates/net/downloaders/src/receipt_file_client.rs:88\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":"crates/net/downloaders/src/file_client.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eaa0a0edd167e3e1e84778a6594206ea94d8c5988e034a285bb8b6afd01e1b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/node/builder/src/builder/mod.rs:274-281 | crates/node/builder/src/builder/mod.rs:298-305 \u2014 both copies are in the same file, so extract the block 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":"crates/node/builder/src/builder/mod.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2acd24b53f60508e8891e494616ed83331b3b9d821b2767bdaf0811c84bc188"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rpc/rpc-eth-types/src/gas_oracle.rs:144-151 | crates/rpc/rpc-eth-types/src/gas_oracle.rs:302-309 \u2014 both copies are in the same file, so extract the block 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":"crates/rpc/rpc-eth-types/src/gas_oracle.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"0982dfdfdbc663dfde9c237e74069a561bda1ef4f39b45b1d5ab210a3a38f813"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rpc/rpc/src/eth/bundle.rs:192-199 | crates/rpc/rpc/src/eth/sim_bundle.rs:339-346 \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":"crates/rpc/rpc/src/eth/bundle.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"9edb25374e0677c4618500f094177c38cdf851b86a05b8784100b4f464124c66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): crates/storage/db-common/src/init.rs:734-739 | crates/storage/db-common/src/init.rs:828-835 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/storage/db-common/src/init.rs:734\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/db-common/src/init.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"4564955dcaa77fdb88ee8d8f79e493fb91ceb469e724ccedc5235877ea291011"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/storage/provider/src/providers/blockchain_provider.rs:311-318 | crates/storage/provider/src/providers/blockchain_provider.rs:367-374 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/storage/provider/src/providers/blockchain_provider.rs:311\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/blockchain_provider.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"063f598097ec1b49dc3c1b5a111d849db988aa24e583916faa2b0a13274bb0e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/storage/provider/src/providers/database/provider.rs:1422-1429 | crates/storage/provider/src/providers/rocksdb/provider.rs:1661-1669 \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 \u0060crates/storage/provider/src/providers/database/provider.rs:1422\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/database/provider.rs"},"region":{"startLine":1422}}}],"partialFingerprints":{"codehealthFindingId/v1":"97a44125e999b7c3bc17bd93121c99ddd579fc5dce1e43a246d2ef8c80f5563f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/storage/provider/src/providers/static_file/writer.rs:103-110 | crates/storage/provider/src/providers/static_file/writer.rs:121-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":"crates/storage/provider/src/providers/static_file/writer.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb757af85b3bc3812b94fd2684fc11daf951b22401d1f2083406956e62756d94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/storage/provider/src/providers/static_file/writer.rs:553-560 | crates/storage/provider/src/providers/static_file/writer.rs:635-642 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/storage/provider/src/providers/static_file/writer.rs: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/static_file/writer.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5be9a74880c39da54b9978de64f862b29117e40856403f59c90da19300ddc12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/tasks/src/pool.rs:271-278 | crates/tasks/src/pool.rs:288-295 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tasks/src/pool.rs:271\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tasks/src/pool.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"893259e79e4fa7a9e645192cf1d2bef7c84a2838e9cff55a0acc12f39e20cba0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/tracing-otlp/src/otlp.rs:63-70 | crates/tracing-otlp/src/otlp.rs:105-112 \u2014 both copies are in the same file, so extract the block 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":"crates/tracing-otlp/src/otlp.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a07a5df2d67c6d297682c5f1fdbd82e0d7e3daee02d04d5e6f1e7e302efb7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/transaction-pool/src/pool/state.rs:106-113 | crates/transaction-pool/src/pool/state.rs:122-129 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/transaction-pool/src/pool/state.rs:106\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/pool/state.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"3151177164c7cfcac59d54a27f2a20cd8251846ad1a41cf3e79c7b6191b3092e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/trie/common/src/updates.rs:188-195 | crates/trie/common/src/updates.rs:351-358 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/trie/common/src/updates.rs:188\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":"crates/trie/common/src/updates.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"c096ec2b6dea1df157983ae5d4bbe34c570479e503fe705872dce0bb86c193f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): crates/trie/sparse/src/arena/mod.rs:794-801 | crates/trie/sparse/src/arena/mod.rs:880-885 \u2014 both copies are in the same file, so extract the block 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":"crates/trie/sparse/src/arena/mod.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d513887e72f5a5e8b9a5f7b8165755b1cdf39b48b66fdf7bc8ae5c8f43b5e55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/trie/trie/src/trie.rs:279-286 | crates/trie/trie/src/trie.rs:850-857 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/trie/trie/src/trie.rs:279\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/trie/src/trie.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"e129fb7ba1e1dd5715be9a8f16ccfe0c5e8ef4a5e8cf68f8bdecf0e57f100d7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/cli/commands/src/db/repair_trie.rs:83-89 | crates/cli/commands/src/prune.rs:44-50 | crates/cli/commands/src/stage/run.rs:138-144 | crates/node/builder/src/launch/common.rs:818-824 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/cli/commands/src/db/repair_trie.rs:83\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/repair_trie.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"508f8c991256a51280a0327e51b907252d0c6bf1ce86a3b67c00a0b439732572"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/storage/provider/src/providers/database/provider.rs:1422-1429 | crates/storage/provider/src/providers/rocksdb/provider.rs:1661-1667 | crates/storage/provider/src/providers/rocksdb/provider.rs:2171-2177 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/storage/provider/src/providers/database/provider.rs:1422\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/database/provider.rs"},"region":{"startLine":1422}}}],"partialFingerprints":{"codehealthFindingId/v1":"252f485d3d5bb35fd233cb60e853f390c7b3d6a00fd0196a1adc565df14fe357"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/tasks/src/runtime.rs:709-715 | crates/tasks/src/runtime.rs:778-784 | crates/tasks/src/runtime.rs:847-853 \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":"crates/tasks/src/runtime.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f8a2baabda5bcad55ceaabef451e72c75740be8a7103e800196d5c3944defcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): docs/vocs/docs/snippets/sources/exex/hello-world/src/bin/3.rs:15-21 | docs/vocs/docs/snippets/sources/exex/remote/src/consumer.rs:22-28 | docs/vocs/docs/snippets/sources/exex/tracking-state/src/bin/1.rs:30-36 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060docs/vocs/docs/snippets/sources/exex/hello-world/src/bin/3.rs:15\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":"docs/vocs/docs/snippets/sources/exex/hello-world/src/bin/3.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"098843987a3cf552e69e990f510479c880cf5a28ec04ebcea1e12115310705fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/cli/commands/src/download/tui.rs:229-235 | crates/cli/commands/src/download/tui.rs:242-248 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/cli/commands/src/download/tui.rs:229\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/download/tui.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4328d9a9374c277595f8da7567c03edf1517d67490f74f7217e5cca8838c7e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/net/eth-wire-types/src/broadcast.rs:736-742 | crates/net/eth-wire-types/src/broadcast.rs:920-926 \u2014 both copies are in the same file, so extract the block 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":"crates/net/eth-wire-types/src/broadcast.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"479143c6edf52d83296d923056d2910ec08478f69b84604894a9897811277c30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/stages/stages/src/stages/utils.rs:254-260 | crates/stages/stages/src/stages/utils.rs:462-468 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/stages/stages/src/stages/utils.rs:254\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stages/stages/src/stages/utils.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"2232a1aba5d9b005a2350e099a5fb831795c36384017cb15bc4ecacfa715134c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/storage/provider/src/providers/database/provider.rs:2167-2173 | crates/storage/provider/src/providers/database/provider.rs:2287-2293 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/storage/provider/src/providers/database/provider.rs:2167\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":"crates/storage/provider/src/providers/database/provider.rs"},"region":{"startLine":2167}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f2ddf4e9e39c0a9911de01750b7ba1e924a6ce59ed655705667d1ad14a69109"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): crates/storage/provider/src/providers/rocksdb/provider.rs:1047-1052 | crates/storage/provider/src/providers/rocksdb/provider.rs:2834-2840 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/storage/provider/src/providers/rocksdb/provider.rs:1047\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. 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":"crates/storage/provider/src/providers/rocksdb/provider.rs"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"f831f832b9b76cc0bbca3a3db93885bfc0d32c9a7c8b051508bdc5e972f537f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/storage/provider/src/providers/rocksdb/provider.rs:1279-1285 | crates/storage/provider/src/providers/rocksdb/provider.rs:1329-1335 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/storage/provider/src/providers/rocksdb/provider.rs:1279\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/rocksdb/provider.rs"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ea69bf3c87f9df0c71ead0d90a2e94e851b06cc892f6870c165ca632eb323f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/transaction-pool/src/traits.rs:201-207 | crates/transaction-pool/src/traits.rs:219-225 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/transaction-pool/src/traits.rs:201\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/traits.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dc4d6088aaaa46cc9aef494b8d732ca5f1dda14ae064879d0ccf440beda0ba2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): crates/net/network/src/metrics.rs:395-410 | crates/net/network/src/metrics.rs:464-479 | crates/net/network/src/metrics.rs:533-548 \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. 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":"crates/net/network/src/metrics.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a33b056a66fa18719529779ada16e8196789e55c6618aa61a7e161a88dd1fce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/rpc/rpc-eth-api/src/helpers/transaction.rs:571-576 | crates/rpc/rpc-eth-api/src/helpers/transaction.rs:651-656 \u2014 both copies are in the same file, so extract the block 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":"crates/rpc/rpc-eth-api/src/helpers/transaction.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a1c97524edaf78d45aafcce069ffeadb9b1b18f49dc8c26199a9d77c3737d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/stages/stages/src/stages/index_account_history.rs:150-155 | crates/stages/stages/src/stages/index_storage_history.rs:154-159 \u2014 before extracting anything, compare \u0060crates/stages/stages/src/stages/index_account_history.rs\u0060 and \u0060crates/stages/stages/src/stages/index_storage_history.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/stages/stages/src/stages/index_account_history.rs: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":"crates/stages/stages/src/stages/index_account_history.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec3280b0372e3a8899c6770fb8ebf2d0b1463717ff26e4ee6497db46147269fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/storage/provider/src/either_writer.rs:490-495 | crates/storage/provider/src/either_writer.rs:530-535 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/either_writer.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"2241e4dbd8f50fa7cd431c0405c5e0a3f136462cef289c5eb492f62baee49f34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/trie/common/src/hashed_state.rs:519-525 | crates/trie/common/src/updates.rs:600-606 \u2014 before extracting anything, compare \u0060crates/trie/common/src/hashed_state.rs\u0060 and \u0060crates/trie/common/src/updates.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"crates/trie/common/src/hashed_state.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"1512853b99e372f725264927c2d1dd731bbf55006819a8abf1ee2b68cd50795e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/era-utils/src/history.rs:652-656 | crates/storage/provider/src/providers/static_file/manager.rs:2074-2078 \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 \u0060crates/era-utils/src/history.rs:652\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":"crates/era-utils/src/history.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b773a6c7d238fa7bcd3dcf7b1132ea9f9537e16e910943e72241c1050be8fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/era-utils/src/history.rs:813-820 | crates/stages/stages/src/stages/headers.rs:146-153 \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 \u0060crates/era-utils/src/history.rs:813\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/era-utils/src/history.rs"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8d08dfc9464fc3b58e698f760da06697a7266481b71857f2d147ac7e510673"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/stages/stages/src/stages/utils.rs:262-266 | crates/stages/stages/src/stages/utils.rs:470-474 \u2014 both copies are in the same file, so extract the block 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":"crates/stages/stages/src/stages/utils.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"238d2d4c5e2da090ace580db2c617a134ccc5d184baa9cd0f1cf63e889493cf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/storage/provider/src/providers/rocksdb/provider.rs:2458-2462 | crates/storage/provider/src/providers/rocksdb/provider.rs:2612-2616 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/storage/provider/src/providers/rocksdb/provider.rs:2458\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":"crates/storage/provider/src/providers/rocksdb/provider.rs"},"region":{"startLine":2458}}}],"partialFingerprints":{"codehealthFindingId/v1":"70cee003520ecad5142e299da7c4d91245582ef6cbef53243eef1fc55ad40302"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/cli/commands/src/db/prune_checkpoints.rs:20-25 | crates/cli/commands/src/db/stage_checkpoints.rs:22-27 \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":"crates/cli/commands/src/db/prune_checkpoints.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"281e8c4e2d6383965e2851b4e97e0045d0e0cb22e4f784555fff8aa9703d07d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/cli/commands/src/db/prune_checkpoints.rs:112-117 | crates/cli/commands/src/db/stage_checkpoints.rs:30-35 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/prune_checkpoints.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd0a6fc31f2328e18ca30c5d85ef925bd0b004623ca1f45575a9c3362e37e7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/config/src/config.rs:296-305 | crates/stages/types/src/execution.rs:20-29 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/config.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f8dce38027ef741b499e6a32626d6df609b95ef8163a2427c70dab100f83ce7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/era-utils/src/export/era1.rs:85-91 | crates/era-utils/src/export/ere.rs:110-116 \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":"crates/era-utils/src/export/era1.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c31c10a62cf2a997d324980f6d7ecf92eee8aaeb5ef4f5c4759513111613b0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/era/src/era/file.rs:220-228 | crates/era/src/era1/file.rs:283-291 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/era/src/era/file.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb4e8c0bb6f48b183826beb06d53a00db50da4b98b39ad68fbf2a05eefbdfe9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/era/src/era1/types/execution.rs:154-158 | crates/era/src/era1/types/execution.rs:223-227 | crates/era/src/ere/types/execution.rs:89-93 | crates/era/src/ere/types/execution.rs:152-156 \u2014 before extracting anything, compare \u0060crates/era/src/era1/types/execution.rs\u0060 and \u0060crates/era/src/ere/types/execution.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/era/src/era1/types/execution.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef828185f48b0751b8c3f51cdad6cb8eb18b4c6ff8dacf38c7d67b49bc813cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/era/src/era1/types/execution.rs:285-289 | crates/era/src/ere/types/execution.rs:210-214 \u2014 before extracting anything, compare \u0060crates/era/src/era1/types/execution.rs\u0060 and \u0060crates/era/src/ere/types/execution.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/era/src/era1/types/execution.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"387ab98868b2d87841c365d47a8fa492932f94521bcec0b1d258b2d25288802f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/era/src/era1/types/execution.rs:499-504 | crates/era/src/ere/types/execution.rs:601-606 \u2014 before extracting anything, compare \u0060crates/era/src/era1/types/execution.rs\u0060 and \u0060crates/era/src/ere/types/execution.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/era/src/era1/types/execution.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"16997e6f7d527e151c02c6bd95b7ba2a700258912f7f93ec9cbf4cb47d3afb86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/net/p2p/src/bodies/client.rs:80-84 | crates/net/p2p/src/headers/client.rs:111-115 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/p2p/src/bodies/client.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b5d1cc91120f331408d9d471d91bbbc8879be52a3934d4048f8dd9bb1aa2c81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/node/core/src/args/rpc_state_cache.rs:106-120 | crates/rpc/rpc-eth-types/src/cache/config.rs:67-81 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/core/src/args/rpc_state_cache.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d6d6698cfc46a79b9fdae9e5b4ead4c5264acdb7335e775072154b79ca1fdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/storage/storage-api/src/block_hash.rs:18-23 | crates/storage/storage-api/src/block_id.rs:41-46 \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 \u0060crates/storage/storage-api/src/block_hash.rs:18\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":"crates/storage/storage-api/src/block_hash.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1eb684dd0ff6b55dc872073c3bd51f8f079002e3edcb426e47124140a58058"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/transaction-pool/src/blobstore/noop.rs:53-58 | crates/transaction-pool/src/noop.rs:370-375 \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 \u0060crates/transaction-pool/src/blobstore/noop.rs:53\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":"crates/transaction-pool/src/blobstore/noop.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"679256570a232ecf7eb11abd7adabecc41f78d830a8793c9d4996d7c3ff06fd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/transaction-pool/src/pool/blob.rs:81-86 | crates/transaction-pool/src/pool/parked.rs:159-164 \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 \u0060crates/transaction-pool/src/pool/blob.rs:81\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":"crates/transaction-pool/src/pool/blob.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"0840b088eab7c371f37befab63ffa798006f9d522da2e4f2977409bd1b34b9f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/trie/trie/src/hashed_cursor/metrics.rs:94-100 | crates/trie/trie/src/trie_cursor/metrics.rs:104-110 \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 \u0060crates/trie/trie/src/trie_cursor/metrics.rs:104\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 \u0060key\u0060 to \u0060B256\u0060 in one and \u0060Nibbles\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":"crates/trie/trie/src/hashed_cursor/metrics.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"f11c1ffede5c678631e1e1004b59641aab75c131bb8a9be2ccf49838eeaa0f7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/trie/trie/src/hashed_cursor/metrics.rs:102-108 | crates/trie/trie/src/trie_cursor/metrics.rs:112-118 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/trie/trie/src/trie_cursor/metrics.rs:120\u0060 calls \u0060current\u0060 and \u0060crates/trie/trie/src/hashed_cursor/metrics.rs:110\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":"crates/trie/trie/src/hashed_cursor/metrics.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f57c145a8ae04adeec6bb916e1ef48c8cee4044fe750969f862d2d6a0f8389"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/trie/trie/src/hashed_cursor/post_state.rs:161-172 | crates/trie/trie/src/trie_cursor/in_memory.rs:116-127 \u2014 before extracting anything, compare \u0060crates/trie/trie/src/hashed_cursor/post_state.rs\u0060 and \u0060crates/trie/trie/src/trie_cursor/in_memory.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 93 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/trie/trie/src/hashed_cursor/post_state.rs:161\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":"crates/trie/trie/src/hashed_cursor/post_state.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d0b1ec57050627805f3685481cc70177049c650af9c1b7f669ee61b8732d7a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): docs/vocs/docs/snippets/sources/exex/remote/src/exex_1.rs:19-23 | docs/vocs/docs/snippets/sources/exex/remote/src/exex_2.rs:24-28 \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 \u0060docs/vocs/docs/snippets/sources/exex/remote/src/exex_1.rs:19\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":"docs/vocs/docs/snippets/sources/exex/remote/src/exex_1.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f237e026917105775304d420995341a02d4c29ec92da9ce8fb7dccd30ed8a43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/net/discv4/src/lib.rs:835-839 | crates/net/dns/src/lib.rs:199-203 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/discv4/src/lib.rs"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"8780b9158d3efe6b8a3ca86047a444d4baa829fb1fb675aba4e27ed4c8e8b1cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 7): crates/node/builder/src/rpc.rs:651-672 | crates/node/builder/src/rpc.rs:678-699 | crates/node/builder/src/rpc.rs:742-763 | crates/node/builder/src/rpc.rs:772-793 | crates/rpc/rpc-convert/src/transaction.rs:680-701 | crates/rpc/rpc-convert/src/transaction.rs:761-782 | crates/rpc/rpc-convert/src/transaction.rs:788-809 \u2014 there are 7 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 7 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/node/builder/src/rpc.rs:651\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":"crates/node/builder/src/rpc.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d1fe464486fbe9c2278af6d63d2d391a8728c925a3e19d41a205a5af71c4c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/stages/stages/src/stages/hashing_account.rs:348-353 | crates/stages/stages/src/stages/hashing_storage.rs:268-273 \u2014 before extracting anything, compare \u0060crates/stages/stages/src/stages/hashing_account.rs\u0060 and \u0060crates/stages/stages/src/stages/hashing_storage.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stages/stages/src/stages/hashing_account.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"64e4a71ae4eeb890f1a5791744bccedf3f57469dffa40820964c135a821b1c8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/stages/stages/src/stages/index_account_history.rs:167-175 | crates/stages/stages/src/stages/index_storage_history.rs:171-178 \u2014 before extracting anything, compare \u0060crates/stages/stages/src/stages/index_account_history.rs\u0060 and \u0060crates/stages/stages/src/stages/index_storage_history.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/stages/stages/src/stages/index_account_history.rs:167\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":"crates/stages/stages/src/stages/index_account_history.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f19c2e05078f6c363f42597b382af56c0d21eff01145f9aab4c0301f94fa94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/transaction-pool/src/pool/parked.rs:397-404 | crates/transaction-pool/src/pool/pending.rs:714-721 \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":"crates/transaction-pool/src/pool/parked.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf9e2d6d9055a46a5981f1a2c92f8b163b95a0c5ce1b28691bbbcbe47e3cdec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/trie/common/src/hashed_state.rs:699-704 | crates/trie/common/src/updates.rs:816-821 \u2014 before extracting anything, compare \u0060crates/trie/common/src/hashed_state.rs\u0060 and \u0060crates/trie/common/src/updates.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/common/src/hashed_state.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb154380da669036edbd7253dc1a85638b211106aff1ea1c4715f8132fb8767"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/trie/common/src/hashed_state.rs:1637-1642 | crates/trie/common/src/hashed_state.rs:1747-1752 | crates/trie/common/src/updates.rs:1461-1466 \u2014 before extracting anything, compare \u0060crates/trie/common/src/hashed_state.rs\u0060 and \u0060crates/trie/common/src/updates.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060value\u0060 to \u0060\u0026\u0027a super::HashedPostState\u0060 in one and \u0060\u0026\u0027a super::HashedPostStateSorted\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":"crates/trie/common/src/hashed_state.rs"},"region":{"startLine":1637}}}],"partialFingerprints":{"codehealthFindingId/v1":"45767ba94904d57c274ba8958dbe1524abf9c2c262841563435772670c855c0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/trie/common/src/hashed_state.rs:1646-1651 | crates/trie/common/src/hashed_state.rs:1756-1761 | crates/trie/common/src/updates.rs:1470-1479 \u2014 before extracting anything, compare \u0060crates/trie/common/src/hashed_state.rs\u0060 and \u0060crates/trie/common/src/updates.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060value\u0060 to \u0060HashedPostState\u003C\u0027a\u003E\u0060 in one and \u0060HashedPostStateSorted\u003C\u0027a\u003E\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":"crates/trie/common/src/hashed_state.rs"},"region":{"startLine":1646}}}],"partialFingerprints":{"codehealthFindingId/v1":"607bf3167d0f4bb115660b254abeb58feed961c69c31b412db071a31d7a54027"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/trie/trie/src/hashed_cursor/metrics.rs:53-62 | crates/trie/trie/src/trie_cursor/metrics.rs:53-62 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/trie/src/hashed_cursor/metrics.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"248ed9d9fb16ec5e5ae29a1f1ed465f091a358cf7b9d1e7a7a3cd7808425b862"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/prune/prune/src/segments/user/account_history.rs:220-233 | crates/prune/prune/src/segments/user/storage_history.rs:222-235 \u2014 before extracting anything, compare \u0060crates/prune/prune/src/segments/user/account_history.rs\u0060 and \u0060crates/prune/prune/src/segments/user/storage_history.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 109 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prune/prune/src/segments/user/account_history.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43ae737c8ae676f31279d17b4e0773ed321f37018fb07975703edaca89e4679"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/prune/prune/src/segments/user/account_history.rs:317-329 | crates/prune/prune/src/segments/user/storage_history.rs:323-336 \u2014 before extracting anything, compare \u0060crates/prune/prune/src/segments/user/account_history.rs\u0060 and \u0060crates/prune/prune/src/segments/user/storage_history.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 109 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/prune/prune/src/segments/user/account_history.rs:317\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":"crates/prune/prune/src/segments/user/account_history.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b8eca236a665e83dcadaf15a98909a3bd477c65e311c3188e3f1295b18f3d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/cli/commands/src/download/extract.rs:418-431 | crates/cli/commands/src/download/extract.rs:463-476 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/cli/commands/src/download/extract.rs:418\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":"crates/cli/commands/src/download/extract.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdfab4afac301d8ce95d206298ba12b1c444d7b90899325e78998305f07dff9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/cli/commands/src/stage/dump/hashing_account.rs:90-102 | crates/cli/commands/src/stage/dump/hashing_storage.rs:85-97 | crates/cli/commands/src/stage/dump/merkle.rs:173-185 \u2014 before extracting anything, compare \u0060crates/cli/commands/src/stage/dump/hashing_account.rs\u0060 and \u0060crates/cli/commands/src/stage/dump/hashing_storage.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/cli/commands/src/stage/dump/hashing_account.rs:90\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/stage/dump/hashing_account.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"e29920640c2f57d4e654c193a8195afab5aa88c77af2d9a9135f2f0653ace3ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/storage/provider/src/providers/rocksdb/provider.rs:2393-2404 | crates/storage/provider/src/providers/rocksdb/provider.rs:2547-2558 \u2014 both copies are in the same file, so extract the block 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":"crates/storage/provider/src/providers/rocksdb/provider.rs"},"region":{"startLine":2393}}}],"partialFingerprints":{"codehealthFindingId/v1":"008fe92608a1e306f3ad1ffe18b2d3199b33b25bc0fe508a1f4288bac2e79646"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/node/builder/src/launch/debug.rs:227-237 | crates/node/builder/src/launch/debug.rs:254-261 \u2014 both copies are in the same file, so extract the block 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":"crates/node/builder/src/launch/debug.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1920823e9ac8aebe39b51be0cb7c78d94a1df871964400aed390fb83987849"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/net/network/src/peers.rs:994-1004 | crates/net/network/src/peers.rs:1143-1153 \u2014 both copies are in the same file, so extract the block 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060crate) fn add_trusted_peer_node(\u0026mut\u0060 in one and \u0060crate) fn unban_peer_by_admin(\u0026mut\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":"crates/net/network/src/peers.rs"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6df3ee1079dad6f55fe833d39b4c51cb7cd7dfb9854a052cc069747e657c5f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/prune/prune/src/segments/user/account_history.rs:68-78 | crates/prune/prune/src/segments/user/storage_history.rs:69-79 \u2014 before extracting anything, compare \u0060crates/prune/prune/src/segments/user/account_history.rs\u0060 and \u0060crates/prune/prune/src/segments/user/storage_history.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 109 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/prune/prune/src/segments/user/account_history.rs:68\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":"crates/prune/prune/src/segments/user/account_history.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"1544dcd676f1a151992956f22175cabbeb4ffa42e52ac9ed0388b1cba40fedc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/cli/commands/src/db/stats.rs:97-107 | crates/storage/db/src/implementation/mdbx/mod.rs:385-392 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/stats.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e29d6acc97a7bf558fead40dae2952658139bc0cb55acdf1957b486e8e8c629"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/stages/stages/src/stages/hashing_account.rs:219-228 | crates/stages/stages/src/stages/hashing_storage.rs:154-162 \u2014 before extracting anything, compare \u0060crates/stages/stages/src/stages/hashing_account.rs\u0060 and \u0060crates/stages/stages/src/stages/hashing_storage.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"crates/stages/stages/src/stages/hashing_account.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d241bf75af4aa322c4015da6fee85186fc634da302f91c55c8e00f6c078ad3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/prune/prune/src/segments/user/account_history.rs:297-306 | crates/prune/prune/src/segments/user/storage_history.rs:301-310 \u2014 before extracting anything, compare \u0060crates/prune/prune/src/segments/user/account_history.rs\u0060 and \u0060crates/prune/prune/src/segments/user/storage_history.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 109 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prune/prune/src/segments/user/account_history.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"21fb65618e97681581ea2b828e6e95f28eae928dad38a5dbe70cf4ba712f3485"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/cli/commands/src/download/fetch.rs:259-268 | crates/cli/commands/src/download/fetch.rs:343-352 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/cli/commands/src/download/fetch.rs:259\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/download/fetch.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"d663a7acf2a6837b2442ae66b5d377a73b3c682732e6f0a06c91b77795fbe02a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/era/src/era/types/consensus.rs:99-107 | crates/era/src/era/types/consensus.rs:215-223 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/era/src/era/types/consensus.rs:99\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":"crates/era/src/era/types/consensus.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"4adc72dafa67657eccc098e1ebebb202da00ae9519f5618801a999bb78db5167"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/stages/stages/src/stages/hashing_account.rs:318-325 | crates/stages/stages/src/stages/hashing_storage.rs:259-266 \u2014 before extracting anything, compare \u0060crates/stages/stages/src/stages/hashing_account.rs\u0060 and \u0060crates/stages/stages/src/stages/hashing_storage.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/stages/stages/src/stages/hashing_account.rs:318\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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060channels\u0060 to \u0060\u0026mut Vec\u003CReceiver\u003C(RawKey\u003CB256\u003E, RawValue\u003CAccount\u003E)\u003E\u003E\u0060 in one and \u0060\u0026mut Vec\u003CReceiver\u003C(Vec\u003Cu8\u003E, CompactU256)\u003E\u003E\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":"crates/stages/stages/src/stages/hashing_account.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"a542846dbc8d427b727a24db05bedb96851cd23ac56847e46ca626c1634c1a3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/trie/common/src/hashed_state.rs:1816-1823 | crates/trie/common/src/updates.rs:1534-1541 \u2014 before extracting anything, compare \u0060crates/trie/common/src/hashed_state.rs\u0060 and \u0060crates/trie/common/src/updates.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/trie/common/src/hashed_state.rs:1816\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":"crates/trie/common/src/hashed_state.rs"},"region":{"startLine":1816}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be466bdb64d2a9829b864a47455b26bcb4f535ef5dcc11010e2568989bb8c59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/era/src/era/file.rs:158-162 | crates/era/src/era1/file.rs:206-210 \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 \u0060crates/era/src/era/file.rs:158\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":"crates/era/src/era/file.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"96269e92ab598e03ecbf8181e76e4755c1d9d7ccd555014e2c03942e84d40dc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/cli/commands/src/db/stats.rs:130-134 | crates/cli/commands/src/db/stats.rs:210-214 \u2014 both copies are in the same file, so extract the block 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":"crates/cli/commands/src/db/stats.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"e481806ee3034833dd48e5e5eb7e16f39564df33bdbc95a2c9ce5935ca320d60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/era-downloader/src/client.rs:136-140 | crates/era-downloader/src/client.rs:155-159 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/era-downloader/src/client.rs:136\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/era-downloader/src/client.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"83eda26a0228781aee1447ede92282c232528aeca2201bbcc329e3e61fed5efc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/rpc/rpc/src/debug.rs:193-197 | crates/rpc/rpc/src/debug.rs:863-867 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rpc/rpc/src/debug.rs:193\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc/src/debug.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"559b5209fdb4be57e74a83d544250298858db32687d3d27db3ddd37cccdc6701"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/storage/db/src/mdbx.rs:39-44 | crates/storage/db/src/mdbx.rs:57-62 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/storage/db/src/mdbx.rs: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":"crates/storage/db/src/mdbx.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb87dc9c4e99aea2ce23115b96ba4124e65d3e1aa03d9db6cb31196a18231a38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): .github/scripts/bench-reth-charts.py:62-67 | .github/scripts/bench-reth-charts.py:70-75 \u2014 both copies are in the same file, so extract the block 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":".github/scripts/bench-reth-charts.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"3069a35a060125d8c96314dad095aab20f568b321a8bcc759cea9aa8eef43c65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): .github/scripts/bench-call-summary.py:367-371 | .github/scripts/bench-reth-summary.py:972-982 \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":".github/scripts/bench-call-summary.py"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"44dc9e41f1540e455e46547def46c00f4b55663d714474d27d9ff8d4a0bf0513"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): .github/scripts/bench-reth-charts.py:81-86 | .github/scripts/bench-reth-charts.py:88-93 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/bench-reth-charts.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1952f0b05046342d11b1eca3c8d87d76292004126efa62255f839571ce0b7d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/storage/provider/src/test_utils/blocks.rs:190-233 | crates/storage/provider/src/test_utils/blocks.rs:240-291 | crates/storage/provider/src/test_utils/blocks.rs:298-349 | crates/storage/provider/src/test_utils/blocks.rs:356-432 | crates/storage/provider/src/test_utils/blocks.rs:439-512 \u2014 These 5 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 5 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 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/test_utils/blocks.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"21668b9b40645f72e0b7aa6ecc564837692a941d5c7926433fc0ac6d7c6e9cc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (63 corresponding lines): crates/e2e-test-utils/src/testsuite/actions/node_ops.rs:66-128 | crates/e2e-test-utils/src/testsuite/actions/node_ops.rs:260-334 \u2014 These two members are one piece of code written twice and then edited apart: 63 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/e2e-test-utils/src/testsuite/actions/node_ops.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"59cc58435f2a8e61180d9dee7e106f40307999db5717556893da1387ba2ba41b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/storage/provider/src/test_utils/blocks.rs:128-139 | crates/storage/provider/src/test_utils/blocks.rs:143-154 \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":"crates/storage/provider/src/test_utils/blocks.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c81215971dc15aa4a3ed2e3424860711ddb3c8e79380d7f516f1e50ab14a0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/e2e-test-utils/src/testsuite/actions/fork.rs:124-161 | crates/e2e-test-utils/src/testsuite/actions/produce_blocks.rs:415-445 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/e2e-test-utils/src/testsuite/actions/fork.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5bd2f66d6164a96180591e6534f74527b1957201527487bd8d6d5de7dba9595"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/e2e-test-utils/src/setup_builder.rs:616-644 | crates/e2e-test-utils/src/setup_builder.rs:650-685 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/e2e-test-utils/src/setup_builder.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"12cadbb9bfc530e7ea5ccf8f9654fa07c4c73cc5588e999c5343ae71a882b083"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/storage/provider/src/test_utils/mod.rs:83-111 | crates/storage/provider/src/test_utils/mod.rs:120-143 \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":"crates/storage/provider/src/test_utils/mod.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"0266e4304417b6d29600d050ffb23e1c64dc898926dce6fcd231dde0d0a200cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/stages/stages/src/test_utils/test_db.rs:46-61 | crates/stages/stages/src/test_utils/test_db.rs:65-81 \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":"crates/stages/stages/src/test_utils/test_db.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"f47151870318ef1ab09793fc3a54ac5af6122de412981b0ffc976fe27da07a98"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/e2e-test-utils/src/testsuite/actions/produce_blocks.rs:762-779 | crates/e2e-test-utils/src/testsuite/actions/produce_blocks.rs:956-978 \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":"crates/e2e-test-utils/src/testsuite/actions/produce_blocks.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa96d379745166c4044a0593ab1dd44040ef1222c6f1506a779f6276d05cef8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/e2e-test-utils/src/testsuite/actions/fork.rs:168-190 | crates/e2e-test-utils/src/testsuite/actions/reorg.rs:99-120 \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":"crates/e2e-test-utils/src/testsuite/actions/fork.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"baab13ecb02f85c0d2e1098d113740961420e5793ed6e2d1246ecc87337e5412"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/e2e-test-utils/src/testsuite/actions/mod.rs:216-231 | crates/e2e-test-utils/src/testsuite/actions/node_ops.rs:151-167 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/e2e-test-utils/src/testsuite/actions/mod.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3404e3756eae2f257257ae7750b767ab5233b2b9469caace26e1ecd9a683dea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/transaction-pool/src/test_utils/mock.rs:526-539 | crates/transaction-pool/src/test_utils/mock.rs:542-555 \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":"crates/transaction-pool/src/test_utils/mock.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c4e5770955a19690faeb6187c88bfce1f6142f35d578950caa2df5dae05581"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/storage/provider/src/test_utils/mock.rs:739-750 | crates/storage/provider/src/test_utils/mock.rs:755-771 \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":"crates/storage/provider/src/test_utils/mock.rs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"452fbf8ff3594dbf4f6a59d2ffe17c3ce7d87415f329a37c51980c794006ee2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/storage/provider/src/test_utils/mock.rs:606-614 | crates/storage/provider/src/test_utils/mock.rs:976-987 \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":"crates/storage/provider/src/test_utils/mock.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5d0e884e358652ffb832d8fd2c1e48d18c3a730f59e4d7d03af4c803ffd9a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 15\u002B corresponding lines): crates/transaction-pool/src/test_utils/mock.rs:302-316 | crates/transaction-pool/src/test_utils/mock.rs:319-334 | crates/transaction-pool/src/test_utils/mock.rs:337-353 | crates/transaction-pool/src/test_utils/mock.rs:356-373 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 15 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":"crates/transaction-pool/src/test_utils/mock.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae8b6e3bd40eb503f910b6f3f3e023321486b9c7ce5f6e34a848cb78ff76023"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/net/p2p/src/test_utils/bodies.rs:51-58 | crates/net/p2p/src/test_utils/receipts.rs:41-48 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/p2p/src/test_utils/bodies.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d599258459c22f90ada931aad126ed4f4642ffce995dfed14a3e20a99a2170"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/trie/trie/src/test_utils.rs:14-21 | crates/trie/trie/src/test_utils.rs:35-43 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/trie/src/test_utils.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"460b72f0beb3c5e9bf67a704b50cf9da7416a29e62967bd35d4bda655d0093b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/trie/trie/src/test_utils.rs:230-244 | crates/trie/trie/src/test_utils.rs:250-267 \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":"crates/trie/trie/src/test_utils.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"be2febe7ec10e1b447d5989f94d119267c6a66eaf8a910b8196d8ac1d0698f48"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/net/p2p/src/test_utils/full_block.rs:161-175 | crates/net/p2p/src/test_utils/full_block.rs:190-196 \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":"crates/net/p2p/src/test_utils/full_block.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"406d72f657e83a6fec5c614de3c6114485f0a81d0e1d955d86aeee0c2af6c674"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/stages/stages/src/test_utils/test_db.rs:158-166 | crates/stages/stages/src/test_utils/test_db.rs:178-187 \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":"crates/stages/stages/src/test_utils/test_db.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"b12c3a7903f61af1cafecf4c8f825540c3f589a3b3e097c55831049043160d1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/transaction-pool/src/test_utils/mock.rs:503-514 | crates/transaction-pool/src/test_utils/mock.rs:902-910 \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":"crates/transaction-pool/src/test_utils/mock.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccdcbd79d843c1f67ee72e870ada678963f89879a1d3e5dce2c70f2c776f8267"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/e2e-test-utils/src/network.rs:43-56 | crates/net/network/src/test_utils/testnet.rs:626-637 \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":"crates/e2e-test-utils/src/network.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7938a00c4078de703920b6210af8d3a168c762fdffda11c1248480416adfb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/e2e-test-utils/src/testsuite/actions/node_ops.rs:72-96 | crates/e2e-test-utils/src/testsuite/actions/node_ops.rs:276-300 \u2014 both copies are in the same file, so extract the block 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":"crates/e2e-test-utils/src/testsuite/actions/node_ops.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5158977291e1da23a9f8fdae1689915ccaf1f73e6844d923e4578a299e4fd73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): crates/storage/provider/src/test_utils/blocks.rs:329-343 | crates/storage/provider/src/test_utils/blocks.rs:412-426 | crates/storage/provider/src/test_utils/blocks.rs:492-506 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/storage/provider/src/test_utils/blocks.rs:329\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":"crates/storage/provider/src/test_utils/blocks.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"291d74ab28a2eff4083ea2b37bdaca9fc803d80da3f7e4e66017d0b5e48c5a6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): crates/storage/provider/src/test_utils/blocks.rs:263-275 | crates/storage/provider/src/test_utils/blocks.rs:326-338 | crates/storage/provider/src/test_utils/blocks.rs:409-421 | crates/storage/provider/src/test_utils/blocks.rs:489-501 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/storage/provider/src/test_utils/blocks.rs:263\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":"crates/storage/provider/src/test_utils/blocks.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf0eba86e859376c6bd908d3c73c4d43b9367bc45b5db3eeabe864291724207"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 4): crates/storage/provider/src/test_utils/blocks.rs:281-291 | crates/storage/provider/src/test_utils/blocks.rs:340-349 | crates/storage/provider/src/test_utils/blocks.rs:423-432 | crates/storage/provider/src/test_utils/blocks.rs:503-512 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/storage/provider/src/test_utils/blocks.rs:281\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":"crates/storage/provider/src/test_utils/blocks.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f77909cea2c96986dcc723073cad368b0b24a80e733bd930464eaefdd96bc97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): crates/storage/provider/src/test_utils/blocks.rs:209-217 | crates/storage/provider/src/test_utils/blocks.rs:263-271 | crates/storage/provider/src/test_utils/blocks.rs:326-334 | crates/storage/provider/src/test_utils/blocks.rs:409-417 | crates/storage/provider/src/test_utils/blocks.rs:489-497 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/storage/provider/src/test_utils/blocks.rs:209\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/storage/provider/src/test_utils/blocks.rs:273\u0060 calls \u0060clone\u0060, \u0060extend\u0060 and \u0060crates/storage/provider/src/test_utils/blocks.rs:219\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":"crates/storage/provider/src/test_utils/blocks.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"65dbd220d16c0fb245b3f360a3b6de3e42d9a2356c6ed1745ef2ef92ec836892"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/e2e-test-utils/src/testsuite/actions/produce_blocks.rs:768-776 | crates/e2e-test-utils/src/testsuite/actions/produce_blocks.rs:1087-1095 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/e2e-test-utils/src/testsuite/actions/produce_blocks.rs:768\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":"crates/e2e-test-utils/src/testsuite/actions/produce_blocks.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"e357410c73bf2b376beafb623bd19cd564c22427cdfe1d4e2f89bb62131072aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/storage/provider/src/test_utils/blocks.rs:299-307 | crates/storage/provider/src/test_utils/blocks.rs:440-449 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/storage/provider/src/test_utils/blocks.rs:299\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/test_utils/blocks.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb741baaa2ecbb3f331b6443d19594fdd22f7bf3af685afd95a025caf7b894a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/e2e-test-utils/src/testsuite/actions/produce_blocks.rs:386-393 | crates/e2e-test-utils/src/testsuite/actions/produce_blocks.rs:418-425 \u2014 both copies are in the same file, so extract the block 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":"crates/e2e-test-utils/src/testsuite/actions/produce_blocks.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72a06a67a54d952e3c4ce7e7a904be187bc2b83bb37955942cf2b5722e9e3ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/net/p2p/src/test_utils/bodies.rs:52-58 | crates/net/p2p/src/test_utils/receipts.rs:42-48 \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":"crates/net/p2p/src/test_utils/bodies.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1118c9b49ca0910325ec5614afbcecf6af6bee1f338b7c809ac2ec9b84a0c3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/storage/provider/src/test_utils/blocks.rs:223-228 | crates/storage/provider/src/test_utils/blocks.rs:279-285 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/storage/provider/src/test_utils/blocks.rs:223\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":"crates/storage/provider/src/test_utils/blocks.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"e83844eddf0f5ae7b217e723c8cedf3c22f028af7128a2c32ba1d5f292c2aa28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/e2e-test-utils/src/testsuite/actions/produce_blocks.rs:106-116 | crates/e2e-test-utils/src/testsuite/actions/produce_blocks.rs:134-144 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/e2e-test-utils/src/testsuite/actions/produce_blocks.rs:106\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":"crates/e2e-test-utils/src/testsuite/actions/produce_blocks.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb0fe29a99c766cf66d978871b0eb2718f7a4b7c2a68b4e90802d542e11ecdcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/cli/commands/src/test_vectors/compact.rs:150-157 | crates/cli/commands/src/test_vectors/tables.rs:27-34 \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":"crates/cli/commands/src/test_vectors/compact.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"d693e2db24d4ff4f134eef086d3c63973bf1e4fe331f6b3dd03b19997c0dced7"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project reth-cli-commands: reth-cli-commands has instability 0.98 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fcd5cc3ae9f3928ebecabc12d0b95421590fd32938e17ea6fc20df058c46ccdc"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project reth-engine-tree: reth-engine-tree has instability 0.90 with 3 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0954af137a04721f06b5fb0da797513d84df8413751ed49c66370840ff8a6e88"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project reth-engine-util: reth-engine-util has instability 0.89 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"68b11b2b8a01879d9ff9fca182dab960b17a00d5daf9957a67355afc3c37d02f"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project reth-ethereum-cli: reth-ethereum-cli has instability 0.81 with 3 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0eaa7217682c39bc2c87779a5a92cdd74ac976ee19b78201b6f9134f844720bd"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project reth-ethereum-payload-builder: reth-ethereum-payload-builder has instability 0.88 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"31cee558b4e0dadee1dd159b18e4c9b520812e8872551aec9e6c7aaa45e51c84"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project reth-invalid-block-hooks: reth-invalid-block-hooks has instability 0.88 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"50a820d0856baf0f04885ce28d9a17dad23868fb54ec26139dc5845ee9f8fc9b"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project reth-network: reth-network has instability 0.81 with 6 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ebdf83408a3ab7da22dd7fd96b690ec8d48f192e76f32c77e6feb923e4fc5f6a"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project reth-node-builder: reth-node-builder has instability 0.88 with 6 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"394a9d4011d183e80e6dc2eb4491b73bcc4a325fc41e2f7af6f1668f5f8d95dd"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project reth-node-ethereum: reth-node-ethereum has instability 0.89 with 4 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9d9c987bde42e50f99ca3de0ae79bd8e25324ed728748b8820e5bba8f785b375"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project reth-rpc: reth-rpc has instability 0.84 with 5 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d9dc7373c76ddfe9be2981aa5dd13baa2b50370e04619770812c11177c99f3df"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project reth-rpc-builder: reth-rpc-builder has instability 0.85 with 4 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ac87b51b8a1d3693f6fe62b22564ab6f4f9841566e6f8d4fe7facbe00881108d"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project reth-snap-sync: reth-snap-sync has instability 0.92 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c9941eab0c4639ce7d1d3168c68d26dc2836aafb5e1919d6a1beebe1628920ce"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project reth-stages: reth-stages has instability 0.84 with 5 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7ea9829273464f6661efae50200a80f752fa51063bb64e0e52617782fc478136"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project reth-storage-overlay: reth-storage-overlay has instability 0.81 with 3 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a0f6ed1a6a7e40e3faae98a4210cc9c3047a2483343a92fec7c9a07dd39b1496"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: reth-db-models: reth-db-models: 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":"2feb7348090ac27b0820eaf7e1c652fc9301e1f2062a4dd7a49b8eabe8be5ca3"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: reth-lru: reth-lru: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 6 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a0b72dda3214949bd510d72a8d0a77a1e90cbd71dbac8a15263fbeddeea7ff37"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: reth-metrics: reth-metrics: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 28 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7431aa9f71e7f21fda9681fd64ab7bec9f58a64dd52784ed29b169654d2d098f"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: reth-net-banlist: reth-net-banlist: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"90b5db9d399f275d8cf6274e6312354761c5c135a023eb0333f185d9ad844aec"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: reth-net-nat: reth-net-nat: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"68bc82ffe89985262a3c263449dc6a7112338ff5b0e250d4961193be7c3e34e4"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: reth-network-peers: reth-network-peers: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 17 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0ada5b24764dff6e7ad77d8574a5449cdacad109ae2507ba0ec42fc2fd0fb727"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: reth-prune-types: reth-prune-types: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 17 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4ed83810acad5d64e889c4aa73e5b8d5e4cecba60c655c4bd05d41484ab826fd"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: reth-tokio-util: reth-tokio-util: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 9 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"57aba99614a604473bdf5f89807e5ad068427196e5778076b2183096055c61ed"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: reth-stages-types: reth-stages-types: abstractness 0.00, instability 0.06, distance 0.94 \u2014 zone of pain \u2014 concrete and depended on by 16 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"06b605f78a0a960b6465630c60d83c0ca2bb1d69cdc5f3e0568f1457f304a74a"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: reth-tasks: reth-tasks: abstractness 0.03, instability 0.03, distance 0.94 \u2014 zone of pain \u2014 concrete and depended on by 29 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"674a27793bee0f13fc45168e9c0d553a9448c3b06055a4804a3c2a4d4b1248f5"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: reth-static-file-types: reth-static-file-types: abstractness 0.00, instability 0.08, distance 0.92 \u2014 zone of pain \u2014 concrete and depended on by 11 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0e9189860ece817f238fda8defe31d2b0285637f120c6d508f87edb7e6f482e8"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: reth-storage-errors: reth-storage-errors: abstractness 0.00, instability 0.11, distance 0.89 \u2014 zone of pain \u2014 concrete and depended on by 17 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"94ccf4c818de5796fdd5d82dd6c7d11cc9a2ddee26bc498a4674fa53f44cdd11"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: reth-execution-errors: reth-execution-errors: abstractness 0.00, instability 0.11, distance 0.89 \u2014 zone of pain \u2014 concrete and depended on by 8 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"da989d09db2078b4a26d02e2c5749df9addd27109e8b3ad371a4ce0043179ea3"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: reth-era: reth-era: abstractness 0.15, instability 0.00, distance 0.85 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"aafe5d6c4f81b127f51275cc790de98d904cd9cae8fae9f44078071cbbb6de81"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: reth-execution-types: reth-execution-types: abstractness 0.08, instability 0.10, distance 0.82 \u2014 zone of pain \u2014 concrete and depended on by 19 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9c654e9bfcd0df34dfb67e40335e9d296667f723ab7c881a492cbeaed26d812d"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: reth-cli-runner: reth-cli-runner: abstractness 0.00, instability 0.20, distance 0.80 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d928e337faf6fd214927f4269adf1b8d4f8ebf99174bf0e02c2be52811d1de32"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: reth-etl: reth-etl: abstractness 0.00, instability 0.20, distance 0.80 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"678660331366da88a6b87bc7443eec7b8059917d4fe88985b535bb43524503c9"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: reth-ecies: reth-ecies: abstractness 0.00, instability 0.25, distance 0.75 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c48f01dfcf8ebd609f0df062d75d6adc79527bf1f0379acdeac9afd2a020799e"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: reth-ethereum-forks: reth-ethereum-forks: abstractness 0.25, instability 0.00, distance 0.75 \u2014 zone of pain \u2014 concrete and depended on by 10 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f910185af87967a30853222cd7910d923a435941b3713803424bf6996c64fce4"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: reth-cli-util: reth-cli-util: abstractness 0.00, instability 0.29, distance 0.71 \u2014 zone of pain \u2014 concrete and depended on by 5 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"67d84a1edea761d556815837d949939d4fb4faada435c6ade471415b4c99300b"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: reth-network-types: reth-network-types: abstractness 0.00, instability 0.29, distance 0.71 \u2014 zone of pain \u2014 concrete and depended on by 5 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e4213d9e06d8bb011e044acb2cba350e89c9d3342bfff8ac14ecec5634569bd5"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: reth-tracing: reth-tracing: abstractness 0.13, instability 0.17, distance 0.71 \u2014 zone of pain \u2014 concrete and depended on by 5 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c52b40dad64c0347ffd31b8423149cd243edb59e0b8cfedae2328f3e33b4a366"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PeersConfig (LCOM4 14): PeersConfig\u0027s methods fall into 14 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 14 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":"crates/net/network-types/src/peers/config.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b199c36f267c5971089d762d10a540022f7d67d46f6eaea1e99713f74638c3"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DefaultTraceValues (LCOM4 10): DefaultTraceValues\u0027s methods fall into 10 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 10 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/core/src/args/trace.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb733bdc885c2b03760de00e4c8c6a2b0c36b114349da9e8c3197ad624f1d145"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: RayonConfig (LCOM4 9): RayonConfig\u0027s methods fall into 9 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 9 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tasks/src/runtime.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6de24ba9b0c055f792de71d2f966df642a0ffdaccc01b75f199625f7cb3e87"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: StreamBackfillJob (LCOM4 5): StreamBackfillJob\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/exex/exex/src/backfill/stream.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e2df3ac878b3abe3f9eca90ae319a9b24d61c33ca97ecdd0bb87d11695d616"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: RpcBlockchainProvider (LCOM4 5): RpcBlockchainProvider\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/rpc-provider/src/lib.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e7fe64fbe554b296f5af2522a85b83540954ece0a203e2730b8bc68ba53a967"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: EthEvmConfig (LCOM4 4): EthEvmConfig\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":"crates/ethereum/evm/src/lib.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa82b06560c7c24fe74fc3cbe7182b080151d7658fead4d75ab6347f7964d82a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: RlpxSatelliteStream (LCOM4 4): RlpxSatelliteStream\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":"crates/net/eth-wire/src/multiplex.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"0735f7699e050cc97a9cebfb5a3d9bbcf0126f6b9e66cfd182c339936532c2e4"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: P2PStream (LCOM4 4): P2PStream\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":"crates/net/eth-wire/src/p2pstream.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"093ef350c2179483ab4c73e85487305a51cc9b1351150f82155e47563b73369f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ValidationApi (LCOM4 4): ValidationApi\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":"crates/rpc/rpc/src/validation.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"02cd0f96bedd63860e2e96309c9a366ed49a2c0749608177d0ecf6f014e902b0"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: EthStateCacheService (LCOM4 4): EthStateCacheService\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":"crates/rpc/rpc-eth-types/src/cache/mod.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"7021856cb25ca6a814b4a9fba20dd706ae0311ca6924dbcf7e6ec0ead1d2335f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: TestStage (LCOM4 4): TestStage\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":"crates/stages/api/src/test_utils.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b50a998940c484b53cad32eb4c07de7f8535689dc93c2d912d1ac30e459623"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Zstd (LCOM4 4): Zstd\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":"crates/storage/nippy-jar/src/compression/zstd.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"72a38172655e115b56eda0f93c20b573597eb7eab12d7cbe26cb94196b5d4ce2"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: test-fuzz: \u0060test-fuzz\u0060 7.3.0 is published on crates.io under \u0060AGPL-3.0 WITH mif-exception\u0060, which this policy bans, and it is in the SHIPPED closure of this repository\u0027s Cargo.lock \u2014 so it is compiled by everything that builds this repository, not just by its test harness. The expression was read as SPDX, not as text: an \u0060OR\u0060 is a choice and is only charged when every branch is banned, while an \u0060AND\u0060 binds you to both operands and is charged when either is. Replace the crate, or record an accepted exception."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"099e5bc6d1b361c309df5e9176181bf27feb3eb44aa464a698d6c71c721bf6bb"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: gmp-mpfr-sys: \u0060gmp-mpfr-sys\u0060 1.7.1 is published on crates.io under \u0060LGPL-3.0\u002B\u0060, which this policy bans, and it is in the SHIPPED closure of this repository\u0027s Cargo.lock \u2014 so it is compiled by everything that builds this repository, not just by its test harness. The expression was read as SPDX, not as text: an \u0060OR\u0060 is a choice and is only charged when every branch is banned, while an \u0060AND\u0060 binds you to both operands and is charged when either is. Replace the crate, or record an accepted exception. \u2605 The licence that makes this row is LGPL-3.0, and unmodified use is often permitted: the LGPL lets your code use an UNMODIFIED copy of the library that stays a separately installed package (its own entry in node_modules, site-packages or the gem path, which a user can replace) without your code coming under the LGPL. What it then asks is that you pass on its licence and notices and let users swap in their own build of it (LGPL-3.0 section 4). Modifying it, copying its code into yours, or merging it into one bundled or statically linked artifact is where the obligations grow, and this policy cannot see which you do \u2014 that is why it denies LGPL-3.0 by default. If you use it unmodified and separately installed, allow it in your repository\u0027s licence policy rather than replacing it: add \u0060LGPL-3.0-only\u0060 / \u0060LGPL-3.0-or-later\u0060 to the allow-list of the licence check your CI runs (\u0060license-checker --onlyAllow\u0060, the \u0060allow-licenses\u0060 input of GitHub\u0027s dependency-review-action, \u0060[licenses] allow\u0060 in cargo-deny\u0027s deny.toml), record why in the same change, and hide this row on the findings page with that reason. This scan\u0027s banned set is not read from that file, so the row stays until it is hidden."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3b1a0d137394b0193c11e08bd20fecabf08420c2040683de712adfe797f7716f"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: test-fuzz-internal: \u0060test-fuzz-internal\u0060 7.3.0 is published on crates.io under \u0060AGPL-3.0 WITH mif-exception\u0060, which this policy bans, and it is in the SHIPPED closure of this repository\u0027s Cargo.lock \u2014 so it is compiled by everything that builds this repository, not just by its test harness. The expression was read as SPDX, not as text: an \u0060OR\u0060 is a choice and is only charged when every branch is banned, while an \u0060AND\u0060 binds you to both operands and is charged when either is. Replace the crate, or record an accepted exception."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"47d86ff7109e8c891b0d29d986de40eba9a056f9b61d166eb7302d5c4527b105"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: test-fuzz-macro: \u0060test-fuzz-macro\u0060 7.3.0 is published on crates.io under \u0060AGPL-3.0 WITH mif-exception\u0060, which this policy bans, and it is in the SHIPPED closure of this repository\u0027s Cargo.lock \u2014 so it is compiled by everything that builds this repository, not just by its test harness. The expression was read as SPDX, not as text: an \u0060OR\u0060 is a choice and is only charged when every branch is banned, while an \u0060AND\u0060 binds you to both operands and is charged when either is. Replace the crate, or record an accepted exception."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d4c67b1deb3d307f30be307c38b2ae814e58019d98b06dc68a4c98201a88aa1b"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: test-fuzz-runtime: \u0060test-fuzz-runtime\u0060 7.3.0 is published on crates.io under \u0060AGPL-3.0 WITH mif-exception\u0060, which this policy bans, and it is in the SHIPPED closure of this repository\u0027s Cargo.lock \u2014 so it is compiled by everything that builds this repository, not just by its test harness. The expression was read as SPDX, not as text: an \u0060OR\u0060 is a choice and is only charged when every branch is banned, while an \u0060AND\u0060 binds you to both operands and is charged when either is. Replace the crate, or record an accepted exception."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1f30418800e8c1577226bd337427ee3c55af56e215940d54f3476ad1c21e308a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/storage/provider/src/providers/database/provider.rs: crates/storage/provider/src/providers/database/provider.rs changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in DatabaseProvider::save_blocks_inner at line 574. 10 of those changes were fix/bug commits, and the other 23 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/storage/provider/src/providers/database/provider.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/database/provider.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"3590f38f04f90094652a9c08d4b2c3c05ece9e9cd7847de2e98902e101bb6150"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/tree/src/tree/mod.rs: crates/engine/tree/src/tree/mod.rs changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in EngineApiTreeHandler::on_engine_message at line 655. 16 of those changes were fix/bug commits, and the other 18 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/engine/tree/src/tree/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/tree/src/tree/mod.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"9514bbbebeaa790d8763a2e7d1d6454688bb1f80b93cbdd8cf9a8e71138fd6e8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/tree/src/tree/payload_validator.rs: crates/engine/tree/src/tree/payload_validator.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in BasicEngineValidator::validate_block_with_state at line 470. 9 of those changes were fix/bug commits, and the other 16 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/engine/tree/src/tree/payload_validator.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/tree/src/tree/payload_validator.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"d92d7b53666654bd0f148b48377f8f142cf1847ae85484c3fe4f3920b8b580c7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ethereum/node/src/engine_ssz_proxy.rs: crates/ethereum/node/src/engine_ssz_proxy.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in reth_node_ethereum::engine_ssz_proxy::handle_engine_ssz_request at line 563. 2 of those changes were fix/bug commits, and the other 11 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/ethereum/node/src/engine_ssz_proxy.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ethereum/node/src/engine_ssz_proxy.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb1d77d1abe690571cb00d90025b3f383d00f366037b2d83b14533d6c4a294c3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rpc/rpc-eth-api/src/helpers/call.rs: crates/rpc/rpc-eth-api/src/helpers/call.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in EthCall::simulate_v1 at line 67. 12 of those changes were fix/bug commits, and the other 12 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/rpc/rpc-eth-api/src/helpers/call.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc-eth-api/src/helpers/call.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f004ec12f28b73c208c4bb3c62254ec30118c2a57b29ac4bf245cc96e535cf9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/trie/sparse/src/arena/mod.rs: crates/trie/sparse/src/arena/mod.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in ArenaParallelSparseTrie::update_cached_rlp at line 1030. 5 of those changes were fix/bug commits, and the other 11 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/trie/sparse/src/arena/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/sparse/src/arena/mod.rs"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9151088b6a3ea3e0c5f60ab79c1fab1ed4306256cbc5155a309b4289db8e36a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/storage/storage-overlay/src/manager.rs: crates/storage/storage-overlay/src/manager.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in OverlayManager::get_or_compute_overlay at line 551. 9 of those changes were fix/bug commits, and the other 16 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/storage/storage-overlay/src/manager.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/storage-overlay/src/manager.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"730b39dda69090aeef6ae0a402f8e77381287a9687830775774ed3e1cbddd62d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/tree/src/tree/payload_processor/prewarm.rs: crates/engine/tree/src/tree/payload_processor/prewarm.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in PrewarmCacheTask::transact_worker at line 325. 5 of those changes were fix/bug commits, and the other 17 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/engine/tree/src/tree/payload_processor/prewarm.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/tree/src/tree/payload_processor/prewarm.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"7baf9fec4a9fd4e492d4190fadf4fc465d3fb15faa39a2b132a8d186726f584d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/transaction-pool/src/validate/eth.rs: crates/transaction-pool/src/validate/eth.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in EthTransactionValidator::validate_stateless at line 457. 6 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/transaction-pool/src/validate/eth.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/validate/eth.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b91a48421bf8cdb4b057ecb4f951fa4ab48735a3d5a0c175fa2f4463081564"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rpc/rpc-eth-types/src/cache/mod.rs: crates/rpc/rpc-eth-types/src/cache/mod.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in EthStateCacheService::poll at line 558. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/rpc/rpc-eth-types/src/cache/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc-eth-types/src/cache/mod.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"c100765606b8a06686419cf477f70298b0be30215353517d10c3e6b7ec63c87d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rpc/rpc/src/eth/filter.rs: crates/rpc/rpc/src/eth/filter.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in EthFilterInner::logs_for_filter at line 480. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/rpc/rpc/src/eth/filter.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc/src/eth/filter.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"3067fcf6733ecb4b6afbd84f401c800574ecfb976f1991551b1a2e4ea5e0cdc6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/net/network/src/transactions/mod.rs: crates/net/network/src/transactions/mod.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in TransactionsManager::import_transactions at line 1347. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/net/network/src/transactions/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/transactions/mod.rs"},"region":{"startLine":1347}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0615d698c7e32a02131c5601971389af2b0abd4460bda4e05e87a1c2564ac2f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/transaction-pool/src/maintain.rs: crates/transaction-pool/src/maintain.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in reth_transaction_pool::maintain::maintain_transaction_pool at line 125. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/transaction-pool/src/maintain.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/maintain.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"2913351a5c36431aa02972b092d5951843c4c43da82397a1ad1c6668d6634939"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/stages/stages/src/stages/execution/mod.rs: crates/stages/stages/src/stages/execution/mod.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in ExecutionStage::execute at line 293. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/stages/stages/src/stages/execution/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stages/stages/src/stages/execution/mod.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"097860631757f4e144dfe9a0c64494e956361411e042f07f876ff384d2a0254c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/transaction-pool/src/pool/txpool.rs: crates/transaction-pool/src/pool/txpool.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in AllTransactions::insert_tx at line 2119. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/transaction-pool/src/pool/txpool.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/pool/txpool.rs"},"region":{"startLine":2119}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa13e64ac6db95f719ae51a877a8424e3ab05eb7060de408a15c931b570dcc6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cli/commands/src/download/mod.rs: crates/cli/commands/src/download/mod.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in DownloadCommand::resolve_components at line 715. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/cli/commands/src/download/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/download/mod.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4eb2273aba51a5b1cafb8b970bf2d4755b804c629a483df072dd2dcafec0086"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/snap-sync/src/bootstrap.rs: crates/snap-sync/src/bootstrap.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in SnapBootstrap::run at line 127. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/snap-sync/src/bootstrap.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/snap-sync/src/bootstrap.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d32925c654819d337a9129e9ca7f0826eaed8d1f45ba94a5d132ab8ed003dfb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/trie/common/src/proofs.rs: crates/trie/common/src/proofs.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in DecodedMultiProofV2::from_witness_with at line 547. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/trie/common/src/proofs.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/common/src/proofs.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"b189aecf9747944e53d80f43fa270432da103844945a4b29837c6e3ee37c8572"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rpc/rpc-eth-types/src/simulate.rs: crates/rpc/rpc-eth-types/src/simulate.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in reth_rpc_eth_types::simulate::execute_transactions at line 317. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/rpc/rpc-eth-types/src/simulate.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc-eth-types/src/simulate.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"5860e28a3f676538fa1c48eb705e96ea14d0664c7de0f2a7bab525ce7ea71b8f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/node/builder/src/launch/common.rs: crates/node/builder/src/launch/common.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in LaunchContextWith::create_provider_factory_with_recovery at line 499. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/node/builder/src/launch/common.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/builder/src/launch/common.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb7fe1dae1d7cd8936cf2d681e18447c1a91a6734cf494ae2013682ebd12ee3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rpc/rpc/src/eth/sim_bundle.rs: crates/rpc/rpc/src/eth/sim_bundle.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in EthSimBundle::sim_bundle_inner 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/rpc/rpc/src/eth/sim_bundle.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc/src/eth/sim_bundle.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b5141924c4470211af3e3d790748656dab26abdc8328bc0f807ee3a9abc2313"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rpc/rpc-eth-api/src/helpers/pending_block.rs: crates/rpc/rpc-eth-api/src/helpers/pending_block.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in LoadPendingBlock::build_block at line 275. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/rpc/rpc-eth-api/src/helpers/pending_block.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc-eth-api/src/helpers/pending_block.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"702f975f91ce4ba01f28e36d696ec7a0a267e740dc71396401510ddb475f702f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rpc/rpc/src/eth/bundle.rs: crates/rpc/rpc/src/eth/bundle.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in EthBundle::call_bundle at line 59. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/rpc/rpc/src/eth/bundle.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc/src/eth/bundle.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"04273666375382bc06c5117cfb7351abf776379421216b59876d937bdf68cf6d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/storage/provider/src/providers/static_file/manager.rs: crates/storage/provider/src/providers/static_file/manager.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in StaticFileProvider::ensure_invariants at line 1735. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/storage/provider/src/providers/static_file/manager.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/static_file/manager.rs"},"region":{"startLine":1735}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a049f61b3f35eeb507de35eada547c9ec88022b664a0d3daa0457ba9530d4bd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rpc/rpc-eth-api/src/helpers/estimate.rs: crates/rpc/rpc-eth-api/src/helpers/estimate.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in EstimateCall::estimate_gas_with at line 44. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/rpc/rpc-eth-api/src/helpers/estimate.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc-eth-api/src/helpers/estimate.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df6d25aa3301eb72dd433ee7fe3a53e4a379104ba8834a4f8a9110ad6374118"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/net/discv4/src/lib.rs: crates/net/discv4/src/lib.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in Discv4Service::on_ping at line 1197. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/net/discv4/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/discv4/src/lib.rs"},"region":{"startLine":1197}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fcc801e8992237a78e12e52020153b0f4b38f0543a00c4493f60a5e64836208"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/net/network/src/transactions/fetcher.rs: crates/net/network/src/transactions/fetcher.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in TransactionFetcher::on_announcement at line 196. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/net/network/src/transactions/fetcher.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/transactions/fetcher.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee98d64ab358a5058267d287f2d6e7abcc8766e566afbe327ba1b4474a202728"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/storage/db/src/implementation/mdbx/mod.rs: crates/storage/db/src/implementation/mdbx/mod.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in DatabaseEnv::open at line 453. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/storage/db/src/implementation/mdbx/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/db/src/implementation/mdbx/mod.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"853bca555a8fcba290f8d847dfd7b4acf5eb85b2de0e2e11bc903e38b063d657"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/trie/trie/src/witness.rs: crates/trie/trie/src/witness.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in TrieWitness::compute at line 88. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/trie/trie/src/witness.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/trie/src/witness.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7fe23f391ebc278f0f134182db7a3697ea2a0c4584470bdec4e807adf3fcea9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rpc/jsonrpsee/server/src/transport/ws.rs: crates/rpc/jsonrpsee/server/src/transport/ws.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in jsonrpsee_server::transport::ws::background_task 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/rpc/jsonrpsee/server/src/transport/ws.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/jsonrpsee/server/src/transport/ws.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44cfcf9c9b5a129901aaa4afab91dd77bd466614a8c7b997e660445033f5cb2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cli/commands/src/re_execute.rs: crates/cli/commands/src/re_execute.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in Command::execute at line 78. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/cli/commands/src/re_execute.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/re_execute.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba7286e05be6c8507a97f5eb6ab30ec1bab6f2590e465fb10cb93783d48c86d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ethereum/payload/src/lib.rs: crates/ethereum/payload/src/lib.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in reth_ethereum_payload_builder::default_ethereum_payload at line 148. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/ethereum/payload/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ethereum/payload/src/lib.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b81539ba7e643ff591aacc327731648cc43955bc388421461e607c6f040a300"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rpc/rpc-eth-types/src/cache/db.rs: crates/rpc/rpc-eth-types/src/cache/db.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in reth_rpc_eth_types::cache::db::apply_state_overrides_with_state at line 98. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/rpc/rpc-eth-types/src/cache/db.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc-eth-types/src/cache/db.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"697b17c737bbda1c665aee322b5ffec2d1dc18055822d721b0bc53f9312b089c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/node/builder/src/launch/engine.rs: crates/node/builder/src/launch/engine.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in EngineNodeLauncher::launch_node at line 84. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/node/builder/src/launch/engine.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/builder/src/launch/engine.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d82384f71c95ec5bd5d5d8f6f8d82b7d104a57ba74eca9f4edcf4cf75268cd8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rpc/ipc/src/stream_codec.rs: crates/rpc/ipc/src/stream_codec.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in StreamCodec::decode at line 146. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/rpc/ipc/src/stream_codec.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/ipc/src/stream_codec.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0561b45bcd54fc04972007c4bb7e7d47ff8ed49cd7686ea9910fe6695ee512"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/net/eth-wire/src/p2pstream.rs: crates/net/eth-wire/src/p2pstream.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in P2PStream::poll_next at line 584. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/net/eth-wire/src/p2pstream.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/eth-wire/src/p2pstream.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"0987d2059ee9fda3d7285bd75594ed281c643b90893210729c7cd1239c5081dd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/net/network/src/session/mod.rs: crates/net/network/src/session/mod.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in SessionManager::poll_pending_session_event at line 589. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/net/network/src/session/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/session/mod.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ee622c4ddf9247d94f7a69d9ae4e3ee1d82c7a9fb7c378564e6a8222827910"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/net/dns/src/lib.rs: crates/net/dns/src/lib.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in DnsDiscoveryService::poll at line 314. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/net/dns/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/dns/src/lib.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"34627a1a222c8d78e369c773eeada698374cbadbc7d15a93a2c62d7a5f97b8cb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/trie/trie/src/trie.rs: crates/trie/trie/src/trie.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in StateRoot::calculate at line 174. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/trie/trie/src/trie.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/trie/src/trie.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4dec37b7d04650ffa57abe9d602f456c0410d034e550532ea5d9e15af4a109d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/stages/stages/src/stages/hashing_account.rs: crates/stages/stages/src/stages/hashing_account.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in AccountHashingStage::execute at line 161. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/stages/stages/src/stages/hashing_account.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stages/stages/src/stages/hashing_account.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"4693d97378e7474b1761d61121646ac4ddf81f66265fd2781437c86a3ffa831b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/net/network/src/discovery.rs: crates/net/network/src/discovery.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in Discovery::new at line 90. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/net/network/src/discovery.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/discovery.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b0df8eb871494085be9904b54e23fc5bbaf1bf1d27a65cd782011b1e659a18"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/tree/src/tree/payload_processor/reuse.rs: crates/engine/tree/src/tree/payload_processor/reuse.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in PrewarmedTx::validate at line 285. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/engine/tree/src/tree/payload_processor/reuse.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/tree/src/tree/payload_processor/reuse.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c05b91c25cc805899985320a4ba53f3e435ad95e1f05e08388476b58a6077b7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ethereum/consensus/src/validation.rs: crates/ethereum/consensus/src/validation.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in reth_ethereum_consensus::validation::validate_block_post_execution_with_bal_hashes at line 48. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/ethereum/consensus/src/validation.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ethereum/consensus/src/validation.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"497f9429ab598cb0e93cca6cba5c82d5e61d6f6274395484a7a7aa9163da7ae6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/rpc/rpc/src/eth/pubsub.rs: crates/rpc/rpc/src/eth/pubsub.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in EthPubSub::handle_accepted at line 97. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/rpc/rpc/src/eth/pubsub.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc/src/eth/pubsub.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb0c79c975ab08593bcfa03256b4fc9804980f690b97e068da44fca274a0cce"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/stages/stages/src/stages/hashing_storage.rs: crates/stages/stages/src/stages/hashing_storage.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in StorageHashingStage::execute at line 90. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/stages/stages/src/stages/hashing_storage.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stages/stages/src/stages/hashing_storage.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"667700482f5e62bb7b9d90ebcae994f0663ef9c04aabf20b7b36512fe049ef38"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/trie/sparse/src/arena/cursor.rs: crates/trie/sparse/src/arena/cursor.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ArenaCursor::seek at line 363. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/trie/sparse/src/arena/cursor.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/sparse/src/arena/cursor.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"65fa977a57bfca1b603854797334afdefa1e9a519773feeb7fc32b06f79369e5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/rpc/ipc/src/server/mod.rs: crates/rpc/ipc/src/server/mod.rs changed 10 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is IpcServer::start_inner at line 117), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(rpc): don\u0027t panic on oversized sub ack (#28485)\u201D; \u201Cfix(ipc): enforce socket permissions (#28326)\u201D; \u201Cfix: avoid Etherscan and IPC payload dumps (#27990)\u201D; \u201Cfix(ipc): stop buffering oversized requests (#27864)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/rpc/ipc/src/server/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/ipc/src/server/mod.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"f914345757cd1097b2255d7e3c0bebc3c64525b863c1219eadc2de01a34e7361"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/storage/provider/src/bal/rocksdb.rs: crates/storage/provider/src/bal/rocksdb.rs changed 9 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is RocksDBBalStore::read_one_by_hash at line 126), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: cap BAL retention at bodies prune distance (#28529)\u201D; \u201Crevert: \u0022fix(storage): revert BAL store activation\u0022 (#27472)\u201D; \u201Cfix(storage): open legacy BAL databases read-only (#27471)\u201D; \u201Cfix(storage): revert BAL store activation (#27470)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/storage/provider/src/bal/rocksdb.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/bal/rocksdb.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"581527c621c8f76c89a8a8317c109d4bec44d48acb9bb54c4963164a25931353"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/cli/commands/src/common.rs: crates/cli/commands/src/common.rs changed 7 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is EnvironmentArgs::init at line 98), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(stages): resume interrupted pipeline unwinds (#28067)\u201D; \u201Cfix(cli): error on unloadable config and missing enode key (#27982)\u201D; \u201Crevert: \u0022fix(storage): revert BAL store activation\u0022 (#27472)\u201D; \u201Cfix(storage): revert BAL store activation (#27470)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/cli/commands/src/common.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/common.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eadacce1de731fcda93e3e8be32b0778573634b08b8fa5b5c7de80a31057433"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/cli/commands/src/download/manifest.rs: crates/cli/commands/src/download/manifest.rs changed 8 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is reth_cli_commands::download::manifest::generate_manifest at line 710), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(cli): reject zero blocks per archive (#28328)\u201D; \u201Cfix(cli): reject download output paths that escape the datadir (#28247)\u201D; \u201Cfix: align snapshot block counts and downloads (#28058)\u201D; \u201Cfix(cli): validate manifest input and fail closed on symlink check (#27983)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/cli/commands/src/download/manifest.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/download/manifest.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ba863085361d36c134f5e56135f8d818775e988c32861a742340af671ed3a8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/net/network/src/swarm.rs: crates/net/network/src/swarm.rs changed 5 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is Swarm::on_state_action at line 249), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(net): pick the receipts request by negotiated eth version (#28441)\u201D; \u201Cfix(net): reject banned and untrusted inbound peers before session activation (#28360)\u201D; \u201Cfix(net): give pending sessions and the listener a turn under load (#28332)\u201D; \u201Cfix(net): invalidate superseded dial events (#27950)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/net/network/src/swarm.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/swarm.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd44a6e7389238347c5925244cb3a0d8ad26fe6c5772d65e45f48213d692f337"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/storage/provider/src/providers/static_file/mod.rs: crates/storage/provider/src/providers/static_file/mod.rs changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is LoadedJar::new at line 36), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(provider): defer static file truncation on reorg (#28370)\u201D; \u201Cfix(storage): propagate static-file read errors (#28064)\u201D; \u201Cfix(nippy-jar): end last value at its offset (#27678)\u201D; \u201Cchore: fix latest nightly clippy lints (#26985)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/storage/provider/src/providers/static_file/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/static_file/mod.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"2603f8da4375f8607ed84414dcc035978343707b9c74713dfec04b6992a7f73a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/storage/nippy-jar/src/lib.rs: crates/storage/nippy-jar/src/lib.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is NippyJar::delete at line 255), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(nippy-jar): truncate the offsets file when creating a jar (#28468)\u201D; \u201Cfix(storage): resume interrupted jar initialization (#28405)\u201D; \u201Cfix(nippy-jar): end last value at its offset (#27678)\u201D; \u201Cfix(nippy-jar): handle uncommitted rows in prune_rows (#27719)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/storage/nippy-jar/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/nippy-jar/src/lib.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1df2f8f0d013aa997d9d36a32f86b151b859bba95e0b9c3f6cc9db0dbb4e438"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/storage/provider/src/providers/static_file/writer.rs: crates/storage/provider/src/providers/static_file/writer.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is StaticFileProviderRW::heal_changeset_sidecar at line 392), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(static-file): reopen the file holding last_block after truncating rows (#28466)\u201D; \u201Cfix(storage): resume interrupted jar initialization (#28405)\u201D; \u201Cfix(provider): defer static file truncation on reorg (#28370)\u201D; \u201Cfix(static-file): name segment and anchor in unwind error (#28164)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/storage/provider/src/providers/static_file/writer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/static_file/writer.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"e288bbfb208705c9c7ea8ce2a7f6c934c1dfda273242e8c74b0fa18e53c022cb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/storage/nippy-jar/src/writer.rs: crates/storage/nippy-jar/src/writer.rs changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is NippyJarWriter::prune_rows_deferred at line 282), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(nippy-jar): truncate the offsets file when creating a jar (#28468)\u201D; \u201Cfix(storage): resume interrupted jar initialization (#28405)\u201D; \u201Cfix(provider): defer static file truncation on reorg (#28370)\u201D; \u201Cfix(nippy-jar): handle uncommitted rows in prune_rows (#27719)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/storage/nippy-jar/src/writer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/nippy-jar/src/writer.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b66cd81ddde4c589cbe430ac90f0a564d127fe625af1e859e8d786d88fb4caf"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/storage/provider/src/providers/rocksdb/metrics.rs: crates/storage/provider/src/providers/rocksdb/metrics.rs changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is RocksDBOperation::as_str at line 79), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Crevert: \u0022fix(storage): revert BAL store activation\u0022 (#27472)\u201D; \u201Cfix(storage): revert BAL store activation (#27470)\u201D; \u201Crevert: restore RocksDB BAL storage (#26789)\u201D; \u201Crevert: \u0022feat(storage): re-enable RocksDB BAL storage\u0022 (#26788)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/storage/provider/src/providers/rocksdb/metrics.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/rocksdb/metrics.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"687746a42af5841075ba293bcdcf3e06edc11e0e523197096cd5c6afce4326ee"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/node/core/src/args/txpool.rs: crates/node/core/src/args/txpool.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 1 (its worst body is DefaultTxPoolValues::try_init at line 66), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(txpool): apply min priority fee to legacy txs (#27720)\u201D; \u201Cfix(txpool): reject transactions below tracked nonce (#26981)\u201D; \u201Cfix(txpool): reject zero transaction batch size (#26806)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/node/core/src/args/txpool.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/core/src/args/txpool.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"b68462ca3f200668b9456a66a0a31d25c840f5c8125938b78e83406c7b13d00b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/storage/libmdbx-rs/src/txn_manager.rs: crates/storage/libmdbx-rs/src/txn_manager.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is ReadTransactions::start_monitor at line 278), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(libmdbx): avoid lock inversion in read tx timeout monitor (#28254)\u201D; \u201Cfix(mdbx): stop read monitor on environment drop (#28404)\u201D; \u201Ctest: replace fixed sleeps in libmdbx and session tests (#27960)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/storage/libmdbx-rs/src/txn_manager.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/libmdbx-rs/src/txn_manager.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f6c7b3d7a39490c28ef4b8e566d03d27a1a59ea0f5c2c599a7183c0d0dc5107"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/cli/commands/src/download/extract.rs: crates/cli/commands/src/download/extract.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is reth_cli_commands::download::extract::streaming_download_and_extract at line 379), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(cli): reject download output paths that escape the datadir (#28247)\u201D; \u201Cfix(cli): validate manifest input and fail closed on symlink check (#27983)\u201D; \u201Cfix(download): restore custom static files directory handling (#27065)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/cli/commands/src/download/extract.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/download/extract.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"83405363304ff51927087aee9fef1a4ea4b7d1ff98eb5cbc83c28ce6d0be226a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/transaction-pool/src/validate/task.rs: crates/transaction-pool/src/validate/task.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is ValidationTask::run at line 59), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(txpool): remove validation producer mutex (#27361)\u201D; \u201Cfix(txpool): scale validation channel capacity with worker count (#27362)\u201D; \u201Cfix(transaction-pool): release receiver lock before validating (#27015)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/transaction-pool/src/validate/task.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/validate/task.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7de3ab82831308a2c32f8d41e1ebfe9a47111763f01c248bab8e0cc88b48de"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/cli/commands/src/download/source.rs: crates/cli/commands/src/download/source.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is reth_cli_commands::download::source::resolve_manifest_base_url at line 206), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(cli): strip control characters from the snapshot listing (#28470)\u201D; \u201Cfix(cli): reject zero blocks per archive (#28328)\u201D; \u201Cfix(cli): reject download output paths that escape the datadir (#28247)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/cli/commands/src/download/source.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/download/source.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"266be8d5f3a9982bfbfa7440de8d3e38e502d244f5b6682f9cc7610b83087c0a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/engine/primitives/src/error.rs: crates/engine/primitives/src/error.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is InsertBlockErrorKind::ensure_validation_error at line 114), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(engine): report payload job start errors (#28015)\u201D; \u201Cfix(engine): return invalid for undecodable block access lists (#26889)\u201D; \u201Cfix(engine): separate malformed input from fatal errors (#26829)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/engine/primitives/src/error.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/primitives/src/error.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59fd868274654a415c2013c1b09beff9ea7ba0f391952331f73ba953bebe6de"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/consensus/consensus/src/lib.rs: crates/consensus/consensus/src/lib.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is HeaderValidator::validate_header_range at line 174), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(consensus): reject pre-Shanghai body withdrawals (#27715)\u201D; \u201Cfix(engine): classify invalid BAL input as malformed (#26844)\u201D; \u201Cfix(engine): separate malformed input from fatal errors (#26829)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/consensus/consensus/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/consensus/consensus/src/lib.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d84c1758e63b7482bdd5e63578763c2676c0a77743be49990482db402181b49"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/rpc/rpc-engine-api/src/error.rs: crates/rpc/rpc-engine-api/src/error.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is ErrorObject::from at line 114), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(engine): enforce Amsterdam engine method timeframe (#28399)\u201D; \u201Cfix(engine): report payload job start errors (#28015)\u201D; \u201Cfix(engine): return invalid for undecodable block access lists (#26889)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/rpc/rpc-engine-api/src/error.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc-engine-api/src/error.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ba6bd1a3ef87ef67849a513bb826ea987242e734987e9040403f17a9a77d0b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/engine/primitives/src/message.rs: crates/engine/primitives/src/message.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is BeaconEngineMessage::fmt at line 302), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(engine): report payload job start errors (#28015)\u201D; \u201Cfix(tracing): preserve context across engine and worker tasks (#27529)\u201D; \u201Cfix(engine): avoid cache handoff misses and locked drops (#27230)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/engine/primitives/src/message.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/primitives/src/message.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"25db93374669899802173169a3cee075ec964ec06cbb681174c4cb546110299a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/engine/tree/src/tree/error.rs: crates/engine/tree/src/tree/error.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is InsertBlockErrorKind::from at line 115), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(engine): flush state before backfill sync (#26911)\u201D; \u201Cfix(engine): classify invalid BAL input as malformed (#26844)\u201D; \u201Cfix(engine): separate malformed input from fatal errors (#26829)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 18:22:16 \u002B01:00\u0027 --until=\u00272026-11-14 18:22:16 \u002B01:00\u0027 --full-history --no-merges -- crates/engine/tree/src/tree/error.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/tree/src/tree/error.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1ee92e26bb448686b9e34e32c08ec626ab221685479b658956d29562abe81c"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 9 significant file(s) lose their only recent owner: crates/ethereum/node/src/snap/mod.rs, crates/era-utils/src/export/mod.rs, crates/net/downloaders/src/snap/bytecode.rs, crates/snap-sync/src/session.rs, crates/era/src/era/file.rs, crates/net/downloaders/src/snap/request.rs, crates/cli/commands/src/export_era.rs, crates/net/downloaders/src/snap/test_utils.rs (\u002B1 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a85769f830f24240af835b28b451720decd6ae401ecd3b1881ea1fdbbffb4b2c"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 5 significant file(s) lose their only recent owner: crates/rpc/rpc/src/validation/blob_cache.rs, crates/e2e-test-utils/src/wait.rs, crates/rpc/rpc-builder/src/rate_limiter.rs, crates/rpc/rpc-api/src/trace.rs, crates/storage/db/src/static_file/cursor.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c0a161d7f3cbdebca7622828bd31e87a123648d0d48daac9afc4c576ab70b004"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #3: If anonymized user #3 becomes unavailable, 3 significant file(s) lose their only recent owner: crates/trie/trie/src/proof_v2/node.rs, crates/storage/provider/src/providers/database/save_blocks.rs, crates/dst/src/lib.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"04bb80a21910a68d6ba9b6173e88e7d4f82beaaf86888736aebdba07b00cbe11"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 3 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (21 single-owned of 828 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 828 of the 1135 production source files in this repository met that bar). They are anonymized user #4 (2 file(s)), anonymized user #5 (1 file(s)), anonymized user #6 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: crates/net/network-api/src/custody.rs, crates/payload/validator/src/amsterdam.rs, crates/storage/db/src/implementation/mdbx/value_prefetch.rs, crates/era-downloader/src/stream.rs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(rand): update ::random calls after rand_09 migration \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/testing-utils/src/generators.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce904e337c77c3b60c16b00b2755192ba01ccbee1ec928c13083059259b86e7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(onbjerg): Proper EIP-7685 request support"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/testing-utils/src/generators.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"458bedce0dab875a9c1d078c045471ecb4c0e7cc97f3b154c38b2be096974231"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support disable_peer_tx_broadcast flag \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/bsc-p2p/src/upgrade_status.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"801dd232ffb4bd97110c7fe2b43d1cfcbaf6c4650c3e5a4ceab47190784114af"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(alexey): assert against real state root calculation updates \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/sparse/src/state.rs"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"168f0bfd2255bbc640a933fa399a61c50d7f03b46ca16344e42e7d05e654464e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Initialize this with the actual mask once sparse sidecars are supported. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/traits.rs"},"region":{"startLine":1657}}}],"partialFingerprints":{"codehealthFindingId/v1":"58caac5c0fc59f63b935bf292b9173d25ef78f6463de858b1f6d3ed5b913971c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Initialize this with the actual mask once sparse sidecars are supported. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/blobstore/mod.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f47f6b51db4f7582285733d51553c9fcd91c4e6d77340be9e04ad421d469cf2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this could be u64: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/pool/blob.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd8cbca6cff2557b3e05445621e1f0cf47ef7ca83b418a85a393523d16523fda"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Inlined diagram due to a bug in aquamarine library, should become an include when it\u0027s \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/pool/txpool.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"27259f06577cfb794fb7483c9ee60f497c98c377d1a5db0033a066f380662682"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Inlined diagram due to a bug in aquamarine library, should become an include when it\u0027s \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/manager.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"236b5f25fa8a7dba6e98ccf7bc6b7d12febe96212adee55f7f57ee2d8cd50e17"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: reserved_cpu_cores is currently ignored because subtracting from thread pool \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tasks/src/runtime.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5fb85f32af9fdaf23b97a31631634482857589b8a4a914ead82d2f4acdd9056"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: reserved_cpu_cores is currently ignored because subtracting from thread pool \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/builder/src/launch/common.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf7c680b3c12b64486ddd371581c42c023fc1736ee226a941d95ea3e50d1050c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Ideally storage should hold its own copy of chain spec \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/storage-api/src/chain.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0820277632915aa6cf9c2ee138341b108218e6f8f04d86c011a68d5aa423d3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support writing receipts to static files with log filter pruning enabled \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/either_writer.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"003c124f5925e931294ead0ffa6dd2a982f827a619135cf0ea910733bfc6a540"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo(joshie) add canonical_hashes_range below after changing its interface into range \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/blockchain_provider.rs"},"region":{"startLine":2876}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a150aeb7b55118456159cf894057d46840be28f97872433028221dfb3b3126"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: withdrawals, requests, ommers \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/blockchain_provider.rs"},"region":{"startLine":3249}}}],"partialFingerprints":{"codehealthFindingId/v1":"45fb049a63b1999b89e6aaf8a53919cb55577b6ed8105aa5e3bf60ee1147fece"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: should we only apply this for the RPCs that are listed in EIP-1898?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/consistent.rs"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"512c7f1e0ea9951e99fce11e8ad4babbb5e732a220d1d846cb822f03c72d516a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// [\u0060StaticFileJarProvider\u0060]. TODO(joshie): we should check the size and pop N if there\u0027s too \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/static_file/manager.rs"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0fcd706f739cf5c5c8566f89dc34bcbf6b4977e4589a5edb1d0823904fcebfc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(joshie): is_block_meta \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/static_file/manager.rs"},"region":{"startLine":1826}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b81d32900c2215f1183cac73178fd738c1bdc1b7edfc1a561a4cdf009d6daf0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mediocregopher): This could be rewritten in a way which doesn\u0027t \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/database/provider.rs"},"region":{"startLine":2770}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ceed84ea59475d5830f534f922c412565aef82fb1e256aa0c2e4a6729c5d20b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add a \u0060take\u0060 method that removes and returns the items instead of doing this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/database/provider.rs"},"region":{"startLine":3118}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f64d1dc2f451e378cfc39d79337f706b876ca390b579a3cbdde55100d338f68"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(joshie): this fn should be moved to \u0060UnifiedStorageWriter\u0060 eventually \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/database/provider.rs"},"region":{"startLine":3868}}}],"partialFingerprints":{"codehealthFindingId/v1":"07bf53280d9f8061640d0fe2a10f713abe26bf7aba809ee3ee942d39f431f36e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: ideally we could truncate until the last offset of the last column of the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/nippy-jar/src/consistency.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"93f30238ab4690a3a003099337ea997c9673dd2c1902194f2fab3aca39399ff9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(joshie): ensure consistency on unexpected shutdown \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/nippy-jar/src/lib.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"875d27cf3bb072efb4fec71ac81f2d818f181abe4d5df37e0f325f97d341ccd4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Make the mock database table-aware by properly utilizing \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/db-api/src/mock.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3fb2788be476a0219d6879d969efb3a640216ed951b1cc9e666f575b929d008"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //! TODO(onbjerg): Find appropriate format for this... \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/db-api/src/tables/mod.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"5999dd607289b93ae9d238c0ddb4b068dc9cf091562a8cd795c920f25b012162"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(alexey): track in metrics \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/static-file/static-file/src/static_file_producer.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"586eede3fc2eec8e0c3ab3b12fe482b9de754f40caa5c21fddc5a7dfe619ded5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(alexey): track in metrics \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/static-file/static-file/src/static_file_producer.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c70555943c3068af29f95d95f4acc51ef4bf58505f603f6557b7eb24b560b8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(alexey): add a merkle checkpoint. Currently it\u0027s hard because [\u0060MerkleCheckpoint\u0060] \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stages/types/src/checkpoints.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"32fcdec87ffdf97d4a461db4ca4e5c772cc64db9823aea3f04d73479ffbe5fb1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(alexey): ideally, we want to measure Bodies stage progress in bytes, but it\u0027s hard to know \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stages/stages/src/stages/bodies.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c20f3b99138b8e6a4caafda678355f4e8aa869f87511db165ca4bcb1148099"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Rewrite this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stages/stages/src/stages/hashing_account.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7dfa071e0da307c3c1495c1da43b041ad9c34f8f7264a76bfaa57945538b0db"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: automate the process outlined below so the user can just send in a debugging package \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stages/stages/src/stages/merkle.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c87b76d85b11bc7bc0bb03659dc45e028882a98170727a04f937eb98b14c031"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: make struct for holding incremental settings, for code reuse between \u0060Execution\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stages/stages/src/stages/merkle.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e75d9931f0ced425c8cd380fab7a499bb43348a91f84a04b364f6a7befd3eb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: when senders are fully pruned, batch recover in execution stage instead of per-tx \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stages/stages/src/stages/sender_recovery.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5ffc50f0d3d15c6b3b8866f43bf63dd8b9fc46e6bbaeb0f9396acc4b31d117"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: When handling errors, we do not commit the database transaction. This \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stages/api/src/pipeline/mod.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a487dfe4dc5fe250d3efeb317f6aa76acca3cccef7c1088a2a996f1b99bf0d7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Todo: Validate IL and populate \u0060inclusion_list_satisfied\u0060 properly and test. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc-engine-api/src/engine_api.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf13463403142b8c56ece57d824e18aa3990bab3e0accac96e1ea3f608ea722f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: perform structural validation of the inclusion list transactions and populate \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc-engine-api/src/engine_api.rs"},"region":{"startLine":1465}}}],"partialFingerprints":{"codehealthFindingId/v1":"40aa5bebcbc862a118213fe4881e15afb156590897ac58b9b83cc70e5d2aa3e2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: optimize \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prune/prune/src/segments/user/history.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3b6b0b4a1714cd8b27c081084b7f00ce9e261149c438a6f696828875d07560"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO add more network config methods here \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/core/src/cli/config.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ab82663383971dbb72dd030e0cd0acabf2a7635287de3018fd7fcd13abc393"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: convert this into two futures, one which is a headers range \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/p2p/src/full_block.rs"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"b810d82807a00c0202b71efd6fd63436da6c08312887e3dbddd36a783e368ee7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: current value is a hint, needs to be set properly \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network-types/src/peers/reputation.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17074aa57d11e3467f7a9cd6cf84a74f3a0964cf3f1c3230dc749f3c06773aa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: handle error case with $target and $label \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/budget.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"f710c0d1a1ab0cc0539d263a02eeeb163bc132b920c10dfc6a2fff009e71c069"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this can be attached to the response in error case \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/fetch/mod.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f0bb5dc7281c1e2133d824b79f37d733ef8218aab5d5c39206b9112ccf43b8b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO: add test for eth70 here once we have fully support it \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/eth-wire/src/hello.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8df8f3a6e4572d70b6559672820958a11856453762c3594bea529d2ce769114"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: create a custom type similar to EncryptedMessage for parsing, checking MACs, and \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/ecies/src/algorithm.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca8ff8ce1c5a9699bdc5c5d4756b2358d9f4e44f875eaf3a90c0a2934c1ef87"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Malicious peers often return a single block even if it does not exceed the soft \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/downloaders/src/bodies/request.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"283659ce6fd36762ee859f9622ce03bb5bce2dd44d29ca7a8d596e355dd49728"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(0xurb) - add \u0060node\u0060 after abstractions \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/exex/exex/src/dyn_context.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ef8e452ca4a347e2def2c41caf03bff659c1cd587789a43e6b9bc801684894"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: /// HACK: for some reason, this duplicated AT is the only way to enforce the inner Recovered: \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/engine.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"373ad93ce91649aa05c16085663e6af12c5841a5c8c6f1e05b1c7722f9e41978"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(dani): use either \u0060\u0026mut Inspector\u0060 or \u0060clear_inspector_as\u0060. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/execute.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"b029690d6c6e10f2083932db8e90957af7852824f1230698a121c707e09c4394"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO add closure to modify network \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ethereum/node/src/node.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4ec107e578c0d3fdffd511753a91a90784190c98ad80c4fe999bdbdfc81684"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO add closure to modify consensus \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ethereum/node/src/node.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b193df815d698d15b882e19337a056c9be3fc65d9c8d8987c9aecd3d61e394d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO: change once \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/era-downloader/tests/it/stream.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"df70a51808c1c26bb3ba2c0861b007362d54f9c8c48b5880de16ac46f2a0b600"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: to replace with internal era files hosting url \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/era/tests/it/main.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7bd69cd6ca4a7f64ea6a4958678235e1ab11198fc4cde1309c88b7a71f005ee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// from \u003Chttps://hoodi.era.nimbus.team/\u003E //TODO: to replace with internal era files hosting url"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/era/tests/it/main.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35be8eaf70a08ce6a39e9b28ca1486ba907ff6881df28dde982c356d25bd424"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO: to replace with internal era files hosting url \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/era/tests/it/main.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3315b95dea614b672d565a506fbee1d360e649528c702e6211498491832c2ad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// from \u003Chttps://mainnet.era.nimbus.team/\u003E //TODO: to replace with internal era files hosting url"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/era/tests/it/main.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b7196124fa569fbeb56f0c9d52b1270c9cf8bec59ae314ddb3267b1eed03f1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This is an expensive blocking operation, ideally it\u0027s spawned as a task \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/util/src/reorg.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"b88dae8675f1ba2f4b486d0dbac7935ecc208272f2aedaf2dca5f4470492d5b5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mattsse): find a more appropriate name for this variant, consider phasing it out. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/tree/src/engine.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef21f8cbe9576d7e55d1bbeb76505457dc6fb53bdd1ab2e61f3023e9c5a8d15"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: extend with stronger gating before enabling on mainnet: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/tree/src/tree/payload_validator.rs"},"region":{"startLine":1088}}}],"partialFingerprints":{"codehealthFindingId/v1":"5262fad5ac5f0e7bcc7acbb623f8b1d0bc25f165509a180a9ab1c0305affb668"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(alexey): unify with \u0060DebugApi::debug_execution_witness\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/invalid-block-hooks/src/witness.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"19dff814dfbe27192230156e9ba3b82f12dfcf18b561cf1aa6f6317225eeac8e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: refactor once we have actions to generate payload attributes. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/e2e-test-utils/tests/e2e-testsuite/main.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa80cad81aa08c1a3d9f9f772ee658dd38f25092ee00d08bd028354e236c0f2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: refactor once we have actions to generate payload attributes. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/e2e-test-utils/src/testsuite/actions/produce_blocks.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"460120968bee1e985a8fec3132acfbb896d6a850ecfb72d6a2db11b7e587221d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Pass beacon_engine_handle once import system supports generic types \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/e2e-test-utils/src/testsuite/setup.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"383613b5a9a14056a5c92ad8ec96f784a691cb27c8c7a322787156879a943357"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: The pipeline should correctly configure the downloader on its own. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/import_core.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"676b74bfce59821b023f34aae60be7fee3709e34330ccee0d3f770349144fb74"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: The pipeline should correctly configure the downloader on its own. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/import_core.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"77814e0d337fa970c91d08ed2e8462c7b3e478d05b38aebb7b01ac582e06971d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We should consider allowing to run hooks at the end of the stage run, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/stage/run.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"440819058590fbb1d29954eb03ff9f7b6764432ff1eb6f8e51e7394f792a9085"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO optimize we can actually just get the entries we need for both these tables \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/stage/dump/hashing_storage.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"34eb0f3e4bee9264b228d18020b101093dfc04fcdfc79c64c0b060a1fe378679"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: should we fill with real parent_hash? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/init_state/without_evm.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a8591c1c0278060c57ad22f2504aceaa47e33a1f55cc326c2d6bebe92f8c35d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We\u0027ll need to add this on the DB trait. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/mod.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cbe841d690ed492db49062d3c13ee9c6e531447ca618be490686364844a64e8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This click event can be triggered outside of the list widget. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/tui.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ddd7060caf51dd4ce0b8823da086dbc6e03b59be2a6f247634e1b596ed2b5b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: do we even have? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/chainspec/src/spec.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a53afd49c2cf9a1c6fc04a35ab55874673c6c7b126eb33741536774bbdcc9dd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: remove when generic data prim integration complete \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/chain-state/src/lib.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"952e2d5f9a41ff0596a68d44d1a0763eddf6167f026d3ba9e84e85fffec07fe2"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060testing/runner/src/main.rs\u0060 makes this repository a deployable product (line 1)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/runner/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d011cbb7895f37a95b5421c3cfae9ff667494404886567e3858bb18fcd3c1a04"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Copy all cargo docs to the dist/docs folder\u0022 repeats the code it sits on: 4 of its 5 words (copy, cargo, docs, dist) are already in \u0060console.log(\u0060Copying cargo docs to ${VOCS_DIST_PATH}...\u0060);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/vocs/scripts/inject-cargo-docs.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d3e0adee48e68ea3840adb0dc8c3a3a3c80e08a132b029c757c705805c106d"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 119 project(s) overshoot their size bounds, lowering Project Cohesion to 9.8/10. The most over is \u0060crates/transaction-pool\u0060 (24835 LoC, 129 module-visible types across 5 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cb09326cc3752ef6411e0785185cde9f89b811e4a52a21910a20fb73bcbaf5de"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0c1470a7fb816c4b69f87006c6c398cb9078f73983ef9050591e045e49021763"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8a2c69ec716938d1913a0da537627c42cfaad7346ab71d2c291bfde77132409e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"31ea55810d5ac9c56e4f9c3e350e4a7ab8f4bad81d582d0214899a25987767e1"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dce645d409b99f52b3960a5e6eac1feb51ccd17367e3a8e607f73b6076b24cf3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7e18526ef3a20492a1a1a2c3b1006124d345cd9c43394b91168140369877fd9d"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"86427dc8ef54a155326ff9fffd354098401ad98cfb9346a3c2bc0474742c9bb5"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"338407871e9c53d2625a5754ccc8f84f16e799149817c1d1e310aef9e6213485"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3d6571f292433665c9f5d1127c84aa42b2d5c2daac6e59cd6e4c6dd4c1113c38"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e05ed0dbafac5e9f79c79cf66815c295f97aaca108926f9d43f44b4a43e3579"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"afa188f65b7b2192493a817c766eea9257d0482ee529f0cbe8477e685e43ad3b"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6ee3ffccfe37c7cce57f8f42b1365dd85df245aae4aab45f02ce66e65b913888"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"07c23c9b4986d9e4a507705a4bad66ebe92568029b492652c158cbbabf5a5818"},"taxa":[{"id":"CWE-913","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aa275dcc581e31816223ff250817b0083925776ca9db8bc9a83879cc85b97f8d"},"properties":{"dependency":{"package":"derivative","version":"2.2.0","advisory":"RUSTSEC-2024-0388","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"728758c9d3428053e1082b5fb9832c05e2e04dab40233f2ffbfd7792b93201ec"},"properties":{"dependency":{"package":"libz-sys","version":"1.1.29","advisory":"RUSTSEC-2026-0418","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"45f6c0dd73434ccd86356af3cc9622ade7a0e177107528134623e6a917ba7888"},"properties":{"dependency":{"package":"quinn-proto","version":"0.11.18","advisory":"RUSTSEC-2026-0523","aliases":["[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0524"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"28f0bc6d34596072b24d37b19b745b7394ed4ce99a53e032439b262379e02dc1"},"properties":{"dependency":{"package":"quinn-udp","version":"0.5.15","advisory":"RUSTSEC-2026-0538","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9cf74773a6e34d2f2cd5f4cc024a1a57cb07e5917cf84c703df779cadb57013"},"properties":{"dependency":{"package":"rustix","version":"1.1.5","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9d7e2f5e4e133844171b9412d83e460349b527553e21e4eb5d4f1e038ed6831f"},"properties":{"dependency":{"package":"atomic-polyfill","version":"1.0.3","advisory":"RUSTSEC-2023-0089","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4975822701b3b96654c82dada9bad969e348a6adefa52cd3bba1b6cfd71c3bb7"},"properties":{"dependency":{"package":"bincode","version":"1.3.3","advisory":"RUSTSEC-2025-0141","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cc4db900d7247116e90ac1f55322889d7c04a2f09430308fea72e799e9229468"},"properties":{"dependency":{"package":"crypto-bigint","version":"0.5.5","advisory":"RUSTSEC-2026-0387","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5922a5beeab5ac077ffb485a783ad545036e79b56239f83da38f3fb84336b113"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"46f49615124997a47ae03424c2b2e05e8f53b2ec644cd091de0dc203d46f11ac"},"properties":{"dependency":{"package":"pin-utils","version":"0.1.0","advisory":"RUSTSEC-2026-0441","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d469c4cdd0b2892278c4ee90c01a5a8ea4872a98733c483777e04c904cfebdfc"},"properties":{"dependency":{"package":"proc-macro-error2","version":"2.0.1","advisory":"RUSTSEC-2026-0173","reachability":{"kind":"unknown"}}}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e0265aa7a96d095104aabbe7cab46d1a7b824cc7314c2677b3634508006366f2"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3305c43461a937ebabe34388f06777e82895c2ba016e3456ed2cc2769749e499"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fe2d688610b51e0a5a02c7c5dd1724a4986e40f2689fb84510e2ec0164c27d6a"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"14a1428660b6e8ce1db08fefc9ac971e232b8eaa79d679a42fdbf707dc5c0a4e"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"548f698ea1a7b384909b04e10aa1a5aa52900cb38da5d928c33202d1445b4f20"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"799e61fa4b2dfc15f03126718261e83ac92f2bd74cc38e03ef2e913395bcdbef"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a0d28e0beb60c8114834099f6b97d1150badf8aa4bca7f062dc7642ef2d77fd5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"def481761509b63721058f06b2bb87e37c8a2b862ff9d7cf843b67d16ff302ff"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-653","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"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":"7fa03ab392df3f46c8cd57658e3d2ee9e5edf31e613d392f40115f17270cbfb3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"968560ed4f4298f52bcdbb62d0e77933b07ffd41281b6a95644b4f0b195e5c12"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b31b5738186f667e7d844825cc24a3ee3fa652d4cc45219a3e432afd0de37804"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f394c8c1d77628936e3a6e128f4d541cff00fca1aea2ddc25dd3a14ddb4ffdd5"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-668","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4754d2fe3b1e0cac7aa2580fcd51167951112a9230dde2bfa9d48cd5a48aab66"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0938bbe5cd6e23116ba366ff76a1ef88bc9cbc9a86aa9d60a20bbc23b3eed000"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b2941817a58055f3472c2a7d4974d9729cb1598b2b506061ff83285a427c39cc"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ead93a8329db31a5fe6de3ce2c929066f4cfb8c8314fb094f6fab726ec7fb09b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5b37926105210ed3444d17d2f08f3025c9f97d4139ca31f0eb389e761f775d2c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f1d02ecbf3b99691347b566e35aa486e42713ce96de8b540eb6788ae1c25a825"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"af662b7a4dadc1baa2482521bf45e4ae5e4b9c5e7c7705e20096b7de0093da7d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"88203fb388c8020e1fa8b3173a000848fdb77bc230789555c6bdcd3e647d7ffe"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1c295272c5483de83f5c478b06d5e0ca6e32b8b65f27a9d6652cd40e94c0e0b5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1d28bbbaddd885d4f9d430af21629d4fdecec45484680318a6be87fbcd1508a1"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1f51a163f26d94ce6b6f473117dde579d091c8cbf9e59810475c94d9fc921120"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"657e49d103d3f348e7fac46b8e9445d56a7c87b4496b730737528f89a547194f"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"64dac839671ec037ebebb6ca7782ac01f549523e69d6098406718faf85e6e46f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 22 of 828 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 828 of the 1135 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 most significant first: crates/prune/prune/src/limiter.rs, crates/e2e-test-utils/src/testsuite/actions/node_ops.rs, crates/era-downloader/src/stream.rs, crates/e2e-test-utils/src/testsuite/actions/engine_api.rs, crates/node/ethstats/src/events.rs, crates/rpc/rpc-layer/src/auth_layer.rs, testing/testing-utils/src/genesis_allocator.rs, crates/rpc/rpc-api/src/anvil.rs (and 14 more). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prune/prune/src/limiter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f031c09476ce2d0320d1bcb10e81cf60a240f5c7def38c57bbad6de2e1917b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/e2e-test-utils/src/testsuite/actions/node_ops.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b7d27156558fc83c29bf60878e637a2a54de0c6ba5e2f175206a83656e395c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/era-downloader/src/stream.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ce7011aabda20d92bf53e2ccb6d864c6989d004bad3d138f085bbd08514968"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/e2e-test-utils/src/testsuite/actions/engine_api.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"262b43edba0b0071dcbdd09e1841253c16741874a251cc865a0933986e733fbf"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/ethstats/src/events.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de8923c32815f109fec5d74e05d73602894b628052be5677de05d02b71caec6"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc-layer/src/auth_layer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c68a7d105a23253cbc8a0180a2b4ed926a2bf991f120780492abaf718f0d303"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/testing-utils/src/genesis_allocator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfdbfebe58e4183edf99db1b465c352ce69df51822df40fcad9aad47b6f7b263"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc-api/src/anvil.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"433da5a432c4cacea880486686d500b725a822d38dcb21716c7cb2deae443694"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ethereum/hardforks/src/display.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f130360958137a0330821f93ab283bec879b9a78f333860bbd518406eb0284e0"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/discv5/src/metrics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff902500185d7ad0a365aad0a52e2a5a8597dd0e211c2ff5eb95ceb32ef6b18"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/util/src/parsers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"18b5a4840bbfdc9e74c45a1e0247b41a89a272c5c55bae9a168136d89cf7e397"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/payload/validator/src/cancun.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd31d6aaa983219ca9dbc1225fd9da7ae472f7ce5ac7a842c88230bb4d530af"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/payload/util/src/transaction.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"202ae86451c6cf91f6bf2b5690853b2e1ced13c565d4f2e0c0daffd37748db5d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tokio-util/src/event_sender.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec934bd97a4c9154870dc7142c52d3777ed2b7986c584cc2c4103f0f7e1112c6"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc-api/src/hardhat.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe886231144a62cb150075ecca8a6b27b53212ffafd528cd527f2e092c7a81af"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/launcher.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de38b6f0d222d09949c34a75b8dc20e454447e3c091bb288c6fd82fb9572c6c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ethereum/node/src/engine.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce697049bf8cd0f3fa8ec0288ba161598146213d0642aafff55ab7e023323465"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/tree/src/test_utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ef1e5f4604cc1f847e54124dd31e0bd8dcbbc937e58b1b2fc6f59010a36b2b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/session/types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc307a8438f6622bbdc9e958977875e80fbcd9702e248f9c32a00a3a9ece71c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network-api/src/test_utils/peers_manager.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d86c46e4b0265269fb482adfc1464def24b8c3c3ea9ed418fe92fb72e8a4146"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tokio-util/src/event_stream.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f002f51d8718ee203eec3ea38801ab35070aa87f8d7b0ebb260fd4e20a162956"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/ethstats/src/connection.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d3828bf89fd5917abe0a6ff14bdcd38c9730c92ac15d306e8f915dcb66cbaee"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: disk.rs \u2194 noop.rs: \u0060crates/transaction-pool/src/blobstore/disk.rs\u0060 and \u0060crates/transaction-pool/src/blobstore/noop.rs\u0060 change together 100% of the time (11 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are \u0060ea10653e\u0060 fix(net): decode wire bitvectors into typed blob cell masks (#27089); \u006071e5cc84\u0060 feat(txpool): track blob cell availability (#25463); \u0060d769d96f\u0060 feat(engine): add has blobs rpc (#25589) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/blobstore/disk.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06fd3574b4efdf498c8b79c4cabc4624363806da1ecb7c12733ac0a357a95f1"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mem.rs \u2194 noop.rs: \u0060crates/transaction-pool/src/blobstore/mem.rs\u0060 and \u0060crates/transaction-pool/src/blobstore/noop.rs\u0060 change together 100% of the time (11 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are \u0060ea10653e\u0060 fix(net): decode wire bitvectors into typed blob cell masks (#27089); \u006071e5cc84\u0060 feat(txpool): track blob cell availability (#25463); \u0060d769d96f\u0060 feat(engine): add has blobs rpc (#25589) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/blobstore/mem.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0777642480b8bb8a73e8362d52f3a2244228a123b32bb6dd6b742271cf92ee2f"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling clique: noop.rs, test_utils.rs, lib.rs: 3 files \u2014 \u0060crates/consensus/consensus/src/noop.rs\u0060, \u0060crates/consensus/consensus/src/test_utils.rs\u0060, \u0060crates/ethereum/consensus/src/lib.rs\u0060 \u2014 all change together with no explicit dependency: a fully-connected co-change clique, not 3 separate couplings. They share one concern (thin parallel siblings over a common abstraction), so extract the shared part into ONE unit and the whole clique\u0027s coupling clears at once \u2014 you do not need to break each pair individually."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/consensus/consensus/src/noop.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ccd64f3661abaf8546c5d8d201dd237614acbbd4d0445652aeaaea975710825"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: historical.rs \u2194 latest.rs: \u0060crates/storage/provider/src/providers/state/historical.rs\u0060 and \u0060crates/storage/provider/src/providers/state/latest.rs\u0060 change together 83% of the time (29 of the 35 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 29 shared commits counted here, the most recent 3 are \u0060c9cf89ff\u0060 feat(rpc): make V2 multiproofs the default (#26851); \u0060a05960ab\u0060 feat(stateless): make witness generation conform to the draft specs (\u2026; \u0060bab6c3fe\u0060 feat(trie): Use proof v2 in TrieWitness (#22922) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/state/historical.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5535271565c1fd61da2f2daa21fe82d0a07d3ced3c664c6362e6c2bfa1e70ab8"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: execution.rs \u2194 merkle.rs: \u0060crates/cli/commands/src/stage/dump/execution.rs\u0060 and \u0060crates/cli/commands/src/stage/dump/merkle.rs\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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u0060dc22ece4\u0060 fix(cli): use HeaderTy for stage dump headers (#23274); \u0060370a548f\u0060 refactor(db): derive Clone for DatabaseEnv (#21641); \u0060412f39e2\u0060 chore(consensus): Remove associated type \u0060Consensus::Error\u0060 (#20843) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/stage/dump/execution.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35083ae854616b288a68a3711cab82295f5f14f2ba8ffe86ef2968c855f266fd"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: mod.rs \u2192 test_utils.rs, engine_store.rs, input.rs: \u0060crates/engine/tree/src/tree/mod.rs\u0060 changes together with 3 other files \u2014 \u0060crates/engine/tree/src/test_utils.rs\u0060, \u0060crates/engine/util/src/engine_store.rs\u0060, \u0060crates/trie/common/src/input.rs\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":"crates/engine/tree/src/tree/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2faddc659a5bc8cb8b95bd8b7c7015b7fc115fdf7f42074b1cacd2d736ac8508"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: rpc_state_cache.rs \u2194 config.rs: \u0060crates/node/core/src/args/rpc_state_cache.rs\u0060 and \u0060crates/rpc/rpc-eth-types/src/cache/config.rs\u0060 change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060fa167700\u0060 feat(rpc): add cache byte limits and idle eviction (#27351); \u006018e6014a\u0060 feat(rpc): prewarm BAL cache from local replay (#24097); \u0060b77a6bfd\u0060 refactor(rpc): remove dead header cache (#26836) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/core/src/args/rpc_state_cache.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc08f9cbf0d91be132d08f8228f3d421a47a18925973ca0ccb138ac2e18b3c7"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: metrics.rs \u2192 common.rs, common.rs, rocksdb.rs: \u0060crates/storage/provider/src/providers/rocksdb/metrics.rs\u0060 changes together with 3 other files \u2014 \u0060crates/cli/commands/src/common.rs\u0060, \u0060crates/node/builder/src/launch/common.rs\u0060, \u0060crates/storage/provider/src/bal/rocksdb.rs\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":"crates/storage/provider/src/providers/rocksdb/metrics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0733aeab24cf55e210587e45af76824f47226206117c652ba4aa1cd66ab9d3bd"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: historical.rs \u2194 trie.rs: \u0060crates/storage/provider/src/providers/state/historical.rs\u0060 and \u0060crates/storage/storage-api/src/trie.rs\u0060 change together 67% of the time (18 of the 27 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 18 shared commits counted here, the most recent 3 are \u0060c9cf89ff\u0060 feat(rpc): make V2 multiproofs the default (#26851); \u0060a05960ab\u0060 feat(stateless): make witness generation conform to the draft specs (\u2026; \u0060fc7a3e5b\u0060 chore: use shorter map names (#14445) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/state/historical.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f7344adb54a84dbb144583bc60c786ae7cf94acbe363c40c8e5327ba506623"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: either.rs \u2194 noop.rs: \u0060crates/evm/evm/src/either.rs\u0060 and \u0060crates/evm/evm/src/noop.rs\u0060 change together 64% of the time (7 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u00604f73e1a4\u0060 chore: remove \u0060BatchExecutor\u0060 (#14453) (at that commit the files were still \u0060crates/evm/src/either.rs\u0060 and \u0060crates/evm/src/noop.rs\u0060); \u00605fcefcea\u0060 refactor: remove \u0060PruneModes\u0060 from batch executor (#14025) (at that commit the files were still \u0060crates/evm/src/either.rs\u0060 and \u0060crates/evm/src/noop.rs\u0060); \u0060af1eb610\u0060 feat(perf): integrate OnStateHook in executor (#11345) (at that commit the files were still \u0060crates/evm/src/either.rs\u0060 and \u0060crates/evm/src/noop.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/evm/evm/src/either.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c3894478bbb12e278b775d10836ec74adcb7c36a8698e785415ab8d58beb8a"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: db.rs \u2192 canonical.rs, historical.rs, latest.rs, mock.rs, trie.rs: \u0060crates/rpc/rpc-eth-types/src/cache/db.rs\u0060 changes together with 5 other files \u2014 \u0060crates/chain-state/src/in_memory/canonical.rs\u0060, \u0060crates/storage/provider/src/providers/state/historical.rs\u0060, \u0060crates/storage/provider/src/providers/state/latest.rs\u0060, \u0060crates/storage/provider/src/test_utils/mock.rs\u0060, \u0060crates/storage/storage-api/src/trie.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 5 separate couplings, not 5 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 5."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc-eth-types/src/cache/db.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1354db17dbe5b58718242fffdecbc28b3f8bfd49df7f131a742af6b07471985a"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mock.rs \u2194 noop.rs: \u0060crates/storage/provider/src/test_utils/mock.rs\u0060 and \u0060crates/storage/provider/src/test_utils/noop.rs\u0060 change together 62% of the time (23 of the 37 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 23 shared commits counted here, the most recent 3 are \u00607764b9a0\u0060 chore: add  \u0060OmmersProvider\u0060 trait (#13331); \u006062e2cbfe\u0060 chore: remove unused evm env provider fns (#13272); \u0060c9c6eb5a\u0060 chore: rm unused evm provider fn (#13184) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/test_utils/mock.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc1b996e0a88145897c1b82bce04165ed82258bc08d6dc87100b07076520b6d"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: latest.rs \u2194 mock.rs: \u0060crates/storage/provider/src/providers/state/latest.rs\u0060 and \u0060crates/storage/provider/src/test_utils/mock.rs\u0060 change together 60% of the time (21 of the 35 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 21 shared commits counted here, the most recent 3 are \u0060c9cf89ff\u0060 feat(rpc): make V2 multiproofs the default (#26851); \u0060a05960ab\u0060 feat(stateless): make witness generation conform to the draft specs (\u2026; \u006021cf573d\u0060 fix: move \u0060bytecode_by_hash\u0060 from \u0060StateProvider\u0060 to a dedicated \u0060Byt\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/state/latest.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c516044155fbb6cfc5bcce56bdfde337ce78cabb27550298f2bc16a1a68b40"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: index_storage_history.rs \u2194 provider.rs: \u0060crates/stages/stages/src/stages/index_storage_history.rs\u0060 and \u0060crates/storage/provider/src/providers/database/provider.rs\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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u00607744d20c\u0060 test(storage): remove redundant tests (#27829); \u0060effa0ab4\u0060 fix(provider): read changesets from static files during unwind (#21528); \u0060ab418642\u0060 fix(stages): commit RocksDB batches before flush and configure immedi\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stages/stages/src/stages/index_storage_history.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"075d77c59c704f670f57e26c9281399def00a1bb98ebc55eb478a4bb1796094e"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: cache.rs \u2194 storage.rs: \u0060crates/exex/exex/src/wal/cache.rs\u0060 and \u0060crates/exex/exex/src/wal/storage.rs\u0060 change together 58% of the time (7 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060e882d00f\u0060 feat(exex): WAL metrics (#11431); \u00609c041d25\u0060 fix(exex): set next file ID when creating WAL storage (#11372); \u0060bf679b43\u0060 feat(exex): finalize WAL below the given block (#11324) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/exex/exex/src/wal/cache.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07325c0e7dcd489110b136f847c1f87bef91e60ae2b3a6ad0a1b60e0ccf69b04"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: lib.rs \u2194 lib.rs: \u0060crates/ethereum/payload/src/lib.rs\u0060 and \u0060crates/payload/builder/src/lib.rs\u0060 change together 57% of the time (8 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u0060559b0b9f\u0060 refactor(payload): store recovered block in built payload (#24403); \u0060044db3ec\u0060 feat: implement try into v6 (#23497); \u0060ddc9375a\u0060 chore: remove executed_block from EthBuiltPayload (#14017) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ethereum/payload/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01abc717c86e605739e207850f3ca03f12f4b099461a5516b1c3141a50f168e"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: lib.rs \u2194 test_utils.rs: \u0060crates/ethereum/payload/src/lib.rs\u0060 and \u0060crates/payload/builder/src/test_utils.rs\u0060 change together 56% of the time (9 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u0060559b0b9f\u0060 refactor(payload): store recovered block in built payload (#24403); \u0060044db3ec\u0060 feat: implement try into v6 (#23497); \u0060ddc9375a\u0060 chore: remove executed_block from EthBuiltPayload (#14017) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ethereum/payload/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eccad703f5020b7841397676c8544f73f8fdde6f9800e9d6bfedc01389ebff30"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: noop.rs \u2194 trie.rs: \u0060crates/storage/provider/src/test_utils/noop.rs\u0060 and \u0060crates/storage/storage-api/src/trie.rs\u0060 change together 56% of the time (15 of the 27 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 15 shared commits counted here, the most recent 3 are \u0060a0f99df2\u0060 feat(trie): \u0060StorageRootProvider::storage_multiproof\u0060 (#12879); \u0060548f5b9c\u0060 feat(trie): expose storage proofs (#11550); \u006006dbd3a6\u0060 feat(trie): expose multiproof via \u0060StateProofProvider\u0060 (#10915) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/test_utils/noop.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba77064470f759c362491aa8f4b62ab527a6d1fae8f2a453b8fe025e8bd05dd4"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: canonical.rs \u2192 latest.rs, trie.rs, input.rs: \u0060crates/chain-state/src/in_memory/canonical.rs\u0060 changes together with 3 other files \u2014 \u0060crates/storage/provider/src/providers/state/latest.rs\u0060, \u0060crates/storage/storage-api/src/trie.rs\u0060, \u0060crates/trie/common/src/input.rs\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":"crates/chain-state/src/in_memory/canonical.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"749374be7ccfcaa9511b262019a5a36609e41b05a03bb5185a9de104c553ccaf"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: import_era.rs \u2194 lib.rs: \u0060crates/cli/commands/src/import_era.rs\u0060 and \u0060crates/era-utils/src/lib.rs\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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060e2563b7a\u0060 feat: add -\u0060-with-receipts\u0060 to \u0060import-era\u0060 to store receipts (#26436); \u0060535bf429\u0060 feat(era): extend import to era file (#25404); \u0060256ceb66\u0060 feat(cli): support ERE (.erae) files in import-era (#25122) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/import_era.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1831edde9a746ac93b59111c6c25a2ba27bfbaf776e8d6239de1c8589f3ddf"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: blockchain_provider.rs \u2194 noop.rs: \u0060crates/storage/provider/src/providers/blockchain_provider.rs\u0060 and \u0060crates/storage/storage-api/src/noop.rs\u0060 change together 51% of the time (23 of the 45 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 23 shared commits counted here, the most recent 3 are \u0060eb1214b5\u0060 perf: share pending block and receipts (#27427); \u00606165a999\u0060 refactor(provider): remove historical state conversion (#26904); \u00602125dc6b\u0060 refactor(storage): move OverlayStateProvider and let it use a Provide\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/blockchain_provider.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ec63e11aca61a3c8b14e85bcca0e8cabbfaf4a9e4d8a3a2e9d60d0cc0248e2"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mem.rs \u2194 noop.rs: \u0060crates/transaction-pool/src/blobstore/mem.rs\u0060 and \u0060crates/transaction-pool/src/noop.rs\u0060 change together 50% of the time (10 of the 20 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u0060ea10653e\u0060 fix(net): decode wire bitvectors into typed blob cell masks (#27089); \u006071e5cc84\u0060 feat(txpool): track blob cell availability (#25463); \u0060d769d96f\u0060 feat(engine): add has blobs rpc (#25589) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/blobstore/mem.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2894b7125d8a7c8cdedb0124f4be4b76aefec52cc9abe3aa3ecfe9be46589524"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: chain_info.rs \u2194 mod.rs: \u0060crates/chain-state/src/chain_info.rs\u0060 and \u0060crates/storage/provider/src/providers/mod.rs\u0060 change together 50% of the time (8 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u0060caac226c\u0060 chore: make CanonicalInMemoryState generic over sealed header and blo\u2026; \u00601ba631ba\u0060 feat: store safe block num as well (#11648); \u0060d9936a96\u0060 Use more appropriate names for forkchoice subscriptions (#10401) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/chain-state/src/chain_info.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d4927c5eaae323b026a2a6be3ef455491727867644dcf01490d294a11d45b8"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: manager.rs \u2194 cache.rs: \u0060crates/exex/exex/src/manager.rs\u0060 and \u0060crates/exex/exex/src/wal/cache.rs\u0060 change together 50% of the time (6 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060565fd4d1\u0060 chore(exex): emit warn log when WAL grows beyond a certain number of \u2026; \u0060e882d00f\u0060 feat(exex): WAL metrics (#11431); \u0060bf679b43\u0060 feat(exex): finalize WAL below the given block (#11324) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/exex/exex/src/manager.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"056f982fee6304fd5a29c9c104709f07da2e011f047f6456e75c8a3e976ac4ff"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: test_utils.rs \u2194 lib.rs: \u0060crates/ethereum/evm/src/test_utils.rs\u0060 and \u0060crates/evm/evm/src/lib.rs\u0060 change together 50% of the time (6 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u00600df9791b\u0060 chore: bump alloy-evm to 0.28.0 (#22636); \u00606a50aa3e\u0060 feat: make more EVM and RPC conversions fallible (#18685); \u0060f5c2502f\u0060 feat: delay block -\u003E payload conversions (#17681) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ethereum/evm/src/test_utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d44edc351cdce02ea952edf474719bb36e87ff527f7d9a895c5d5984a7dedd24"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: blockchain_provider.rs \u2194 changeset_cache.rs: \u0060crates/storage/provider/src/providers/blockchain_provider.rs\u0060 and \u0060crates/storage/storage-overlay/src/changeset_cache.rs\u0060 change together 50% of the time (6 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u00601721c6a0\u0060 fix(storage): don\u0027t cache snap trie reverts (#28401); \u00607744d20c\u0060 test(storage): remove redundant tests (#27829); \u0060835e4286\u0060 perf(trie): skip historical trie changesets with complete overlays (#\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/blockchain_provider.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"18141b72c9a01cb8fc76c17e468c01509f0eab50cb2bf0247560156becd64a6a"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 sidebar-cli-reth.ts: \u0060crates/cli/commands/src/db/mod.rs\u0060 and \u0060docs/vocs/sidebar-cli-reth.ts\u0060 change together 50% of the time (6 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \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) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u006003a308da\u0060 feat(cli): add \u0060reth db migrate-v2\u0060 for v1\u2192v2 storage migration (#23422); \u0060ce2a194f\u0060 feat(cli): add db stage-checkpoints command (#22579); \u006056bbb3ce\u0060 feat(cli): add \u0060reth db prune-checkpoints\u0060 command (#22288) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b0f15ef432345f5b2ed872cbd8979f2b3c563b3b4835779e099e809ab6d942"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: execution.rs \u2194 common.rs: \u0060crates/cli/commands/src/stage/dump/execution.rs\u0060 and \u0060crates/node/builder/src/launch/common.rs\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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u0060e20e56b7\u0060 feat: add \u0060Metadata\u0060 table and \u0060StorageSettings\u0060 to \u0060ProviderFactory\u0060\u2026; \u00601ba12aee\u0060 chore: remove \u0060NoopBlockExecutorProvider\u0060 (#16060); \u0060980e62a5\u0060 chore: relax \u0060ProviderFactory\u0060 setup (#13254) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/stage/dump/execution.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f055532e588e2673a6d145bfa237546048d672e7813292e508716c32afba7c"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: engine_store.rs \u2194 engine_api.rs: \u0060crates/engine/util/src/engine_store.rs\u0060 and \u0060crates/rpc/rpc-engine-api/src/engine_api.rs\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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u0060881500e5\u0060 feat(rpc, reth-bench):  \u0060reth_newPayload\u0060 methods for reth-bench (#22\u2026; \u0060e468d4d7\u0060 feat: add \u0060ExecutionData\u0060 AT (#14179); \u006004c1d712\u0060 refactor: couple ExecutionPayload and ExecutionPayloadSidecar (#14172) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/util/src/engine_store.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e66a41e11b9950c3326097919cf75b123ec19f04552fa208dba7a47c588d915"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: engine_store.rs \u2194 reorg.rs: \u0060crates/engine/util/src/engine_store.rs\u0060 and \u0060crates/engine/util/src/reorg.rs\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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u0060098ca328\u0060 fix(tracing): preserve context across engine and worker tasks (#27529); \u0060e468d4d7\u0060 feat: add \u0060ExecutionData\u0060 AT (#14179); \u006004c1d712\u0060 refactor: couple ExecutionPayload and ExecutionPayloadSidecar (#14172) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/util/src/engine_store.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4477c9ba43da6afab3758effcb049fc1c9119a984fb7bb2192fcded70ec388a2"}},{"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":"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":"cc682cd7167c2c692b624e54d299d32b2ea2b5b3eb72f5516f0dfab9c0ce991d"},"taxa":[{"id":"CICD-SEC-3","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":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AX8","level":"error","message":{"text":"Production project references a test project: reth-rpc-e2e-tests \u2192 reth-e2e-test-utils: \u0060reth-rpc-e2e-tests\u0060 (production) references the test project \u0060reth-e2e-test-utils\u0060. Production must never depend on test code \u2014 it pulls a unit-test framework and test fixtures into the shipped product and inverts the only correct direction (tests depend on production, never the reverse). Move any shared helper into a production support library, or invert the reference."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f0ca708ea8639ef89c94d7a7dc3f6a97b9b2a8013f598ce255786afd01af5824"}},{"ruleId":"AX9","level":"error","message":{"text":"Query writes persistent state on the read path: RpcBlockchainStateProvider.get_account: \u0060RpcBlockchainStateProvider.get_account\u0060 is a read-named query yet it performs a durable write on the read path (a persist to a store/repository). A query must stay side-effect-free so reads are safe to retry, cache, and route to a read replica; move the write into a command."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/rpc-provider/src/lib.rs"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5767691c5cdae60f9f5d02396b676464ba66af9949e6a02aea1efddff0f7fe"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: content-security-policy: The live app\u0027s responses did not include content-security-policy (restricts the sources a page may load \u2014 mitigates XSS/injection). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b142e47096a32517bde0bb9b78f7e564119c7f87e22fba4dccc0d1e3645d74c5"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: cross-origin-embedder-policy: The live app\u0027s responses did not include cross-origin-embedder-policy (recommended by the OWASP Secure Headers Project (value: require-corp)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"153214bb9c80f7d66cba8eb6a7715e9609e84c3979c9b641cd6bedaa8be6930b"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: cross-origin-opener-policy: The live app\u0027s responses did not include cross-origin-opener-policy (recommended by the OWASP Secure Headers Project (value: same-origin)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8cdbe5cdec6a55c732bf9a9975c0e40f81ddfa4ad583a4a50bfb0895531607f7"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: cross-origin-resource-policy: The live app\u0027s responses did not include cross-origin-resource-policy (recommended by the OWASP Secure Headers Project (value: same-origin)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3ba35c34991db9965777a53477c2d497c4c6606f78d133bbaa3bc99c71648c2a"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: permissions-policy: The live app\u0027s responses did not include permissions-policy (restricts powerful browser features (camera, geolocation, \u2026)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac8a111f0bb913829dc090833718dca5ab8e5fba7350f9dcf68f1971010745"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: referrer-policy: The live app\u0027s responses did not include referrer-policy (limits referrer leakage to third parties). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"364ee3f006b552b8fee33710a1fbfb0c4fac59e927af9c4396e51940d9069f01"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: strict-transport-security: The live app\u0027s responses did not include strict-transport-security (forces HTTPS on subsequent requests \u2014 mitigates downgrade/MITM). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"567d3eeb50a5678c0139a1d316c614c44cd4c4fb5db6fffa7795bc73d035966f"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: x-content-type-options: The live app\u0027s responses did not include x-content-type-options (stops MIME-sniffing (expects \u0027nosniff\u0027)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e7f2638203ac91f5b64c739d090b339c00a90f1007c83652152b402a6eb0cdeb"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: x-dns-prefetch-control: The live app\u0027s responses did not include x-dns-prefetch-control (recommended by the OWASP Secure Headers Project (value: off)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"50e54b8511264dd930857e4620bda8ba4053661b439218ed047812bcab0e3a44"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: x-frame-options: The live app\u0027s responses did not include x-frame-options (blocks clickjacking via framing (or use CSP frame-ancestors)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0e84499d19780ca121fad65e0f3bd2fc17b1268ce3079a5f40495749c54dc87e"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: x-permitted-cross-domain-policies: The live app\u0027s responses did not include x-permitted-cross-domain-policies (recommended by the OWASP Secure Headers Project (value: none)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"55366a3d9fb1c5952ebc54aab272eb775bf2c1b056d6d399652365c26cc2375b"}},{"ruleId":"AXI1","level":"warning","message":{"text":"Container process runs as root: reth-promtail-1: \u0027reth-promtail-1\u0027 (grafana/promtail:latest) runs as uid 0 \u2014 no user was specified, or one resolving to root was. Observed on the running container, which is the only place the answer is settled: an image\u0027s own USER, a base image\u0027s inherited one and a compose override are all invisible to a Dockerfile reader. Advisory evidence for CRA Annex I (2)(b)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d09c307989127d8293c2eaf1fef509982c2518fb067046250242465bc0d43e93"}},{"ruleId":"AXI1","level":"warning","message":{"text":"Container process runs as root: reth-reth-1: \u0027reth-reth-1\u0027 (ghcr.io/paradigmxyz/reth) runs as uid 0 \u2014 no user was specified, or one resolving to root was. Observed on the running container, which is the only place the answer is settled: an image\u0027s own USER, a base image\u0027s inherited one and a compose override are all invisible to a Dockerfile reader. Advisory evidence for CRA Annex I (2)(b)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fb6bcca0cc3805811fbee97e3931a3920aab699947dcb0cd6a22574e1327a4c5"}},{"ruleId":"AXR1","level":"warning","message":{"text":"WCAG 1.1.1 reproducibly failed in a rendered surface: axe-core rule(s) image-alt failed on: img[height=\u002230\u0022]. Runtime evidence (advisory \u2014 not scored); fix and re-scan to verify it clears."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"28f4c45779a4309ff85f9c42c060990e7e52dbdb9dbe524270a65cd1efe1ff6f"}},{"ruleId":"AXR1","level":"warning","message":{"text":"WCAG 1.4.3 reproducibly failed in a rendered surface: axe-core rule(s) color-contrast failed on: .cm-placeholder, .m_88bacfd0, .mantine-visible-from-sm \u003E .active[aria-current=\u0022page\u0022][href$=\u0022query\u0022] \u003E .m_80f1301b.mantine-Button-inner \u003E .m_811560b9.mantine-Button-label, button[data-variant=\u0022primary\u0022] \u003E .m_80f1301b.mantine-Button-inner \u003E .m_811560b9.mantine-Button-label. Runtime evidence (advisory \u2014 not scored); fix and re-scan to verify it clears."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f3ac60a8f513543e3616e3310eadd04e48faee367c92309e284504e755a9ea60"}},{"ruleId":"AXR1","level":"warning","message":{"text":"WCAG 4.1.2 reproducibly failed in a rendered surface: axe-core rule(s) aria-allowed-attr, aria-conditional-attr, aria-deprecated-role, aria-hidden-body, aria-hidden-focus, aria-input-field-name, aria-prohibited-attr, aria-required-attr, aria-roles, aria-valid-attr, aria-valid-attr-value, button-name, duplicate-id-aria, link-name, nested-interactive failed on: .cm-content. Runtime evidence (advisory \u2014 not scored); fix and re-scan to verify it clears."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"15d5940c2ae6c28b9de7cec0020386357c95edc55924e278c858fab1d6499d47"}},{"ruleId":"C2","level":"note","message":{"text":"No named authorization policies: Authorization IS enforced here (by route guards, auth middleware or checks that refuse a caller) \u2014 this is NOT a claim that endpoints are unprotected. What\u0027s missing is a NAMED rule set: who may do what is encoded inline where it is checked, so the rules can\u0027t be listed, reviewed or tested apart from the code that applies them. Recommendation, not a defect."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b048fdf3fa524ac68c7874fdfcdb4c49d5f010013f2cb22a0bd84cb12ceb951f"}},{"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":"P10","level":"note","message":{"text":"Implementation type on the public API: 1 public type in \u0060reth_ecies.error\u0060 is marked as implementation by its own namespace, folder or name: \u0060ECIESErrorImpl\u0060 (crates/net/ecies/src/error.rs:31, name ends in \u0060Impl\u0060). While it is public, every consumer of the library can bind to it, so changing it is a breaking change for those consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/ecies/src/error.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d063ba40a7aed8497633d8f3709bbd05d07024a3a4f1437f1997fbfbfabf8ab"}},{"ruleId":"P10","level":"note","message":{"text":"Implementation type on the public API: 3 public types in \u0060reth_db.implementation.mdbx\u0060 are marked as implementation by their own namespace, folder or name: \u0060DatabaseEnvKind\u0060 (crates/storage/db/src/implementation/mdbx/mod.rs:70, \u0060implementation\u0060), \u0060DatabaseArguments\u0060 (crates/storage/db/src/implementation/mdbx/mod.rs:86, \u0060implementation\u0060), \u0060DatabaseEnv\u0060 (crates/storage/db/src/implementation/mdbx/mod.rs:257, \u0060implementation\u0060). While they are public, every consumer of the library can bind to them, so changing them is a breaking change for those consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/db/src/implementation/mdbx/mod.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc0cb66addcc302d10c44719383c5ec8968a4ce85219e1331e07baa2e960112"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 74/75 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060.\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"note","message":{"text":"Dependabot does not watch bun/cargo: \u0060.github/dependabot.yml\u0060 schedules updates, but no \u0060package-ecosystem\u0060 entry covers \u0060bun\u0060, \u0060cargo\u0060, which this tree depends on \u2014 so those dependencies get no update pull requests and no advisory pressure, however complete the dep-scan credit looks. Add the missing entries to the \u0060updates:\u0060 list."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/dependabot.yml"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab0ef06af3ad95b9dc4173d809a809cc4d43b1196d62b5a1f52d22b24c45ac82"}},{"ruleId":"P5","level":"warning","message":{"text":"No DR/backup evidence: A persistence guard (data volume / purge-protection) was found, but no backup, geo-recovery or RTO/RPO controls were evidenced \u2014 a volume that survives a container recreate is not a tested restore from catastrophic loss."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5daabb38c90b07af65b8738cf94ce884e90a7d8fef810d341de5c186188c8fe0"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060Client::new()\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/download/manifest.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b8d1e2cb0a7898ed56e5c05e58f6a0a94b2df00e53f19d258b39831a27340c2"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060Client::new()\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/download/source.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"95503e133c7ad1ef612b81926793768bb8da84a9ea074131208bc91d62ed17e0"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060Client::new()\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/download/source.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"661d953b80142dd997414ed3509d9fb98ceca15edeec8d80cb440073c5a1d601"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060Client::new()\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/import_era.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4eac1ac0e7dcc822ff02915b4d67a8854e20c5495f67cff7e191b3a42d824b5"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060Client::new()\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/consensus/debug-client/src/providers/etherscan.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"050108e28cd9c2d2b8465299c895a1e6cb3cc692a2b9f4a6c631443441788f23"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060Client::builder()\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/metrics/src/server.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4e98fedc7a62c0f3144f95ac4f85001de72df9de7a3c3093e86e017179d3d5"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060Client::new()\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stages/stages/src/stages/era.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"9483da8ece2974cf2781618cc066e63e4f41b81a8d45efe30161848591fd795a"}},{"ruleId":"S1","level":"note","message":{"text":"No app-layer HTTPS enforcement detected: This repository starts an HTTP server and nothing in its Rust source or committed \u0060Rocket.toml\u0060 secures the transport: no TLS served (actix-web \u0060bind_rustls\u0060/\u0060bind_openssl\u0060, axum-server \u0060bind_rustls\u0060 with a \u0060RustlsConfig\u0060, tonic \u0060ServerTlsConfig\u0060, a \u0060TlsAcceptor\u0060, Rocket\u0027s \u0060[default.tls]\u0060), no \u0060Strict-Transport-Security\u0060 header, no \u0060X-Forwarded-Proto\u0060 read from a TLS-terminating proxy \u2014 so its traffic may cross the network in clear text. (\u22122.0 on this card.) The server: \u0060Server::builder()\u0060 (docs/vocs/docs/snippets/sources/exex/remote/src/exex.rs:69)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8697c7a8b4c37084f15e81b8ec84d4cf62954730be74a0816d39b2127a21fd9b"}},{"ruleId":"S1","level":"note","message":{"text":"No security response headers detected: None of the 11 security response headers the OWASP Secure Headers Project recommends (Content-Security-Policy, Strict-Transport-Security, X-Content-Type-Options, X-Frame-Options, \u2026) is set on a response this repository\u0027s Rust server sends \u2014 defense in depth, even when a proxy could set them. (\u22122.0 on this card.) The server: \u0060Server::builder()\u0060 (docs/vocs/docs/snippets/sources/exex/remote/src/exex.rs:69)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bd19c680309417e132c0be93c2002123f0664b42afe6172b1319da65a6a57ba7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060args.run_pairs is not None and args.run_pairs \u003C 1\u0060 appears character-identically in 2 files \u2014 .github/scripts/bench-call-summary.py, .github/scripts/bench-reth-summary.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":".github/scripts/bench-call-summary.py"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd9941621f6c20623dcad739f76322e9c7e78596f3a29742226ec2a074e5704"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060query.startswith(\u0022sum(\u0022) and query.endswith(\u0022)\u0022)\u0060 appears character-identically in 2 files \u2014 .github/scripts/bench-reth-summary.py, .github/scripts/bench-target-metric-sample-filter.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":".github/scripts/bench-reth-summary.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dbbcfc2277d65368212865f3d7c94142244169d2cc420750497e89ff70045b7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!channels.is_empty() \u0026\u0026 channels.len().is_multiple_of(MAXIMUM_CHANNELS)\u0060 appears character-identically in 2 files \u2014 crates/stages/stages/src/stages/hashing_account.rs, crates/stages/stages/src/stages/hashing_storage.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stages/stages/src/stages/hashing_account.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d205d8fd7f686d6815a7c803421cd57784e59a66da15fd78a08f1da58a3cb1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060background.join() \u0026\u0026 !thread::panicking()\u0060 appears character-identically in 2 files \u2014 crates/trie/trie/src/verify/mod.rs, crates/trie/trie/src/verify/pipeline.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/trie/src/verify/mod.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba5d006d98d2fd5c9e2b0f82f05bf1911d7b128724f2a2dba8cdc3b5f2b01aa5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060block_number != last_block \u0026\u0026 total_entries \u003E= self.commit_entries\u0060 appears character-identically in 2 files \u2014 crates/stages/stages/src/stages/hashing_account.rs, crates/stages/stages/src/stages/hashing_storage.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stages/stages/src/stages/hashing_account.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6e8c4ccc8e6100e32fd40d440bf17f92cea675a9534912741333f83574946a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060control_first.is_none() \u0026\u0026 test_first.is_none()\u0060 appears character-identically in 2 files \u2014 crates/trie/trie/src/hashed_cursor/post_state.rs, crates/trie/trie/src/trie_cursor/in_memory.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/trie/src/hashed_cursor/post_state.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"64412fe7f8cdba492aa53925124987324f0a45993f3bd3edf8a0a053b8215da2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060control_result.is_none() \u0026\u0026 test_result.is_none()\u0060 appears character-identically in 2 files \u2014 crates/trie/trie/src/hashed_cursor/post_state.rs, crates/trie/trie/src/trie_cursor/in_memory.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/trie/src/hashed_cursor/post_state.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"587a69faafb5bfa5168571dd13fb39f38e3e0cb3da449ba4947121083c8af549"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060index \u003E 0 \u0026\u0026 index.is_multiple_of(interval)\u0060 appears character-identically in 3 files \u2014 crates/stages/stages/src/stages/hashing_account.rs, crates/stages/stages/src/stages/hashing_storage.rs, crates/stages/stages/src/stages/tx_lookup.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stages/stages/src/stages/hashing_account.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"77063e9346b8feca015f0bf2e2668d5880631e69ed6b06c9be2b65ebc44c036e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060k.address == address \u0026\u0026 k.sharded_key.key == storage_key\u0060 appears character-identically in 2 files \u2014 crates/cli/commands/src/db/get.rs, crates/storage/provider/src/providers/rocksdb/provider.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/get.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"f57f2a62db178626d959abadc37e3f4adbfd728f4da2f1edf28a958467a8a299"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060missing_count == 0 \u0026\u0026 result.iter().all(Option::is_some)\u0060 appears character-identically in 2 files \u2014 crates/transaction-pool/src/blobstore/disk.rs, crates/transaction-pool/src/blobstore/mem.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/blobstore/disk.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22dbe939e8162df63b442e8c5912f09ef23d2b28f238525568e3a6d55e85e71"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060response.accounts.is_empty() \u0026\u0026 response.proof.is_empty()\u0060 appears character-identically in 2 files \u2014 crates/net/downloaders/src/snap/mod.rs, crates/net/network/src/fetch/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/downloaders/src/snap/mod.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"4687990f8e2c662dd816c39b58a39f2bf7ef25b31c526f7ab0f3e137318c110b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060total_range \u003E self.clean_threshold || from_block == 1\u0060 appears character-identically in 2 files \u2014 crates/stages/stages/src/stages/hashing_account.rs, crates/stages/stages/src/stages/hashing_storage.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stages/stages/src/stages/hashing_account.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"7744eb55a3e5932f0c6dc1f573494dd3bc217deeddb1d632d2d5d2a836efdf71"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060key_length\u0060 is read from the bytes being parsed at line 268 (\u0060usize::from_be_bytes\u0060), then used to size a \u0060vec![\u2026; n]\u0060 at line 270 \u2014 and nowhere in its scope is \u0060key_length\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060key_length\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/etl/src/lib.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa794bc9d9b5a0276e7e51f42981aff7745f2e45528e5fef248bd9c3d990deaa"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060value_length\u0060 is read from the bytes being parsed at line 269 (\u0060usize::from_be_bytes\u0060), then used to size a \u0060vec![\u2026; n]\u0060 at line 271 \u2014 and nowhere in its scope is \u0060value_length\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060value_length\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/etl/src/lib.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"129047f002a18d5e8a6e18e404f4f205185a858cb48ea4fc0418bf5246908719"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060count\u0060 is read from the bytes being parsed at line 208 (\u0060i64::from_le_bytes\u0060), then used to size a \u0060Vec::with_capacity\u0060 at line 231 \u2014 and nowhere in its scope is \u0060count\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060count\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/era/src/e2s/types.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"595b9c9d539c6036591e3599cf913ecc8eae2310c5da503b26bb38cb892f06db"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1285 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/trie/trie/src/proof_v2/calculator.rs"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"8169befa5d8db2774118fa4f2e7b7322918007c712736235eceb4db09ddcd91a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 375 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/maintain.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"0768ce3cd7576228c443b2422355d9026b81111ae0b3556b1404b3c3bf4884b3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 854 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/maintain.rs"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb770d74b1b21fa4da7e0187d41aae4818f5cc70798445e57852d775e8d4fec7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 219 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/pool/best.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6143f988a812772249ef661388921cb546a64d378b9bbf856fe8b5fb1b54f77"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 293 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/pool/listener.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0aaed57ba511237a299a70d041389d006e9881cb30659095ea0d5d940858539"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 335 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/pool/listener.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8031b1b1a538fddb69dba89d0f5daca22693c7e53f98c412436914687e4d055"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 768 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/pool/mod.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0fdc24030ca8cde447f750ad893a2e4455362de99866eb1abb2394b113fb84c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 871 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/pool/mod.rs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d963a5068de112df93811abaa9c9a9d5df8512041a62d09c0e55aa5ffb9081b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1363 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/pool/mod.rs"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e51d407fdad2ef61f49db6af25005041335d1842a3636b12fb4a6511fdf3f5e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1365 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/pool/mod.rs"},"region":{"startLine":1365}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d182e993c5e7572b024c3e2c4345ce87b0bc56379aa9a09e74f597c9c91df4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1306 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/pool/txpool.rs"},"region":{"startLine":1306}}}],"partialFingerprints":{"codehealthFindingId/v1":"c94f6e17c10511df2b06538d011564d37c7061562e4d6e4ab340e303f1e714b1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1318 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/pool/txpool.rs"},"region":{"startLine":1318}}}],"partialFingerprints":{"codehealthFindingId/v1":"07799733a779f016e10e4b167c69f04466367c0df7a0b3d6a4bf215e8b133bc5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 696 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/transaction-pool/src/blobstore/disk.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e8c8620d7a4524a67c8e8c3b6d1fd2e7eab243c3825cd94937717d791d3fba"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 38 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tokio-util/src/event_stream.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a5ed371c1707be4b72d8b59c511915ac877663a49bcd52e2324a27971d1031"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 713 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tasks/src/runtime.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c6fc0d106757e68075be1a2627ae4cfbad3634949bf5d135decfd9c18365b6e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 782 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tasks/src/runtime.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef4ac62b1915cc6a4e0079e66018b605fe0478a059efda67a8d5347f704f587c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 851 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tasks/src/runtime.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"08349a3f2ff76d127047d34edc41653ecfd34442b4c6a8b06c6d870490f47cb7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1095 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tasks/src/runtime.rs"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe93667e5020c790f4ff6649ad221ea2cb4e36552af69a7b2dad63694b5c53c2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 466 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/static_file/writer.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"5732d5cfac2d6f0149cac0d52b8dfcacd944b25bab42b3553531557ab8d10e80"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 481 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/static_file/writer.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa190ea4ad240cf779dd180b0efcda3e870921ccbd04bcfcf8d50032498d43cc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 141 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/db-common/src/db_tool/mod.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb75bd3b3f0b7f99aabdba1d4b200d3b13673c625af88cb227f757c121d010ac"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 145 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/db-common/src/db_tool/mod.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"a23e10c290b2ddec5fe928da8fb463c3d44985bb892c05ee6cf2a514235d77f4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 151 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/db-common/src/db_tool/mod.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"4404dd928e6d809789536e8caf462b8fa433aa8d84060e861deb5bccbfa8b7ad"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 79 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/db/src/lockfile.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"484fb08915ef788a148f49c7aa8f14d4d5f3c5a6c0d79de6326918cfd1697f78"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 515 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/db/src/implementation/mdbx/mod.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"7285f27bf5f4c52df7b3286326194ab35d29cde83eef6c5039627bb3301044e8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 322 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stages/stages/src/stages/hashing_account.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"73efad2b842ed81ab68ef6b43396e2a8577f9275f502d405fda98e3ebb02f6a5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 263 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stages/stages/src/stages/hashing_storage.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"5297b40623d652b533b27085a58ac30c93feb8ee613c5d68905ad1370bd48508"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 690 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stages/api/src/pipeline/mod.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5443ee722f1d9c50dd444689a3c02f38b1cd0ed43670c29fa82b0e15fe7d762"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 715 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stages/api/src/pipeline/mod.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"b463b04cce8867d78eb86cd8ac48cce4a46f3c0f87a974034fd3bbeff807d3db"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 745 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stages/api/src/pipeline/mod.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"05478e4e5904bb2b021539d7b9c5ef0aa053b04b028805105550318cb11e3e63"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 750 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/stages/api/src/pipeline/mod.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"1612832766696724678f856f9508149955cea47f0eace7aa04de916ba2607289"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 29 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc-layer/src/jwt_validator.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"eedd137b8187a1cea30600da2e4a6f27357a3a355b94151b0e284cf07c500a32"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 36 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc-layer/src/jwt_validator.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"c968a9d12d8b86a7d35ccce91fe39e15183833a39c81af36e34fce5c9356c012"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 224 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc-eth-api/src/helpers/pending_block.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"877d106286e392956430ddf6463d613c4af5ca550162dfe24cf55a4a1f3b3663"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 197 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc/src/eth/filter.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"3726adece56621942ad0885a05fd4072d581ebad60ef42abfa0ac10881640ba1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 514 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/rpc/src/eth/sim_bundle.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e2ab368abc55105b766b6cfa8a1735755541842806d958e4a20961dd460579f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 183 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/jsonrpsee/server/src/server.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2657e86e9c9f9c4a81d8f19e792f72aaf7989b263d6a07e5b13b5482c755f1e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 712 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/jsonrpsee/server/src/server.rs"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf45670f831c7d7c4b01999e05d863e4022cf077b6c6cb89c363e804643f4018"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 720 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/jsonrpsee/server/src/server.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"5754142ac00b495921ed736d64f8117e8dc5ab80b76dd728f1c27583dfcb3762"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 756 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/jsonrpsee/server/src/server.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"2040aaf15e0e4ea113493e9c3ca5a1438f2a3e0790db8bcaa745105cd2b72662"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 795 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/jsonrpsee/server/src/server.rs"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f5e59b6aa32917bcdb6b2b58e9876ec437dc0df2f31b2c769442989e636847"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 878 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/jsonrpsee/server/src/server.rs"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e26b5ed8bfb0018111dd96df517eff4b113bd2d0d1b5e64abab4968767aa61"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 927 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/jsonrpsee/server/src/server.rs"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cbe89deceb2ab7f80a52ba4f03f7c6c17a538466c07a5d91a231e193185b45c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 47 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/jsonrpsee/server/src/transport/http.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4f9f791d1ceb67c46e15c6315c3c0a5645acc60ea7d3db6ac8f69c206e6c69"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 228 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/jsonrpsee/server/src/transport/ws.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb22fe14ebd8c191157ac0ced5adefa89d9996e3bf29e1a1ae46ff71643fc57a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 247 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/jsonrpsee/server/src/transport/ws.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b4a0438264ea9140f8e9a9da1a6ed8a4436aa9892cd0729fca0676bed32f7e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 388 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/jsonrpsee/server/src/transport/ws.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6c247d56f06d290ac5fc5d00065fa1ecd7e17b534c812a08ec0dae55fbbd90"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 392 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/jsonrpsee/server/src/transport/ws.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7b7ca884437544fbb534741da0912328b473af91531f4a84b88aaa6752993c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 617 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/jsonrpsee/server/src/transport/ws.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"526d98a4e4d62c8fbdcf6005cd1c0fda3f4b4e7703c2fb5cf221b151d6e8c6e3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 184 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/jsonrpsee/core/src/http_helpers.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"63e0c4554fe77d92da3b2e1864d6a9b0dec19081ca5c789c1c84616a4d297356"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 9 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/jsonrpsee/core/src/proc_macros_support.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"883ffafa93dd05914271e9a3be6b407002e73b29376f3ad0a412c77811ff3664"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 210 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/jsonrpsee/core/src/server/method_response.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"6828cc40ad1b905663093fa41d1219d564af738ffe4591555ecf6914410ba619"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 252 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/jsonrpsee/core/src/server/rpc_module.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f72ecd43b2abbe8d4bc225ace4393cd204926bbbedb320d47b693d2f8d0c484"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 301 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/jsonrpsee/core/src/server/rpc_module.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"905dd7ed1f01301fc792427097ec398d1dd1303b52444c36f3d13d7430a63aa9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 537 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/jsonrpsee/core/src/server/rpc_module.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc7a3a56c6abd87a54ab4428605f036319c99451c184d0c8485666c0a319368"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 871 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/jsonrpsee/core/src/server/rpc_module.rs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"f932cefdfc6ca241a07b8a1ddabb85f16737e13b6812e6cc2377ffd467b0a46b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 892 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/jsonrpsee/core/src/server/rpc_module.rs"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e5bf82b3c9cd1d888d561545af2c7ed594b571dd25197b56cd9c2a64f9442c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 122 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/ipc/src/server/connection.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"2621aad778d95a0c1d9cf6afa78da9e30f6bdbb2c66ddb49a802cc8b8d8caf54"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 181 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/ipc/src/server/connection.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db8c444233d584f3e2accd214ff6b0d5b2dc67a9f3742a8929805544574c2b5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 211 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rpc/ipc/src/server/mod.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc8d8cdac111035b12ebe128577940289548e97dbb648012a941edee33ca144"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 55 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/prune/types/src/pruner.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11a98a41eea5f9130fc82352c4b1b6fffac921080e4563ff4ea3c170f949bb1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 156 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/metrics/src/server.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c4e260a2c3392f3a9a5ae6ddb2df172cf3bb0eeda5a1ca0316e4bdef88a61d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 155 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/events/src/node.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"d72a33fd14d7a27face5ecc80304a0fd8357bf14cc7262a0d28038707a1d7941"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 166 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/events/src/node.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c80f8e665b1bda764bcf0040996c40d6909c4ccaf959ba8fa3e0a3a375eb7b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 176 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/events/src/node.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"52942effcea8aad915390da0f31538337faf14b1e77e18c6d1caac6e4f886b67"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 186 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/events/src/node.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a4136768791870ff0fc5527e9a7e4dff995b2993bbdbfff0ec8cd176f0c9f2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 235 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/events/src/node.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"b10f760eff9dc9ddd7ad1b969a5bdf5c093b7167ab806a48410cf8e1ed73b0c2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 587 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/events/src/node.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2b80b09714cf13ba40a120ce4aabeca140d5c6a4391c232db5e06c65c5d2ff"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 109 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/ethstats/src/ethstats.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ae09410bfd2508eb656e70bb6b687f5a878bc02029d1c702c99f02196f7dd5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 119 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/ethstats/src/ethstats.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b1978dfe89a31d2cf4cd9b4d1921954f2d8d66512d7375b18484db71b680928"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 141 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/ethstats/src/ethstats.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2223b3662d615bc6ca0c93ae9608f861f66845e89af210c46c787e4e4085a6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 189 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/ethstats/src/ethstats.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fdb5f24a2c8f964a2c8b7cdbbafbf30bb9d631a88c2047f923dfb3f9c05dd1c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 284 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/ethstats/src/ethstats.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"236db2f47663381a9ddbc01069b58e05257d3880ea6f550a82d1fe2ea126bee3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 306 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/ethstats/src/ethstats.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6560350eb0e1920d06035c3e581a2ad2cb2b0072bc4d31053fe3ccb94869d6e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 347 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/ethstats/src/ethstats.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"683b3c98aa4e27ff52e7b7a1ed36abe62c7ed2ce848b22baed2e8a164b4da1a4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 354 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/ethstats/src/ethstats.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb26201c140795c6b0bc997f0d73a256f225e29787f7266caebf1d6a5385f74"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 358 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/ethstats/src/ethstats.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"045ac02e187411436ff75d3e26e920fa66c23485373e026018a4ee7141513de9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 388 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/ethstats/src/ethstats.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6baa9bf1be7126b94b940e9a8ed82092743854df4775a7051b878ebac5b8686"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 468 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/ethstats/src/ethstats.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"7940eb7b8db171b93845d29293da863e1c79102527e8908589a67992b96d356b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 472 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/ethstats/src/ethstats.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3cd7b1b583ec7ccb79ed2e8b03110c647d386ecbc25d60a1feda367c1a1cafe"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 484 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/ethstats/src/ethstats.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b810a5ec45caf22e7765fbb39f4a7d980116125c7d03391649a63b1491a38c1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 542 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/ethstats/src/ethstats.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5edb910119cb0d6e860b64f0cf0891ace2ec03495fe64f608c464fafdbe80b6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 550 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/ethstats/src/ethstats.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"4acf59f08c899a7cb58ff6fbf7dba9759643bbf8c3dbd85443292174fa24b31a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 578 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/ethstats/src/ethstats.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"759b506b551b7fc3c634e097aa85c1ef527055dd3e5a30ceb15450454097a42f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 589 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/ethstats/src/ethstats.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c75bc7512d095ce23ada3add60d72ab0cc5f6f3f4fd8fe7a58ca8014835574"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 633 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/ethstats/src/ethstats.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1cd6844644604b6a4441f1773b85ddfea40d9c3e6a78aec73b358e491025707"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 636 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/ethstats/src/ethstats.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e08a8283399ca46182e5948e8d4fb5228796dc16cb75ac3e66ef027c37e710b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 690 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/ethstats/src/ethstats.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d2de10dffbdaf986c28c59744babf3fb0c64fc727a60ed805221e1523020fd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 698 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/ethstats/src/ethstats.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c66ccff70663685f26365c9f836579e78286720a0ba758424bdb15aca3482fa"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 703 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/ethstats/src/ethstats.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcbc9cd1f0a1fad445c26df50147d87134702ddca628cd5aa33f40cc9b05ec89"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 711 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/ethstats/src/ethstats.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"0223db26fbafa04e158822258e4e66abeef21ac95b63b038df1dfc53855cce76"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 719 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/ethstats/src/ethstats.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"158cb6454d57d77fb1961e3eca6fe8116db21d4b2e9bd255346029cd97f988e9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 729 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/ethstats/src/ethstats.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fdeaf7075198c66431cf1c4f8bda0b4f13d9083f96f63d8ac2f9ca7bbd2de29"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 752 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/ethstats/src/ethstats.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f2f4013e9d07e537f7e2ea8e8e91dac5e8edc285294463ff9f981bc6936be2e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1314 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/builder/src/launch/common.rs"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"761eac031a0adf0a7a9c9501e0ab401793cdae47b2bf003ebb0ec45b5b3ac76e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1332 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/builder/src/launch/common.rs"},"region":{"startLine":1332}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3119d11dd431e808737a064ae846b13650fd493a57fb3b43fa6891a654e109"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 239 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/builder/src/launch/debug.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"c130b12dc5314e30d820dd19fca3f6c7a998fc5e20a61be5e5b8fae535ce77a8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 150 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/builder/src/launch/engine.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a0518b0b87860d22aad7acd0551c4dff220b36375331c7a528ea62e8f9e5ed4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 372 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/node/builder/src/launch/engine.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"c69495c4ae4a75644e4a8034027f329aa38197dbe1e3ddf2b56a5938c7b55712"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 43 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/listener.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac89ceabd4720762e992b72fa4b45a7f8c6c647dd1f98a5be6e79cee579090c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 47 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/required_block_filter.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"986814a6c01dce3822b790bf7517a3c041a1575c7a26b000b84739c6b990c09c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 59 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/required_block_filter.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff70417d18dbc7c8eac9ac9bde1f98b68fe0f55e1c163325cc02686cef2561e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 92 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/required_block_filter.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"0124794dd5a2276830f76a67fc367fd5f8f8c91686b1de36f98eff489c0cf4b9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 98 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/required_block_filter.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"40449c2bdaee9907895c13ca5d9fa0ce8f8177420b5f1738e729db5f851fb950"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 113 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/required_block_filter.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"66aefceb641602e4760f62470d7732667d9746c960736b3ad49c7203c087b9ac"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 121 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/required_block_filter.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc56eceacfc763c6544a7c4507e15adc9126e5d5cbd27c58817233ac4c02992"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 133 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/required_block_filter.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"802e68cead919f4d6ae3924ddb61d46ffe1ec6020b9796fc5aaaab970f5b1b79"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 141 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/required_block_filter.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec75e25054680cd93028f458ed0dfa7b1857e976f544876aef10f72ce3bb6ec1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 150 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/required_block_filter.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"0addc3318fcd0be3f2c847f47ebc6f68544a1e035cfbe2f99489b5a2f8e0ce05"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 153 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/required_block_filter.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d9e74cb73889378c14f9ef7d935d60da542f7bae08673145076169f793fbe1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 66 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/trusted_peers_resolver.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"aefca98cfbf8d82f383ee322f920cc4b30dbde608683a90d88f5c6b443370b86"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1105 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/network/src/session/mod.rs"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"372ea7b789ccd0e4c4dacd28dbc7d1053609431bdddf54aae7181c07c373b9b1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 78 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/ecies/src/codec.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a51e5923325a605650be7d65b7526d4017a6ba2dbfb24565ff2788b9bdd94e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 88 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/ecies/src/codec.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f413680834d12b3799248335d789544f50eb0536563591961cdaef00bdfba6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 97 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/ecies/src/codec.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9fe179a4346d1fd96578679e8140d266abfe1133c5d67be49ddc0b11c5366b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 108 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/ecies/src/codec.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b9fc2b87fd93d63327069cbac0406f7b2d8233438086af033a1498ba9792a2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 128 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/ecies/src/codec.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c8e3f5f027eeadd5809484835694af59be122085ce3e6723df61efbea1f7754"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 111 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/downloaders/src/receipt_file_client.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e3312e0b0dab39174b9317f2f770e5d12491b98570be603f346d7a51ef34a5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 922 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/downloaders/src/headers/reverse_headers.rs"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"960d7c294de59872a37f017b7a19b443cf1eb5c1d68bad4c1b5874ea8bd9af5d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 256 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ethereum/cli/src/interface.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c00e60453b28676fdaa6562624d7d852e7e16277818a1ab7f494c0eb8e3482"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 260 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ethereum/cli/src/interface.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"550ddf00da11f8fa3692c1190b3c5c242f9f7ab4565381d97b39bad2e4c08ca0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 270 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ethereum/cli/src/interface.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f47b4b4319a3f0aa8607566313fac313fe2f4333cd67d877b4509064cff07e1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 212 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/era-utils/src/export/mod.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1f36f00b9563548dc6ad808d4d9246972bf18fac6da20644cce52c61bb2bb9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 216 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/era-utils/src/export/mod.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"97804467b6cec3909f0b35580254c95cc2515e50521f427c881fa90dd21af167"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 303 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/era-utils/src/export/mod.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"a13fdd4e75bb6bfd487dc3c333c14da7581024d4b2e58840b3ebb8bf8875831c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 313 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/era-utils/src/export/mod.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a8917fc83421ab52a447bb3d17d4d1be8b71110448aa1cbbfd573941bd9f2bd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 317 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/era-utils/src/export/mod.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8c9340b45422f161c8c642a7e5695a8651175d8c76eec666898117e8fc9cb8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 322 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/era-utils/src/export/mod.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"f01c10895b3311ae5fe576c6482533f52908e572d84ed52d0212c8cb3115700c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 353 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/era-utils/src/export/mod.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3ac839f47089074a9f06fc9b9a77f7556282deff87dc54fae4c2d6e6afb764"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 769 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/tree/src/tree/mod.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7df378e9f68f75bf1fcad98fe00dc0d1045a9c0af21b76d353a169a14729e4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 792 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/tree/src/tree/mod.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"b597408c1167a6a20e3e2b67a3efb6246d5ebdeb1add2b05c224c2a0fc03cb0c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 879 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/tree/src/tree/mod.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c81ad8044ce5faa93f2ba0717828b6d2dff2a2c1169b31aaa9f8aeda355f8a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 980 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/tree/src/tree/mod.rs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e1bc6b11db1b030e8f345ba7bbae7c33bb975b4d8936145e41e0e4e5d647a6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1145 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/tree/src/tree/state_root_strategy/sparse_trie.rs"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4cc806096eb9ccac05b7604a1a5c2dffa2ab252d9a1ad2c1877dee00f3211c6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 207 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/local/src/miner.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddfde905ce9b31056e5778bacf22524ec72f3064724787e6ce45ae8ec8a25beb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 213 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/local/src/miner.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8a0aa4fd71ff09f12438631f3f67639e8ac2dc0ff65b7c5133d0927cfaf00d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 68 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/consensus/debug-client/src/providers/etherscan.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf345b8520a3615c9509794f923499fb1e33ab06193713955e765bf3d2a86413"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 126 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/export_era.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c70f5b974999771942ab000bd64be0f430ed25d96363ae57b9eeeb4b785a135"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 144 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/export_era.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd99c1d92d1bb5a45a75a80a2e1fd202b6e324c587ad05941dea3c21625bc1fd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 56 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/import.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd85c57ab298c4049a8021519bdace4aa09f963320305a50e51d86e76308fe3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 63 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/import.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"1570382c4b64d559327b51ac8a4e05624a548623e460dc52560cbae157dcbe7a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 81 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/import.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eccc8b6ff89a967676195793db36312385aa0ae8ba868b25dbb3c91a9bfa375"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 101 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/import.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"7326f81f2a19f01770e8086738677bbcdf1bd76360c58615943473430f4c4c77"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 123 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/import.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4eb3c9ecac5c298aa62d1c52065f5fefa2a6ced954bee45c69918166a223027"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 128 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/import.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03d5731399c7a09b7416c1aa6f1d2770b8a27228ca629f6eb1572367b4a8480"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 88 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/import_era.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"e524c9129bc1482704415dae43e8cbfc396398088d4bc65fad3cbb8c5671ed8d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 162 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/node.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e06c6dae3b606b0de4f2937a1646375687648fcc280dcc7ecc91a624f91f103"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 358 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/re_execute.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"89277d3998fdf8ede153ef1aee6d3627aa1b17fc602fa2ecd05f9ac6e632ff15"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 65 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/p2p/bootnode.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"436086661d42be32cea1bede4b32a76a9b5482baf583a7094bb7cf1d4e43e795"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 107 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/p2p/bootnode.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"58901357abfb405a954e14e00ee94526834f3999e8dacb0050db667c7ea57d13"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 122 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/p2p/bootnode.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b8ae07c1d7d4fc4b8efe3ced1dff38e2a42cf1f6c445bc29f5bb772cddc769"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 136 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/p2p/bootnode.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ad58a45245c59bce9f4bcce4ebe20897a4268701c40294f4aad2a05152ea3d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 150 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/p2p/bootnode.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"307c3478ac1723c230c537b5674101de87eefed02f42ad265a61b1de006c341b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 153 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/p2p/bootnode.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d2ea784a50fc14de425883f5955d4cf3c368b581be9ba56b89e26eaadc9e645"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 234 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/p2p/bootnode.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b6cb69b0a521446572cf24c7fa9f1b89104402192fc96be629809233776052"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 374 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/p2p/bootnode.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd521550e27ac023613e898df2f4c6f87201e528e3461ff52277bc7bc63c580"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 479 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/p2p/bootnode.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a6088047aed10aa49553a77d29e847fe0c056a8b5be5b9a77313169caf1e78"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 481 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/p2p/bootnode.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"812cf6f7c3b3ab9b437bcceb8628baf15dae14415727e24cfad06e676993c510"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 176 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/init_state/without_evm.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ff5f8c24e4f3e8b76d20a7e2a8fd7194b3a3045ee5610ddb979a059b396b41"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 185 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/init_state/without_evm.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ff1499d3fcbfcb9e98c3ce5e3dc0a58b2f6ca018dbc30bff5b7f9c6db633fd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 230 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/download/fetch.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"54deb8ed4193990f0b228b951df91b23d2c6a8e4cc17994a6c55a041cd3ea4c1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 241 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/download/fetch.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"4546a499b2a4eaeb23c8a16b6e2d7348ffd2ea56bd9a6a35ef91ff2339180034"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 684 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/download/mod.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"5660d9067e2ed0a708520719fb55c6c2e2dd3fa4e813504313f2f29b0d9ba6ad"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 706 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/download/mod.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e6753ff00e922bea5bb5760d8639c67f8ba7fba7147cab71a0d639ab72b84d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 84 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/diff.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1891a543d00e1f7f80cb0049b4d1fdcdf6b44326cce46fec35c5005ae3f7d38"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 89 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/diff.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a278c80e8e9ee2c2d89c6d62895a5db09b295ff9f60e7328a69dc086509fd4a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 102 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/diff.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"afbd60fa09186e2fba6b04587cb4f2847642276de310ec55ad9af8d67989420a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 109 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/diff.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df42d0c1f673aacb02f1b7cbdd0aa3ba781a60fe6503c95ee0db48e35a55e4f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 126 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/diff.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bbbf8e31ea692d0a44b75087a65d5a21537ab71ea69aa2ad330e22cb18100fe"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 132 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/diff.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36f103d781ab1f054bd801cae922be58b85a210ddb40fca1de2c07c9bf0930d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 140 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/diff.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ed7376c78521278f2f69d1046926ce4e71ef0f692dbaa16c572572714e43f13"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 145 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/diff.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"df308b20b5d7bf556c54be1e7e38ec1d83eaa3efbf7c32b8c05234352ecc380a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 148 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/diff.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"9576be019e62a84cd29e3b8c13b2956fbc8f5769229bdce03a9fe8c350e005a3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 167 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/diff.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae776a8fa17ee9ddbaf86cb21962fe40f4be722396de3ac9277dde1e6d5f571d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 677 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/get.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"237e7073baa3ed8ea77b96aaaa918273803a7e91055a761b1c8953d4942f43a6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 113 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/list.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"ececddf48fe5a7238a148bd7672fec22dc1436c36b658915816cd6fcfdc878cc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 386 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/migrate_v2.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"e384de9fbf33e59c4895aa0adb659fc62a22ed765982659d2ea05f9222f0f502"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 101 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/repair_trie.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"691c5742533a3b2bdbae0ba7c202eb651646146dbbb459d928468b0c770df70b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 131 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/repair_trie.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7779802861d57f13fae3061b44b91d9f8a50c0d915e55dcb1bc2e20eadca582"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 165 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/repair_trie.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7efb97e7732373d9f880a05b5d96af3776530fea7830f0637bd2540dda36c82"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 185 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/repair_trie.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf4d8f57804e0dacb09faf85655875934fb8af3a009de729eccf03bd4951818"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 236 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/repair_trie.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"a386c3a643aa6a59c875f539da678cece67ef3d3eeff21366945eab76fb46ff8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 255 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/repair_trie.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee767b3999959f6c182a81f22bdeed84d2b971d69e38499bb0382bdc86b964b7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 289 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/repair_trie.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"980049afc7a7bea56169ffb627f49aec94e0a5ca02bc15857cabe507bbada2cb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 39 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/static_file_header.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2256eb1d9449b5ee1fce7fbdd77173c47f8e2b4f435a30daab7ae80a10e2feb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 158 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/tui.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35c0ff9187e262ff8c08620503be8a0875f98ecc1a890085bfe66094b53d6d0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 127 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/checksum/mod.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cad37f0b1b81bcedd84cf9e5997ed30c05e4cd28193fe8053aa1e3f39e68f01"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 144 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/checksum/mod.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae6bee41286655e3adfee0e177f32e40e61382d96bc97ca913617346a089190"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 209 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/checksum/mod.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"7acbe42c45654735ac26ea923d2427dcbd8d08135e16aa6a8cf3fc0d3a7d28aa"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 258 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/checksum/mod.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"f872e21b435074322534b3d8ddbc3f83722a53ce98634f6ff8da954b97c73c06"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 280 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/checksum/mod.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf63bc8186c1cc436ff0d36081a11182ec78bfa000330b3c060bd65ae943e5e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 297 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/checksum/mod.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca08f405a67fecce850f1ed58828713d7ca1ac822efd763a467af31dea89ec4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 299 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/checksum/mod.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56576e7b7f75dfedf5dd581d4f9f057045259533c713386f480c8baeba6ea09"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 300 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/checksum/mod.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff2fd843fd31cc2605c0da10ff53d24b0f42e4015a6b6634cbb8bb5eb83f912"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 306 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/checksum/mod.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cfdc068c1850df4d7bb205638f00e772590234552cee91646fff153b443929e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 342 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/checksum/mod.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c9776e18cc564c044cad866bce93e976c30bf56f29a202f4341bab4e40fb7d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 49 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/checksum/rocksdb.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"f489ac1a604d4f0ce5bf6024c1162290850c8365afc39cb759bfe24eaac4b5d5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 69 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/checksum/rocksdb.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb288d4b6669f94f26b81b26df97877a52183b3c8c5e303b93ae88699adba4d7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 98 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/commands/src/db/checksum/rocksdb.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"164f2e7628325b86067cb1800c5e87c369f0f3673dbaf84712e195110e5fa016"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060wal_size_bytes\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\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 on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/storage/provider/src/providers/rocksdb/provider.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b9efd3f880900afc209b49a4e159cff524c0aef753d6703da7f16a757857ad"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-1333","guid":"11a336ce-63de-c45c-845e-29ca1e8df13d","name":"CWE-1333","shortDescription":{"text":"CWE-1333"},"helpUri":"https://cwe.mitre.org/data/definitions/1333.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-214","guid":"b10ad120-fb22-1351-9348-aa23b453e815","name":"CWE-214","shortDescription":{"text":"CWE-214"},"helpUri":"https://cwe.mitre.org/data/definitions/214.html"},{"id":"CWE-250","guid":"52ee12e8-390a-7351-b1e6-388afa694e54","name":"CWE-250","shortDescription":{"text":"CWE-250"},"helpUri":"https://cwe.mitre.org/data/definitions/250.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-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-532","guid":"1cd8877a-76e8-ce54-b40b-779af23364a0","name":"Insertion of Sensitive Information into Log File","shortDescription":{"text":"Insertion of Sensitive Information into Log File"},"helpUri":"https://cwe.mitre.org/data/definitions/532.html"},{"id":"CWE-653","guid":"aa3e371b-590e-225d-a56c-cd490a1dca63","name":"Insufficient Compartmentalization","shortDescription":{"text":"Insufficient Compartmentalization"},"helpUri":"https://cwe.mitre.org/data/definitions/653.html"},{"id":"CWE-668","guid":"e2cb99db-6d24-b056-b0d0-885a733ec403","name":"Exposure of Resource to Wrong Sphere","shortDescription":{"text":"Exposure of Resource to Wrong Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/668.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-913","guid":"062167e8-5db3-0857-a865-a1fc4aad34bc","name":"CWE-913","shortDescription":{"text":"CWE-913"},"helpUri":"https://cwe.mitre.org/data/definitions/913.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":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"},{"id":"A09:2025","guid":"78892bc9-3c98-495d-881c-8af1390d643c","name":"Security Logging \u0026 Alerting Failures","shortDescription":{"text":"Security Logging \u0026 Alerting Failures"},"helpUri":"https://top10.owasp.org/2025/A09_2025-Security_Logging_and_Alerting_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-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-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-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":53,"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."]}]}