Verifiable Information Dispersal Decouples Finality from Asynchronous Data Availability
Asynchronous Verifiable Dispersal is a new primitive enabling optimal BFT latency by proving data dispersal before full reconstruction, accelerating consensus.
Sub-Second Finality via Off-Chain Aggregated Byzantine Fault Tolerance
Alpenglow's Votor/Rotor architecture decouples finality from on-chain voting overhead, achieving sub-second latency with formal Byzantine resilience.
Decentralized Key Reveal Protocol Mitigates Front-Running with Minimal Latency
A new architecture for transaction encryption, F3B, uses a decentralized secret-management committee to reveal keys post-finality, eliminating front-running without high latency.
Asynchronous Consensus Achieves Low Latency through Optimistic Responsiveness
A new BFT protocol guarantees safety under full asynchrony while achieving synchronous-like speed during periods of network stability, resolving the latency-robustness trade-off.
DAG-Based BFT Protocol Achieves Optimal Latency without Common Primitives
This novel DAG-based BFT protocol achieves optimal three-round latency by eliminating reliable broadcast and common coin primitives, paving the way for hyper-efficient decentralized systems.
Fast-HotStuff Achieves Two-Round BFT Consensus, Enhancing HotStuff’s Speed and Robustness
Fast-HotStuff introduces a two-round BFT mechanism that resolves HotStuff's latency and attack vulnerabilities, establishing a new, faster baseline for decentralized finality.
Asynchronous Partial Vector Agreement Enables Constant-Round Error-Free Byzantine Consensus
Introducing Asynchronous Partial Vector Agreement, a new primitive that enables information-theoretically secure Byzantine consensus with optimal constant-time round complexity.
Layered Architecture Resolves Trilemma via Storage-Backed Consensus and Sharding
CrustChain integrates reputation-weighted Proof-of-Capacity with erasure coding and sharding, achieving high throughput and durability by decoupling storage.
ZKPoT: Private Consensus Verifies Decentralized Machine Learning
ZKPoT consensus leverages zk-SNARKs to cryptographically verify machine learning model contributions without revealing private training data or parameters.
