PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
September 30, 20250 citationsOpen Access

Adaptive Byzantine Agreement with Optimal Communication Complexity

From Few to Many Faults: Adaptive Byzantine Agreement with Optimal Communication

View Full Paper
Ask AI
Bookmark
Share

Authors

ACAndrei ConstantinescuMDMarc DufayAPAnton Paramonov

Discussion

Loading...

Member takes

Overview

This work presents new protocols for byzantine agreement, reducing communication demands in distributed systems.

Key Points

  • The proposed protocol achieves adaptive communication complexity of O(n + t · f) words in partially synchronous settings.
  • It establishes tight bounds on communication complexity, addressing both upper and lower limits in byzantine agreement.
  • An asynchronous protocol is designed with O((n + t^2) · log n) words, proving resilience of t < n/3.
  • Utilizing a bipartite expander graph, the study highlights efficient information dissemination to achieve consensus.

Cite This Study

Constantinescu et al. (2025) studied this question.

synapsesocial.com/papers/68dc12c58a7d58c25ebb0a02https://doi.org/10.48550/arxiv.2505.19989
View Full Paper
Ask AI
Bookmark
Share