Soloist: distributed snark for R1CS with constant proof size
From MaRDI portal
Cites work
- \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
- An algebraic framework for universal and updatable SNARKs
- Aurora: transparent succinct arguments for R1CS
- Bounded verification for finite-field-blasting. In a compiler for zero knowledge proofs
- Brakedown: linear-time and field-agnostic SNARKs for R1CS
- Constant-Size Commitments to Polynomials and Their Applications
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
- HyperPlonk: Plonk with linear-time prover and high-degree custom gates
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- On the size of pairing-based non-interactive arguments
- Orion: zero knowledge proof with linear prover time
- Polynomial IOPs for linear algebra relations
- Proofs for deep thought: accumulation for large memories and deterministic computations
- Samaritan: linear-time prover SNARK from new multilinear polynomial commitments
- Signatures of correct computation
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Transparent SNARKs from DARK compilers
- Unlocking the lookup singularity with \textsf{Lasso}
- Updatable and universal common reference strings with applications to zk-SNARKs
This page was built for publication: Soloist: distributed snark for R1CS with constant proof size
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7305283)
