Sublinear Zero-Knowledge Proofs Unlock Ubiquitous Private Computation
A new proof system eliminates ZKP memory bottlenecks by achieving square-root scaling, enabling verifiable computation on all devices.
Zero-Knowledge Proof of Training Secures Decentralized Federated Learning Consensus
ZKPoT uses zk-SNARKs to verify decentralized model accuracy without revealing private data, solving the efficiency-privacy trade-off in federated learning.
Sublinear Memory ZKPs Democratize Verifiable Computation and Privacy
A new proof system reduces ZKP memory from linear to square-root complexity, unlocking verifiable computation on resource-constrained edge devices.
Sublinear Memory ZK Proofs Democratize Verifiable Computation
A new space-efficient tree algorithm reduces ZK proof memory complexity from linear to square-root, enabling verifiable computation on all devices.
Sublinear Space ZK Proofs Democratize Verifiable Computation at Scale
A new streaming prover reduces ZKP memory from linear to square-root scaling, enabling verifiable computation on resource-constrained edge devices.
Sublinear Memory Zero-Knowledge Proofs Democratize Verifiable Computation
Introducing the first ZKP system with memory scaling to the square-root of computation size, this breakthrough enables privacy-preserving verification on edge devices.
Epidemic Consensus for Scalable, Decentralized Blockchain Networks
This research introduces a novel, leaderless epidemic consensus protocol that significantly enhances throughput and latency for large-scale decentralized blockchain systems.
Decentralized Randomness Beacons Enhance Blockchain Security and Fairness
This work introduces an efficient distributed randomness beacon using threshold cryptography, enabling verifiable, unbiased randomness for decentralized systems.
Uncertified DAGs Achieve Optimal Latency in Byzantine Consensus
A novel commit rule for uncertified Directed Acyclic Graphs revolutionizes consensus, ensuring immediate transaction finality and optimal latency in distributed systems.
