From add6a71352a94c8c682d195ec19bdfd4a6770c5b Mon Sep 17 00:00:00 2001
From: wenjin <71911495+wenjin1997@users.noreply.github.com>
Date: Sun, 26 Nov 2023 21:58:40 +0800
Subject: [PATCH 1/3] Update plonk-constraints.md
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

$$
{id_a}(X) = X, \quad {id_b}(X) = k_1\cdot X, \quad  {id_a}(X) = k_2\cdot X
$$
改为：
$$
{id_a}(X) = X, \quad {id_b}(X) = k_1\cdot X, \quad  {id_c}(X) = k_2\cdot X
$$
---
 src/plonk-intro-cn/plonk-constraints.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/plonk-intro-cn/plonk-constraints.md b/src/plonk-intro-cn/plonk-constraints.md
index 64bf755..895cb76 100644
--- a/src/plonk-intro-cn/plonk-constraints.md
+++ b/src/plonk-intro-cn/plonk-constraints.md
@@ -250,7 +250,7 @@ $$
 其中 $k_i$ 为互相不等的二次非剩余。
 
 $$
-{id_a}(X) = X, \quad {id_b}(X) = k_1\cdot X, \quad  {id_a}(X) = k_2\cdot X
+{id_a}(X) = X, \quad {id_b}(X) = k_1\cdot X, \quad  {id_c}(X) = k_2\cdot X
 $$
 
 这样一来，这三个多项式被大大简化，它们在 $X=\zeta$ 处的计算轻而易举，可以直接由 Verifier 完成。

From 648141d0018fb6d1daba3c2d49fcf4559d44d440 Mon Sep 17 00:00:00 2001
From: wenjin <71911495+wenjin1997@users.noreply.github.com>
Date: Sun, 26 Nov 2023 22:09:00 +0800
Subject: [PATCH 2/3] Update plonk-polycom.md

---
 src/plonk-intro-cn/plonk-polycom.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/plonk-intro-cn/plonk-polycom.md b/src/plonk-intro-cn/plonk-polycom.md
index 36af865..cb8b873 100644
--- a/src/plonk-intro-cn/plonk-polycom.md
+++ b/src/plonk-intro-cn/plonk-polycom.md
@@ -34,7 +34,7 @@ $$
 C_1 = \textrm{SHA256}(a_0\parallel a_1 \parallel a_2 \parallel \cdots \parallel a_n)
 $$
 
-或者，我们也可以使用 Petersen 承诺，通过一组随机选择的基，来计算一个 ECC 点：
+或者，我们也可以使用 Pedersen 承诺，通过一组随机选择的基，来计算一个 ECC 点：
 
 $$
 C_2 = a_0 G_0 + a_1  G_1 + \cdots + a_n G_n

From 66798220fe0959d590a3f8d1ad0251e79d9971ec Mon Sep 17 00:00:00 2001
From: wenjin <71911495+wenjin1997@users.noreply.github.com>
Date: Sun, 26 Nov 2023 22:20:09 +0800
Subject: [PATCH 3/3] Update plonk-randomizing.md

---
 src/plonk-intro-cn/plonk-randomizing.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/plonk-intro-cn/plonk-randomizing.md b/src/plonk-intro-cn/plonk-randomizing.md
index 4be1996..9e5489a 100644
--- a/src/plonk-intro-cn/plonk-randomizing.md
+++ b/src/plonk-intro-cn/plonk-randomizing.md
@@ -230,7 +230,7 @@ srs=\left(
     [1]_1, & [\chi]_1, & [\chi^2]_1, &\cdots, & [\chi^D]_1,\\
     [\rho]_1, & [\rho\chi]_1, & [\rho\chi^2]_1, &\cdots, & [\rho\chi^D]_1,\\
     \end{array}
-    \right),([1]_1, [\rho]_1,[1]_1,[\chi]_2)
+    \right),([1]_2, [\rho]_2,[1]_2,[\chi]_2)
 $$
 
 如果我们要承诺一个多项式 $f(X)=f_0+f_1X+\cdots+f_{n-1}X^{n-1}$，那么需要额外产生一个次数相同的 Blinder 多项式：