flâneur

PLONKish Arithmetization - The halo2 Book

zcash.github.io · 531 words · saved by 1 readers

The arithmetization used by Halo 2 comes from PLONK, or more precisely its extension UltraPLONK that supports custom gates and lookup arguments. We'll call it PLONKish. PLONKish circuits are defined in terms of a rectangular matrix of values. We refer to rows, columns, and cells of this matrix with the conventional meanings. A PLONKish circuit depends on a configuration: A finite field F, where cell values (for a given statement and witness) will be elements of F. The number of columns in the matrix, and a specification of each column as being fixed, advice, or instance. Fixed columns are fixed by the circuit; advice columns correspond to witness values; and instance columns are normally used for public inputs (technically, they can be used for any elements shared between the prover and verifier). A subset of the columns that can participate in equality constraints. A maximum constraint degree. A sequence of polynomial constraints. These are multivariate polynomials over F that must ev

PLONKish Arithmetization - The halo2 Book Keyboard shortcuts Press ← or → to navigate between chapters Press S or / to search in the book Press ? to show this help Press Esc to hide this help Auto Light Rust Coal Navy Ayu The halo2 Book PLONKish Arithmetization The arithmetization used by Halo 2 comes from PLONK , or more precisely its extension UltraPLONK that supports custom gates and lookup arguments. We’ll call it PLONKish . PLONKish circuits are defined in terms of a rectangular matrix of values. We refer to rows , columns , and cells of this matrix with the conventional meanings. A PLONK

related reading