plonky2
| Crates.io | plonky2 |
| lib.rs | plonky2 |
| version | 0.2.2 |
| source | src |
| created_at | 2023-01-30 20:41:42.109424 |
| updated_at | 2024-04-16 11:12:50.218338 |
| description | Recursive SNARKs based on PLONK and FRI |
| homepage | https://github.com/0xPolygonZero/plonky2 |
| repository | https://github.com/0xPolygonZero/plonky2 |
| max_upload_size | |
| id | 772081 |
| size | 1,363,904 |
Plonky2 - release (github:0xpolygonzero:plonky2-release)
documentation
README
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.