Transparent Polynomial Commitment Achieves Succinct Proofs without Trusted Setup
A novel polynomial commitment scheme achieves cryptographic transparency and logarithmic verification, eliminating the reliance on a trusted setup for scalable zero-knowledge proofs.
Hyper-Efficient Prover Unlocks Universal Transparent Zero-Knowledge Scaling
This new HyperPlonk scheme achieves linear prover time for universal transparent SNARKs, fundamentally accelerating verifiable computation for all decentralized applications.
