Massimo Bartoletti ; Letterio Galletta ; Maurizio Murgia - A theory of transaction parallelism in blockchains

lmcs:6935 - Logical Methods in Computer Science, November 18, 2021, Volume 17, Issue 4 -
A theory of transaction parallelism in blockchainsArticle

Authors: Massimo Bartoletti ; Letterio Galletta ORCID; Maurizio Murgia ORCID

    Decentralized blockchain platforms have enabled the secure exchange of crypto-assets without the intermediation of trusted authorities. To this purpose, these platforms rely on a peer-to-peer network of byzantine nodes, which collaboratively maintain an append-only ledger of transactions, called blockchain. Transactions represent the actions required by users, e.g. the transfer of some units of crypto-currency to another user, or the execution of a smart contract which distributes crypto-assets according to its internal logic. Part of the nodes of the peer-to-peer network compete to append transactions to the blockchain. To do so, they group the transactions sent by users into blocks, and update their view of the blockchain state by executing these transactions in the chosen order. Once a block of transactions is appended to the blockchain, the other nodes validate it, re-executing the transactions in the same order. The serial execution of transactions does not take advantage of the multi-core architecture of modern processors, so contributing to limit the throughput. In this paper we develop a theory of transaction parallelism for blockchains, which is based on static analysis of transactions and smart contracts. We illustrate how blockchain nodes can use our theory to parallelize the execution of transactions. Initial experiments on Ethereum show that our technique can improve the performance of nodes.

    Volume: Volume 17, Issue 4
    Published on: November 18, 2021
    Accepted on: September 27, 2021
    Submitted on: November 30, 2020
    Keywords: Computer Science - Cryptography and Security

    1 Document citing this article

    Consultation statistics

    This page has been seen 1305 times.
    This article's PDF has been downloaded 676 times.