M-Bounded Fairness Guarantees Asynchronous Consensus in Dynamic Networks
Foundational research introduces m-bounded fairness, a constructive liveness property that ensures consensus convergence in asynchronous, dynamic systems.
Collaborative Mining Protocol Fortifies Proof-of-Stake against Long-Range History Rewrites
PoC introduces a collaborative, resource-efficient cryptographic puzzle to prevent long-range attacks, guaranteeing immutable ledger history for PoS/BFT chains.
Random Asynchronous Model Overcomes Byzantine Consensus Impossibility Bounds
By replacing adversarial message scheduling with a random model, this research overcomes classic asynchronous consensus impossibility bounds, enabling higher resilience protocols.
Uncertified DAG Consensus Protocol Achieves Optimal Three-Round Latency
Mysticeti-C is the first DAG-based Byzantine consensus protocol to reach the theoretical lower bound of three message rounds, enabling sub-second finality.
Asymmetric Trust Model Secures DAG Consensus Protocols
Researchers generalize DAG consensus to an asymmetric trust model, enabling protocols to maintain security even when nodes hold non-uniform fault tolerance assumptions.
Polynomial Commitments Secure Erasure Codes for Scalable Data Availability Sampling
Cryptographically-secured erasure codes enable light clients to verify data availability by sampling, resolving the scalability bottleneck for modular architectures.
Shunning Secret Sharing Enables Optimal Asynchronous Agreement against General Adversaries
A novel Shunning Secret Sharing primitive enables the first almost-surely terminating Byzantine Agreement protocol secure against general, computationally-unbounded adversaries.
Decentralized Key Generation Secures Threshold Signatures Eliminating Trusted Setup
Integrating Pedersen's DKG with BFT consensus eliminates the trusted dealer, securing multi-party systems and decentralized applications.
Near-Optimal Signature-Free Byzantine Agreement Reduces Blockchain Communication Cost
New signature-free validated Byzantine agreement protocols achieve near-optimal bit complexity, fundamentally reducing the communication overhead for synchronous state machine replication.
