Implementation of Verifiable Random Beacons

Abstract

Random beacons provide sources of publicly available sources of randomness at predefined intervals. However, security vulnerabilities within the beacons pose problems for the beacon and its applications. The Verifiable Random Beacon protocol improves the security of random beacons, but requires implementation within the Ethereum network. In particular, the implementation protocol must accept deposits from participants, compute and publish the random output, and reward participants for their behavior. Further, the protocol requires implementation of operations in prime finite fields and elliptic curve groups specific to Ethereum. The project implemented an efficient library for prime finite fields, a library to evaluate an interpolated polynomial through Lagrange interpolation, and a contract for the Verifiable Random Beacons protocol. However, due to the computational limits imposed by the Ethereum network, the protocol implementation supports a limited number of participants and lacks an auxiliary component of the protocol.