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.
Democratic Randomness Protocol Eliminates Leader Bottlenecks for Scalability
Kleroterion, a democratic random beacon using Pinakion PVSS, achieves linear complexity by distributing input sharing, enabling scalable, bias-resistant randomness.
Weighted Verifiable Random Functions Scale Proof-of-Stake Randomness
Cryptographers introduce Weighted VRFs to provide cost-independent, autonomous, and fresh on-chain randomness for weighted Proof-of-Stake systems, solving a critical scalability bottleneck.
Constant-Time Publicly Verifiable Secret Sharing Unlocks Scalable Blockchain Primitives
This framework transforms Publicly Verifiable Secret Sharing from $O(n)$ to $O(1)$ complexity by leveraging CCA2-Secure Threshold Encryption and NIZK proofs, eliminating a critical scalability bottleneck.
Game-Theoretic Incentives Guarantee Provably Uniform Decentralized Randomness
A new Randomness Incentive Game (RIG) establishes a Nash Equilibrium where participants are compelled to submit provably uniform inputs, securing all decentralized randomness protocols.
PVSS-BFT Achieves Secure, Low-Latency Consensus with Dynamic Node Participation
Integrating PVSS and pre-commits into BFT slashes latency to $4Delta$ while securing consensus against up to 50% Byzantine nodes.
