Proof of Download and Luck Secures Decentralized ZK-Rollup Data Availability
New Proof of Download and Proof of Luck primitives enforce Layer 2 data availability and decentralization, mitigating centralization and MEV risks.
Accountable Sharding Secures State with Proactive Key Rotation and Global Economic Deterrents
A new sharding model leverages proactive secret sharing and global slashing to eliminate the $1/N$ security vulnerability, enabling scalable and robust decentralized architectures.
Optimal Polynomial Commitment Batching Unlocks Scalable Decentralized Cryptography
New KZG batching algorithm achieves optimal $O(N log N)$ prover time and constant proof size, dramatically accelerating Verifiable Secret Sharing.
Linear Prover Time Unlocks Universal Scalable Zero-Knowledge Proofs
The Orion argument system achieves optimal linear prover time and polylogarithmic proof size, eliminating the primary bottleneck for universal ZKP adoption.
Decentralized Clock Network Enforces Fair Transaction Ordering Using Timestamps
This work introduces a Decentralized Clock Network that separates transaction ordering from consensus, using timestamp agreement to enforce $delta$-Median Fairness and mitigate front-running.
Weighted VRFs Achieve Constant Communication for Stake-Weighted Randomness
A new weighted VRF primitive and DKG protocol decouple randomness generation from stake size, solving the efficiency problem for PoS security.
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.
Selective Batched IBE Enables Constant-Cost Threshold Key Issuance
This new cryptographic primitive enables distributed authorities to generate a single, succinct decryption key for an arbitrary batch of identities at a cost independent of the batch size, fundamentally solving key management scalability in threshold systems.
Linear Prover Time ZK Proofs Unlock Universal Verifiable Computation
A new argument system achieves linear-time proof generation with succinct proof size, eliminating the primary computational bottleneck for ZK-rollups and verifiable computation.
