Mechanism Design Establishes Truthful Equilibrium in Blockchain Consensus
Applying game theory's revelation mechanisms directly to consensus disputes creates a unique, subgame perfect equilibrium that structurally compels truthful block validation.
Zero-Knowledge Proof of Training Secures Federated Consensus
The Zero-Knowledge Proof of Training consensus mechanism uses zk-SNARKs to prove model performance without revealing private data, solving the privacy-utility conflict in decentralized computation.
Permissionless Consensus Framework Defines Blockchain Security Limits
This research establishes a foundational framework for permissionless consensus, categorizing blockchain environments to reveal inherent security and liveness.
Two-Fold BFT Algorithm Dynamically Detects Malicious Nodes for Robust Consensus
A novel two-fold BFT algorithm dynamically identifies malicious nodes, enhancing blockchain consensus security and resilience beyond fixed fault assumptions.
Proof-of-Data: A Novel Consensus for Decentralized, Byzantine-Resilient Federated Learning
Proof-of-Data introduces a two-layer consensus, merging asynchronous learning with BFT finality and ZKPs, enabling scalable, private decentralized AI.
Uncertified DAGs Achieve Optimal Latency in Byzantine Consensus
A novel commit rule for uncertified Directed Acyclic Graphs revolutionizes consensus, ensuring immediate transaction finality and optimal latency in distributed systems.
Mechanism Design for Truthful Blockchain Consensus and Fork Resolution
This research introduces revelation mechanisms, notably Simultaneous Report and Solomonic, to enforce truthful block proposals and resolve forks, enhancing blockchain security and efficiency.
RBFT: Enhancing Blockchain Resilience with Adaptive Consensus
A novel Byzantine Fault Tolerance protocol, RBFT, introduces weighted validation and a weak coordinator model to drastically improve blockchain resilience, latency, and throughput in dynamic networks.
Bullshark on Narwhal Achieves High-Performance Byzantine Fault-Tolerant DAG Consensus
This work meticulously analyzes Bullshark on Narwhal, revealing how round-based DAGs deliver optimal Byzantine fault-tolerant consensus for scalable decentralized systems.
