ZKPoT Cryptographically Enforces Private, Efficient, and Scalable Federated Learning Consensus
The ZKPoT mechanism uses zk-SNARKs to validate machine learning model contributions privately, solving the privacy-efficiency trade-off in decentralized AI.
Uncertified DAG Consensus Achieves Sub-Second Asynchronous Byzantine Finality
This new asynchronous BFT protocol uses an uncertified DAG and a novel commit rule to shatter the latency barrier, enabling sub-second finality at high throughput.
Practical Asynchronous BFT Protocol Achieves Optimal Performance and Simplicity
A new asynchronous BFT protocol merges rotating leader efficiency with leaderless agreement, ensuring optimal resilience and high performance without relying on network timing assumptions.
Probabilistic BFT Achieves Optimal Latency with Sub-Quadratic Message Complexity
By relaxing to a probabilistic security model, ProBFT delivers optimal three-step latency and $O(nsqrt{n})$ message complexity, enabling practical BFT scalability.
Near-Optimal Communication Byzantine Broadcast under Message Adversary Model
A new Byzantine Reliable Broadcast algorithm leverages erasure codes to achieve near-optimal $O(|m| + nkappa)$ communication complexity, securing asynchronous systems against message-dropping adversaries.
Leaderless Epidemic Consensus Protocol Scales Decentralized Blockchain Networks
The Blockchain Epidemic Consensus Protocol (BECP) introduces a leaderless, probabilistic convergence model that fundamentally resolves the scalability and message complexity bottlenecks of classical BFT.
Dynamic Byzantine Detection Exceeds Classical One-Third Fault Tolerance
A new two-fold Byzantine consensus algorithm dynamically detects and isolates malicious nodes, fundamentally improving system resilience beyond the one-third fault constraint.
Two-Round DAG Consensus Achieves Ultra-Fast Finality through Security Trade-Off
Odontoceti is the first two-round DAG consensus protocol, leveraging a 20% fault tolerance to deliver sub-second finality and simplify distributed architecture.
Efficient Byzantine Verifiable Secret Sharing Secures Decentralized Systems Foundationally
EByFTVeS introduces an Adaptive Share Delay Provision strategy to resolve consistency and efficiency burdens in BFT-based Verifiable Secret Sharing, strengthening core cryptographic primitives.
