Abstract
Consensus algorithms play a crucial role in facilitating decision-making among a group of entities. In certain scenarios, some entities may attempt to hinder the consensus process, necessitating the use of Byzantine fault-tolerant consensus algorithms. Conversely, in scenarios where entities trust each other, more efficient crash fault-tolerant consensus algorithms can be employed. This study proposes an efficient consensus algorithm for an intermediate scenario that is both frequent and underexplored, involving a combination of non-trusting entities and a trusted entity. In particular, this study introduces a novel mining algorithm, based on chameleon hash functions, for the Nakamoto consensus. The resulting algorithm enables the trusted entity to generate tens of thousands blocks per second even on devices with low energy consumption, like personal laptops. This algorithm holds promise for use in centralized systems that require temporary decentralization, such as the creation of central bank digital currencies where service availability is of utmost importance.
Reference61 articles.
1. Secure large-scale e-voting system based on blockchain contract using a hybrid consensus model combined with sharding;Abuidris;ETRI Journal,2021
2. Web 3.0: the decentralized web blockchain networks and protocol innovation;Alabdulwahhab,2018
3. Buterin’s scalability trilemma viewed through a state-change-based classification for common consensus algorithms;Altarawneh,2020
4. State machine replication is more expensive than consensus;Antoniadis,2018
5. Fairness in ambulance routing for post disaster management;Aringhieri;Central European Journal of Operations Research,2022