Dynamic Sharding and Asynchronous BFT Achieve Scalable, Low-Latency Consensus
DS-Dumbo integrates dynamic weighted sharding with concurrent BFT execution via an input buffer, enabling horizontal scalability in asynchronous networks.
Zero-Knowledge Proof of Training Secures Decentralized Federated Learning Consensus
ZKPoT uses zk-SNARKs to verify decentralized model accuracy without revealing private data, solving the efficiency-privacy trade-off in federated learning.
Optimal Asynchronous Byzantine Agreement Achieves Quadratic Communication Efficiency
A novel committee-based protocol reduces asynchronous Byzantine agreement communication from cubic to quadratic, enabling practical fault-tolerant state machine replication.
Prioritized Committee Mechanism Achieves Optimal Asynchronous Byzantine Agreement Complexity
A new committee-based protocol achieves simultaneous optimal time, message, and communication complexity for foundational asynchronous consensus.
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.
Zero-Knowledge Proof of Training Secures Decentralized AI Consensus
A new Zero-Knowledge Proof of Training (ZKPoT) consensus mechanism leverages zk-SNARKs to cryptographically verify model performance, eliminating Proof-of-Stake centralization and preserving data privacy in decentralized machine learning.
Compositional Formal Verification Secures Complex DAG Consensus Protocols
This framework modularizes DAG consensus proofs into reusable components, dramatically reducing verification effort and ensuring robust protocol safety.
Zero-Knowledge Proof of Training Secures Federated Learning Consensus
ZKPoT uses zk-SNARKs to verify model contributions privately, eliminating the trade-off between decentralized AI privacy and consensus efficiency.
Adaptive Byzantine Agreement Reduces Communication Complexity Based on Actual Faults
A new synchronous protocol achieves adaptive word complexity in Byzantine Agreement, scaling communication with actual faults to unlock efficient, fault-tolerant consensus.
