Polynomial IOPs for memory consistency checks in zero-knowledge virtual machines
type: Item
instance of: scholarly article
title: Polynomial IOPs for memory consistency checks in zero-knowledge virtual machines
zbMATH Open document ID: 1548.68087
DOI: 10.1007/978-981-99-8724-5_4
author: Yuncong Zhang
author: Shi-Feng Sun
author: Ren Zhang
author: Dawu Gu
publication date: 2024-06-26T00:00:00Z
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7871947
zbMATH Keywords: proof system
zbMATH Keywords: SNARK
zbMATH Keywords: ZKVM
zbMATH Keywords: random access memory
MaRDI profile type: Publication
cites work: Computational Integrity with a Public Random String from Quasi-Linear PCPs
cites work: SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
cites work: Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
cites work: Arya: nearly linear-time zero-knowledge proofs for correct program execution
cites work: Fast reductions from RAMs to delegatable succinct constraint satisfaction problems
cites work: Aurora: transparent succinct arguments for R1CS
cites work: Transparent SNARKs from DARK compilers
cites work: Marlin: preprocessing zkSNARKs with universal and updatable SRS
cites work: \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
cites work: How To Prove Yourself: Practical Solutions to Identification and Signature Problems
cites work: Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
cites work: The knowledge complexity of interactive proof-systems
cites work: On the Size of Pairing-Based Non-interactive Arguments
cites work: Constant-Size Commitments to Polynomials and Their Applications
cites work: Q4002529
cites work: An algebraic framework for universal and updatable SNARKs
cites work: Spartan: efficient and general-purpose zkSNARKs without trusted setup
cites work: Polynomial IOPs for Linear Algebra Relations
cites work: Libra: succinct zero-knowledge proofs with optimal prover computation
description: scientific article; zbMATH DE number 7871947