Cryptographic Leader Election Achieves Constant-Time, Fork-Free Block Production
Sassafras employs Ring-VRF and zk-SNARKs for semi-anonymous leader election, ensuring near-fork-free block production with $O(1)$ overhead.
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.
Prioritized Byzantine Agreement Achieves Optimal Asynchronous Consensus Complexity
Prioritized MVBA introduces a committee selection primitive to slash communication complexity from cubic to quadratic, enabling truly scalable asynchronous consensus.
