Cryptographic Time-Locks and Distributed Sequencing Ensure Fair Transaction Ordering
A distributed sequencing committee uses Threshold Cryptography and Verifiable Delay Functions to cryptographically decouple ordering from the consensus proposer, eliminating MEV extraction.
Blaze SNARK Achieves Linear Proving Time with Polylogarithmic Verification
Blaze introduces a coding-theoretic SNARK with $O(N)$ prover time and $O(log^2 N)$ verification, unlocking massive verifiable computation scaling.
Cryptographic Sortition Decentralizes Transaction Ordering Preventing MEV Extraction
A new Verifiable Sortition Orderer mechanism uses cryptographic randomness to break the proposer's monopoly on ordering, mitigating systemic MEV.
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.
Lattice-Based SNARGs Achieve Post-Quantum Proof Efficiency
This new Ring-QAP construction uses RLWE to significantly reduce the amortized proof size of post-quantum zk-SNARKs, enabling practical verifiable computation.
Distributed PIOP Achieves Linear Prover Time and Logarithmic Communication
HyperPianist introduces a distributed ZKP architecture that cuts prover time to linear and communication to logarithmic, enabling practical, massive-scale verifiable computation.
Recursive SNARKs Enable Constant-Size Proofs for Verifiable AI Inference
This framework uses recursive zero-knowledge proofs to achieve constant-size verification for large AI models, securing transparent, private computation.
Sublinear Memory Zero-Knowledge Proofs Democratize Verifiable Computation Access
A space-efficient tree algorithm reduces ZKP prover memory from linear to square-root complexity, enabling verifiable computation on mobile and edge devices.
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.
