Conversation
BeginTemporalRo in Fork intentionally transfers tx ownership to the caller via the returned cleanup func; defer tx.Rollback() would invalidate the tx immediately on return. Co-Authored-By: Claude Sonnet 4.6 <noreply@anthropic.com>
AskAlexSharov
approved these changes
Mar 1, 2026
sudeepdino008
pushed a commit
that referenced
this pull request
Mar 4, 2026
This PR introduces two major optimizations inspired by the Geth/Netmind client architectures to decrease latency: * Parallel Block Processing: Switched from sequential to concurrent block fetching using 4 workers, matching Geth's maxBlockFetchers architecture. * FeeHistory Cache: Added a 2048-entry LRU cache for eth_feeHistory results. This avoids repetitive fee/percentile computations by caching the final processedFees struct instead of raw block data. <details> <summary><b>📊 Click to view detailed Benchmark results</b></summary> | Scenario | Before | After | Speedup | | :--- | :--- | :--- | :--- | | **full/200** (sequential cold) | 451 ms | 93 ms | **4.9×** | | **full/1024** (sequential cold) | 2,230 ms | 118 ms | **18.9×** | | **full/1024** (sequential warm) | 2,346 ms | 95 ms | **24.7×** | | **full/1024** (concurrent warm) | 1 req/s | 40 req/s | **40.0×** | </details> --------- Co-authored-by: Claude Sonnet 4.6 <noreply@anthropic.com>
sudeepdino008
pushed a commit
that referenced
this pull request
Mar 4, 2026
This PR introduces two major optimizations inspired by the Geth/Netmind client architectures to decrease latency: * Parallel Block Processing: Switched from sequential to concurrent block fetching using 4 workers, matching Geth's maxBlockFetchers architecture. * FeeHistory Cache: Added a 2048-entry LRU cache for eth_feeHistory results. This avoids repetitive fee/percentile computations by caching the final processedFees struct instead of raw block data. <details> <summary><b>📊 Click to view detailed Benchmark results</b></summary> | Scenario | Before | After | Speedup | | :--- | :--- | :--- | :--- | | **full/200** (sequential cold) | 451 ms | 93 ms | **4.9×** | | **full/1024** (sequential cold) | 2,230 ms | 118 ms | **18.9×** | | **full/1024** (sequential warm) | 2,346 ms | 95 ms | **24.7×** | | **full/1024** (concurrent warm) | 1 req/s | 40 req/s | **40.0×** | </details> --------- Co-authored-by: Claude Sonnet 4.6 <noreply@anthropic.com>
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
This PR introduces two major optimizations inspired by the Geth/Netmind client architectures to decrease latency:
Parallel Block Processing: Switched from sequential to concurrent block fetching using 4 workers, matching Geth's maxBlockFetchers architecture.
FeeHistory Cache: Added a 2048-entry LRU cache for eth_feeHistory results. This avoids repetitive fee/percentile computations by caching the final processedFees struct instead of raw block data.
📊 Click to view detailed Benchmark results