Recursive Proof Composition Achieves Logarithmic-Time Zero-Knowledge Verification
A novel folding scheme reduces the verification of long computations to a logarithmic function, fundamentally decoupling security from computational scale.
Goldwasser-Kalai-Rothblum Protocol Turbocharges Verifiable Computation Efficiency
A new proof system architecture uses the sumcheck protocol to commit only to inputs and outputs, achieving logarithmic verification time for layered computations, drastically scaling ZK-EVMs.
Linear-Time Zero-Knowledge Provers Unlock Universal Verifiable Computation
A linear-time ZKP prover mechanism achieves optimal computational efficiency, fundamentally enabling scalable, trustless verification for all decentralized applications.
Distributed ZK Proof Generation Unlocks Practical Rollup Scalability
Pianist, a fully distributed ZKP system, parallelizes proof generation to resolve the prover bottleneck, enabling hyper-scalable, practical ZK-Rollup architectures.
Quantum Harvest Threat Exposes Historical Ledger Privacy Failure
HNDL formalizes the quantum risk where adversaries harvest today's encrypted DLT data, rendering historical privacy impossible to guarantee.
Zero-Knowledge Authenticators Secure Private Policy on Public Blockchains
The Zero-Knowledge Authenticator (zkAt) is a new cryptographic primitive that enables users to prove transaction authenticity against complex private policies without revealing the policy logic or identity, unlocking private on-chain governance.
Collaborative VDFs Enable Multi-Party Time-Lock and Fair Decentralized Protocols
Collaborative Verifiable Delay Functions introduce a new primitive for joint, publicly verifiable time-delay, securing fair multi-party mechanism design.
Epidemic Consensus Protocol Unlocks Extreme-Scale Decentralization
A new consensus protocol leveraging epidemic-style communication eliminates fixed validators, achieving superior throughput and latency for extreme-scale networks.
Constant-Cost Threshold Decryption Secures Private Transaction Batching Efficiency
This new cryptographic primitive enables constant-cost key issuance for private transaction batches, fundamentally solving the scalability problem of encrypted mempools.
