From 0ad5c397e4b60fd9d9155ba46027d79ac1e983e7 Mon Sep 17 00:00:00 2001
From: Justin Thaler <39494992+GUJustin@users.noreply.github.com>
Date: Mon, 25 Mar 2024 13:17:16 -0400
Subject: [PATCH] Update sumcheck.md

---
 book/src/background/sumcheck.md | 4 +++-
 1 file changed, 3 insertions(+), 1 deletion(-)

diff --git a/book/src/background/sumcheck.md b/book/src/background/sumcheck.md
index 66d57c2c0..ea32b33fe 100644
--- a/book/src/background/sumcheck.md
+++ b/book/src/background/sumcheck.md
@@ -5,7 +5,9 @@ Suppose we are given a $v$-variate polynomial $g$ defined over a finite field $\
 
 $$ H := \sum_{b_1 \in \{0,1\}} \sum_{b_2 \in \{0,1\}} \cdots \sum_{b_v \in \{0,1\}} g(b_1, \ldots, b_v). $$
 
-In order to execute the protocol, the verifier needs to be able to evaluate $g(r_1, \ldots, r_v)$ for a randomly chosen vector $(r_1, \ldots, r_v) \in \mathbb{F}^v$ – see the paragraph preceding Proposition 1 below.
+In order to execute the protocol, the verifier needs to be able to evaluate $g(r_1, \ldots, r_v)$ for a randomly chosen vector $(r_1, \ldots, r_v) \in \mathbb{F}^v$. Hence, from the verifier's perspective, the sum-check protocol _reduces_ the task 
+of summing $g$'s evaluations over $2^v$ inputs (namely, all inputs in $\{0, 1}^{v}$) to the task of evaluating $g$
+at a \emph{single} input in $(r_1, \ldots, r_v) \in \mathbb{F}^v$.
 
 The protocol proceeds in $v$ rounds as follows. In the first round, the prover sends a polynomial $g_1(X_1)$, and claims that