rustnet — Watchdog Audit

Executive summary

The system holds a strong overall standing of 81%, indicating a healthy asset that delivers value with manageable risk. This score reflects a mature architecture and solid production readiness, suggesting the platform is stable and reliable for current operations. However, beneath this stability lies a hidden tax on development velocity that, if ignored, will steadily erode team efficiency and increase long-term costs.

The value at stake is significant, with over 71,000 lines of production code driving core business logic. While the system is not boilerplate-heavy, the cost to rebuild it from scratch would be approximately €140,000, requiring one to two engineers for nearly a year. This substantial investment underscores the importance of preserving and optimizing the existing codebase rather than replacing it. The current composition suggests a well-structured domain model, but the lack of measured test coverage introduces uncertainty about the safety of future changes.

The primary risk is a velocity tax embedded in the code quality. Although the architecture is sound, the average code health score of 7.4 out of 10 implies that every modification carries a 2–5% efficiency penalty. This is not a one-time cost but a recurring drag on the hundreds of thousands of lines changed annually. Over time, this compounds into significant delays and increased defect rates, effectively charging the business for every feature delivered. The second theme is decision opacity. The absence of Architecture Decision Records means critical design choices are undocumented, making it difficult for new team members to understand context or for leaders to audit past trade-offs. This creates a knowledge silo that increases onboarding time and the risk of repeating past mistakes.

What is genuinely good is the system’s architectural integrity and production readiness. The high scores in these areas indicate that the system is well-organized, observable, and safe to operate. The code is not fragile, and the foundation is solid. This stability provides a strong base for improvement without requiring a risky overhaul.

Where to focus first is resolving the lack of architectural documentation. This single action has the highest leverage, paying for itself within one to two months by reducing the velocity tax and clarifying decision history. It is a low-effort, high-impact move that immediately improves team alignment and reduces future drag. Other improvements can wait until this foundation is set. Note that test coverage and specific domain modeling aspects were not measured, so the picture of safety and domain alignment remains partial.

Code Health 83% Adequate · gated by D2 Architecture 92% ★ Exemplary Maturity 80% Strong Readiness 83% Strong Security 80% Adequate · gated by D29 Performance 85% Strong

How the score is built — each lens's share of the headline Width is the lens's weight in the worst-heaviest fold (the weakest area pulls hardest); colour is that lens's own band. A lens fixes the score in proportion to its width.

Maturity 80% · 46% weightSecurity 80% · 25% weightReadiness 83% · 14% weightCode Health 83% · 8% weightPerformance 85% · 4% weightArchitecture 92% · 2% weight

No single dominant problem — the weakest areas are close, so progress on any of them moves the score.

Code composition — where the lines go

Tests 100%

New since the last scan (45+)

45 finding(s) are new versus the previous scan (2026-09-13) — surfaced by this scheduled scan itself, no pull request required.

D1 · rustnet_monitor::tui::run (cyclomatic 70) src/tui.rs
D1 · rustnet_monitor::bootstrap::run (cyclomatic 44) src/bootstrap.rs
D1 · rustnet_monitor::ui::widgets::status_bar::view_hints (cyclomatic 36) src/ui/widgets/status_bar.rs
D1 · ConnectionFilter::matches (cyclomatic 25) crates/rustnet-core/src/network/filter.rs
D1 · ActivityTab::handle_key (cyclomatic 24) src/ui/tabs/activity.rs
D1 · DnsResolver::start_with_spawner (cyclomatic 20) crates/rustnet-core/src/network/dns.rs
D1 · rustnet_core::network::dpi::mysql::analyze_mysql (cyclomatic 19) crates/rustnet-core/src/network/dpi/mysql.rs
D1 · DnsAnalyticsTracker::snapshot (cyclomatic 17) crates/rustnet-core/src/network/dns_analytics.rs
D1 · rustnet_monitor::ui::draw (cyclomatic 17) src/ui/mod.rs
D1 · rustnet_core::network::dpi::redis::analyze_redis (cyclomatic 16) crates/rustnet-core/src/network/dpi/redis.rs
D1 · rustnet_core::network::merge::apply_packet (cyclomatic 16) crates/rustnet-core/src/network/merge.rs
D2 · rustnet_monitor::tui::run (cognitive 204) src/tui.rs
D2 · rustnet_monitor::ui::widgets::status_bar::view_hints (cognitive 60) src/ui/widgets/status_bar.rs
D2 · rustnet_monitor::bootstrap::run (cognitive 55) src/bootstrap.rs
D2 · DnsResolver::start_with_spawner (cognitive 36) crates/rustnet-core/src/network/dns.rs
D2 · DnsAnalyticsTracker::snapshot (cognitive 28) crates/rustnet-core/src/network/dns_analytics.rs
D2 · ActivityTab::handle_key (cognitive 26) src/ui/tabs/activity.rs
D2 · rustnet_monitor::ui::tabs::activity::draw_process_details (cognitive 25) src/ui/tabs/activity.rs
D2 · rustnet_core::network::dpi::mysql::analyze_mysql (cognitive 24) crates/rustnet-core/src/network/dpi/mysql.rs
D2 · OverviewTab::handle_key (cognitive 19) src/ui/tabs/overview.rs
D2 · DnsResolver::stop (cognitive 18) crates/rustnet-core/src/network/dns.rs
D2 · rustnet_core::network::dpi::redis::analyze_redis (cognitive 18) crates/rustnet-core/src/network/dpi/redis.rs
D2 · rustnet_monitor::headless::stream_json_lines (cognitive 16) src/headless/mod.rs
D2 · rustnet_monitor::ui::tabs::overview::draw_overview (cognitive 16) src/ui/tabs/overview.rs
D3 · FunctionTooLong: rustnet_monitor::tui::run src/tui.rs
D3 · FunctionTooLong: rustnet_monitor::bootstrap::run src/bootstrap.rs
D3 · FileTooLong: app/capture.rs src/app/capture.rs
D3 · MethodTooLong: ConnectionSnapshot.from_connection src/headless/schema.rs
D3 · FunctionTooLong: rustnet_monitor::ui::tabs::activity::draw_process_details src/ui/tabs/activity.rs
D3 · ClassTooLong: App src/app/state.rs
D3 · FileTooLong: network/process_activity.rs crates/rustnet-core/src/network/process_activity.rs
D3 · TooManyFields: App src/app/state.rs
D3 · FileTooLong: app/state.rs src/app/state.rs
D4 · Members sharing a duplicated core (4 members, 50+ identical tokens) src/ui/theme/definitions.rs
D5 · Off the main sequence: rustnet-capture
D5 · Off the main sequence: rustnet-sandbox
D5 · Off the main sequence: rustnet-core
D15 · Hotspot: src/ui/mod.rs src/ui/mod.rs
D15 · Hotspot: src/tui.rs src/tui.rs
D15 · Hotspot: crates/rustnet-core/src/network/filter.rs crates/rustnet-core/src/network/filter.rs
D22 · Redundant packet parsing/consumption operations. `PacketReader` appears to be a high-level stream consumer that yields packets, while `PacketParser` is a stateful parser that transforms raw bytes into `ParsedPacket`. However, `PacketReader` likely wraps or uses a parser internally. The existence of both `next_packet` (streaming) and explicit `parse_packet` (stateless/stateful transformation) creates confusion about whether the user should use the Reader for consumption or the Parser for transformation. Furthermore, `parse_packet_with_refresh` and `parse_packet` differ only by an internal side-effect (refreshing IPs), which is an implementation detail leaking into the API surface.
D22 · Inconsistent naming for drop metrics. `capture_drops` and `interface_drops` are specific, but `total_dropped` is ambiguous. Does it sum the previous two? Or is it a different metric? The naming convention shifts from specific source (`capture`, `interface`) to a generic aggregate (`total`), which is inconsistent with the other two methods. Additionally, `total_dropped` sounds like a property or a sum, whereas the others are specific counters.
D22 · Redundant availability checking. `is_available()` likely checks if the resolver is initialized and has data. `get_status()` returns a tuple of three booleans, which likely includes availability plus other states (e.g., DB loaded, cache ready). However, exposing a raw tuple `(bool, bool, bool)` is poor API design compared to a typed struct or enum, and it overlaps with the simple `is_available()` check. Users calling `is_available()` might not need the full status, but the existence of both suggests unclear responsibility for state reporting.
D22 · Inconsistent builder pattern naming. `with_defaults` and `with_defaults_deferred` suggest a builder pattern, but `try_with_defaults` returns a `Result` and likely constructs the resolver directly. This mixes builder-style fluent methods with constructor-style methods. `with_defaults_deferred` is also a confusing name; it's unclear what 'deferred' means in this context (lazy initialization? async?).
D29 · REDACTED

A full-fidelity diff against the previous run's complete recorded findings — line-move tolerant: a finding that only shifted line counts as unchanged, only genuinely new titles/files surface here.

Rebuild cost & value ~ Modeled — €45,000–€230,000

Cost to rebuild	€45,000–€230,000 (0.4–1.4 person-years (752–2,386 h), ~1–2 engineers)
Domain complexity	Standard — harder problems cost more per line
Quality factor	1.4× (at 81% quality) — the last 20% of quality is most of the work
Size & shape	Medium · effort split not classified (source measured from disk; the effort-tier breakdown is a C#-only syntax walk)

This codebase represents roughly ~0.9 person-years of build effort (about ~€140,000 to rebuild). Its weakest lens is Maturity at 80% — the part of that asset most exposed by the findings below.

How we model this: boilerplate at a scaffolding rate + logic × domain Standard (×1.0) — standard service × a 1.4× quality factor, at €60–95/h; indicative, ±~30% · size measured directly from source · effort from total production LoC as straight-line logic (the tier split is a C#-only syntax walk), a conservative lower bound. Indicative only — most sensitive to the hourly rate and the domain tier (both tunable in config).

Top priorities

The highest-leverage moves; the full ranked list is in the Roadmap below.

Resolve the 1 No ADRs found finding(s) in ADR Quality.

+1.5 pts · Low effort · ADR Quality

Record significant decisions one document per decision — dated, stating the context, the decision and its consequences — and keep them together wherever your design docs already live (a conventional `docs/adr/` tree, with each file named `NNNN-title` in whatever markup those docs already use, is the most discoverable form).

+1.5 pts · Medium effort · Architecture documentation

Resolve the 6 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (4), REDACTED (2).

+0.7 pts · Low effort · Static Analysis (SAST)

Diagnosis — what's actually going on

The top fix pays for itself · High · Economics

The top-ranked fix costs roughly 1–3 engineer-days once. Not doing it costs about 23.7–158.1 engineer-days every year, paid as drag on the ~474,346 lines this team changes annually — a bill that arrives whether or not anyone books it. On those figures the fix breaks even in roughly 1–2 months and is free after that. Method, stated so this is not read as a quotation: debt from the ranked task's effort band; interest = annual changed lines (measured, annualised from the 90-day window) ÷ an ASSUMED 150–400 lines per engineer-day × the 2–5% drag implied by the code-quality signals; breaking point = debt ÷ annual interest. A modelled planning range built from measured inputs and one named assumption — not a quotation, a valuation, or a certified figure.

Evidence: D15 churn: 116,962 line(s) changed over a 90-day window ⇒ ~474,346/year · D1/D2/D4/D6 code quality: averaging 7.4/10 ⇒ a 2–5% drag on each change · top-ranked remediation: Low effort ⇒ about 1–3 engineer-day(s)

→ Do the top-ranked fix now if this code will still be yours in 2 months.

Highest-leverage move · Medium · Leverage

Of everything flagged, the best return on effort is: Resolve the 1 No ADRs found finding(s) in ADR Quality. The rest can wait behind it.

Evidence: priority ranking: top of 5 ranked by impact/effort

→ Resolve the 1 No ADRs found finding(s) in ADR Quality.

A velocity tax on every change · Medium · Economics

The code-quality signals (complexity, duplication, cohesion) average 7.4/10, which acts as a tax on every change in the weaker areas: modifications there plausibly cost on the order of 2–5% more than in clean code, and the tax compounds as the codebase grows. (A modelled estimate, not a measured fact.)

Evidence: D1/D2/D4/D6 code quality: averaging 7.4/10 across the code-quality signals actually measured

→ Pay it down where churn is highest — the hotspots — not everywhere; that's where the tax is actually paid.

Architecture — module dependency graph

Project dependencies, layered top-to-bottom; arrows show direction. Any dashed red edge points upward or sideways — a layering smell or cycle. A clean layered graph has none.

Architecture — module dependency matrix

Rows and columns are the same modules, ordered so that a module only depends on ones above it. A cell means the row depends on the column, and its number is how many type pairs create that dependency. Read one thing: is anything above the diagonal? A mark there is a dependency cycle. (A cycle is all this shows — an unusual but cycle-free dependency sits below the diagonal like any other.)

156 modules, 251 dependencies. 2 dependency cycles across 4 modules, marked above the diagonal.

Showing the 40 most-connected modules; 116 more are not drawn.

Module dependency matrix. The row depends on the column; the number is how many type pairs create the dependency. A cell above the diagonal is part of a dependency cycle.
depends on →	1 rustnet_core.network.dns	2 rustnet_core.network.interface_stats	3 rustnet_core.network.protocol	4 rustnet_core.network.types.protocol_info	5 rustnet_monitor.app.runtime	6 rustnet_sandbox	7 rustnet_core.network.protocol.tcp	8 rustnet_core.network.types.connection	9 rustnet_core.network.types.identity	10 rustnet_core.network.dns_analytics	11 rustnet_core.network.dns_attribution	12 rustnet_core.network.parser	13 rustnet_host	14 rustnet_monitor.app.logging	15 rustnet_core.network.merge	16 rustnet_host.linux.ebpf	18 rustnet_monitor.network.containers	19 rustnet_monitor.network.kubernetes	20 rustnet_core.network.tracker	22 rustnet_host.linux.process	23 rustnet_monitor.app.types	24 rustnet_core.network.process_activity	25 rustnet_host.linux.enhanced	26 rustnet_monitor.app.capture	30 rustnet_monitor.app.state	31 rustnet_monitor.ui.state	32 rustnet_monitor.headless	33 rustnet_monitor.ui.component
1 rustnet_core.network.dns
2 rustnet_core.network.interface_stats
3 rustnet_core.network.protocol
4 rustnet_core.network.types.protocol_info
5 rustnet_monitor.app.runtime
6 rustnet_sandbox
7 rustnet_core.network.protocol.tcp			1									2
8 rustnet_core.network.types.connection				2					6
9 rustnet_core.network.types.identity								1
10 rustnet_core.network.dns_analytics				4					2
11 rustnet_core.network.dns_attribution								5	2
12 rustnet_core.network.parser			1				1		5
13 rustnet_host								1	5
14 rustnet_monitor.app.logging	1			1				1	1
15 rustnet_core.network.merge				8			3	1	1			1
16 rustnet_host.linux.ebpf									2				1
17 rustnet_host.macos.process								1	2				6
18 rustnet_monitor.network.containers								2					2
19 rustnet_monitor.network.kubernetes								4	1				2
20 rustnet_core.network.tracker				2				4	4	2	1	2			1
21 rustnet_host.linux.ebpf.tracker_libbpf													2			1
22 rustnet_host.linux.process								1	5				7			1
23 rustnet_monitor.app.types																		1
24 rustnet_core.network.process_activity								3											1
25 rustnet_host.linux.enhanced								1					4			1				1
26 rustnet_monitor.app.capture	1											1		1					2		1
27 rustnet_monitor.app.pcapng_export								1	1										1		1
28 rustnet_monitor.app.sampling					1			1											1
29 rustnet_host.windows.process								1	2				7										1
30 rustnet_monitor.app.state	1	1			5	3		2	1	1			1	1			1	1	1		7	2		4
31 rustnet_monitor.ui.state																						1
32 rustnet_monitor.headless					2																				1
33 rustnet_monitor.ui.component																					1				2	4
34 rustnet_monitor.ui.connection_table	1							1	1																	3
35 rustnet_monitor.headless.schema					4			2													1				3		2
36 rustnet_monitor.ui				1				1													1				1	2		2
37 rustnet_monitor.ui.tabs.activity																						3			1	5		3
38 rustnet_monitor.ui.tabs.details	1			2				1	2																	3		5
39 rustnet_monitor.ui.tabs.graph								2	1																1	2		1
40 rustnet_monitor.ui.tabs.overview	1					1				1											2				1	5		5

Dependency, pointing down the layeringAbove the diagonal — part of a cycleThe module itself

At a glance — Code Health · 83% · Adequate · gated by D2 ·

The Good

D3 · Rust God Classes 8.6 D4 · Rust Code Duplication 10.0 D17 · Rust Explicit Debt 10.0

The Bad

D1 · Rust Cyclomatic Complexity 6.1

The Ugly

D2 · Rust Cognitive Complexity 3.5

At a glance — Architecture · 92% · Exemplary ·

The Good

D6 · Rust Cohesion (LCOM4) 10.0 D35 · Rust Change Coupling 9.9 AX10 · Repo Code composition 9.9 AX3 · Repo Project dependency cycles 10.0 AX4 · Repo Dependency direction 10.0 AX9 · Repo CQS / query purity 10.0

The Bad

D5 · Rust Coupling 5.2 D22 · Rust Internal API Consistency 6.0 D26 · Rust Project Cohesion 6.0

At a glance — Maturity · 80% · Strong ·

The Good

D15 · Rust Churn × Complexity Hotspots 9.3 D19 · Rust Documentation Quality 9.0 D21 · Rust Naming Consistency 10.0 D34 · Rust Knowledge Freshness 10.0 M1 · Repo Documentation (README) 8.7 M3 · Repo Folder & project structure 10.0 M4 · Repo Documentation accuracy 10.0

The Bad

M2 · Repo Architecture documentation 5.0

The Ugly

D20 · Rust ADR Quality 0.0

At a glance — Readiness · 83% · Strong ·

The Good

D9 · Rust Test Distribution 10.0 D12 · Rust Dependency Hygiene 9.8 D13 · Rust Secret Scanning 10.0 P1 · Repo CI/CD gates 10.0 P10 · Repo Library API & versioning 10.0 P2 · Repo Observability 7.0 P3 · Repo Security & performance tooling 8.0 P4 · Repo Deployment & Rollback 7.0 P6 · Repo Release Hygiene 10.0

At a glance — Security · 80% · Adequate · gated by D29 ·

The Good

D28 · Rust Secrets (history) 10.0 D30 · Rust Dependency Vulnerabilities 10.0 D31 · Rust IaC & Container Security 8.9 D37 · Rust Vulnerability-disclosure Policy 10.0 D43 · Rust Malicious Dependencies 10.0 D44 · Rust Platform End-of-Life 10.0

The Bad

D36 · Rust Supply-chain Provenance & Signing 5.0

The Ugly

D29 · Rust Static Analysis (SAST) 0.1

At a glance — Performance · 85% · Strong ·

The Good

PF1 · Repo Benchmark discipline 8.5

Security & Compliance — OWASP Top-10 mapping

Findings mapped to OWASP categories; the specific CVEs/secrets are in the Security dimension cards below and findings.md (redacted only on the public version of this report).

OWASP category	Findings	Severity
A03:2021 — Injection	33	High / Critical
A05:2021 — Security Misconfiguration	4	High / Critical

Roadmap

Begin by resolving the single missing Architecture Decision Record and addressing the twenty-two high-churn complexity hotspots, prioritizing mod.rs, details.rs, and overview.rs. Next, document significant architectural choices in a dedicated, discoverable location and add a testing section to the root README to clarify how to run the suite. Finally, enhance system operability by implementing OpenTelemetry tracing and metrics alongside a health-check endpoint.

Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.

Do this	Helps	Effort	Dimension
Resolve the 1 No ADRs found finding(s) in ADR Quality.	+1.5 pts	Low	ADR Quality
Record significant decisions one document per decision — dated, stating the context, the decision and its consequences — and keep them together wherever your design docs already live (a conventional `docs/adr/` tree, with each file named `NNNN-title` in whatever markup those docs already use, is the most discoverable form).	+1.5 pts	Medium	Architecture documentation
Resolve the 6 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (4), REDACTED (2).	+0.7 pts	Low	Static Analysis (SAST)
Resolve the 6 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (3), REDACTED, REDACTED.	+0.7 pts	Low	Static Analysis (SAST)
Add a 'Testing' section to the root README — how to run the test suite.	+1.3 pts	Medium	Documentation (README)
Resolve the 3 High IaC finding(s) in IaC & Container Security — start with REDACTED (2), REDACTED.	+0.6 pts	Low	IaC & Container Security
Resolve the 22 Hotspot finding(s) in Churn × Complexity Hotspots — start with mod.rs (3), details.rs, overview.rs.	+0.9 pts	High	Churn × Complexity Hotspots
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing.	+0.4 pts	Low	Supply-chain Provenance & Signing

File quality

Per-file score 0–10 — a quality signature. Of 71 files carrying findings, judged against the Production bar: 0% slop · 70% mixed · 30% near-clean.

File	Score	Band	Worst signal
REDACTED	4.4	Mixed	Static Analysis (SAST): High: REDACTED
REDACTED	4.5	Mixed	Static Analysis (SAST): High: REDACTED
crates/rustnet-core/src/network/tracker.rs	5.1	Mixed	Change Coupling: Boundary-crossing change coupling: tracker.rs ↔ details.rs
REDACTED	5.1	Mixed	Static Analysis (SAST): High: REDACTED
REDACTED	5.1	Mixed	Static Analysis (SAST): High: REDACTED
REDACTED	5.1	Mixed	Static Analysis (SAST): High: REDACTED
REDACTED	5.1	Mixed	IaC & Container Security: High IaC: REDACTED
REDACTED	5.8	Mixed	Static Analysis (SAST): High: REDACTED
REDACTED	5.8	Mixed	IaC & Container Security: High IaC: REDACTED
crates/rustnet-sandbox/src/linux/landlock.rs	6.0	Mixed	Explicit Debt: TodoComment
src/ui/tabs/overview.rs	7.0	Mixed	Cyclomatic Complexity: rustnet_monitor::ui::tabs::overview::draw_stats_panel (cyclomatic 33)
src/ui/tabs/activity.rs	7.0	Mixed	Cyclomatic Complexity: ActivityTab::handle_key (cyclomatic 24)
src/app/capture.rs	7.0	Mixed	Cyclomatic Complexity: App::start_capture_thread (cyclomatic 35)
crates/rustnet-core/src/network/merge.rs	7.0	Mixed	Cyclomatic Complexity: rustnet_core::network::merge::analyze_tcp_segment (cyclomatic 26)
crates/rustnet-core/src/network/dpi/quic/salvage.rs	7.1	Mixed	Cyclomatic Complexity: rustnet_core::network::dpi::quic::salvage::try_reconstruct_sni_from_fragments (cyclomatic 28)
scripts/pcap_enrich.py	7.1	Mixed	Cyclomatic Complexity: pcap_enrich.create_pcapng (cyclomatic 16)
src/ui/tabs/details.rs	7.2	Mixed	Cyclomatic Complexity: rustnet_monitor::ui::tabs::details::draw_connection_details (cyclomatic 94)
crates/rustnet-core/src/network/dpi/mod.rs	7.2	Mixed	Cyclomatic Complexity: rustnet_core::network::dpi::analyze_udp_packet (cyclomatic 38)
crates/rustnet-core/src/network/dpi/quic/packet.rs	7.2	Mixed	Cyclomatic Complexity: rustnet_core::network::dpi::quic::packet::scan_packet_frames (cyclomatic 36)
src/ui/state.rs	7.2	Mixed	Cognitive Complexity: UiState::get_selected_grouped_index (cognitive 23)

How the grades work

Every finding carries one of four grades. Three say how serious it is. The fourth says this survey could not settle it — and it is a grade, not a gap.

Critical — 37

A definite problem that already costs you something and drags the score down: a missing authorisation check, a dependency with a known exploit, a build that does not reproduce. Failure here tends to cause failures elsewhere.

Serious — 181

Likely wrong, but not failing yet. It degrades the codebase over a longer horizon and can cause failures elsewhere — not urgent this week, not something to carry for two years either.

Minor — 10

Recorded, with no effect on how the codebase functions. Present so the survey is complete, not because it needs doing.

Could not be resolved — 37

Something this survey could not settle from the outside, and which could be critical or serious. Either a control was required and no positive evidence of it exists in the repository — a backup job that nothing shows was ever restored from proves nothing about restores — or our own analysis could not run over that part of the tree. This is not a clean result. These are excluded from the score rather than awarded a pass, so the number on the cover neither rewards nor penalises them: if you act on this survey without resolving them, you carry that risk yourself. Each one is named under Limitations.

Methodology & how to trust this report

Watchdog is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. 36 of 41 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); 5 documentation/naming judgement(s) are LLM-assisted and labelled advisory. Overall confidence is 0.9 — the weighted average across measured dimensions; it falls as more of the score leans on LLM-assisted judgement and rises when it's fully tool-backed.

Every figure here is one of three kinds, and we label which: ✓ Measured — a deterministic fact (LoC, complexity, coverage); ~ Modeled — an estimate from a stated model (cost, effort, value-at-risk), always a range with its assumptions, never a precise fact; ◐ Advisory — an LLM prose judgement. We never present a modelled estimate as if it were measured. Perfect or absent scores carry their provenance too (ADR-0011): ✓ Tool-verified means the property itself was measured across the surface; ○ Nothing flagged means the probes came back clean — a claim bounded by what a repository can show; ⊘ Not evidenced means a working control (a tested restore, an automated rollback) showed no positive evidence — absence of evidence is not evidence of a control, so it's excluded from the score rather than awarded a spurious 10; ◐ Sampled · advisory marks an LLM verdict over a bounded sample — advisory, never a deterministic measurement.

What we checked — 41 dimensions across the health lenses

D1D2D3D4D5D6D9D12D13D15D17D19D20D21D22D26D28D29D30D31D34D35D36D37D43D44AX10AX3AX4AX9M1M2M3M4P1P10P2P3P4P6PF1

Each chip is a dimension scored from real signals across architecture, testing, dependencies, security & compliance, documentation, git-history and code quality — in one coherent pass. A surface report typically covers a handful.

How to trust any code-health report — three questions

Can you open the finding? Real findings cite a repo-relative file and line you can open at the cited line — never an absolute scratch path. Here, 210 of 228 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
Is there a tool behind the number? Every score below names the method that produced it — Roslyn, git, a scanner, or (for a handful of documentation/naming dimensions) an LLM labelled sampled · advisory — not a narrative.
Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.

This report answers yes to all three. That's the bar to hold any assessment to.

Tools & methods

The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.

Method	Backs	Version	Evaluator
Roslyn static analysis	Complexity, cohesion, coupling, dead code, API surface, layering	5.3.0	✓ deterministic
Native secret scanner	Hardcoded secrets / credentials	1.0.0	✓ deterministic
Watchdog duplication detector (in-process)	Code duplication	1.0.0	✓ deterministic
Coverage (coverlet / dotnet-coverage)	Line & branch coverage	10.0.400	✓ deterministic
NuGet / dotnet	Outdated, vulnerable & deprecated dependencies	10.0.400	✓ deterministic
git / LibGit2Sharp	Churn hotspots, knowledge concentration, history	2.43.0 · 0.31.0	✓ deterministic
gitleaks · semgrep · trivy · checkov	Secrets in history, SAST, CVEs, IaC & container, PII / GDPR	1.86.0 · 0.69.3 · 3.2.533	✓ deterministic
LLM (sampled · advisory)	Documentation quality, ADR conformance, naming — sampled over a bounded sample; advisory, never a deterministic measurement	Local LLM	◐ LLM · sampled · advisory

Every finding is locatable in findings.md. Run 01a0f0d3-4c34-7715-9461-d114422b1627.

The exact command behind every deep-scan dimension — tool, version, invocation and retained raw output — is in Appendix B — Reproduction & audit trail.

Run transparency — what happened this run

What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.

D11 Test Reliability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Test source is present (.rs) and this repository declares a Cargo test suite (repository root, 130 test files), but it was not re-run: no test result was produced. Not scored — this is a gap in the analyzer's language coverage, not a finding about this repository.
D16 Bus Factor — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. Single-maintainer repository — bus factor is not applicable (10 contributor(s) across 762 commit(s) sampled, automation and bot accounts excluded). One of them holds 92% of the history; the other 9 hold 0.9% each on average, below the 5% at which there is somebody to hand the work to. That is a single maintainer with drive-by contributors, not a team whose knowledge has concentrated — so the bus factor is not applicable and there is nothing here for the owner to act on.
AX6 Interface segregation — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is computed over the public interfaces this run's compilations declare, and none was loaded, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
C1 Data Protection — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These personal data controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks personal data controls.
C2 Access Controls — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These authorization controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks authorization controls.
C3 Audit Trail — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These audit controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks audit controls.
C4 Data Retention — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These retention controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks retention controls.
C5 Data-Subject Rights — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These data-subject rights controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks data-subject rights controls.
ED5 Idempotency — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check finds retry-prone mutations by walking the repository's declared types, and NONE was loaded on this run, so it had nothing to look at. That is a limit of the analyzer's reach — it reads .NET projects — not a finding that this repository has no command handlers or message consumers.
GD1 Unfinished & placeholder code — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
IC1 Incompleteness & stubs — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
P5 DR & Backup — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. No backup/snapshot/replication config, RTO/RPO or restore-procedure documentation was found — and no production persistence was detected either (no data-access packages, no data-store services, no database resources), so there is nothing in this repository whose loss a DR control would recover. If this system's data lives in a platform or ops repo we can't see, that's where the DR evidence belongs.
PF1 Benchmark discipline — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This check's reader does not cover the language this repository's product is written in, so it had nothing of the product to read. That is a gap in this analyzer's language reach — not a finding about this repository.
S1 Web-Security Posture — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These web-security controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks web-security controls.
X1 Async correctness — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X12 Unreachable branch — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X13 Undrained process stream — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X14 Bypassable address classification — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X15 Unvalidated length from an untrusted reader — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X16 Unfloored truncation loop — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X17 Uncapped recursion over a caller-supplied document — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X18 Disposal-pattern correctness — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X19 Unrestored process-global state — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X2 Cancellation propagation — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X20 Mistyped argument guard — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X21 Side-effecting pattern guard — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X22 Contradicted release guard — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X23 Unguarded diagnostic materialisation — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X24 Document value interpolated into markup unescaped — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X25 Inert configuration knob — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X26 Unsynchronised callback handoff — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X27 Collection changed while being enumerated — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X28 Index access outside its own emptiness guard — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X29 Per-element action decided by a fixed element — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript source only, and no C# was loaded and no JavaScript/TypeScript was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X3 Exception handling — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X30 Support guard that admits what it rejects — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X4 Structured logging — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X5 Nullable reference types — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.

Repo exclusion declarations: 1 pattern(s) declared (.gitattributes linguist-generated/vendored, .editorconfig generated_code) excluded 0 source file(s) from code-quality scoring. Declarations are the repo's own visible statement that a tree is machine-written or vendored — auditable in any diff, honored by GitHub the same way.

Limitations & what we did not check

Watchdog assesses the repository exactly as committed, and only the repository. By design it does not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.

Per-dimension blind spots

For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.

D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
D9 Test Distribution: The test-pyramid shape is inferred from project/folder naming and references, with a single test host bucketed per-file by its path tier and content signals — a suite that names tiers unconventionally and gives no per-file signal can still be mis-bucketed.
D12 Dependency Hygiene: Dependency health reads manifests and lockfiles — a vulnerability in a vendored/copied dependency, or risk from how a dependency is actually used, is outside this view.
D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
D19 Documentation Quality: Documentation quality is judged by an LLM over a bounded sample of docs — it reads what is written, not whether the docs match the running system, and it is advisory, not a measurement. Its critique rows are drawn from a closed category vocabulary and each row means the same thing in every run, so two scans can be compared row by row; the SET that fires is still a sample, and does not repeat exactly. Measured on one frozen input, six scans at one engine SHA: 2-5 critique rows per scan, 8 distinct rows across the six, 3 of those 8 seen in only one scan. So a D19 row is evidence about the documentation, but a COUNT of D19 rows is not a quantity — never read a change in it as an improvement or a regression.
D20 ADR Quality: ADR quality is an LLM read of the decision records present — it cannot know about decisions made and never recorded, and its verdict is sampled and advisory.
D21 Naming Consistency: Naming quality is an LLM judgement over a bounded sample — it assesses clarity/consistency of the names it sees, not domain-correctness, and is advisory.
D22 Internal API Consistency: API-surface coherence is an LLM judgement over a sample of the public surface — consistency of intent across the whole API is approximated, not exhaustively verified.
D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
D31 IaC & Container Security: IaC scanning checks Dockerfiles/Terraform/Kubernetes against best-practice rules — it cannot see the live cloud account, runtime configuration, or drift between the committed config and what is actually deployed.
D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a REDACTED (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
AX9 CQS / query purity: Handlers are found by interface/name convention — a query handler using neither is not seen. Mutation is a resolved write/publish invocation (SaveChanges/repository/bus), so a write hidden behind a hand-rolled wrapper, reflection, or a string-keyed service locator resolves to a non-persistence type and isn't flagged; it detects that a query writes state, not whether the write is a legitimate read-side cache update. Clean means "no resolved write/publish in a query body", not a proof of CQS purity.
M4 Documentation accuracy: Onboarding quality is an LLM read of the docs/setup present — it cannot run the onboarding or measure how long a real new joiner takes; the verdict is sampled and advisory.
P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.

The LLM boundary

LLM-set scores this run (5): D19, D21, D22, D26, M4 (model: Local LLM). For these, a model reads a bounded sample and sets the numeric score; each names its own sample and method on its card. They are sampled and advisory by design: they vary at the margins between runs and are never a deterministic measurement. Every other score in this report is tool-computed at confidence 1.0.

Dimensions

D1 · Cyclomatic Complexity6.1 / 10Adequate✓ Tool-verified

What it measures: How tangled the control flow is — methods with many branches are hard to test and change.

Method: Cyclomatic complexity per method (1 + decision points), computed exhaustively across production source; test projects separated by convention. Deterministic.

Maturity: Documented → Verified → Prevented · effective 6.1 / 10 · rule-coverage 100% · ceiling Prevented

39 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was rustnet_monitor::ui::tabs::details::draw_connection_details at 94. A further 12 method(s) were over the threshold but excluded as flat dispatchers (a long switch/match over independent cases: many branches, almost no nesting), the largest being DnsQueryType::from_wire at 48 — they are counted neither in the figure above nor in this dimension's score. 4 files carry no cyclomatic complexity row at all for this reason — every one of their over-threshold functions was excluded, so the exclusion is disclosed nowhere in the file itself: crates/rustnet-core/src/network/dpi/bittorrent.rs (rustnet_core::network::dpi::bittorrent::decode_client_name at 24), src/ui/theme/definitions.rs (ThemeSpec::set_token at 24), crates/rustnet-core/src/network/dpi/mqtt.rs (rustnet_core::network::dpi::mqtt::analyze_mqtt at 21), crates/rustnet-host/src/lib.rs (DegradationReason::description at 16). They are named here because the per-file figures other dimensions report are taken BEFORE this exclusion, so such a file can show a high maximum complexity elsewhere in this report and nothing here, with nothing to reconcile the two.

rustnet_core::network::dpi::analyze_udp_packet (cyclomatic 38) · ×13crates/rustnet-core/src/network/dpi/mod.rs:189

rustnet_monitor::ui::tabs::details::draw_connection_details (cyclomatic 94) · ×9src/ui/tabs/details.rs:1013

App::run_process_enrichment (cyclomatic 42) · ×3src/app/enrichment.rs:160

rustnet_sandbox::linux::apply (cyclomatic 32) · ×2crates/rustnet-sandbox/src/linux/mod.rs:69

Connection::state (cyclomatic 52)crates/rustnet-core/src/network/types/connection.rs:454

+ 11 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

Resolve the 13 rustnet_core finding(s) in Cyclomatic Complexity — start with salvage.rs (3), merge.rs (3), mod.rs (2). — One of this dimension's main actionable groups (13 warning-level).
Resolve the 9 rustnet_monitor finding(s) in Cyclomatic Complexity — start with details.rs, tui.rs, bootstrap.rs. — One of this dimension's main actionable groups (9 warning-level).
Resolve the 3 App finding(s) in Cyclomatic Complexity — start with capture.rs (2), enrichment.rs. — One of this dimension's main actionable groups (3 warning-level).
Enforce Cyclomatic Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

Detailed fixes: d1_recommendation.md · top locations in Appendix A, every location in findings.md.

Do you agree with this assessment?

D2 · Cognitive Complexity3.5 / 10Weak✓ Tool-verified

What it measures: How hard the code is for a person to follow, beyond raw branching.

Method: Cognitive complexity per method (Sonar-style nesting-penalized score), computed exhaustively over production code, excluding test projects. Deterministic.

Maturity: Documented → Verified → Prevented · effective 3.5 / 10 · rule-coverage 100% · ceiling Prevented

65 method(s) exceeded the cognitive complexity threshold of 15; the worst was rustnet_monitor::tui::run at 204.

rustnet_core::network::dpi::quic::packet::scan_packet_frames (cognitive 57) · ×22crates/rustnet-core/src/network/dpi/quic/packet.rs:532

rustnet_monitor::tui::run (cognitive 204) · ×14src/tui.rs:12

App::run_process_enrichment (cognitive 101) · ×5src/app/enrichment.rs:160

rustnet_sandbox::linux::apply (cognitive 46) · ×2crates/rustnet-sandbox/src/linux/mod.rs:69

DnsResolver::start_with_spawner (cognitive 36) · ×2crates/rustnet-core/src/network/dns.rs:239

+ 18 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

Resolve the 22 rustnet_core finding(s) in Cognitive Complexity — start with salvage.rs (3), merge.rs (3), packet.rs (2). — One of this dimension's main actionable groups (22 warning-level).
Resolve the 14 rustnet_monitor finding(s) in Cognitive Complexity — start with overview.rs (2), activity.rs (2), tui.rs. — One of this dimension's main actionable groups (14 warning-level).
Resolve the 5 App finding(s) in Cognitive Complexity — start with capture.rs (2), sampling.rs (2), enrichment.rs. — One of this dimension's main actionable groups (5 warning-level).
Enforce Cognitive Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.

Do you agree with this assessment?

D3 · God Classes8.6 / 10Strong✓ Tool-verified

What it measures: Over-large classes that try to do too much ("god classes").

Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.

Maturity: Documented → Verified → Prevented · effective 8.6 / 10 · rule-coverage 100% · ceiling Prevented

35 god class(es) detected.

FileTooLong: tabs/details.rs · ×12src/ui/tabs/details.rs

FunctionTooLong: rustnet_monitor::ui::tabs::details::draw_connection_details · ×8src/ui/tabs/details.rs:1013

MethodTooLong: App.start_capture_thread · ×5src/app/capture.rs:589

TooManyFields: Theme · ×4src/ui/theme/derive.rs:16

TooManyMethods: App · ×3src/app/state.rs:68

+ 2 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

Resolve the 12 FileTooLong finding(s) in God Classes — start with state.rs (2), details.rs, overview.rs. — One of this dimension's main actionable groups (12 warning-level).
Resolve the 8 FunctionTooLong finding(s) in God Classes — start with activity.rs (2), details.rs, overview.rs. — One of this dimension's main actionable groups (8 warning-level).
Resolve the 5 MethodTooLong finding(s) in God Classes — start with capture.rs (2), enrichment.rs, schema.rs. — One of this dimension's main actionable groups (5 warning-level).
Enforce God Classes in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.

Do you agree with this assessment?

D4 · Code Duplication10.0 / 10Stronggated by 8 serious findings✓ Tool-verified

What it measures: Copy-pasted code that should be shared instead.

Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), density-scored per KLoC of production code. Deterministic.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Verified

7 duplicated block group(s) detected. One further row reports members as variants of one another; it aggregates block groups already counted above and is not itself counted.

Duplicated block (7 lines × 2) · ×3crates/rustnet-core/src/network/tracker.rs:582

Members sharing a duplicated core (4 members, 50+ identical tokens)src/ui/theme/definitions.rs:459

Duplicated block (12 lines × 3)src/ui/theme/definitions.rs:475

Duplicated block (10 lines × 2)crates/rustnet-host/src/freebsd/process.rs:69

Duplicated block (8–9 lines × 2)crates/rustnet-core/src/network/parser.rs:814

+ 1 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

Resolve the 3 Duplicated block (7 lines × 2) finding(s) in Code Duplication — start with tracker.rs, loader.rs, graph.rs. — One of this dimension's main actionable groups (3 warning-level).
Resolve the 1 Members sharing a duplicated core (4 members, 50+ identical tokens) finding(s) in Code Duplication — start with definitions.rs. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 Duplicated block (12 lines × 3) finding(s) in Code Duplication — start with definitions.rs. — One of this dimension's main actionable groups (1 warning-level).
Enforce Code Duplication in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.

Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.

Do you agree with this assessment?

D5 · Coupling5.2 / 10Adequate✓ Tool-verified

What it measures: Whether volatile projects sit underneath others that depend on them (so their churn ripples upward), and whether project dependencies form cycles. A widely-depended-on but stable shared/kernel project is healthy, not penalised.

Method: Dependency cycles via elementary-DFS over real .csproj references, plus Martin instability (afferent/efferent) per project. Exhaustive over the reference graph, deterministic.

Coverage: Exhaustive · type-level: afferent/efferent coupling + cycles computed over every production type — the population is all types, not a name convention.

Maturity: Documented → Verified → Prevented · effective 5.2 / 10 · rule-coverage 100% · ceiling Prevented

5 production modules (Cargo), 0 dependency cycle(s), 0 unstable depended-on module(s). Read from the build's own module declarations; 3 module(s) off the main sequence.

Off the main sequence: rustnet-capture · ×3

What to do

Resolve the 3 Off the main sequence finding(s) in Coupling. — One of this dimension's main actionable groups (3 warning-level).
Enforce Coupling in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

Detailed fixes: d5_recommendation.md · top locations in Appendix A, every location in findings.md.

Do you agree with this assessment?

D6 · Cohesion (LCOM4)10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether a class's methods are focused on a single responsibility.

Method: LCOM4 cohesion per production class with at least two methods: connected components of methods sharing state or calls, computed syntactically. Deterministic, not a proxy.

Coverage: Exhaustive · type-level: LCOM4 cohesion computed over every production class — the population is all types, not a name convention.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Verified

0 of 71 classes have LCOM4 above 3.

✓ On the Gold path — maintain.

Detailed fixes: d6_recommendation.md.

Do you agree with this assessment?

D9 · Test Distribution10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether the test suite has a healthy mix of unit / integration / end-to-end tests.

Method: Test projects classified (Unit/Integration/BDD/E2E) from compiled metadata; test methods counted exhaustively across projects with placement-agnostic disk fallback. Deterministic.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

1320 test methods: 1306 unit, 14 integration, 0 BDD, 0 e2e. The Rust suite contributes 1320 `#[test]` function(s) across 130 file(s) declaring at least one; its unit/integration split is Cargo's own — 4 of those file(s) are integration-test targets under a crate's tests/ directory, and the rest are #[test] functions compiled into the crate they test.

✓ On the Gold path — maintain.

Detailed fixes: d9_recommendation.md.

Do you agree with this assessment?

D12 · Dependency Hygiene9.8 / 10Exemplary✓ Tool-verified

What it measures: Whether dependencies are current, secure, and not bloated.

Method: Manifest scan via dotnet list package across all projects; worst-signal-per-package deduction (saturating for vulnerabilities, capped-linear for deprecation/outdated) per KLoC. Exhaustive, deterministic.

Maturity: Documented → Verified → Prevented · effective 9.8 / 10 · rule-coverage 100% · ceiling Verified

3 outdated, 0 yanked direct Cargo dependencies. Only DIRECT edges are graded: a transitive crate cannot be moved past what its parent's requirement admits, so reporting one would be advice its owner cannot take. A newer release is reported only where this repository's OWN requirement already admits it, so the remedy is `cargo update` and never a manifest edit — which means a release outside the declared range is deliberately NOT charged, because a written-down constraint is a decision rather than a defect. Note that a bare requirement is a CARET, and for a 0.x crate its ceiling is the minor. Whether any crate is UNMAINTAINED is not graded — crates.io publishes no maintenance status, and release age does not stand in for one. Known CVEs in this dependency graph are D30's question, read from Cargo.lock there.

Outdated: aes · ×3

✓ On the Gold path — maintain.

Detailed fixes: d12_recommendation.md · top locations in Appendix A, every location in findings.md.

Do you agree with this assessment?

D13 · Secret Scanning10.0 / 10Exemplary○ Nothing flagged

What it measures: Whether any secrets (keys, tokens, passwords) have leaked into the code.

Method: In-process native secret scanner (entropy plus signature patterns) across all tracked files; no external tool. A clean result is a measured 10, not no-data zero. Deterministic.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Prevented

Secret scan ran and found no leaked secrets.

✓ On the Gold path — maintain.

Detailed fixes: d13_recommendation.md.

Do you agree with this assessment?

D15 · Churn × Complexity Hotspots9.3 / 10Stronggated by 22 serious findings✓ Tool-verified

What it measures: Files that change often and are also complex — the riskiest hotspots.

Method: Per production file churn times cyclomatic complexity over a rolling window, computed from git and Roslyn/JS/Razor analysis. Exhaustive, deterministic per commit date.

Maturity: Documented → Verified → Prevented · effective 9.3 / 10 · rule-coverage 100% · ceiling Documented

Top hotspots: src/ui/tabs/details.rs (43×94=4042); src/ui/mod.rs (47×17=799); src/ui/tabs/overview.rs (21×33=693)

Hotspot: src/ui/tabs/details.rs · ×22src/ui/tabs/details.rs:1013

What to do

Resolve the 22 Hotspot finding(s) in Churn × Complexity Hotspots — start with mod.rs (3), details.rs, overview.rs. — One of this dimension's main actionable groups (22 warning-level).

Detailed fixes: d15_recommendation.md · top locations in Appendix A, every location in findings.md.

Do you agree with this assessment?

D17 · Explicit Debt10.0 / 10Stronggated by 1 serious finding✓ Tool-verified

What it measures: Acknowledged debt left in the code — TODOs, dead code, suppressed warnings.

Method: Roslyn syntactic debt markers (suppressions/TODO/FIXME/HACK/empty-catch/commented-code/Obsolete) plus SymbolFinder dead-code analysis; weighted-debt-per-KLoC density deducted 2.0x per unit. Deterministic, exhaustive.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Prevented

1 deducted task-comment markers across 71580 LoC (0.0/KLoC) → score 10.0. Task comments only: this repository's language is read without a compiler, so D17's suppression, dead-code and commented-out-code arms did not run and this score counts fewer marker kinds than a .NET repository's would.

TodoCommentcrates/rustnet-sandbox/src/linux/landlock.rs:188

What to do

Resolve the 1 TodoComment finding(s) in Explicit Debt — start with landlock.rs. — One of this dimension's main actionable groups (1 warning-level).
Enforce Explicit Debt in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

Detailed fixes: d17_recommendation.md · top locations in Appendix A, every location in findings.md.

Do you agree with this assessment?

D19 · Documentation QualityExemplary◐ Sampled · advisory

What it measures: Whether the project's documentation is clear, complete, and useful.

Method: Judged by language model at low temperature (0.0-0.1) on a deterministic doc sample (READMEs plus first 25 architecture docs), with two-pass stability filtering. Advisory, sampled.

Maturity: Documented → Verified → Prevented · effective Exemplary / 10 · rule-coverage 100% · ceiling Documented

RustNet's documentation is clear and complete for its repository-level root README (installation, v1.6.0 highlights, PPA packaging), plus two architecture/dependency docs (Crate Structure, multi-threaded design). The READMEs of the debian/, crates/rustnet-capture/, crates/rustnet-core/, crates/rustnet-host/, and resources/packaging/ directories each document their own deploy/tier, not the repository, so no repository-wide overview/contribution guidance is flagged. All visible documents are well-structured with headings; one clipped section (the full architecture outline) exists for every named heading, so none is considered missing.

✓ On the Gold path — maintain.

Detailed fixes: d19_recommendation.md.

Do you agree with this assessment?

D20 · ADR Quality0.0 / 10Critical✓ Tool-verified

What it measures: Whether architecture decisions are recorded well (context, decision, consequences).

Method: Per-ADR judgment by language model at low temperature with two-pass stability; confidence is share of ADRs evaluated; enforcement-field presence detected deterministically. Advisory.

Maturity: Documented → Verified → Prevented · effective 0.0 / 10 · rule-coverage 100% · ceiling Documented

No architecture decision records were found.

No ADRs found

What to do

Resolve the 1 No ADRs found finding(s) in ADR Quality. — One of this dimension's main actionable groups (1 recommendation-level).

Detailed fixes: d20_recommendation.md · top locations in Appendix A, every location in findings.md.

Do you agree with this assessment?

D21 · Naming ConsistencyExemplary◐ Sampled · advisory

What it measures: Whether names — types, methods, variables — are clear and consistent.

Method: Judged by language model at low temperature (0.0-0.1) on a deterministic random symbol sample (fixed size, not exhaustive), with disclosed confidence band. Advisory, sampled.

Maturity: Documented → Verified → Prevented · effective Exemplary / 10 · rule-coverage 100% · ceiling Verified

0 naming inconsistencies across 0 sampled symbols.

✓ On the Gold path — maintain.

Detailed fixes: d21_recommendation.md.

Do you agree with this assessment?

D22 · Internal API ConsistencyAdequate◐ Sampled · advisory

What it measures: Whether the internal API surface is consistent and coherent.

Method: Judged by language model at low temperature over a sample of the public API surface (IsPackable or .Contracts types). Sampled, advisory; confidence discounted by model uncertainty.

Maturity: Documented → Verified → Prevented · effective Adequate / 10 · rule-coverage 100% · ceiling Verified

4 API inconsistencies across a 400-member sample of 210 exposed types.

Redundant packet parsing/consumption operations. `PacketReader` appears to be a high-level stream consumer that yields packets, while `PacketParser` is a stateful parser that transforms raw bytes into `ParsedPacket`. However, `PacketReader` likely wraps or uses a parser internally. The existence of both `next_packet` (streaming) and explicit `parse_packet` (stateless/stateful transformation) creates confusion about whether the user should use the Reader for consumption or the Parser for transformation. Furthermore, `parse_packet_with_refresh` and `parse_packet` differ only by an internal side-effect (refreshing IPs), which is an implementation detail leaking into the API surface.

Inconsistent naming for drop metrics. `capture_drops` and `interface_drops` are specific, but `total_dropped` is ambiguous. Does it sum the previous two? Or is it a different metric? The naming convention shifts from specific source (`capture`, `interface`) to a generic aggregate (`total`), which is inconsistent with the other two methods. Additionally, `total_dropped` sounds like a property or a sum, whereas the others are specific counters.

Redundant availability checking. `is_available()` likely checks if the resolver is initialized and has data. `get_status()` returns a tuple of three booleans, which likely includes availability plus other states (e.g., DB loaded, cache ready). However, exposing a raw tuple `(bool, bool, bool)` is poor API design compared to a typed struct or enum, and it overlaps with the simple `is_available()` check. Users calling `is_available()` might not need the full status, but the existence of both suggests unclear responsibility for state reporting.

Inconsistent builder pattern naming. `with_defaults` and `with_defaults_deferred` suggest a builder pattern, but `try_with_defaults` returns a `Result` and likely constructs the resolver directly. This mixes builder-style fluent methods with constructor-style methods. `with_defaults_deferred` is also a confusing name; it's unclear what 'deferred' means in this context (lazy initialization? async?).

What to do

Resolve the 1 Redundant packet parsing/consumption operations. `PacketReader` appears… finding(s) in Internal API Consistency. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 Inconsistent naming for drop metrics. `capture_drops` and… finding(s) in Internal API Consistency. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 Redundant availability checking. `is_available()` likely checks if the… finding(s) in Internal API Consistency. — One of this dimension's main actionable groups (1 warning-level).

Detailed fixes: d22_recommendation.md · top locations in Appendix A, every location in findings.md.

Do you agree with this assessment?

D26 · Project Cohesion6.0 / 10Adequate✓ Tool-verified

What it measures: Whether each project is a focused, coherent unit rather than an oversized grab-bag.

Method: Project size overshoot penalties (LoC / public-type count / namespace count, 2-of-3 flag) weighted by log magnitude. Exhaustive across projects, deterministic, LLM-independent.

Maturity: Documented → Verified → Prevented · effective 6.0 / 10 · rule-coverage 100% · ceiling Documented

1 of 5 build units (Cargo) flagged as possibly oversized/incoherent.

Projects may be oversized for their cohesion

What to do

Resolve the 1 Projects may be oversized for their cohesion finding(s) in Project Cohesion. — One of this dimension's main actionable groups (1 recommendation-level).

Detailed fixes: d26_recommendation.md · top locations in Appendix A, every location in findings.md.

Do you agree with this assessment?

D28 · Secrets (history)10.0 / 10Exemplary○ Nothing flagged

What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.

Method: Secret scan via TWO gitleaks detect passes in an isolated checkout — the full git history, then a second --no-git pass over the working tree as it stands — merged and de-duplicated by (rule, file, line); each match flagged High. Both invocations are recorded in the audit trail. Exhaustive; when the tool is absent, or when its output cannot be parsed into the expected shape, the dimension is WITHHELD as an explicit measurement gap on our side — unscored and excluded from the lens, never a hedged middling score.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

gitleaks scanned the full history AND the current working tree and found no secrets.

✓ On the Gold path — maintain.

Detailed fixes: d28_recommendation.md.

Do you agree with this assessment?

D29 · Static Analysis (SAST)0.1 / 10Critical✓ Tool-verified

What it measures: Real static-analysis (SAST) findings — likely security bugs in the code, any language.

Method: Polyglot static analysis via semgrep across the repo using the pinned, image-baked p/security-audit + p/owasp-top-ten rulesets (no scan-time registry fetch); severity rules (ERROR/WARNING/INFO) map to a full-band severity-weighted score. Exhaustive, deterministic; degrades on parse failure.

Coverage: semgrep pattern rules over all files — exhaustive for the rule set, blind to classes of bug without a rule (clean = no rule matched).

Maturity: Documented → Verified → Prevented · effective 0.1 / 10 · rule-coverage 100% · ceiling Documented

33 finding(s): 0 critical, 33 high, 0 medium, 0 low. 6 unpinned-GitHub-Actions row(s) are reported here but scored by D36 (supply-chain provenance), which measures that posture as `pinned_actions` — one pinning decision is charged once, not once per lens. semgrep hit a parse error in 1 file(s) — `crates/rustnet-sandbox/src/macos/seatbelt.rs` (line 55, line 64) — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them. Separately, one or more rules could not re-parse an embedded snippet in 10 file(s) (e.g. a workflow `run:` block read as shell). Those files WERE scanned and their other rows are unaffected; only those rules' view of those snippets is missing.

REDACTED

+ 4 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

Resolve the 6 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (4), REDACTED (2). — One of this dimension's main actionable groups (6 issue-level).
Resolve the 6 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (3), REDACTED, REDACTED. — One of this dimension's main actionable groups (6 issue-level).
No action in Static Analysis (SAST) — all 6 REDACTED finding(s) are reported here at file:line but scored by D36 (supply-chain provenance), so none is charged to this dimension. — One of this dimension's main actionable groups (6 issue-level, 0 of them charged here).

Detailed fixes: d29_recommendation.md · top locations in Appendix A, every location in findings.md.

Do you agree with this assessment?

D30 · Dependency Vulnerabilities10.0 / 10Exemplary○ Nothing flagged

What it measures: Whether any dependency has a known published vulnerability (CVE), direct or transitive, in ANY ecosystem the repository declares — Dart pub, Elixir and Erlang via Hex, Go modules, Java and Kotlin via Maven/Gradle, JavaScript/npm, .NET/NuGet, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift.

Method: Dependency-CVE scan across every ecosystem the repository declares, scored ONCE. Three sources are unioned and deduplicated by advisory identity (rule id + alias closure, CVE<->GHSA) scoped to package+version, keeping the worst severity: `osv-scanner --recursive` over osv.dev for Dart pub, Elixir/Hex (and Erlang, whose `rebar.lock` syft first converts to a CycloneDX SBOM the scanner reads, with rows attributed back to the lock), Go, Java and Kotlin via Maven/Gradle (and Scala, whose sbt build's pinned direct declarations are written into a CycloneDX SBOM the scanner reads, with rows attributed back to the build file), npm, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift; `trivy fs --scanners vuln` for npm lockfiles; and `dotnet list package --vulnerable --include-transitive` for NuGet (with per-advisory collapse of the project x target-framework fan-out), plus a DECLARED-dependency arm that resolves a published gem's gemspec against rubygems.org where no Gemfile.lock is committed. `SeverityScore(c,h,m,l, normalizer 8.0)`. NotApplicable only when NO ecosystem is readable; if any applicable ecosystem could not be scanned the findings are REPORTED and the score is withheld. Supersedes the npm and OSV arms, retired 2026-09-05.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

No known-vulnerable dependencies in any ecosystem this repository declares.

✓ On the Gold path — maintain.

Detailed fixes: d30_recommendation.md.

Do you agree with this assessment?

D31 · IaC & Container Security8.9 / 10Adequategated by 3 critical findings✓ Tool-verified

What it measures: Whether Dockerfiles / Terraform / Kubernetes config follow security best practices.

Method: IaC/container misconfiguration scan via trivy config (REDACTED/Terraform/K8s/Helm/CloudFormation); severity rules to 0-10 moderate normalizer. NotApplicable without manifests. Exhaustive, deterministic.

Maturity: Documented → Verified → Prevented · effective 8.9 / 10 · rule-coverage 100% · ceiling Documented

4 finding(s): 0 critical, 3 high, 1 medium, 0 low.

REDACTED

What to do

Resolve the 3 High IaC finding(s) in IaC & Container Security — start with REDACTED (2), REDACTED. — One of this dimension's main actionable groups (3 issue-level).
Resolve the 1 Medium IaC finding(s) in IaC & Container Security — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).

Detailed fixes: d31_recommendation.md · top locations in Appendix A, every location in findings.md.

Do you agree with this assessment?

D34 · Knowledge Freshness10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether anyone still has living knowledge of each file, or it has been orphaned — last understood long ago by someone now gone quiet. The sibling of the bus factor: D16 asks who owns it, D34 asks whether anyone still knows it.

Method: File orphaning as total living-knowledge decay below one focused-commit's worth within a year, computed per-file from the D16 decay model. Exhaustive, deterministic over fixed history.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

Every significant source file has living knowledge — recently and meaningfully worked. Counted over 145 of the 169 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

✓ On the Gold path — maintain.

Detailed fixes: d34_recommendation.md.

Do you agree with this assessment?

D35 · Change Coupling9.9 / 10Adequategated by 1 critical finding✓ Tool-verified

What it measures: Whether files that change together actually belong together — pairs that repeatedly co-change in git history despite having no explicit code dependency, surfacing the hidden/logical coupling (and boundaries in the wrong place) a static scan can't see.

Method: Pairwise co-occurrence over the per-commit file sets in git history (production source only — tests and generated dropped): Degree-of-Coupling = shared ÷ min individual revisions, reported above noise floors (each file ≥10 revisions, ≥5 shared commits, ≥50% strength); sweeping commits excluded. Deterministic over fixed history.

Coverage: Population: PRODUCTION source files only — test and generated files are dropped before pairing, so a class co-changing with its own test (trivially ~100%) can't drown the real production↔production coupling. Pairs ranked by Degree-of-Coupling. A non-source file is never a coupling PARTICIPANT either: documentation, schemas, config and data files are dropped with the rest, so a code↔docs pair — a command and the reference page that restates it — is not reported however strongly the two co-change; nor is coupling that runs THROUGH a build step or config file.

Maturity: Documented → Verified → Prevented · effective 9.9 / 10 · rule-coverage 100% · ceiling Documented

Strongest change-coupling: tracker.rs↔details.rs 75%

Boundary-crossing change coupling: tracker.rs ↔ details.rscrates/rustnet-core/src/network/tracker.rs

What to do

Resolve the 1 Boundary-crossing change coupling finding(s) in Change Coupling — start with tracker.rs. — One of this dimension's main actionable groups (1 issue-level).

Detailed fixes: d35_recommendation.md · top locations in Appendix A, every location in findings.md.

Do you agree with this assessment?

D36 · Supply-chain Provenance & Signing5.0 / 10Adequate✓ Tool-verified

What it measures: Whether the build pipeline provides supply-chain integrity — generated provenance/attestation, signed artifacts (cosign/sigstore), an SBOM, and pinned build actions. Presence of the configuration, not a runtime guarantee.

Method: Supply-chain provenance/signing read deterministically from CI/build config (.github/workflows, .gitlab-ci.yml, azure-pipelines, Jenkinsfile, .circleci) + the release surface: four signals — generated provenance/attestation (SLSA/in-toto/actions-attest), artifact signing (cosign/sigstore/gitsign), an SBOM (syft/sbom-action/*.spdx.json/*.cdx.json), and SHA-pinned build actions — scored 10·present/denom. NotApplicable without a build pipeline. Detects configuration presence, not runtime enforcement.

Maturity: Documented → Verified → Prevented · effective 5.0 / 10 · rule-coverage 100% · ceiling Documented

2/4 supply-chain integrity signals present (provenance, signing, SBOM, pinned actions).

REDACTED

What to do

Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 recommendation-level).

Detailed fixes: d36_recommendation.md · top locations in Appendix A, every location in findings.md.

Do you agree with this assessment?

D37 · Vulnerability-disclosure Policy10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether the repository publishes a coordinated-vulnerability-disclosure policy (SECURITY.md or security.txt) with a reporting contact, so finders know how to report a vulnerability. Presence of a policy file with a contact, not whether the policy is adequate or honoured.

Method: Vulnerability-disclosure policy read deterministically from the repo: a SECURITY.md (root/.github/docs) or .well-known/security.txt / security.txt, regex-checked for a reporting contact (email / URL / mailto). Present + contact → 10; present without a contact → 4; NotApplicable when no policy file exists (it may live off-repo). Detects the policy file's presence + contact, not its adequacy.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

A vulnerability-disclosure policy (SECURITY.md) is published with a reporting contact.

✓ On the Gold path — maintain.

Detailed fixes: d37_recommendation.md.

Do you agree with this assessment?

D43 · Malicious Dependencies10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether any dependency the repository declares is published as MALICIOUS rather than merely vulnerable — a package that is an attacker's work, in any ecosystem osv-scanner reads. Scored apart from D30 because the answer is binary: there is no safe version to upgrade to, and the fix is to remove the package and rotate every credential it could have read.

Method: The same dependency scan D30 reads, partitioned on the scanner's own classification rather than rescanned: a row is MALICIOUS when its id is in the `MAL-` space (the ossf/malicious-packages feed) OR its `database_specific.cwe_ids` carries `CWE-506` ("Embedded Malicious Code"). Both channels are structural; the summary text is deliberately NOT read, because a malicious-package record whose summary says only "Critical severity vulnerability" is a real shape ([GHSA redacted]) and a text matcher misses it. Scored BINARY: any surviving row is 0, whatever its severity and however many CVEs sit beside it — a hostile dependency is not a quantity. Applicability and degradation are D30's: NotApplicable only when no ecosystem is readable, and an unscannable ecosystem degrades rather than reading clean. SCORED, not informational.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

No dependency in any ecosystem this repository declares is published as malicious.

✓ On the Gold path — maintain.

Detailed fixes: d43_recommendation.md.

Do you agree with this assessment?

D44 · Platform End-of-Life10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether anyone still ships security patches for the platform this repository RUNS ON — the runtime it pins and the framework majors its own constraints hold it to. Separate from D12 because the question differs: a current Django on an end-of-life Python is perfectly up to date and completely unsupported, and the fix is a migration rather than a version bump. What the repository says it merely SUPPORTS is never charged.

Method: End-of-life PLATFORM read from the repository's own declarations and graded against a FROZEN, dated table of vendor support dates — no network, no feed, no API, so this dimension answers identically inside a closed scan fence. Two subjects: a RUNTIME the project pins (a single or all-end-of-life TargetFramework, a .nvmrc or .python-version, a requires-python CAP) and a FRAMEWORK major a dependency constraint cannot move off (a caret, tilde or exact version; `vue@^2.7.16` pins Vue 2). A FLOOR is deliberately never charged — `requires-python = ">=3.8"` states what a package SUPPORTS, not what it runs on — and a multi-target project is charged only when EVERY target is out of support. Runtime 4.0/product capped 8.0, framework 1.5 capped 4.5. The table is safe to freeze because a statement about support that ended in the past cannot become false: it loses recall as it ages, never precision, and a test asserts every entry predates the freeze date. Disjoint from D31 (a container image's OS layer) and D29 (the toolchain a CI workflow installs). Abstains when the repository declares no platform this pass reads — never scores it clean.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

0 end-of-life runtime(s) and 0 end-of-life framework(s), read from 1 platform declaration(s) and 0 dependency declaration(s). This dimension reads what the repository says about ITSELF — a pinned target framework, a version file, a capped requires-python, a Rust toolchain pin, a framework major a constraint cannot move off. A FLOOR is deliberately never charged: `requires-python = ">=3.8"` states what the package SUPPORTS, not what it runs on, and a well-maintained library declares exactly that while running its own CI on a current release. The end-of-life facts are FROZEN and dated, so this dimension needs no network and answers identically inside a closed scan fence; as the table ages it loses recall and never precision, because a statement about support that ended in the past cannot become false. The OS layer of a container image is D31's question and the toolchain a CI workflow installs is D29's; this row is neither.

✓ On the Gold path — maintain.

Detailed fixes: d44_recommendation.md.

Do you agree with this assessment?

Frontend & cross-cutting dimensions

R = React/JS · M = Maturity · P = Readiness.

AX10 · Code composition9.9 / 10Exemplary✓ Tool-verified

Other · Architecture — How the codebase splits by code ROLE — domain, application, infrastructure, test, generated. The significance map behind the knowledge/coupling weighting, and a DDD signal in its own right: a thin domain core under fat infrastructure is the anemic-domain smell, quantified. How each file's role is decided, because the split is only as good as that: a generated name or a build-output tree makes it Generated, a test project makes it Test, and otherwise the file's NAMESPACE and PATH words are matched against fixed vocabularies in a fixed ORDER — domain, then infrastructure, then application — so a file whose words hit two layers is counted under the earlier one. A production file matching none of them counts as application, so that share reads 'application or unclassified' rather than a measured application layer. Roles come from naming convention, never from what the code does. On this repository the split was taken from the source tree on disk rather than from a loaded .NET workspace, so a file's role is decided by its PATH segments alone — no declared namespace was available to add to the evidence — and generated output is excluded from the census entirely rather than counted as a generated share.

Method: Roslyn line-count by code ROLE: every source file classified Domain/Application/Infrastructure/Test/Generated by namespace + path convention (the shared CodeRoleClassifier), then significant lines summed per role. Deterministic; the advisory score is the business-logic (domain+application) share of production code.

Coverage: Population: ALL source files, each bucketed into ONE of five roles (Domain/Application/Infrastructure/Test/Generated) by namespace + path convention — a file whose layer isn't named in the convention falls to Application (the neutral default), and the split is line-count, not semantic depth or business value.

What to do

The domain core is a small share of production code, but most of the rest matched no layer vocabulary at all — so this is not yet an anemic-domain finding. The namespace/path convention could not place that code, which makes the composition above a statement about the naming, not about the design. Name the layers (or check that the repository's conventions differ from the ones this check knows) before reading a thin domain into it.

Do you agree with this assessment?

AX3 · Project dependency cycles10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether the project-reference graph is acyclic (cycles block independent build/deploy and signal eroding boundaries).

Method: Project reference cycles via elementary-DFS over real .csproj references, using the engine shared with D5/D7; cyclic versus acyclic. Exhaustive, deterministic.

Do you agree with this assessment?

AX4 · Dependency direction10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether dependencies point inward (Domain ← Application ← Infrastructure/Web) — the clean-architecture dependency rule, checked across the project graph.

Method: Layer violations by name-segment inference (Domain/Core to Application to Infrastructure/Web) over the project-reference graph. Exhaustive over all projects, deterministic.

Do you agree with this assessment?

AX9 · CQS / query purity10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether read (query) handlers stay side-effect-free — a query that writes persistent state or raises events breaks CQS and makes reads unsafe to retry, cache, or route to a read replica.

Method: Roslyn scan: CQRS handlers classified query-vs-command by interface (IQueryHandler/ICommandHandler/IRequestHandler<TQuery,TResult>) and name convention (*Query/Get*/Find* vs *Command); each query handler's body checked for persistent-state writes (SaveChanges/repository Add-Update) or event publishes by resolved invocation. Deterministic, type-level, exhaustive over the detected handlers.

Coverage: Population: CQRS handlers identified by IQueryHandler/ICommandHandler/IRequestHandler interface + *Query/Get*/Find*/*Command NAME convention; query purity then checked exhaustively within that set — a query handler using neither convention is invisible, and mutation is a resolved persistence/publish CALL, not full dataflow.

Do you agree with this assessment?

M1 · Documentation (README)8.7 / 10Strong✓ Tool-verified

Maturity · Maturity — Whether the repo and its projects have a README, and whether it's substantive and current.

Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.

What to do

Add a 'Testing' section to the root README — how to run the test suite.
Add an 'Architecture' / 'How it works' section to the root README — the high-level shape.

Do you agree with this assessment?

M2 · Architecture documentation5.0 / 10Adequate✓ Tool-verified

Maturity · Maturity — Whether key decisions (ADRs) and the high-level shape (C4/diagrams) are written down.

Method: Filesystem scan: ADR folder/naming conventions or content, plus Mermaid/PlantUML/C4/architecture.md discovery. Exhaustive, deterministic.

No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` 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.

What to do

Record significant decisions one document per decision — dated, stating the context, the decision and its consequences — and keep them together wherever your design docs already live (a conventional `docs/adr/` tree, with each file named `NNNN-title` in whatever markup those docs already use, is the most discoverable form).

Do you agree with this assessment?

M3 · Folder & project structure10.0 / 10Exemplary✓ Tool-verified

Maturity · Maturity — Whether the repo is organised deliberately — src/test separation and consistent project naming.

Method: Filesystem scan: src/test folder separation and namespace-prefix consistency (majority RootNamespace agreement). Exhaustive across projects, deterministic.

Do you agree with this assessment?

M4 · Documentation accuracy10.0 / 10Exemplary◐ Sampled · advisory

Maturity · Maturity — Whether the README actually describes the code that exists (LLM-judged, advisory).

Method: Judged by language model at low temperature: README accuracy versus actual projects, within a disclosed tolerance. Advisory, not a measured number.

Do you agree with this assessment?

P1 · CI/CD gates10.0 / 10Exemplary○ Nothing flagged

Readiness · Readiness — Whether an automated pipeline builds and tests every change.

Method: Filesystem scan: CI workflow files (.github/workflows, .gitlab-ci.yml, etc.) for build and test stages. Exhaustive, deterministic.

Do you agree with this assessment?

P10 · Library API & versioning10.0 / 10Exemplary○ Nothing flagged

Readiness · Readiness — For a library: a deliberate (small) public API surface and explicit semantic versioning so consumers can depend on it safely.

Method: Roslyn scan: public API surface area and semantic-versioning markers (SemVer attributes, changelog entries) for libraries; off .NET, a library is the ecosystem's publication act (an npm package that is not private and names an entry point, a PyPI distribution with a build system, a Rust library crate, a Maven/Gradle module that publishes, a Go module with no package main, a gemspec, a Composer library, a SwiftPM library product, a pub.dev or Hex package), its surface is the share of types the language model records as public (Rust, Swift, Java, Kotlin, Go, Dart; not measured where the model records no type visibility or, as in TypeScript, only module-level export), and its version is read from the manifest, a semver CHANGELOG, release tooling or semver git tags. Exhaustive, deterministic.

Do you agree with this assessment?

P2 · Observability7.0 / 10Strong✓ Tool-verified

Readiness · Readiness — Whether the code is diagnosable in production — structured logging, tracing/metrics, health checks.

Method: Filesystem/Roslyn scan: structured-logging frameworks (Serilog, NLog), OpenTelemetry, and health-check endpoint patterns. Exhaustive, deterministic.

What to do

Consider OpenTelemetry tracing/metrics (opentelemetry with tracing-opentelemetry) and a health-check endpoint (a /health route on your axum/actix router) for operability.

Do you agree with this assessment?

P3 · Security & performance tooling8.0 / 10Strong✓ Tool-verified

Readiness · Readiness — Whether SAST, secret/dependency scanning and performance benchmarking are wired in (presence, not runtime).

Method: Filesystem scan: SAST configuration, dependency-update automation, secret scanning, and a benchmark harness or benchmark step — in this repository's own ecosystem. Exhaustive, deterministic.

What to do

Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.

Do you agree with this assessment?

P4 · Deployment & Rollback7.0 / 10Strong✓ Tool-verified

Readiness · Readiness — Whether releases are automated and safely reversible (probes, rolling updates, approval gates) — from manifests/pipeline files, not the live environment.

Method: Filesystem scan: deployment manifests/IaC (K8s YAML, Helm, Terraform) for rolling updates, probes, approval gates, migration hooks. Exhaustive, deterministic.

Do you agree with this assessment?

P6 · Release Hygiene10.0 / 10Exemplary✓ Tool-verified

Readiness · Readiness — Whether releases are traceable — a maintained changelog and explicit version stamping.

Method: Filesystem scan: changelog file presence and version tags in csproj or git tags. Exhaustive, deterministic.

Do you agree with this assessment?

PF1 · Benchmark discipline8.5 / 10Strong✓ Tool-verified

Readiness · Performance — Whether the code protects its performance with benchmarks — a benchmark suite, allocation/memory measurement, and (ideally) a CI gate. Presence is credited as a bonus, never a deduction.

Method: Repo + source scan: BenchmarkDotNet referenced (csproj/source), [Benchmark]/[MemoryDiagnoser] attribute counts, and a benchmark step in CI; off .NET, the same ladder over Go testing.B, Rust criterion/#[bench]/divan, JMH/kotlinx-benchmark, pytest-benchmark/asv/pyperf, tinybench/mitata/vitest bench/benchmark.js and Swift package-benchmark — scored as a bonus ladder (absence is neutral, never a deduction). Deterministic, presence detection.

Do you agree with this assessment?

Reference — by lens

The score is the rank-weighted fold of these lenses (worst-heaviest), each including its meta-dimensions; a lens with a Critical contributor is capped at Fair (its band reads "gated by …") and is never the strongest area however high its average.

Lens	Score	Rating	Impact
Code Health	83%	Adequate — gated by D2	Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Architecture	92%	Exemplary	Strongest area.
Maturity	80%	Strong	Largest drag on the score — prioritise here.
Readiness	83%	Strong	Solid.
Security	80%	Adequate — gated by D29	Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Performance	85%	Strong	Solid.

Unscored — 2 check(s) recorded observations but carry no score

These checks ran and found something, but they do not carry a score — either by design (an advisory check reports evidence rather than grading it) or because they could not be scored here. They are excluded from the score for that reason, not because there was nothing to see.

X7 Silent fallback defaults — 1 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X9 Subsumed condition operand — 1 observation(s) recorded · Advisory — this card reports evidence and never carries a score.

Not evidenced — 4 control(s) we could not find positive evidence for

These checks grade a working control, and the repository shows no evidence of one. That is deliberately not scored as a zero: a repository cannot show an ops runbook, a database TTL or an infrastructure-side audit log, so absence of evidence here is not evidence the control is missing. It is also not a statement that the check is irrelevant to this codebase — the thing it grades applies; we just could not see it. Excluded from the score either way.

C3 Audit Trail — Not assessed: these audit controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks audit controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C4 Data Retention — Not assessed: these retention controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks retention controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C5 Data-Subject Rights — Not assessed: these data-subject rights controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks data-subject rights controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control

Not included — 73 check(s) not relevant to this codebase

These checks had nothing to measure here (no tests, no git history, the codebase is small, or the architecture style doesn't apply), so they're omitted above rather than scored low.

AC1 Text alternatives — No web markup found — accessibility is not applicable to this repository.
AC2 Forms & labels — No web markup found — accessibility is not applicable to this repository.
AC3 Page structure — No web markup found — accessibility is not applicable to this repository.
AC4 Keyboard semantics — No web markup found — accessibility is not applicable to this repository.
AC5 ARIA correctness — No web markup found — accessibility is not applicable to this repository.
AC6 Visual & motion safety — No web markup found — accessibility is not applicable to this repository.
AC7 A11y enforcement — No web markup found — accessibility is not applicable to this repository.
AX1 Captive dependencies — Not applicable: Rust with no dependency-injection crate has no container to hand one lifetime's instance to another — every value is owned by the code that builds it, and the borrow checker rejects a longer-lived value keeping a borrow of a shorter-lived one.
AX2 Stateful singletons — No container singleton was found, so there is no shared instance for concurrent requests to race on. No function in this Python code is served by a threaded web framework (a Flask, Bottle or FastAPI route, a Django or Pyramid view), so no module is shared between request threads. Rust's compiler refuses unsynchronised shared mutation — a value shared across threads must be Sync — so the race this check looks for cannot be written.
AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX6 Interface segregation — not assessed — interface segregation is computed over a type surface that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
AX8 Test isolation — no test/production split to check
AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
AXR1 Runtime accessibility — docker build failed (exit 1) — DEPRECATED: The legacy builder is deprecated and will be removed in a future release. Install the buildx component to build images with BuildKit: https://docs.docker.com/go/bui…; runtime evidence skipped This is a statement about this run, not a statement about your application: nothing here says the surface is inaccessible, only that it was never rendered.
C1 Data Protection — Not assessed: these personal data controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks personal data controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C2 Access Controls — Not assessed: these authorization controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks authorization controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
D10 Test Quality — ~1945 lines of test source are present (.rs) but no test cases reached the test census for this repository — no test root we could resolve declared them, or the files we read declare no cases in a test framework we recognise — so skipped/assertion-free tests couldn't be counted. Not scored — this is a gap in the analyzer, not a finding about this repository.
D11 Test Reliability — Test reliability not included — the .rs suite was found but not re-run
D14 License Compliance — Not scored — this repository's 421 shipped crate(s) were read from its Cargo.lock, but crates.io could not be asked for the licence of 68 of them (HTTP 429 Unknown Error), and a licence verdict over part of a dependency graph is not a licence verdict. Nothing is asserted about this repository's licensing in either direction.
D16 Bus Factor — single-maintainer repository — bus factor is not applicable
D18 Solution Shape — D18 scores the shape of a .NET solution; this repository has no .NET solution or project files, so the dimension does not apply.
D23 Boundary Type-Coupling — No bounded-context organisation was detected either — neither a context-shaped layout nor 2+ sibling source directories each declaring an aggregate root. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
D24 Comment Value — No inline comments to assess — comment value is not applicable here.
D25 ADR Conformance — no ADRs to check
D27 Navigability — symbol resolution incomplete — navigability not assessed
D32 Data Compliance (PII/GDPR) — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.
D39 IL Efficiency — D39 measures the IL emitted by a .NET build; this repository has no .NET solution or project files, so the dimension does not apply.
D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
D7 Architectural Integrity — no checkable ADRs, and no project-reference graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
D8 Code Coverage — Coverage NOT MEASURED: `--collect:"XPlat Code Coverage"` names a data collector that ships in the `coverlet.collector` package, and this repository wires up none — no test project references it and no runsettings declares one. The absence of coverage here is therefore not evidence about the suite or about our analyzer environment: without a collector, `--collect` produces nothing even from a suite that builds and passes. Add a `coverlet.collector` PackageReference to the test project(s) (or commit the Cobertura/OpenCover/lcov report your CI produces) and real coverage will be measured. It is excluded from the score rather than counted as a near-zero defect.
DM1 Domain Modelling — not scored — this repository shows only 1 of the 3 signals this lens looks for (12 value object(s))
ED2 Event/command shape — not scored — deciding whether a command has more than one competing handler requires resolving the call graph, and a call made through an inferred or generic receiver has no resolvable owner in the source. Reported as guidance rather than measured
ED5 Idempotency — This check finds retry-prone mutations (command handlers and message/event consumers) by walking the repository's declared types, and none was loaded here, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
GD1 Unfinished & placeholder code — no source files were read — this check reads C# syntax, and none was loaded for this repository. That is a limit of the analyzer, not a finding about your code.
IC1 Incompleteness & stubs — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, and the automatic-re-run check to any GitHub-Actions workflow, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
P7 Outbound HTTP resilience — not applicable — no HTTP server, API framework or worker entry point was found in the Python, Rust source, so there is no service whose uptime a failing dependency could take down
P8 Schema migrations — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
P9 Domain vs controller coverage — no coverage report found on disk — produce a coverage report in a standard format (lcov — `cargo install cargo-llvm-cov`, then `cargo llvm-cov --lcov --output-path lcov.info`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures, or wire coverage collection into CI, to enable this cross-layer check
PF2 Allocation hygiene — Not applicable: Rust spells out every heap allocation and makes borrowed slices (&[T], &str) its ordinary parameter types, so the allocation-aware style this card rewards elsewhere is the language's baseline rather than a rung to climb.
PF3 Async & latency hygiene — Not applicable: this repository declares no async functions, so there is no asynchronous code for a blocking call to stall.
S1 Web-Security Posture — Not assessed: these web-security controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks web-security controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
X1 Async correctness — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X10 Duplicated predicate — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X12 Unreachable branch — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X13 Undrained process stream — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X14 Bypassable address classification — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X15 Unvalidated length from an untrusted reader — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X16 Unfloored truncation loop — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X17 Uncapped recursion over a caller-supplied document — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X18 Disposal-pattern correctness — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X19 Unrestored process-global state — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X2 Cancellation propagation — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X20 Mistyped argument guard — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X21 Side-effecting pattern guard — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X22 Contradicted release guard — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X23 Unguarded diagnostic materialisation — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X24 Document value interpolated into markup unescaped — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X25 Inert configuration knob — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X26 Unsynchronised callback handoff — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X27 Collection changed while being enumerated — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X28 Index access outside its own emptiness guard — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X29 Per-element action decided by a fixed element — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X3 Exception handling — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X30 Support guard that admits what it rejects — This check reads C# syntax; no C# was loaded for this repository, so it has nothing to report. That is a limit of the analyzer, not a finding about your code.
X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
X4 Structured logging — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X5 Nullable reference types — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.

Appendix A — Findings (grouped)

The findings behind the scores, grouped by severity, then by dimension and kind. The high-severity issues are enumerated in full below; items per group are capped at 25 with any overflow stated explicitly per group, never silently truncated. The complete machine-readable list of every finding (all severities) is the companion findings.md in this report's bundle.

Critical — 37 finding(s)

D29 · Static Analysis (SAST) · REDACTED

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

D29 · Static Analysis (SAST) · REDACTED

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

D29 · Static Analysis (SAST) · REDACTED

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

D29 · Static Analysis (SAST) · REDACTED

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

D29 · Static Analysis (SAST) · REDACTED

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

D31 · IaC & Container Security · High IaC · ×3

REDACTED
REDACTED
REDACTED

D29 · Static Analysis (SAST) · REDACTED · ×2

REDACTED
REDACTED

D29 · Static Analysis (SAST) · REDACTED · ×1

REDACTED

D29 · Static Analysis (SAST) · REDACTED · ×1

REDACTED

D29 · Static Analysis (SAST) · REDACTED · ×1

REDACTED

D35 · Change Coupling · Boundary-crossing change coupling · ×1

Boundary-crossing change coupling: tracker.rs ↔ details.rs crates/rustnet-core/src/network/tracker.rs — `crates/rustnet-core/src/network/tracker.rs` (context crates) and `src/ui/tabs/details.rs` (context ui) sit in DIFFERENT parts of the tree yet change together 75% of the time (9 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — 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) — the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can't see. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are `23b9793f` fix(tcp): apply RFC 7323 window scaling to the displayed window size …; `106ba245` feat: track LLMNR response time (#552); `fef9b3ca` feat(dns): attribute connections to hostnames via observed DNS respon… — run `git show` on any of them.

Serious — 181 finding(s)

D15 · Churn × Complexity Hotspots · Hotspot · ×22

Hotspot: src/ui/tabs/details.rs src/ui/tabs/details.rs:1013 — src/ui/tabs/details.rs changed 43 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 94 in rustnet_monitor::ui::tabs::details::draw_connection_details at line 1013. 9 of those changes were fix/bug commits, and the other 34 changed it for other reasons — 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 — a file this often edited pays the complexity back every time. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 11:31:04 +02:00' --until='2026-09-28 11:31:04 +02:00' --full-history --no-merges -- src/ui/tabs/details.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: src/ui/mod.rs src/ui/mod.rs:302 — src/ui/mod.rs changed 47 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in rustnet_monitor::ui::draw at line 302. 6 of those changes were fix/bug commits, and the other 41 changed it for other reasons — 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 — a file this often edited pays the complexity back every time. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 11:31:04 +02:00' --until='2026-09-28 11:31:04 +02:00' --full-history --no-merges -- src/ui/mod.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: src/ui/tabs/overview.rs src/ui/tabs/overview.rs:895 — src/ui/tabs/overview.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in rustnet_monitor::ui::tabs::overview::draw_stats_panel at line 895. 3 of those changes were fix/bug commits, and the other 18 changed it for other reasons — 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 — a file this often edited pays the complexity back every time. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 11:31:04 +02:00' --until='2026-09-28 11:31:04 +02:00' --full-history --no-merges -- src/ui/tabs/overview.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: crates/rustnet-core/src/network/tracker.rs crates/rustnet-core/src/network/tracker.rs:526 — crates/rustnet-core/src/network/tracker.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in ConnectionTracker::measure_timings at line 526. 5 of those changes were fix/bug commits, and the other 19 changed it for other reasons — 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 — a file this often edited pays the complexity back every time. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 11:31:04 +02:00' --until='2026-09-28 11:31:04 +02:00' --full-history --no-merges -- crates/rustnet-core/src/network/tracker.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: crates/rustnet-core/src/network/types/connection.rs crates/rustnet-core/src/network/types/connection.rs:454 — crates/rustnet-core/src/network/types/connection.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in Connection::state at line 454. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 11:31:04 +02:00' --until='2026-09-28 11:31:04 +02:00' --full-history --no-merges -- crates/rustnet-core/src/network/types/connection.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: crates/rustnet-core/src/network/merge.rs crates/rustnet-core/src/network/merge.rs:116 — crates/rustnet-core/src/network/merge.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in rustnet_core::network::merge::analyze_tcp_segment at line 116. 5 of those changes were fix/bug commits, and the other 14 changed it for other reasons — 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 — a file this often edited pays the complexity back every time. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 11:31:04 +02:00' --until='2026-09-28 11:31:04 +02:00' --full-history --no-merges -- crates/rustnet-core/src/network/merge.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: src/ui/widgets/status_bar.rs src/ui/widgets/status_bar.rs:105 — src/ui/widgets/status_bar.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in rustnet_monitor::ui::widgets::status_bar::view_hints at line 105. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 11:31:04 +02:00' --until='2026-09-28 11:31:04 +02:00' --full-history --no-merges -- src/ui/widgets/status_bar.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: src/ui/connection_table.rs src/ui/connection_table.rs:143 — src/ui/connection_table.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in rustnet_monitor::ui::connection_table::select_columns at line 143. 3 of those changes were fix/bug commits, and the other 17 changed it for other reasons — 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 — a file this often edited pays the complexity back every time. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 11:31:04 +02:00' --until='2026-09-28 11:31:04 +02:00' --full-history --no-merges -- src/ui/connection_table.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: src/app/capture.rs src/app/capture.rs:589 — src/app/capture.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in App::start_capture_thread at line 589. 2 of those changes were fix/bug commits, and the other 7 changed it for other reasons — 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 — a file this often edited pays the complexity back every time. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 11:31:04 +02:00' --until='2026-09-28 11:31:04 +02:00' --full-history --no-merges -- src/app/capture.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: src/app/enrichment.rs src/app/enrichment.rs:160 — src/app/enrichment.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in App::run_process_enrichment at line 160. 1 of those changes was a fix/bug commit, and the other 6 changed it for other reasons — 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 — a file this often edited pays the complexity back every time. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 11:31:04 +02:00' --until='2026-09-28 11:31:04 +02:00' --full-history --no-merges -- src/app/enrichment.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: crates/rustnet-core/src/network/types/protocol_info.rs crates/rustnet-core/src/network/types/protocol_info.rs:277 — crates/rustnet-core/src/network/types/protocol_info.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in ApplicationProtocol::fmt at line 277. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 11:31:04 +02:00' --until='2026-09-28 11:31:04 +02:00' --full-history --no-merges -- crates/rustnet-core/src/network/types/protocol_info.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: src/ui/tabs/activity.rs src/ui/tabs/activity.rs:58 — src/ui/tabs/activity.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in ActivityTab::handle_key at line 58. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 11:31:04 +02:00' --until='2026-09-28 11:31:04 +02:00' --full-history --no-merges -- src/ui/tabs/activity.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: crates/rustnet-core/src/network/dpi/mod.rs crates/rustnet-core/src/network/dpi/mod.rs:189 — crates/rustnet-core/src/network/dpi/mod.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in rustnet_core::network::dpi::analyze_udp_packet at line 189. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 11:31:04 +02:00' --until='2026-09-28 11:31:04 +02:00' --full-history --no-merges -- crates/rustnet-core/src/network/dpi/mod.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: crates/rustnet-host/src/macos/process.rs crates/rustnet-host/src/macos/process.rs:178 — crates/rustnet-host/src/macos/process.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in MacOSProcessLookup::parse_lsof_output at line 178. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 11:31:04 +02:00' --until='2026-09-28 11:31:04 +02:00' --full-history --no-merges -- crates/rustnet-host/src/macos/process.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: crates/rustnet-sandbox/src/linux/mod.rs crates/rustnet-sandbox/src/linux/mod.rs:69 — crates/rustnet-sandbox/src/linux/mod.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in rustnet_sandbox::linux::apply at line 69. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 11:31:04 +02:00' --until='2026-09-28 11:31:04 +02:00' --full-history --no-merges -- crates/rustnet-sandbox/src/linux/mod.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: crates/rustnet-sandbox/src/linux/landlock.rs crates/rustnet-sandbox/src/linux/landlock.rs:138 — crates/rustnet-sandbox/src/linux/landlock.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in rustnet_sandbox::linux::landlock::apply_landlock at line 138. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 11:31:04 +02:00' --until='2026-09-28 11:31:04 +02:00' --full-history --no-merges -- crates/rustnet-sandbox/src/linux/landlock.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: src/tui.rs src/tui.rs:12 — src/tui.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 70 in rustnet_monitor::tui::run at line 12. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 11:31:04 +02:00' --until='2026-09-28 11:31:04 +02:00' --full-history --no-merges -- src/tui.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: src/ui/theme/derive.rs src/ui/theme/derive.rs:102 — src/ui/theme/derive.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in Theme::resolve at line 102. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 11:31:04 +02:00' --until='2026-09-28 11:31:04 +02:00' --full-history --no-merges -- src/ui/theme/derive.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: crates/rustnet-capture/src/lib.rs crates/rustnet-capture/src/lib.rs:408 — crates/rustnet-capture/src/lib.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in rustnet_capture::find_capture_device at line 408. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 11:31:04 +02:00' --until='2026-09-28 11:31:04 +02:00' --full-history --no-merges -- crates/rustnet-capture/src/lib.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: crates/rustnet-core/src/network/filter.rs crates/rustnet-core/src/network/filter.rs:216 — crates/rustnet-core/src/network/filter.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in ConnectionFilter::matches at line 216. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 11:31:04 +02:00' --until='2026-09-28 11:31:04 +02:00' --full-history --no-merges -- crates/rustnet-core/src/network/filter.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: crates/rustnet-core/src/network/dpi/mqtt.rs crates/rustnet-core/src/network/dpi/mqtt.rs:54 — crates/rustnet-core/src/network/dpi/mqtt.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in rustnet_core::network::dpi::mqtt::analyze_mqtt at line 54. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 11:31:04 +02:00' --until='2026-09-28 11:31:04 +02:00' --full-history --no-merges -- crates/rustnet-core/src/network/dpi/mqtt.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: crates/rustnet-core/src/network/dpi/quic/salvage.rs crates/rustnet-core/src/network/dpi/quic/salvage.rs:11 — crates/rustnet-core/src/network/dpi/quic/salvage.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in rustnet_core::network::dpi::quic::salvage::try_parse_unencrypted_crypto_frames at line 11. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-30..2026-09-28, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-06-30 11:31:04 +02:00' --until='2026-09-28 11:31:04 +02:00' --full-history --no-merges -- crates/rustnet-core/src/network/dpi/quic/salvage.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.

D2 · Cognitive Complexity · rustnet_core · ×22

rustnet_core::network::dpi::quic::packet::scan_packet_frames (cognitive 57) crates/rustnet-core/src/network/dpi/quic/packet.rs:532 — rustnet_core::network::dpi::quic::packet::scan_packet_frames has cognitive complexity 57 (threshold 15). Drivers by points: if/else 17 (45 pts), match/switch 2 (5 pts), loops 2 (4 pts), boolean chains 3 (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.
rustnet_core::network::dpi::quic::salvage::try_reconstruct_sni_from_fragments (cognitive 57) crates/rustnet-core/src/network/dpi/quic/salvage.rs:116 — rustnet_core::network::dpi::quic::salvage::try_reconstruct_sni_from_fragments has cognitive complexity 57 (threshold 15). Drivers by points: if/else 19 (45 pts), loops 4 (6 pts), boolean chains 5, match/switch 1 (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.
rustnet_core::network::merge::analyze_tcp_segment (cognitive 53) crates/rustnet-core/src/network/merge.rs:116 — rustnet_core::network::merge::analyze_tcp_segment has cognitive complexity 53 (threshold 15). Drivers by points: if/else 22 (43 pts), match/switch 2 (6 pts), boolean chains 4 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
rustnet_core::network::dpi::quic::salvage::find_hostname_candidates (cognitive 53) crates/rustnet-core/src/network/dpi/quic/salvage.rs:289 — rustnet_core::network::dpi::quic::salvage::find_hostname_candidates has cognitive complexity 53 (threshold 15). Drivers by points: if/else 8 (29 pts), loops 5 (18 pts), boolean chains 6 (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth — 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's 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.
rustnet_core::network::merge::merge_quic_info (cognitive 49) crates/rustnet-core/src/network/merge.rs:722 — rustnet_core::network::merge::merge_quic_info has cognitive complexity 49 (threshold 15). Drivers by points: if/else 14 (29 pts), match/switch 4 (13 pts), boolean chains 4, loops 1 (3 pts) (nesting depth added 26). To reduce it, flatten the nesting: this score is depth rather than breadth — 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's 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.
rustnet_core::network::dpi::quic::salvage::try_parse_unencrypted_crypto_frames (cognitive 48) crates/rustnet-core/src/network/dpi/quic/salvage.rs:11 — rustnet_core::network::dpi::quic::salvage::try_parse_unencrypted_crypto_frames has cognitive complexity 48 (threshold 15). Drivers by points: if/else 12 (40 pts), boolean chains 7, loops 1 (nesting depth added 28). To reduce it, flatten the nesting: this score is depth rather than breadth — 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's 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.
rustnet_core::network::dpi::analyze_udp_packet (cognitive 39) crates/rustnet-core/src/network/dpi/mod.rs:189 — rustnet_core::network::dpi::analyze_udp_packet has cognitive complexity 39 (threshold 15). Drivers by points: boolean chains 21, if/else 17 (18 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
rustnet_core::network::dpi::tls_common::parse_extensions (cognitive 32) crates/rustnet-core/src/network/dpi/tls_common.rs:388 — rustnet_core::network::dpi::tls_common::parse_extensions has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (26 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
rustnet_core::network::dpi::analyze_tcp_packet (cognitive 28) crates/rustnet-core/src/network/dpi/mod.rs:61 — rustnet_core::network::dpi::analyze_tcp_packet has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15, boolean chains 13. To reduce it, split the body: this score is breadth rather than depth — 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.
rustnet_core::network::merge::apply_packet (cognitive 24) crates/rustnet-core/src/network/merge.rs:326 — rustnet_core::network::merge::apply_packet has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (18 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — 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.
rustnet_core::network::dpi::mysql::analyze_mysql (cognitive 24) crates/rustnet-core/src/network/dpi/mysql.rs:9 — rustnet_core::network::dpi::mysql::analyze_mysql has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 5 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
rustnet_core::network::dpi::tls_common::parse_supported_versions (cognitive 22) crates/rustnet-core/src/network/dpi/tls_common.rs:537 — rustnet_core::network::dpi::tls_common::parse_supported_versions has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 1 (4 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
rustnet_core::network::dpi::quic::packet::merge_quic_packet_info (cognitive 22) crates/rustnet-core/src/network/dpi/quic/packet.rs:118 — rustnet_core::network::dpi::quic::packet::merge_quic_packet_info has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 3, loops 1 (3 pts), match/switch 2 (3 pts) (nesting depth added 11). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — 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.
rustnet_core::network::bogon::classify_v4 (cognitive 21) crates/rustnet-core/src/network/bogon.rs:64 — rustnet_core::network::bogon::classify_v4 has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 11, 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.
rustnet_core::network::dpi::ssh::analyze_ssh (cognitive 20) crates/rustnet-core/src/network/dpi/ssh.rs:6 — rustnet_core::network::dpi::ssh::analyze_ssh has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (18 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.
rustnet_core::network::dpi::dns::parse_question (cognitive 19) crates/rustnet-core/src/network/dpi/dns.rs:69 — rustnet_core::network::dpi::dns::parse_question has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (18 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.
rustnet_core::network::dpi::ftp::analyze_ftp (cognitive 19) crates/rustnet-core/src/network/dpi/ftp.rs:66 — rustnet_core::network::dpi::ftp::analyze_ftp has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 5 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — 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.
rustnet_core::network::gateway::parse_route_dump (cognitive 19) crates/rustnet-core/src/network/gateway.rs:250 — rustnet_core::network::gateway::parse_route_dump has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
rustnet_core::network::dpi::redis::analyze_redis (cognitive 18) crates/rustnet-core/src/network/dpi/redis.rs:6 — rustnet_core::network::dpi::redis::analyze_redis has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 4, match/switch 2 (4 pts), loops 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth — 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.
rustnet_core::network::protocol::tcp::parse_window_scale (cognitive 18) crates/rustnet-core/src/network/protocol/tcp.rs:56 — rustnet_core::network::protocol::tcp::parse_window_scale has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 1 (2 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.
rustnet_core::network::dpi::quic::tls::try_extract_tls_from_reassembler (cognitive 17) crates/rustnet-core/src/network/dpi/quic/tls.rs:137 — rustnet_core::network::dpi::quic::tls::try_extract_tls_from_reassembler has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 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.
rustnet_core::network::dpi::dns::skip_dns_name (cognitive 17) crates/rustnet-core/src/network/dpi/dns.rs:30 — rustnet_core::network::dpi::dns::skip_dns_name has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · rustnet_monitor · ×14

rustnet_monitor::tui::run (cognitive 204) src/tui.rs:12 — rustnet_monitor::tui::run has cognitive complexity 204 (threshold 15). Drivers by points: if/else 47 (158 pts), match/switch 5 (27 pts), loops 3 (11 pts), boolean chains 8 (nesting depth added 141). To reduce it, flatten the nesting: this score is depth rather than breadth — 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's 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.
rustnet_monitor::ui::tabs::details::draw_connection_details (cognitive 125) src/ui/tabs/details.rs:1013 — rustnet_monitor::ui::tabs::details::draw_connection_details has cognitive complexity 125 (threshold 15). Drivers by points: if/else 76 (92 pts), match/switch 12 (23 pts), boolean chains 5, loops 4 (5 pts) (nesting depth added 28). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — 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.
rustnet_monitor::ui::widgets::status_bar::view_hints (cognitive 60) src/ui/widgets/status_bar.rs:105 — rustnet_monitor::ui::widgets::status_bar::view_hints has cognitive complexity 60 (threshold 15). Drivers by points: if/else 25 (48 pts), boolean chains 6, match/switch 3 (6 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.
rustnet_monitor::bootstrap::run (cognitive 55) src/bootstrap.rs:17 — rustnet_monitor::bootstrap::run has cognitive complexity 55 (threshold 15). Drivers by points: if/else 32 (41 pts), boolean chains 7, loops 3 (5 pts), match/switch 2 (nesting depth added 11). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — 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.
rustnet_monitor::ui::tabs::overview::draw_stats_panel (cognitive 42) src/ui/tabs/overview.rs:895 — rustnet_monitor::ui::tabs::overview::draw_stats_panel has cognitive complexity 42 (threshold 15). Drivers by points: if/else 41, boolean chains 1. To reduce it, split the body: this score is breadth rather than depth — 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.
rustnet_monitor::app::pcapng_export::build_pcapng_comment (cognitive 26) src/app/pcapng_export.rs:330 — rustnet_monitor::app::pcapng_export::build_pcapng_comment has cognitive complexity 26 (threshold 15). Drivers by points: if/else 21 (26 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — 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.
rustnet_monitor::ui::tabs::activity::draw_process_details (cognitive 25) src/ui/tabs/activity.rs:383 — rustnet_monitor::ui::tabs::activity::draw_process_details has cognitive complexity 25 (threshold 15). Drivers by points: if/else 19 (24 pts), loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — 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.
rustnet_monitor::ui::tabs::activity::draw_process_table (cognitive 21) src/ui/tabs/activity.rs:633 — rustnet_monitor::ui::tabs::activity::draw_process_table has cognitive complexity 21 (threshold 15). Drivers by points: if/else 18 (19 pts), boolean chains 1, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — 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.
rustnet_monitor::ui::widgets::tabs_bar::draw_tabs (cognitive 21) src/ui/widgets/tabs_bar.rs:85 — rustnet_monitor::ui::widgets::tabs_bar::draw_tabs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
rustnet_monitor::ui::connection_table::select_columns (cognitive 18) src/ui/connection_table.rs:143 — rustnet_monitor::ui::connection_table::select_columns has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3 (5 pts), boolean chains 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
rustnet_monitor::ui::widgets::braille_graph::render (cognitive 17) src/ui/widgets/braille_graph.rs:133 — rustnet_monitor::ui::widgets::braille_graph::render has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — 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.
rustnet_monitor::headless::stream_json_lines (cognitive 16) src/headless/mod.rs:253 — rustnet_monitor::headless::stream_json_lines has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (15 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.
rustnet_monitor::app::logging::log_connection_event (cognitive 16) src/app/logging.rs:245 — rustnet_monitor::app::logging::log_connection_event has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (16 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
rustnet_monitor::ui::tabs::overview::draw_overview (cognitive 16) src/ui/tabs/overview.rs:390 — rustnet_monitor::ui::tabs::overview::draw_overview has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — 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.

D1 · Cyclomatic Complexity · rustnet_core · ×13

rustnet_core::network::dpi::analyze_udp_packet (cyclomatic 38) crates/rustnet-core/src/network/dpi/mod.rs:189 — rustnet_core::network::dpi::analyze_udp_packet has cyclomatic complexity 38 (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.
rustnet_core::network::dpi::quic::packet::scan_packet_frames (cyclomatic 36) crates/rustnet-core/src/network/dpi/quic/packet.rs:532 — rustnet_core::network::dpi::quic::packet::scan_packet_frames has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
rustnet_core::network::dpi::quic::salvage::try_reconstruct_sni_from_fragments (cyclomatic 28) crates/rustnet-core/src/network/dpi/quic/salvage.rs:116 — rustnet_core::network::dpi::quic::salvage::try_reconstruct_sni_from_fragments has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
rustnet_core::network::dpi::analyze_tcp_packet (cyclomatic 27) crates/rustnet-core/src/network/dpi/mod.rs:61 — rustnet_core::network::dpi::analyze_tcp_packet has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
rustnet_core::network::merge::analyze_tcp_segment (cyclomatic 26) crates/rustnet-core/src/network/merge.rs:116 — rustnet_core::network::merge::analyze_tcp_segment has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
rustnet_core::network::merge::merge_quic_info (cyclomatic 25) crates/rustnet-core/src/network/merge.rs:722 — rustnet_core::network::merge::merge_quic_info 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.
rustnet_core::network::bogon::classify_v4 (cyclomatic 22) crates/rustnet-core/src/network/bogon.rs:64 — rustnet_core::network::bogon::classify_v4 has cyclomatic complexity 22 (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.
rustnet_core::network::dpi::quic::salvage::try_parse_unencrypted_crypto_frames (cyclomatic 21) crates/rustnet-core/src/network/dpi/quic/salvage.rs:11 — rustnet_core::network::dpi::quic::salvage::try_parse_unencrypted_crypto_frames 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.
rustnet_core::network::dpi::mysql::analyze_mysql (cyclomatic 19) crates/rustnet-core/src/network/dpi/mysql.rs:9 — rustnet_core::network::dpi::mysql::analyze_mysql 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.
rustnet_core::network::dpi::quic::salvage::find_hostname_candidates (cyclomatic 19) crates/rustnet-core/src/network/dpi/quic/salvage.rs:289 — rustnet_core::network::dpi::quic::salvage::find_hostname_candidates 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.
rustnet_core::network::dpi::redis::analyze_redis (cyclomatic 16) crates/rustnet-core/src/network/dpi/redis.rs:6 — rustnet_core::network::dpi::redis::analyze_redis 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.
rustnet_core::network::merge::apply_packet (cyclomatic 16) crates/rustnet-core/src/network/merge.rs:326 — rustnet_core::network::merge::apply_packet 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.
rustnet_core::network::dpi::tls_common::parse_extensions (cyclomatic 16) crates/rustnet-core/src/network/dpi/tls_common.rs:388 — rustnet_core::network::dpi::tls_common::parse_extensions 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.

D3 · God Classes · FileTooLong · ×12

FileTooLong: tabs/details.rs src/ui/tabs/details.rs — FileTooLong — 1418 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 31 free functions. The bar is 500 significant lines; this is 918 over it, 2.84× 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.
FileTooLong: tabs/overview.rs src/ui/tabs/overview.rs — FileTooLong — 1097 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 597 over it, 2.19× 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.
FileTooLong: types/protocol_info.rs crates/rustnet-core/src/network/types/protocol_info.rs — FileTooLong — 903 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 403 over it, 1.81× 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.
FileTooLong: ui/state.rs src/ui/state.rs — FileTooLong — 767 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 267 over it, 1.53× 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.
FileTooLong: app/capture.rs src/app/capture.rs — FileTooLong — 750 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 250 over it, 1.50× 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.
FileTooLong: network/tracker.rs crates/rustnet-core/src/network/tracker.rs — FileTooLong — 648 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 76% of them inside a single declaration: ConnectionTracker (3 blocks, 345-1188). The bar is 500 significant lines; this is 148 over it, 1.30× 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 — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: tabs/activity.rs src/ui/tabs/activity.rs — FileTooLong — 618 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 118 over it, 1.24× 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.
FileTooLong: network/process_activity.rs crates/rustnet-core/src/network/process_activity.rs — FileTooLong — 590 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 90 over it, 1.18× 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.
FileTooLong: app/state.rs src/app/state.rs — FileTooLong — 562 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 85% of them inside a single declaration: App (3 blocks, 68-1081). The bar is 500 significant lines; this is 62 over it, 1.12× 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 — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: ui/connection_table.rs src/ui/connection_table.rs — FileTooLong — 544 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 44 over it, 1.09× 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.
FileTooLong: network/merge.rs crates/rustnet-core/src/network/merge.rs — FileTooLong — 529 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 29 over it, 1.06× 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.
FileTooLong: windows/process.rs crates/rustnet-host/src/windows/process.rs — FileTooLong — 529 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted). The bar is 500 significant lines; this is 29 over it, 1.06× 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.

D1 · Cyclomatic Complexity · rustnet_monitor · ×9

rustnet_monitor::ui::tabs::details::draw_connection_details (cyclomatic 94) src/ui/tabs/details.rs:1013 — rustnet_monitor::ui::tabs::details::draw_connection_details has cyclomatic complexity 94 (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.
rustnet_monitor::tui::run (cyclomatic 70) src/tui.rs:12 — rustnet_monitor::tui::run has cyclomatic complexity 70 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
rustnet_monitor::bootstrap::run (cyclomatic 44) src/bootstrap.rs:17 — rustnet_monitor::bootstrap::run has cyclomatic complexity 44 (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.
rustnet_monitor::ui::widgets::status_bar::view_hints (cyclomatic 36) src/ui/widgets/status_bar.rs:105 — rustnet_monitor::ui::widgets::status_bar::view_hints has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
rustnet_monitor::ui::tabs::overview::draw_stats_panel (cyclomatic 33) src/ui/tabs/overview.rs:895 — rustnet_monitor::ui::tabs::overview::draw_stats_panel has cyclomatic complexity 33 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
rustnet_monitor::app::pcapng_export::build_pcapng_comment (cyclomatic 21) src/app/pcapng_export.rs:330 — rustnet_monitor::app::pcapng_export::build_pcapng_comment has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
rustnet_monitor::ui::tabs::activity::draw_process_table (cyclomatic 17) src/ui/tabs/activity.rs:633 — rustnet_monitor::ui::tabs::activity::draw_process_table 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.
rustnet_monitor::ui::draw (cyclomatic 17) src/ui/mod.rs:302 — rustnet_monitor::ui::draw has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — 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.
rustnet_monitor::ui::connection_table::select_columns (cyclomatic 16) src/ui/connection_table.rs:143 — rustnet_monitor::ui::connection_table::select_columns 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.

D3 · God Classes · FunctionTooLong · ×8

FunctionTooLong: rustnet_monitor::ui::tabs::details::draw_connection_details src/ui/tabs/details.rs:1013 — FunctionTooLong — rustnet_monitor::ui::tabs::details::draw_connection_details runs 838 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 738 over it, 8.38× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: rustnet_monitor::ui::tabs::overview::draw_stats_panel src/ui/tabs/overview.rs:895 — FunctionTooLong — rustnet_monitor::ui::tabs::overview::draw_stats_panel runs 327 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 227 over it, 3.27× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: rustnet_monitor::tui::run src/tui.rs:12 — FunctionTooLong — rustnet_monitor::tui::run runs 250 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 150 over it, 2.50× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: rustnet_monitor::bootstrap::run src/bootstrap.rs:17 — FunctionTooLong — rustnet_monitor::bootstrap::run runs 205 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 105 over it, 2.05× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: rustnet_monitor::cli::build_cli src/cli.rs:29 — FunctionTooLong — rustnet_monitor::cli::build_cli runs 189 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 89 over it, 1.89× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: rustnet_monitor::ui::tabs::activity::draw_process_table src/ui/tabs/activity.rs:633 — FunctionTooLong — rustnet_monitor::ui::tabs::activity::draw_process_table runs 154 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 54 over it, 1.54× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: rustnet_monitor::ui::tabs::activity::draw_process_details src/ui/tabs/activity.rs:383 — FunctionTooLong — rustnet_monitor::ui::tabs::activity::draw_process_details runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: rustnet_core::network::dpi::quic::packet::scan_packet_frames crates/rustnet-core/src/network/dpi/quic/packet.rs:532 — FunctionTooLong — rustnet_core::network::dpi::quic::packet::scan_packet_frames runs 116 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 16 over it, 1.16× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.

D2 · Cognitive Complexity · App · ×5

App::run_process_enrichment (cognitive 101) src/app/enrichment.rs:160 — App::run_process_enrichment has cognitive complexity 101 (threshold 15). Drivers by points: if/else 31 (89 pts), boolean chains 9, loops 2 (3 pts) (nesting depth added 59). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
App::start_capture_thread (cognitive 79) src/app/capture.rs:589 — App::start_capture_thread has cognitive complexity 79 (threshold 15). Drivers by points: if/else 26 (67 pts), match/switch 2 (6 pts), boolean chains 5, loops 1 (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
App::start_packet_processor (cognitive 35) src/app/capture.rs:865 — App::start_packet_processor has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 4 (10 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
App::start_snapshot_provider (cognitive 18) src/app/sampling.rs:114 — App::start_snapshot_provider has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (6 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
App::start_interface_stats_thread (cognitive 16) src/app/sampling.rs:245 — App::start_interface_stats_thread has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (5 pts), boolean chains 1, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — 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.

D3 · God Classes · MethodTooLong · ×5

MethodTooLong: App.start_capture_thread src/app/capture.rs:589 — MethodTooLong — start_capture_thread runs 162 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 62 over it, 1.62× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: App.run_process_enrichment src/app/enrichment.rs:160 — MethodTooLong — run_process_enrichment runs 141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 41 over it, 1.41× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: App.start_packet_processor src/app/capture.rs:865 — MethodTooLong — start_packet_processor runs 134 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 34 over it, 1.34× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: ConnectionSnapshot.from_connection src/headless/schema.rs:283 — MethodTooLong — from_connection runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 26 over it, 1.26× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: OverviewTab.handle_key src/ui/tabs/overview.rs:86 — MethodTooLong — handle_key runs 123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 23 over it, 1.23× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.

D3 · God Classes · TooManyFields · ×4

TooManyFields: Theme src/ui/theme/derive.rs:16 — TooManyFields — 53 stored fields beside 1 method. The bar is 30 stored fields; this is 23 over it, 1.77× 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 — each reader then names only the group it uses.
TooManyFields: UiState src/ui/state.rs:548 — TooManyFields — 50 stored fields beside 40 methods. The bar is 30 stored fields; this is 20 over it, 1.67× 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 — each reader then names only the group it uses.
TooManyFields: Connection crates/rustnet-core/src/network/types/connection.rs:146 — TooManyFields — 44 stored fields beside 19 methods. The bar is 30 stored fields; this is 14 over it, 1.47× 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 — each reader then names only the group it uses.
TooManyFields: App src/app/state.rs:68 — TooManyFields — 35 stored fields beside 59 methods. The bar is 30 stored fields; this is 5 over it, 1.17× 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 — each reader then names only the group it uses.

D1 · Cyclomatic Complexity · App · ×3

App::run_process_enrichment (cyclomatic 42) src/app/enrichment.rs:160 — App::run_process_enrichment has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
App::start_capture_thread (cyclomatic 35) src/app/capture.rs:589 — App::start_capture_thread 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.
App::start_packet_processor (cyclomatic 18) src/app/capture.rs:865 — App::start_packet_processor 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.

D3 · God Classes · TooManyMethods · ×3

TooManyMethods: App src/app/state.rs:68 — TooManyMethods — 59 methods, declared across 5 files: app/state.rs (43), app/capture.rs (6), app/sampling.rs (5), app/enrichment.rs (4), +1 more file(s). The bar is 30 methods; this is 29 over it, 1.97× 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.
TooManyMethods: UiState src/ui/state.rs:548 — TooManyMethods — 40 methods, declared across 2 files: ui/state.rs (38), ui/sections.rs (2). The bar is 30 methods; this is 10 over it, 1.33× 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.
TooManyMethods: ConnectionTracker crates/rustnet-core/src/network/tracker.rs:345 — TooManyMethods — 34 methods. The bar is 30 methods; this is 4 over it, 1.13× 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.

D4 · Code Duplication · Duplicated block (7 lines × 2) · ×3

Duplicated block (7 lines × 2) crates/rustnet-core/src/network/tracker.rs:582 — crates/rustnet-core/src/network/tracker.rs:582-588 | crates/rustnet-core/src/network/tracker.rs:596-602 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) crates/rustnet-host/src/linux/ebpf/loader.rs:221 — crates/rustnet-host/src/linux/ebpf/loader.rs:221-227 | crates/rustnet-host/src/linux/ebpf/loader.rs:324-330 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) src/ui/tabs/graph.rs:614 — src/ui/tabs/graph.rs:614-620 | src/ui/tabs/graph.rs:621-627 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.

D5 · Coupling · Off the main sequence · ×3

Off the main sequence: rustnet-capture — rustnet-capture: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
Off the main sequence: rustnet-sandbox — rustnet-sandbox: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
Off the main sequence: rustnet-core — rustnet-core: abstractness 0.02, instability 0.00, distance 0.98 — zone of pain — concrete and depended on by 2 project(s), so it's rigid to change.

D1 · Cyclomatic Complexity · rustnet_sandbox · ×2

rustnet_sandbox::linux::apply (cyclomatic 32) crates/rustnet-sandbox/src/linux/mod.rs:69 — rustnet_sandbox::linux::apply 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.
rustnet_sandbox::linux::landlock::apply_landlock (cyclomatic 24) crates/rustnet-sandbox/src/linux/landlock.rs:138 — rustnet_sandbox::linux::landlock::apply_landlock 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.

D2 · Cognitive Complexity · rustnet_sandbox · ×2

rustnet_sandbox::linux::apply (cognitive 46) crates/rustnet-sandbox/src/linux/mod.rs:69 — rustnet_sandbox::linux::apply has cognitive complexity 46 (threshold 15). Drivers by points: if/else 24 (36 pts), boolean chains 5, match/switch 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.
rustnet_sandbox::linux::landlock::apply_landlock (cognitive 28) crates/rustnet-sandbox/src/linux/landlock.rs:138 — rustnet_sandbox::linux::landlock::apply_landlock has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 6, boolean chains 4, match/switch 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.

D2 · Cognitive Complexity · DnsResolver · ×2

DnsResolver::start_with_spawner (cognitive 36) crates/rustnet-core/src/network/dns.rs:239 — DnsResolver::start_with_spawner has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 4 (10 pts), loops 4 (7 pts), boolean chains 3 (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.
DnsResolver::stop (cognitive 18) crates/rustnet-core/src/network/dns.rs:452 — DnsResolver::stop has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 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.

D2 · Cognitive Complexity · rustnet_capture · ×2

rustnet_capture::find_capture_device (cognitive 29) crates/rustnet-capture/src/lib.rs:408 — rustnet_capture::find_capture_device has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (20 pts), match/switch 3 (5 pts), boolean chains 4 (nesting depth added 13). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — 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.
rustnet_capture::setup_packet_capture (cognitive 23) crates/rustnet-capture/src/lib.rs:214 — rustnet_capture::setup_packet_capture has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 2 (5 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · LinuxProcessLookup · ×2

LinuxProcessLookup::build_inode_map (cognitive 23) crates/rustnet-host/src/linux/process.rs:540 — LinuxProcessLookup::build_inode_map has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 2 (5 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.
LinuxProcessLookup::parse_and_map_content (cognitive 16) crates/rustnet-host/src/linux/process.rs:604 — LinuxProcessLookup::parse_and_map_content has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 3 (6 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.

D3 · God Classes · ClassTooLong · ×2

ClassTooLong: ConnectionTracker crates/rustnet-core/src/network/tracker.rs:345 — ClassTooLong — 494 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 34 methods, 3 blocks, lines 345-1188. The bar is 400 significant lines; this is 94 over it, 1.24× 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.
ClassTooLong: App src/app/state.rs:68 — ClassTooLong — 480 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 59 methods, 3 blocks, lines 68-1081. The bar is 400 significant lines; this is 80 over it, 1.20× 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.

D1 · Cyclomatic Complexity · Connection · ×1

Connection::state (cyclomatic 52) crates/rustnet-core/src/network/types/connection.rs:454 — Connection::state has cyclomatic complexity 52 (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 — the same kind of value, with no behaviour of its own — 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.

D1 · Cyclomatic Complexity · OverviewTab · ×1

OverviewTab::handle_key (cyclomatic 31) src/ui/tabs/overview.rs:86 — OverviewTab::handle_key has cyclomatic complexity 31 (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 — the same kind of value, with no behaviour of its own — 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.

D1 · Cyclomatic Complexity · ApplicationProtocol · ×1

ApplicationProtocol::fmt (cyclomatic 26) crates/rustnet-core/src/network/types/protocol_info.rs:277 — ApplicationProtocol::fmt 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 — the same kind of value, with no behaviour of its own — 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 is NOT this file's highest cyclomatic complexity: DnsQueryType::from_wire (cyclomatic 48) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension's figures nor in its score.

D1 · Cyclomatic Complexity · ConnectionFilter · ×1

ConnectionFilter::matches (cyclomatic 25) crates/rustnet-core/src/network/filter.rs:216 — ConnectionFilter::matches 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 — the same kind of value, with no behaviour of its own — 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 is NOT this file's highest cyclomatic complexity: ConnectionFilter::matches_dpi_general (cyclomatic 27) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension's figures nor in its score.

D1 · Cyclomatic Complexity · ConnectionTracker · ×1

ConnectionTracker::measure_timings (cyclomatic 24) crates/rustnet-core/src/network/tracker.rs:526 — ConnectionTracker::measure_timings 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.

D1 · Cyclomatic Complexity · ActivityTab · ×1

ActivityTab::handle_key (cyclomatic 24) src/ui/tabs/activity.rs:58 — ActivityTab::handle_key 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.

D1 · Cyclomatic Complexity · MacOSProcessLookup · ×1

MacOSProcessLookup::parse_lsof_output (cyclomatic 23) crates/rustnet-host/src/macos/process.rs:178 — MacOSProcessLookup::parse_lsof_output 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.

D1 · Cyclomatic Complexity · Theme · ×1

Theme::resolve (cyclomatic 23) src/ui/theme/derive.rs:102 — Theme::resolve 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.

D1 · Cyclomatic Complexity · DnsResolver · ×1

DnsResolver::start_with_spawner (cyclomatic 20) crates/rustnet-core/src/network/dns.rs:239 — DnsResolver::start_with_spawner 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.

D1 · Cyclomatic Complexity · rustnet_capture · ×1

rustnet_capture::find_capture_device (cyclomatic 17) crates/rustnet-capture/src/lib.rs:408 — rustnet_capture::find_capture_device 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.

D1 · Cyclomatic Complexity · DnsAnalyticsTracker · ×1

DnsAnalyticsTracker::snapshot (cyclomatic 17) crates/rustnet-core/src/network/dns_analytics.rs:169 — DnsAnalyticsTracker::snapshot 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.

D1 · Cyclomatic Complexity · pcap_enrich.create_pcapng (cyclomatic 16) · ×1

pcap_enrich.create_pcapng (cyclomatic 16) scripts/pcap_enrich.py:251 — pcap_enrich.create_pcapng 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.

D17 · Explicit Debt · TodoComment · ×1

TodoComment crates/rustnet-sandbox/src/linux/landlock.rs:188 — // TODO(udp landlock): UDP restrictions (LANDLOCK_ACCESS_NET_CONNECT_UDP / — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.

D2 · Cognitive Complexity · Connection · ×1

Connection::state (cognitive 57) crates/rustnet-core/src/network/types/connection.rs:454 — Connection::state has cognitive complexity 57 (threshold 15). Drivers by points: if/else 17 (34 pts), match/switch 9 (23 pts) (nesting depth added 31). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — 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.

D2 · Cognitive Complexity · MacOSProcessLookup · ×1

MacOSProcessLookup::parse_lsof_output (cognitive 43) crates/rustnet-host/src/macos/process.rs:178 — MacOSProcessLookup::parse_lsof_output has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (25 pts), match/switch 4 (10 pts), boolean chains 6, 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.

D2 · Cognitive Complexity · Theme · ×1

Theme::resolve (cognitive 31) src/ui/theme/derive.rs:102 — Theme::resolve has cognitive complexity 31 (threshold 15). Drivers by points: if/else 19, boolean chains 8, loops 1 (2 pts), match/switch 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — 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.

D2 · Cognitive Complexity · pcap_enrich.create_pcapng (cognitive 30) · ×1

pcap_enrich.create_pcapng (cognitive 30) scripts/pcap_enrich.py:251 — pcap_enrich.create_pcapng has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 3 (4 pts), boolean chains 1, error handling 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · DnsAnalyticsTracker · ×1

DnsAnalyticsTracker::snapshot (cognitive 28) crates/rustnet-core/src/network/dns_analytics.rs:169 — DnsAnalyticsTracker::snapshot has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (24 pts), match/switch 1 (3 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.

D2 · Cognitive Complexity · ConnectionTracker · ×1

ConnectionTracker::measure_timings (cognitive 26) crates/rustnet-core/src/network/tracker.rs:526 — ConnectionTracker::measure_timings has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 6, match/switch 3 (5 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.

D2 · Cognitive Complexity · ActivityTab · ×1

ActivityTab::handle_key (cognitive 26) src/ui/tabs/activity.rs:58 — ActivityTab::handle_key has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (21 pts), match/switch 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.

D2 · Cognitive Complexity · UiState · ×1

UiState::get_selected_grouped_index (cognitive 23) src/ui/state.rs:1035 — UiState::get_selected_grouped_index has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · ApplicationProtocol · ×1

ApplicationProtocol::fmt (cognitive 19) crates/rustnet-core/src/network/types/protocol_info.rs:277 — ApplicationProtocol::fmt has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 3 (5 pts) (nesting depth added 9). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — 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.

D2 · Cognitive Complexity · KubernetesSocketTable · ×1

KubernetesSocketTable::build (cognitive 19) src/network/kubernetes.rs:360 — KubernetesSocketTable::build has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (6 pts), match/switch 2 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · OverviewTab · ×1

OverviewTab::handle_key (cognitive 19) src/ui/tabs/overview.rs:86 — OverviewTab::handle_key has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 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.

D2 · Cognitive Complexity · PacketParser · ×1

PacketParser::parse_ipv6_extension_headers (cognitive 17) crates/rustnet-core/src/network/parser.rs:796 — PacketParser::parse_ipv6_extension_headers has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 pts), 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.

D2 · Cognitive Complexity · pcap_enrich.find_matching_connection (cognitive 17) · ×1

pcap_enrich.find_matching_connection (cognitive 17) scripts/pcap_enrich.py:105 — pcap_enrich.find_matching_connection has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · WindowsStatsProvider · ×1

WindowsStatsProvider::get_all_stats (cognitive 16) crates/rustnet-core/src/network/interface_stats/windows.rs:15 — WindowsStatsProvider::get_all_stats has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 4, loops 2, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D2 · Cognitive Complexity · pcap_enrich.load_connections (cognitive 16) · ×1

pcap_enrich.load_connections (cognitive 16) scripts/pcap_enrich.py:53 — pcap_enrich.load_connections has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (4 pts), error handling 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.

D2 · Cognitive Complexity · pcap_enrich.print_table (cognitive 16) · ×1

pcap_enrich.print_table (cognitive 16) scripts/pcap_enrich.py:219 — pcap_enrich.print_table has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 2 (4 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.

D22 · Internal API Consistency · Redundant packet parsing/consumption operations. `PacketReader` appears to be a high-level stream consumer that yields packets, while `PacketParser` is a stateful parser that transforms raw bytes into `ParsedPacket`. However, `PacketReader` likely wraps or uses a parser internally. The existence of both `next_packet` (streaming) and explicit `parse_packet` (stateless/stateful transformation) creates confusion about whether the user should use the Reader for consumption or the Parser for transformation. Furthermore, `parse_packet_with_refresh` and `parse_packet` differ only by an internal side-effect (refreshing IPs), which is an implementation detail leaking into the API surface. · ×1

Redundant packet parsing/consumption operations. `PacketReader` appears to be a high-level stream consumer that yields packets, while `PacketParser` is a stateful parser that transforms raw bytes into `ParsedPacket`. However, `PacketReader` likely wraps or uses a parser internally. The existence of both `next_packet` (streaming) and explicit `parse_packet` (stateless/stateful transformation) creates confusion about whether the user should use the Reader for consumption or the Parser for transformation. Furthermore, `parse_packet_with_refresh` and `parse_packet` differ only by an internal side-effect (refreshing IPs), which is an implementation detail leaking into the API surface. — Unify the parsing logic. If `PacketReader` is the primary consumer, it should handle parsing internally and expose `ParsedPacket`. If `PacketParser` is a reusable utility, remove `PacketReader` or make it a simple wrapper that delegates to `PacketParser`. Remove `parse_packet_with_refresh` and expose the refresh logic as a separate method on the parser or a configuration option, rather than a separate method signature. (signatures: PacketReader.next_packet(): Result | PacketParser.parse_packet(data: &[u8]): ParsedPacket | PacketParser.parse_packet_with_refresh(data: &[u8]): ParsedPacket)

D22 · Internal API Consistency · Inconsistent naming for drop metrics. `capture_drops` and `interface_drops` are specific, but `total_dropped` is ambiguous. Does it sum the previous two? Or is it a different metric? The naming convention shifts from specific source (`capture`, `interface`) to a generic aggregate (`total`), which is inconsistent with the other two methods. Additionally, `total_dropped` sounds like a property or a sum, whereas the others are specific counters. · ×1

Inconsistent naming for drop metrics. `capture_drops` and `interface_drops` are specific, but `total_dropped` is ambiguous. Does it sum the previous two? Or is it a different metric? The naming convention shifts from specific source (`capture`, `interface`) to a generic aggregate (`total`), which is inconsistent with the other two methods. Additionally, `total_dropped` sounds like a property or a sum, whereas the others are specific counters. — Rename `total_dropped` to `total_drops` to match the plural noun convention of `capture_drops` and `interface_drops`, or rename all three to `capture_drop_count`, `interface_drop_count`, and `total_drop_count` for explicit clarity. (signatures: CaptureStats.capture_drops(): u32 | CaptureStats.interface_drops(): u32 | CaptureStats.total_dropped(): u32)

D22 · Internal API Consistency · Redundant availability checking. `is_available()` likely checks if the resolver is initialized and has data. `get_status()` returns a tuple of three booleans, which likely includes availability plus other states (e.g., DB loaded, cache ready). However, exposing a raw tuple `(bool, bool, bool)` is poor API design compared to a typed struct or enum, and it overlaps with the simple `is_available()` check. Users calling `is_available()` might not need the full status, but the existence of both suggests unclear responsibility for state reporting. · ×1

Redundant availability checking. `is_available()` likely checks if the resolver is initialized and has data. `get_status()` returns a tuple of three booleans, which likely includes availability plus other states (e.g., DB loaded, cache ready). However, exposing a raw tuple `(bool, bool, bool)` is poor API design compared to a typed struct or enum, and it overlaps with the simple `is_available()` check. Users calling `is_available()` might not need the full status, but the existence of both suggests unclear responsibility for state reporting. — Remove `is_available()` if `get_status()` is the canonical way to check state, or refactor `get_status()` to return a typed struct (e.g., `GeoIpStatus`) with named fields. If `is_available()` is a common convenience, keep it but ensure it doesn't duplicate the logic of `get_status()` in a confusing way. Ideally, `get_status` should replace `is_available`. (signatures: GeoIpResolver.get_status(): (bool, bool, bool) | GeoIpResolver.is_available(): bool)

D22 · Internal API Consistency · Inconsistent builder pattern naming. `with_defaults` and `with_defaults_deferred` suggest a builder pattern, but `try_with_defaults` returns a `Result` and likely constructs the resolver directly. This mixes builder-style fluent methods with constructor-style methods. `with_defaults_deferred` is also a confusing name; it's unclear what 'deferred' means in this context (lazy initialization? async?). · ×1

Inconsistent builder pattern naming. `with_defaults` and `with_defaults_deferred` suggest a builder pattern, but `try_with_defaults` returns a `Result` and likely constructs the resolver directly. This mixes builder-style fluent methods with constructor-style methods. `with_defaults_deferred` is also a confusing name; it's unclear what 'deferred' means in this context (lazy initialization? async?). — Standardize on a single construction pattern. If using a builder, all variants should be builder methods returning `Self`. If using constructors, use `new()`, `new_with_defaults()`, etc. Clarify the meaning of 'deferred' or rename it to something more descriptive like `with_lazy_init`. (signatures: DnsResolver.with_defaults(): Self | DnsResolver.with_defaults_deferred(): Self | DnsResolver.try_with_defaults(): Result)

D3 · God Classes · TooManyFunctions · ×1

TooManyFunctions: rustnet_monitor::ui::theme src/ui/theme/mod.rs:56 — TooManyFunctions — 72 free functions. The bar is 30 free functions; this is 42 over it, 2.40× 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.

D31 · IaC & Container Security · Medium IaC · ×1

REDACTED

D36 · Supply-chain Provenance & Signing · REDACTED · ×1

REDACTED

D36 · Supply-chain Provenance & Signing · REDACTED · ×1

REDACTED

D4 · Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) · ×1

Members sharing a duplicated core (4 members, 50+ identical tokens) src/ui/theme/definitions.rs:459 — src/ui/theme/definitions.rs:459-486 | src/ui/theme/definitions.rs:488-515 | src/ui/theme/definitions.rs:521-548 | src/ui/theme/definitions.rs:550-577 — 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 — 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' 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. 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.

D4 · Code Duplication · Duplicated block (12 lines × 3) · ×1

Duplicated block (12 lines × 3) src/ui/theme/definitions.rs:475 — src/ui/theme/definitions.rs:475-486 | src/ui/theme/definitions.rs:504-515 | src/ui/theme/definitions.rs:566-577 — 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 — resolving only two of them leaves the rest to drift apart the first time one is edited.

D4 · Code Duplication · Duplicated block (10 lines × 2) · ×1

Duplicated block (10 lines × 2) crates/rustnet-host/src/freebsd/process.rs:69 — crates/rustnet-host/src/freebsd/process.rs:69-78 | crates/rustnet-host/src/freebsd/process.rs:96-105 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.

D4 · Code Duplication · Duplicated block (8–9 lines × 2) · ×1

Duplicated block (8–9 lines × 2) crates/rustnet-core/src/network/parser.rs:814 — crates/rustnet-core/src/network/parser.rs:814-821 | crates/rustnet-core/src/network/parser.rs:836-844 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.

D4 · Code Duplication · Duplicated block (6 lines × 4) · ×1

Duplicated block (6 lines × 4) src/ui/theme/definitions.rs:468 — src/ui/theme/definitions.rs:468-473 | src/ui/theme/definitions.rs:497-502 | src/ui/theme/definitions.rs:530-535 | src/ui/theme/definitions.rs:559-564 — 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 — resolving only two of them leaves the rest to drift apart the first time one is edited.

D8 · Code Coverage · Coverage not measured · ×1

Coverage not measured — no coverage collector is wired up — Coverage NOT MEASURED: `--collect:"XPlat Code Coverage"` names a data collector that ships in the `coverlet.collector` package, and this repository wires up none — no test project references it and no runsettings declares one. The absence of coverage here is therefore not evidence about the suite or about our analyzer environment: without a collector, `--collect` produces nothing even from a suite that builds and passes. Add a `coverlet.collector` PackageReference to the test project(s) (or commit the Cobertura/OpenCover/lcov report your CI produces) and real coverage will be measured. It is excluded from the score rather than counted as a near-zero defect.

Minor — 7 finding(s)

D20 · ADR Quality · No ADRs found · ×1

No ADRs found — No ADRs found. No recognised ADR directory (`docs/adr/`, `docs/decisions/`, `adr/`, `docs/rfcs/`, an `ADR0001/` 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 (`docs/adr/use-postgres.md`, `docs/adr/2024/0001-x.md`); or a file anywhere whose name is ADR-shaped (`0001-use-postgres.md`, `adr-012-caching.md`); or, when neither turned anything up, a document carrying the decision-record signature (an "Architecture Decision Record" heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these — unnumbered files outside any recognised directory, without those headings — 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 `docs/adr/`.

D26 · Project Cohesion · Projects may be oversized for their cohesion · ×1

Projects may be oversized for their cohesion — 1 of 5 project(s) overshoot their size bounds, lowering Project Cohesion to 6.0/10. The most over is `crates/rustnet-core` (27437 LoC, 174 public types across 7 directories). Review these for cohesion — 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.

D36 · Supply-chain Provenance & Signing · REDACTED · ×1

REDACTED

D36 · Supply-chain Provenance & Signing · REDACTED · ×1

REDACTED

M2 · Architecture documentation · No ADRs · ×1

No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` 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.

X7 · Silent fallback defaults · Silent fallback default on Err · ×1

Silent fallback default on Err crates/rustnet-core/src/network/neighbors.rs:180 — `sweep_stale` turns every `Err` into `true` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. 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.

X9 · Subsumed condition operand · Subsumed condition operand · ×1

Subsumed condition operand crates/rustnet-host/src/linux/ebpf/loader.rs:702 — `blob.contains("-eacces")` can never decide this `||` — every value satisfying `blob.contains("-eacces")` also satisfies `blob.contains("eacces")`, so the `||` chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident.

Minor — 3 finding(s)

D12 · Dependency Hygiene · Outdated · ×3

Outdated: aes — `aes` is locked at 0.9.2 but 0.9.3 is the current stable release on crates.io, and it already satisfies the `"0.9"` requirement declared in crates/rustnet-core/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p aes` and commit the updated Cargo.lock.
Outdated: libbpf-cargo — `libbpf-cargo` is locked at 0.27.1 but 0.27.2 is the current stable release on crates.io, and it already satisfies the `"0.27"` requirement declared in crates/rustnet-host/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p libbpf-cargo` and commit the updated Cargo.lock.
Outdated: libbpf-rs — `libbpf-rs` is locked at 0.27.1 but 0.27.2 is the current stable release on crates.io, and it already satisfies the `"0.27"` requirement declared in crates/rustnet-host/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p libbpf-rs` and commit the updated Cargo.lock.

Appendix B — Reproduction & audit trail

Every external tool invocation behind a deep-scan dimension — the tool, its captured version, the exact command, how many findings it yielded, and a link to the retained raw output. To reproduce any finding: check out the same commit and run the command shown (repo-relative — never an absolute scratch path). The complete raw scanner output is retained verbatim under artifacts/raw/ (indexed in artifacts/raw/index.json); per-invocation exit codes and wall-clock durations are in sidecar.json — kept out of this table so the rendered report stays byte-identical across runs of the same commit.

Dimension	Tool	Version	Command	Findings	Raw output
D28 · Secrets (history)	gitleaks	—	gitleaks detect --no-banner --config /opt/gitleaks-rules/watchdog-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-1b728d3745b548dc9a35b9ebf41e91ac/history.json --exit-code 0 --source .	0	artifacts/raw/gitleaks-history.json
D28 · Secrets (history)	gitleaks	—	gitleaks detect --no-git --no-banner --config /opt/gitleaks-rules/watchdog-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-1b728d3745b548dc9a35b9ebf41e91ac/tree.json --exit-code 0 --source .	0	artifacts/raw/gitleaks-tree.json
D29 · Static Analysis (SAST)	semgrep	—	semgrep --config /opt/semgrep-rules/security-audit.yml --config /opt/semgrep-rules/owasp-top-ten.yml --config /opt/semgrep-rules/watchdog-sast.yml --json --quiet --timeout 10 --timeout-threshold 3 --metrics off .	33	artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilities	osv-scanner	—	osv-scanner --format json --recursive .	0	artifacts/raw/osv-scanner.json
D31 · IaC & Container Security	trivy	—	trivy config --format json --quiet .	4	artifacts/raw/trivy-config.json
D32 · Data Compliance (PII/GDPR)	semgrep	—	semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.	0	—
D40 · Network Egress Confinement	runtime-hardening	—	runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.	0	—
D41 · Kernel & Syscall Confinement	runtime-hardening	—	runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.	0	—
D42 · Runtime Threat Enforcement	runtime-hardening	—	runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.	0	—
D43 · Malicious Dependencies	osv-scanner	—	osv-scanner --format json --recursive .	0	artifacts/raw/osv-scanner.json

Run 01a0f0d3-4c34-7715-9461-d114422b1627 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.

Domcyrus/rustnet

Findings by grade

This survey was produced by

Executive summary

Top priorities

Diagnosis — what's actually going on

Architecture — module dependency graph

Architecture — module dependency matrix

At a glance — Code Health · 83% · Adequate · gated by D2 ·

At a glance — Architecture · 92% · Exemplary ·

At a glance — Maturity · 80% · Strong ·

At a glance — Readiness · 83% · Strong ·

At a glance — Security · 80% · Adequate · gated by D29 ·

At a glance — Performance · 85% · Strong ·

Security & Compliance — OWASP Top-10 mapping

Roadmap

File quality

How the grades work

Methodology & how to trust this report

Tools & methods

Run transparency — what happened this run

Limitations & what we did not check

Per-dimension blind spots

The LLM boundary

Dimensions

Frontend & cross-cutting dimensions

Reference — by lens

Appendix A — Findings (grouped)

Appendix B — Reproduction & audit trail

Downloadable artifacts