5 Commits

Author	SHA1	Message	Date
Daniel Lubarov	cb1c69e50f	Validate that the cosets for Plonk's permutation argument are disjoint ... When we had a large field, we could just pick random shifts, and get disjoint cosets with high probability. With a 64-bit field, I think the probability of a collision is non-negligible (something like 1 in a million), so we should probably verify that the cosets are disjoint. If there are any concerns with this method (or if it's just confusing), I think it would also be reasonable to use the brute force approach of explicitly computing the cosets and checking that they're disjoint. I coded that as well, and it took like 80ms, so not really a big deal since it's a one-time preprocessing cost. Also fixes some overflow bugs in the inversion code.	2021-04-04 14:34:33 -07:00
Daniel Lubarov	c25c689ef0	More tests, ported from plonky1	2021-04-02 17:49:57 -07:00
Daniel Lubarov	6c8dfb97ac	Refactor polynomial code	2021-03-30 13:30:31 -07:00
Daniel Lubarov	69b98623a1	Batch inverse (ported from plonky1)	2021-03-30 11:46:36 -07:00
Daniel Lubarov	13cc76316c	Initial commit	2021-02-17 14:36:32 -08:00