Verifiable randomness and gaming Some blockchain applications need outcomes that users cannot easily predict or manipulate, such as randomized game items or fair allocation processes.
A verifiable random function (VRF) can produce an output alongside cryptographic proof that the output was generated according to a defined process. A verifier can check the proof using the corresponding public key. This makes the randomness result auditable rather than asking users to trust an unexplained number.
However, a proof does not make the whole application fair by itself. Poor contract design can create loopholes if an operator can cancel an unfavorable result, repeatedly request outcomes, delay settlement, or choose which result to publish.
A robust design defines who can request randomness, how each request is linked to an outcome, and how failures or delays are handled.
Cryptography can verify the output under a scheme; application logic determines how the output is used.
@justinsuntron #TRONEcoStar #TRON
A verifiable random function (VRF) can produce an output alongside cryptographic proof that the output was generated according to a defined process. A verifier can check the proof using the corresponding public key. This makes the randomness result auditable rather than asking users to trust an unexplained number.
However, a proof does not make the whole application fair by itself. Poor contract design can create loopholes if an operator can cancel an unfavorable result, repeatedly request outcomes, delay settlement, or choose which result to publish.
A robust design defines who can request randomness, how each request is linked to an outcome, and how failures or delays are handled.
Cryptography can verify the output under a scheme; application logic determines how the output is used.
@justinsuntron #TRONEcoStar #TRON