10 stable releases
| new 1.4.1 | Apr 10, 2026 |
|---|---|
| 1.4.0 | Apr 8, 2026 |
| 1.1.6 | Mar 27, 2026 |
| 1.1.5 | Feb 11, 2026 |
| 0.0.13 |
|
#572 in Magic Beans
1,058 downloads per month
Used in 8 crates
(7 directly)
2MB
42K
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
- Apache License, Version 2.0, (LICENSE-APACHE or http://www.apache.org/licenses/LICENSE-2.0)
- MIT license (LICENSE-MIT or http://opensource.org/licenses/MIT)
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
~11–14MB
~184K SLoC