6 Commits

Author	SHA1	Message	Date
wborgeaud	477fe1ea4a	Minor fixes	2021-05-06 15:14:43 +02:00
wborgeaud	a8c23a357e	Merge branch 'main' into fri-reduction-arity	2021-04-26 19:20:10 +02:00
wborgeaud	67aa704f6a	Working reduction arity	2021-04-26 18:24:57 +02:00
wborgeaud	49c116d7f6	Montgomery inversion in computation of barycentric weights + clean eval_naive method.	2021-04-26 09:13:28 +02:00
Daniel Lubarov	06bb902f23	Barycentric formula	2021-04-24 20:11:00 -07:00
Daniel Lubarov	035d15bc3d	Interpolants of arbitrary (point, value) lists ... Closes #10. This combines Lagrange interpolation with FFTs as mentioned there. I was previously thinking that all our polynomial encodings might as well just use power-of-two length vectors, so they'll be "FFT-ready", with no need to trim/pad. This sort of breaks that assumption though, as e.g. I think we'll want to compute interpolants with three coefficients in the batch opening argument. I think we can still skip trimming/padding in most cases, since it the majority of our polynomials will have power-of-two-minus-1 degrees with high probability. But we'll now have one or two uses where that's not the case.	2021-04-24 19:20:18 -07:00