Dynamic Leader Election Enhances Asynchronous Byzantine Consensus Resilience
A novel verifiable random function dynamically elects leaders, fortifying Byzantine fault tolerance and preserving liveness in asynchronous distributed networks.
Odontoceti: Ultra-Fast DAG Consensus with Two-Round Commitment
Odontoceti pioneers a DAG-based consensus achieving two-round transaction commitment, dramatically enhancing scalability and latency by strategically balancing fault tolerance for future blockchain architectures.
Secure Sharding Consensus Pattern Dramatically Scales Throughput with Optimized Overhead
Kronos introduces a buffer-based sharding consensus pattern, provably achieving cross-shard atomicity and $12times$ throughput for next-generation scalable architectures.
Buffer Mechanism Enables Generic Sharding Consensus with Optimal Overhead
A jointly managed buffer and batch certification enable atomic cross-shard transactions with optimal overhead, creating a universal BFT sharding framework.
Federated Distributed Key Generation Enables Robust Threshold Cryptography for Open Networks
FDKG introduces optional participation and heterogeneous trust to DKG, resolving the impracticality of key generation in large, dynamic validator sets.
Secure Sharding Consensus Achieves Atomic Cross-Shard Transactions with Optimal Overhead
Kronos introduces a generic, buffer-based sharding consensus pattern, provably guaranteeing cross-shard transaction atomicity and enabling thousands of nodes.
Secure Timestamp Primitive Rethinks Consensus Fairness in Asynchronous Networks
Researchers introduce a novel, corruption-resistant timestamp primitive, enabling consensus protocols to reliably record transaction submission time, which fundamentally mitigates censorship and MEV risk.
Erasure Coding Achieves Near-Optimal Byzantine Broadcast Communication Efficiency
Researchers deployed erasure-correcting codes and vector commitments to fragment messages, drastically reducing Byzantine Reliable Broadcast communication complexity to near-optimal bounds.
Direct Client-Replica Communication Achieves Optimal Consensus Latency
Researchers achieved the physically-optimal $2delta$ latency by eliminating inter-replica communication, unlocking high-speed, censorship-resistant applications.
