Home / paradigmxyz / reth
AI Slop Code RIsk Monitor

paradigmxyz/reth

Modular, contributor-friendly and blazing-fast implementation of the Ethereum protocol, in Rust

4.5 Low pattern signal View on GitHub

Maintenance and Governance Review

This report summarizes scanner evidence for paradigmxyz/reth, a Rust project with 5,816 GitHub stars. SynthScan examined 582,753 lines of code across 1665 source files, recording 2181 pattern matches distributed across 14 syntactic categories. The legacy adjusted pattern signal is 4.5 (Low pattern signal); it is not an authorship estimate.

Use the findings to ask whether maintainers can explain intent, verify dependencies, simplify unnecessary scaffolding, and focus review effort. Risk Payload v1 adds ownership, supply-chain, over-engineering, and review-effort vectors when available. These are prompts for human verification, not probabilities, security findings, or measured maintenance costs.

4.5
Adjusted Signal
4.5
Raw Pattern Score
100%
Time Factor
2026-10-11
Last Push
5.8K
Stars
Rust
Language
582.8K
Lines of Code
1.7K
Files
2.2K
Pattern Hits
2026-10-12
Scan Date
0.03
HC Hit Rate

Risk Review · v3

Use each vector to guide manual verification of the underlying findings.

Cognitive Ownership Risk 15.9/100 · LOW

Can maintainers explain intent, assumptions, and trade-offs? 2088 finding(s).

Hallucinated Dependency & Supply Chain Risk 4.2/100 · LOW

Are imports declared and package/API names verified? 55 finding(s).

Agent Over-Engineering Ratio 1.5/100 · LOW

Are wrappers, guards, and repeated structures necessary? 98 finding(s).

PR Review Velocity Impact 20.9/100 · LOW

Which changes need focused human review? 2181 finding(s).

What These Metrics Mean

Adjusted Signal
Legacy pattern score normalized per 1,000 scanned lines and multiplied by the repository-level time factor. It is not an estimate of AI authorship.
Raw Pattern Score
Sum of severity- and context-weighted pattern findings before applying the time factor.
Time Factor
A coarse multiplier based on repository last-push metadata. It does not identify when individual code was written.
Pattern Hits
Count of configured pattern findings. Review each location and surrounding code before acting.
HC Hit Rate
High- and critical-severity findings per scanned file. Severity is a configured detector weight, not proof of a vulnerability or authorship.
Lines / Files
Scan coverage denominators used by the legacy normalized score.

Pattern-Signal History

This chart tracks the legacy adjusted pattern score across scan runs. Changes can reflect source changes, scan coverage, or detector/scoring versions; they do not measure AI adoption or prove that a team refactored code. Compare runs only when their scoring versions are compatible. The dashed line tracks the raw pattern-hit count.

Severity Breakdown

Groups findings by configured severity weight. Severity is not a confidence estimate, security rating, or proof that a package is missing. Verify imports against the project's manifests and inspect each finding in its local design context.

CRITICAL 50HIGH 2MEDIUM 46LOW 2083

Directory Score Breakdown

This horizontal bar chart shows where configured pattern scores accumulate across directories. Treat the bars as locations to inspect, not as evidence of authorship or code quality. Use the file-level findings to decide whether a directory needs a focused ownership, dependency, complexity, or review check.

Pattern Findings

The scanner identified 2181 distinct pattern matches across 14 syntactic categories. Each entry below represents a discrete location in the source code where the engine recorded a detector match to inspect in context. Expand any category row to inspect the individual file paths, line numbers, code snippets, and the lexical context (CODE, COMMENT, or STRING) in which each match was detected.

Reading the findings table: The Severity column indicates the configured finding weight (CRITICAL / HIGH / MEDIUM / LOW). The Context column identifies whether the match occurred inside executable code, an inline comment, or a string literal — legacy comment-context matches receive a ×1.5 score weight. The ⚡ bolt icon marks clustered matches: three or more patterns within a 10-line window, each receiving an additional ×1.5 density multiplier under the legacy scoring model.

Over-Commented Block1894 hits · 1686 pts
SeverityFileLineSnippetContext
LOWcrates/metrics/src/lib.rs1//! Collection of metrics utilities.COMMENT
LOWcrates/metrics/src/common/mpsc.rs441/// so the budget tracks bytes *currently in the channel queue*, not bytes in flightCOMMENT
LOWcrates/consensus/consensus/src/lib.rs1//! Consensus protocol functionsCOMMENT
LOWcrates/consensus/consensus/src/lib.rs61 SealedHeader,COMMENT
LOWcrates/consensus/consensus/src/lib.rs101 ) -> Result<(), ConsensusError>;COMMENT
LOWcrates/consensus/consensus/src/lib.rs141 }COMMENT
LOWcrates/consensus/consensus/src/lib.rs241COMMENT
LOWcrates/consensus/consensus/src/noop.rs1//! A consensus implementation that does nothing.COMMENT
LOWcrates/tracing/src/log_handle.rs61 LOG_HANDLE.lock().expect("log handle poisoned").is_available()COMMENT
LOWcrates/tracing/src/lib.rs1//! The `tracing` module provides functionalities for setting up and configuring logging.COMMENT
LOWcrates/tracing/src/lib.rs21//! LogFormat::Json,COMMENT
LOWcrates/tracing/src/lib.rs201}COMMENT
LOWcrates/tracing/src/lib.rs241/// Trait defining a general interface for logging configuration.COMMENT
LOWcrates/tracing/src/lib.rs261 ///COMMENT
LOWcrates/tracing/src/formatter.rs1use crate::layers::BoxedLayer;COMMENT
LOWcrates/tracing/src/formatter.rs21 LogFmt,COMMENT
LOWcrates/tracing/src/throttle.rs41/// ```ignoreCOMMENT
LOWcrates/tracing/src/layers.rs101COMMENT
LOWcrates/tasks/src/runtime.rs101 pub cpu_threads: Option<usize>,COMMENT
LOWcrates/tasks/src/runtime.rs301 cpu_pool: rayon::ThreadPool,COMMENT
LOWcrates/tasks/src/runtime.rs321 #[cfg(feature = "rayon")]COMMENT
LOWcrates/tasks/src/runtime.rs601 /// this reuses the same OS thread for all tasks submitted under the same `name`. The threadCOMMENT
LOWcrates/tasks/src/runtime.rs781 /// # ExampleCOMMENT
LOWcrates/tasks/src/runtime.rs821COMMENT
LOWcrates/tasks/src/lib.rs101 f()COMMENT
LOWcrates/tasks/src/pool.rs21///COMMENT
LOWcrates/tasks/src/pool.rs41 }COMMENT
LOWcrates/tasks/src/pool.rs161thread_local! {COMMENT
LOWcrates/tasks/src/pool.rs361 /// This borrows the thread-local worker for the entire duration of `f`. Do not yield to RayonCOMMENT
LOWcrates/tasks/src/pool.rs381 /// is not re-entrant: if Rayon runs another job on the same thread before `f` returns, any callCOMMENT
LOWcrates/tasks/src/lazy.rs1//! A lazily-resolved handle to a value computed on a background thread.COMMENT
LOWcrates/tasks/src/for_each_ordered.rs1use crossbeam_utils::CachePadded;COMMENT
LOWcrates/tasks/src/utils.rs41/// This is a hack: these threads are spawned by libraries that do not expose a way to hook intoCOMMENT
LOWcrates/net/network-types/src/backoff.rs1/// Describes the type of backoff should be applied.COMMENT
LOWcrates/net/network-types/src/peers/reputation.rs21/// The reputation change to apply to a peer that sent a bad message.COMMENT
LOWcrates/net/network-types/src/peers/reputation.rs61/// Various kinds of reputation changes.COMMENT
LOWcrates/net/network-types/src/peers/config.rs21/// A temporary timeout for ips on incoming connection attempts.COMMENT
LOWcrates/net/network-types/src/peers/config.rs121/// Minimum connection uptime before a peer is eligible for rotation eviction.COMMENT
LOWcrates/net/network-types/src/peers/config.rs141 ///COMMENT
LOWcrates/net/network-types/src/peers/config.rs161 pub ban_list: BanList,COMMENT
LOWcrates/net/network-types/src/peers/mod.rs21#[derive(Debug, Clone)]COMMENT
LOWcrates/net/network-types/src/peers/mod.rs161 self.kind.is_static()COMMENT
LOWcrates/net/network-types/src/session/config.rs21 DEFAULT_MAX_COUNT_PEERS_OUTBOUND as usize + DEFAULT_MAX_COUNT_PEERS_INBOUND as usize;COMMENT
LOWcrates/net/network-types/src/session/config.rs81 /// buffer size provides backpressure on the network I/O.COMMENT
LOWcrates/net/ecies/src/error.rs41 /// Error when checking the HMAC tag against the tag on the bodyCOMMENT
LOWcrates/net/ecies/src/error.rs81 /// Error when handshaking with a peer (ack / auth)COMMENT
LOWcrates/net/ecies/src/algorithm.rs101 return Err(ECIESErrorImpl::OutOfBounds { idx, len: arr.len() }.into())COMMENT
LOWcrates/net/ecies/src/algorithm.rs181 let x = ecdh_x(&self.public_key, secret_key);COMMENT
LOWcrates/net/ecies/src/algorithm.rs201 // Because the hash of kM is ultimately used as the mac key, we perform that hashing here.COMMENT
LOWcrates/net/ecies/src/mac.rs1//! # Ethereum MAC ModuleCOMMENT
LOWcrates/net/ecies/src/codec.rs21#[derive(Clone, Copy, Debug, PartialEq, Eq)]COMMENT
LOWcrates/net/discv5/src/error.rs1//! Errors interfacing with [`discv5::Discv5`].COMMENT
LOWcrates/net/discv5/src/error.rs21 /// Peer is unreachable over discovery.COMMENT
LOWcrates/net/discv5/src/config.rs21/// The default address for discv5 via UDP is IPv4.COMMENT
LOWcrates/net/discv5/src/config.rs41COMMENT
LOWcrates/net/discv5/src/config.rs61 /// Config used by [`discv5::Discv5`]. Contains the discovery listen socket.COMMENT
LOWcrates/net/discv5/src/config.rs81 /// IPv6 address to advertise in the local ENR instead of the listen socket address. SeeCOMMENT
LOWcrates/net/discv5/src/config.rs321 /// [`discv5::ListenConfig`].COMMENT
LOWcrates/net/discv5/src/lib.rs61/// Default is 0th index.COMMENT
LOWcrates/net/discv5/src/metrics.rs21 // KbucketsCOMMENT
1834 more matches not shown…
Hallucination Indicators50 hits · 495 pts
SeverityFileLineSnippetContext
CRITICALcrates/node/builder/src/launch/common.rs309 if !self.attachment.config.network.trusted_peers.is_empty() {CODE
CRITICALcrates/node/builder/src/launch/common.rs316 .extend(self.attachment.config.network.trusted_peers.clone());CODE
CRITICAL⚡crates/rpc/rpc-engine-api/src/engine_api.rs1157 self.inner.metrics.latency.get_blobs_v1.record(start.elapsed());CODE
CRITICAL⚡crates/rpc/rpc-engine-api/src/engine_api.rs1163 self.inner.metrics.blob_metrics.blob_count.increment(blobs_found as u64);CODE
CRITICAL⚡crates/rpc/rpc-engine-api/src/engine_api.rs1164 self.inner.metrics.blob_metrics.blob_misses.increment(blobs_missed as u64);CODE
CRITICAL⚡crates/rpc/rpc-engine-api/src/engine_api.rs1278 self.inner.metrics.blob_metrics.get_blobs_requests_success_total.increment(1);CODE
CRITICAL⚡crates/rpc/rpc-engine-api/src/engine_api.rs1280 self.inner.metrics.blob_metrics.get_blobs_requests_failure_total.increment(1);CODE
CRITICAL⚡crates/rpc/rpc-engine-api/src/engine_api.rs1283 self.inner.metrics.blob_metrics.get_blobs_requests_failure_total.increment(1);CODE
CRITICAL⚡crates/rpc/rpc-engine-api/src/engine_api.rs1297 self.inner.metrics.latency.get_blobs_v3.record(start.elapsed());CODE
CRITICAL⚡crates/rpc/rpc-engine-api/src/engine_api.rs1303 self.inner.metrics.blob_metrics.blob_count.increment(blobs_found as u64);CODE
CRITICAL⚡crates/rpc/rpc-engine-api/src/engine_api.rs1304 self.inner.metrics.blob_metrics.blob_misses.increment(blobs_missed as u64);CODE
CRITICAL⚡crates/rpc/rpc-engine-api/src/engine_api.rs1319 self.inner.metrics.latency.get_blobs_v4.record(start.elapsed());CODE
CRITICAL⚡crates/rpc/rpc-engine-api/src/engine_api.rs1325 self.inner.metrics.blob_metrics.blob_count.increment(blobs_found as u64);CODE
CRITICAL⚡crates/rpc/rpc-engine-api/src/engine_api.rs1326 self.inner.metrics.blob_metrics.blob_misses.increment(blobs_missed as u64);CODE
CRITICALcrates/rpc/rpc-engine-api/src/engine_api.rs173 self.inner.metrics.latency.new_payload_v1.record(elapsed);CODE
CRITICALcrates/rpc/rpc-engine-api/src/engine_api.rs201 self.inner.metrics.latency.new_payload_v2.record(elapsed);CODE
CRITICALcrates/rpc/rpc-engine-api/src/engine_api.rs231 self.inner.metrics.latency.new_payload_v3.record(elapsed);CODE
CRITICALcrates/rpc/rpc-engine-api/src/engine_api.rs261 self.inner.metrics.latency.new_payload_v4.record(elapsed);CODE
CRITICALcrates/rpc/rpc-engine-api/src/engine_api.rs293 self.inner.metrics.latency.new_payload_v5.record(elapsed);CODE
CRITICALcrates/rpc/rpc-engine-api/src/engine_api.rs323 self.inner.metrics.latency.new_payload_v6.record(start.elapsed());CODE
CRITICALcrates/rpc/rpc-engine-api/src/engine_api.rs365 self.inner.metrics.latency.fork_choice_updated_v1.record(start.elapsed());CODE
CRITICALcrates/rpc/rpc-engine-api/src/engine_api.rs390 self.inner.metrics.latency.fork_choice_updated_v2.record(start.elapsed());CODE
CRITICALcrates/rpc/rpc-engine-api/src/engine_api.rs415 self.inner.metrics.latency.fork_choice_updated_v3.record(start.elapsed());CODE
CRITICALcrates/rpc/rpc-engine-api/src/engine_api.rs445 self.inner.metrics.latency.fork_choice_updated_v4.record(start.elapsed());CODE
CRITICALcrates/rpc/rpc-engine-api/src/engine_api.rs478 self.inner.metrics.latency.fork_choice_updated_v5.record(start.elapsed());CODE
CRITICALcrates/rpc/rpc-engine-api/src/engine_api.rs505 self.inner.metrics.latency.get_inclusion_list_v1.record(start.elapsed());CODE
CRITICALcrates/rpc/rpc-engine-api/src/engine_api.rs575 self.inner.metrics.latency.get_payload_v1.record(start.elapsed());CODE
CRITICALcrates/rpc/rpc-engine-api/src/engine_api.rs600 self.inner.metrics.latency.get_payload_v2.record(start.elapsed());CODE
CRITICALcrates/rpc/rpc-engine-api/src/engine_api.rs625 self.inner.metrics.latency.get_payload_v3.record(start.elapsed());CODE
CRITICALcrates/rpc/rpc-engine-api/src/engine_api.rs650 self.inner.metrics.latency.get_payload_v4.record(start.elapsed());CODE
CRITICALcrates/rpc/rpc-engine-api/src/engine_api.rs677 self.inner.metrics.latency.get_payload_v5.record(start.elapsed());CODE
CRITICALcrates/rpc/rpc-engine-api/src/engine_api.rs700 self.inner.metrics.latency.get_payload_v6.record(start.elapsed());CODE
CRITICALcrates/rpc/rpc-engine-api/src/engine_api.rs835 self.inner.metrics.latency.get_payload_bodies_by_range_v1.record(start_time.elapsed());CODE
CRITICALcrates/rpc/rpc-engine-api/src/engine_api.rs863 self.inner.metrics.latency.get_payload_bodies_by_range_v2.record(start_time.elapsed());CODE
CRITICALcrates/rpc/rpc-engine-api/src/engine_api.rs1017 self.inner.metrics.latency.get_payload_bodies_by_hash_v1.record(start.elapsed());CODE
CRITICALcrates/rpc/rpc-engine-api/src/engine_api.rs1054 self.inner.metrics.latency.get_payload_bodies_by_hash_v2.record(start.elapsed());CODE
CRITICALcrates/rpc/rpc-engine-api/src/engine_api.rs1122 self.inner.metrics.latency.has_blobs.record(start.elapsed());CODE
CRITICALcrates/rpc/rpc-engine-api/src/engine_api.rs1261 self.inner.metrics.latency.get_blobs_v2.record(start.elapsed());CODE
CRITICALcrates/rpc/rpc-builder/src/metrics.rs116 self.metrics.inner.connection_metrics.requests_started_total.increment(1);CODE
CRITICALcrates/rpc/rpc-builder/src/metrics.rs130 self.metrics.inner.connection_metrics.batches_started_total.increment(1);CODE
CRITICALcrates/rpc/rpc-builder/src/metrics.rs157 self.metrics.inner.connection_metrics.connections_closed_total.increment(1);CODE
CRITICALcrates/rpc/rpc-builder/src/metrics.rs191 this.metrics.inner.connection_metrics.requests_finished_total.increment(1);CODE
CRITICALcrates/rpc/rpc-builder/src/metrics.rs192 this.metrics.inner.connection_metrics.request_time_seconds.record(elapsed);CODE
CRITICALcrates/rpc/rpc-builder/src/metrics.rs239 this.metrics.inner.connection_metrics.batches_finished_total.increment(1);CODE
CRITICALcrates/rpc/rpc-builder/src/metrics.rs240 this.metrics.inner.connection_metrics.batch_response_time_seconds.record(elapsed);CODE
CRITICAL⚡crates/engine/tree/src/tree/mod.rs2958 self.metrics.tree.reorgs.finalized.increment(1);CODE
CRITICAL⚡crates/engine/tree/src/tree/mod.rs2962 self.metrics.tree.reorgs.safe.increment(1);CODE
CRITICAL⚡crates/engine/tree/src/tree/mod.rs2964 self.metrics.tree.reorgs.head.increment(1);CODE
CRITICALcrates/engine/tree/src/tree/tests.rs307 let overlay_manager = self.tree.state.tree_state.overlay_manager.clone();CODE
CRITICALcrates/engine/tree/src/tree/tests.rs468 let overlay_manager = harness.tree.state.tree_state.overlay_manager.clone();CODE
Verbosity Indicators59 hits · 112 pts
SeverityFileLineSnippetContext
LOWcrates/transaction-pool/src/pool/txpool.rs435 // First we need to check if the given base fee is different than what's currently beingCOMMENT
LOWcrates/cli/commands/src/db/diff.rs216 // if the keys are different, we need to check if the key is in the other tableCOMMENT
LOW⚡crates/storage/provider/src/providers/database/mod.rs503 // Step 1: heal file-level inconsistencies (no pruning)COMMENT
LOW⚡crates/storage/provider/src/providers/database/mod.rs506 // Step 2: RocksDB consistency check (needs static files tx data)COMMENT
LOW⚡crates/storage/provider/src/providers/database/mod.rs509 // Step 3: Static file checkpoint consistency (may prune)COMMENT
LOW⚡crates/storage/provider/src/providers/database/mod.rs517 // Step 4: Heal finalized/safe block numbers that may be ahead of theCOMMENT
LOW…tes/storage/provider/src/providers/state/historical.rs113/// the target block number. In this case, we need to check if there's a previous shard.COMMENT
LOW…s/storage/provider/src/providers/static_file/writer.rs394 // Step 1: Read all three sources of truthCOMMENT
LOW…s/storage/provider/src/providers/static_file/writer.rs415 // Step 2: Validate sidecar offsets against actual NippyJar stateCOMMENT
LOW⚡…s/storage/provider/src/providers/static_file/writer.rs438 // Step 3: Determine correct state from synced files (source of truth)COMMENT
LOW⚡…s/storage/provider/src/providers/static_file/writer.rs442 // Step 4: Heal if header doesn't match validated truthCOMMENT
LOW⚡…age/provider/src/providers/static_file/writer_tests.rs463 // Step 1: Write 5 blocks (0-4), commitCOMMENT
LOW⚡…age/provider/src/providers/static_file/writer_tests.rs470 // Step 2: Append 5 more blocks (5-9) WITHOUT committingCOMMENT
LOW⚡…age/provider/src/providers/static_file/writer_tests.rs477 // Step 3: Prune to block 7 (should keep blocks 0-7, including uncommitted 5-7)COMMENT
LOW⚡…age/provider/src/providers/static_file/writer_tests.rs482 // Step 4: CommitCOMMENT
LOW⚡…age/provider/src/providers/static_file/writer_tests.rs486 // Step 5: Verify sidecar has 8 blocks, header has 8 blocks, rows are correctCOMMENT
LOW⚡…age/provider/src/providers/static_file/writer_tests.rs776 // Step 1: Write 10 blocks with 5 changes each, commitCOMMENT
LOW⚡…age/provider/src/providers/static_file/writer_tests.rs782 // Step 2: Corrupt sidecar by adding 3 fake blocks that point to valid butCOMMENT
LOW⚡…age/provider/src/providers/static_file/writer_tests.rs788 // Step 3: Reopen provider - healing runs and clamps sidecar to header's 10COMMENT
LOW⚡…age/provider/src/providers/static_file/writer_tests.rs797 // Step 4: Prune to block 6 (keep blocks 0-6, remove 7-9)COMMENT
LOW⚡…age/provider/src/providers/static_file/writer_tests.rs804 // Step 5: Verify sidecar has 7 blocks, header has 7 blocks, rows are correctCOMMENT
LOW⚡crates/storage/storage-overlay/src/changeset_cache.rs107 // Step 1: Get the trie changesets for the target block from cacheCOMMENT
LOW⚡crates/storage/storage-overlay/src/changeset_cache.rs116 // Step 2: Get the trie reverts for the state after the target block using the cacheCOMMENT
LOW⚡crates/storage/storage-overlay/src/changeset_cache.rs125 // Step 3: Create an InMemoryTrieCursorFactory with the revertsCOMMENT
LOW⚡crates/storage/storage-overlay/src/changeset_cache.rs130 // Step 4: Collect all account trie nodes that changed in the target blockCOMMENT
LOWcrates/storage/storage-overlay/src/changeset_cache.rs142 // Step 5: Collect all storage trie nodes that changed in the target blockCOMMENT
LOWcrates/trie/trie/src/proof_v2/mod.rs775 // Having just seeked forward we need to check if the cursor is now exhausted,COMMENT
LOW⚡crates/trie/sparse/tests/suite/take_updates.rs298 // Step 1: Remove key_c — with only 3 keys under the root branch, removing one causesCOMMENT
LOW⚡crates/trie/sparse/tests/suite/take_updates.rs305 // Step 2: Insert a new key at 0x03 — re-creates/modifies the branch structure at theCOMMENT
LOW⚡crates/trie/sparse/tests/suite/update_leaves.rs1149 // Step 1: Remove key_c to collapse the branch at 0x10..COMMENT
LOW⚡crates/trie/sparse/tests/suite/update_leaves.rs1157 // Step 2: Re-insert key_c with a new value — this re-creates the branch.COMMENT
LOW⚡crates/trie/sparse/tests/suite/update_leaves.rs1165 // Step 3: Update key_a — previously could be orphaned if branch collapseCOMMENT
LOWcrates/trie/sparse/tests/suite/update_leaves.rs1213 // Step 1: Remove key_a → branch collapses, key_b becomes the sole child.COMMENT
LOWcrates/trie/sparse/tests/suite/update_leaves.rs1234 // Step 2: Modify the remaining leaf's value — this must succeed after the collapseCOMMENT
LOW⚡crates/trie/sparse/tests/suite/lifecycle.rs345 // Step 2: Now send Changed for 2 of the touched keys + 1 new key.COMMENT
LOW⚡crates/trie/sparse/tests/suite/lifecycle.rs355 // Step 3: Compute root and verify against reference.COMMENT
LOW⚡crates/trie/sparse/tests/suite/lifecycle.rs412 // Step 2: Reveal the proof for the requested targets.COMMENT
LOW⚡crates/trie/sparse/tests/suite/lifecycle.rs416 // Step 3: Replace Touched with Changed(new_value) in the map.COMMENT
LOW⚡crates/trie/sparse/tests/suite/lifecycle.rs420 // Step 4: update_leaves again — key should now be drained.COMMENT
LOW⚡crates/trie/sparse/tests/suite/lifecycle.rs426 // Step 5: Compute root and verify against reference.COMMENT
LOW⚡crates/trie/sparse/tests/suite/lifecycle.rs457 // Step 1: Read existing leaf value via get_leaf_value.COMMENT
LOW⚡crates/trie/sparse/tests/suite/lifecycle.rs464 // Step 2: Decode the value and verify it matches expected.COMMENT
LOW⚡crates/trie/sparse/tests/suite/lifecycle.rs469 // Step 3: Modify the value (simulates changing balance while keeping storage root).COMMENT
LOW⚡crates/trie/sparse/tests/suite/lifecycle.rs473 // Step 4: Update the leaf with the re-encoded value.COMMENT
LOW⚡crates/trie/sparse/tests/suite/lifecycle.rs478 // Step 5: Compute root and verify against reference.COMMENT
LOW⚡crates/trie/sparse/tests/suite/lifecycle.rs508 // Step 1: find_leaf(existing_key, None) → ExistsCOMMENT
LOW⚡crates/trie/sparse/tests/suite/lifecycle.rs515 // Step 2: find_leaf(nonexistent_key, None) → NonExistentCOMMENT
LOW⚡crates/trie/sparse/tests/suite/lifecycle.rs522 // Step 3: Modify existing key2 and insert nonexistent_key.COMMENT
LOW⚡crates/trie/sparse/tests/suite/lifecycle.rs533 // Step 4: Compute root and verify against reference.COMMENT
LOW⚡crates/trie/sparse/tests/suite/lifecycle.rs542 // Step 5: find_leaf(nonexistent_key, None) → now ExistsCOMMENT
LOWcrates/trie/sparse/tests/suite/lifecycle.rs330 // Step 1: Prewarm 3 keys with Touched — all should be drained (paths are revealed).COMMENT
LOWcrates/trie/sparse/tests/suite/lifecycle.rs399 // Step 1: Touched on a key in group B's blinded subtrie → callback fires.COMMENT
LOWcrates/trie/sparse/src/arena/mod.rs973 // Step 1: Handle trivial roots that don't need the stack-based walk.COMMENT
LOWcrates/trie/sparse/src/arena/mod.rs1005 // Step 2: Walk dirty branches depth-first using `cursor.next`. Only dirty branchesCOMMENT
LOWcrates/exex/exex/src/notifications.rs329 /// If true, then we need to check if the ExEx head is on the canonical chain and if not,COMMENT
LOWcrates/exex/exex/src/notifications.rs332 /// If true, then we need to check if the ExEx head is behind the node head and if so, backfillCOMMENT
LOW⚡crates/engine/tree/src/persistence.rs666 // Step 1: save_blocks appends new entries 20..25 and commits immediately.COMMENT
LOW⚡crates/engine/tree/src/persistence.rs671 // Step 2: Pruner runs AFTER commit, so it reads state that includes 20..25.COMMENT
LOWcrates/ethereum/payload/src/lib.rs321 // There's only limited amount of blob space available per block, so we need to check ifCOMMENT
Decorative Section Separators37 hits · 111 pts
SeverityFileLineSnippetContext
MEDIUMcrates/tasks/src/runtime.rs284// ── RuntimeInner ──────────────────────────────────────────────────────COMMENT
MEDIUMcrates/tasks/src/runtime.rs353// ── Runtime ───────────────────────────────────────────────────────────COMMENT
MEDIUMcrates/tasks/src/runtime.rs370// ── Pool accessors ────────────────────────────────────────────────────COMMENT
MEDIUMcrates/tasks/src/runtime.rs460// ── Test helpers ──────────────────────────────────────────────────────COMMENT
MEDIUMcrates/tasks/src/runtime.rs499// ── Spawn methods ─────────────────────────────────────────────────────COMMENT
MEDIUMcrates/tasks/src/runtime.rs916// ── RuntimeBuilder ────────────────────────────────────────────────────COMMENT
MEDIUMcrates/transaction-pool/src/lib.rs120//! Queued ─────────→ BaseFee/Blob ────────→ PendingCOMMENT
MEDIUMcrates/transaction-pool/src/lib.rs123//! └────────────────────┴─────────────────────┘COMMENT
MEDIUMcrates/transaction-pool/src/traits.rs30//! └──────────┐ ┌────────────────┘COMMENT
MEDIUMcrates/trie/trie/src/proof_v2/mod.rs2999 // ── Construct cached branch at [6] ─────────────────────────────────────COMMENT
MEDIUMcrates/trie/trie/src/proof_v2/mod.rs3015 // ── Construct cached branch at [6,a,3] ────────────────────────────────COMMENT
MEDIUMcrates/trie/trie/src/proof_v2/mod.rs3044 // ── Verify root hash ───────────────────────────────────────────────────COMMENT
MEDIUMcrates/trie/trie/src/proof_v2/mod.rs3069 // ── Verify proof for key_c contains nodes on its path ──────────────────COMMENT
MEDIUMcrates/trie/trie/src/proof_v2/mod.rs3111 // ── Construct cached branch at [6] ─────────────────────────────────────COMMENT
MEDIUMcrates/trie/trie/src/proof_v2/mod.rs3127 // ── Construct cached branch at [6,a,8] ────────────────────────────────COMMENT
MEDIUMcrates/trie/trie/src/proof_v2/mod.rs3155 // ── Verify root hash ───────────────────────────────────────────────────COMMENT
MEDIUMcrates/trie/trie/src/proof_v2/mod.rs3180 // ── Verify proof for key_c contains nodes on its path ──────────────────COMMENT
MEDIUMbin/reth/tests/it/main.rs9// ── Helpers ──────────────────────────────────────────────────────────────────COMMENT
MEDIUMbin/reth/tests/it/main.rs62// ── Original tests (from PR #22069) ──────────────────────────────────────────COMMENT
MEDIUMbin/reth/tests/it/main.rs62// ── Original tests (from PR #22069) ──────────────────────────────────────────COMMENT
MEDIUMbin/reth/tests/it/main.rs110// ── Subcommand --help coverage ───────────────────────────────────────────────COMMENT
MEDIUMbin/reth/tests/it/main.rs246// ── `config --default` outputs valid TOML ────────────────────────────────────COMMENT
MEDIUMbin/reth/tests/it/main.rs261// ── `dump-genesis` outputs valid JSON ────────────────────────────────────────COMMENT
MEDIUMbin/reth/tests/it/main.rs284// ── Dev node: send transaction round-trip ────────────────────────────────────COMMENT
MEDIUM.github/workflows/bench-scheduled.yml70 # ---------------------------------------------------------------------------COMMENT
MEDIUM.github/workflows/bench-scheduled.yml72 # ---------------------------------------------------------------------------COMMENT
MEDIUM.github/workflows/bench-scheduled.yml281 # ---------------------------------------------------------------------------COMMENT
MEDIUM.github/workflows/bench-scheduled.yml283 # ---------------------------------------------------------------------------COMMENT
MEDIUM.github/workflows/bench-scheduled.yml1057 # ---------------------------------------------------------------------------COMMENT
MEDIUM.github/workflows/bench-scheduled.yml1059 # ---------------------------------------------------------------------------COMMENT
MEDIUM.github/scripts/bench-txgen-extract.sh23# --------------COMMENT
MEDIUM.github/scripts/bench-scheduled-refs.sh39# ==========================================================================COMMENT
MEDIUM.github/scripts/bench-scheduled-refs.sh41# ==========================================================================COMMENT
MEDIUM.github/scripts/bench-scheduled-refs.sh119# ==========================================================================COMMENT
MEDIUM.github/scripts/bench-scheduled-refs.sh121# ==========================================================================COMMENT
MEDIUM.github/scripts/bench-scheduled-refs.sh212# ==========================================================================COMMENT
MEDIUM.github/scripts/bench-scheduled-refs.sh214# ==========================================================================COMMENT
Structural Annotation Overuse56 hits · 108 pts
SeverityFileLineSnippetContext
LOW⚡crates/storage/provider/src/providers/database/mod.rs503 // Step 1: heal file-level inconsistencies (no pruning)COMMENT
LOW⚡crates/storage/provider/src/providers/database/mod.rs506 // Step 2: RocksDB consistency check (needs static files tx data)COMMENT
LOW⚡crates/storage/provider/src/providers/database/mod.rs509 // Step 3: Static file checkpoint consistency (may prune)COMMENT
LOW⚡crates/storage/provider/src/providers/database/mod.rs517 // Step 4: Heal finalized/safe block numbers that may be ahead of theCOMMENT
LOW…s/storage/provider/src/providers/static_file/writer.rs394 // Step 1: Read all three sources of truthCOMMENT
LOW…s/storage/provider/src/providers/static_file/writer.rs415 // Step 2: Validate sidecar offsets against actual NippyJar stateCOMMENT
LOW⚡…s/storage/provider/src/providers/static_file/writer.rs438 // Step 3: Determine correct state from synced files (source of truth)COMMENT
LOW⚡…s/storage/provider/src/providers/static_file/writer.rs442 // Step 4: Heal if header doesn't match validated truthCOMMENT
LOW⚡…age/provider/src/providers/static_file/writer_tests.rs463 // Step 1: Write 5 blocks (0-4), commitCOMMENT
LOW⚡…age/provider/src/providers/static_file/writer_tests.rs470 // Step 2: Append 5 more blocks (5-9) WITHOUT committingCOMMENT
LOW⚡…age/provider/src/providers/static_file/writer_tests.rs477 // Step 3: Prune to block 7 (should keep blocks 0-7, including uncommitted 5-7)COMMENT
LOW⚡…age/provider/src/providers/static_file/writer_tests.rs482 // Step 4: CommitCOMMENT
LOW⚡…age/provider/src/providers/static_file/writer_tests.rs486 // Step 5: Verify sidecar has 8 blocks, header has 8 blocks, rows are correctCOMMENT
LOW⚡…age/provider/src/providers/static_file/writer_tests.rs776 // Step 1: Write 10 blocks with 5 changes each, commitCOMMENT
LOW⚡…age/provider/src/providers/static_file/writer_tests.rs782 // Step 2: Corrupt sidecar by adding 3 fake blocks that point to valid butCOMMENT
LOW⚡…age/provider/src/providers/static_file/writer_tests.rs788 // Step 3: Reopen provider - healing runs and clamps sidecar to header's 10COMMENT
LOW⚡…age/provider/src/providers/static_file/writer_tests.rs797 // Step 4: Prune to block 6 (keep blocks 0-6, remove 7-9)COMMENT
LOW⚡…age/provider/src/providers/static_file/writer_tests.rs804 // Step 5: Verify sidecar has 7 blocks, header has 7 blocks, rows are correctCOMMENT
LOW⚡crates/storage/storage-overlay/src/changeset_cache.rs107 // Step 1: Get the trie changesets for the target block from cacheCOMMENT
LOW⚡crates/storage/storage-overlay/src/changeset_cache.rs116 // Step 2: Get the trie reverts for the state after the target block using the cacheCOMMENT
LOW⚡crates/storage/storage-overlay/src/changeset_cache.rs125 // Step 3: Create an InMemoryTrieCursorFactory with the revertsCOMMENT
LOW⚡crates/storage/storage-overlay/src/changeset_cache.rs130 // Step 4: Collect all account trie nodes that changed in the target blockCOMMENT
LOWcrates/storage/storage-overlay/src/changeset_cache.rs142 // Step 5: Collect all storage trie nodes that changed in the target blockCOMMENT
LOWcrates/storage/db-common/src/init.rs676/// NOTE: This function is not idempotent. If the process crashes mid-import, the databaseCOMMENT
LOWcrates/trie/trie/src/hashed_cursor/post_state.rs346 /// NOTE: This function will not return any entry unless [`HashedCursor::seek`] has been called.COMMENT
LOW⚡crates/trie/sparse/tests/suite/take_updates.rs298 // Step 1: Remove key_c — with only 3 keys under the root branch, removing one causesCOMMENT
LOW⚡crates/trie/sparse/tests/suite/take_updates.rs305 // Step 2: Insert a new key at 0x03 — re-creates/modifies the branch structure at theCOMMENT
LOW⚡crates/trie/sparse/tests/suite/update_leaves.rs1149 // Step 1: Remove key_c to collapse the branch at 0x10..COMMENT
LOW⚡crates/trie/sparse/tests/suite/update_leaves.rs1157 // Step 2: Re-insert key_c with a new value — this re-creates the branch.COMMENT
LOW⚡crates/trie/sparse/tests/suite/update_leaves.rs1165 // Step 3: Update key_a — previously could be orphaned if branch collapseCOMMENT
LOWcrates/trie/sparse/tests/suite/update_leaves.rs1213 // Step 1: Remove key_a → branch collapses, key_b becomes the sole child.COMMENT
LOWcrates/trie/sparse/tests/suite/update_leaves.rs1234 // Step 2: Modify the remaining leaf's value — this must succeed after the collapseCOMMENT
LOW⚡crates/trie/sparse/tests/suite/lifecycle.rs345 // Step 2: Now send Changed for 2 of the touched keys + 1 new key.COMMENT
LOW⚡crates/trie/sparse/tests/suite/lifecycle.rs355 // Step 3: Compute root and verify against reference.COMMENT
LOW⚡crates/trie/sparse/tests/suite/lifecycle.rs412 // Step 2: Reveal the proof for the requested targets.COMMENT
LOW⚡crates/trie/sparse/tests/suite/lifecycle.rs416 // Step 3: Replace Touched with Changed(new_value) in the map.COMMENT
LOW⚡crates/trie/sparse/tests/suite/lifecycle.rs420 // Step 4: update_leaves again — key should now be drained.COMMENT
LOW⚡crates/trie/sparse/tests/suite/lifecycle.rs426 // Step 5: Compute root and verify against reference.COMMENT
LOW⚡crates/trie/sparse/tests/suite/lifecycle.rs457 // Step 1: Read existing leaf value via get_leaf_value.COMMENT
LOW⚡crates/trie/sparse/tests/suite/lifecycle.rs464 // Step 2: Decode the value and verify it matches expected.COMMENT
LOW⚡crates/trie/sparse/tests/suite/lifecycle.rs469 // Step 3: Modify the value (simulates changing balance while keeping storage root).COMMENT
LOW⚡crates/trie/sparse/tests/suite/lifecycle.rs473 // Step 4: Update the leaf with the re-encoded value.COMMENT
LOW⚡crates/trie/sparse/tests/suite/lifecycle.rs478 // Step 5: Compute root and verify against reference.COMMENT
LOW⚡crates/trie/sparse/tests/suite/lifecycle.rs508 // Step 1: find_leaf(existing_key, None) → ExistsCOMMENT
LOW⚡crates/trie/sparse/tests/suite/lifecycle.rs515 // Step 2: find_leaf(nonexistent_key, None) → NonExistentCOMMENT
LOW⚡crates/trie/sparse/tests/suite/lifecycle.rs522 // Step 3: Modify existing key2 and insert nonexistent_key.COMMENT
LOW⚡crates/trie/sparse/tests/suite/lifecycle.rs533 // Step 4: Compute root and verify against reference.COMMENT
LOW⚡crates/trie/sparse/tests/suite/lifecycle.rs542 // Step 5: find_leaf(nonexistent_key, None) → now ExistsCOMMENT
LOWcrates/trie/sparse/tests/suite/lifecycle.rs330 // Step 1: Prewarm 3 keys with Touched — all should be drained (paths are revealed).COMMENT
LOWcrates/trie/sparse/tests/suite/lifecycle.rs399 // Step 1: Touched on a key in group B's blinded subtrie → callback fires.COMMENT
LOWcrates/trie/sparse/src/state.rs216 /// NOTE: This method does not extensively validate the proof.COMMENT
LOWcrates/trie/sparse/src/state.rs226 /// NOTE: This method does not extensively validate the proof.COMMENT
LOWcrates/trie/sparse/src/arena/mod.rs973 // Step 1: Handle trivial roots that don't need the stack-based walk.COMMENT
LOWcrates/trie/sparse/src/arena/mod.rs1005 // Step 2: Walk dirty branches depth-first using `cursor.next`. Only dirty branchesCOMMENT
LOW⚡crates/engine/tree/src/persistence.rs666 // Step 1: save_blocks appends new entries 20..25 and commits immediately.COMMENT
LOW⚡crates/engine/tree/src/persistence.rs671 // Step 2: Pruner runs AFTER commit, so it reads state that includes 20..25.COMMENT
Hyper-Verbose Identifiers60 hits · 58 pts
SeverityFileLineSnippetContext
LOW.github/scripts/test_bench_call_summary.py181 def test_matching_runs_report_no_mismatches(self):CODE
LOW.github/scripts/test_bench_call_summary.py199 def test_feature_content_mismatch_fails_the_verdict(self):CODE
LOW.github/scripts/test_bench_call_summary.py213 def test_kind_mismatch_is_reported_separately(self):CODE
LOW.github/scripts/test_bench_call_summary.py227 def test_unstable_record_is_excluded_from_parity(self):CODE
LOW.github/scripts/test_bench_call_summary.py244 def test_stable_record_regression_survives_an_unstable_record(self):CODE
LOW.github/scripts/test_bench_call_summary.py262 def test_feature_only_nondeterminism_on_a_stable_record_is_a_mismatch(self):CODE
LOW.github/scripts/test_bench_call_summary.py275 def test_baseline_nondeterminism_only_excludes_that_record(self):CODE
LOW.github/scripts/test_bench_call_summary.py283 def test_all_records_unstable_is_inconclusive(self):CODE
LOW.github/scripts/test_bench_call_summary.py294 def test_record_median_interval_follows_run_to_run_noise(self):CODE
LOW.github/scripts/test_bench_call_summary.py309 def test_record_median_regression_is_not_hidden_by_record_spread(self):CODE
LOW.github/scripts/test_bench_call_summary.py326 def test_mixed_method_corpus_reports_per_method(self):CODE
LOW⚡.github/scripts/test_bench_call_summary.py339 def test_single_method_corpus_omits_per_method_table(self):CODE
LOW⚡.github/scripts/test_bench_call_summary.py346 def test_head_hash_mismatch_is_refused(self):CODE
LOW⚡.github/scripts/test_bench_call_summary.py352 def test_nested_call_report_schema_is_read(self):CODE
LOW.github/scripts/test_bench_call_summary.py384 def test_record_answered_in_one_arm_only_is_a_divergence(self):CODE
LOW.github/scripts/test_bench_call_summary.py399 def test_corpus_metadata_is_included(self):CODE
LOW.github/scripts/bench-reth-charts.py54def plot_latency_and_throughput(CODE
LOW.github/scripts/bench-target-metric-sample-filter.py34def target_metric_sample_names(config: dict) -> list[str]:CODE
LOW.github/scripts/test_bench_elapsed_metrics.py71 def test_persistence_savings_survive_slower_execution(self):CODE
LOW⚡.github/scripts/test_bench_elapsed_metrics.py96 def test_average_run_throughput_not_ratio_of_averages(self):CODE
LOW⚡.github/scripts/test_bench_elapsed_metrics.py106 def test_run_count_does_not_inflate_elapsed_time(self):CODE
LOW⚡.github/scripts/test_bench_elapsed_metrics.py113 def test_single_run_elapsed_verdict_is_informational(self):CODE
LOW⚡.github/scripts/test_bench_elapsed_metrics.py122 def test_missing_report_does_not_fabricate_wall_clock(self):CODE
LOW.github/scripts/test_bench_elapsed_metrics.py134 def test_invalid_duration_rejected(self):CODE
LOW.github/scripts/test_bench_elapsed_metrics.py141 def test_mismatched_report_rejected(self):CODE
LOW⚡.github/scripts/bench-reth-summary.py176def target_metric_query_encodes_seconds(query: str) -> bool:CODE
LOW⚡.github/scripts/bench-reth-summary.py181def target_metric_counter_encodes_seconds(query: str) -> bool:CODE
LOW⚡.github/scripts/bench-reth-summary.py185def target_metric_min_value_pct_total_latency(config: dict) -> float | None:CODE
LOW.github/scripts/bench-reth-summary.py142def parse_target_metric_query(query: str) -> tuple[str, str, dict[str, str]]:CODE
LOW.github/scripts/bench-reth-summary.py160def format_target_metric_query(metric_name: str, labels: dict[str, str]) -> str:CODE
LOW.github/scripts/bench-reth-summary.py736def target_metric_identity_key(labels: dict[str, str]) -> tuple[tuple[str, str], ...]:CODE
LOW.github/scripts/bench-reth-summary.py740def target_metric_candidate_identity_labels(CODE
LOW.github/scripts/bench-reth-summary.py752def target_metric_variable_identity_label_keys(CODE
LOW.github/scripts/bench-reth-summary.py776def target_metric_identity_labels(CODE
LOW.github/scripts/bench-reth-summary.py789def target_metric_display_query(query: str, identity_labels: dict[str, str] | None = None) -> str:CODE
LOW.github/scripts/bench-reth-summary.py797def group_query_samples_by_identity(CODE
LOW.github/scripts/bench-reth-summary.py833def collect_metric_identities(grouped_scrapes: list[dict]) -> dict[tuple[tuple[str, str], ...], dict[str, str]]:CODE
LOW.github/scripts/bench-reth-summary.py841def format_target_metric_identity(query: str, identity_labels: dict[str, str]) -> str:CODE
LOW.github/scripts/bench-reth-summary.py857def load_target_metric_scrapes(path: str) -> list[dict]:CODE
LOW.github/scripts/bench-reth-summary.py899def compute_target_metric_series_stats(values: list[float]) -> dict[str, float]:CODE
LOW.github/scripts/bench-reth-summary.py911def counter_target_metric_stat_value(values: list[float], stat_name: str) -> float:CODE
LOW.github/scripts/bench-reth-summary.py923def paired_target_metric_observations(CODE
LOW.github/scripts/bench-reth-summary.py949def target_metric_run_stat_value(run: dict, stat_name: str) -> float:CODE
LOW.github/scripts/bench-reth-summary.py962def _target_metric_cluster_ci(CODE
LOW.github/scripts/bench-reth-summary.py987def _target_metric_single_run_ci(CODE
LOW.github/scripts/bench-reth-summary.py1005def compute_target_metric_change(CODE
LOW.github/scripts/bench-reth-summary.py1116def query_counter_target_metric_run(CODE
LOW.github/scripts/bench-reth-summary.py1204def query_histogram_target_metric_run(CODE
LOW.github/scripts/bench-reth-summary.py1298def load_target_metric_run_context(path: str) -> dict:CODE
LOW.github/scripts/bench-reth-summary.py1322def collect_target_metric_identity_label_keys(CODE
LOW.github/scripts/bench-reth-summary.py1393def summarize_target_metric_runs(run_items: list[dict], fields: tuple[str, ...]) -> dict:CODE
LOW.github/scripts/bench-reth-summary.py1399def summarize_target_metric_change(changes: dict[str, dict], display_stats: tuple[str, ...]) -> dict:CODE
LOW.github/scripts/bench-reth-summary.py1413def collect_query_metric_identities(CODE
LOW.github/scripts/bench-reth-summary.py1453def build_target_metric_entry(CODE
LOW.github/scripts/bench-reth-summary.py1517def compute_target_metric_summary(CODE
LOW.github/scripts/bench-reth-summary.py1733def generate_comparison_table(CODE
LOW.github/scripts/bench-reth-summary.py1858def generate_target_metric_table(target_metrics: dict | None) -> str:CODE
LOW.github/scripts/bench-reth-summary.py1979def resolve_observability_range(CODE
LOW.github/scripts/bench-reth-summary.py1997def generate_observability_section(summary: dict) -> list[str]:CODE
LOW.github/scripts/fetch-grafana-dashboard.py85def has_expression_datasource(dashboard: dict) -> bool:CODE
Synthetic Comment Markers2 hits · 15 pts
SeverityFileLineSnippetContext
HIGHcrates/trie/common/src/proofs.rs818 /// Array of storage proofs as requested.COMMENT
HIGHcrates/trie/common/src/proofs.rs1025 /// Array of storage proofs as requested.COMMENT
AI Slop Vocabulary4 hits · 12 pts
SeverityFileLineSnippetContext
MEDIUMcrates/stages/stages/src/stages/sender_recovery.rs341 // However, using `std::thread::spawn` allows us to utilize the timeout graceCOMMENT
MEDIUMcrates/storage/storage-api/src/receipts.rs49 /// because it can leverage the underlying `receipts_by_tx_range` for the entire transactionCOMMENT
MEDIUMcrates/storage/libmdbx-rs/src/flags.rs9 /// Default robust and durable sync mode.COMMENT
MEDIUM…ne/tree/src/tree/payload_processor/bal_prewarm_pool.rs135/// In order to utilize the parallelism of `NVMe` we have to give it enough work, or equally,COMMENT
Self-Referential Comments4 hits · 12 pts
SeverityFileLineSnippetContext
MEDIUMcrates/rpc/rpc/src/eth/core.rs100 /// # Create an instance with noop ethereum implementationsCOMMENT
MEDIUMcrates/rpc/rpc/src/eth/filter.rs129 /// # Create a new instance with [`EthApi`](crate::EthApi)COMMENT
MEDIUM.github/scripts/hive/ignored_tests.yaml3# This file contains tests that should be ignored for various reasons (flaky, known issues, etc).COMMENT
MEDIUM.github/scripts/hive/build_simulators.sh23# Create the hive_assets directoryCOMMENT
Example Usage Blocks3 hits · 4 pts
SeverityFileLineSnippetContext
LOWscripts/patch-alloy.sh4# Usage:COMMENT
LOW.github/scripts/bench-benchmarkoor-run.sh5# Usage:COMMENT
LOW.github/scripts/verify_image_arch.sh4# Usage:COMMENT
Unused Imports5 hits · 4 pts
SeverityFileLineSnippetContext
LOW.github/scripts/test_bench_call_summary.py7CODE
LOW.github/scripts/bench-call-summary.py26CODE
LOW.github/scripts/bench-benchmarkoor-summary.py4CODE
LOW.github/scripts/bench-target-metric-sample-filter.py4CODE
LOW.github/scripts/bench-reth-summary.py21CODE
Redundant / Tautological Comments3 hits · 4 pts
SeverityFileLineSnippetContext
LOW.github/scripts/hive/run_simulator.sh41 # Check if no tests were run. sed removes ansi colorsCOMMENT
LOW.github/scripts/hive/parse.py36 # Check if this is an ignored testCOMMENT
LOW.github/scripts/hive/parse.py66# Check if there are any unexpected failures or passes and exit with errorCOMMENT
Deep Nesting3 hits · 2 pts
SeverityFileLineSnippetContext
LOW.github/scripts/bench-call-summary.py515CODE
LOW.github/scripts/bench-reth-summary.py1517CODE
LOW.github/scripts/fetch-grafana-dashboard.py89CODE
Excessive Try-Catch Wrapping1 hit · 2 pts
SeverityFileLineSnippetContext
MEDIUM.github/workflows/grafana.yml35 print(f'Error: {e}', file=sys.stderr)CODE