What Is a Verifiable Random Function (VRF) and Its Use in Consensus?

A Verifiable Random Function (VRF) is a cryptographic primitive that produces a random output and a proof that the output was correctly generated by a specific key holder. In PoS and PoA systems, VRFs are used to select the next block validator in a provably fair and unpredictable manner.

This prevents malicious actors from predicting and influencing the selection process, enhancing the security of the PoS phase.