#snark #plonk #fri

no-std bin+lib plonky2

Recursive SNARKs based on PLONK and FRI

5 releases

0.1.4 Jul 31, 2023
0.1.3 Feb 25, 2023
0.1.2 Feb 25, 2023
0.1.1 Jan 30, 2023
0.1.0 Jan 30, 2023

#3 in #plonk

Download history 51/week @ 2023-06-11 85/week @ 2023-06-18 87/week @ 2023-06-25 75/week @ 2023-07-02 150/week @ 2023-07-09 102/week @ 2023-07-16 53/week @ 2023-07-23 87/week @ 2023-07-30 82/week @ 2023-08-06 92/week @ 2023-08-13 48/week @ 2023-08-20 44/week @ 2023-08-27 66/week @ 2023-09-03 97/week @ 2023-09-10 60/week @ 2023-09-17 40/week @ 2023-09-24

264 downloads per month
Used in 4 crates

MIT/Apache

1MB
22K SLoC

Plonky2

Plonky2 is a SNARK implementation based on techniques from PLONK and FRI. It is the successor of Plonky, which was based on PLONK and Halo.

Plonky2 is built for speed, and features a highly efficient recursive circuit. On a Macbook Pro, recursive proofs can be generated in about 170 ms.

License

Licensed under either of

at your option.

Contribution

Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.

Dependencies

~5.5MB
~112K SLoC