saymrwulf/pasta_curves-source
1
0
Fork 0
mirror of https://github.com/saymrwulf/pasta_curves-source.git synced 2026-09-07 20:30:34 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

book: Reword paragraph about degree of relation polynomials

Browse source
This commit is contained in:
Jack Grigg 2021-02-12 15:13:16 +00:00
parent 3181a21cba
commit 7820083c0d
1 changed files with 4 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

8
book/src/design/proving-system/vanishing.md
View file

@ -7,10 +7,10 @@ various circuit relations are satisfied:
- The rules of the lookup arguments. - The rules of the lookup arguments.
- The rules of the equality constraint permutations. - The rules of the equality constraint permutations.
Each of these relations is inherently represented as a polynomial of degree $d$ (the Each of these relations is represented as a polynomial of degree $d$ (the maximum degree
maximum degree of any of the relations). Given that the degree of the assignment of any of the relations) with respect to the circuit columns. Given that the degree of the
polynomials (over which these relations are built) is $n - 1$, the full polynomial assignment polynomials for each column is $n - 1$, the relation polynomials have degree
representing each relation has degree $d(n - 1)$. $d(n - 1)$ with respect to $X$.
> In our [example](../proving-system.md#example), these would be the gate polynomials, of > In our [example](../proving-system.md#example), these would be the gate polynomials, of
> degree $3n - 3$: > degree $3n - 3$: