Bolt: faster SNARKs from sketched codes
From MaRDI portal
Cites work
- Algebraic methods for interactive proof systems
- Average spectra and minimum distances of low-density parity-check codes over Abelian groups
- BaseFold: efficient field-agnostic polynomial commitment schemes from foldable codes
- Blaze: fast SNARKs from interleaved RAA codes
- Brakedown: linear-time and field-agnostic SNARKs for R1CS
- BrakingBase -- a linear prover, poly-logarithmic verifier, field agnostic polynomial commitment scheme
- Computationally Sound Proofs
- Constant-round interactive proofs for delegating computation
- Fast Reed-Solomon interactive oracle proofs of proximity
- scientific article; zbMATH DE number 3174791 (Why is no real title available?)
- scientific article; zbMATH DE number 3437021 (Why is no real title available?)
- scientific article; zbMATH DE number 7250164 (Why is no real title available?)
- scientific article; zbMATH DE number 3251924 (Why is no real title available?)
- HyperPlonk: Plonk with linear-time prover and high-degree custom gates
- Interactive oracle proofs
- Interactive proofs of proximity: delegating computation in sublinear time
- LDPC codes achieve list decoding capacity
- Ligero: lightweight sublinear arguments without a trusted setup
- Linear prover IOPs in log star rounds
- Linear-time arguments with sublinear verification from tensor codes
- Linear-time encodable and decodable error-correcting codes
- Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
- Local proofs approaching the witness length
- On the Application of LDPC Codes to Arbitrary Discrete-Memoryless Channels
- Proving as fast as computing: succinct arguments with constant prover overhead
- Proximity gaps for Reed-Solomon codes
- Proximity testing with logarithmic randomness
- Some 3CNF Properties Are Hard to Test
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- STIR: Reed-Solomon proximity testing with fewer queries
- The exact complexity of pseudorandom functions and the black-box natural proof barrier for bootstrapping results in computational complexity
- Time-optimal interactive proofs for circuit evaluation
- Weight Distributions of Regular Low-Density Parity-Check Codes Over Finite Fields
- WHIR: Reed-Solomon proximity testing with super-fast verification
This page was built for publication: Bolt: faster SNARKs from sketched codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7443638)