Zero-Knowledge Proofs Extend Bitcoin Capabilities for Privacy and Succinct Verification
Applying zk-STARKs to Bitcoin enables private Proof-of-Reserves and trust-minimized light clients, fundamentally expanding the protocol's utility.
Succinct Proximity Arguments Enable Sublinear Verification of Massive Data
A new cryptographic primitive, Succinct Non-interactive Arguments of Proximity (SNAPs), allows verifiers to validate massive datasets by reading only a sublinear number of bits.
Optimal Linear Prover Complexity Revolutionizes Polynomial Commitment Schemes
New PolyFRIM polynomial commitment scheme achieves optimal linear prover complexity, accelerating verifiable computation and distributed consensus.
Linear-Time Post-Quantum SNARKs Revolutionize Verifiable Computation Efficiency
Brakedown introduces a post-quantum, linear-time SNARK by engineering a novel polynomial commitment scheme using linear codes, fundamentally accelerating verifiable computation.
Lattice-Based Commitments Achieve Post-Quantum Zero-Knowledge with Transparent Setup
A new lattice-based polynomial commitment provides post-quantum security and a transparent setup, fundamentally advancing trustless, quantum-resistant verifiable computation.
Post-Quantum Transparent zkSNARKs Achieve Succinct, Trustless, and Efficient Verifiable Computation
Phecda combines new polynomial commitment and VOLE-in-the-Head to deliver the first post-quantum, transparent, and succinct zero-knowledge proof system.
SmallWood: Hash-Based Commitments Achieve Post-Quantum Zero-Knowledge for Small Instances
SmallWood introduces a post-quantum, hash-based commitment scheme, dramatically shrinking proof sizes for common, small-scale verifiable computation.
Sublinear MPC-in-the-Head Achieves Post-Quantum Zero-Knowledge Proof Efficiency
A novel MPC-in-the-Head construction leverages linear coding to achieve post-quantum security with sublinear proof verification, enabling fast, future-proof computation integrity.
Brakedown Achieves Post-Quantum Sublinear Polynomial Commitment without Trusted Setup
This new polynomial commitment scheme combines Reed-Solomon codes with Merkle trees, enabling post-quantum security and sublinear proof size.
