plonky2/src/gates/mod.rs

pub(crate) mod arithmetic;
pub mod constant;
pub(crate) mod fri_consistency_gate;
pub(crate) mod gate;
pub mod gmimc;
pub(crate) mod gmimc_eval;
mod interpolation_quartic;
pub(crate) mod noop;
Arithmetic & permutation gadgets 2021-04-02 15:29:21 -07:00			`pub(crate) mod arithmetic;`
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 constant;`
More prover work 2021-03-25 15:20:14 -07:00			`pub(crate) mod fri_consistency_gate;`
Initial commit 2021-02-09 21:25:21 -08:00			`pub(crate) mod gate;`
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 gmimc;`
No more polynomial programming abstraction It was too expensive. 2021-03-28 15:36:51 -07:00			`pub(crate) mod gmimc_eval;`
[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-17 09:06:17 -07:00			`mod interpolation_quartic;`
More prover work 2021-03-25 15:20:14 -07:00			`pub(crate) mod noop;`