Asynchronous Consensus Achieved Using Only Hash Functions and Simple Primitives
A novel asynchronous consensus protocol leverages a binding Index Cover Gather primitive and simple hash functions to achieve optimal fault tolerance and constant rounds, eliminating complex public-key cryptography.
Dual-Threshold BFT Consensus Achieves Sub-Second Planetary Finality
Mercury protocol uses adaptive dual resilience thresholds and BFT forensics to slash wide-area consensus latency to under 0.4 seconds, enabling global-scale SMR.
Revelation Mechanisms Enforce Truthful Consensus Equilibrium in Proof-of-Stake
A novel revelation mechanism uses game theory to guarantee truthful block proposals in Proof-of-Stake, simplifying consensus and boosting scalability.
Accountable Safety Unifies Finality for Robust Proof-of-Stake Consensus
Formal proof establishes accountable safety as the single, stronger security primitive, guaranteeing consistency and enabling verifiable fault attribution in BFT systems.
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.
Dynamic Global Ordering Unlocks Parallel BFT Throughput and Low Latency
Multi-BFT's global ordering bottleneck is eliminated by assigning monotonic ranks, dramatically boosting throughput and reducing latency.
Decentralized Clock Network Secures Transaction Ordering Fairness
The Decentralized Clock Network decouples transaction ordering from consensus, using resilient clock nodes to assign receipt timestamps, thereby eliminating validator-based front-running.
Adaptive Byzantine Agreement Achieves Optimal Communication Complexity
This protocol dynamically scales Byzantine Agreement communication cost with actual faults, unlocking optimal efficiency for large decentralized networks.
Zero-Knowledge Proof of Training Secures Decentralized Machine Learning Integrity
The Zero-Knowledge Proof of Training (ZKPoT) mechanism leverages zk-SNARKs to validate model accuracy without exposing private data, enabling provably secure on-chain AI.
