Trustless Logarithmic Commitment Secures Verifiable Computation
This new vector-based commitment achieves logarithmic proof size and trustless setup, fundamentally accelerating ZK-proof verification and scaling.
Private Information Retrieval Secures Stateless Client Proof Verification
TreePIR enables light clients to privately retrieve Merkle proofs from full nodes, fundamentally solving the transaction privacy dilemma in state verification.
Random Asynchronous Model Overcomes Classical BFT Impossibility Results
Removing adversarial message scheduling from the asynchronous model enables probabilistic consensus guarantees previously deemed impossible, fundamentally advancing BFT theory.
zk-STARKs and Accumulators Secure Scalable Private Decentralized Identity
This framework leverages zk-STARKs for private credential disclosure and cryptographic accumulators for scalable revocation, enabling a trusted, post-quantum data economy.
Formalizing Complete Knowledge Prevents Secret Key Encumbrance and Restores Cryptographic Possession
Formalizing Complete Knowledge Prevents Secret Key Encumbrance and Restores Cryptographic Possession
New Complete Knowledge proofs prevent secret encumbrance by TEEs/MPC, ensuring unencumbered key control and securing decentralized governance.
Logical Unprovability Enables Perfectly Sound Transparent Zero-Knowledge Proofs
Leveraging Gödelian principles, this new cryptographic model achieves perfectly sound, non-interactive, transparent proofs, resolving the trusted setup dilemma.
Generic Compiler Achieves Full SNARK Succinctness and Rate-1 Optimality
A generic compiler upgrades mild SNARKs to full succinctness, proving the optimality of rate-1 arguments and defining new cryptographic limits.
Cornucopia: Insertion-Secure Accumulators Forge Scalable Distributed Randomness
Cornucopia introduces insertion-secure accumulators to efficiently aggregate contributions for VDF-based randomness, securing the foundation of decentralized systems.
Sublinear Zero-Knowledge Proofs Democratize Verifiable Computation on Edge Devices
Researchers solved the ZKP memory bottleneck, achieving square-root space complexity to enable large-scale, private computation on all devices.
