Zero-Knowledge DKG Enables Cost-Effective Dynamic Threshold Cryptography
Integrating zk-SNARKs into Distributed Key Generation offloads costly on-chain computation, unlocking scalable, dynamic threshold cryptosystems for decentralized applications.
Zero-Knowledge Proof of Training Secures Decentralized Federated AI Consensus
ZKPoT leverages zk-SNARKs to prove AI model quality without revealing private data, solving the privacy-utility trade-off in decentralized learning.
Recursive SNARKs Enable Constant-Size Proofs for Verifiable AI Inference
This framework uses recursive zero-knowledge proofs to achieve constant-size verification for large AI models, securing transparent, private computation.
Sublinear Memory Zero-Knowledge Proofs Democratize Verifiable Computation Access
A space-efficient tree algorithm reduces ZKP prover memory from linear to square-root complexity, enabling verifiable computation on mobile and edge devices.
Proof-of-Work Protocol Achieves Constant-Time Settlement and Fast Fairness
This new Proof-of-Work protocol solves permissionless State Machine Replication, guaranteeing constant-time settlement and fair transaction access against Byzantine adversaries.
Decoupling Fair Ordering from Consensus Boosts BFT Performance and Security
The new SpeedyFair protocol totally decouples transaction ordering from BFT consensus, achieving higher performance and eliminating MEV-driven front-running.
Sublinear Memory Proofs Democratize Zero-Knowledge Computation on Resource-Constrained Devices
New sublinear memory ZK proofs reduce prover space from linear to square-root, enabling verifiable computation on all mobile devices.
Mercury MLPCS Achieves Constant Proof Size and Linear Prover Time
Mercury, a new pairing-based multilinear polynomial commitment scheme, fundamentally resolves the proof size versus prover time trade-off for scalable verifiable computation.
Optimal Latency Consensus Protocol Achieves Accountable Liveness and Censorship-Freedom
Pod introduces a generalized consensus layer with provable liveness accountability, establishing a new theoretical benchmark for optimal BFT latency and censorship resistance.
