# Module binius_core::protocols::lasso

source · ## Expand description

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
this implementation relies on addition gadget in place of multiplicative group for the “counts”.
See `prove`

for in-depth details.

## Structs§

## Enums§

## Functions§

- Prove a Lasso instance reduction.
- Verify a Lasso instance reduction.