kaal:claim:5225296-017

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.

Source quote, verbatim

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
https://ssrn.com/abstract=5225296 · source PDF

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

Holds when

up to 33 percent adversarial control

Classification

mechanismsupport: evidencedinstitutional-design

Verify

The quote above is an exact substring of the source PDF, whose sha256 is b2fec675d906334ad67e13b2d97261dc31e38061022867eb3f9ceadd95f4878d. Extraction method: pdf-text-layer.
Attestation record: colloquium/attestations/25e36ea13b65e043...json
Verify the binding yourself: curl -s https://wulfkaal.github.io/claims/5225296-017.md | sha256sum