zec
/
halo2
mirror of https://github.com/zcash/halo2.git
1
0
Fork 0
Code Issues Projects Releases Wiki Activity

Merge pull request #544 from zcash/book-patch-vanishing 

[book] Use more intuitive expression for vanishing poly degree
This commit is contained in:
Daira Hopwood 2022-04-22 16:46:39 +01:00 committed by GitHub
parent 66b2b3ba7e 8cb9226670
commit 66827f3df9
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
book/src/design/proving-system/vanishing.md
View File

@ -41,7 +41,7 @@ verifier samples $y$) linear combination of the circuit relations.
## Committing to $h(X)$
$h(X)$ has degree $(d - 1)n - d$ (because the divisor $t(X)$ has degree $n$). However, the
$h(X)$ has degree $d(n - 1) - n$ (because the divisor $t(X)$ has degree $n$). However, the
polynomial commitment scheme we use for Halo 2 only supports committing to polynomials of
degree $n - 1$ (which is the maximum degree that the rest of the protocol needs to commit
to). Instead of increasing the cost of the polynomial commitment scheme, the prover split