diff --git a/book/src/design/protocol.md b/book/src/design/protocol.md
index 20702996..c04de7c1 100644
--- a/book/src/design/protocol.md
+++ b/book/src/design/protocol.md
@@ -369,7 +369,7 @@ $$
 15. $\verifier$ responds with challenge $x_3$.
 16. $\prover$ sends $\mathbf{u} \in \field^{n_q}$ such that $\mathbf{u}_i = q_i(x_3)$ for all $i \in [0, n_q)$.
 17. $\verifier$ responds with challenge $x_4$.
-18. $\verifier$ set $P = Q' + x_4 \sum\limits_{i=0}^{n_q - 1} [x_4^i] Q_i$ and $v = $
+18. $\verifier$ sets $P = Q' + x_4 \sum\limits_{i=0}^{n_q - 1} [x_4^i] Q_i$ and $v = $
 $$
 \sum\limits_{i=0}^{n_q - 1}
 \left(
diff --git a/halo2_proofs/src/poly/commitment/verifier.rs b/halo2_proofs/src/poly/commitment/verifier.rs
index ebd687c1..5f0d26ef 100644
--- a/halo2_proofs/src/poly/commitment/verifier.rs
+++ b/halo2_proofs/src/poly/commitment/verifier.rs
@@ -24,8 +24,8 @@ pub struct Accumulator<C: CurveAffine, E: EncodedChallenge<C>> {
     /// The claimed output of the linear-time polycommit opening protocol
     pub g: C,
 
-    /// A vector of 128-bit challenges u_0, ..., u_{k - 1} sampled by the
-    /// verifier, to be used in computing G'_0.
+    /// A vector of challenges u_0, ..., u_{k - 1} sampled by the verifier, to
+    /// be used in computing G'_0.
     pub u_packed: Vec<E>,
 }