Consensus algorithms that function in permissionless blockchain systems must randomly select new block proposers in a decentralised environment. Our contribution is a new blockchain consensus algorithm called Proof-of-Publicly Verifiable Randomness (PoPVR). It may be used in blockchain design to make permissionless blockchain systems function as pseudo-random number generators and to use the results for decentralised consensus. The method employs verifiable random functions to embed pseudo-random number seeds in the blockchain that are confidential, tamper-resistant, unpredictable, collision-resistant, and publicly verifiable. PoPVR does not require large-scale computation, as is the case with Proof-of-Work and is not vulnerable to the exclusion of less wealthy stakeholders from the consensus process inherent in stakebased alternatives. It aims to promote fairness of participation in the consensus process by all participants and functions transparently using only open-source algorithms. PoPVR may also be useful in blockchain systems where asset values cannot be directly compared, for example, logistical systems, intellectual property records and the direct trading of commodities and services. PoPVR scales well with complexity linear in the number of transactions per block.INDEX TERMS Consensus algorithm, decentralised consensus, permissionless blockchain systems, proofbased consensus algorithms, proof-of-publicly verifiable randomness, pseudo-random number generation, random number seeds, verifiable random functions, vote-based consensus algorithms. JACQUES M. MARITZ received the master's degree and the Ph.D. degree in astrophysics from the University of the Free State, South Africa, in 2017.He has been a Lecturer in engineering sciences with the University of the Free State, since 2017. His research interests include physics, astrophysics, energy modeling, energy analytics, energy AI, and power systems.