Hierarchical Cellular Automata Consensus Blockchain

Abstract

Blockchain technology is foundational for decentralized systems, yet current implementations face critical limitations in scalability and communication efficiency, especially within consensus mechanisms like Practical Byzantine Fault Tolerance (PBFT). This paper proposes the Hierarchical Cellular Automata Consensus Mechanism (HCACM), a novel solution leveraging a hierarchical arrangement of cellular automata rings employing Wolfram's Rule 184 and Rule 232. Rule 184 efficiently propagates consensus states across the network, while Rule 232 stabilizes local consensus. HCACM significantly reduces communication overhead by facilitating deterministic consensus through localized interactions, enhancing network scalability and fault tolerance. Simulation results validate that HCACM outperforms traditional consensus algorithms in scalability, communication efficiency, and fault isolation, establishing it as an effective framework for decentralized applications requiring high transaction. © 2025 IEEE.