Trusted Components Enable Scalable Censorship-Resistant DAG Consensus
Fides introduces a novel DAG-based BFT consensus protocol, leveraging Trusted Execution Environments to significantly enhance scalability and censorship resistance.
QScale: Probabilistic Chained Consensus for Moderate-Scale Systems
QScale introduces a novel probabilistic chained consensus, significantly reducing communication overhead for distributed ledgers at moderate scales.
Set Byzantine Consensus Decentralizes Rollup Sequencers and Data Availability
Set Byzantine Consensus introduces a decentralized "arranger" for rollups, fundamentally solving the single-node sequencer bottleneck and enhancing censorship resistance.
Verifiable Entropy Functions Secure Optimal Decentralized Randomness Extraction
The Verifiable Entropy Function, a new primitive, guarantees maximal unbiased randomness from distributed inputs, fundamentally securing Proof-of-Stake consensus.
Rondo Protocol Achieves Optimal Linear Complexity for Decentralized Randomness Beacon Sharing
Rondo introduces batched asynchronous verifiable secret sharing with partial output, cutting message complexity to linear for scalable, reconfigurable randomness beacons.
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.
Asynchronous Verifiable Random Functions Achieve Optimal Leaderless BFT Consensus
AVRFs enable every node to verifiably compute the next proposer locally, eliminating leader election latency and achieving optimal asynchronous speed.
Accountable Safety Decouples Liveness and Finality in Proof-of-Stake Consensus
This research introduces Accountable Safety, a new PoS property that guarantees finality or provides cryptographic proof of validator misbehavior under minimal synchrony.
Committee-Based Byzantine Agreement Protocol Slashes Communication Complexity
A novel committee-based protocol achieves optimal asynchronous Byzantine agreement, drastically reducing cubic communication overhead.
