Midnight Protocol Launches Privacy-Focused Layer One with Dual-Token Resource Model
The NIGHT/DUST resource model introduces a predictable capacity primitive for private transactions, solving the trade-off between user data control and regulatory compliance.
Zero-Knowledge STARKs Secure Scalable Trustless Decentralized Identity Revocation
Integrating zk-STARKs with cryptographic accumulators creates a post-quantum, trustless framework for verifiable identity and scalable private credential revocation.
Verifiable Functional Encryption Enables Constant-Cost Decentralized Computation Scaling
A new Verifiable Threshold Functional Encryption primitive achieves constant-size partial decryption, fundamentally solving the linear communication cost bottleneck for large-scale private computation.
Linear-Time Maliciously Secure Shuffle Advances Secret Sharing Protocols
This new protocol is the first to achieve linear end-to-end time for maliciously secure, constant-round secret-shared shuffling, enabling practical, private computation primitives.
Libra Achieves Optimal Linear Prover Time for Succinct Zero-Knowledge Proofs
Libra is the first ZKP to achieve optimal linear prover time $O(C)$ and logarithmic succinctness, fundamentally enabling verifiable computation at scale.
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.
Statement Hiders Enable Privacy Preserving Folding Schemes for Verifiable Computation
The Statement Hider primitive blinds zero-knowledge statements before folding, resolving privacy leakage during selective verification for multi-client computation.
