#plonk #snark #fri

no-std bin+lib plonky2

Recursive SNARKs based on PLONK and FRI

8 releases

new 0.2.2 Apr 16, 2024
0.2.1 Mar 21, 2024
0.2.0 Feb 21, 2024
0.1.4 Jul 31, 2023
0.1.1 Jan 30, 2023

#265 in Cryptography

Download history 158/week @ 2023-12-22 61/week @ 2023-12-29 22/week @ 2024-01-05 9/week @ 2024-01-12 55/week @ 2024-01-19 66/week @ 2024-01-26 18/week @ 2024-02-02 117/week @ 2024-02-09 335/week @ 2024-02-16 390/week @ 2024-02-23 321/week @ 2024-03-01 325/week @ 2024-03-08 359/week @ 2024-03-15 245/week @ 2024-03-22 312/week @ 2024-03-29 227/week @ 2024-04-05

1,195 downloads per month
Used in 8 crates (7 directly)

MIT/Apache

1.5MB
28K 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

~3.5–5MB
~98K SLoC