plonky2/src/field/mod.rs

pub mod crandall_field;
pub mod field;
pub mod fft;
pub(crate) mod cosets;

#[cfg(test)]
mod field_testing;
Split main into multiple binaries ... and other minor refactoring. `bench_recursion` will be the default bin run by `cargo run`; the otheres can be selected with the `--bin` flag. We could probably delete some of the other binaries later. E.g. `field_search` might not be useful any more. `bench_fft` should maybe be converted to a benchmark (although there are some pros and cons, e.g. the bench framework has a minimum number of runs, and isn't helpful in testing multi-core performance). 2021-04-06 13:14:59 -07:00			`pub mod crandall_field;`
			`pub mod field;`
			`pub mod fft;`
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 11:35:58 -07:00			`pub(crate) mod cosets;`
More tests, ported from plonky1 2021-04-02 17:49:51 -07:00
			`#[cfg(test)]`
			`mod field_testing;`