Zero-Knowledge Proof of Training Secures Private Decentralized Federated Learning Consensus
ZKPoT uses zk-SNARKs to verify model performance without revealing local data, achieving robust, scalable, and privacy-preserving decentralized consensus.
Efficient Validated Agreement Bridges Complexity Gap for Secure State Replication
New signature-free validated Byzantine agreement protocols achieve optimal bit complexity, securing progress and external validity for high-performance state machine replication.
Asynchronous Verifiable Random Functions Achieve Optimal Leaderless BFT Consensus
AVRFs enable every node to verifiably compute the next proposer locally, eliminating leader election latency and achieving optimal asynchronous speed.
Decentralized Clock Network Decouples Ordering, Ensuring Provably Fair Transaction Finality
The Decentralized Clock Network is a new primitive that separates transaction timestamp agreement from consensus, mitigating front-running and MEV.
Leaderless Asynchronous Consensus Achieves Optimal BFT Performance
This leaderless, asynchronous BFT protocol uses concurrent transaction processing and a novel threshold signature to achieve optimal two-round finality and linear communication.
Zero-Knowledge Proof of Training Secures Decentralized Federated Learning
ZKPoT leverages zk-SNARKs to prove model performance without revealing private data, solving the privacy-efficiency trade-off in decentralized AI.
Optimistic Byzantine Agreement Achieves Linear Communication Complexity for Scalability
This optimistic consensus design fundamentally challenges the quadratic communication lower bound, enabling optimal scalability for distributed state machine replication.
Simulation-Resistant Honest Majority Secures Dynamic Proof-of-Stake Consensus Bootstrapping
A new simulation-resistant honest majority condition proves the security limits of dynamic PoS, enabling a bootstrapping gadget for robust membership changes.
Hybrid BFT Model Achieves Low-Latency Synchronous Consensus
AlterBFT introduces a hybrid synchronous model, leveraging empirical message size latency to dramatically reduce consensus delay in distributed systems.
Formalizing Liveness Accountability Requires Honest Majority and Majority Synchrony
New theoretical framework precisely defines when and how consensus protocols can cryptographically blame nodes for stalling transaction finality.
Rondo Protocol Achieves Optimal Linear Complexity for Decentralized Randomness Beacon Sharing
Rondo introduces batched asynchronous verifiable secret sharing with partial output, cutting message complexity to linear for scalable, reconfigurable randomness beacons.
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
A new Zero-Knowledge Proof of Training (ZKPoT) consensus mechanism leverages zk-SNARKs to validate machine learning model contributions privately, resolving the efficiency and privacy trade-off in decentralized AI.
Adaptive Delegation Weighting Mitigates Proof-of-Stake Centralization Risk
Adaptive Delegation Weighting employs a non-linear reward function to economically disincentivize stake concentration, fundamentally securing DPoS decentralization.
Adaptive Byzantine Agreement Achieves Optimal Communication Parameterized by Actual Faults
This protocol introduces adaptive communication complexity to Byzantine Agreement, establishing tight theoretical bounds and optimizing consensus efficiency for real-world fault conditions.
Adaptive Hybrid Consensus Dynamically Optimizes Security, Latency, and Throughput
AHC dynamically blends PoW, PoS, and BFT elements, creating a self-tuning consensus mechanism that resolves the static trade-offs of the trilemma.
Quadratic BFT Consensus Achieves Optimal Communication Complexity
SQuad introduces RareSync, a novel view synchronization primitive that reduces partially synchronous BFT communication complexity to the theoretical quadratic minimum.
Compositional Formal Proofs Secure DAG Consensus Protocols Systemically
A new compositional framework provides mathematically rigorous, reusable safety proofs for complex DAG-based consensus, fundamentally securing high-throughput decentralized systems.
Lightweight Asynchronous Secret Sharing Achieves Optimal Resilience and Efficiency
New protocols for Asynchronous Verifiable Secret Sharing (AVSS) leverage lightweight primitives to achieve optimal resilience and amortized linear communication, fundamentally accelerating BFT consensus.
JUMBO Consensus Achieves Quadratic Asynchronous BFT Scalability through Certificate Aggregation
JUMBO protocol resolves the mathcalO(n3) aBFT complexity bottleneck by aggregating quorum certificates, unlocking truly scalable asynchronous decentralized systems.
Proof-of-Data Hybrid Consensus Secures Scalable Deterministic Finality
The Proof-of-Data protocol decouples asynchronous execution from BFT-based finality, delivering a hybrid model for scalable, deterministic 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
ZKPoT leverages zk-SNARKs to validate model contributions in federated learning, eliminating privacy risks and the centralization inherent in Proof-of-Stake.
Hybrid BFT Achieves Both Probabilistic Speed and Periodic Finality
Albatross combines speculative BFT's high throughput with Tendermint's periodic provable finality, resolving the performance-finality consensus trade-off.
Graded Broadcast Protocol Lowers Asynchronous BFT Latency Bypassing Agreement
The new Graded Broadcast primitive bypasses the costly agreement stage in Asynchronous BFT, fundamentally reducing consensus latency and enhancing throughput.
Non-Linear Stake Weighting Fundamentally Advances Proof-of-Stake Decentralization and Resilience
New non-linear stake weighting models, Square Root and Logarithmic, mathematically re-balance validator influence to secure PoS decentralization.
Compositional Formal Verification Secures Complex DAG Consensus Protocols
This compositional TLA+ framework reuses verified components, reducing the proof effort for complex DAG consensus protocols by nearly fifty percent, ensuring robust safety.
Mechanism Design Enforces Truthful Consensus Using Staked Collateral
A novel revelation mechanism leverages staked assets to ensure validators' truthfulness, resolving consensus disputes by making block proposal honesty the unique subgame perfect equilibrium.
Zero-Knowledge Proof of Training Secures Federated Learning Consensus
A new Zero-Knowledge Proof of Training (ZKPoT) consensus uses zk-SNARKs to verify model performance privately, solving the privacy-centralization dilemma in decentralized AI.
