plonky2/src/gates/mod.rs

// Gates have `new` methods that return `GateRef`s.
#![allow(clippy::new_ret_no_self)]

pub mod arithmetic_base;
pub mod arithmetic_extension;
pub mod arithmetic_u32;
pub mod assert_le;
pub mod base_sum;
pub mod comparison;
pub mod constant;
pub mod exponentiation;
pub mod gate;
pub mod gate_tree;
pub mod gmimc;
pub mod insertion;
pub mod interpolation;
pub mod low_degree_interpolation;
pub mod multiplication_extension;
pub mod noop;
mod packed_util;
pub mod poseidon;
pub(crate) mod poseidon_mds;
pub(crate) mod public_input;
pub mod random_access;
pub mod reducing;
pub mod reducing_extension;
pub mod subtraction_u32;
pub mod switch;
mod util;

#[cfg(test)]
mod gate_testing;
Fix some warnings (#94) 2021-07-15 07:34:46 -07:00			// Gates have `new` methods that return `GateRef`s.
			`#![allow(clippy::new_ret_no_self)]`

Bring back the base field arithmetic gate (#343) * Bring back the base field arithmetic gate * fix 2021-11-12 09:48:27 -08:00			`pub mod arithmetic_base;`
			`pub mod arithmetic_extension;`
U32ArithmeticGate 2021-09-28 16:57:22 -07:00			`pub mod arithmetic_u32;`
comparison gate 2021-10-12 11:41:34 -07:00			`pub mod assert_le;`
fmt 2021-10-12 11:41:52 -07:00			`pub mod base_sum;`
comparison gate 2021-09-13 12:13:32 -07:00			`pub mod comparison;`
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;`
initial version of exponentiation gate 2021-07-23 15:08:47 -07:00			`pub mod exponentiation;`
visibility 2021-08-19 11:22:06 -07:00			`pub mod gate;`
Working gate tree generation 2021-06-22 14:31:46 +02:00			`pub mod gate_tree;`
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;`
fixes 2021-07-09 16:31:19 -07:00			`pub mod insertion;`
Add interpolation gadgets 2021-06-11 16:22:29 +02:00			`pub mod interpolation;`
Change file structure 2021-11-22 11:39:56 +01:00			`pub mod low_degree_interpolation;`
MulExtensionGate 2021-11-19 09:31:06 +01:00			`pub mod multiplication_extension;`
visibility 2021-08-19 11:22:06 -07:00			`pub mod noop;`
Packed evaluation for most gates (#395) * Most gates support packed evaluation * ComparisonGate * Minor: outdated todo marker * Revert superfluous change * Post-merge fixes * Daniel comments * Minor: Markdown in comments 2021-12-20 15:08:07 -08:00			`mod packed_util;`
Semi-working 2021-09-16 17:51:07 +02:00			`pub mod poseidon;`
PoseidonMdsGate (#330) PoseidonGate's recursive evaluations were using a lot of gates, and the MDS layer was the main culprit. The other issue is that `constant_layer_recursive` creates a bunch of `ArithmeticGate`s with unique constants. We could either change `ArithmeticGate` to support different constants per operation, or wire in constants from `ConstantGate`, and change `ConstantGate` to support several constants per gate. This won't really help anything near term since we're still between 2^12 and 2^13, but could have some benefits later, depending on what recursion arities and security settings we end up using. `PoseidonMdsGate` needs `2 * D * WIDTH = 48` routed wires, and the combination of adding a gate and increasing routed wires slows down the prover a bit. So for now, I kept it at 28 wires, and the old code path is still used. 2021-11-02 08:16:28 -07:00			`pub(crate) mod poseidon_mds;`
Public inputs (#113) With this approach, we don't need `Target::PublicInput`; any routable `Target` can be marked as a public input via `register_public_input`. The circuit itself hashes these targets, and routes the hash output to the first four wires of a `PublicInputGate`, which is placed at an arbitrary location in the circuit. All gates have direct access to the purported hash of public inputs. We could think of them as accessing `PI_hash_i(x)` (as in Plonk), but these are now (four) constant functions, so they effectively have direct access to the hash itself. `PublicInputGate` checks that its first four wires match this purported public input hash. The other gates ignore the hash. Resolves #64. 2021-07-21 08:26:19 -07:00			`pub(crate) mod public_input;`
random access gate 2021-08-02 17:01:51 -07:00			`pub mod random_access;`
Working ReducingGate 2021-07-23 17:16:53 +02:00			`pub mod reducing;`
Add ReducingExtGate 2021-11-12 18:24:08 +01:00			`pub mod reducing_extension;`
U32 subtraction gate 2021-10-13 14:01:42 -07:00			`pub mod subtraction_u32;`
switch gate (in progress) 2021-08-18 17:46:38 -07:00			`pub mod switch;`
Change gate evaluation memory layout (#390) 2021-12-07 08:56:43 -08:00			`mod util;`
Finish up 2021-05-19 23:03:52 -07:00
			`#[cfg(test)]`
			`mod gate_testing;`