Oracle-Based Verifiable Randomness for Smart Contract Fairness
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In decentralized systems like blockchain networks, existing methods for generating randomness are vulnerable to manipulation by untrusted participants, leading to biased outcomes that can result in financial losses for smart contracts, and existing solutions lack verifiability and trustworthiness.
Innovation Solution
Implementing a verifiable randomness function using an oracle with a private/public key pair, where the private key is maintained off-chain and the public key is published, generating random values based on a seed and providing a cryptographic proof to ensure the randomness is verifiable and secure, leveraging cryptographic techniques like Verifiable Random Function (VRF) and CHAINLINK™ threshold signatures.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If off-chain randomness solutions are used, then the randomness can be generated outside the blockchain, but the verifiability and trustworthiness are compromised due to lack of cryptographic proof
Solution Approach 1:
The patent introduces an intermediary cryptographic proof mechanism (VRF proof) that mediates between off-chain randomness generation and on-chain verification. The proof structure allows the randomness to be generated off-chain while providing cryptographic verification on-chain, resolving the contradiction between flexibility and verifiability.
Solution Approach 2:
The patent replaces trust-based mechanical systems with cryptographic verification mechanisms. Instead of relying on trusted off-chain providers, the system uses cryptographic proofs (VRF outputs) that can be verified on the blockchain, substituting trust with mathematical verification.
2Ease of manufacture
If blockhash is used for randomness, then the method is simple and on-chain, but the randomness can be manipulated by miners for their own benefit
Solution Approach 1:
The patent introduces a cryptographic intermediary (VRF mechanism with public/private key pairs) that mediates between the simplicity of on-chain blockhash access and the need for miner-neutral randomness. The VRF proof serves as an intermediary that prevents miner manipulation while maintaining on-chain verifiability.
Solution Approach 2:
The patent changes the fundamental parameter of randomness generation from blockhash (which miners can control) to VRF output based on cryptographic keys and external entropy sources. This parameter change maintains simplicity while eliminating miner manipulation capability.
3Reliability
If centralized random number generation is used, then the randomness can be generated reliably, but the decentralized nature of the system is compromised and trust in centralized authority is required
Solution Approach 1:
The patent segments the randomness generation function into separate components: cryptographic key generation (decentralized), randomness generation (can be centralized or distributed), and verification (decentralized on-chain). This segmentation allows the system to maintain decentralization while achieving reliability through cryptographic verification.
Solution Approach 2:
The patent replaces centralized authority with cryptographic verification mechanisms. Instead of trusting a centralized random number generator, the system uses public-key cryptography and on-chain verification to replace centralized trust with decentralized mathematical proof.
Data Source
AI summary
A system and method for providing a randomness function to a smart contact on a decentralized network. An oracle receives a request for at least one random value to be supplied to a smart contract executing on a decentralized network, the request including a seed. The oracle generates the at least one random value based on the seed, and a secret key associated with the oracle, wherein the oracle is identified on the decentralized network by a public key associated with the secret key. The oracle generates a cryptographic proof based on the at least one random value and the public key and sends the at least one random value and the cryptographic proof to the decentralized network, whereby the proof, and thus the randomness of the at least one random value, can be verified.