From 41110d4ac9caae5ce5b10b00c96a4e4c530e6d5f Mon Sep 17 00:00:00 2001
From: Justin Thaler <39494992+GUJustin@users.noreply.github.com>
Date: Fri, 22 Mar 2024 14:57:49 -0400
Subject: [PATCH] Update lookups.md

tweaks for clarity
---
 book/src/how/lookups.md | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/book/src/how/lookups.md b/book/src/how/lookups.md
index 289ff2eb4..e9a77d3a6 100644
--- a/book/src/how/lookups.md
+++ b/book/src/how/lookups.md
@@ -1,8 +1,8 @@
 # Lookups
-Lasso is a lookup argument. Lookup arguments allow the prover to convince the verifier that a set of values $Q$ is a subset of a lookup table $T$. Lasso is a special lookup argument with highly desirable asymptotic costs largely correlated to the number of queries $Q$ rather than the length of of the table $T$.
+Lasso is a lookup argument (equivalent to a SNARK for reads into a read-only memory). Lookup arguments allow the prover to convince the verifier that a (committed) set of values $Q$ is a subset of a lookup table $T$. Lasso is a special lookup argument with highly desirable asymptotic costs largely correlated to the number of queries $Q$ rather than the length of of the table $T$.
 
 A conversational background on lookups can be found [here](https://a16zcrypto.com/posts/article/building-on-lasso-and-jolt/). In short: Lookups are great for zkVMs as they allow constant cost / developer complexity for the prover algorithm per VM instruction.
 
 ## Lasso
 A detailed engineering overview of Lasso can be found [here](https://www.youtube.com/watch?v=iDcXj9Vx3zY).
-![Lasso SVG](../imgs/lasso.svg)
\ No newline at end of file
+![Lasso SVG](../imgs/lasso.svg)