mirror of
https://github.com/saymrwulf/pasta_curves-source.git
synced 2026-09-04 20:03:39 +00:00
book: Describe a lookup table as representing a relation
Co-authored-by: Daira Hopwood <daira@jacaranda.org>
This commit is contained in:
parent
e1c770a591
commit
8f929888af
1 changed files with 4 additions and 0 deletions
|
|
@ -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
|
||||
|
|
|
|||
Loading…
Reference in a new issue