From f49deac5b1579de0c9ec12232db5f121846b5fba Mon Sep 17 00:00:00 2001
From: Justin Thaler <39494992+GUJustin@users.noreply.github.com>
Date: Sat, 23 Mar 2024 22:33:36 -0400
Subject: [PATCH] Update opts.md

---
 book/src/opts.md | 5 ++++-
 1 file changed, 4 insertions(+), 1 deletion(-)

diff --git a/book/src/opts.md b/book/src/opts.md
index 3b4e16473..4f50801ba 100644
--- a/book/src/opts.md
+++ b/book/src/opts.md
@@ -18,7 +18,10 @@ Below are known optimizations that we will be implementing in the coming weeks,
 
 - Switching the commitment scheme from Hyrax to one with much smaller commitments (e.g., HyperKZG, Zeromorph) will not only shorten the proofs, but also save the prover the time of serializing and hashing the commitments for Fiat-Shamir.
 
-    Anticipated speedup: 3% of total prover time. 
+    Anticipated speedup: 3% of total prover time.
+- In the first sum-check in Spartan, the prover pre-computes a table of evaluations of (the multilinear extension of) the equality function eq(a, b) with the first vector a fixed to a random value. Leaving a few variables off of b and handling them differently will reduce the cost of building this table to negligible.
+
+    Anticipated speedup: 1%-2% of total prover time. 
 
 - On reads to registers or RAM, the value written back to the memory cell by the memory-checking procedure is committed separately from the value returned by the read, and an R1CS constraint is included to force equality. Really, a single value can be committed and the constraint omitted.