Trade-off of Security, Latency, and Throughput of the Nakamoto Consensus

• URL: http://arxiv.org/abs/2312.05506v4
• Date: Sun, 4 Aug 2024 20:06:21 GMT
• Title: Trade-off of Security, Latency, and Throughput of the Nakamoto Consensus
• Authors: Shu-Jie Cao, Dongning Guo,
• Abstract summary: This paper delves into the fundamental trade-off between security, latency, and throughput in proof-of-work (PoW) longest-chain-latency-choice protocols, also known as the PoW Nakamoto consensus. New upper and lower bounds on the probability of violating transaction safety are derived as a function of honest and adversarial mining rates, an upper bound on block propagation delays, and transaction confirmation latency, both in time and in block depth. The paper reveals a fundamental trade-off between transaction throughput and confirmation latency, ultimately determined by the desired fault tolerance and the growth of block propagation delay as block size increases.
• Score: 4.738177482027387
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper delves into the fundamental trade-off between security, latency, and throughput in proof-of-work (PoW) longest-chain-fork-choice protocols, also known as the PoW Nakamoto consensus. New upper and lower bounds on the probability of violating transaction safety are derived as a function of honest and adversarial mining rates, an upper bound on block propagation delays, and transaction confirmation latency, both in time and in block depth. The results include a first non-trivial closed-form finite-latency bound applicable to all delays and mining rates up to the ultimate fault tolerance. Notably, the gap between the upper and lower bounds is narrower than the best gaps previously established for a wide range of parameters relevant to Bitcoin and its derivatives such as Litecoin and Dogecoin, as well as for Ethereum Classic. Furthermore, the paper reveals a fundamental trade-off between transaction throughput and confirmation latency, ultimately determined by the desired fault tolerance and the growth of block propagation delay as block size increases.

Related papers

• Zaptos: Towards Optimal Blockchain Latency [52.30047458198369]
  We introduce Zaptos, a parallel pipelined architecture designed to minimize end-to-end latency. Zaptos achieves a throughput of 20,000 transactions per second with sub-second latency.
  arXiv  Detail & Related papers  (2025-01-18T00:22:22Z)
• The Latency Price of Threshold Cryptosystem in Blockchains [52.359230560289745]
  We study the interplay between threshold cryptography and a class of blockchains that use Byzantine-fault tolerant (BFT) consensus protocols. Existing approaches for threshold cryptosystems introduce a latency overhead of at least one message delay for running the threshold cryptographic protocol. We propose a mechanism to eliminate this overhead for blockchain-native threshold cryptosystems with tight thresholds.
  arXiv  Detail & Related papers  (2024-07-16T20:53:04Z)
• PoW Security-Latency under Random Delays and the Effect of Transaction Fees [33.689236895881216]
  Recent studies have shown that PoW protocol is secure under random delay models as well. We analyze the security-latency problem, i.e., how secure a block is, after it becomes k-deep in the blockchain.
  arXiv  Detail & Related papers  (2024-05-07T17:57:31Z)
• 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)
• Tie-Breaking Rule Based on Partial Proof of Work in a Blockchain [2.9281463284266973]
  We propose another countermeasure that can be easily applied to existing proof of work blockchain systems. By using the characteristic of partial proof of work, the proposed method enables miners to choose the last-generated block in a chain tie. Only weak synchrony, which is already met by existing systems such as Bitcoin, is required for effective functioning.
  arXiv  Detail & Related papers  (2024-03-22T08:24:12Z)
• Transaction Capacity, Security and Latency in Blockchains [35.16231062731263]
  We analyze how secure a block is after the block becomes k-deep, i.e., security-latency, for Nakamoto consensus. We compare our results for Nakamoto consensus under bounded network delay models and obtain analogous bounds for safety violation threshold.
  arXiv  Detail & Related papers  (2024-02-15T17:43:13Z)
• 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)
• Blockchain Large Language Models [65.7726590159576]
  This paper presents a dynamic, real-time approach to detecting anomalous blockchain transactions. The proposed tool, BlockGPT, generates tracing representations of blockchain activity and trains from scratch a large language model to act as a real-time Intrusion Detection System.
  arXiv  Detail & Related papers  (2023-04-25T11:56:18Z)
• Nakamoto Consensus under Bounded Processing Capacity [9.167033097979116]
  We show that, in contrast to the classic bounded-delay model, Nakamoto's private attack is no longer the worst attack. We present a variant of PoS NC we call Blanking NC (BlaNC), which achieves the same resilience as PoW NC.
  arXiv  Detail & Related papers  (2023-03-16T07:00:34Z)
• Quantum Multi-Solution Bernoulli Search with Applications to Bitcoin's Post-Quantum Security [67.06003361150228]
  A proof of work (PoW) is an important cryptographic construct enabling a party to convince others that they invested some effort in solving a computational task. In this work, we examine the hardness of finding such chain of PoWs against quantum strategies. We prove that the chain of PoWs problem reduces to a problem we call multi-solution Bernoulli search, for which we establish its quantum query complexity.
  arXiv  Detail & Related papers  (2020-12-30T18:03:56Z)

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.