plonky2/README.md

# plonky2

plonky2 is an implementation of recursive arguments based on Plonk and FRI. It uses FRI to check systems of polynomial constraints, similar to the DEEP-ALI method described in the [DEEP-FRI](https://arxiv.org/abs/1903.12243) paper. It is the successor of [plonky](https://github.com/mir-protocol/plonky), which was based on Plonk and Halo.

plonky2 is largely focused on recursion performance. We use custom gates to mitigate the bottlenecks of FRI verification, such as hashing and interpolation. We also encode witness data in a ~64 bit field, so field operations take just a few cycles. To achieve 128-bit security, we repeat certain checks, and run certain parts of the argument in an extension field.


## Running

To see recursion performance, one can run this test, which generates a chain of three recursion proofs:

```sh
RUST_LOG=debug RUSTFLAGS=-Ctarget-cpu=native cargo test --release test_recursive_recursive_verifier -- --ignored
```


## Disclaimer

This code has not been thoroughly reviewed or tested, and should not be used in any production systems.
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			`# plonky2`

Tweak readme 2021-05-20 19:49:20 -07:00			`plonky2 is an implementation of recursive arguments based on Plonk and FRI. It uses FRI to check systems of polynomial constraints, similar to the DEEP-ALI method described in the [DEEP-FRI](https://arxiv.org/abs/1903.12243) paper. It is the successor of [plonky](https://github.com/mir-protocol/plonky), which was based on Plonk and Halo.`
Tweak readme 2021-05-20 19:42:10 -07:00
Tweak readme 2021-05-20 19:49:20 -07:00			`plonky2 is largely focused on recursion performance. We use custom gates to mitigate the bottlenecks of FRI verification, such as hashing and interpolation. We also encode witness data in a ~64 bit field, so field operations take just a few cycles. To achieve 128-bit security, we repeat certain checks, and run certain parts of the argument in an extension field.`
Update README 2021-05-05 19:24:04 -07:00

			`## Running`

Update running example 2021-08-19 08:27:14 -07:00			`To see recursion performance, one can run this test, which generates a chain of three recursion proofs:`
Update README 2021-05-05 19:24:04 -07:00
			```sh
Update running example 2021-08-19 08:27:14 -07:00			`RUST_LOG=debug RUSTFLAGS=-Ctarget-cpu=native cargo test --release test_recursive_recursive_verifier -- --ignored`
Update README 2021-05-05 19:24:04 -07:00			```
Licenses 2021-04-08 09:37:08 -07:00

			`## Disclaimer`

			`This code has not been thoroughly reviewed or tested, and should not be used in any production systems.`