Sublinear Vector Commitments Achieve Asymptotically Optimal Stateless Blockchain Client Updates
This new vector commitment scheme fundamentally solves the linear-scaling problem for stateless clients by achieving proven sublinear complexity for state updates.
Zero-Knowledge Proof of Training Secures Private Federated Consensus
A novel Zero-Knowledge Proof of Training (ZKPoT) mechanism leverages zk-SNARKs to validate machine learning contributions privately, enabling a scalable, decentralized AI framework.
Horizontally Scalable zkSNARKs via Proof Aggregation Framework
This framework achieves horizontal zkSNARK scalability by distributing large computations for parallel proving, then aggregating results into a single succinct proof.
Optimizing ZK-SNARKs by Minimizing Expensive Cryptographic Group Elements
Polymath redesigns zk-SNARKs by shifting proof composition from $mathbb{G}_2$ to $mathbb{G}_1$ elements, significantly reducing practical proof size and on-chain cost.
zk-SNARKs Enable Trustless Universal Cross-Chain State Verification
The Zendoo protocol uses recursive zk-SNARKs to generate succinct, constant-size proofs of sidechain state, fundamentally securing decentralized interoperability.
Zero-Knowledge Proof of Training Secures Private Decentralized AI Consensus
ZKPoT, a novel zk-SNARK-based consensus, cryptographically validates decentralized AI model contributions, eliminating privacy risks and scaling efficiency.
Lattice-Based Zero-Knowledge Signatures Eliminate Cryptographic Trapdoors
A new post-quantum signature framework converts non-trapdoor zero-knowledge proofs into digital signatures, fundamentally enhancing long-term security assurances.
Optimal Prover Complexity Unlocks Linear-Time Zero-Knowledge Proof Generation
This breakthrough achieves optimal $O(N)$ prover time for SNARKs, fundamentally solving the quasi-linear bottleneck and enabling practical, scalable verifiable computation.
Cryptanalysis Exposes Verifiable Delay Function Flaws Threatening Consensus Security
Cryptographers proved a Verifiable Delay Function's fixed sequential time can be bypassed, challenging its use for secure, fair randomness in Proof-of-Stake.
