Weighted VRFs Achieve Scalable Distributed On-Chain Randomness
A new cryptographic primitive, the Weighted Verifiable Unpredictable Function, ensures that validator computation costs remain constant regardless of stake, solving the scalability bottleneck for on-chain randomness in PoS systems.
Homomorphic Encryption and VRF Achieve Scalable Unpredictable On-Chain Randomness
Homomorphic encryption combined with VRFs constructs a linear-scaling distributed randomness beacon, eliminating pre-computation bias in consensus leader selection.
Democratic Random Beacons Eliminate Leader Bottlenecks for Scalable Randomness
Kleroterion, a democratic randomness beacon, achieves linear computation and leaderless input sharing, decoupling beacon performance from network size.
