End-to-End Minimal Disclosure Cryptography Secures Wallet Privacy and Decentralization
A new SDK for minimal disclosure cryptography and local state verification fundamentally shifts blockchain privacy from the network to the user's wallet.
Zero-Knowledge Proof of Training Secures Decentralized AI Consensus
A new Zero-Knowledge Proof of Training (ZKPoT) consensus mechanism leverages zk-SNARKs to cryptographically verify model performance, eliminating Proof-of-Stake centralization and preserving data privacy in decentralized machine learning.
Zero-Knowledge Proof of Training Secures Federated Learning Consensus
ZKPoT uses zk-SNARKs to verify model contributions privately, eliminating the trade-off between decentralized AI privacy and consensus efficiency.
Decoupled Vector Commitments Enable Dynamic Stateless Client Verification
Decoupled Vector Commitments bifurcate state and update history, achieving logarithmic proof size and constant-time verification for dynamic data.
Mechanism Design Enforces Truthful Consensus, Mitigating Disputes in Proof-of-Stake
Applying economic revelation mechanisms to PoS protocols ensures truthful block proposal as the unique equilibrium, fundamentally enhancing network robustness.
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.
Sublinear Zero-Knowledge Provers Democratize Verifiable Computation and Privacy at Scale
A new sublinear-space ZKP prover, reducing memory from linear to square-root complexity, transforms verifiable computation from a server task to an on-device primitive.
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.
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.
