Module binius_core::protocols::lasso

Lasso lookup.

Lookup is a way to prove that all hypercube evaluations of a virtual polynomial $U$ are contained in the set of hypercube evaluations of the virtual polynomial $T$ (the “table”). The protocol itself is based on offline memory checking and described in the Section 4.4 of DP23, with the important distinction that instead of committing counts inverse and doing a zerocheck to prove that counts do not reside in the singleton orbit of zero (with respect to multiplication by generator) we perform a series of GKR prodchecks over counts to prove those are nonzero.

Structs

• LassoBatches
• LassoClaim
• LassoProof
• LassoProveOutput
• LassoWitness

Enums

• Error

Functions

• prove
  Prove a Lasso instance reduction.
• verify
  Verify a Lasso instance reduction.