Optimistic Byzantine Agreement Achieves Linear Communication Complexity for Scalability
This optimistic consensus design fundamentally challenges the quadratic communication lower bound, enabling optimal scalability for distributed state machine replication.
Differential Privacy Guarantees Fair Transaction Ordering in Blockchains
Foundational research proves Differential Privacy mechanisms eliminate algorithmic bias, ensuring equal opportunity for all transactions in State Machine Replication.
Hybrid BFT Model Achieves Low-Latency Synchronous Consensus
AlterBFT introduces a hybrid synchronous model, leveraging empirical message size latency to dramatically reduce consensus delay in distributed systems.
Optimal Asynchronous Byzantine Agreement Achieves Quadratic Communication Efficiency
A novel committee-based protocol reduces asynchronous Byzantine agreement communication from cubic to quadratic, enabling practical fault-tolerant state machine replication.
Quadratic BFT Consensus Achieves Optimal Communication Complexity
SQuad introduces RareSync, a novel view synchronization primitive that reduces partially synchronous BFT communication complexity to the theoretical quadratic minimum.
JUMBO Consensus Achieves Quadratic Asynchronous BFT Scalability through Certificate Aggregation
JUMBO protocol resolves the $mathcal{O}(n^3)$ aBFT complexity bottleneck by aggregating quorum certificates, unlocking truly scalable asynchronous decentralized systems.
Prioritized Committee Mechanism Achieves Optimal Asynchronous Byzantine Agreement Complexity
A new committee-based protocol achieves simultaneous optimal time, message, and communication complexity for foundational asynchronous consensus.
Differential Privacy Enables Provably Fair Transaction Ordering
Establishing a formal link between Differential Privacy and State Machine Replication's equal opportunity property quantifiably eliminates algorithmic bias in ordering.
Hybrid BFT Achieves Both Probabilistic Speed and Periodic Finality
Albatross combines speculative BFT's high throughput with Tendermint's periodic provable finality, resolving the performance-finality consensus trade-off.
