Improving Election Integrity: Blockchain and Byzantine Generals Problem Theory in Vote Systems

Abstract

In the digital age, maintaining election integrity is critical, especially in Africa, where the security of electronic elections is often questioned. This study presents a blockchain-based vote counting and validation (BBVV) system developed using a mixed methods approach that combines stakeholder questionnaires to capture system specification and randomized historical election data analysis, following the Design Science Research strategy. Using the theory of the Byzantine General Problem, the BBVV protocol is proposed, which provides an accurate local count of votes at polling stations before national aggregation. The system was tested with randomized historical election data on the Algorand blockchain TestNet and confirmed that a local consensus on the vote count could be reached before it is added to the national tally on the blockchain. Our results show that in the cases where consensus was reached, this was the instance in only about 5% of the voting scenarios, with only 10% of the total vote being considered valid due to the strict consensus requirements. In addition, significant discrepancies were found between officials, with no consensus reached in 95% of cases which was due to the rogue values generated by a randomized dataset. The performance of the BBVV system was evaluated using transaction metrics, saturation, throughput, traffic, and latency to assess its efficiency, scalability, and reliability. The results suggest that blockchain technology can significantly improve the integrity of elections by ensuring a transparent, secure, and accurate vote-counting process. Future work will focus on improving the adaptability and scalability of the BBVV system for different electoral situations.