Probabilistic Byzantine Fault Tolerance Enhances Distributed Consensus Scalability
        
        
        
        
          
        
        
      
        
    
        
        A new probabilistic Byzantine Fault Tolerance protocol significantly improves consensus scalability by adopting realistic adversary assumptions, reducing message complexity.
        
        Erasure Code Commitments Enhance Data Availability Sampling
        
        
        
        
          
        
        
      
        
    
        
        A new cryptographic primitive, erasure code commitments, fundamentally secures data availability sampling by ensuring committed data integrity.
        
        Formalizing Slashing to Mitigate Byzantine Exploits in Proof-of-Stake
        
        
        
        
          
        
        
      
        
    
        
        This research reveals critical vulnerabilities in existing Proof-of-Stake penalty mechanisms, proposing a formal framework to design provably robust slashing conditions.
        
        Epidemic Consensus Protocol Enables Scalable, Decentralized Blockchain Networks
        
        
        
        
          
        
        
      
        
    
        
        A novel epidemic consensus protocol, BECP, leverages decentralized information dissemination to achieve high throughput and low latency across large-scale blockchain networks.
        
        Pulsar: Composable Density-Based Proof of Stake for Sidechain Integration
        
        
        
        
          
        
        
      
        
    
        
        Pulsar introduces a novel density-based chain selection rule, enhancing Proof of Stake security and enabling robust sidechain interoperability with Proof of Work systems.
        
        Asymmetric Trust Redefines Distributed Fault Tolerance
        
        
        
        
          
        
        
      
        
    
        
        This research introduces asymmetric Byzantine quorum systems, enabling subjective trust models to secure distributed protocols and consensus mechanisms.
        
        Consensus Learning Integrates Distributed Machine Intelligence with Robust Peer-To-Peer Agreement
        
        
        
        
          
        
        
      
        
    
        
        This paradigm fuses ensemble learning with decentralized consensus, enabling private, scalable machine intelligence resilient to adversarial threats.
        
        Formalizing Economic Security for Permissionless Consensus Protocols with Slashing
        
        
        
        
          
        
        
      
        
    
        
        This research formalizes economic security for permissionless consensus, demonstrating how slashing mechanisms in Proof-of-Stake can enhance network resilience.
        
        Formal Methods Advance Blockchain Reliability and Security
        
        
        
        
          
        
        
      
        
    
        
        This survey consolidates formal methods, providing a robust framework for verifying blockchain correctness, reliability, and security.
        
        Unifying Blockchain Scalability across Architecture, Data, and Protocol Dimensions
        
        
        
        
          
        
        
      
        
    
        
        A novel framework categorizes blockchain scalability across architecture, data, and protocols, guiding development for truly decentralized, efficient systems.
        
        Mechanism Design Enhances Blockchain Consensus Truthfulness and Scalability
        
        
        
        
          
        
        
      
        
    
        
        This research introduces novel mechanism design principles to fortify blockchain consensus, ensuring truthful block proposals and mitigating fork-related coordination failures.
        
        Foundational Principles Underpin Robust Blockchain Security Architectures
        
        
        
        
          
        
        
      
        
    
        
        This research synthesizes cryptographic, consensus, and decentralization principles, revealing their synergistic role in securing distributed ledger technologies and mitigating cyber threats.
        
        Decentralized Consensus Elevates Malware Detection beyond Centralized Trust
        
        
        
        
          
        
        
      
        
    
        
        A novel two-tier blockchain architecture integrates diverse detection engines with Byzantine fault tolerance, creating a self-evolving, collaborative cybersecurity mesh.
        
        Picsou: Cross-Cluster Consistent Broadcast Revolutionizes Replicated State Machine Communication
        
        
        
        
          
        
        
      
        
    
        
        Picsou introduces Cross-Cluster Consistent Broadcast, a new primitive enabling efficient, robust communication across replicated state machines, enhancing distributed system reliability.
        
        Weakly-Terminating Binary Agreement Simplifies Atomic Broadcast for Robust Distributed Systems
        
        
        
        
          
        
        
      
        
    
        
        Weakly-terminating Binary Agreement simplifies Atomic Broadcast, enabling more efficient, resilient protocols for decentralized systems.
        
        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.
        
        Verifiable One-Time Programs Enable Quantum-Assisted Secure Computation
        
        
        
        
          
        
        
      
        
    
        
        This research introduces verifiable one-time programs, unlocking secure, single-round quantum-assisted computation for critical blockchain and internet applications.
        
        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.
        
        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.
        
        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.
        
        Decentralized Randomness Beacons Enhance Blockchain Security and Fairness
        
        
        
        
          
        
        
      
        
    
        
        This work introduces an efficient distributed randomness beacon using threshold cryptography, enabling verifiable, unbiased randomness for decentralized systems.
        
        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.
        
        Formalizing Proof-of-Stake Security Limits under Dynamic Availability and Reconfiguration
        
        
        
        
          
        
        
      
        
    
        
        This research formalizes the Dynamic Availability and Reconfiguration (DAR) model, proving the minimum security assumptions required for scalable, decentralized Proof-of-Stake consensus.
        
        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.
        
        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.
        
        Adaptive Byzantine Agreement Achieves Optimal Fault-Parameterized Communication
        
        
        
        
          
        
        
      
        
    
        
        Foundational consensus theory bypasses the quadratic communication lower bound, proving scalability can be proportional to actual network faults.
        
        Adaptive Byzantine Agreement Achieves Optimal Communication Based on Actual Faults
        
        
        
        
          
        
        
      
        
    
        
        Adaptive Byzantine Agreement minimizes consensus overhead by scaling communication complexity to the actual number of network faults, not the theoretical maximum.
        
        Mechanism Design Guarantees Truthful Consensus in Proof-of-Stake Systems
        
        
        
        
          
        
        
      
        
    
        
        Revelation mechanisms, triggered by disputes, enforce a unique game-theoretic equilibrium where validators must propose truthful blocks, enhancing scalability.
