4 Commits

Author SHA1 Message Date
Daniel Lubarov
b535bf239a Minor 2021-05-19 12:24:19 -07:00
Daniel Lubarov
227c80c82e fmt 2021-05-19 12:10:41 -07:00
Daniel Lubarov
c6fa7eb18e Minor 2021-05-19 12:10:41 -07:00
Daniel Lubarov
0c91739b3b [DRAFT] Interpolation gate
Over quartic field extension (for now). This would be used in our FRI recursive verifier later, for the consistency check.

To summarize the wires,
- `n` inputs for the `n` points to interpolate (don't need `4n` since they'll be in the subgroup of the base field)
- `4n` inputs for the `n` (extension field) values to interpolate
- `4` inputs for the point to evaluate the interpolant at (beta, which will be drawn from the extension field right?)
- `4` outputs for the interpolated value
- `4n` internal wires for the interpolant's coefficients

This definitely isn't the most optimal approach, e.g. we could route in a single "base" point and derive its neighboring points, but just wanted to keep it simple for now.
2021-05-19 12:10:41 -07:00