Carbyne: An Ultra-Lightweight DoS-Resilient Mempool for Bitcoin

• URL: http://arxiv.org/abs/2504.16089v1
• Date: Thu, 20 Mar 2025 11:03:13 GMT
• Title: Carbyne: An Ultra-Lightweight DoS-Resilient Mempool for Bitcoin
• Authors: Hina Binte Haq, Syed Taha Ali, Asad Salman, Patrick McCorry, Siamak F. Shahandashti,
• Abstract summary: We present Neonpool, a novel optimization for transaction pool leveraging bloom filter variants.<n>Neonpool drastically reduces memory consumption by up to 200 (e.g., 400 MB to 2 MB) while maintaining over 99.99% transaction processing accuracy.
• Score: 2.493740042317776
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The increasing adoption of cryptocurrencies has significantly amplified the resource requirements for operating full nodes, creating substantial barriers to entry. Unlike miners, who are financially incentivized through block rewards and transaction fees, full nodes lack direct economic compensation for their critical role in maintaining the network. A key resource burden is the transaction pool, which is particularly memory-intensive as it temporarily stores unconfirmed transactions awaiting verification and propagation across the network. We present Neonpool, a novel optimization for transaction pool leveraging bloom filter variants to drastically reduce memory consumption by up to 200 (e.g., 400 MB to 2 MB) while maintaining over 99.99% transaction processing accuracy. Implemented in C++ and evaluated on unique Bitcoin and Ethereum datasets, Neonpool enables efficient operation on lightweight clients, such as smartphones, IoT devices, and systems-on-a-chip, without requiring a hard fork. By lowering the cost of node participation, Neonpool enhances decentralization and strengthens the overall security and robustness of cryptocurrency networks.

Related papers

• 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)
• 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)
• Neonpool: Reimagining cryptocurrency transaction pools for lightweight clients and IoT devices [2.493740042317776]
  Neonpool is an innovative transaction pool optimization using bloom filter variants.<n>It verifies and forwards transactions with over 99.99% accuracy and does not necessitate a hard fork.<n>Neonpool is ideally suited for lightweight cryptocurrency clients and for resource-constrained devices such as browsers, systems-on-a-chip, mobile or IoT devices.
  arXiv  Detail & Related papers  (2024-12-18T03:19:19Z)
• A Supercomputing Based Distributed Cloud Marketplace [4.168350645069565]
  We introduce an infinitely scalable, secure, and high throughput blockchain capable of amassing supercomputer speeds with off-the-shelf hardware, LuluChain. By eliminating the need for timestamp synchronization and majority agreement among all participants, LuluChain opens the door to reliable trust, low-cost instant transactions, and flexible instant smart contracts.
  arXiv  Detail & Related papers  (2024-11-15T15:53:20Z)
• 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)
• Kronos: A Secure and Generic Sharding Blockchain Consensus with Optimized Overhead [17.387814385763622]
  Sharding enhances blockchain scalability by dividing the network into shards, each managing specific unspent transaction outputs or accounts. Cross-shard transactions pose a critical challenge to the security and efficiency of sharding blockchains. We present Kronos, a secure sharding blockchain consensus achieving optimized overhead.
  arXiv  Detail & Related papers  (2024-03-06T12:26:04Z)
• Understanding Ethereum Mempool Security under Asymmetric DoS by Symbolized Stateful Fuzzing [21.076514594542118]
  MPFUZZ is the first mempool fuzzer to find asymmetric DoS bugs. Running MPFUZZ on six major clients leads to the discovering of new mempool vulnerabilities.
  arXiv  Detail & Related papers  (2023-12-05T10:31:02Z)
• A Scale-out Decentralized Blockchain Ledger System for Web3.0 [5.327844605578174]
  This paper proposes EZchain -- a novel decentralized scale-out" ledger system designed for web3.0. Without compromising security and decentralization, EZchain successfully accomplishes the following milestones.
  arXiv  Detail & Related papers  (2023-12-01T01:34:48Z)
• Demonstration of quantum-digital payments [36.136619420474766]
  We show how quantum light can secure daily digital payments by generating inherently unforgeable quantum cryptograms. Unlike previously proposed protocols, our solution does not depend on long-term quantum storage or trusted agents and authenticated channels. It is practical with near-term technology and may herald an era of quantum-enabled security.
  arXiv  Detail & Related papers  (2023-05-23T20:20:14Z)
• 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)
• Blockchain Assisted Decentralized Federated Learning (BLADE-FL) with Lazy Clients [124.48732110742623]
  We propose a novel framework by integrating blockchain into Federated Learning (FL) BLADE-FL has a good performance in terms of privacy preservation, tamper resistance, and effective cooperation of learning. It gives rise to a new problem of training deficiency, caused by lazy clients who plagiarize others' trained models and add artificial noises to conceal their cheating behaviors.
  arXiv  Detail & Related papers  (2020-12-02T12:18:27Z)
• Resource Management for Blockchain-enabled Federated Learning: A Deep Reinforcement Learning Approach [54.29213445674221]
  Federated Learning (BFL) enables mobile devices to collaboratively train neural network models required by a Machine Learning Model Owner (MLMO) The issue of BFL is that the mobile devices have energy and CPU constraints that may reduce the system lifetime and training efficiency. We propose to use the Deep Reinforcement Learning (DRL) to derive the optimal decisions for theO.
  arXiv  Detail & Related papers  (2020-04-08T16:29:19Z)

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.