From 0a2fb4781da16004909363d6ae6a03271e15a960 Mon Sep 17 00:00:00 2001 From: str4d Date: Sat, 13 Feb 2021 03:43:35 +1300 Subject: [PATCH] book: Small changes from review Co-authored-by: Daira Hopwood --- book/src/design/proving-system.md | 2 +- book/src/design/proving-system/inner-product.md | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) diff --git a/book/src/design/proving-system.md b/book/src/design/proving-system.md index a9c63b3..280b5cf 100644 --- a/book/src/design/proving-system.md +++ b/book/src/design/proving-system.md @@ -8,7 +8,7 @@ The Halo 2 proving system can be broken down into five stages: - Equality constraint permutations. - Products for each lookup argument. 2. Construct the vanishing argument to constrain all circuit relations to zero: - - Custom gates. + - Standard and custom gates. - Lookup argument rules. - Equality constraint permutation rules. 3. Evaluate the above polynomials at all necessary points: diff --git a/book/src/design/proving-system/inner-product.md b/book/src/design/proving-system/inner-product.md index 185fbf4..7ccc9b2 100644 --- a/book/src/design/proving-system/inner-product.md +++ b/book/src/design/proving-system/inner-product.md @@ -6,6 +6,6 @@ opening proofs, based around the Inner Product Argument. > TODO: Explain Halo 2's variant of the IPA. > > It is very similar to $\text{PC}_\text{DL}.\text{Open}$ from Appendix A.2 of [BCMS20]. -> See [this comparision](comparison.md#bcms20-appendix-a2) for details. +> See [this comparison](comparison.md#bcms20-appendix-a2) for details. > > [BCMS20]: https://eprint.iacr.org/2020/499