Decoupled Time-Lock Commitments Enforce Fair Transaction Ordering
Introducing Decoupled Time-Lock Commitments, a new primitive that uses VDFs to cryptographically enforce a future transaction reveal, fundamentally eliminating proposer-side MEV.
Express Consensus Algorithm Accelerates Proof-of-Authority Blockchains via Compact Block Protocol
ExClique fundamentally enhances Proof-of-Authority throughput by compacting block data and eliminating consensus-disrupting no-turn blocks.
Proof-of-Social-Capital Replaces Financial Stake for Decentralized Consensus
A new consensus protocol replaces financial stake with social capital, leveraging zk-proofs to democratize block production and mitigate wealth-based centralization.
Zero-Knowledge Proofs Achieve Sublinear Memory Scaling for Ubiquitous Verification
Research introduces the first sublinear memory ZKP system, reducing prover memory from linear to square-root complexity, enabling verifiable computation on mobile devices.
Zero-Knowledge Virtual Machines Enable Universal Verifiable Computation
ZK-VMs decouple computation from cryptographic proof generation, creating a universal compiler for verifiable execution that drastically scales layer two throughput.
Zkspeed Hardware Dramatically Accelerates HyperPlonk Proving for Ubiquitous Verifiable Computation
A dedicated hardware accelerator for HyperPlonk achieves $801times$ speedup, fundamentally resolving the ZKP prover time bottleneck for scalable decentralized systems.
Formal Synthesis Proves Secure Distributed Cryptographic Applications
A new compiler security proof automatically translates simple programs into robust, distributed cryptographic systems, shifting security burden to formal verification.
Decoupled Execution Separates Consensus from Verifiable State Commitment
Decoupled Execution separates probabilistic ordering from deterministic state execution, allowing independent scaling of throughput and storage capacity.
Folding Schemes Enable Linear-Time Recursive Zero-Knowledge Computation
Nova's folding scheme fundamentally solves recursive proof composition by accumulating instances instead of verifying SNARKs, unlocking infinite verifiable computation.