Angelfish Consensus Unifies Leader-DAG BFT for Optimal Throughput and Latency
The Angelfish hybrid consensus protocol dynamically integrates leader-based and DAG architectures, resolving the core BFT throughput-latency trade-off.
Set Byzantine Consensus Decouples Rollup Sequencing from Centralized Control
The research introduces Set Byzantine Consensus to construct a Decentralized Arranger, fundamentally solving rollup centralization by separating transaction content agreement from final ordering.
Distributed zkSNARKs Achieve Linear Prover Scalability with Constant Communication
A new distributed zkSNARK protocol, Pianist, achieves linear prover scalability by parallelizing proof generation with constant communication overhead, resolving the ZKP bottleneck for zkRollups.
Constant-Size Polynomial Commitments Unlock Scalable Zero-Knowledge Proof Systems
This cryptographic primitive allows a constant-size commitment to any polynomial, fundamentally decoupling proof size from computation complexity.
Set Byzantine Consensus Decentralizes Rollup Sequencing and Data Availability
Set Byzantine Consensus introduces a new primitive for L2s, enabling a decentralized 'arranger' service to eliminate sequencer centralization and censorship risk.
Graded Broadcast Protocol Decouples Agreement Achieving Optimal Asynchronous Latency
Falcon's Graded Broadcast bypasses mandatory agreement in ABFT, establishing a new primitive for lower latency and superior throughput in fully asynchronous systems.
Deterministic Sortition Guarantees Constant Committee Size for BFT Scalability
This research introduces a cryptographic sortition method providing deterministic committee size, fundamentally enhancing BFT consensus efficiency and security.
Asymmetric DAG Consensus Unlocks Constant Finality with Local Trust Assumptions
By extending DAG-Rider to use asymmetric quorums, this work achieves constant-time BFT finality under realistic, locally defined trust models.
Formal Rewrites Safely Scale Byzantine Fault Tolerance Protocols Fivefold
A new formal model and rewrite methodology prove that decoupling and partitioning can safely achieve a fivefold throughput increase for BFT protocols.
