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.
Optimal Prover Time Unlocks Scalable Zero-Knowledge Verifiable Computation
A new zero-knowledge argument system achieves optimal linear prover time, fundamentally eliminating the computational bottleneck for verifiable execution of large programs.
Graded Dispersal Simplifies BFT Protocols Reducing Complexity and Communication Overhead
Foundational BFT protocols are simplified through Graded Dispersal, a new primitive that cuts communication complexity by 40% and reduces consensus rounds.
Zero-Knowledge State Accumulators Democratize Validator Participation and Finality
Introducing Zero-Knowledge State Accumulators, a primitive that compresses blockchain state into a succinct proof, radically lowering validator costs and securing decentralization.
Redactable Blockchains Use Chameleon Hashing to Control Data Immutability
Chameleon hashing with a trapdoor key enables controlled data modification on immutable ledgers, resolving the conflict between data compliance and chain integrity.
Lattice SNARKs Achieve Quasi-Optimal Efficiency via Novel Vanishing Polynomial Commitment
A new lattice-based commitment scheme enables the first quasi-optimal, quantum-resistant SNARKs, making secure, scalable verifiable computation practical.
Collaborative Zero-Knowledge Proofs Secure Distributed Secrets Efficiently
This research introduces Collaborative zk-SNARKs, a cryptographic primitive allowing distributed parties to prove a statement about their collective secret data without centralization, achieving near-single-prover efficiency.
Equifficient Polynomial Commitments Enable Faster, Smaller zk-SNARKs
Research introduces Equifficient Polynomial Commitments, a new primitive that yields Pari, the smallest SNARK at 160 bytes, and Garuda, a prover three times faster than Groth16.
Universal Vector Commitments Enable Efficient Proofs of Non-Membership and Data Integrity
Introducing Universal Vector Commitments, a new primitive that securely proves element non-membership, fundamentally enhancing stateless client and ZK-rollup data verification.
