Near-Optimal Communication Byzantine Broadcast under Message Adversary Model
A new Byzantine Reliable Broadcast algorithm leverages erasure codes to achieve near-optimal O(|m| + nκ) communication complexity, securing asynchronous systems against message-dropping adversaries.
Adaptive Byzantine Agreement Achieves Optimal Communication Complexity Based on Actual Faults
This new consensus protocol introduces adaptive communication complexity, scaling its message load to the actual fault count, which is asymptotically optimal for large-scale BFT systems.
Reasonable-World Assumptions Achieve Optimal Miner Revenue in Fee Mechanism Design
Introducing reasonable-world assumptions circumvents the zero-revenue impossibility result, enabling incentive-compatible transaction fee auctions.
Adaptive Byzantine Agreement Achieves Optimal Communication Complexity
This protocol dynamically scales Byzantine Agreement communication cost with actual faults, unlocking optimal efficiency for large decentralized networks.
Sublinear Vector Commitments Achieve Asymptotically Optimal Stateless Blockchain Client Updates
This new vector commitment scheme fundamentally solves the linear-scaling problem for stateless clients by achieving proven sublinear complexity for state updates.
New Vector Commitment Achieves Asymptotically Optimal Sublinear Stateless Client Updates
Researchers construct a dynamic Vector Commitment scheme achieving asymptotically optimal sublinear complexity, fundamentally enabling truly efficient stateless blockchain clients.
Sublinear Vector Commitments Enhance Blockchain Stateless Client Efficiency
This research introduces asymptotically optimal vector commitments, enabling significantly more efficient state updates for scalable decentralized systems like stateless blockchains.
Novel ZKP Protocols Achieve Linear Prover Time for Scalable Decentralized Computation
New ZKP protocols, Libra, deVirgo, Orion, and Pianist, dramatically reduce proof generation time, enabling truly scalable and private blockchain applications.
