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.
Verifiable Functional Encryption Enables Constant-Cost Decentralized Computation Scaling
A new Verifiable Threshold Functional Encryption primitive achieves constant-size partial decryption, fundamentally solving the linear communication cost bottleneck for large-scale private computation.
