Boolean Byzantine Fault Tolerant Algorithm for Light Weight IoT Consensus

Abstract Nowadays consensus algorithms are the backbone of fault tolerant systems, communication protocols, and distributed blockchain services though it is initiated to ensure reliable service in the presence of Byzantine faults of a distributed infrastructure. Real time automation system is highly depended on the reliability of IoT devices which are lightweight resource constrained components that demands a computationally faster algorithm within minimum number of steps. This research proposed a Boolean Byzantine Fault Tolerant (BBFT) algorithm that completes a consensus process by 3 steps only. It makes consensus by bitwise logical operations where all nodes get same decision after steps 3. It is proposed for static and predefined nodes of an agreement system that can detect malicious and anomaly nodes at the earlier stage than existing Byzantine Fault Tolerant (BFT) algorithms. BBFT is designed for resource constrained (limited memory and processing power) IoT devices where limited number of similar nodes can make an agreement. Boolean operations of the algorithm make it simple, easier for mathematical modeling, and suitable to express by vector notations of quantum computing applications. Though time complexity (O(n) = n2) of the BBFT is same as other classical BFT algorithms, it saves resources and reduces information processing delay due to the implementation of Boolean operations.