Jul 2026· International Conference on Computer Communications and Networks· pp. 1-9· 0 citations· 56 references
Abstract
Ethereum execution clients implement identical Ethereum Virtual Machine (EVM) semantics, yet can exhibit substantially different performance in practice. We study this divergence through a three-step systems analysis of two representative clients, Geth and Reth. First, across historical synchronization, live synchronization, and transaction replay, we show that Reth is markedly faster whenever repeated local execution dominates, reducing historical local processing by 3.69× and replay time by 6.87×, while Geth is 2.70× faster end-to-end in live synchronization because verification and canonical commitment lie on the critical path. Second, by replaying 100,000 mainnet blocks and attributing runtime to individual opcodes, we show that this performance gap is overwhelmingly concentrated in read-side state access: SLOAD alone explains 95.8% of the measured inter-client difference, with further asymmetry concentrated in account- and code-lookup opcodes. Third, in a public-view builder case study, we use this diagnosis to reduce how much candidate evaluation reaches the expensive exact-simulation stage: on a frozen test split of 886 blocks, an XGBoost prefilter at top-0.1% ratio to top-2.0% ratio reduces checked candidates by 254,708 to 604,776 relative to an effective-priority-fee baseline at matched Flashbots-hit levels, while speeding the ranking-and-selection stage by about 1.75×. These results show that execution-client divergence is best understood as a critical-path problem: the same semantic interface can expose very different bottlenecks depending on how state access, verification, and workload structure interact.
Long-running tools can dominate coding-agent latency: compilers, test suites, and repository commands take seconds to minutes while the agent idles. This observation stall presents the same tension that drove out-of-order processors -- asequential interface hides work that can be predicted and started early, but a spec...
Jiang-Nan Yu, Ce-Yu Xu, Meng-Ming Li et al.· 0 citations
Recovering the structure of a Solidity smart contract from its deployed bytecode is a prerequisite for various downstream analyses, such as control-flow graph construction, decompilation, and clone detection. A central step in this task is identifying private functions. However, since all source-level function boundari...
Yi-Chuan Li, Wei Song, Jeff Huang et al.· Proceedings of the ACM on Pr...· 0 citations
When Swift Concurrency was introduced, marking an async method as nonisolated on an actor often caused an immediate and unexpected context switch to the global cooperative pool on reaching an await. In Swift 6.2, NonisolatedNonsendingByDefault reverses that default, allowing async functions to inherit and preserve thei...
Nikita Vasilev· Proceedings of the Raptors C...· 0 citations
This work introduces Consensus-SpecTec, a mechanized specification of the Ethereum consensus algorithm, which makes validity conditions explicit as if-premises, and defines premise coverage, a metric that measures which if-premises are evaluated to true and false across spectests.
S. Jeong, Gyeongmin Dan, Sukyoung Ryu et al.· Proceedings of the 41st IEEE...· 0 citations
Across 31 applications on AWS Lambda, PyXtrim reduces cold-start latency by 21.7% and peak memory usage by 17.1% at the median, more than double the reduction achieved by the state of the art, while debloating each application in minutes.
Georgios Alexopoulos, Konstantinos Karakatsanis, Nikolaos Alexopoulos et al.· 0 citations