Nakamoto Consensus from Multiple Resources

• URL: http://arxiv.org/abs/2508.01448v1
• Date: Sat, 02 Aug 2025 17:36:50 GMT
• Title: Nakamoto Consensus from Multiple Resources
• Authors: Mirza Ahad Baig, Christoph U. Günther, Krzysztof Pietrzak,
• Abstract summary: We ask what weight functions Gamma(S,V,W) are secure in the sense that whenever the weight of the resources controlled by honest parties is larger than the weight of adversarial parties, the blockchain is secure against private double-spending attacks.<n>We classify such functions in an idealized "continuous" model: Gamma(S,V,W) is secure against private double-spending attacks if and only if it is homogeneous of degree one in the timed resources V and W.
• Score: 1.773699516795303
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The blocks in the Bitcoin blockchain record the amount of work W that went into creating them through proofs of work. When honest parties control a majority of the work, consensus is achieved by picking the chain with the highest recorded weight. Resources other than work have been considered to secure such longest-chain blockchains. In Chia, blocks record the amount of space S (via a proof of space) and sequential computational steps V (via a VDF). In this paper, we ask what weight functions {\Gamma}(S,V,W) (that assign a weight to a block as a function of the recorded space, speed, and work) are secure in the sense that whenever the weight of the resources controlled by honest parties is larger than the weight of adversarial parties, the blockchain is secure against private double-spending attacks. We completely classify such functions in an idealized "continuous" model: {\Gamma}(S,V,W) is secure against private double-spending attacks if and only if it is homogeneous of degree one in the timed resources V and W, i.e., {\alpha}{\Gamma}(S,V,W)={\Gamma}(S,{\alpha}V, {\alpha}W). This includes Bitcoin rule {\Gamma}(S,V,W)=W and Chia rule {\Gamma}(S,V,W) = SV. In a more realistic model where blocks are created at discrete time-points, one additionally needs some mild assumptions on the dependency on S (basically, the weight should not grow too much if S is slightly increased, say linear as in Chia). Our classification is more general and allows various instantiations of the same resource. It provides a powerful tool for designing new longest-chain blockchains. E.g., consider combining different PoWs to counter centralization, say the Bitcoin PoW W_1 and a memory-hard PoW W_2. Previous work suggested to use W_1+W_2 as weight. Our results show that using {\sqrt}(W_1){\cdot}{\sqrt}(W_2), {\min}{W_1,W_2} are also secure, and we argue that in practice these are much better choices.

Related papers

• On the (in)security of Proofs-of-Space based Longest-Chain Blockchains [1.9934605058107087]
  We consider a security game in which the honest parties at any point control $phi>1$ times more space than the adversary.<n>We prove that no matter what chain selection rule is used, in this game the adversary can create a fork of length $phi2cdot rho / varepsilon$ that will be picked as the winner by the chain selection rule.
  arXiv  Detail & Related papers  (2025-05-20T20:35:00Z)
• ScaloWork: Useful Proof-of-Work with Distributed Pool Mining [0.8192907805418583]
  Bitcoin blockchain uses hash-based Proof-of-Work (PoW) that prevents unwanted participants from hogging the network resources.<n>Most of this energy is wasted on hash calculations, which serve no additional purpose.<n>We present a new framework for Useful PoW, ScaloWork, that decides the block proposer for the Bitcoin blockchain based on the solution for the dominating set problem.
  arXiv  Detail & Related papers  (2025-04-19T15:43:27Z)
• Zaptos: Towards Optimal Blockchain Latency [52.30047458198369]
  We introduce Zaptos, a parallel pipelined architecture designed to minimize end-to-end latency.<n>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.<n>Our measurements from the Aptos mainnet show that the optimistic approach reduces latency overhead by 71%.
  arXiv  Detail & Related papers  (2024-07-16T20:53:04Z)
• Towards a low carbon proof-of-work blockchain [0.0]
  A proof of technology is described towards replacing hashcash or other Proof of Work (PoW) methods with a lottery and proof-of-VM (PoVM) emulation. PoVM emulation is a form of PoW where an autonomous miner gets a lottery ticket in exchange for providing a VM for a specified period.
  arXiv  Detail & Related papers  (2024-04-06T20:48:20Z)
• Statistical Confidence in Mining Power Estimates for PoW Blockchains [1.7061868168035934]
  For Proof of Work (PoW) blockchains, the distribution of mining power cannot be read directly from the blockchain. We introduce a framework to quantify this statistical uncertainty for the Nakamoto coefficient.
  arXiv  Detail & Related papers  (2024-03-20T16:43:30Z)
• 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)
• SoK: Security of Cross-chain Bridges: Attack Surfaces, Defenses, and Open Problems [43.80265187232706]
  Cross-chain bridges are used to facilitate token and data exchanges across blockchains. Although bridges are becoming increasingly popular, they are still in their infancy and have been attacked multiple times recently. This paper analyzes the security landscape of cross-chain bridges in a holistic manner.
  arXiv  Detail & Related papers  (2023-12-19T20:13:21Z)
• Proof of Deep Learning: Approaches, Challenges, and Future Directions [0.0]
  PoDL is a consensus mechanism that uses the process of training a deep learning model as proof of work to add new blocks to the blockchain. We discuss the different types of PoDL algorithms, their advantages and disadvantages, and their potential applications.
  arXiv  Detail & Related papers  (2023-08-31T13:49:04Z)
• Refined Bitcoin Security-Latency Under Network Delay [35.16231062731263]
  We study how secure a block is after it becomes $k$-deep in the chain. We analyze the race between adversarial and honest chains in three different phases. We find the probability distribution of the growth of the adversarial chains under models similar to those in [Guo, Ren; AFT 2022] when a target block becomes $k$-deep in the chain.
  arXiv  Detail & Related papers  (2022-12-02T18:54:30Z)
• Token Spammers, Rug Pulls, and SniperBots: An Analysis of the Ecosystem of Tokens in Ethereum and in the Binance Smart Chain (BNB) [50.888293380932616]
  We study the ecosystem of the tokens and liquidity pools. We find that about 60% of tokens are active for less than one day. We estimate that 1-day rug pulls generated $240 million in profits.
  arXiv  Detail & Related papers  (2022-06-16T14:20:19Z)
• 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)
• 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.