Modular, contributor-friendly and blazing-fast implementation of the Ethereum protocol, in Rust
This report presents the forensic synthetic code analysis of paradigmxyz/reth, a Rust project with 5,694 GitHub stars. SynthScan v2.0 examined 523,299 lines of code across 1585 source files, recording 2058 pattern matches distributed across 14 syntactic categories. The overall adjusted score of 4.7 places this repository in the Likely human-written band.
The scanner applied 160+ deterministic lexical heuristics, multi-line block detectors, abstract syntax tree depth profilers, and a cross-file Jaccard similarity matrix to construct a statistically normalised synthetic code estimate. All matches are individually weighted by severity coefficient and contextual multiplier before summation, and the resulting headline score is temporally discounted to account for the repository's development history relative to the commercial emergence of large language model coding tooling (November 2022 onward).
This chart maps the temporal evolution of the adjusted synthetic code score across successive scan runs. An upward trajectory indicates ongoing incorporation of AI-generated code or expanding LLM-assisted scaffolding; a stable or declining trajectory may reflect active human refactoring, code removal, or the adoption of stricter authorship policies. The dashed secondary line (right axis) independently tracks total raw pattern hit count, which can diverge from the normalised score when codebase size changes significantly between scans.
Classifies detected patterns by their diagnostic confidence and structural impact. CRITICAL patterns (coefficient 10) represent definitive synthetic signatures — hallucinated imports, explicit LLM attribution metadata — virtually never produced by human authors. HIGH (5) indicates strong structural tells such as cross-file repetition or cross-linguistic idioms. MEDIUM (2) covers recognisable conversational padding and AI-specific vocabulary. LOW (1) captures subtle indicators like tautological comments and generic boilerplate that require density to carry independent signal.
This horizontal bar chart decomposes the repository's raw synthetic code score by top-level directory, allowing you to pinpoint precisely which modules or components carry the highest AI authorship density. Directories with disproportionately high scores relative to their size warrant targeted manual review: concentrated AI signatures often trace back to mass-generated configuration layers, auto-ported test suites, LLM-scaffolded boilerplate classes, or entire subsystems authored under heavy copilot assistance. Use this view to prioritise your human code-review effort.
The scanner identified 2058 distinct pattern matches across 14 syntactic categories. Each entry below represents a discrete location in the source code where the engine recorded a statistically significant AI authorship indicator. 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 diagnostic confidence level (CRITICAL / HIGH / MEDIUM / LOW). The Context column identifies whether the match occurred inside executable code, an inline comment, or a string literal — comment-context matches receive a ×1.5 weight because LLMs systematically over-annotate. The ⚡ bolt icon marks clustered matches: three or more patterns within a 10-line window, each receiving an additional ×1.5 density multiplier as dense clusters constitute far stronger evidence of synthetic authorship than isolated hits.
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | AGENTS.md | 361 | ```rust | COMMENT |
| LOW | CLAUDE.md | 361 | ```rust | COMMENT |
| LOW | crates/metrics/src/lib.rs | 1 | //! Collection of metrics utilities. | COMMENT |
| LOW | crates/metrics/src/common/mpsc.rs | 441 | /// so the budget tracks bytes *currently in the channel queue*, not bytes in flight | COMMENT |
| LOW | crates/consensus/consensus/src/lib.rs | 1 | //! Consensus protocol functions | COMMENT |
| LOW | crates/consensus/consensus/src/lib.rs | 61 | SealedHeader, | COMMENT |
| LOW | crates/consensus/consensus/src/lib.rs | 101 | ) -> Result<(), ConsensusError>; | COMMENT |
| LOW | crates/consensus/consensus/src/lib.rs | 141 | } | COMMENT |
| LOW | crates/consensus/consensus/src/lib.rs | 241 | COMMENT | |
| LOW | crates/consensus/consensus/src/lib.rs | 481 | /// The block's timestamp. | COMMENT |
| LOW | crates/consensus/consensus/src/noop.rs | 1 | //! A consensus implementation that does nothing. | COMMENT |
| LOW | crates/tracing/src/log_handle.rs | 61 | LOG_HANDLE.lock().expect("log handle poisoned").is_available() | COMMENT |
| LOW | crates/tracing/src/lib.rs | 1 | //! The `tracing` module provides functionalities for setting up and configuring logging. | COMMENT |
| LOW | crates/tracing/src/lib.rs | 21 | //! LogFormat::Json, | COMMENT |
| LOW | crates/tracing/src/lib.rs | 201 | } | COMMENT |
| LOW | crates/tracing/src/lib.rs | 241 | /// Trait defining a general interface for logging configuration. | COMMENT |
| LOW | crates/tracing/src/lib.rs | 261 | /// | COMMENT |
| LOW | crates/tracing/src/formatter.rs | 1 | use crate::layers::BoxedLayer; | COMMENT |
| LOW | crates/tracing/src/formatter.rs | 21 | LogFmt, | COMMENT |
| LOW | crates/tracing/src/layers.rs | 101 | COMMENT | |
| LOW | crates/tasks/src/runtime.rs | 101 | pub reserved_cpu_cores: usize, | COMMENT |
| LOW | crates/tasks/src/runtime.rs | 261 | /// Handle to the tokio runtime. | COMMENT |
| LOW | crates/tasks/src/runtime.rs | 281 | #[cfg(feature = "rayon")] | COMMENT |
| LOW | crates/tasks/src/runtime.rs | 301 | /// Handle to the spawned [`TaskManager`] background task. | COMMENT |
| LOW | crates/tasks/src/runtime.rs | 521 | { | COMMENT |
| LOW | crates/tasks/src/runtime.rs | 721 | /// | COMMENT |
| LOW | crates/tasks/src/runtime.rs | 761 | /// This spawns a regular task onto the runtime. | COMMENT |
| LOW | crates/tasks/src/lib.rs | 101 | .unwrap_or_else(|e| panic!("failed to spawn scoped thread {name:?}: {e}")) | COMMENT |
| LOW | crates/tasks/src/pool.rs | 21 | /// | COMMENT |
| LOW | crates/tasks/src/pool.rs | 41 | } | COMMENT |
| LOW | crates/tasks/src/pool.rs | 161 | thread_local! { | COMMENT |
| LOW | crates/tasks/src/lazy.rs | 1 | //! A lazily-resolved handle to a value computed on a background thread. | COMMENT |
| LOW | crates/tasks/src/for_each_ordered.rs | 1 | use crossbeam_utils::CachePadded; | COMMENT |
| LOW | crates/tasks/src/utils.rs | 41 | /// This is a hack: these threads are spawned by libraries that do not expose a way to hook into | COMMENT |
| LOW | crates/net/network-types/src/backoff.rs | 1 | /// Describes the type of backoff should be applied. | COMMENT |
| LOW | crates/net/network-types/src/peers/reputation.rs | 21 | /// The reputation change to apply to a peer that sent a bad message. | COMMENT |
| LOW | crates/net/network-types/src/peers/reputation.rs | 61 | /// Various kinds of reputation changes. | COMMENT |
| LOW | crates/net/network-types/src/peers/config.rs | 21 | /// A temporary timeout for ips on incoming connection attempts. | COMMENT |
| LOW | crates/net/network-types/src/peers/config.rs | 121 | /// Minimum connection uptime before a peer is eligible for rotation eviction. | COMMENT |
| LOW | crates/net/network-types/src/peers/config.rs | 141 | /// | COMMENT |
| LOW | crates/net/network-types/src/peers/config.rs | 161 | pub ban_list: BanList, | COMMENT |
| LOW | crates/net/network-types/src/peers/mod.rs | 21 | #[derive(Debug, Clone)] | COMMENT |
| LOW | crates/net/network-types/src/peers/mod.rs | 161 | matches!(self.kind, PeerKind::Static) | COMMENT |
| LOW | crates/net/network-types/src/session/config.rs | 21 | DEFAULT_MAX_COUNT_PEERS_OUTBOUND as usize + DEFAULT_MAX_COUNT_PEERS_INBOUND as usize; | COMMENT |
| LOW | crates/net/network-types/src/session/config.rs | 81 | /// buffer size provides backpressure on the network I/O. | COMMENT |
| LOW | crates/net/ecies/src/error.rs | 41 | /// Error when checking the HMAC tag against the tag on the body | COMMENT |
| LOW | crates/net/ecies/src/error.rs | 81 | /// Error when handshaking with a peer (ack / auth) | COMMENT |
| LOW | crates/net/ecies/src/algorithm.rs | 101 | return Err(ECIESErrorImpl::OutOfBounds { idx, len: arr.len() }.into()) | COMMENT |
| LOW | crates/net/ecies/src/algorithm.rs | 181 | let x = ecdh_x(&self.public_key, secret_key); | COMMENT |
| LOW | crates/net/ecies/src/algorithm.rs | 201 | // Because the hash of kM is ultimately used as the mac key, we perform that hashing here. | COMMENT |
| LOW | crates/net/ecies/src/mac.rs | 1 | //! # Ethereum MAC Module | COMMENT |
| LOW | crates/net/ecies/src/codec.rs | 21 | #[derive(Clone, Copy, Debug, PartialEq, Eq)] | COMMENT |
| LOW | crates/net/discv5/src/error.rs | 1 | //! Errors interfacing with [`discv5::Discv5`]. | COMMENT |
| LOW | crates/net/discv5/src/error.rs | 21 | /// Peer is unreachable over discovery. | COMMENT |
| LOW | crates/net/discv5/src/config.rs | 21 | /// The default address for discv5 via UDP is IPv4. | COMMENT |
| LOW | crates/net/discv5/src/config.rs | 41 | COMMENT | |
| LOW | crates/net/discv5/src/config.rs | 61 | /// Config used by [`discv5::Discv5`]. Contains the discovery listen socket. | COMMENT |
| LOW | crates/net/discv5/src/config.rs | 81 | /// IPv6 address to advertise in the local ENR instead of the listen socket address. See | COMMENT |
| LOW | crates/net/discv5/src/config.rs | 301 | pub struct Config { | COMMENT |
| LOW | crates/net/discv5/src/lib.rs | 61 | /// Default is 0th index. | COMMENT |
| 1731 more matches not shown… | ||||
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| CRITICAL | crates/node/builder/src/launch/common.rs | 308 | if !self.attachment.config.network.trusted_peers.is_empty() { | CODE |
| CRITICAL | crates/node/builder/src/launch/common.rs | 315 | .extend(self.attachment.config.network.trusted_peers.clone()); | CODE |
| CRITICAL⚡ | crates/rpc/rpc-engine-api/src/engine_api.rs | 985 | self.inner.metrics.latency.get_blobs_v1.record(start.elapsed()); | CODE |
| CRITICAL⚡ | crates/rpc/rpc-engine-api/src/engine_api.rs | 991 | self.inner.metrics.blob_metrics.blob_count.increment(blobs_found as u64); | CODE |
| CRITICAL⚡ | crates/rpc/rpc-engine-api/src/engine_api.rs | 992 | self.inner.metrics.blob_metrics.blob_misses.increment(blobs_missed as u64); | CODE |
| CRITICAL⚡ | crates/rpc/rpc-engine-api/src/engine_api.rs | 1104 | self.inner.metrics.blob_metrics.get_blobs_requests_success_total.increment(1); | CODE |
| CRITICAL⚡ | crates/rpc/rpc-engine-api/src/engine_api.rs | 1106 | self.inner.metrics.blob_metrics.get_blobs_requests_failure_total.increment(1); | CODE |
| CRITICAL⚡ | crates/rpc/rpc-engine-api/src/engine_api.rs | 1109 | self.inner.metrics.blob_metrics.get_blobs_requests_failure_total.increment(1); | CODE |
| CRITICAL⚡ | crates/rpc/rpc-engine-api/src/engine_api.rs | 1123 | self.inner.metrics.latency.get_blobs_v3.record(start.elapsed()); | CODE |
| CRITICAL⚡ | crates/rpc/rpc-engine-api/src/engine_api.rs | 1129 | self.inner.metrics.blob_metrics.blob_count.increment(blobs_found as u64); | CODE |
| CRITICAL⚡ | crates/rpc/rpc-engine-api/src/engine_api.rs | 1130 | self.inner.metrics.blob_metrics.blob_misses.increment(blobs_missed as u64); | CODE |
| CRITICAL⚡ | crates/rpc/rpc-engine-api/src/engine_api.rs | 1145 | self.inner.metrics.latency.get_blobs_v4.record(start.elapsed()); | CODE |
| CRITICAL⚡ | crates/rpc/rpc-engine-api/src/engine_api.rs | 1151 | self.inner.metrics.blob_metrics.blob_count.increment(blobs_found as u64); | CODE |
| CRITICAL⚡ | crates/rpc/rpc-engine-api/src/engine_api.rs | 1152 | self.inner.metrics.blob_metrics.blob_misses.increment(blobs_missed as u64); | CODE |
| CRITICAL | crates/rpc/rpc-engine-api/src/engine_api.rs | 171 | self.inner.metrics.latency.new_payload_v1.record(elapsed); | CODE |
| CRITICAL | crates/rpc/rpc-engine-api/src/engine_api.rs | 199 | self.inner.metrics.latency.new_payload_v2.record(elapsed); | CODE |
| CRITICAL | crates/rpc/rpc-engine-api/src/engine_api.rs | 229 | self.inner.metrics.latency.new_payload_v3.record(elapsed); | CODE |
| CRITICAL | crates/rpc/rpc-engine-api/src/engine_api.rs | 259 | self.inner.metrics.latency.new_payload_v4.record(elapsed); | CODE |
| CRITICAL | crates/rpc/rpc-engine-api/src/engine_api.rs | 291 | self.inner.metrics.latency.new_payload_v5.record(elapsed); | CODE |
| CRITICAL | crates/rpc/rpc-engine-api/src/engine_api.rs | 333 | self.inner.metrics.latency.fork_choice_updated_v1.record(start.elapsed()); | CODE |
| CRITICAL | crates/rpc/rpc-engine-api/src/engine_api.rs | 358 | self.inner.metrics.latency.fork_choice_updated_v2.record(start.elapsed()); | CODE |
| CRITICAL | crates/rpc/rpc-engine-api/src/engine_api.rs | 383 | self.inner.metrics.latency.fork_choice_updated_v3.record(start.elapsed()); | CODE |
| CRITICAL | crates/rpc/rpc-engine-api/src/engine_api.rs | 413 | self.inner.metrics.latency.fork_choice_updated_v4.record(start.elapsed()); | CODE |
| CRITICAL | crates/rpc/rpc-engine-api/src/engine_api.rs | 483 | self.inner.metrics.latency.get_payload_v1.record(start.elapsed()); | CODE |
| CRITICAL | crates/rpc/rpc-engine-api/src/engine_api.rs | 508 | self.inner.metrics.latency.get_payload_v2.record(start.elapsed()); | CODE |
| CRITICAL | crates/rpc/rpc-engine-api/src/engine_api.rs | 533 | self.inner.metrics.latency.get_payload_v3.record(start.elapsed()); | CODE |
| CRITICAL | crates/rpc/rpc-engine-api/src/engine_api.rs | 558 | self.inner.metrics.latency.get_payload_v4.record(start.elapsed()); | CODE |
| CRITICAL | crates/rpc/rpc-engine-api/src/engine_api.rs | 585 | self.inner.metrics.latency.get_payload_v5.record(start.elapsed()); | CODE |
| CRITICAL | crates/rpc/rpc-engine-api/src/engine_api.rs | 608 | self.inner.metrics.latency.get_payload_v6.record(start.elapsed()); | CODE |
| CRITICAL | crates/rpc/rpc-engine-api/src/engine_api.rs | 704 | self.inner.metrics.latency.get_payload_bodies_by_range_v1.record(start_time.elapsed()); | CODE |
| CRITICAL | crates/rpc/rpc-engine-api/src/engine_api.rs | 760 | self.inner.metrics.latency.get_payload_bodies_by_range_v2.record(start_time.elapsed()); | CODE |
| CRITICAL | crates/rpc/rpc-engine-api/src/engine_api.rs | 845 | self.inner.metrics.latency.get_payload_bodies_by_hash_v1.record(start.elapsed()); | CODE |
| CRITICAL | crates/rpc/rpc-engine-api/src/engine_api.rs | 882 | self.inner.metrics.latency.get_payload_bodies_by_hash_v2.record(start.elapsed()); | CODE |
| CRITICAL | crates/rpc/rpc-engine-api/src/engine_api.rs | 950 | self.inner.metrics.latency.has_blobs.record(start.elapsed()); | CODE |
| CRITICAL | crates/rpc/rpc-engine-api/src/engine_api.rs | 1087 | self.inner.metrics.latency.get_blobs_v2.record(start.elapsed()); | CODE |
| CRITICAL | crates/rpc/rpc-builder/src/metrics.rs | 116 | self.metrics.inner.connection_metrics.requests_started_total.increment(1); | CODE |
| CRITICAL | crates/rpc/rpc-builder/src/metrics.rs | 130 | self.metrics.inner.connection_metrics.batches_started_total.increment(1); | CODE |
| CRITICAL | crates/rpc/rpc-builder/src/metrics.rs | 157 | self.metrics.inner.connection_metrics.connections_closed_total.increment(1); | CODE |
| CRITICAL | crates/rpc/rpc-builder/src/metrics.rs | 191 | this.metrics.inner.connection_metrics.requests_finished_total.increment(1); | CODE |
| CRITICAL | crates/rpc/rpc-builder/src/metrics.rs | 192 | this.metrics.inner.connection_metrics.request_time_seconds.record(elapsed); | CODE |
| CRITICAL | crates/rpc/rpc-builder/src/metrics.rs | 239 | this.metrics.inner.connection_metrics.batches_finished_total.increment(1); | CODE |
| CRITICAL | crates/rpc/rpc-builder/src/metrics.rs | 240 | this.metrics.inner.connection_metrics.batch_response_time_seconds.record(elapsed); | CODE |
| CRITICAL⚡ | crates/engine/tree/src/tree/mod.rs | 2742 | self.metrics.tree.reorgs.finalized.increment(1); | CODE |
| CRITICAL⚡ | crates/engine/tree/src/tree/mod.rs | 2746 | self.metrics.tree.reorgs.safe.increment(1); | CODE |
| CRITICAL⚡ | crates/engine/tree/src/tree/mod.rs | 2748 | self.metrics.tree.reorgs.head.increment(1); | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | crates/transaction-pool/src/pool/txpool.rs | 396 | // First we need to check if the given base fee is different than what's currently being | COMMENT |
| LOW | crates/cli/commands/src/db/diff.rs | 216 | // if the keys are different, we need to check if the key is in the other table | COMMENT |
| LOW⚡ | crates/storage/provider/src/providers/database/mod.rs | 522 | // Step 1: heal file-level inconsistencies (no pruning) | COMMENT |
| LOW⚡ | crates/storage/provider/src/providers/database/mod.rs | 525 | // Step 2: RocksDB consistency check (needs static files tx data) | COMMENT |
| LOW⚡ | crates/storage/provider/src/providers/database/mod.rs | 528 | // Step 3: Static file checkpoint consistency (may prune) | COMMENT |
| LOW⚡ | crates/storage/provider/src/providers/database/mod.rs | 536 | // Step 4: Heal finalized/safe block numbers that may be ahead of the | COMMENT |
| LOW | …tes/storage/provider/src/providers/state/historical.rs | 816 | /// 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.rs | 394 | // Step 1: Read all three sources of truth | COMMENT |
| LOW | …s/storage/provider/src/providers/static_file/writer.rs | 415 | // Step 2: Validate sidecar offsets against actual NippyJar state | COMMENT |
| LOW⚡ | …s/storage/provider/src/providers/static_file/writer.rs | 438 | // Step 3: Determine correct state from synced files (source of truth) | COMMENT |
| LOW⚡ | …s/storage/provider/src/providers/static_file/writer.rs | 442 | // Step 4: Heal if header doesn't match validated truth | COMMENT |
| LOW⚡ | …age/provider/src/providers/static_file/writer_tests.rs | 459 | // Step 1: Write 5 blocks (0-4), commit | COMMENT |
| LOW⚡ | …age/provider/src/providers/static_file/writer_tests.rs | 466 | // Step 2: Append 5 more blocks (5-9) WITHOUT committing | COMMENT |
| LOW⚡ | …age/provider/src/providers/static_file/writer_tests.rs | 473 | // 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.rs | 478 | // Step 4: Commit | COMMENT |
| LOW⚡ | …age/provider/src/providers/static_file/writer_tests.rs | 482 | // Step 5: Verify sidecar has 8 blocks, header has 8 blocks, rows are correct | COMMENT |
| LOW⚡ | …age/provider/src/providers/static_file/writer_tests.rs | 772 | // Step 1: Write 10 blocks with 5 changes each, commit | COMMENT |
| LOW⚡ | …age/provider/src/providers/static_file/writer_tests.rs | 778 | // Step 2: Corrupt sidecar by adding 3 fake blocks that point to valid but | COMMENT |
| LOW⚡ | …age/provider/src/providers/static_file/writer_tests.rs | 784 | // Step 3: Reopen provider - healing runs and clamps sidecar to header's 10 | COMMENT |
| LOW⚡ | …age/provider/src/providers/static_file/writer_tests.rs | 793 | // Step 4: Prune to block 6 (keep blocks 0-6, remove 7-9) | COMMENT |
| LOW⚡ | …age/provider/src/providers/static_file/writer_tests.rs | 800 | // Step 5: Verify sidecar has 7 blocks, header has 7 blocks, rows are correct | COMMENT |
| LOW | crates/trie/trie/src/proof_v2/mod.rs | 933 | // Having just seeked forward we need to check if the cursor is now exhausted, | COMMENT |
| LOW⚡ | crates/trie/db/src/changesets.rs | 159 | // Step 2: collect the state revert from the database tip to just after the range. | COMMENT |
| LOW⚡ | crates/trie/db/src/changesets.rs | 166 | // Step 3: compute trie reverts from the database tip to just after the range. | COMMENT |
| LOW⚡ | crates/trie/db/src/changesets.rs | 269 | // Step 1: Get the trie changesets for the target block from cache | COMMENT |
| LOW⚡ | crates/trie/db/src/changesets.rs | 272 | // Step 2: Get the trie reverts for the state after the target block using the cache | COMMENT |
| LOW⚡ | crates/trie/db/src/changesets.rs | 275 | // Step 3: Create an InMemoryTrieCursorFactory with the reverts | COMMENT |
| LOW⚡ | crates/trie/db/src/changesets.rs | 280 | // Step 4: Collect all account trie nodes that changed in the target block | COMMENT |
| LOW | crates/trie/db/src/changesets.rs | 139 | // Step 1: collect the state revert for the requested range. | COMMENT |
| LOW | crates/trie/db/src/changesets.rs | 180 | // Step 4: overlay the post-range trie and compute the trie revert to the pre-range state. | COMMENT |
| LOW | crates/trie/db/src/changesets.rs | 292 | // Step 5: Collect all storage trie nodes that changed in the target block | COMMENT |
| LOW⚡ | crates/trie/sparse/tests/suite/take_updates.rs | 298 | // Step 1: Remove key_c — with only 3 keys under the root branch, removing one causes | COMMENT |
| LOW⚡ | crates/trie/sparse/tests/suite/take_updates.rs | 305 | // Step 2: Insert a new key at 0x03 — re-creates/modifies the branch structure at the | COMMENT |
| LOW⚡ | crates/trie/sparse/tests/suite/update_leaves.rs | 1151 | // Step 1: Remove key_c to collapse the branch at 0x10.. | COMMENT |
| LOW⚡ | crates/trie/sparse/tests/suite/update_leaves.rs | 1159 | // Step 2: Re-insert key_c with a new value — this re-creates the branch. | COMMENT |
| LOW⚡ | crates/trie/sparse/tests/suite/update_leaves.rs | 1167 | // Step 3: Update key_a — previously could be orphaned if branch collapse | COMMENT |
| LOW | crates/trie/sparse/tests/suite/update_leaves.rs | 1215 | // Step 1: Remove key_a → branch collapses, key_b becomes the sole child. | COMMENT |
| LOW | crates/trie/sparse/tests/suite/update_leaves.rs | 1236 | // Step 2: Modify the remaining leaf's value — this must succeed after the collapse | COMMENT |
| LOW⚡ | crates/trie/sparse/tests/suite/lifecycle.rs | 434 | // Step 2: Now send Changed for 2 of the touched keys + 1 new key. | COMMENT |
| LOW⚡ | crates/trie/sparse/tests/suite/lifecycle.rs | 444 | // Step 3: Compute root and verify against reference. | COMMENT |
| LOW⚡ | crates/trie/sparse/tests/suite/lifecycle.rs | 501 | // Step 2: Reveal the proof for the requested targets. | COMMENT |
| LOW⚡ | crates/trie/sparse/tests/suite/lifecycle.rs | 505 | // Step 3: Replace Touched with Changed(new_value) in the map. | COMMENT |
| LOW⚡ | crates/trie/sparse/tests/suite/lifecycle.rs | 509 | // Step 4: update_leaves again — key should now be drained. | COMMENT |
| LOW⚡ | crates/trie/sparse/tests/suite/lifecycle.rs | 515 | // Step 5: Compute root and verify against reference. | COMMENT |
| LOW⚡ | crates/trie/sparse/tests/suite/lifecycle.rs | 546 | // Step 1: Read existing leaf value via get_leaf_value. | COMMENT |
| LOW⚡ | crates/trie/sparse/tests/suite/lifecycle.rs | 553 | // Step 2: Decode the value and verify it matches expected. | COMMENT |
| LOW⚡ | crates/trie/sparse/tests/suite/lifecycle.rs | 558 | // Step 3: Modify the value (simulates changing balance while keeping storage root). | COMMENT |
| LOW⚡ | crates/trie/sparse/tests/suite/lifecycle.rs | 562 | // Step 4: Update the leaf with the re-encoded value. | COMMENT |
| LOW⚡ | crates/trie/sparse/tests/suite/lifecycle.rs | 567 | // Step 5: Compute root and verify against reference. | COMMENT |
| LOW⚡ | crates/trie/sparse/tests/suite/lifecycle.rs | 597 | // Step 1: find_leaf(existing_key, None) → Exists | COMMENT |
| LOW⚡ | crates/trie/sparse/tests/suite/lifecycle.rs | 604 | // Step 2: find_leaf(nonexistent_key, None) → NonExistent | COMMENT |
| LOW⚡ | crates/trie/sparse/tests/suite/lifecycle.rs | 611 | // Step 3: Modify existing key2 and insert nonexistent_key. | COMMENT |
| LOW⚡ | crates/trie/sparse/tests/suite/lifecycle.rs | 622 | // Step 4: Compute root and verify against reference. | COMMENT |
| LOW⚡ | crates/trie/sparse/tests/suite/lifecycle.rs | 631 | // Step 5: find_leaf(nonexistent_key, None) → now Exists | COMMENT |
| LOW | crates/trie/sparse/tests/suite/lifecycle.rs | 419 | // Step 1: Prewarm 3 keys with Touched — all should be drained (paths are revealed). | COMMENT |
| LOW | crates/trie/sparse/tests/suite/lifecycle.rs | 488 | // Step 1: Touched on a key in group B's blinded subtrie → callback fires. | COMMENT |
| LOW | crates/trie/sparse/src/arena/mod.rs | 1256 | // Step 1: Handle trivial roots that don't need the stack-based walk. | COMMENT |
| LOW | crates/trie/sparse/src/arena/mod.rs | 1283 | // Step 2: Walk dirty branches depth-first using `cursor.next`. Only dirty branches | COMMENT |
| LOW | crates/exex/exex/src/notifications.rs | 280 | /// If true, then we need to check if the ExEx head is on the canonical chain and if not, | COMMENT |
| LOW | crates/exex/exex/src/notifications.rs | 283 | /// If true, then we need to check if the ExEx head is behind the node head and if so, backfill | COMMENT |
| 5 more matches not shown… | ||||
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW⚡ | crates/storage/provider/src/providers/database/mod.rs | 522 | // Step 1: heal file-level inconsistencies (no pruning) | COMMENT |
| LOW⚡ | crates/storage/provider/src/providers/database/mod.rs | 525 | // Step 2: RocksDB consistency check (needs static files tx data) | COMMENT |
| LOW⚡ | crates/storage/provider/src/providers/database/mod.rs | 528 | // Step 3: Static file checkpoint consistency (may prune) | COMMENT |
| LOW⚡ | crates/storage/provider/src/providers/database/mod.rs | 536 | // Step 4: Heal finalized/safe block numbers that may be ahead of the | COMMENT |
| LOW | …s/storage/provider/src/providers/static_file/writer.rs | 394 | // Step 1: Read all three sources of truth | COMMENT |
| LOW | …s/storage/provider/src/providers/static_file/writer.rs | 415 | // Step 2: Validate sidecar offsets against actual NippyJar state | COMMENT |
| LOW⚡ | …s/storage/provider/src/providers/static_file/writer.rs | 438 | // Step 3: Determine correct state from synced files (source of truth) | COMMENT |
| LOW⚡ | …s/storage/provider/src/providers/static_file/writer.rs | 442 | // Step 4: Heal if header doesn't match validated truth | COMMENT |
| LOW⚡ | …age/provider/src/providers/static_file/writer_tests.rs | 459 | // Step 1: Write 5 blocks (0-4), commit | COMMENT |
| LOW⚡ | …age/provider/src/providers/static_file/writer_tests.rs | 466 | // Step 2: Append 5 more blocks (5-9) WITHOUT committing | COMMENT |
| LOW⚡ | …age/provider/src/providers/static_file/writer_tests.rs | 473 | // 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.rs | 478 | // Step 4: Commit | COMMENT |
| LOW⚡ | …age/provider/src/providers/static_file/writer_tests.rs | 482 | // Step 5: Verify sidecar has 8 blocks, header has 8 blocks, rows are correct | COMMENT |
| LOW⚡ | …age/provider/src/providers/static_file/writer_tests.rs | 772 | // Step 1: Write 10 blocks with 5 changes each, commit | COMMENT |
| LOW⚡ | …age/provider/src/providers/static_file/writer_tests.rs | 778 | // Step 2: Corrupt sidecar by adding 3 fake blocks that point to valid but | COMMENT |
| LOW⚡ | …age/provider/src/providers/static_file/writer_tests.rs | 784 | // Step 3: Reopen provider - healing runs and clamps sidecar to header's 10 | COMMENT |
| LOW⚡ | …age/provider/src/providers/static_file/writer_tests.rs | 793 | // Step 4: Prune to block 6 (keep blocks 0-6, remove 7-9) | COMMENT |
| LOW⚡ | …age/provider/src/providers/static_file/writer_tests.rs | 800 | // Step 5: Verify sidecar has 7 blocks, header has 7 blocks, rows are correct | COMMENT |
| LOW | crates/storage/db-common/src/init.rs | 684 | /// NOTE: This function is not idempotent. If the process crashes mid-import, the database | COMMENT |
| LOW | crates/trie/trie/src/hashed_cursor/post_state.rs | 354 | /// NOTE: This function will not return any entry unless [`HashedCursor::seek`] has been called. | COMMENT |
| LOW⚡ | crates/trie/db/src/changesets.rs | 159 | // Step 2: collect the state revert from the database tip to just after the range. | COMMENT |
| LOW⚡ | crates/trie/db/src/changesets.rs | 166 | // Step 3: compute trie reverts from the database tip to just after the range. | COMMENT |
| LOW⚡ | crates/trie/db/src/changesets.rs | 269 | // Step 1: Get the trie changesets for the target block from cache | COMMENT |
| LOW⚡ | crates/trie/db/src/changesets.rs | 272 | // Step 2: Get the trie reverts for the state after the target block using the cache | COMMENT |
| LOW⚡ | crates/trie/db/src/changesets.rs | 275 | // Step 3: Create an InMemoryTrieCursorFactory with the reverts | COMMENT |
| LOW⚡ | crates/trie/db/src/changesets.rs | 280 | // Step 4: Collect all account trie nodes that changed in the target block | COMMENT |
| LOW | crates/trie/db/src/changesets.rs | 139 | // Step 1: collect the state revert for the requested range. | COMMENT |
| LOW | crates/trie/db/src/changesets.rs | 180 | // Step 4: overlay the post-range trie and compute the trie revert to the pre-range state. | COMMENT |
| LOW | crates/trie/db/src/changesets.rs | 292 | // Step 5: Collect all storage trie nodes that changed in the target block | COMMENT |
| LOW⚡ | crates/trie/sparse/tests/suite/take_updates.rs | 298 | // Step 1: Remove key_c — with only 3 keys under the root branch, removing one causes | COMMENT |
| LOW⚡ | crates/trie/sparse/tests/suite/take_updates.rs | 305 | // Step 2: Insert a new key at 0x03 — re-creates/modifies the branch structure at the | COMMENT |
| LOW⚡ | crates/trie/sparse/tests/suite/update_leaves.rs | 1151 | // Step 1: Remove key_c to collapse the branch at 0x10.. | COMMENT |
| LOW⚡ | crates/trie/sparse/tests/suite/update_leaves.rs | 1159 | // Step 2: Re-insert key_c with a new value — this re-creates the branch. | COMMENT |
| LOW⚡ | crates/trie/sparse/tests/suite/update_leaves.rs | 1167 | // Step 3: Update key_a — previously could be orphaned if branch collapse | COMMENT |
| LOW | crates/trie/sparse/tests/suite/update_leaves.rs | 1215 | // Step 1: Remove key_a → branch collapses, key_b becomes the sole child. | COMMENT |
| LOW | crates/trie/sparse/tests/suite/update_leaves.rs | 1236 | // Step 2: Modify the remaining leaf's value — this must succeed after the collapse | COMMENT |
| LOW⚡ | crates/trie/sparse/tests/suite/lifecycle.rs | 434 | // Step 2: Now send Changed for 2 of the touched keys + 1 new key. | COMMENT |
| LOW⚡ | crates/trie/sparse/tests/suite/lifecycle.rs | 444 | // Step 3: Compute root and verify against reference. | COMMENT |
| LOW⚡ | crates/trie/sparse/tests/suite/lifecycle.rs | 501 | // Step 2: Reveal the proof for the requested targets. | COMMENT |
| LOW⚡ | crates/trie/sparse/tests/suite/lifecycle.rs | 505 | // Step 3: Replace Touched with Changed(new_value) in the map. | COMMENT |
| LOW⚡ | crates/trie/sparse/tests/suite/lifecycle.rs | 509 | // Step 4: update_leaves again — key should now be drained. | COMMENT |
| LOW⚡ | crates/trie/sparse/tests/suite/lifecycle.rs | 515 | // Step 5: Compute root and verify against reference. | COMMENT |
| LOW⚡ | crates/trie/sparse/tests/suite/lifecycle.rs | 546 | // Step 1: Read existing leaf value via get_leaf_value. | COMMENT |
| LOW⚡ | crates/trie/sparse/tests/suite/lifecycle.rs | 553 | // Step 2: Decode the value and verify it matches expected. | COMMENT |
| LOW⚡ | crates/trie/sparse/tests/suite/lifecycle.rs | 558 | // Step 3: Modify the value (simulates changing balance while keeping storage root). | COMMENT |
| LOW⚡ | crates/trie/sparse/tests/suite/lifecycle.rs | 562 | // Step 4: Update the leaf with the re-encoded value. | COMMENT |
| LOW⚡ | crates/trie/sparse/tests/suite/lifecycle.rs | 567 | // Step 5: Compute root and verify against reference. | COMMENT |
| LOW⚡ | crates/trie/sparse/tests/suite/lifecycle.rs | 597 | // Step 1: find_leaf(existing_key, None) → Exists | COMMENT |
| LOW⚡ | crates/trie/sparse/tests/suite/lifecycle.rs | 604 | // Step 2: find_leaf(nonexistent_key, None) → NonExistent | COMMENT |
| LOW⚡ | crates/trie/sparse/tests/suite/lifecycle.rs | 611 | // Step 3: Modify existing key2 and insert nonexistent_key. | COMMENT |
| LOW⚡ | crates/trie/sparse/tests/suite/lifecycle.rs | 622 | // Step 4: Compute root and verify against reference. | COMMENT |
| LOW⚡ | crates/trie/sparse/tests/suite/lifecycle.rs | 631 | // Step 5: find_leaf(nonexistent_key, None) → now Exists | COMMENT |
| LOW | crates/trie/sparse/tests/suite/lifecycle.rs | 419 | // Step 1: Prewarm 3 keys with Touched — all should be drained (paths are revealed). | COMMENT |
| LOW | crates/trie/sparse/tests/suite/lifecycle.rs | 488 | // Step 1: Touched on a key in group B's blinded subtrie → callback fires. | COMMENT |
| LOW | crates/trie/sparse/src/state.rs | 317 | /// NOTE: This method does not extensively validate the proof. | COMMENT |
| LOW | crates/trie/sparse/src/state.rs | 327 | /// NOTE: This method does not extensively validate the proof. | COMMENT |
| LOW | crates/trie/sparse/src/arena/mod.rs | 1256 | // Step 1: Handle trivial roots that don't need the stack-based walk. | COMMENT |
| LOW | crates/trie/sparse/src/arena/mod.rs | 1283 | // Step 2: Walk dirty branches depth-first using `cursor.next`. Only dirty branches | COMMENT |
| LOW⚡ | …ngine/tree/tests/e2e-testsuite/fcu_finalized_blocks.rs | 59 | // Step 1: Finalize block 7 with head at block 10 | COMMENT |
| LOW⚡ | …ngine/tree/tests/e2e-testsuite/fcu_finalized_blocks.rs | 64 | // Step 2: Attempt to reorg to a fork that doesn't contain the finalized block | COMMENT |
| 2 more matches not shown… | ||||
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| MEDIUM | crates/tasks/src/runtime.rs | 256 | // ── RuntimeInner ────────────────────────────────────────────────────── | COMMENT |
| MEDIUM | crates/tasks/src/runtime.rs | 307 | // ── Runtime ─────────────────────────────────────────────────────────── | COMMENT |
| MEDIUM | crates/tasks/src/runtime.rs | 324 | // ── Pool accessors ──────────────────────────────────────────────────── | COMMENT |
| MEDIUM | crates/tasks/src/runtime.rs | 396 | // ── Test helpers ────────────────────────────────────────────────────── | COMMENT |
| MEDIUM | crates/tasks/src/runtime.rs | 435 | // ── Spawn methods ───────────────────────────────────────────────────── | COMMENT |
| MEDIUM | crates/tasks/src/runtime.rs | 841 | // ── RuntimeBuilder ──────────────────────────────────────────────────── | COMMENT |
| MEDIUM | crates/transaction-pool/src/lib.rs | 120 | //! Queued ─────────→ BaseFee/Blob ────────→ Pending | COMMENT |
| MEDIUM | crates/transaction-pool/src/lib.rs | 123 | //! └────────────────────┴─────────────────────┘ | COMMENT |
| MEDIUM | crates/transaction-pool/src/traits.rs | 30 | //! └──────────┐ ┌────────────────┘ | COMMENT |
| MEDIUM | crates/trie/trie/src/proof_v2/mod.rs | 2537 | // ── Construct cached branch at [6] ───────────────────────────────────── | COMMENT |
| MEDIUM | crates/trie/trie/src/proof_v2/mod.rs | 2554 | // ── Construct cached branch at [6,a,3] ──────────────────────────────── | COMMENT |
| MEDIUM | crates/trie/trie/src/proof_v2/mod.rs | 2586 | // ── Verify root hash ─────────────────────────────────────────────────── | COMMENT |
| MEDIUM | crates/trie/trie/src/proof_v2/mod.rs | 2611 | // ── Verify proof for key_c contains nodes on its path ────────────────── | COMMENT |
| MEDIUM | crates/trie/trie/src/proof_v2/mod.rs | 2652 | // ── Construct cached branch at [6] ───────────────────────────────────── | COMMENT |
| MEDIUM | crates/trie/trie/src/proof_v2/mod.rs | 2669 | // ── Construct cached branch at [6,a,8] ──────────────────────────────── | COMMENT |
| MEDIUM | crates/trie/trie/src/proof_v2/mod.rs | 2697 | // ── Verify root hash ─────────────────────────────────────────────────── | COMMENT |
| MEDIUM | crates/trie/trie/src/proof_v2/mod.rs | 2722 | // ── Verify proof for key_c contains nodes on its path ────────────────── | COMMENT |
| MEDIUM | bin/reth/tests/it/main.rs | 7 | // ── Helpers ────────────────────────────────────────────────────────────────── | COMMENT |
| MEDIUM | bin/reth/tests/it/main.rs | 60 | // ── Original tests (from PR #22069) ────────────────────────────────────────── | COMMENT |
| MEDIUM | bin/reth/tests/it/main.rs | 60 | // ── Original tests (from PR #22069) ────────────────────────────────────────── | COMMENT |
| MEDIUM | bin/reth/tests/it/main.rs | 108 | // ── Subcommand --help coverage ─────────────────────────────────────────────── | COMMENT |
| MEDIUM | bin/reth/tests/it/main.rs | 244 | // ── `config --default` outputs valid TOML ──────────────────────────────────── | COMMENT |
| MEDIUM | bin/reth/tests/it/main.rs | 259 | // ── `dump-genesis` outputs valid JSON ──────────────────────────────────────── | COMMENT |
| MEDIUM | bin/reth/tests/it/main.rs | 282 | // ── Dev node: send transaction round-trip ──────────────────────────────────── | COMMENT |
| MEDIUM | .github/workflows/bench-scheduled.yml | 70 | # --------------------------------------------------------------------------- | COMMENT |
| MEDIUM | .github/workflows/bench-scheduled.yml | 72 | # --------------------------------------------------------------------------- | COMMENT |
| MEDIUM | .github/workflows/bench-scheduled.yml | 278 | # --------------------------------------------------------------------------- | COMMENT |
| MEDIUM | .github/workflows/bench-scheduled.yml | 280 | # --------------------------------------------------------------------------- | COMMENT |
| MEDIUM | .github/workflows/bench-scheduled.yml | 1087 | # --------------------------------------------------------------------------- | COMMENT |
| MEDIUM | .github/workflows/bench-scheduled.yml | 1089 | # --------------------------------------------------------------------------- | COMMENT |
| MEDIUM | .github/scripts/bench-scheduled-refs.sh | 43 | # ========================================================================== | COMMENT |
| MEDIUM | .github/scripts/bench-scheduled-refs.sh | 45 | # ========================================================================== | COMMENT |
| MEDIUM | .github/scripts/bench-scheduled-refs.sh | 129 | # ========================================================================== | COMMENT |
| MEDIUM | .github/scripts/bench-scheduled-refs.sh | 131 | # ========================================================================== | COMMENT |
| MEDIUM | .github/scripts/bench-scheduled-refs.sh | 229 | # ========================================================================== | COMMENT |
| MEDIUM | .github/scripts/bench-scheduled-refs.sh | 231 | # ========================================================================== | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | .github/scripts/bench-reth-charts.py | 54 | def plot_latency_and_throughput( | CODE |
| LOW | .github/scripts/bench-target-metric-sample-filter.py | 34 | def target_metric_sample_names(config: dict) -> list[str]: | CODE |
| LOW⚡ | .github/scripts/bench-reth-summary.py | 174 | def target_metric_query_encodes_seconds(query: str) -> bool: | CODE |
| LOW⚡ | .github/scripts/bench-reth-summary.py | 179 | def target_metric_counter_encodes_seconds(query: str) -> bool: | CODE |
| LOW⚡ | .github/scripts/bench-reth-summary.py | 183 | def target_metric_min_value_pct_total_latency(config: dict) -> float | None: | CODE |
| LOW | .github/scripts/bench-reth-summary.py | 140 | def parse_target_metric_query(query: str) -> tuple[str, str, dict[str, str]]: | CODE |
| LOW | .github/scripts/bench-reth-summary.py | 158 | def format_target_metric_query(metric_name: str, labels: dict[str, str]) -> str: | CODE |
| LOW | .github/scripts/bench-reth-summary.py | 653 | def target_metric_identity_key(labels: dict[str, str]) -> tuple[tuple[str, str], ...]: | CODE |
| LOW | .github/scripts/bench-reth-summary.py | 657 | def target_metric_candidate_identity_labels( | CODE |
| LOW | .github/scripts/bench-reth-summary.py | 669 | def target_metric_variable_identity_label_keys( | CODE |
| LOW | .github/scripts/bench-reth-summary.py | 693 | def target_metric_identity_labels( | CODE |
| LOW | .github/scripts/bench-reth-summary.py | 706 | def target_metric_display_query(query: str, identity_labels: dict[str, str] | None = None) -> str: | CODE |
| LOW | .github/scripts/bench-reth-summary.py | 714 | def group_query_samples_by_identity( | CODE |
| LOW | .github/scripts/bench-reth-summary.py | 750 | def collect_metric_identities(grouped_scrapes: list[dict]) -> dict[tuple[tuple[str, str], ...], dict[str, str]]: | CODE |
| LOW | .github/scripts/bench-reth-summary.py | 758 | def format_target_metric_identity(query: str, identity_labels: dict[str, str]) -> str: | CODE |
| LOW | .github/scripts/bench-reth-summary.py | 774 | def load_target_metric_scrapes(path: str) -> list[dict]: | CODE |
| LOW | .github/scripts/bench-reth-summary.py | 816 | def compute_target_metric_series_stats(values: list[float]) -> dict[str, float]: | CODE |
| LOW | .github/scripts/bench-reth-summary.py | 828 | def counter_target_metric_stat_value(values: list[float], stat_name: str) -> float: | CODE |
| LOW | .github/scripts/bench-reth-summary.py | 840 | def paired_target_metric_observations( | CODE |
| LOW | .github/scripts/bench-reth-summary.py | 866 | def target_metric_run_stat_value(run: dict, stat_name: str) -> float: | CODE |
| LOW | .github/scripts/bench-reth-summary.py | 879 | def _target_metric_cluster_ci( | CODE |
| LOW | .github/scripts/bench-reth-summary.py | 904 | def _target_metric_single_run_ci( | CODE |
| LOW | .github/scripts/bench-reth-summary.py | 922 | def compute_target_metric_change( | CODE |
| LOW | .github/scripts/bench-reth-summary.py | 1033 | def query_counter_target_metric_run( | CODE |
| LOW | .github/scripts/bench-reth-summary.py | 1121 | def query_histogram_target_metric_run( | CODE |
| LOW | .github/scripts/bench-reth-summary.py | 1215 | def load_target_metric_run_context(path: str) -> dict: | CODE |
| LOW | .github/scripts/bench-reth-summary.py | 1239 | def collect_target_metric_identity_label_keys( | CODE |
| LOW | .github/scripts/bench-reth-summary.py | 1310 | def summarize_target_metric_runs(run_items: list[dict], fields: tuple[str, ...]) -> dict: | CODE |
| LOW | .github/scripts/bench-reth-summary.py | 1316 | def summarize_target_metric_change(changes: dict[str, dict], display_stats: tuple[str, ...]) -> dict: | CODE |
| LOW | .github/scripts/bench-reth-summary.py | 1330 | def collect_query_metric_identities( | CODE |
| LOW | .github/scripts/bench-reth-summary.py | 1370 | def build_target_metric_entry( | CODE |
| LOW | .github/scripts/bench-reth-summary.py | 1434 | def compute_target_metric_summary( | CODE |
| LOW | .github/scripts/bench-reth-summary.py | 1650 | def generate_comparison_table( | CODE |
| LOW | .github/scripts/bench-reth-summary.py | 1754 | def generate_target_metric_table(target_metrics: dict | None) -> str: | CODE |
| LOW | .github/scripts/bench-reth-summary.py | 1875 | def resolve_observability_range( | CODE |
| LOW | .github/scripts/bench-reth-summary.py | 1893 | def generate_observability_section(summary: dict) -> list[str]: | CODE |
| LOW | .github/scripts/fetch-grafana-dashboard.py | 85 | def has_expression_datasource(dashboard: dict) -> bool: | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| HIGH | crates/trie/common/src/proofs.rs | 721 | /// Array of storage proofs as requested. | COMMENT |
| HIGH | crates/trie/common/src/proofs.rs | 894 | /// Array of storage proofs as requested. | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| MEDIUM | crates/stages/stages/src/stages/sender_recovery.rs | 345 | // However, using `std::thread::spawn` allows us to utilize the timeout grace | COMMENT |
| MEDIUM | crates/storage/storage-api/src/receipts.rs | 49 | /// because it can leverage the underlying `receipts_by_tx_range` for the entire transaction | COMMENT |
| MEDIUM | crates/storage/libmdbx-rs/src/flags.rs | 9 | /// Default robust and durable sync mode. | COMMENT |
| MEDIUM | …ne/tree/src/tree/payload_processor/bal_prewarm_pool.rs | 113 | /// In order to utilize the parallelism of `NVMe` we have to give it enough work, or equally, | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| MEDIUM | crates/rpc/rpc/src/eth/core.rs | 100 | /// # Create an instance with noop ethereum implementations | COMMENT |
| MEDIUM | crates/rpc/rpc/src/eth/filter.rs | 121 | /// # Create a new instance with [`EthApi`](crate::EthApi) | COMMENT |
| MEDIUM | .github/scripts/hive/ignored_tests.yaml | 3 | # This file contains tests that should be ignored for various reasons (flaky, known issues, etc). | COMMENT |
| MEDIUM | .github/scripts/hive/build_simulators.sh | 21 | # Create the hive_assets directory | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | scripts/patch-alloy.sh | 4 | # Usage: | COMMENT |
| LOW | .github/scripts/bench-benchmarkoor-run.sh | 5 | # Usage: | COMMENT |
| LOW | .github/scripts/verify_image_arch.sh | 4 | # Usage: | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | .github/scripts/hive/run_simulator.sh | 41 | # Check if no tests were run. sed removes ansi colors | COMMENT |
| LOW | .github/scripts/hive/parse.py | 36 | # Check if this is an ignored test | COMMENT |
| LOW | .github/scripts/hive/parse.py | 66 | # Check if there are any unexpected failures or passes and exit with error | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | .github/scripts/bench-benchmarkoor-summary.py | 4 | CODE | |
| LOW | .github/scripts/bench-target-metric-sample-filter.py | 4 | CODE | |
| LOW | .github/scripts/bench-reth-summary.py | 20 | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| MEDIUM | .github/workflows/grafana.yml | 35 | print(f'Error: {e}', file=sys.stderr) | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | .github/scripts/bench-reth-summary.py | 1434 | CODE | |
| LOW | .github/scripts/fetch-grafana-dashboard.py | 89 | CODE |