plonky2/src/lib.rs

#![feature(destructuring_assignment)]

pub mod circuit_builder;
pub mod circuit_data;
pub mod copy_constraint;
pub mod field;
pub mod fri;
pub mod gadgets;
pub mod gates;
pub mod generator;
pub mod gmimc;
pub mod hash;
pub mod merkle_proofs;
mod merkle_tree;
mod permutation_argument;
pub mod plonk_challenger;
pub mod plonk_common;
pub mod polynomial;
pub mod proof;
pub mod prover;
pub mod recursive_verifier;
pub mod rescue;
pub mod target;
pub mod util;
pub mod vanishing_poly;
pub mod vars;
pub mod verifier;
pub mod wire;
pub mod witness;
Change `MulExtensionGate` to `ArithmeticExtensionGate` and change gadgets to use the new wires in this gate. 2021-06-23 18:04:43 +02:00			`#![feature(destructuring_assignment)]`

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 circuit_builder;`
			`pub mod circuit_data;`
Identify problem in GMiMc 2021-07-14 20:54:30 +02:00			`pub mod copy_constraint;`
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 field;`
			`pub mod fri;`
			`pub mod gadgets;`
			`pub mod gates;`
			`pub mod generator;`
			`pub mod gmimc;`
			`pub mod hash;`
Merge with merkle_proofs_2 2021-04-12 10:38:07 +02:00			`pub mod merkle_proofs;`
Progress on FRI 2021-04-21 22:31:45 +02:00			`mod merkle_tree;`
Port over some code for the permutation argument This is mostly copy/pasted from plonky1, although there are some differences. E.g. in plonky2 virtual targets are not routable, so they're no longer added as partitions. 2021-04-25 17:02:02 -07:00			`mod permutation_argument;`
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 plonk_challenger;`
			`pub mod plonk_common;`
			`pub mod polynomial;`
			`pub mod proof;`
			`pub mod prover;`
			`pub mod recursive_verifier;`
			`pub mod rescue;`
			`pub mod target;`
			`pub mod util;`
Almost working recursive verifier 2021-07-12 14:25:28 +02:00			`pub mod vanishing_poly;`
Progress on FRI 2021-04-21 22:31:45 +02:00			`pub mod vars;`
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 verifier;`
			`pub mod wire;`
			`pub mod witness;`