Silently Verifiable Proofs Enable Constant-Cost Batch Verification for Secret Data
Silently Verifiable Proofs revolutionize decentralized computation by allowing constant-size batch verification over secret-shared data, dramatically reducing network communication overhead.
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.
Linear Prover Time Unlocks Practical Zero-Knowledge Proof Scalability
A new ZKP argument system achieves optimal linear prover time, dramatically lowering the cost barrier for large-scale verifiable computation.
Evolving Nullifiers and Oblivious Synchronization Achieve Scalable Private Payments
The new Oblivious Synchronization model enables validators to prune the linearly growing nullifier set, resolving the core scaling bottleneck for private transaction protocols.
Constant-Size Zero-Knowledge Proofs for Scalable IoT Set Membership Verification
This new OR-aggregation technique yields constant-size zero-knowledge proofs, fundamentally unlocking scalable, privacy-preserving data integrity for IoT networks.
Zero-Knowledge Bag Unlocks Constant-Time Verifiable General Computation
Introducing the Zero-Knowledge Bag, a new cryptographic primitive enabling constant computational and communication complexity for zkVM execution.
Decentralized Private Computation Unlocks Programmable Privacy and Verifiability
Research introduces Decentralized Private Computation, a ZKP-based record model that shifts confidential execution off-chain, enabling verifiable, private smart contracts.
