\textsf{Twist} and \textsf{Shout}: faster memory checking arguments via one-hot addressing and increments
From MaRDI portal
Publication:7443631
Cites work
- \textsf{Jolt}: SNARKs for virtual machines via lookups
- Algebrization: a new barrier in complexity theory
- Arya: nearly linear-time zero-knowledge proofs for correct program execution
- Checking the correctness of memories
- Computational Complexity
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
- scientific article; zbMATH DE number 4205986 (Why is no real title available?)
- HyperNova: recursive arguments for customizable constraint systems
- HyperPlonk: Plonk with linear-time prover and high-degree custom gates
- On Compressible Pairings and Their Computation
- Proofs for deep thought: accumulation for large memories and deterministic computations
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Unlocking the lookup singularity with \textsf{Lasso}
This page was built for publication: \textsf{Twist} and \textsf{Shout}: faster memory checking arguments via one-hot addressing and increments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7443631)