An Efficient Framework for Optimistic Concurrent Execution of Smart Contracts
Parwat Singh Anjana, Sweta Kumari, Sathya Peri, Sachin Rathor, and, Archit Somani

TL;DR
This paper introduces an optimistic concurrency framework for executing smart contracts in blockchain, significantly improving throughput by parallelizing transaction execution using Software Transactional Memory systems.
Contribution
It proposes a novel optimistic concurrency approach for smart contract execution in blockchain, utilizing conflict graphs and STM protocols to enhance efficiency and throughput.
Findings
BTO and MVTO miners achieve 3.6x and 3.7x speedups over serial execution.
Validators outperform serial validators by 40.8x and 47.1x on average.
The framework improves blockchain transaction processing efficiency.
Abstract
Blockchain platforms such as Ethereum and several others execute complex transactions in blocks through user-defined scripts known as smart contracts. To append a correct block into blockchain, miners execute these transactions of smart contracts sequentially. Later the validators serially re-execute the smart contract transactions of the block to validate it. If validation is successful then the block is added to the blockchain using a consensus protocol and miner gets the incentive. In the current era of multi-core processors, by employing the serial execution of the transactions, the miners and validators fail to utilize the cores properly and as a result, have poor throughput. By entitling concurrency to smart contracts execution, we can achieve better efficiency and higher throughput. In this proposal, we develop a novel and efficient technique to execute the smart contract…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
