Polynomial IOPs for Linear Algebra Relations

Abstract

This paper proposes new Polynomial IOPs for arithmetic circuits. They rely on the monomial coefficient basis to represent the matrices and vectors arising from the arithmetic constraint satisfaction system, and build on new protocols for establishing the correct computation of linear algebra relations such as matrix-vector products and Hadamard products.

Our protocols give rise to concrete proof systems with succinct verification when compiled down with a cryptographic compiler whose role is abstracted away in this paper. Depending only on the compiler, the resulting SNARKs are either transparent or rely on a trusted setup.

Read the full text.

Authors

Alan Szepieniec, Yuncong Zhang

Published in

The International Conference on Practice and Theory of Public-Key Cryptography (PKC) 2022, March 2022

Preprint release date

Dec 2, 2021

Keywords

Zero-Knowledge, SNARK, Cryptography, Succinct Verification, Polynomial IOP

Other articles that you might like:

Lay Down the Common Metrics: Evaluating Proof-of-Work Consensus Protocols' Security
ShadowEth: Private Smart Contract on Public Blockchain
NC-Max: Breaking the Security-Performance Tradeoff in Nakamoto Consensus
SC2Share: Smart Contract for Secure Car Sharing

Polynomial IOPs for Linear Algebra Relations

Comments

Research

Issuing Assets on Bitcoin: A Simple Guide to Current Projects and Approaches

More from this blog

Satoshi Scoop Weekly, 6 Febuary 2026

Satoshi Scoop 周报, 2026 年 2 月 6 日

Satoshi Scoop Weekly, 30 January 2026

Satoshi Scoop 周报, 2026 年 1 月 30 日

Satoshi Scoop Weekly, 23 January 2026

Abstract

Authors

Published in

Preprint release date

Keywords

Command Palette

Comments

Research

Issuing Assets on Bitcoin: A Simple Guide to Current Projects and Approaches

More from this blog

Abstract

Authors

Published in

Preprint release date

Keywords