Linear-Complexity Secret Sharing Unlocks Scalable Decentralized Randomness Beacons
A novel Publicly Verifiable Secret Sharing scheme reduces complexity to $O(n)$, enabling highly scalable, unbiasable randomness for large-scale consensus.
