Conthereum: Concurrent Ethereum Optimized Transaction Scheduling for Multi-Core Execution

• URL: http://arxiv.org/abs/2504.07280v3
• Date: Tue, 22 Jul 2025 10:55:27 GMT
• Title: Conthereum: Concurrent Ethereum Optimized Transaction Scheduling for Multi-Core Execution
• Authors: Atefeh Zareh Chahoki, Maurice Herlihy, Marco Roveri,
• Abstract summary: Conthereum is a concurrent solution for intra-block parallel transaction execution.<n>At the heart of Conthereum is a novel, lightweight, high-performance scheduler.<n>We show near-linear throughput gains with increasing computational power on standard 8-core machines.
• Score: 3.462869032423588
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Conthereum is a concurrent Ethereum solution for intra-block parallel transaction execution, enabling validators to utilize multi-core infrastructure and transform the sequential execution model of Ethereum into a parallel one. This shift significantly increases throughput and transactions per second (TPS), while ensuring conflict-free execution in both proposer and attestor modes and preserving execution order consistency in the attestor. At the heart of Conthereum is a novel, lightweight, high-performance scheduler inspired by the Flexible Job Shop Scheduling Problem (FJSS). We propose a custom greedy heuristic algorithm, along with its efficient implementation, that solves this formulation effectively and decisively outperforms existing scheduling methods in finding suboptimal solutions that satisfy the constraints, achieve minimal makespan, and maximize speedup in parallel execution. Additionally, Conthereum includes an offline phase that equips its real-time scheduler with a conflict analysis repository obtained through static analysis of smart contracts, identifying potentially conflicting functions using a pessimistic approach. Building on this novel scheduler and extensive conflict data, Conthereum outperforms existing concurrent intra-block solutions. Empirical evaluations show near-linear throughput gains with increasing computational power on standard 8-core machines. Although scalability deviates from linear with higher core counts and increased transaction conflicts, Conthereum still significantly improves upon the current sequential execution model and outperforms existing concurrent solutions under a wide range of conditions.

Related papers

• Static Analysis for Detecting Transaction Conflicts in Ethereum Smart Contracts [2.6703221234079946]
  We propose a novel static analysis method to detect potential transaction conflicts in smart contracts.<n>Our method identifies read-write, write-write, and function call conflicts by analyzing state variable access patterns in Solidity contracts.
  arXiv  Detail & Related papers  (2025-07-06T11:42:40Z)
• Rethinking Dynamic Networks and Heterogeneous Computing with Automatic Parallelization [8.918295350787465]
  Current automatic parallel planning frameworks overlook the simultaneous consideration of node heterogeneity and dynamic network topology changes.<n>We introduce a strategy pruning technique to rapidly discard infeasible parallel configurations.<n>Preliminary evaluations confirm that our method notably enhances training performance on heterogeneous nodes.
  arXiv  Detail & Related papers  (2025-06-03T12:14:17Z)
• Proof of Useful Intelligence (PoUI): Blockchain Consensus Beyond Energy Waste [1.3846014191157405]
  Technology enables secure, transparent data management in decentralized systems. It supports applications from cryptocurrencies like Bitcoin to tokenizing real-world assets like property. We propose Proof of Useful Intelligence (PoUI), a hybrid consensus mechanism.
  arXiv  Detail & Related papers  (2025-04-24T13:32:03Z)
• Trusted Compute Units: A Framework for Chained Verifiable Computations [41.94295877935867]
  This paper introduces the Trusted Compute Unit (TCU), a unifying framework that enables composable and interoperable computations across heterogeneous technologies. By enabling secure off-chain interactions without incurring on-chain confirmation delays or gas fees, TCUs significantly improve system performance and scalability.
  arXiv  Detail & Related papers  (2025-04-22T09:01:55Z)
• Haste Makes Waste: Evaluating Planning Abilities of LLMs for Efficient and Feasible Multitasking with Time Constraints Between Actions [56.88110850242265]
  We present Recipe2Plan, a novel benchmark framework based on real-world cooking scenarios.<n>Unlike conventional benchmarks, Recipe2Plan challenges agents to optimize cooking time through parallel task execution.
  arXiv  Detail & Related papers  (2025-03-04T03:27:02Z)
• Flow: Modularized Agentic Workflow Automation [53.073598156915615]
  Multi-agent frameworks powered by large language models (LLMs) have demonstrated great success in automated planning and task execution.<n>However, the effective adjustment of agentic during execution has not been well studied.<n>In this paper, we define an activity-on-vertex (AOV) graph, which allows continuous workflow refinement by agents.<n>Our proposed multi-agent framework achieves efficient concurrent execution of subtasks, effective goal achievement, and enhanced error tolerance.
  arXiv  Detail & Related papers  (2025-01-14T04:35:37Z)
• Privacy-Preserving Smart Contracts for Permissioned Blockchains: A zk-SNARK-Based Recipe Part-1 [1.7265013728931]
  This work proposes a solution utilizing zk-SNARKs to provide privacy in smart contracts and blockchains.<n>The proposal includes a new type of transactions, called delegated transactions, which enable use cases like Delivery vs Payment (DvP)
  arXiv  Detail & Related papers  (2025-01-06T21:16:33Z)
• COrAL: Order-Agnostic Language Modeling for Efficient Iterative Refinement [80.18490952057125]
  Iterative refinement has emerged as an effective paradigm for enhancing the capabilities of large language models (LLMs) on complex tasks. We propose Context-Wise Order-Agnostic Language Modeling (COrAL) to overcome these challenges. Our approach models multiple token dependencies within manageable context windows, enabling the model to perform iterative refinement internally.
  arXiv  Detail & Related papers  (2024-10-12T23:56:19Z)
• The Cost of Executing Business Processes on Next-Generation Blockchains: The Case of Algorand [0.09208007322096533]
  We study a system, Algorand, from a process execution perspective. Algorand promises low transaction fees and fast finality. We compare the cost of executing processes on Algorand to previous work as well as traditional cloud computing.
  arXiv  Detail & Related papers  (2024-07-09T09:58:11Z)
• Maximizing Blockchain Performance: Mitigating Conflicting Transactions through Parallelism and Dependency Management [0.18641315013048293]
  "Conflicting transactions" contribute to high network latency and transaction failures. We present a novel scheme that integrates transaction parallelism and an intelligent dependency manager. Results show that our scheme outperforms both existing parallel and non-parallel Hyperledger Fabric blockchain networks.
  arXiv  Detail & Related papers  (2024-07-01T16:17:33Z)
• Freya PAGE: First Optimal Time Complexity for Large-Scale Nonconvex Finite-Sum Optimization with Heterogeneous Asynchronous Computations [92.1840862558718]
  In practical distributed systems, workers typically not homogeneous, and can have highly varying processing times. We introduce a new parallel method Freya to handle arbitrarily slow computations. We show that Freya offers significantly improved complexity guarantees compared to all previous methods.
  arXiv  Detail & Related papers  (2024-05-24T13:33:30Z)
• Blockchains for Internet of Things: Fundamentals, Applications, and Challenges [38.29453164670072]
  Not every blockchain system is suitable for specific IoT applications. Public blockchains are not suitable for storing sensitive data. We explore the blockchain's application in three pivotal IoT areas: edge AI, communications, and healthcare.
  arXiv  Detail & Related papers  (2024-05-08T04:25:57Z)
• Enhancing Trust and Privacy in Distributed Networks: A Comprehensive Survey on Blockchain-based Federated Learning [51.13534069758711]
  Decentralized approaches like blockchain offer a compelling solution by implementing a consensus mechanism among multiple entities. Federated Learning (FL) enables participants to collaboratively train models while safeguarding data privacy. This paper investigates the synergy between blockchain's security features and FL's privacy-preserving model training capabilities.
  arXiv  Detail & Related papers  (2024-03-28T07:08:26Z)
• Graph Attention Network-based Block Propagation with Optimal AoI and Reputation in Web 3.0 [59.94605620983965]
  We design a Graph Attention Network (GAT)-based reliable block propagation optimization framework for blockchain-enabled Web 3.0. To achieve the reliability of block propagation, we introduce a reputation mechanism based on the subjective logic model. Considering that the GAT possesses the excellent ability to process graph-structured data, we utilize the GAT with reinforcement learning to obtain the optimal block propagation trajectory.
  arXiv  Detail & Related papers  (2024-03-20T01:58:38Z)
• Enhanced Security and Efficiency in Blockchain with Aggregated Zero-Knowledge Proof Mechanisms [15.034624246970154]
  Current approaches to data verification in blockchain systems face challenges in terms of efficiency and computational overhead. This study proposes an innovative aggregation scheme for Zero-Knowledge Proofs within the structure of Merkle Trees. We develop a system that significantly reduces the size of the proof and the computational resources needed for its generation and verification.
  arXiv  Detail & Related papers  (2024-02-06T09:26:46Z)
• Generative AI-enabled Blockchain Networks: Fundamentals, Applications, and Case Study [73.87110604150315]
  Generative Artificial Intelligence (GAI) has emerged as a promising solution to address challenges of blockchain technology. In this paper, we first introduce GAI techniques, outline their applications, and discuss existing solutions for integrating GAI into blockchains.
  arXiv  Detail & Related papers  (2024-01-28T10:46:17Z)
• Flover: A Temporal Fusion Framework for Efficient Autoregressive Model Parallel Inference [3.005912820808423]
  Inference on autoregressive models harnesses a temporal dependency, where the current token's probability distribution is conditioned on preceding tokens. We propose Flover -- a temporal fusion framework for efficiently inferring multiple requests in parallel. By orchestrating the token-level parallelism, Flover exhibits hardware optimal efficiency and significantly spares the system resources.
  arXiv  Detail & Related papers  (2023-05-22T20:58:09Z)
• Quantum-resistance in blockchain networks [46.63333997460008]
  This paper describes the work carried out by the Inter-American Development Bank, the IDB Lab, LACChain, Quantum Computing (CQC), and Tecnologico de Monterrey to identify and eliminate quantum threats in blockchain networks. The advent of quantum computing threatens internet protocols and blockchain networks because they utilize non-quantum resistant cryptographic algorithms.
  arXiv  Detail & Related papers  (2021-06-11T23:39:25Z)
• Combining Deep Learning and Optimization for Security-Constrained Optimal Power Flow [94.24763814458686]
  Security-constrained optimal power flow (SCOPF) is fundamental in power systems. Modeling of APR within the SCOPF problem results in complex large-scale mixed-integer programs. This paper proposes a novel approach that combines deep learning and robust optimization techniques.
  arXiv  Detail & Related papers  (2020-07-14T12:38:21Z)
• Dynamic Multi-Robot Task Allocation under Uncertainty and Temporal Constraints [52.58352707495122]
  We present a multi-robot allocation algorithm that decouples the key computational challenges of sequential decision-making under uncertainty and multi-agent coordination. We validate our results over a wide range of simulations on two distinct domains: multi-arm conveyor belt pick-and-place and multi-drone delivery dispatch in a city.
  arXiv  Detail & Related papers  (2020-05-27T01:10:41Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.