
Briefing
This research addresses the inherent energy inefficiency of Proof-of-Work and the fairness concerns of Proof-of-Stake by introducing the Proof-of-Randomness (PoR) consensus protocol. PoR leverages true random number generators to establish a physically fair and low energy-cost mechanism for blockchain block generation. The paper further proposes “Macau algorithms” as a new classification for randomized algorithms where the output is not predetermined by a fixed target, fundamentally reshaping the theoretical understanding of consensus and offering a pathway to more sustainable and equitable blockchain architectures.

Context
Prior to this research, the blockchain community grappled with the scalability trilemma, often manifesting as a trade-off between security, decentralization, and efficiency. Prevailing consensus mechanisms like Proof-of-Work (PoW) demanded exorbitant computational power, leading to massive energy consumption, while Proof-of-Stake (PoS) faced scrutiny regarding its fairness and potential for centralization. A foundational theoretical limitation also existed in the classification of randomized algorithms, which inadequately described protocols where the outcome is derived from collective random inputs without a predetermined target.

Analysis
The core mechanism of Proof-of-Randomness (PoR) involves network nodes utilizing True Random Number Generators (TRNGs), ideally Quantum Random Number Generators (QRNGs), to produce unique random inputs. Each node hashes its random number and broadcasts it. In smaller networks, a block owner is selected based on the collective sum of these hashes, while in larger networks, a more intricate process involving individual hashes and timestamps mitigates potential attacks from powerful random number generators. This method fundamentally differs from previous approaches by grounding fairness in the physical unpredictability of true random numbers, thereby drastically reducing energy consumption.
Conceptually, PoR is classified as a “Macau algorithm,” a newly defined category of randomized algorithms. Unlike Monte Carlo algorithms, which aim for a predetermined target with high probability, or Las Vegas algorithms, which guarantee a predetermined target with unlimited attempts, Macau algorithms use limited random inputs to achieve an output that is not predetermined, representing a significant theoretical expansion in the field of randomized computation.

Parameters
- Core Consensus Protocol ∞ Proof-of-Randomness (PoR)
- New Algorithm Classification ∞ Macau Algorithms
- Key Authors ∞ Wen-Zhuo Zhang, Victor Kai
- Randomness Source ∞ True Random Number Generators (TRNGs), Quantum Random Number Generators (QRNGs)
- Publication Date ∞ 2023-12-08
- Source Type ∞ Academic Whitepaper (arXiv)

Outlook
This research opens several forward-looking avenues. The PoR protocol offers a blueprint for highly scalable, energy-efficient, and physically fair blockchain networks, potentially unlocking new applications requiring high transaction throughput and minimal environmental impact. The integration of QRNGs and cooperation with Quantum Key Distribution (QKD) positions PoR as a robust, quantum-resistant solution, addressing a critical future vulnerability for all cryptographic systems. Furthermore, the introduction of Macau algorithms provides a new theoretical framework for designing and analyzing randomized protocols, stimulating academic inquiry into novel computational paradigms beyond traditional classifications.
Signal Acquired from ∞ arxiv.org