# kaal:claim:5225296-017

**Claim.** Verifiable random functions supply publicly verifiable proof of randomness bound to a validator's private key, preserving selection fairness even when adversaries control up to a third of the network.

**Type.** mechanism  **Support.** evidenced

**Holds when.**

- up to 33 percent adversarial control

**Source quote.**

> VRFs, as utilized in Algorand, provide publicly verifiable proof of randomness tied to a validator's private key, ensuring fairness even under 33% adversarial control

**From.** Wulf A. Kaal, *Cryptographic Foundations and Interdisciplinary Dimensions of the Secure Proof of Stake (SPoS) Conse* (2025), Randomness in Block Producer Selection

**Cite as.** Wulf A. Kaal, Cryptographic Foundations and Interdisciplinary Dimensions of the Secure Proof of Stake (SPoS) Conse (2025). SSRN: https://ssrn.com/abstract=5225296

**Verify.** sha256 of source PDF `b2fec675d906334ad67e13b2d97261dc31e38061022867eb3f9ceadd95f4878d` at https://raw.githubusercontent.com/wulfkaal/Academic-Papers/main/papers/pdf/Kaal%20-%202025%20-%20Cryptographic%20Foundations%20and%20Interdisciplinary%20Dimensions%20of%20the%20Secure%20Proof%20of%20Stake%20%28SPoS%29%20Conse.pdf

**Topics.** institutional-design

**Keywords.** verifiable-random-functions, algorand, adversarial-threshold, selection-fairness

**Canonical form.** This markdown file is the canonical hashed representation of the claim. Its sha256 is the content hash used for attestation.