Real-Time Blockchain Consensus Algorithms for Scalable Peer-to-Peer Networks in Autonomous Systems
Annotatsiya
Research on consensus efficiency and reliability improves as blockchain technology moves towards real-time processing in scalable, peer-to-peer, autonomous systems. Previous Byzantine fault-tolerant (BFT) consensus protocols (e.g., PBFT, HotStuff) provide strong consistency but suffer from high latency and high communication complexity/network overhead. It presents a Holistic+ architecture for Real-Time Blockchain Consensus (RT-BC) that combines a directed acyclic graph (DAG) availability layer with a deadline-aware BFT ordering mechanism to increase responsiveness and scalability. Our RT-BC architecture utilizes leaderless fast-path voting, verifiable random function (VRF)-based micro-leader selection, and aggregated threshold signatures to order transactions in a decentralized, secure, and fast manner. To validate the RT-BC proposals through NS-3 network-level simulations, MATLAB visualizations of communication complexity and consensus topology, and evaluations that demonstrate the effectiveness of our design innovations. Our work demonstrates deterministic finality in the 80-150 millisecond range and throughput of 000 transactions per second. The RT-BC framework extends recent research directions and provides a technically sound option for secure, scalable, time-sensitive consensus for autonomous peer-to-peer blockchain networks.