Blockchain Public Random Number Generation via Trusted Node Encryption
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing blockchain systems rely on resource-intensive Proof of Work (PoW) mechanisms for random number generation, which are inefficient and lack a mature method for generating unbiased random numbers using random oracle machines.
Innovation Solution
A public random number generation method based on blockchain, where a node group of trusted nodes generates and encrypts sub-random numbers, which are decrypted at a later time to produce a final public random number, ensuring security and reducing computational waste.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If Proof of Work (PoW) mechanism is used for random number generation, then security and decentralization are improved, but computing resource waste increases
Solution Approach 1:
The patent extracts the random number generation function from the PoW consensus mechanism. Instead of using PoW's computationally intensive hash calculations to generate random numbers, the system separates this function and implements it through a dedicated random number generation mechanism that uses blockchain's inherent properties (timestamp, block hash, nonces) without requiring the energy-intensive PoW process.
Solution Approach 2:
The patent creates a system where multiple nodes in the distributed network can independently generate and verify random numbers with equal validity. The random number generation is made equipotential across the network by using cryptographic proofs that any node can verify, eliminating the need for energy-intensive competitive mining while maintaining security and decentralization.
2Productivity
If centralized institutions are used for random number generation, then generation efficiency is improved, but trust and transparency deteriorate
Solution Approach 1:
The patent implements a self-service mechanism where the blockchain network itself generates and verifies random numbers without requiring external centralized authorities. The system uses its own inherent data (block headers, timestamps, nonces) and cryptographic functions to autonomously produce cryptographically secure random numbers that all nodes can independently verify, achieving both efficiency and trust.
Solution Approach 2:
The patent introduces cryptographic proofs and verification mechanisms as intermediaries between the random number generation process and the network nodes. These cryptographic intermediaries enable efficient verification of random number validity without requiring trusted centralized authorities, as the cryptographic proofs serve as self-evident verification that all nodes can independently check.
3Adaptability or versatility
If PoW algorithm is used, then decentralization is improved, but computing resource consumption increases
Solution Approach 1:
The patent performs preliminary actions by pre-generating random numbers at specific blockchain blocks (e.g., every 10th or 100th block) and storing them in the blockchain structure. This preliminary generation allows subsequent random number requests to be fulfilled efficiently by retrieving and verifying these pre-generated values, avoiding repeated energy-intensive generation processes while maintaining decentralization through cryptographic verification.
Data Source
AI summary
Disclosed is a public random number generation method based on a blockchain, including: selecting a node group G containing N trusted nodes; determining a first time point tm and a second time point tn respectively for generating an m-th/n-th block, wherein the former is earlier, and the m-th block is fixed and cannot be tampered at tn; at the first time point tm, enabling each of the N trusted nodes to separately generate a sub-random number rj as a component forming a random number X, wherein j=1, 2, . . . , N, on which delayed encryption is performed, with corresponding results placed in the m-th block; and at the second time point tn, decrypting the delayed encryption results to obtain decrypted data of them all that are all of sub-random number rj, on which operation is performed to obtain the random number X as a final available public random number.