BlueBottle: Fast and Robust Blockchains through Subsystem Specialization

• URL: http://arxiv.org/abs/2511.15361v1
• Date: Wed, 19 Nov 2025 11:42:43 GMT
• Title: BlueBottle: Fast and Robust Blockchains through Subsystem Specialization
• Authors: Preston Vander Vos, Alberto Sonnino, Giorgos Tsimos, Philipp Jovanovic, Lefteris Kokoris-Kogias,
• Abstract summary: We present BlueBottle, a two-layer consensus architecture.<n>The core layer, BB-Core, trades some fault tolerance for a much lower finality latency with a medium-sized core validator set.<n>The guard layer, BB-Guard, provides decentralized misbehavior detection in BB-Core, and a synchronous recovery path.
• Score: 5.4507160079308425
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Blockchain consensus faces a trilemma of security, latency, and decentralization. High-throughput systems often require a reduction in decentralization or robustness against strong adversaries, while highly decentralized and secure systems tend to have lower performance. We present BlueBottle, a two-layer consensus architecture. The core layer, BB-Core, is an n=5f+1 protocol that trades some fault tolerance for a much lower finality latency with a medium-sized core validator set. Our experiments show that BB-Core reduces latency by 20-25% in comparison to Mysticeti. The guard layer, BB-Guard, provides decentralized timestamping, proactive misbehavior detection in BB-Core, and a synchronous recovery path. When it observes equivocations or liveness failures in the core -- while tolerating up to f<3n/5 faulty nodes in the primary layer -- guard validators disseminate evidence, agree on misbehaving parties for exclusion or slashing, and either restart the core protocol (for liveness violations) or select a canonical fork (for safety violations). Together, these layers enable optimistic sub-second finality at high throughput while maintaining strong safety and liveness under a mild synchrony assumption.

Related papers

• Beluga: Block Synchronization for BFT Consensus Protocols [7.734856966655481]
  We introduce the concept of a block synchronizer, a simple abstraction that drives incremental block retrieval and enforces resource-aware exchange.<n>Beluga is a modular and scarcity-aware instantiation of the block synchronizer.<n>It achieves optimal common-case latency while bounding the cost of recovery under faults and adversarial behavior.
  arXiv  Detail & Related papers  (2025-11-19T15:12:16Z)
• Scaling Decentralized Learning with FLock [31.883271929012977]
  This paper introduces FLock, a decentralized framework for fine-tuning large language models (LLMs)<n> Integrating a blockchain-based trust layer with economic incentives, FLock replaces the central aggregator with a secure, auditable protocol for cooperation among untrusted parties.<n>Our experiments show the FLock framework defends against backdoor poisoning attacks that compromise standard FLs.
  arXiv  Detail & Related papers  (2025-07-21T08:01:43Z)
• 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)
• An Integrated Blockchain and IPFS Solution for Secure and Efficient Source Code Repository Hosting using Middleman Approach [0.9895793818721335]
  This study introduces a novel hybrid architecture combining the security of the blockchain and the InterPlanetary File System.<n>Our results demonstrate that this architecture achieves a secure, auditable, and resilient platform for source code hosting.
  arXiv  Detail & Related papers  (2024-09-22T16:57:38Z)
• 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)
• 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)
• 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)
• Transaction Capacity, Security and Latency in Blockchains [45.776687601070705]
  We analyze how secure a block is after the block becomes $k$-deep, i.e., security-latency, for Nakamoto consensus.<n>We connect the security-latency analysis to sustainable transaction rate of the queue system.
  arXiv  Detail & Related papers  (2024-02-15T17:43:13Z)
• TBDD: A New Trust-based, DRL-driven Framework for Blockchain Sharding in IoT [25.15169926146292]
  Integrating sharded blockchain with IoT presents a solution for trust issues and optimized data flow. Deep Reinforcement Learning adeptly handles dynamic, complex systems and multi-dimensional optimization. textscTbDd discerns node types and performs targeted resharding against potential threats.
  arXiv  Detail & Related papers  (2024-01-01T01:57:28Z)
• ESCORT: Ethereum Smart COntRacTs Vulnerability Detection using Deep Neural Network and Transfer Learning [80.85273827468063]
  Existing machine learning-based vulnerability detection methods are limited and only inspect whether the smart contract is vulnerable. We propose ESCORT, the first Deep Neural Network (DNN)-based vulnerability detection framework for smart contracts. We show that ESCORT achieves an average F1-score of 95% on six vulnerability types and the detection time is 0.02 seconds per contract.
  arXiv  Detail & Related papers  (2021-03-23T15:04:44Z)
• 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.