Adelie: Detection and prevention of Byzantine behaviour in DAG-based consensus protocols

• URL: http://arxiv.org/abs/2408.02000v2
• Date: Sun, 25 Aug 2024 21:16:58 GMT
• Title: Adelie: Detection and prevention of Byzantine behaviour in DAG-based consensus protocols
• Authors: Andrey Chursin,
• Abstract summary: Recent developments in Byzantine Fault Tolerant consensus protocols have shown the DAG-based protocols to be a very promising technique. The latest versions of DAG-based protocols such as Mysticeti and Shoal++ show that indeed a latency comparable to that of traditional consensus protocols such as HotStuff can be achieve. This paper presents an implementation of Adelie protocol - bftd that demonstrates yet another breakthrough in the maximum achieved TPS and low latency.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Recent developments in the Byzantine Fault Tolerant consensus protocols have shown the DAG-based protocols to be a very promising technique. While early implementations of DAG-based protocols such as Narwhal/Bullshark trade high throughput for a low latency, the latest versions of DAG-based protocols such as Mysticeti and Shoal++ show that indeed a latency comparable to that of traditional consensus protocols such as HotStuff can be achieve with the DAG-based consensus protocols while still maintaining high throughput. Mysticeti in particular achieves a low latency by implementing a novel approach of using an uncertified DAG - a significant breakthrough comparing to the certified DAG used in the previous generations of the protocol. However, the uncertified DAG exposes the system to new vectors of attacks by Byzantine validators that did not exist in the certified DAG protocols. In this paper we describe those issues and present the Adelie protocol, that addresses issues that comes with an uncertified DAG. We also incorporate some of the techniques from the Shoal++ to reduce latency even further. This paper also presents an implementation of Adelie protocol - bftd that demonstrates yet another breakthrough in the maximum achieved TPS and low latency.

Related papers

• Overcoming Joint Intractability with Lossless Hierarchical Speculative Decoding [58.92526489742584]
  We propose provably lossless.<n> verification method that significantly boosts the expected number of accepted tokens.<n>We show that HSD yields consistent improvements in acceptance rates across diverse model families and benchmarks.
  arXiv  Detail & Related papers  (2026-01-09T11:10:29Z)
• Causal Discovery on Higher-Order Interactions [2.0697105762666324]
  Causal discovery combines data with knowledge provided by experts to learn the DAG representing the causal relationships between a given set of variables.<n>When data are scarce, bagging is used to measure our confidence in an average DAG obtained by aggregating bootstrapped DAGs.<n>We introduce a novel theoretical framework based on higher-order structures and describe a new DAG aggregation algorithm.
  arXiv  Detail & Related papers  (2025-11-18T07:35:00Z)
• Angelfish: Consensus with Optimal Throughput and Latency Across the Leader-DAG Spectrum [3.940687402522194]
  We present Angelfish, a hybrid protocol that adapts smoothly across this design space.<n>Angelfish lets a dynamically-adjusted subset of parties use best-effort broadcast to issue lightweight votes instead of reliably broadcasting DAG vertices.<n>Our empirical evaluation shows that Angelfish attains state-of-the-art peak throughput while matching the latency of leader-based protocols under moderate throughput.
  arXiv  Detail & Related papers  (2025-09-19T10:30:25Z)
• GRANITE : a Byzantine-Resilient Dynamic Gossip Learning Framework [1.9093042949944972]
  Gossip Learning (GL) is a decentralized learning paradigm where users iteratively exchange and aggregate models with a small set of neighboring peers. Recent GL approaches rely on dynamic communication graphs built and maintained using Random Peer Sampling (RPS) protocols. We introduce a framework for robust learning over sparse, dynamic graphs in the presence of a fraction of Byzantine nodes.
  arXiv  Detail & Related papers  (2025-04-24T12:03:15Z)
• A Label-Free Heterophily-Guided Approach for Unsupervised Graph Fraud Detection [60.09453163562244]
  We propose a Heterophily-guided Unsupervised Graph fraud dEtection approach (HUGE) for unsupervised GFD. In the estimation module, we design a novel label-free heterophily metric called HALO, which captures the critical graph properties for GFD. In the alignment-based fraud detection module, we develop a joint-GNN architecture with ranking loss and asymmetric alignment loss.
  arXiv  Detail & Related papers  (2025-02-18T22:07:36Z)
• Reusable Formal Verification of DAG-based Consensus Protocols [8.277981465630377]
  DAG-based consensus protocols are being adoption by blockchain companies to decrease energy footprints and improve security. This paper presents a safety-proven formal specification of two DAG-based protocols.
  arXiv  Detail & Related papers  (2024-07-02T11:19:12Z)
• Mysticeti: Reaching the Limits of Latency with Uncertified DAGs [5.328717371685882]
  We introduce Mysticeti-C, the first DAG-based Byzantine consensus protocol to achieve the lower bounds of latency of 3 message rounds. We extend Mysticeti-C to Mysticeti-FPC, which incorporates a fast commit path that achieves even lower latency for transferring assets.
  arXiv  Detail & Related papers  (2023-10-23T11:40:50Z)
• Small Object Detection via Coarse-to-fine Proposal Generation and Imitation Learning [52.06176253457522]
  We propose a two-stage framework tailored for small object detection based on the Coarse-to-fine pipeline and Feature Imitation learning. CFINet achieves state-of-the-art performance on the large-scale small object detection benchmarks, SODA-D and SODA-A.
  arXiv  Detail & Related papers  (2023-08-18T13:13:09Z)
• Imbalanced Open Set Domain Adaptation via Moving-threshold Estimation and Gradual Alignment [58.56087979262192]
  Open Set Domain Adaptation (OSDA) aims to transfer knowledge from a well-labeled source domain to an unlabeled target domain. The performance of OSDA methods degrades drastically under intra-domain class imbalance and inter-domain label shift. We propose Open-set Moving-threshold Estimation and Gradual Alignment (OMEGA) to alleviate the negative effects raised by label shift.
  arXiv  Detail & Related papers  (2023-03-08T05:55:02Z)
• Robustness of implemented device-independent protocols against constrained leakage [0.0]
  Device-independent (DI) protocols have experienced significant progress in recent years. Security proofs for those demonstrations rely on a typical assumption in DI cryptography, that the devices do not leak any unwanted information to each other or to an adversary.
  arXiv  Detail & Related papers  (2023-02-27T16:28:23Z)
• Single-qubit loss-tolerant quantum position verification protocol secure against entangled attackers [0.0]
  We study the exact loss-tolerance of the most popular protocol for QPV, which is based on BB84 states. We show how these results transfer to the variant protocol which combines $n$ bits of classical information with a single qubit.
  arXiv  Detail & Related papers  (2022-12-07T14:39:56Z)
• Exploring the Design of Adaptation Protocols for Improved Generalization and Machine Learning Safety [33.24980750651318]
  We evaluate common adaptation protocols across distributions shifts and machine learning safety metrics. We find that protocols induce disparate trade-offs that were not apparent from prior evaluation. Using hardness-promoting augmentations during LP and then FT with augmentations may be particularly effective for trade-off mitigation.
  arXiv  Detail & Related papers  (2022-07-26T02:33:04Z)
• Divide to Adapt: Mitigating Confirmation Bias for Domain Adaptation of Black-Box Predictors [94.78389703894042]
  Domain Adaptation of Black-box Predictors (DABP) aims to learn a model on an unlabeled target domain supervised by a black-box predictor trained on a source domain. It does not require access to both the source-domain data and the predictor parameters, thus addressing the data privacy and portability issues of standard domain adaptation. We propose a new method, named BETA, to incorporate knowledge distillation and noisy label learning into one coherent framework.
  arXiv  Detail & Related papers  (2022-05-28T16:00:44Z)
• Domain-Agnostic Prior for Transfer Semantic Segmentation [197.9378107222422]
  Unsupervised domain adaptation (UDA) is an important topic in the computer vision community. We present a mechanism that regularizes cross-domain representation learning with a domain-agnostic prior (DAP) Our research reveals that UDA benefits much from better proxies, possibly from other data modalities.
  arXiv  Detail & Related papers  (2022-04-06T09:13:25Z)
• Benchmarking Deep Models for Salient Object Detection [67.07247772280212]
  We construct a general SALient Object Detection (SALOD) benchmark to conduct a comprehensive comparison among several representative SOD methods. In the above experiments, we find that existing loss functions usually specialized in some metrics but reported inferior results on the others. We propose a novel Edge-Aware (EA) loss that promotes deep networks to learn more discriminative features by integrating both pixel- and image-level supervision signals.
  arXiv  Detail & Related papers  (2022-02-07T03:43:16Z)
• Round-robin differential phase-time-shifting protocol for quantum key distribution: theory and experiment [58.03659958248968]
  Quantum key distribution (QKD) allows the establishment of common cryptographic keys among distant parties. Recently, a QKD protocol that circumvents the need for monitoring signal disturbance, has been proposed and demonstrated in initial experiments. We derive the security proofs of the round-robin differential phase-time-shifting protocol in the collective attack scenario. Our results show that the RRDPTS protocol can achieve higher secret key rate in comparison with the RRDPS, in the condition of high quantum bit error rate.
  arXiv  Detail & Related papers  (2021-03-15T15:20:09Z)

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.