book: Describe a lookup table as representing a relation

Co-authored-by: Daira Hopwood <daira@jacaranda.org>
This commit is contained in:
str4d 2020-12-11 18:34:59 +00:00 committed by GitHub
parent e1c770a591
commit 8f929888af
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23

View file

@ -4,4 +4,8 @@ In normal programs, you can trade memory for CPU to improve performance, by pre-
and storing lookup tables for some part of the computation. We can do the same thing in
halo2 circuits!
A lookup table can be thought of as enforcing a *relation* between variables, where the relation is expressed as a table.
Assuming we have only one lookup argument in our constraint system, the total size of tables is constrained by the size of the circuit:
each table entry costs one row, and it also costs one row to do each lookup.
TODO