Proof-of-randomness protocol for blockchain consensus: a case of Macau algorithms
Wen-Zhuo Zhang, Victor Kai

TL;DR
This paper introduces a novel proof-of-randomness protocol for blockchain consensus that leverages true random number generators, offering a fair, low-energy alternative to traditional proof mechanisms, and explores integration with quantum technologies.
Contribution
It proposes a new consensus mechanism called Macau based on randomized algorithms, utilizing true random numbers, and discusses quantum integration for enhanced security.
Findings
The PoR protocol enables blockchain creation without computational competition.
It offers a low energy-cost alternative to proof-of-work and proof-of-stake.
Quantum random number generators can enhance security in blockchain hardware.
Abstract
A proof-of-randomness (PoR) protocol is presented as a fair and low energy-cost consensus mechanism for blockchains. Each network node of a blockchain may use a true random number generator (TRNG) and hash algorism to fulfil the PoR protocol. In this paper, we give the consensus mechanism of the PoR protocol, and classify it into a new kind of randomized algorithms called Macau. The PoR protocol could generate a blockchain without any competition of computing power or stake of cryptocurrency. Besides, we give some advantages of integrating quantum random number generator (QRNG) chips into hardware wallets, and also discuss the way to cooperate with quantum key distribution (QKD) technology.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Cryptography and Data Security · Blockchain Technology Applications and Security
