Weighted Verifiable Random Function

Definition ∞ A Weighted Verifiable Random Function (VRF) is a cryptographic primitive that generates a random output whose distribution is influenced by a participant’s assigned weight, typically their stake in a system. The output is publicly verifiable, ensuring that the randomness was generated correctly and without manipulation. This function is used in decentralized protocols for fair leader election or committee selection, preventing malicious actors from predicting or influencing outcomes. It ensures verifiable and biased randomness.
Context ∞ Weighted Verifiable Random Functions are essential for the security and fairness of many Proof of Stake and sharding protocols, where unbiased and verifiable randomness is critical for operational integrity. Ongoing research focuses on optimizing these functions for greater efficiency and robustness against various attack vectors. News related to protocol upgrades often highlights the implementation or improvements of VRFs, as they directly impact the decentralization and security of the network.